Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The bilateral two-symbol shift space, its metric, its shift map and its cylinder sets

Definition

Let

X:={0,1}Z={ s  :  s is a function Z→{0,1} }

be the set of bi-infinite binary sequences, with the function-set convention of The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}; for s∈X write sk:=s(k) for the value at the integer k. Define

d(s,t):=∑k=0∞2−k ∣sk−tk∣  +  ∑k=1∞2−k ∣s−k−t−k∣(s,t∈X).

Both series converge by comparison with the geometric series ∑k≥02−k=2 (Series, partial sums, convergence and the sum, divergence, and the tail series, For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥1 the series diverges, Integer powers am, Absolute value in an ordered field), since ∣sj−tj∣∈{0,1} for every j∈Z; hence d(s,t) is a well-defined real number. That d is a metric on X is proved in the companion lemma The bilateral shift metric is a metric, cylinders are its basic balls, and the shift space is sequentially compact ↗ and is not part of this definition.

The (bilateral) shift is the map

σ:X⟶X,σ(s)k:=sk+1(k∈Z, s∈X).

For n≥1 the n-fold iterate is written σn, defined by σ1:=σ and σn+1:=σ∘σn; a point s∈X is periodic when σn(s)=s for some n≥1.

A cylinder is a set of the form

[w]p,q:={ s∈X  :  sk=wk for p≤k≤q },

where p≤q are integers and w=(wp,…,wq)∈{0,1}{p,…,q} is a finite binary word; the integers p,q and the word w are part of the data. When p=q this is the set of sequences with prescribed value at the single coordinate p.

Remarks

Depends on

Dependency tree · 2 levels

Sources