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.
Cm Math Chaos
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Cm Math Balances
- Cm Math Canonical
- Cm Math Dynamics
- Cm Math Geometry
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Determinants of Matrices over a Commutative Ring
- Distributions Test Functions and Differentiation
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Euclidean Ordinary Differential Equations with Smooth Dependence
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hamiltonian Mechanics and Completely Integrable Systems
- Hereditary and Productive Behaviour of the Separation Axioms
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Rank Theorems and Embedded Submanifolds
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Schwartz Space and the Plancherel Theorem
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Smooth Vector Bundles and Sections
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Symplectic Manifolds, Moser Stability, and Darboux–Weinstein Theory
- Tangent Cotangent and the Differential
- Tensor Fields Exterior Algebra and Differential Forms
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Exterior Derivative and Cartan Calculus
- The Fundamental Theorems of Calculus
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Fields Flows and Lie Derivatives
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
The chaotic layer of the non-relativistic classical mechanics collection, all
of it mathematics: the coded invariant set of the area-preserving quadratic
map, its conjugacy with the two-sign shift, its transverse homoclinic points,
and the persistence of all of this for maps -close to the quadratic
family, realised by the stroboscopic map of a smooth periodically pulsed
oscillator. Every item carries domain: mathematics, depends only on
mathematical suppliers, and contains no postulate, measurement or empirical
statement; the mechanical reading of the pulsed oscillator belongs to the
consuming physics pages, which supply their own units and scope.
Symbolic coding. The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences introduces the two-sign bilateral shift space , its shift , the isometry onto the published two-symbol shift space, and the closed ball of bounded bilateral 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 proves that the bounded functions on an arbitrary nonempty set form a complete metric space in the supremum metric, that every closed ball is complete, and that is a bijective isometry; this is the only point of contact with the published shift space, through which all its metric and chaos properties transfer. The square-root recurrence is a contraction of with a unique coded solution then shows that the square-root recurrence defines, for , a contraction of with constant , : each code has a unique solution with , and . Finite symbol windows determine the code: locality of the iterates, coding continuity and injectivity of shows that the -th iterate from the zero sequence sees only a window of symbols, with uniform error , and deduces that the coding map is continuous and injective.
The coded invariant set. The quadratic map has a compact coded invariant set conjugate to the two-sign shift, with chaos under proves that satisfies and that is invariant. Granting the Axiom of Countable Choice once, through the equivalence between closed and sequentially closed subsets of , is a homeomorphism onto , so mixing and density of periodic points transfer from the shift; the theorem states these properties and the resulting chaos condition under . The set is sequentially compact without choice and compact under . Sensitivity with constant is proved by an explicit symbol flip. Constant codes give the fixed points, and finite nonconstant word codes give homoclinic orbits converging to a fixed point at both ends identifies the constant codes with the hyperbolic fixed points , , and shows that every code that is constant outside a finite set but not constant gives a homoclinic point of the corresponding fixed point, with uniform two-sided convergence and infinitely many distinct such points.
Cones, slope fields and coded curves. Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family defines hyperbolic fixed points, the cones and with , and slope maps and . It distinguishes from the pointwise inverse matrix , defines invariant line fields along a sequence with the inverse derivative evaluated at the correct orbit point, and defines stable and unstable sets for global bijections and local planar diffeomorphisms. Transversality is defined using curves in the plane. Cone invariance and expansion, and convergence of the slope graph transforms to unique invariant stable and unstable line fields proves cone invariance and expansion under the aperture condition , the slope contractions with factor , and uniform convergence of the slope iterations to the unique invariant line fields with slopes in . Weighted half-tail contractions for give a unique curve with tangent slope bounded by gives the abstract half-tail construction: for compact update intervals it applies the Banach fixed-point theorem on a closed weighted ball and a local parameter interval to produce a family of solutions with derivative bounded by . The coded curves are genuine stable and unstable curves of , with transverse intersection at every finite-word homoclinic point applies it to the quadratic family to obtain stable and unstable curves through every finite-word homoclinic point, with tangents in cones of aperture , and identifies the local stable set of each fixed point with the constructed graph over in the coordinate max norm. The local unstable set is its reflection. Transversality of the tangent lines then makes every finite-word point a transverse homoclinic point.
Persistence and the smooth realisation. A map -close to has a unique inverse branch for its first component, with derivative bounds solves the first component of a map close to by a contraction, giving a unique inverse branch with estimates. Root bounds and dependence for the perturbed scalar recurrence shows that the perturbed scalar recurrence has, for each sign, exactly one root in the corresponding window, with explicit margins , derivative bounds , and exact orbit form . Explicit persistence under the stated forward and conjugated-inverse bounds: coded chaos, hyperbolic fixed points and transverse homoclinic points constructs, for every diffeomorphism satisfying six explicit closeness inequalities with and , where is the defect-bound constant of Root bounds and dependence for the perturbed scalar recurrence (and the same bounds for the distinct map ), a coded invariant set on which is conjugate to the shift. Under it is mixing with dense periodic points and chaotic with sensitivity constant ; its constant codes give hyperbolic fixed points, and its finite-word codes give transverse homoclinic points. No structural-stability theorem is invoked. The smooth -periodic pulsed oscillator: the normalized pulse, its Hamiltonian and its stroboscopic (period) map defines the smooth -periodic pulsed oscillator with phase form and Hamiltonian convention , using a normalized bump pulse of strength . The rescaled pulse endpoint map converges to the kick in , and the period map is smooth, symplectic and -close to proves that the rescaled pulse endpoint map converges to the kick in as , that the period map is a symplectic diffeomorphism close to with its conjugate map also close to , and A smooth periodic one-degree-of-freedom oscillator with polynomial pulse forcing has stroboscopic chaos and a transverse homoclinic point concludes that, for all sufficiently small , this stroboscopic map has a coded chaotic invariant set and transverse homoclinic points, with the inherited Axioms of Countable and Dependent Choice for the coding homeomorphism and compactness.
The companion page cm-math-chaos-examples records explicit finite checks: the constants and constant-code solutions at , the invariant slope and cone margins, the single-flip homoclinic code, the endpoint computation , and the perturbed root and margin numbers.
3 · Logical flowchart
4 · Definitions, postulates, theorems and proofs
The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences
Definition
Write and
with the function-set convention of The vector space of all functions with pointwise operations, and as the case ; for write . The elements of are called two-sign bilateral sequences.
Coding correspondence with the two-symbol space. Let
and let , and be the set, the metric expression and the shift map of The bilateral two-symbol shift space, its metric, its shift map and its cylinder sets. The formulas and define maps and that are inverse to each other, coordinate by coordinate.
Metric expression on . Define
Unwinding the series of The bilateral two-symbol shift space, its metric, its shift map and its cylinder sets and using for every gives the explicit expression
Both series converge by comparison with the geometric series (Series, partial sums, convergence and the sum, divergence, and the tail series, For , , and for the series diverges, Integer powers , Absolute value in an ordered field), because for every ; hence is a well-defined nonnegative real number. Whether is a metric is not asserted here; it is proved in the companion lemma on this page, together with the statement that is an isometry of onto .
The shift. The (bilateral) shift of is
For its iterate satisfies ; in particular is a bijection with inverse , and .
Bounded bilateral sequences. A function is bounded when its range is a bounded subset of (Lower bound, bounded below, bounded set). Write
The set whose supremum is taken is nonempty and bounded above (Lower bound, bounded below, bounded set), so is a well-defined nonnegative real number (Suprema and infima are unique, Complete ordered field (least-upper-bound property)). For put
Thus is the closed ball of radius in the supremum norm, and is by definition the statement that for every (Lower bound, bounded below, bounded set, Absolute value in an ordered field).
Remarks
-
The only difference between and the is the relabelling , of the two symbols: is a bijection satisfying . Every metric, compactness or chaos statement about the two-symbol shift therefore transfers through once it is known that is an isometry, which is the content of 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.
-
No measure, probability or invariant measure on is introduced; all statements on this page are topological or metric.
-
The space and its closed ball are used to state the square-root recurrence of The square-root recurrence is a contraction of with a unique coded solution; nothing in this definition asserts that is complete, which is a separate lemma.
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
Statement
Let be a nonempty set, let be the set of bounded functions and let be the supremum metric on (The supremum metric is a metric on the bounded real-valued functions on a nonempty set); write for the zero function. For put
Let , , , , be as in The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences. Then:
- is a complete metric space (Complete metric space: every Cauchy sequence converges in the space);
- for every , is a complete metric space;
- is a metric on (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric), and is a bijective isometry (Convergence of a sequence in a metric space: iff in for the underlying notion of distance);
- consequently with the distance is a complete metric space, is complete for every , and the same holds for the one-sided bounded sequences, that is for .
Facts & Assumptions
Given: A nonempty set , the space of bounded real functions on with supremum metric , the numbers , and the objects of The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences.
is a metric on and (The supremum metric is a metric on the bounded real-valued functions on a nonempty set, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric); the defining set is nonempty and bounded above, its supremum exists and is unique (Suprema and infima are unique, Complete ordered field (least-upper-bound property), Lower bound, bounded below, bounded set).
is a metric on (The bilateral shift metric is a metric, cylinders are its basic balls, and the shift space is sequentially compact, clause 1) and by definition of ; is a bijection with inverse (The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences).
Cauchy sequences, convergence and completeness are those of Cauchy sequence in a metric space, Convergence of a sequence in a metric space: iff in and Complete metric space: every Cauchy sequence converges in the space; a sequence in a metric space converges to exactly when the distances to tend to .
Every Cauchy sequence of reals converges to a real number (The Cauchy criterion from the least-upper-bound property: in a complete ordered field every Cauchy sequence converges, Sequences of reals: bounded, eventually, frequently, tails, subsequences).
Limits preserve eventual inequalities: if the real sequences and converge and eventually, then (Limits preserve non-strict inequalities, Sequences of reals: bounded, eventually, frequently, tails, subsequences).
Absolute value: , exactly for , , and exactly when for (Absolute value in an ordered field, Basic properties of the absolute value, The triangle inequality).
Proof
Let be a Cauchy sequence in and fix . For all one has and therefore by [F1] and [F6]. Hence is a Cauchy sequence of reals, so it converges; define . This defines a function .
Isometry property: for put . Then if and only if (by [F2], [F6] and definiteness of ), if and only if since is injective ([F2]). Symmetry holds because is symmetric, and the triangle inequality follows from that of : ([F2], [F6]). Finally says exactly that the bijection preserves distances, so it is an isometry onto .
Boundedness of : since is Cauchy, there is with for all ; then for all and all , where because is bounded ([F1], [F6]). For fixed , the bounds pass to the limit by [F5], giving , hence by [F6]. Thus .
Uniform error estimate: given , choose with for all . Fix and ; then for every ([F1], [F6]), thus . Passing these inequalities to the coordinate limit with [F5] gives , or by [F6]. Taking the supremum over in [F1] gives for every , so in .
The space is complete: if is Cauchy in , then by steps 2.1 and 3.1 its pointwise limit lies in and ; for each one has for all , so [F5] gives , hence by [F6]; hence and the Cauchy sequence converges inside .
Conclusion. Clause 1 is proved by steps 1.1, 2.1 and 3.1: the pointwise limit of a Cauchy sequence of bounded functions is bounded (step 2.1) and is the uniform limit (step 3.1). Clause 2 is step 4.1, and clause 3 is step 1.2. For clause 4, take : by the definitions of The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences the space is exactly and , so clauses 1 and 2 give completeness of and of each , ; with the same identifications give the one-sided statement, the argument being identical since it never uses any structure of the index set beyond its nonemptiness.
Remarks
-
The proof is a coordinatewise limit argument plus one uniform two-index estimate; no choice principle is used, since the limit function is defined by the uniquely determined real limits of the coordinate sequences.
-
Clause 3 is the only point of contact between the two-sign space and the published two-symbol space: because is a bijective isometry, every metric statement about transfers verbatim, and it will be used in this form for sequential compactness and for the chaos properties of the shift.
The square-root recurrence is a contraction of with a unique coded solution
Statement
Fix and put
Let and be the two-sign shift space and the closed ball of bounded bilateral sequences of The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences, and for define
For a nonzero real , define when and when . Once clause 2 establishes , its iterates are defined by and for .
Then:
- , so ; moreover , hence ;
- for every and the radicands lie in , so is a well-defined bounded sequence with ; in particular ;
- for all and every ,
- hence has, for each , exactly one fixed point , and for every
Facts & Assumptions
Given: The real number , the constants and , the shift space and the complete ball of The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences and 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, and the operators .
Square roots (Square roots exist: a unique with ; the positives are , Complete ordered field (least-upper-bound property)): every has a unique with ; if then , since and ; in particular for and for . Also because and is increasing on .
The ball is nonempty and, with the supremum distance , a complete metric 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, clauses 1, 2 and 4; Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric); the value satisfies exactly when for all (The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences, Absolute value in an ordered field).
Banach's fixed point theorem (A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point, Lipschitz map, -Hölder map for rational , and contraction): a contraction of a nonempty complete metric space into itself, with constant , has exactly one fixed point.
Absolute value and order: exactly when for ; ; and for every (Basic properties of the absolute value, Absolute value in an ordered field, The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences).
Order arithmetic on intervals (Intervals of : the nine order-convex forms, nondegeneracy, and length, Complete ordered field (least-upper-bound property)): if for then ; and for reals one has by [F1].
Proof
Constants: by [F1], , so and ; hence by [F1]. Further and , so and [F1] gives .
Well-definedness and self-mapping: let , and . Since by [F2], [F5] gives ; by step 1.1 this is a positive interval, so [F1] makes a well-defined positive real, and is a function . Moreover by [F4], [F1] and step 1.1. Taking the supremum over gives , so .
Contraction: let and , and put , ; by step 1.1 both lie in , so by [F1]. Then where the first identity is the algebraic identity ([F1], [F4]), the second inequality uses [F4] and [F5], and the last uses [F2]. Since by [F4], taking the supremum over gives , and by step 1.1.
Fixed point: is nonempty () and complete in the sup distance by [F2]; maps into itself by step 2.1 and is a contraction with constant by step 2.2; [F3] therefore gives exactly one with .
Properties of the fixed point: fix and write , so that by the fixed point equation. If then , and if then ; hence in both cases and . Squaring the fixed point equation gives , which is the recurrence, and by step 1.1, [F1] and [F5].
Remarks
-
The choice is a convenient explicit margin: it gives , hence and the self-mapping inequality with room to spare. The argument works for every with and .
-
No choice principle is used: the contraction and the completeness of are choice-free, and the fixed point is unique.
Finite symbol windows determine the code: locality of the iterates, coding continuity and injectivity of
Statement
Fix and let , , , and be as in The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences and The square-root recurrence is a contraction of with a unique coded solution. Define the quadratic phase map
and for each let be the unique fixed point of in . Define the coding map
Then:
- is a bijection with , and for every and
- (locality) for all , and : if for all with , then , where is the -fold iterate and the zero sequence;
- (uniform error) for all and ,
- (coding continuity) if agree at every coordinate with , then for , and consequently
in particular is continuous at every (Continuity of a map between metric spaces, at a point and globally, in the - form) when carries and the Euclidean metric;
- (injectivity) is injective.
Facts & Assumptions
Given: The parameter , the constants , the shift spaces , the balls , the operators , their fixed points of The square-root recurrence is a contraction of with a unique coded solution, the map and the coding map displayed above.
Fixed point data (The square-root recurrence is a contraction of with a unique coded solution): for each , , , , and for all . The iterate convention for is the one fixed in that lemma.
Banach error estimate (The a priori bound and the a posteriori bound , A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point, Lipschitz map, -Hölder map for rational , and contraction): for a contraction with constant on a complete metric space, the iterates from any starting point satisfy ; here , , so .
Ball and metric data (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 clauses 1-3, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric): ; for ; maps into itself and contracts with constant ; therefore induction gives for every ; the distance on is with the metric of .
Cylinders and balls in the binary space (The bilateral shift metric is a metric, cylinders are its basic balls, and the shift space is sequentially compact, clause 2): with and , if then for ; under the isometry of 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 this says for : if then for .
Absolute value, order and the sequence (Absolute value in an ordered field, Basic properties of the absolute value, The triangle inequality, The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences): , , if and only if for , and the zero sequence satisfies .
Continuity in a metric space (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, Convergence of a sequence in a metric space: iff in ): is continuous at when for every there is such that implies .
Proof
Inverse of : for every , the two compositions are and Thus is a bijection with . For and , [F1] gives , hence .
Locality, by induction on : for the sequence is independent of , so the claim is vacuous. Assume it holds for and let agree for . Then . The symbol lies in ; by the induction hypothesis applied at and (for which the required windows are and , both contained in ) the two radicands coincide; hence the two values coincide. This proves clause 2.
Uniform error: is the -th Banach iterate of the starting point for the contraction with constant on the complete space ([F3], [F1]). By [F2], , where by [F3].
Coding estimates: let agree for and let . For , locality at level requires agreement for , which holds; for it requires agreement for , which implies , so the required agreement also holds. Hence , and two applications of step 2.1 give for (Absolute value in an ordered field, [F5]). Consequently .
Continuity of : let and choose with , possible because , hence tends to (For the sequence is null, and for the sequence diverges to , Series, partial sums, convergence and the sum, divergence, and the tail series). Put . If , then by [F4] for , so step 3.1 gives . By [F6] this is continuity of at , and was arbitrary.
Injectivity: suppose . For and put . By step 1.1, and for all ; induction on gives and induction on gives (using the bijectivity of from step 1.1). Since , it follows that for all , hence for all . By [F1], , so .
Remarks
-
Clause 2 is the quantitative content of "finite memory": the value of the -th approximation at coordinate sees only the symbols centred at . Clause 4 turns this into a modulus of continuity of the coding map through the uniform error estimate.
-
Injectivity uses only that is invertible and that the sign of recovers ; no differentiability is used in this item.
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 .
Constant codes give the fixed points, and finite nonconstant word codes give homoclinic orbits converging to a fixed point at both ends
Statement
Fix , let , , let and be the coded sequence and coding map 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 let . For write for the constant code , and put
so that , and write for the stable and unstable sets of Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family. Then:
- for every , and ; consequently is a fixed point of ;
- if satisfies for all for some , then
- if moreover is not the constant code , then , for every , and ; hence is a homoclinic point of the fixed point ;
- distinct codes of the kind in clause 2 give distinct points ; in particular the finite-word deviations from the two constant codes produce infinitely many distinct homoclinic points.
Facts & Assumptions
Given: The parameter , the constants , the coded sequence and map , the phase map , the constant codes , the numbers , and a code with for .
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 the unique fixed point of , , , ; locality: depends only on with ; uniform error: ; is injective; .
Conjugacy and invariant set (The quadratic map has a compact coded invariant set conjugate to the two-sign shift, with chaos under ): for all , and the coded set is invariant.
Square roots and the equation (Square roots exist: a unique with ; the positives are , Absolute value in an ordered field): , and , because and .
Stable and unstable sets (Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family): , , and a homoclinic point of a fixed point is a point of different from ; convergence is metric convergence (Convergence of a sequence in a metric space: iff in , Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
The sequence tends to because (For the sequence is null, and for the sequence diverges to , For , , and for the series diverges).
Absolute value and the base arithmetic (Basic properties of the absolute value, Absolute value in an ordered field): , , and .
Squaring is strictly increasing on the nonnegative reals (Squaring is monotone on the nonnegatives): if then , and if then .
Proof
The constants : since , [F7] applied to gives . Also , so [F7] gives ; and gives . Thus , so for both signs. The number satisfies , and by . Hence by [F3] .
Constant codes: let be the constant sequence . By step 1.1, for all ; so is a fixed point of in (indeed by [F7] and ). By uniqueness ([F1]) , hence ; and because .
Convergence in the forward direction: let and let ; then every with satisfies , hence . By [F1], . Therefore for , using the uniform error bound of [F1] twice and of step 2.1. Given , choose with , possible by [F5]; then for all . Hence as , and therefore by [F1].
Nonconstancy: suppose ; then there is with , and by [F1] , so and ; if then , and then by the recurrence for all , so for all , a contradiction. Hence . Since by [F2] and each is again not constant, the same argument gives for all .
Convergence in the backward direction: if and , then , so and . Locality [F1] therefore gives , and the same two uniform error bounds as in step 3.1 yield . Hence as . Since is a bijection ([F1]) and , this says as .
Homoclinic points: by steps 3.1 and 4.1, the point lies in (the forward and backward orbits are defined for all times because is a bijection and for all ), and by step 3.2 it differs from the fixed point. By the definition [F4] it is a homoclinic point of .
Distinctness: if then because is injective by [F1]; the nonconstant finite-word codes are infinite in number (for example the codes differing from at exactly the coordinates for are pairwise distinct), so there are infinitely many distinct homoclinic points.
Remarks
-
The convergence rates are uniform in the code: for a code that agrees with for , the deviation satisfies whenever .
-
The two constant codes give fixed points, not homoclinic points; homoclinic points arise precisely from nonconstant codes with constant tails, which are the finite-word deviations promised by the design.
Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family
Definition
The quadratic family. For let
with differential at
The inverse map is
and its differential at is
Here denotes the inverse matrix of , namely ; it is not the same notation as , which evaluates the derivative of the inverse map at the point . All matrices act on column vectors of (The total (Fréchet) derivative as the linear first-order approximation with remainder, The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case).
Complex coordinates and modulus. Use , with real numbers embedded as constant classes and , so (The complex numbers as , with the real embedding and imaginary unit ). This is a field and each element has a unique form with ( is a field, every element is uniquely , and every nonzero element has inverse ). Define its modulus by
where the square root is the unique nonnegative real square root (Square roots exist: a unique with ; the positives are ). Identify with pairs of complex coordinates; a real matrix acts on it by the same matrix entries, extended -linearly.
Hyperbolic fixed points. Let be open, let be a diffeomorphism, and let satisfy . Its eigenvalues are the numbers for which for some . The fixed point is hyperbolic when every such eigenvalue satisfies . A global diffeomorphism of is the special case .
Cones. Fix . The unstable cone and stable cone of aperture are
(Absolute value in an ordered field); both are closed subsets of , they are closed under multiplication by real scalars, and , because a nonzero vector in the intersection would satisfy and , hence .
Slopes. A line through the origin not contained in the horizontal axis is written uniquely as with the slope parameter ; here characterises the lines contained in . Similarly a line not contained in the vertical axis is written uniquely as with the slope parameter , and characterises the lines contained in .
For real numbers two maps on slope parameters are defined:
The intended reading is the graph-transform reading: carries the line at to the line at with , and carries the line at to the line at with . These two statements follow from the displayed matrices and are proved in the companion lemma on this page, not asserted as part of this definition.
Invariant line fields on a sequence. A real bilateral sequence is a function ; write . Put . An unstable line field along is a family of lines through the origin of such that maps onto for every . A stable line field along is a family such that maps onto for every . The latter evaluates the derivative of the inverse map at . When satisfies , one has , so these are the source and target orbit points. The displayed matrix conditions also define line families for arbitrary sequences, without asserting that such a sequence is an orbit. For a real bound , sequences with , and apertures satisfying , existence and uniqueness of line fields with slopes in are proved in the companion lemma on this page.
Stable and unstable sets. Let be a bijection of a metric space (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric) with fixed point (so ). Put
where convergence is that of the metric (Convergence of a sequence in a metric space: iff in ). The sets and are the stable set and the unstable set of .
These orbit-based definitions also apply to a local map. Let be open, let be a diffeomorphism, and let satisfy . Define and recursively whenever ; define whenever . Then
where convergence is Euclidean metric convergence. The explicit domain clauses require every forward iterate to lie in before applying , and every backward iterate to lie in before applying . In the global case above every iterate is defined automatically.
A homoclinic point is a point in both the stable and unstable sets, different from the fixed point . For a global bijection on or a local planar diffeomorphism as above, it is transverse when there are and maps ( Euclidean maps and diffeomorphisms, The derivative of at a point that is a limit point of , and differentiability on a set)
such that , the stable curve takes values in the stable set and the unstable curve takes values in the unstable set, both are injective on with , and the derivative vectors are linearly independent. Thus derivatives and tangent vectors in this definition are taken in the two-dimensional differentiable setting used by the results on this page; no derivative is assigned to a curve in an arbitrary metric space. The interval is that of Intervals of : the nine order-convex forms, nondegeneracy, and length.
Remarks
-
The definition records the two vocabularies used by the coding theorem and the transversality theorem: the linear cone and slope objects of the quadratic family, and the invariant-set objects of global bijections and local planar diffeomorphisms. It asserts no invariance of the cones, no convergence of the slope maps and no transversality; those are the contents of Cone invariance and expansion, and convergence of the slope graph transforms to unique invariant stable and unstable line fields and The coded curves are genuine stable and unstable curves of , with transverse intersection at every finite-word homoclinic point.
-
The transversality condition above is stated with two curves through the point, one lying in each invariant set, whose tangents span . When the local stable and unstable sets are themselves curves near (which holds at the fixed points and their finite images in the situation of The coded curves are genuine stable and unstable curves of , with transverse intersection at every finite-word homoclinic point), this agrees with the usual formulation " and meet transversely at ".
-
The forward slope map is defined on when , since ; this condition alone does not ensure contraction. In Cone invariance and expansion, and convergence of the slope graph transforms to unique invariant stable and unstable line fields, the stronger bound gives for , with . The additional aperture condition ensures that the image lies in . The same conclusions hold for the backward slope map with .
Cone invariance and expansion, and convergence of the slope graph transforms to unique invariant stable and unstable line fields
Statement
Let , and . Let be a real bilateral sequence with for every , put , and let , , , , and be as in Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family. Write
Assume in addition the aperture condition , equivalently . This condition is needed for invariance of the stated cones and slope interval; alone does not imply it for arbitrarily small . Then:
- (cone invariance and expansion) for every : maps into itself, and every satisfies
and maps into itself, with for every ; 2. (slope contractions) for every real with , the map carries into and satisfies there; the same holds for for every ; 3. (unstable line field) define and for . Then converges for every to a limit , uniformly in , and
furthermore maps the line onto the line for every , so the lines form the unique unstable line field along whose slopes all lie in ; 4. (stable line field) similarly, and converge to limits with , and maps onto ; this is the unique stable line field along with slopes in .
Facts & Assumptions
Given: The parameter , the aperture , the bound , the sequence with , the cones, slope maps and matrix data of Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family, and the recursively defined slope families , .
Cone, slope and matrix data (Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family): and ; , , . For , the matrix gives , so its image line has slope . Likewise, for , , so its image line has slope .
Absolute value and order (Absolute value in an ordered field, Basic properties of the absolute value, The triangle inequality, Complete ordered field (least-upper-bound property)): ; ; if and then ; if then ; and the stated aperture condition gives .
Series and geometric sequences (For , , and for the series diverges, Series, partial sums, convergence and the sum, divergence, and the tail series, A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum, For the sequence is null, and for the sequence diverges to ): for the series converges, , and .
Completeness and limits of real sequences (The Cauchy criterion from the least-upper-bound property: in a complete ordered field every Cauchy sequence converges, Sequences of reals: bounded, eventually, frequently, tails, subsequences, Algebra of limits: sums, scalar multiples, products and quotients, Limits preserve non-strict inequalities, Convergence of a sequence in a metric space: iff in ): every Cauchy real sequence converges; limits of convergent real sequences are compatible with addition, multiplication, division by nonzero limits, and with weak inequalities; a limit of numbers in a closed interval lies in .
Proof
Constants: since and , we have , so and ; moreover the aperture hypothesis gives , hence .
Unstable cone: let , so and by [F2]. Then and by [F2]. Also since , so . Finally whenever , so the image is in (the case gives and image ).
Stable cone: let , so and by [F2]. Then and ; hence and whenever , with the zero case trivial.
Slope contractions: let and ; by step 1.1, and , so is defined on , , and The same computation with proves the second assertion.
Unstable slopes, uniform bounds and contraction: define , . By induction, step 2.3 gives for all and , and for all . Hence for , uniformly in . Thus is Cauchy; completeness in [F4] gives its limit , with . Passing in the same estimate gives for every , proving uniform convergence.
Stable slopes: the same argument with , gives , limits satisfying .
Unstable recurrence: fixing and passing to the limit in , continuity of on (step 2.3) and the limit rules of [F4] give .
Uniqueness: let be another family with and for all . Comparing with the construction gives, by induction on , (step 2.3, [F2]); letting and using [F3] gives . The stable case is identical with the future-pointing iteration.
Invariance: by [F1] and step 4.1, carries the line to the line with slope ; since both lines pass through the origin and the first is mapped onto a line (the differential is invertible), the image is exactly . Similarly, uses the first coordinate of ; by [F1] and step 3.2 it carries onto .
Conclusion: steps 2.1 and 2.2 prove clause 1, step 2.3 proves clause 2, steps 3.1, 4.1 and 5.1 prove clause 3, steps 3.2 and 5.1 prove clause 4, and step 4.2 proves the uniqueness assertions of clauses 3 and 4.
Remarks
-
The convergence of the slope iteration is uniform in , with the rate ; no compactness of the sequence space is used.
-
Both recurrences are one-sided compositions: is determined by the symbols in the infinite past, by the symbols in the infinite future. This is the sense in which the unstable direction has finite memory of the past and the stable direction finite foresight of the future.
Weighted half-tail contractions for give a unique curve with tangent slope bounded by
Statement
Let , and put
Let be a nonempty compact interval, let , and let be open with . For let be of class ( Euclidean maps and diffeomorphisms); write for its restriction to , assume , and suppose that
Let be a sequence with and let satisfy
and assume there is with for every . Choose such that
and put . Write
with metric , and define its closed ball
For and , put and for every , and define by
Then:
- is a complete metric space and is complete in the distance ; for every the map is a contraction with constant , so it has exactly one fixed point ;
- for every one has the a priori bound , and the map is Lipschitz on with
- is continuously differentiable on into : with for and , the derivative is the unique element of satisfying
and ; 4. consequently the local phase curve
defined for is with , and so .
Facts & Assumptions
Given: The parameters , the compact interval , the open neighborhood , the extensions and their restrictions , the two-sign sequence , the reference data , the radius and parameter interval , the weighted space , its closed ball , and the operators .
Each is on the open set , its restriction maps into , and on (given). The box is compact by Heine--Borel; hence the first and second partial derivatives are bounded there (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line, A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value, Euclidean maps and diffeomorphisms, Directional derivatives and partial derivatives of a map , The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case). If and , the segment lies in . The function is on an open interval containing , and the chain rule gives and with a common finite for both signs (The chain rule for total derivatives: ). The mean-value inequality (The mean value inequality: if is continuous and differentiable on with , then ) applied to gives
For the Taylor remainder, the mean-value inequality applied to on gives ; thus has . Applying the same inequality to on gives
Here is the sum of the absolute values of the two coordinates; the derivative bounds follow from the chain rule and the uniform second-derivative bound above (The chain rule for total derivatives: , The mean value inequality: if is continuous and differentiable on with , then , The total (Fréchet) derivative as the linear first-order approximation with remainder).
The map , , is a bijection with ; hence is a complete metric space, as an isometric copy of the complete space . It maps isometrically onto the closed sup-norm ball , so that ball and therefore are complete as well (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, clauses 1, 2 and 4; Isometry, isometric embedding, and the subspace metric on a subset, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
Banach's fixed point theorem (A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point, Lipschitz map, -Hölder map for rational , and contraction): a map of a nonempty complete metric space into itself with constant has exactly one fixed point, and it is the limit of the iterates from every starting point.
Absolute value and order arithmetic (Absolute value in an ordered field, Basic properties of the absolute value, Complete ordered field (least-upper-bound property)): , , and for all .
Proof
Contraction: let and . Every argument pair of lies in : and, for , with . The line segment between the two argument pairs also lies in because is an interval, so the derivative bound in [F1] gives for For only the argument varies, so because . Multiplying by and taking the supremum gives .
Ball invariance: let and . For every , by and the margin hypothesis; also . For , using the reference recurrence of the statement and [F1], For , , so , since . Hence .
Linearised equation: fix and put for and . Define the affine map on by where is held fixed. The homogeneous part is a contraction of constant by the computation of step 1.1, so [F3] gives a unique with , i.e. the displayed system; taking the fixed point of the homogeneous contraction started at gives because the forcing has norm at most .
Fixed point: by [F2], is a nonempty complete metric space. For every , step 2.1 shows maps this ball into itself and step 1.1 shows that it is a contraction with constant ; [F3] therefore gives exactly one fixed point .
Taylor remainder: fix and take small enough that . Put and , and for put and , with and . For , [F1] applied at and gives and multiplying by bounds this by . For the two input differences are and ; [F1] gives a remainder bounded by with a uniform , so altogether with .
Lipschitz dependence and a priori bound: for and , for , while by [F1]. Applying this with and using step 1.1 gives , hence . At , because the zero sequence solves the fixed-point equation; taking one parameter to be gives .
Differentiability: write and for the two partial derivatives of the map at . By step 3.2 applied to the fixed point equations and , with . By step 2.2, ; subtracting from the displayed equation and putting therefore yields , whence . By step 4.1, , so for small and hence : that is, in . This proves differentiability with derivative and identifies it with the solution of clause 3.
Continuity of the derivative: by step 2.2 the difference of the linear operators at and has coefficients , which tend to zero uniformly in as by uniform continuity of the on the compact and by the uniform estimate of step 4.1; the same holds for the forcing. Applying the difference estimate of step 4.1 to the fixed points of the affine maps gives .
The curve: the map has components the identity and the affine function of , and is continuously differentiable by steps 5.1 and 5.2 with derivative ; hence is with the displayed derivative ([F5]). The bound is step 2.2.
Remarks
-
The lemma isolates the exact contractive mechanism used for both the unperturbed square-root recurrence and its perturbations: only the two partial-derivative bounds of the update and the existence of one reference half-orbit are used, not the explicit shape of .
-
The weighted growth is what makes the solution track the reference half-orbit exponentially; for the phase curve this means that the forward orbits of its points converge to the same limit as the reference orbit, which is the stable-set membership used later.
-
No choice principle is used: completeness of the weighted space comes from the complete space of bounded sequences, and the fixed points are unique.
The coded curves are genuine stable and unstable curves of , with transverse intersection at every finite-word homoclinic point
Statement
Fix and let , , , , and the sets be as in 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, Finite symbol windows determine the code: locality of the iterates, coding continuity and injectivity of and Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family. For put and let
be the square-root update of the coded recurrence. Then:
- (hyperbolicity) the fixed points of are hyperbolic: has two real eigenvalues, one of modulus and one of modulus ;
- (stable curve at a finite-word point) let be nonconstant with for , and put . Then there are and a curve with , and tangent ;
- (unstable curve at a finite-word point) likewise there are and a curve with , and ; consequently is a transverse homoclinic point of (Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family);
- (local stable and unstable sets at the fixed point) put and define . Then the set of points whose forward orbit stays within max-norm distance of ,
is exactly the graph of the half-tail solution map obtained from [F2] with the constant reference and ; in particular it is a embedded curve through whose tangent at the fixed point lies in . With the same statement holds in the unstable direction: a point has all its backward iterates within max-norm distance of if and only if it lies in , and is a embedded curve through whose tangent lies in .
Facts & Assumptions
Given: The parameter , the constants , the coded sequences , the coding map , the fixed points , the square-root updates , and a nonconstant code with for .
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 , The quadratic map has a compact coded invariant set conjugate to the two-sign shift, with chaos under ): , , and ; moreover and , since .
Weighted half-tail lemma (Weighted half-tail contractions for give a unique curve with tangent slope bounded by ): for θ=1/2, q=c(θ+θ⁻¹)<1, a compact interval J, a reference half-orbit, and a local parameter interval I satisfying the lemma's radius and margin hypotheses, T_b is a contraction of the closed weighted ball of radius ρ̄ into itself for b∈I. Its unique fixed points u(b) are C¹ in b, satisfy ‖u(b)‖θ≤c|b−b*|/(1−q), and the phase curve b↦(b,y₀+u₀(b)) has tangent (1,d₀) with |d₀|≤c/(1−q); its forward orbit tracks the reference with deviations bounded by ‖u(b)‖_θ.
Homoclinic and constant-code data (Constant codes give the fixed points, and finite nonconstant word codes give homoclinic orbits converging to a fixed point at both ends): the constant code has with and ; for a finite-word code , as , and when .
The reflection symmetry (Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family, The total (Fréchet) derivative as the linear first-order approximation with remainder): with one has , (because ), and maps onto .
Hyperbolic fixed points (Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family, The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case, Absolute value in an ordered field, Basic properties of the absolute value, Square roots exist: a unique with ; the positives are ): ; the characteristic polynomial at is , with roots . Here and , so the supplier's definition tests whether each eigenvalue has modulus different from .
Convergence and continuity (Convergence of a sequence in a metric space: iff in , Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point, Intervals of : the nine order-convex forms, nondegeneracy, and length, Euclidean maps and diffeomorphisms): the definitions of convergence in , of curves on an interval, and of the stable and unstable sets of Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family.
One-sided bounded sequences and the deviation operator (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 4, Constant codes give the fixed points, and finite nonconstant word codes give homoclinic orbits converging to a fixed point at both ends, Absolute value in an ordered field, Basic properties of the absolute value, Square roots exist: a unique with ; the positives are ): let . For either sign, or , so for . If and have , then in the update every radicand lies in , so is defined. For each the difference of two outputs is at most ; at it is at most . Thus .
Proof
Hyperbolicity: the characteristic polynomial in [F5] has the two real roots , whose product is . If , then , so and . If , write with ; then and . Thus each fixed point has one eigenvalue of modulus greater than and one of modulus less than , proving clause 1 by the hyperbolicity definition of Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family.
Stable curve: apply [F2] with , , , , the update , reference , , , and . By [F1], and , so the margin condition holds; also , so , and . The updates are on the open set , containing , with first partials and second partials . On their first partials have absolute value at most , since , and . Thus their extensions, image and derivative bounds match every premise of [F2]. The recurrence holds by [F1]. Hence there is a curve through with tangent and . Every point has forward orbit tracking the reference orbit , which converges to by [F3]; hence lies in and its tangent lies in . This proves clause 2.
Unstable curve: put and let for , with boundary value . By the recurrence of [F1], this is a reference half-orbit for the square-root update, and , . Apply [F2] with , , , , , and ; the margin and parameter-interval conditions hold by [F1]. The resulting curve through has tangent with , and its forward orbits track that of : by [F4], , which converges to by [F3]. Reflecting the curve by gives a curve through , tangent , whose points lie in . This proves clause 3.
Local stable set: apply [F2] with , , , , , , the constant symbols , constant reference , and . The reference satisfies the recurrence because and , so by [F3]. By [F7], , and , so the reference-margin condition and hold; also . Hence there is a map with . Define with ; this closed parameter interval lies inside because .
Transversality: by steps 2.1 and 3.1 the tangent of at lies in and that of in ; since ([F4], Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family) the two tangent lines are distinct, so the two curves cross transversely at . This is the transversality assertion of clause 3.
The graph lies in the trapping set: let and put , for . By the fixed-point equation of [F2], the sequence satisfies for every , so by [F1] and for all . Also and for . Thus every point of has all forward iterates within max-norm distance of .
The trapping set lies in the graph: let satisfy for every , and write . Then for every . Since by [F7], each has sign and . The orbit identity gives , so for one has . Put for and . Then , , and the displayed identity says exactly for all . The weighted solution from step 3.2 also satisfies and . By [F7], , so and .
Local stable set identified: steps 4.2 and 4.3 show that the set of clause 4 equals ; by [F2] and step 4.1 the curve is with tangent at the fixed point and , so the tangent lies in . This is the stable half of clause 4.
Local unstable set: by [F4], with , and preserves the max norm because it permutes coordinates. Hence for every and , . Therefore the set of points whose backward orbit stays within max-norm distance of is exactly . Its tangent at is because maps onto by [F4], and it is a embedded curve as the image under a linear homeomorphism. This completes the proof of clause 4.
Remarks
-
Clause 4 identifies the local stable and unstable sets of the fixed points with the constructed graphs, which is the piece of the stable-manifold picture used by the transversality argument; no global stable-manifold theorem and no structural-stability theorem is invoked.
-
The unstable curve is obtained from the stable construction by the exact reflection symmetry of the quadratic family; this avoids a separate backward half-tail contraction.
-
The aperture is the one used throughout; the derivative bound is verified with the explicit bound and is not claimed to be optimal.
A map -close to has a unique inverse branch for its first component, with derivative bounds
Statement
Fix and put , so that . Let , let be open with , and let be of class ( Euclidean maps and diffeomorphisms) whose components satisfy, on the closed square ,
Then:
- for every the equation has exactly one solution , and this defines a map ;
- is of class on ( Euclidean maps and diffeomorphisms), with
- satisfies the uniform estimates
for every .
Facts & Assumptions
Given: The parameter , , the open set , the map with its closeness bounds on , and a point .
First-component closeness (given, Euclidean maps and diffeomorphisms, The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case): for every one has and . The function is continuous on and differentiable on its interior, since is on the open set . For any distinct in this closed interval, the scalar mean value theorem (The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with ) on gives for an interior . The derivative is , of absolute value at most ; equal endpoints give zero. Thus, including both boundary endpoints,
equivalently, for one has and on the interval, with .
The interval is nonempty. Every Cauchy sequence in it converges in by The Cauchy criterion from the least-upper-bound property: in a complete ordered field every Cauchy sequence converges, and its limit remains between and by Limits preserve non-strict inequalities. Thus the interval is complete (Complete metric space: every Cauchy sequence converges in the space), and a map of it into itself with constant has exactly one fixed point (A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point, Lipschitz map, -Hölder map for rational , and contraction, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
Implicit differentiation (The Euclidean implicit function theorem with derivative formula, Euclidean maps and diffeomorphisms): is on the open set ; if and , then near the equation has a unique solution with and .
Absolute value and order (Absolute value in an ordered field, Basic properties of the absolute value, The triangle inequality): , , and so that and for .
Continuous differentiability and the topology of the square (Open ball, closed ball and sphere in a metric space, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point): the closed square is a nonempty subset of the open set , and a function is of class when its partial derivatives exist and are continuous.
Proof
Location of the root: fix and define on . For every such , so by [F1]; hence by [F4] (because gives ). Also by [F1] and the mean value inequality. Thus maps the complete interval into itself and is a contraction with constant .
Unique root: by [F2], has exactly one fixed point ; the identity is equivalent to . This proves clause 1 and defines .
Regularity: at a root with , the partial derivative satisfies by the closeness bound, so . The implicit function theorem [F3] gives a solution near with the displayed derivatives, and by clause 1 this local solution coincides with ; since was arbitrary, is on the square with the displayed formulas.
Regularity needed by the half-tail construction: choose . For , both parameters lie in , and every with lies in . Thus the given bounds apply and . The contraction has constant ; moreover , so because and . Its unique fixed point therefore defines on this open parameter rectangle, extending the original branch by uniqueness. The implicit function theorem gives a local branch at each point; uniqueness makes these local branches agree with the contraction-defined extension. Since is , the formulas in step 3.1 make its first partial derivatives compositions and quotients with nonvanishing denominator. Consequently this extension is on the open rectangle, as needed by the later root and weighted-tail constructions; clause 2's conclusion remains valid.
Estimates: from and the closeness evaluated at , clause 3's first inequality follows: by [F4]. For the derivatives, by step 3.1 using and from the hypotheses and from step 3.1.
Conclusion: steps 2.1, 3.1 and 4.2 prove clauses 1, 2 and 3 respectively.
Remarks
-
The proof uses only two properties of the model map : its first component is the second variable, so that solving in is a near-identity equation, and its second component is a quadratic in . The quadratic structure enters quantitatively in the split between the two components in Root bounds and dependence for the perturbed scalar recurrence .
-
The estimates are uniform on the square and show that is a small perturbation of the projection .
Root bounds and dependence for the perturbed scalar recurrence
Statement
Fix and put
Let , let be open with , and let be a map satisfying the closeness hypotheses of A map -close to has a unique inverse branch for its first component, with derivative bounds on with constant ; let be its inverse branch. Define the defect
for , and put
Then:
- is of class on , and there is a constant such that ; in particular, with assumed to satisfy , for all
- for every and each sign the equation has exactly one solution with , and this solution satisfies the margins
moreover is of class on with
- with as above and one has, for every and ,
- (orbit form of the root equation) for all ,
Facts & Assumptions
Given: The parameter , the constants , the map and its closeness constant , the inverse branch of A map -close to has a unique inverse branch for its first component, with derivative bounds, the defect and the polynomials .
The inverse branch (A map -close to has a unique inverse branch for its first component, with derivative bounds, clauses 2 and 3): is on , , , , for all ; the hypothesis gives .
The closeness of : , , on (given, and hypotheses of A map -close to has a unique inverse branch for its first component, with derivative bounds).
calculus and the uniform bound: is built from , and polynomials by composition, product and sum, so it is on the compact cube, and its value and first partial derivatives are bounded by a constant times by [F1], [F2], the chain rule and the extreme value theorem ( Euclidean maps and diffeomorphisms, The chain rule for total derivatives: , A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value, Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point); the constant depends only on and . This is stated as clause 1 with a single constant absorbing the finitely many factors.
The endpoint values of the unperturbed quadratic (Square roots exist: a unique with ; the positives are , Absolute value in an ordered field, The triangle inequality, Intervals of : the nine order-convex forms, nondegeneracy, and length): with one has , hence
because and . In particular and for .
The intermediate value theorem and mean value theorem (Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and , The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with , Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point, Absolute value in an ordered field): a continuous real function on a closed interval taking a negative value at one endpoint and a positive value at the other has a zero; for a function continuous on a closed interval and differentiable on its interior, for some interior . Thus a function with strictly positive derivative is strictly increasing, and gives , including boundary endpoints.
Implicit differentiation in two variables (The Euclidean implicit function theorem with derivative formula, Euclidean maps and diffeomorphisms): if and , then locally is the unique solution with and .
Proof
Bounds for the defect: on the cube, [F1] gives and the corresponding partials of in are bounded by ; [F2] gives and partial bounds plus Lipschitz factors from the derivative bounds of and [F1]. Since , every term of and every first partial derivative of (computed by the chain rule and product rule) is bounded by a sum of finitely many terms each , so there is with ; the factors are bounded by under the stated hypothesis. With clause 1 follows.
Endpoint values of : fix . By step 1.1, for every . Using [F4], because and . Similarly and .
Monotonicity: for , and for , ; hence is strictly increasing on and strictly decreasing on .
Orbit form of the root equation: fix and put , so that by [F2]. Expanding the two inverse-branch values, one computes because the bracket is exactly . Hence if and only if , which is clause 4.
Existence, uniqueness and margins of the root: by steps 2.1 and 2.2 and the intermediate value theorem [F5], has exactly one zero in and exactly one zero in . For the margins, on one has by step 1.1, while and by step 2.1. The mean value theorem applied on and on therefore gives and both right-hand sides are at least because : the first inequality is equivalent to and the second to . At the two bounds read and . The same computation on the interval , where is decreasing and , , gives and ; thus and for each sign .
Regularity and derivative bounds: at a zero of with , step 2.2 gives (respectively ), so the implicit function theorem [F6], applied to the function and combined with the uniqueness of step 3.1, makes of class with Both numerators are bounded by in absolute value, and the denominator by from below in absolute value; hence , which is clause 2.
Open-neighborhood regularity for later applications: the “Regularity needed by the half-tail construction” paragraph in the proof of A map -close to has a unique inverse branch for its first component, with derivative bounds extends as a map to an open rectangle containing . Since is on , the formula for , hence , is on an open neighborhood of the cube after shrinking the rectangle so that . The endpoint signs in step 2.1 and the derivative lower bound in step 2.2 have uniform strictly positive margins on the compact parameter square and the two root intervals. Continuity and compactness therefore preserve those signs and derivative bounds on a slightly enlarged open parameter rectangle. On that rectangle the intermediate value theorem and strict monotonicity give unique roots in the same two intervals; the implicit function theorem makes them . Their first partials are the quotients in step 4.1 of functions composed with these roots, with nonzero denominator, so the partials are and the roots are . This supplies extensions of on an open neighborhood of , as needed by the weighted half-tail lemma; the original derivative bounds on the closed square are unchanged.
Numerical inequalities: since and , ; therefore ; with , ; and .
Conclusion: step 1.1 proves clause 1; steps 2.1, 2.2, 3.1 and 4.1 prove clause 2; step 5.2 proves clause 3; step 2.3 proves clause 4.
Remarks
-
The defect is not an arbitrary perturbation: it is exactly the residual obtained from a genuine -orbit, because a -orbit satisfies and , and substituting the inverse-branch expansions produces precisely (step 2.3, read backwards). Clause 4 is the exact equivalence used in Explicit persistence under the stated forward and conjugated-inverse bounds: coded chaos, hyperbolic fixed points and transverse homoclinic points to convert the coded recurrence into the two-step orbit relation of .
-
All numerical margins are evaluated at the worst case , , ; the argument is uniform in and only improves with larger or smaller .
Explicit persistence under the stated forward and conjugated-inverse bounds: coded chaos, hyperbolic fixed points and transverse homoclinic points
Statement
Fix and put
Let be the constant of Root bounds and dependence for the perturbed scalar recurrence , let with , and let be open with . Let be a diffeomorphism onto its image whose components satisfy, on ,
and assume in addition that is defined and of class on a neighbourhood of and satisfies the same six inequalities on with the same constant . For each sign let be the root map of Root bounds and dependence for the perturbed scalar recurrence applied to , let be the inverse branch of A map -close to has a unique inverse branch for its first component, with derivative bounds, and let be the corresponding objects for .
For a nonzero real , write if and if ; the sequence coordinates used below are nonzero because their absolute values are at least . Then:
- (coding) for every there is exactly one with for all ; it satisfies , and , ; setting and
one has for all ; 2. (conjugacy and chaos) is a continuous bijection of onto ; granting the Axiom of Countable Choice (used once through the equivalence between closed and sequentially closed subsets of ), it is a homeomorphism, and , so is -invariant. The set is sequentially compact and is compact under . Under , is continuous, topologically mixing, and has dense periodic points; it is sensitive with sensitivity constant . Hence under it is chaotic in the stated sense. 3. (fixed points) for each sign the constant code gives a fixed point , where is the unique element of with ; these two fixed points are hyperbolic; 4. (transverse homoclinic points) let be nonconstant with for . Then , and there are curves with , , , tangent vectors , ; since the tangent lines are distinct, so is a transverse homoclinic point of (Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family).
Facts & Assumptions
Given: The data , the maps , the root maps , the inverse branches , the shift space with metric and shift , the ball , and the cones and stable/unstable sets of Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family.
Root and defect bounds (Root bounds and dependence for the perturbed scalar recurrence ): proof step 5.1 supplies extensions of on an open neighborhood of ; in particular is on with values in , where , , for and ; the defect satisfies on the cube; every root satisfies the margins and , because the endpoint values of are at least and in absolute value while , and and for ; and clause 4 of the same lemma: for all , if and only if .
Inverse-branch estimates (A map -close to has a unique inverse branch for its first component, with derivative bounds): is on with , , ; here , so and .
Weighted half-tail lemma (Weighted half-tail contractions for give a unique curve with tangent slope bounded by ): under its hypotheses with parameters and a reference half-orbit, the maps have unique fixed points , the map is continuously differentiable with , and every derivative entry satisfies .
Complete ball and contraction (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, A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point, Lipschitz map, -Hölder map for rational , and contraction, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric): is a nonempty complete metric space in the supremum distance, and a contraction of it into itself has exactly one fixed point.
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 published two-symbol shift is continuous, mixing, has dense periodic points and is sensitive with constant ; its space is sequentially compact without choice and compact under the Axioms of Countable and Dependent Choice; the isometry of 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 transfers all of this to with .
Topological vocabulary and sequential closure (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, 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, Countably compact, sequentially compact and limit point compact metric spaces, Open cover, subcover, compact metric space, and compact subset of a metric space, The Axiom of Countable Choice (), The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain): the definitions of mixing, dense periodic points, sensitivity, continuity, open and closed sets, and fixed points; closed subsets of a metric space are exactly the sets containing all limits of their convergent sequences, limits in metric spaces are unique, the implication "closed sequentially closed" is choice-free, and the converse implication uses the Axiom of Countable Choice once.
Cones and slope vocabulary (Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family): , , and ; the phase curve of a half-tail with boundary value and sequence is the map at the index .
Arithmetic and limits (Absolute value in an ordered field, Basic properties of the absolute value, Intervals of : the nine order-convex forms, nondegeneracy, and length, Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point, For , , and for the series diverges, For the sequence is null, and for the sequence diverges to , Series, partial sums, convergence and the sum, divergence, and the tail series, Convergence of a sequence in a metric space: iff in , Open ball, closed ball and sphere in a metric space): the numerical bounds used below, the convergence of geometric sequences, and the fact that the Euclidean distance dominates each coordinate difference.
Proof
direct; run a contraction for the perturbed recurrence, transfer the shift's chaos through the coding homeomorphism as in the unperturbed case, and build the two curves by the weighted half-tail lemma applied to and to .
Constants: by [F1], , , and ; also , , and . Setting .
Coded sequence: for define on by . The values lie in by [F1], so maps into itself; and by [F1]. By [F4] and , has exactly one fixed point ; and , so . The margins of [F1] give and .
Orbits: with of [F2], clause 4 of [F1] states that is equivalent to . With , clause 1 gives , hence ; and the defining identity of gives . Hence , i.e. for all , and clause 1 is proved.
Locality and continuity: iterating from , one proves by induction on that depends only on the symbols with , exactly as in the unperturbed case, and that by [F4] and clause 3 of A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point; hence for agreeing on one has for . By [F2], and , so the mean value inequality gives ; with one therefore has whenever agree on . Given , choose with and ; if then ([F5], cylinder property) agree for , so . This proves continuity of .
Constant codes: for each sign , the map maps the closed interval into itself by [F1] and is a contraction with constant ; hence it has exactly one fixed point , and the constant sequence is a fixed point of , so is constant and is a fixed point of .
Injectivity: if then ; applying the bijection forward and (which exists because is a diffeomorphism onto its image, and lies in that image as ) backward gives for all by induction; hence for all , and by [F1], so .
Conjugacy: define . Then is a fixed point of , because by [F1]; by uniqueness , i.e. . Hence : the conjugacy identity, and follows as in the unperturbed case because is bijective.
Hyperbolicity: put , and . At the six closeness hypotheses give and , while [F2] gives and . Since , expanding trace and determinant of gives so and . Because and , and the discriminant is bounded below by since at and is increasing for . Hence the eigenvalues are real. Let be the one of larger modulus; then , and the last inequality being equivalent to , which holds because and . Thus : is hyperbolic.
Tail convergence: suppose for all , and let . For every with satisfies , so ; for every such satisfies , so again . Hence, by the uniform error estimate of step 3.2 and constant by step 3.3, whenever . Letting gives as ; consequently in both directions, by continuity of ([F2]).
Backward orbit under : put and define for . Since and by [F1] and [F2], every lies in , so every lies in the domain where is defined. The orbit identity of step 3.1 gives ; hence , so is the corresponding full orbit. Its coordinates are and , and for every , because by [F1] and by [F2]; the sign of may depend on . Set . By definition of the inverse branch of the first component of , the orbit relations , say and ; by clause 4 of [F1] applied to , this gives . Since , clause 1 of [F1] applied to yields
Topology: let be closed. A sequence in has a subsequence converging in the sequentially compact space ([F5] and the isometry of [F6]), and its limit lies in because closed sets are sequentially closed by the choice-free direction of [F6]; hence is sequentially compact. The continuous image is sequentially compact: given a sequence with , pick a subsequence and use continuity of ; hence is sequentially closed (any convergent sequence in it has a subsequence converging to a point of , and limits are unique by [F6]), and by the direction of [F6] it is closed in . Thus is a closed map, so is continuous. Under the Axioms of Countable and Dependent Choice, is compact by [F5] and is a continuous image of it, hence compact.
Stable curve for : let be nonconstant with for , and set for , . Then for with , and by [F1]. Apply Weighted half-tail contractions for give a unique curve with tangent slope bounded by with , , , , , , and update . The half-orbit margin follows from the root margins, follows from , and because . By [F3] there is a family with , and the phase curve through has tangent with Thus the tangent lies in . The recurrence coordinates remain in by the weighted-ball construction; their phase points lie in because . Step 3.1 therefore gives every forward iterate without leaving the domain of . Every point has forward orbit tracking that of , which converges to by step 4.4; hence these points lie in near .
Sensitivity: let and let . Choose such that , using from step 1.1, and define by for and . Since agree on , the estimate in step 3.2 gives . At coordinate , the codes and have opposite signs; by [F1] their coded first coordinates have opposite signs and absolute values at least . Therefore Iterating the conjugacy of step 4.2 identifies these two points with and . Thus for every point of and every radius there is a point within distance whose forward iterates are separated by at least , proving sensitivity with constant under the definition in [F6].
Mixing and dense periodic points: is on an open set containing , so its restriction to is continuous. Under , is a homeomorphism by step 5.1. If are nonempty and relatively open, then and are nonempty open subsets of . The shift is topologically mixing by [F5], so there is such that for all . By the conjugacy in step 4.2, this gives for all , proving mixing. The same conjugacy and injectivity show that maps periodic shift codes exactly to periodic points of ; since periodic shift codes are dense by [F5] and is a homeomorphism, these periodic points are dense in .
Unstable curve for : shift the -reference to with , and apply Weighted half-tail contractions for give a unique curve with tangent slope bounded by to with , , , , , and . The reference recurrence holds by step 4.5. Its margins satisfy and ; also , so the margin and parameter interval conditions hold. Moreover because . By [F3] we obtain a recurrence curve ; composing with the -phase map gives through , with tangent and . The reference orbit converges to by step 4.4, so the tracked points lie in . Thus for sufficiently small is a curve through in , since . Its tangent is . Finally because is injective by step 4.1 and .
Conclusion: clause 1 is step 3.1; clause 2 consists of step 3.2 (continuity), step 4.1 (injectivity), step 4.2 (conjugacy), step 5.1 (homeomorphism and compactness), and step 6.1 (mixing and density of periodic points), with the topological transfers conditional on ; the sensitivity assertion is step 5.3. Clause 3 consists of step 3.3 (constant codes) and step 4.3 (hyperbolicity). Clause 4 consists of step 4.4 (tail convergence), step 5.2 (stable curve), step 4.5 (backward orbit), and step 6.2 (unstable curve): choose smaller than both parameter-neighbourhood radii and define and for . Then both curves pass through , are injective because their first coordinate is their parameter and is invertible, lie in the respective stable and unstable sets, and have tangents in and . Those cones intersect only at zero, so the tangent lines are distinct and is transverse.
Remarks
-
The theorem is deliberately explicit: the constants , , the margins and the cone aperture are all uniform for and , so the hypothesis on is a finite, checkable condition rather than an abstract smallness statement. The genuine smallness requirement is only together with .
-
The second hypothesis, that is again close to , is what makes the unstable curve available by the same forward half-tail construction. It is verified for the smooth periodic oscillator in The rescaled pulse endpoint map converges to the kick in , and the period map is smooth, symplectic and -close to .
-
No structural-stability theorem is invoked: the coded set, its conjugacy with the shift and the two curves are constructed directly.
The smooth -periodic pulsed oscillator: the normalized pulse, its Hamiltonian and its stroboscopic (period) map
Definition
The normalized pulse. By Test function cutoffs and euclidean localization, applied to , choose with and on a neighborhood of . Thus there are with on . Before taking any integral, extend by zero to , retaining the notation . Its compact support inside makes this extension identically zero near both endpoints, hence smooth on . The continuous extended function is integrable on ; by additivity and monotonicity of the integral and the integral of a constant,
using integrability of continuous functions (A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion), additivity and monotonicity (For : is integrable on if and only if it is integrable on and on , and then ; with the oriented form for arbitrary , If on and both are integrable then ; and ), and the integral of a constant (If on then for every partition ; in particular every constant function is integrable, with ).
Define on and let be its extension by zero outside . Since has compact support in , this zero extension is smooth and compactly supported in . Linearity of the integral (Integrable functions on form a set closed under sums and scalar multiples, and ) gives
Fix such a pulse for the constructions below. The resulting coefficient and endpoint maps may depend on this choice; the later estimates apply to every such , with constants allowed to depend on it.
The periodic pulse. Fix a real parameter and a smallness parameter , and put . Define to be the -periodic function whose restriction to is
Both definitions use the same zero extension , so the endpoint values and are defined and equal to . Since vanishes on neighborhoods of and , all its derivatives vanish there; the -periodic extension of is therefore of class on ( Euclidean maps and diffeomorphisms). Also . To verify its normalization, put
The integral function of the continuous has derivative by The first fundamental theorem: if is integrable on and continuous at , then ; in particular a continuous has as a primitive and A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion, and the chain rule (The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with ) gives on the pulse interval. Since vanishes near its endpoints, is differentiable across as well. Since is continuous and therefore integrable on , the second part of the fundamental theorem (The second fundamental theorem: if is differentiable on with and is integrable, then ) gives
The Hamiltonian and its equations. Use the phase domain with coordinates and standard symplectic form and matrix , as in A phase domain, its canonical one-form and its standard symplectic two-form. For each fixed time , define the smooth Hamiltonian function
The Hamiltonian-vector-field convention is , for which The Hamiltonian field of a function on a phase domain is , and the Poisson bracket is gives . Here and , so the associated time-dependent first-order system is
equivalently the second-order equation ; the right-hand side is in , hence continuous and locally Lipschitz in the state variable, so every initial condition has a unique maximal solution (First-order systems, initial value problems, and solutions on intervals, Extensions, maximal solutions, maximal intervals, and global solutions, Every Picard–Lindelöf initial value problem has one maximal solution on an open interval). The system is -periodic in .
Free rotation and pulse endpoint maps. Over the first subinterval the pulse vanishes and the system is the free oscillator; define the free rotation
which is the time- solution operator of , : the map solves the free system by the derivative identities of sine and cosine (The derivatives of sine and cosine are cosine and minus sine) and has initial data . Moreover by the zero-set statement (The zero sets of sine and cosine and the least positive common period 2 pi), by positivity on (Pi is the first positive zero of sine), and (Parity and the Pythagorean identity for sine and cosine), so . Uniqueness of solutions then identifies the endpoint map with .
For the rescaled pulse equation is
obtained from the second half of the period by the substitution . For each initial state , let be the open maximal interval containing of its solution to the rescaled equation. Define
where is the unique maximal solution with (Every Picard–Lindelöf initial value problem has one maximal solution on an open interval). For the original -periodic system, let be the maximal existence interval of the solution through at time , and set . Define the stroboscopic map by
The change of time variable identifies solutions on with solutions of the rescaled equation on . Concatenating with the unique free solution on shows and there, where is the stroboscopic map of The stroboscopic (time-) map of a -periodic first-order system. Conversely, restricting any solution through time to the pulse interval and applying the same change of variables gives a solution of the rescaled equation through ; uniqueness identifies both maps.
Remarks
-
The phase variables are dimensionless in this definition; no units, masses or measured quantities occur. The parameter and the pulse data are pure numbers, and the entire construction is a mathematical model of a periodically forced one-degree-of-freedom oscillator.
-
The pulse has width and total strength , so converges to a formal unit impulse as ; no meaning is assigned to the limit as a physical force. The endpoint map is computed on the companion page cm-math-chaos-examples by explicit integration and used only as a comparison object.
-
Nothing in this definition asserts that is smooth, invertible, symplectic, close to , or defined on any particular set; these are the contents of The rescaled pulse endpoint map converges to the kick in , and the period map is smooth, symplectic and -close to and A smooth periodic one-degree-of-freedom oscillator with polynomial pulse forcing has stroboscopic chaos and a transverse homoclinic point.
The rescaled pulse endpoint map converges to the kick in , and the period map is smooth, symplectic and -close to
Statement
Fix , put , , and let , , , , , the rescaled pulse equation, the endpoint map and the stroboscopic map be as in The smooth -periodic pulsed oscillator: the normalized pulse, its Hamiltonian and its stroboscopic (period) map. Let
so that . Then there are constants and depending only on and such that for every :
- (existence on the pulse) for every the solution of the rescaled equation with initial data exists on and stays in the compact tube , ; hence is defined on , , and
for the Euclidean norm and the operator norm; 2. (closeness of the period map) ; 3. (smoothness, invertibility, symplecticity) is of class on an open neighbourhood of ; is invertible for every and is injective on , so is a diffeomorphism onto its image; and
that is, is symplectic; 4. (the reverse-conjugated map) let and on a neighbourhood of . Then is of class there, and there is , depending only on and , with
Consequently, each of the six componentwise closeness inequalities for and holds on with common bound , where : each coordinate difference is bounded by the Euclidean norm, and each derivative-entry difference is bounded by the operator norm.
Facts & Assumptions
Given: The data in the Statement. Extend by zero to a smooth function on , and put for real .
The model defines this smooth field and its unique maximal solutions (The smooth -periodic pulsed oscillator: the normalized pulse, its Hamiltonian and its stroboscopic (period) map, First-order systems, initial value problems, and solutions on intervals, Extensions, maximal solutions, maximal intervals, and global solutions, Local Lipschitz continuity in the state variable, locally uniform in time and parameters). A solution trapped in a compact time-state tube extends past a finite endpoint (Compact continuation for locally Lipschitz ODEs: a solution whose graph stays in a compact subset of the domain near a finite endpoint extends past it).
Norms of vector integrals are bounded by integrals of their norms (For and integrable when , ; for , is integrable). Integral comparison and differentiation: continuous functions are integrable, their integrals satisfy linearity, monotonicity and the fundamental theorem; Gronwall controls a nonnegative function satisfying (The lower and upper Darboux integrals of a bounded on as and , Darboux integrability as their equality, and the notation , A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion, Integrable functions on form a set closed under sums and scalar multiples, and , If on and both are integrable then ; and , The second fundamental theorem: if is differentiable on with and is integrable, then , Gronwall's integral inequality with variable and constant coefficients).
On an established common compact interval the derivative in initial data solves , ( dependence of solutions on initial data). The jointly smooth field has local smooth dependence on initial data and parameters (Smooth dependence of ODE solutions on parameters); this local assertion will be patched over the established interval, rather than assumed to give existence for a whole period.
Closed Euclidean boxes are compact (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line). The Euclidean inverse-function theorem supplies a C1 local inverse for a C1 map on an open domain with invertible derivative (The Euclidean inverse function theorem); a smooth map then has smooth local inverses by A local inverse of a regular map is . Euclidean calculus uses the chain rule, mean-value inequality, continuity and boundedness of continuous derivatives on compact sets ( Euclidean maps and diffeomorphisms, The total (Fréchet) derivative as the linear first-order approximation with remainder, The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case, The chain rule for total derivatives: , On a convex open set, a uniform bound implies , A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, Open ball, closed ball and sphere in a metric space, Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point, Absolute value in an ordered field, Basic properties of the absolute value, Intervals of : the nine order-convex forms, nondegeneracy, and length).
Proof
At the forward solution through is . For initial data in , and ; hence on . Thus this reference solution lies at least distance from the boundary of the stated tube . Its endpoint is .
On and for , there are constants depending only on such that and : one may take and . Up to the first exit from , subtracting the integral equations gives , so Gronwall gives . Choose with . An exit on is impossible by the distance margin in step 1.1. A maximal solution terminating before the end without exiting is extendible by [F1]. Therefore every datum in has a solution on staying in .
Larger tubes establish the domains needed for inversion. Set , , and . For every datum in , the forward reference solution has , . For a terminal datum at , the reference backward solution is with exactly the same bounds. Both reference families therefore have distance at least from the boundary of . Apply the integral comparison of step 2.1 on this tube, in the backward case after so that the field is . This field has the same boundedness and Lipschitz estimates. With a smaller threshold , both evolutions exist over the whole unit interval for all their data in , and their state differences from the reference evolutions are uniformly . All constants depend only on . In particular , since and its coordinates are bounded by and . This uses the actual inverse preimage, without assuming it lies in .
These families are smooth in initial or terminal data and on neighbourhoods of the compact data sets after decreasing . To justify the whole interval from the local assertion [F3], cover each reference graph by finitely many local time-state-parameter neighbourhoods where [F3] gives smooth local solution operators, and subdivide into finitely many sufficiently short successive intervals. The graph stays inside the tube with a positive margin by step 3.1; the field and its state derivative are bounded on a slightly enlarged compact tube, so one common short interval is admissible at every graph point. At each subdivision endpoint local existence and smooth dependence apply to the endpoint data from the preceding interval. Their finite composition is smooth and equals the unique solution. Shrinking the initial-data and parameter neighbourhoods finitely many times keeps each intermediate value in its admissible neighbourhood. Finitely many such initial-data neighbourhoods cover each compact data set, yielding one positive parameter threshold. The same argument for the time-reflected field gives the backward family. Thus and the backward endpoint map for are smooth near and , respectively, for all sufficiently small , including .
The state comparisons in steps 2.1 and 3.1 also hold in . Indeed, on either compact tube, is bounded by , and is uniformly Lipschitz in , so along compared trajectories . By [F3] their derivative matrices solve the variational equations with the same initial matrix . Gronwall first bounds both matrices by , then, after subtracting their integral equations, bounds the difference by , with fixed constants for the tube. The identical argument for the reflected field controls derivatives in terminal data. Consequently there are finite positive with and . Increasing includes the forward estimates on in the original tube; hence clause 1 follows.
Choose below all previous thresholds and with . Then , because has coordinate margin at least in . Put and . Uniqueness of the original and reflected equations shows that is injective on : solutions sharing their terminal value coincide when evolved backwards. Its differential is invertible by the following direct calculation: the rescaled field is for ; hence with symmetric Hessian and . The variational matrix satisfies and , so . A vector in the kernel of must then lie in the kernel of the invertible matrix , so is invertible. By The Euclidean inverse function theorem, the smooth map on the open set has C1 local inverses at every point; A local inverse of a regular map is upgrades these to smooth local inverses, which agree by injectivity; therefore is a smooth diffeomorphism onto its open image. For every , its backward trajectory starts at and ends at ; hence and the inverse on is exactly . Define , an open neighbourhood of . Then is a smooth diffeomorphism, and clause 2 follows from step 5.1 and , since is a linear isometry.
The matrix computation of step 6.1 also gives symplecticity. The rescaled field is with . Its derivative matrix is with symmetric Hessian. Since and , direct multiplication gives . Therefore the variational matrix satisfies and , giving . This identity forces invertible (a vector in its kernel must lie in the kernel of ). Also satisfies . Applying the chain rule to the composition yields on , proving clause 3.
Since , the conjugated inverse is defined on the open neighbourhood of and has the explicit expression , using . At this is . Fixed linear isometries preserve both state and derivative comparison norms, so step 5.1 gives . The composition is a smooth diffeomorphism onto its image, and clause 4 holds with and clause 2 with .
Increase to positive constants if needed and decrease to include every threshold above. For , each coordinate difference is bounded by the Euclidean difference norm and each derivative entry difference by the operator norm. Thus both maps satisfy the six componentwise closeness inequalities with the common bound , where . The forward tube conclusion was established independently in steps 1.1-2.1 and was preserved throughout the enlarged-domain argument.
Remarks
-
The enlarged compact set is used only for forward and inverse domain control. The stated small forward tube for data in is retained. Constants and smallness thresholds depend on the fixed and ; no global completeness of the polynomial field is assumed.
-
Symplecticity is proved directly for the time-dependent system. The autonomous result The derivative of the Hamiltonian flow satisfies and is not invoked. The coordinate matrix agrees with the canonical layer, while the whole-period smoothness assertion uses explicit finite patching of local solution maps.
A smooth periodic one-degree-of-freedom oscillator with polynomial pulse forcing has stroboscopic chaos and a transverse homoclinic point
Statement
Grant 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), inherited from the compactness and homeomorphism clauses of Explicit persistence under the stated forward and conjugated-inverse bounds: coded chaos, hyperbolic fixed points and transverse homoclinic points. Fix , let , , and the stroboscopic map be as in The smooth -periodic pulsed oscillator: the normalized pulse, its Hamiltonian and its stroboscopic (period) map, and let , , be the two-sign shift space of The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences. Then there is , depending only on and , such that for every :
- there is a function that is a homeomorphism of onto a compact subset of and satisfies ; in particular is compact and -invariant, and is conjugate to the shift;
- is continuous, topologically mixing, has dense periodic points and is sensitive with a positive constant; hence it is chaotic in the stated sense (Topological mixing, dense periodic points, sensitive dependence, and the stated chaos list);
- the two constant codes give two hyperbolic fixed points of , one of each sign;
- for every nonconstant code that is constant outside a finite set, the point is a transverse homoclinic point of the corresponding fixed point, and distinct such codes give distinct points (Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family).
All statements are about the explicit smooth -periodic ordinary differential equation and its time- map; no empirical claim, measurement or physical assumption occurs.
Facts & Assumptions
Given: The parameter , the fixed normalized pulse , and for each the periodic coefficient , the Hamiltonian , the rescaled pulse equation, the rotation , the endpoint map and the stroboscopic map of The smooth -periodic pulsed oscillator: the normalized pulse, its Hamiltonian and its stroboscopic (period) map.
Structure of the model (The smooth -periodic pulsed oscillator: the normalized pulse, its Hamiltonian and its stroboscopic (period) map): is and -periodic with and ; the associated system is , , smooth and locally Lipschitz in the state; and is its time- map.
Pulse approximation (The rescaled pulse endpoint map converges to the kick in , and the period map is smooth, symplectic and -close to ): there are and depending only on and such that for the maps and are defined and on a neighbourhood of , , have with , is a symplectic diffeomorphism onto its image, and the conjugate map , , satisfies and is likewise and diffeomorphic onto its image near ; moreover both and satisfy each of the six componentwise closeness inequalities displayed in the statement of Explicit persistence under the stated forward and conjugated-inverse bounds: coded chaos, hyperbolic fixed points and transverse homoclinic points on with the common constant , where .
Under 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), the perturbed horseshoe (Explicit persistence under the stated forward and conjugated-inverse bounds: coded chaos, hyperbolic fixed points and transverse homoclinic points): for every with and every diffeomorphism onto its image on a neighbourhood of satisfying the six closeness inequalities with constant on , and whose conjugate does the same, the conclusions of clauses 1-4 above hold for under these same axioms with sensitivity constant and with all codes constant outside finite sets.
A homeomorphism here means a bijection whose forward and inverse maps are continuous in the stated metrics (Continuity of a map between metric spaces, at a point and globally, in the - form); conjugacy means such a homeomorphism satisfying . Compactness means that every open cover of the metric subspace has a finite subcover (Open cover, subcover, compact metric space, and compact subset of a metric space). Chaos has the four properties in Topological mixing, dense periodic points, sensitive dependence, and the stated chaos list. Hyperbolicity means that every eigenvalue of the fixed-point differential has modulus different from ; a transverse homoclinic point is a point different from the fixed point lying in both invariant sets, with injective curves in those sets through it and nonzero linearly independent tangents (Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family, using metric convergence Convergence of a sequence in a metric space: iff in ).
Proof
Choice of the threshold: put and let , so that for the number satisfies and .
Hypotheses of the perturbed horseshoe for : by [F2] (with the identification of as the time- map in [F1]), for the maps and are , hence , diffeomorphisms onto their images on a neighbourhood of , and both satisfy each of the six componentwise closeness inequalities of [F3] on with the common constant ; in particular is defined and on a neighbourhood of with the same inequalities. Thus the hypotheses of [F3] are met with .
Conclusions: applying [F3] to gives clauses 1-4 for the stroboscopic map: the coding homeomorphism onto a compact invariant set with , chaotic behaviour of , the two hyperbolic fixed points of the constant codes, and transverse homoclinic points for all codes constant outside a finite set, in the sense of [F4]. Distinct codes give distinct points because is injective.
Remarks
-
The threshold is explicit: it is the minimum of the pulse-approximation threshold and the two smallness conditions on from Explicit persistence under the stated forward and conjugated-inverse bounds: coded chaos, hyperbolic fixed points and transverse homoclinic points. No qualitative structural-stability theorem is used.
-
The forced oscillator is a dimensionless mathematical model. A mechanical interpretation with a mass, a length scale and an angular frequency would multiply and by those scales and rescale the Hamiltonian; that interpretation, its units and its physical scope belong to the consuming physics pages and are not asserted here.
-
Periodic driving supplies energy to the system; no energy conservation or autonomous structure is claimed. The horseshoe and homoclinic point concern the time- map and its compact invariant set.
5 · Examples, experiments and counterexamples
None yet.
Sources
- G. Teschl, Ordinary Differential Equations and Dynamical Systems, AMS Graduate Studies in Mathematics 140 (author's preliminary online edition, complete PDF), Section 11.5, the two-sided shift on finitely many symbols with the metric (11.35)
- P. Cvitanović, R. Artuso, R. Mainieri, G. Tanner, G. Vattay, Chaos: Classical and Quantum (ChaosBook.org, edition 17.6.8, complete PDF), Chapter 14 Section 14.6, symbolic dynamics and the binary itinerary of a trajectory
- R. Devaney and Z. Nitecki, Shift automorphisms in the Hénon mapping, Communications in Mathematical Physics 67 (1979) 137-146, the coding of an invariant Cantor set by bi-infinite binary sequences
- G. Teschl, Ordinary Differential Equations and Dynamical Systems, AMS Graduate Studies in Mathematics 140 (author's preliminary online edition, complete PDF), Section 11.5, the metric (11.35) on two-sided sequence spaces and Lemma 11.15
- P. Cvitanović, R. Artuso, R. Mainieri, G. Tanner, G. Vattay, Chaos: Classical and Quantum (ChaosBook.org, edition 17.6.8, complete PDF), Chapter 14 Section 14.6, the distance between itineraries
- G. Teschl, Ordinary Differential Equations and Dynamical Systems, AMS Graduate Studies in Mathematics 140 (author's preliminary online edition, complete PDF), Section 13.1, contraction and invariant-coding constructions for quadratic horseshoe maps
- R. Devaney and Z. Nitecki, Shift automorphisms in the Hénon mapping, Communications in Mathematical Physics 67 (1979) 137-146, nested-disk coding by a contraction on a compact set
- G. Teschl, Ordinary Differential Equations and Dynamical Systems, AMS Graduate Studies in Mathematics 140 (author's preliminary online edition, complete PDF), Section 11.5, the proof that the itinerary map for the tent map is a homeomorphism, and Lemma 11.15
- P. Cvitanović, R. Artuso, R. Mainieri, G. Tanner, G. Vattay, Chaos: Classical and Quantum (ChaosBook.org, edition 17.6.8, complete PDF), Chapter 15 Section 15.2, finite memory and finite foresight of the binary itinerary
- R. Devaney and Z. Nitecki, Shift automorphisms in the Hénon mapping, Communications in Mathematical Physics 67 (1979) 137-146, coding of invariant sets by which of two components contains successive iterates
- 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
- G. Teschl, Ordinary Differential Equations and Dynamical Systems, AMS Graduate Studies in Mathematics 140 (author's preliminary online edition, complete PDF), Section 13.2, homoclinic orbits and the Smale-Birkhoff homoclinic theorem
- P. Cvitanović, R. Artuso, R. Mainieri, G. Tanner, G. Vattay, Chaos: Classical and Quantum (ChaosBook.org, edition 17.6.8, complete PDF), Chapter 15 Section 15.2, periodic and nonperiodic itineraries and their limiting behaviour
- R. Devaney and Z. Nitecki, Shift automorphisms in the Hénon mapping, Communications in Mathematical Physics 67 (1979) 137-146, coding of the invariant set and convergence of coded orbits
- G. Teschl, Ordinary Differential Equations and Dynamical Systems, AMS Graduate Studies in Mathematics 140 (author's preliminary online edition, complete PDF), Section 13.2, stable and unstable manifolds and transverse homoclinic points of a hyperbolic fixed point
- R. Devaney and Z. Nitecki, Shift automorphisms in the Hénon mapping, Communications in Mathematical Physics 67 (1979) 137-146, Lemma 4 and Proposition 3, invariant sectors with a uniform expansion factor
- P. Cvitanović, R. Artuso, R. Mainieri, G. Tanner, G. Vattay, Chaos: Classical and Quantum (ChaosBook.org, edition 17.6.8, complete PDF), Chapter 15 Section 15.1, stable and unstable manifolds of a fixed point
- R. Devaney and Z. Nitecki, Shift automorphisms in the Hénon mapping, Communications in Mathematical Physics 67 (1979) 137-146, Lemma 4 and Proposition 3: invariant sectors with uniform expansion for the Jacobian and its inverse
- G. Teschl, Ordinary Differential Equations and Dynamical Systems, AMS Graduate Studies in Mathematics 140 (author's preliminary online edition, complete PDF), Section 13.2, the stable and unstable directions at a hyperbolic fixed point
- G. Teschl, Ordinary Differential Equations and Dynamical Systems, AMS Graduate Studies in Mathematics 140 (author's preliminary online edition, complete PDF), Part 2, contraction and implicit-recurrence methods in a complete metric space of sequences
- 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.1-15.2, continuation of stable and unstable curves by weighted contractions
- G. Teschl, Ordinary Differential Equations and Dynamical Systems, AMS Graduate Studies in Mathematics 140 (author's preliminary online edition, complete PDF), Sections 13.1-13.2, stable and unstable manifolds of the horseshoe fixed points and transverse homoclinic points
- 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.1-15.2, continuation of stable and unstable curves and the complete horseshoe
- R. Devaney and Z. Nitecki, Shift automorphisms in the Hénon mapping, Communications in Mathematical Physics 67 (1979) 137-146, invariant sectors and hyperbolic structure of the invariant set
- G. Teschl, Ordinary Differential Equations and Dynamical Systems, AMS Graduate Studies in Mathematics 140 (author's preliminary online edition, complete PDF), Chapter 13, perturbation arguments for near-integrable maps and implicit-function estimates
- R. Devaney and Z. Nitecki, Shift automorphisms in the Hénon mapping, Communications in Mathematical Physics 67 (1979) 137-146, uniform estimates for maps close to a quadratic model
- R. Devaney and Z. Nitecki, Shift automorphisms in the Hénon mapping, Communications in Mathematical Physics 67 (1979) 137-146, Proposition 4 and its proof, quadratic root location in the horseshoe region
- G. Teschl, Ordinary Differential Equations and Dynamical Systems, AMS Graduate Studies in Mathematics 140 (author's preliminary online edition, complete PDF), Chapter 13, implicit-function and perturbation estimates for the horseshoe region
- R. Devaney and Z. Nitecki, Shift automorphisms in the Hénon mapping, Communications in Mathematical Physics 67 (1979) 137-146, Theorem statement iv) and Prop. 3-4: for large parameters the invariant set is hyperbolic and conjugate to the 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 Section 15.2, Remark A1.1: transverse self-intersections persist under small perturbations of the Hénon parameters
- G. Teschl, Ordinary Differential Equations and Dynamical Systems, AMS Graduate Studies in Mathematics 140 (author's preliminary online edition, complete PDF), Sections 13.1-13.2, the Smale horseshoe and transverse homoclinic theorem
- G. Teschl, Ordinary Differential Equations and Dynamical Systems, AMS Graduate Studies in Mathematics 140 (author's preliminary online edition, complete PDF), Sections 4.6-4.7 (periodic equations) and 13.3 (Melnikov's method for periodically forced planar systems)
- S. Dyatlov, Lecture notes for 18.155, MIT (2022), complete course notes PDF, test functions and smooth cutoffs, used for the existence of the normalized pulse
- G. Teschl, Ordinary Differential Equations and Dynamical Systems, AMS Graduate Studies in Mathematics 140 (author's preliminary online edition, complete PDF), Sections 2.4 (Gronwall), 7.1 (dependence on initial data) and 13.3 (pulse pertubation of a homoclinic loop)
- P. Cvitanović, R. Artuso, R. Mainieri, G. Tanner, G. Vattay, Chaos: Classical and Quantum (ChaosBook.org, edition 17.6.8, complete PDF), Chapter 8 Sections 8.2 and 8.5, Hamiltonian maps and symplectic structure
- G. Teschl, Ordinary Differential Equations and Dynamical Systems, AMS Graduate Studies in Mathematics 140 (author's preliminary online edition, complete PDF), Sections 13.1-13.3, the Smale horseshoe and periodically forced planar systems
- P. Cvitanović, R. Artuso, R. Mainieri, G. Tanner, G. Vattay, Chaos: Classical and Quantum (ChaosBook.org, edition 17.6.8, complete PDF), Chapter 15 Section 15.2, the complete Hénon horseshoe and its persistence
- R. Devaney and Z. Nitecki, Shift automorphisms in the Hénon mapping, Communications in Mathematical Physics 67 (1979) 137-146, hyperbolic invariant sets of quadratic area-preserving maps