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 has a compact coded invariant set conjugate to the two-sign shift, with chaos under
Statement
Fix , let , , let and 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 be the coded sequence of The square-root recurrence is a contraction of with a unique coded solution, let
and put . Then:
- , i.e. for every , and is invariant: ;
- is a continuous bijection of 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 exactly once, through the equivalence between closed and sequentially closed subsets of (A point lies in the closure of iff some sequence in converges to it, and a set is closed iff it is sequentially closed);
- 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 (), The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain), compact (Open cover, subcover, compact metric space, and compact subset of a metric space) and a continuous image of the compact space (The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset);
- (chaos) Granting the Axiom of Countable Choice as in clause 2, is continuous, topologically mixing, has dense periodic points, and has sensitive dependence on initial conditions with sensitivity constant ; hence is chaotic in the stated sense (Topological mixing, dense periodic points, sensitive dependence, and the stated chaos list).
Facts & Assumptions
Given: The parameter , the constants , the shift space with its shift and metric , the maps , , and of The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences, The square-root recurrence is a contraction of with a unique coded solution and Finite symbol windows determine the code: locality of the iterates, coding continuity and injectivity of , and .
Fixed point and coding data (The square-root recurrence is a contraction of with a unique coded solution, Finite symbol windows determine the code: locality of the iterates, coding continuity and injectivity of ): , , , , ; is a bijection with and ; is continuous and injective; and with a bijective isometry onto the published two-symbol space (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).
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 on is continuous, topologically mixing, has dense periodic points and is sensitive with constant ; is sequentially compact, with the diagonal construction using no choice principle, and compact under the Axioms of Countable and Dependent Choice.
Topological vocabulary (Topological mixing, dense periodic points, sensitive dependence, and the stated chaos list, Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets, Continuity of a map between metric spaces, at a point and globally, in the - form, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement, Convergence of a sequence in a metric space: iff in , Countably compact, sequentially compact and limit point compact metric spaces): the definitions of topological mixing, periodic points and their density, sensitivity, sequential compactness, continuity and open sets, and the fact that the closed subsets of a metric space are the complements of the open sets.
Sequential closure (A point lies in the closure of iff some sequence in 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: iff in ): a subset 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 ; 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.
Choice scope (The Axiom of Countable Choice (), The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain, Open cover, subcover, compact metric space, and compact subset of a metric space): is used once, in step 3.1, through the sequential-closure direction of [F4]; the compactness assertions of clause 3 use , and only through the published compactness of and the general fact that continuous images of compact spaces are compact.
Proof
Shift invariance of the code: fix and define for . Then, using and [F1], thus is a fixed point of in , and by the uniqueness clause of [F1] (via The square-root recurrence is a contraction of with a unique coded solution) , i.e. for all .
is continuous: has polynomial components, hence is continuous on , and a restriction of a continuous map is continuous (Continuity of a map between metric spaces, at a point and globally, in the - form).
Conjugacy identity: for , [F1] and step 1.1 give . Hence , and since is onto, for every the identity applied to gives ; therefore .
is a homeomorphism: is a continuous bijection of onto by [F1]. To prove that is continuous it suffices to prove that maps closed subsets of to closed subsets of . Let be closed. Then is sequentially compact: a sequence in has a subsequence converging in the sequentially compact space ([F2] and the isometry of [F1]), and the limit lies in because is closed and therefore sequentially closed by the choice-free direction of [F4]. The continuous image is sequentially compact: given a sequence with , pick a subsequence converging to some , then 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 provides. Moreover is sequentially closed: if a sequence in converges, then some subsequence converges to a point of 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 . By the direction of [F4] the sequentially closed set is closed in . Thus is a closed map, so is continuous and is a homeomorphism.
Sensitivity: let and ; choose with and let . Define by and for . Then agree for all , so by the coding-continuity clause of [F1] (Finite symbol windows determine the code: locality of the iterates, coding continuity and injectivity of ) one has . On the other hand and differ exactly at coordinate , so their signs at are opposite; by [F1], . Using step 2.1, and , so . Thus is a sensitivity constant.
is sequentially compact: is sequentially compact without choice ([F2]); since is a bijective isometry ([F1]), a sequence in is carried to a sequence in with a convergent subsequence whose preimage under converges in to the corresponding preimage limit; hence is sequentially compact. Applying the continuous-image argument of step 3.1 with shows that is sequentially compact.
is compact under [F5]: is compact by [F2]; since is a bijective isometry, a set is open exactly when is open, so the images under of an open cover of form an open cover of , whose finite subcover pulls back to a finite subcover of the original cover; hence 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 is compact.
Topological mixing of : let be nonempty and open in ; then and are nonempty open subsets of (step 3.1). Since is topologically mixing ([F2], transferred through the isometry of [F1] and the conjugacy ), there is with for every ; applying and step 2.1, for every .
Dense periodic points: a point is periodic for if and only if is periodic for , by the conjugacy of step 2.1 and the injectivity of ([F1]). Since is a bijection carrying the topology of 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 ([F2]) to a dense subset of consisting of periodic points of .
Conclusion: by steps 1.2, 4.3, 4.4 and 3.2, the restriction is continuous, topologically mixing, has dense periodic points and is sensitive with constant ; 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 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 through the published compactness of .
-
Sensitivity is proved by an explicit far-symbol flip, so no compactness or uniform continuity of is needed. The constant is not claimed to be optimal.
-
Clause 1 identifies as an invariant set of the polynomial map ; no claim is made that is an attractor, has full measure, or exhausts the non-wandering set of .
Depends on
The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences
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
The square-root recurrence is a contraction of with a unique coded solution
Finite symbol windows determine the code: locality of the iterates, coding continuity and injectivity of
Topological mixing, dense periodic points, sensitive dependence, and the stated chaos list
The bilateral two-symbol shift is continuous, topologically mixing, has dense periodic points and is sensitive; it is chaotic in the stated sense
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
Continuity of a map between metric spaces, at a point and globally, in the - form
Convergence of a sequence in a metric space: iff in
Countably compact, sequentially compact and limit point compact metric spaces
Open cover, subcover, compact metric space, and compact subset of a metric space
A point lies in the closure of iff some sequence in converges to it, and a set is closed iff it is sequentially closed
The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset
A sequence in a metric space has at most one limit
The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement
Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets
Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric
The Axiom of Countable Choice ()
The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain
Dependency tree · 2 levels
Sources
- G. Teschl, Ordinary Differential Equations and Dynamical Systems, AMS Graduate Studies in Mathematics 140 (author's preliminary online edition, complete PDF), Theorem 11.5 and Section 13.1, conjugacy of a horseshoe invariant set with the two-sided shift
- P. Cvitanović, R. Artuso, R. Mainieri, G. Tanner, G. Vattay, Chaos: Classical and Quantum (ChaosBook.org, edition 17.6.8, complete PDF), Chapter 15 Sections 15.2-15.3, the complete Smale horseshoe and its binary symbolic dynamics
- R. Devaney and Z. Nitecki, Shift automorphisms in the Hénon mapping, Communications in Mathematical Physics 67 (1979) 137-146, the invariant set of the quadratic map is conjugate to the shift for large parameters