Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-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 is continuous, topologically mixing, has dense periodic points and is sensitive; it is chaotic in the stated sense

Statement

Let X={0,1}Z, let d be the metric of The bilateral shift metric is a metric, cylinders are its basic balls, and the shift space is sequentially compact and let σ:X→X, σ(s)k=sk+1, be the bilateral shift of The bilateral two-symbol shift space, its metric, its shift map and its cylinder sets. Then:

  1. σ is continuous (Continuity of a map between metric spaces, at a point and globally, in the ε-δ form);
  2. σ is topologically mixing;
  3. the periodic points of σ are dense in X;
  4. σ has sensitive dependence on initial conditions with sensitivity constant δ=1;

consequently σ is chaotic in the stated sense (Topological mixing, dense periodic points, sensitive dependence, and the stated chaos list).

Facts & Assumptions

Given: The shift space (X,d), the shift map σ and the cylinders [w]p,q={s:sk=wk for p≤k≤q}.

[F2]

σ is a bijection with σ(s)k=sk+1 and inverse σ−1(s)k=sk−1; for m≥1, σm(s)k=sk+m (The bilateral two-symbol shift space, its metric, its shift map and its cylinder sets).

[F4]

A map g:X→X is continuous at s when for every ε>0 there is δ>0 with g(B(s,δ))⊆B(g(s),ε) (Continuity of a map between metric spaces, at a point and globally, in the ε-δ form, Open ball, closed ball and sphere in a metric space).

[F5]

A subset D⊆X is dense when every nonempty open subset meets D (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets).

[F6]

The list of properties defining "chaotic in the stated sense" is in Topological mixing, dense periodic points, sensitive dependence, and the stated chaos list: continuity, topological mixing, dense periodic points and sensitive dependence.

Proof

technique · direct; use cylinders as a basis and prescribe finitely many coordinates
1.1givenF1F2F3F4algebra

For s,t∈X and any m≥0, if sj=tj for ∣j∣≤m+1, then σ(s)j=σ(t)j for ∣j∣≤m; hence σ([s]Fm+1)⊆[σ(s)]Fm. By clause 2 of [F1], B(s,2−(m+1))⊆[s]Fm+1 and [σ(s)]Fm⊆B‾(σ(s),21−m), so d(s,t)<2−(m+1) implies d(σs,σt)≤21−m; given ε>0 choose m with 21−m<ε and δ=2−(m+1). This proves continuity at every s, which is clause 1.

1.2givenF1F2algebra

Let U,V⊆X be nonempty and open. By [F1] there are cylinders [w]p,q⊆U and [w′]p′,q′⊆V. Let n be an integer with (p,…,q)∩(p′+n,…,q′+n)=∅; this holds for every n>q−p′. Define s∈X by sk:=wk for p≤k≤q, sk:=wk−n′ for p′+n≤k≤q′+n, and sk:=0 for all remaining k; the two prescriptions are compatible because their index sets are disjoint. Then s∈[w]p,q, and for j∈[p′,q′] one has σn(s)j=sj+n=wj′, so σn(s)∈[w′]p′,q′. Hence σn(U)∩V≠∅ for every n>q−p′, which exhibits the integer N required by topological mixing.

1.3givenF1F2algebra

Let U⊆X be nonempty and open and choose a cylinder [w]p,q⊆U by [F1]; put L:=q−p+1≥1 and define s∈X by sk:=wp+((k−p) mod L), the L-periodic extension of the word w. Then sk=wk for p≤k≤q, so s∈[w]p,q⊆U, and sk+L=sk for every k; by [F2], σL(s)k=sk+L=sk for all k, so s is a periodic point of σ. Thus every nonempty open set meets Per⁡(σ), and [F5] gives clause 3.

1.4givenF2F3algebra

Let x∈X and ε>0; choose an integer k≥1 with 2−k<ε and define y∈X by yj:=xj for j≠k and yk:=1−xk. Then d(x,y)=2−k<ε because exactly one term of the defining sum is nonzero and equal to 2−k. Moreover σk(x)0=xk≠yk=σk(y)0, so in the defining sum for d(σkx,σky) the term with index 0 equals 20⋅1=1 and all terms are nonnegative; hence d(σkx,σky)≥1. Therefore δ=1 is a sensitivity constant, which is clause 4.

2.1step 1.11.21.31.4F6∎

Clauses 1-4 and [F6] give that σ is continuous, topologically mixing, has dense periodic points and is sensitive; by definition, σ is chaotic in the stated sense.

Remarks

  • Compactness of (X,d) is not used in the proof: mixing, density of periodic points and sensitivity are checked directly from cylinders. The companion lemma The bilateral shift metric is a metric, cylinders are its basic balls, and the shift space is sequentially compact proves that X is sequentially compact, and compact under the Axioms of Countable and Dependent Choice, so the example also matches the usual convention in which a chaotic system is a continuous self-map of a compact metric space.

  • The integer k in step 1.4 is positive, so the witness sequence y is obtained by flipping a coordinate in the future tail; flipping a coordinate at index k≤0 would instead give d(x,y)=2−∣k∣ but the displayed iterate argument uses σk with k≥1. The sensitivity constant 1 is not claimed to be optimal: any 0<δ≤1 is also a sensitivity constant, and no statement is made about the largest such constant.

Depends on

Dependency tree · 2 levels

Sources