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 quadratic map F(x,y)=(y,y2−a−x) has a compact coded invariant set conjugate to the two-sign shift, with chaos under ACω

Statement

Fix a≥100, let R=a+3, L=a−2R, let X± and S± be the two-sign bilateral shift space and its shift (The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences), let x(s)∈BR be the coded sequence of The square-root recurrence Ts(x)n=sna+xn−1+xn+1 is a contraction of BR with a unique coded solution, let

F(x,y):=(y,  y2−a−x),h(s):=(x−1(s), x0(s))(s∈X±),

and put Λ:=h(X±)⊆R2. Then:

  1. F∘h=h∘S±, i.e. F(h(s))=h(S±s) for every s∈X±, and Λ is invariant: F(Λ)=Λ;
  2. h is a continuous bijection of (X±,D±) onto Λ; it is a homeomorphism onto Λ with the Euclidean metric (Continuity of a map between metric spaces, at a point and globally, in the ε-δ form) once the Axiom of Countable Choice is granted, since the proof uses ACω exactly once, through the equivalence between closed and sequentially closed subsets of R2 (A point lies in the closure of A iff some sequence in A converges to it, and a set is closed iff it is sequentially closed);
  3. Λ is sequentially compact (Countably compact, sequentially compact and limit point compact metric spaces) and, granting the Axioms of Countable and Dependent Choice (The Axiom of Countable Choice (ACω), The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain), compact (Open cover, subcover, compact metric space, and compact subset of a metric space) and a continuous image of the compact space X± (The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset);
  4. (chaos) Granting the Axiom of Countable Choice as in clause 2, F∣Λ:Λ→Λ is continuous, topologically mixing, has dense periodic points, and has sensitive dependence on initial conditions with sensitivity constant 2L; hence F∣Λ is chaotic in the stated sense (Topological mixing, dense periodic points, sensitive dependence, and the stated chaos list).

Facts & Assumptions

[F1]

Fixed point and coding data (The square-root recurrence Ts(x)n=sna+xn−1+xn+1 is a contraction of BR with a unique coded solution, Finite symbol windows determine the code: locality of the iterates, coding continuity and injectivity of h(σ)=(x−1(σ),x0(σ))): Ts(BR)⊆BR, Tsx(s)=x(s), sign⁡xn(s)=sn, ∣xn(s)∣≥L, xn+1(s)=xn(s)2−a−xn−1(s); F is a bijection with F−1(x,y)=(x2−a−y,x) and F(xn−1(s),xn(s))=(xn(s),xn+1(s)); h is continuous and injective; and D±(s,t)=d2(φ(s),φ(t)) with φ a bijective isometry onto the published two-symbol space X2 (The bounded functions on a set form a complete metric space in the supremum metric, and the coding map of the two-sign shift space is an isometry, clause 3).

[F2]

The published shift data (The bilateral two-symbol shift space, its metric, its shift map and its cylinder sets, The bilateral shift metric is a metric, cylinders are its basic balls, and the shift space is sequentially compact, The bilateral two-symbol shift is continuous, topologically mixing, has dense periodic points and is sensitive; it is chaotic in the stated sense): the two-symbol shift σ2 on X2 is continuous, topologically mixing, has dense periodic points and is sensitive with constant 1; X2 is sequentially compact, with the diagonal construction using no choice principle, and compact under the Axioms of Countable and Dependent Choice.

[F4]

Sequential closure (A point lies in the closure of A iff some sequence in A converges to it, and a set is closed iff it is sequentially closed, A sequence in a metric space has at most one limit, Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R): a subset A of a metric space is closed if and only if it is sequentially closed, i.e. contains the limit of every convergent sequence with values in A; the implication "sequentially closed ⇒ closed" is the direction proved from the Axiom of Countable Choice, while the converse direction is choice-free, and limits of convergent sequences in a metric space are unique.

[F5]

Choice scope (The Axiom of Countable Choice (ACω), The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain, Open cover, subcover, compact metric space, and compact subset of a metric space): ACω is used once, in step 3.1, through the sequential-closure direction of [F4]; the compactness assertions of clause 3 use ACω+DC, and only through the published compactness of X2 and the general fact that continuous images of compact spaces are compact.

Proof

technique · direct; prove the conjugacy identity by uniqueness of the fixed point, then transfer compactness and the chaos properties through the coding homeomorphism and exhibit sensitivity by flipping a distant symbol
1.1givenF1algebra

Shift invariance of the code: fix s∈X± and define yn:=xn+1(s) for n∈Z. Then, using TS±s and [F1], (TS±sy)n=(S±s)na+yn−1+yn+1=sn+1a+xn(s)+xn+2(s)=(Tsx(s))n+1=xn+1(s)=yn; thus y is a fixed point of TS±s in BR, and by the uniqueness clause of [F1] (via The square-root recurrence Ts(x)n=sna+xn−1+xn+1 is a contraction of BR with a unique coded solution) y=x(S±s), i.e. xn(S±s)=xn+1(s) for all n.

1.2givenF3

F∣Λ is continuous: F has polynomial components, hence is continuous on R2, and a restriction of a continuous map is continuous (Continuity of a map between metric spaces, at a point and globally, in the ε-δ form).

2.1step 1.1F1

Conjugacy identity: for s∈X±, [F1] and step 1.1 give F(h(s))=F(x−1(s),x0(s))=(x0(s),x1(s))=(x−1(S±s),x0(S±s))=h(S±s). Hence F(h(X±))⊆h(X±), and since S± is onto, for every h(s)∈h(X±) the identity applied to S±−1s gives h(s)=F(h(S±−1s))∈F(h(X±)); therefore F(Λ)=Λ.

3.1givenstep 2.1F1F2F3F4

h is a homeomorphism: h is a continuous bijection of X± onto Λ by [F1]. To prove that h−1 is continuous it suffices to prove that h maps closed subsets of X± to closed subsets of R2. Let C⊆X± be closed. Then C is sequentially compact: a sequence in C has a subsequence converging in the sequentially compact space X± ([F2] and the isometry φ of [F1]), and the limit lies in C because C is closed and therefore sequentially closed by the choice-free direction of [F4]. The continuous image h(C) is sequentially compact: given a sequence (h(xk)) with xk∈C, pick a subsequence xkj converging to some x∈C, then h(xkj)→h(x)∈h(C) by continuity (Countably compact, sequentially compact and limit point compact metric spaces, Continuity of a map between metric spaces, at a point and globally, in the ε-δ form); no choice is used beyond the single subsequence selection that sequential compactness of C provides. Moreover h(C) is sequentially closed: if a sequence in h(C) converges, then some subsequence converges to a point of h(C) by the previous paragraph (with that sequence in place of the given one), and the whole sequence has the same limit by uniqueness of limits ([F4]); hence the limit lies in h(C). By the ACω direction of [F4] the sequentially closed set h(C) is closed in R2. Thus h is a closed map, so h−1 is continuous and h is a homeomorphism.

3.2givenstep 2.1F1F3algebra

Sensitivity: let z=h(s)∈Λ and ε>0; choose m≥0 with 42 RL−m<ε and let k≥m+1. Define t∈X± by tk:=−sk and tj:=sj for j≠k. Then s,t agree for all ∣j∣≤m, so by the coding-continuity clause of [F1] (Finite symbol windows determine the code: locality of the iterates, coding continuity and injectivity of h(σ)=(x−1(σ),x0(σ))) one has ∥h(s)−h(t)∥2≤42 RL−m<ε. On the other hand S±ks and S±kt differ exactly at coordinate 0, so their signs at 0 are opposite; by [F1], ∣x0(S±ks)−x0(S±kt)∣≥∣x0(S±ks)∣+∣x0(S±kt)∣≥2L. Using step 2.1, Fk(z)=Fk(h(s))=h(S±ks) and Fk(h(t))=h(S±kt), so ∥Fk(z)−Fk(h(t))∥2≥∣x0(S±ks)−x0(S±kt)∣≥2L. Thus 2L is a sensitivity constant.

4.1givenstep 3.1F1F2F3

Λ is sequentially compact: X2 is sequentially compact without choice ([F2]); since φ:X±→X2 is a bijective isometry ([F1]), a sequence in X± is carried to a sequence in X2 with a convergent subsequence whose preimage under φ converges in X± to the corresponding preimage limit; hence X± is sequentially compact. Applying the continuous-image argument of step 3.1 with C=X± shows that Λ=h(X±) is sequentially compact.

4.2step 2.1step 3.1F2F3F5

Λ is compact under ACω+DC [F5]: X2 is compact by [F2]; since φ is a bijective isometry, a set U⊆X± is open exactly when φ(U)⊆X2 is open, so the images under φ of an open cover of X± form an open cover of X2, whose finite subcover pulls back to a finite subcover of the original cover; hence X± is compact. A continuous image of a compact space is compact by The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset, so Λ=h(X±) is compact.

4.3givenstep 2.1step 3.1F1F2F3

Topological mixing of F∣Λ: let U,V⊆Λ be nonempty and open in Λ; then h−1(U) and h−1(V) are nonempty open subsets of X± (step 3.1). Since S± is topologically mixing ([F2], transferred through the isometry φ of [F1] and the conjugacy S±=φ−1∘σ2∘φ), there is N with S±n(h−1(U))∩h−1(V)≠∅ for every n≥N; applying h and step 2.1, Fn(U)∩V=h(S±n(h−1(U))∩h−1(V))≠∅ for every n≥N.

4.4step 2.1step 3.1F1F2F3

Dense periodic points: a point s is periodic for S± if and only if h(s) is periodic for F∣Λ, by the conjugacy of step 2.1 and the injectivity of h ([F1]). Since h is a bijection carrying the topology of X± onto that of Λ (steps 2.1, 3.1 and Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets), it maps the dense set of periodic points of S± ([F2]) to a dense subset of Λ consisting of periodic points of F∣Λ.

5.1step 2.1step 1.2step 3.1step 4.1step 4.2step 4.3step 4.4step 3.2F3∎

Conclusion: by steps 1.2, 4.3, 4.4 and 3.2, the restriction F∣Λ is continuous, topologically mixing, has dense periodic points and is sensitive with constant 2L; by the definition of Topological mixing, dense periodic points, sensitive dependence, and the stated chaos list it is chaotic in the stated sense, and clauses 1-4 are proved.

Remarks

  • The proof uses ACω once in the homeomorphism claim of clause 2; the mixing and dense-periodic-point deductions in clause 4 use that homeomorphism. Sensitivity is proved directly and does not use choice. Compactness in clause 3 additionally uses ACω+DC through the published compactness of X2.

  • Sensitivity is proved by an explicit far-symbol flip, so no compactness or uniform continuity of h−1 is needed. The constant 2L is not claimed to be optimal.

  • Clause 1 identifies Λ as an invariant set of the polynomial map F; no claim is made that Λ is an attractor, has full measure, or exhausts the non-wandering set of F.

Depends on

Dependency tree · 2 levels

Sources