palimpsest

For each unordered class of symbols S

there exists a class S₁ whose members

are ordered classes of those symbols.

For example:

where S equals A,B,C

S₁ equals {(A,B,C), (A,C,B), (B,A,C), (B,C,A), (C,A,B), (C,B,A)}.

Where S equals 0,1

S₁ equals {(0,1), (1,0)}.

All S₁ are equivalent across all S.

For each member of S₁

there exists a class W (called Omega)

of N length symbol strings

where N equals {1, 2, 3, . . .}.

This class is a poem,

the Omega poem,

for that member of S_1.

The Omega poems in binary form

are {0, 1, 00, 01, 10, 11, 000, . . .} and

{1, 0, 11, 10, 01, 00, 111, . . .}.

Each of these poems

contains all digital images,

all digital sounds,

all digital texts.