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 — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Cm Math Canonical
- Cm Math Chaos
- 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
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- 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
- 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 companion page to cm-math-chaos records explicit finite checks of its
results. Everything here is mathematics: the examples carry
domain: mathematics, depend only on the mathematical items of the parent
page and on mathematical suppliers, and make no physical or empirical claim.
No measurement, simulation or numerical integration is involved; every number
is an exact algebraic expression in , and rational
constants.
Explicit constants at : the contraction factor, the fixed points and the constant-code solutions evaluates the model at : , , , contraction factor , and the constant-code fixed points with the exact identity .
The constant-code slope transform at : the invariant slope of and the cone constants solves the fixed-slope equation exactly, obtaining the small root , and verifies the cone constants , and that the slope lemma requires.
The single-flip code at : a nonperiodic coded orbit converging to the fixed point at both ends exhibits the single-flip code , for : it is nonperiodic and nonconstant, its coded orbit is not periodic and differs from , and it converges to at both ends, so is a homoclinic point of the fixed point.
The endpoint computation: the free rotation , the kick and computes the endpoint data of the pulsed oscillator: the free oscillator carries to over , the limiting pulse carries it to , and hence ; it also checks the pulse support and normalisation .
Explicit root margins at : endpoint signs and , and for evaluates the perturbed root bounds at , : the unperturbed quadratic has endpoint values and at and , the derivative bound is , and the cone margins , and hold, with root margins at least and .
3 · Logical flowchart
4 · Definitions, postulates, theorems and proofs
None yet.
5 · Examples, experiments and counterexamples
Explicit constants at : the contraction factor, the fixed points and the constant-code solutions
Example
Take in The square-root recurrence is a contraction of with a unique coded solution, so that
Then , so ; , so ; and the contraction constant of on is
The constant codes () are solved by the constant sequences with
the two displayed bounds hold because ; and both satisfy the exact identity . Every coded sequence has , and its sign is the corresponding symbol.
Facts & Assumptions
Given: The parameter , the constants , , and the numbers .
Model data (The square-root recurrence is a contraction of with a unique coded solution, The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences): for , , , the operator is a contraction of with constant ; its unique fixed point satisfies , and .
Square roots and squares (Square roots exist: a unique with ; the positives are , Absolute value in an ordered field, Integer powers , Basic properties of the absolute value): , , because , and because and both sides are nonnegative.
Verification
Endpoint inequality: and , so ; by [L2] , which is the self-mapping inequality of The square-root recurrence is a contraction of with a unique coded solution. Similarly , so and .
The fixed points: for one has, using [L2], Hence by [L2] and , so the constant sequence is a fixed point of ; by uniqueness it is .
Bounds: and , consistent with the general bounds of [L1]; the strict bounds and follow from and .
Remarks
- All verifications are exact algebraic identities involving , and , with rational comparisons for the inequalities; no numerical integration, simulation or measurement is involved.
The constant-code slope transform at : the invariant slope of and the cone constants
Example
Take , so , , and let be the constant-code value of the all- code. The fixed slope of the forward transform at is the small root of , i.e. of
and one has . Moreover and maps into with Lipschitz constant .
Facts & Assumptions
Given: The parameter , the constants , , , and the slope maps of Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family.
Slope transform data (Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family, Cone invariance and expansion, and convergence of the slope graph transforms to unique invariant stable and unstable line fields): for , , , and , the forward slope map satisfies and ; under these hypotheses the cone is invariant under at points with second coordinate of absolute value at least , with expansion factor .
Constant-code check using The square-root recurrence is a contraction of with a unique coded solution, clause 4: for the given , direct expansion gives and . Thus the constant sequence lies in and satisfies ; uniqueness of the coded fixed point identifies it with the all- code.
Square roots and inequalities (Square roots exist: a unique with ; the positives are , Absolute value in an ordered field, Basic properties of the absolute value): because ; ; because .
Verification
Fixed slope: the equation is equivalent to , whose roots are ; the small root is . Since and , one has .
Cone constants: and . Also , since . By [L3], ; also , so the invariance and expansion hypotheses of [L1] hold with . The induced bounds are and with , in agreement with [L1].
Remarks
- The fixed slope is the slope of the invariant unstable line at the fixed point in the cone ; the computation uses only the exact fixed-point relation and rational estimates for the two square roots.
The single-flip code at : a nonperiodic coded orbit converging to the fixed point at both ends
Example
Take and let be the code with
the single-flip code. Then is constant outside a finite set (indeed outside ), is not the constant code , and is not periodic: for every , because the unique coordinate at which equals is whereas equals only at . Consequently the coded point satisfies and for every , while
Facts & Assumptions
Given: The parameter , the single-flip code , the coding map and the phase map of The quadratic map has a compact coded invariant set conjugate to the two-sign shift, with chaos under , and the fixed point , , of Constant codes give the fixed points, and finite nonconstant word codes give homoclinic orbits converging to a fixed point at both ends.
Finite-word data (Constant codes give the fixed points, and finite nonconstant word codes give homoclinic orbits converging to a fixed point at both ends): a code that equals the constant code outside a finite set has coded orbit converging to at both ends, and for ; distinct codes give distinct points.
Conjugacy and injectivity (The quadratic map has a compact coded invariant set conjugate to the two-sign shift, with chaos under , Finite symbol windows determine the code: locality of the iterates, coding continuity and injectivity of ): for all and , and is injective; hence would force , and would force .
The constant code (Constant codes give the fixed points, and finite nonconstant word codes give homoclinic orbits converging to a fixed point at both ends, clause 1): with .
Signs (The square-root recurrence is a contraction of with a unique coded solution, clause 4, Square roots exist: a unique with ; the positives are , Absolute value in an ordered field): for every code and every ; in particular because and .
Verification
Nonperiodicity of the code: for , the coordinate of equals , while ; hence . Also because .
The point differs from the fixed point: by [L4], , so directly; alternatively this follows from the injectivity and in [L1], [L2].
No return to the initial point: if for some , then by [L2], so by injectivity, contradicting step 1.1.
Two-sided convergence: the code equals outside , so [L1] applies with and gives as . Together with steps 2.1 and 2.2 this exhibits as a nonperiodic homoclinic point of the fixed point .
Remarks
-
The verification uses only the coding dictionary and the finite-word convergence; it does not compute the coordinates of , which have no closed form.
-
The same argument applies to every nonconstant code that is constant outside a finite set: none of these coded orbits is periodic, and each converges to the corresponding fixed point in both time directions.
The endpoint computation: the free rotation , the kick and
Example
In the model of The smooth -periodic pulsed oscillator: the normalized pulse, its Hamiltonian and its stroboscopic (period) map:
- the free oscillator , on the interval carries the initial data to
- the rescaled equation , has the exact solution , , so its endpoint map is
because ; and
Moreover with and the restriction of the pulse to has support contained in . On its support is the periodic union .
Facts & Assumptions
Given: The model data , , , , the rescaled equation and the maps of The smooth -periodic pulsed oscillator: the normalized pulse, its Hamiltonian and its stroboscopic (period) map.
Trigonometric solution (The derivatives of sine and cosine are cosine and minus sine, Sine and cosine defined by their real power series, Parity and the Pythagorean identity for sine and cosine, The zero sets of sine and cosine and the least positive common period 2 pi, Pi is the first positive zero of sine): the functions , satisfy , and the initial conditions; , , and the Pythagorean identity gives .
Pulse data (The smooth -periodic pulsed oscillator: the normalized pulse, its Hamiltonian and its stroboscopic (period) map): is smooth, nonnegative and compactly supported inside with ; is -periodic with ; on and on .
Since is continuous on , it is integrable (A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion); its integral function satisfies on by the first part of the fundamental theorem of calculus (The first fundamental theorem: if is integrable on and continuous at , then ; in particular a continuous has as a primitive), and by [L2].
Uniqueness of solutions (Every Picard–Lindelöf initial value problem has one maximal solution on an open interval): the free oscillator field is continuous and locally Lipschitz, so its initial value problems have a unique maximal solution; every solution with the same initial data is a restriction of that maximal solution.
Verification
direct; differentiate the displayed trigonometric solutions, integrate the constant right-hand side, and substitute the two endpoint maps.
Free rotation: by [L1] the displayed solves the free equations with the stated initial data, so by the uniqueness clause of [L4] it is the solution and the time- map is .
Kick: for the rescaled equation is , . By [L3], and solve it with the stated initial data; evaluating at and using gives .
Composition: substituting into and expanding gives , which is the displayed identity.
Pulse support and normalization: by [L2], on the single period the coefficient vanishes outside the compact set , is nonnegative, and has integral . Periodicity translates that set by each , , giving the stated global support union. The integral on one period is ; the global periodic coefficient does not have bounded support.
Remarks
- The computation is a formal comparison object: the endpoint map is the endpoint map of the limiting pulse of unit total strength concentrated in zero time. The genuine model has , and the comparison is quantified in The rescaled pulse endpoint map converges to the kick in , and the period map is smooth, symplectic and -close to .
Explicit root margins at : endpoint signs and , and for
Example
Take in Root bounds and dependence for the perturbed scalar recurrence , so that , , and suppose the defect bound is . Then:
- for all the unperturbed quadratic satisfies
so the signs at the endpoints are strictly opposite with margins and ; 2. the derivative bound is , and
- the root margins are at least and , since the slope of is bounded by on .
Facts & Assumptions
Given: The parameter , , , the defect bound , the perturbed recurrence data of Root bounds and dependence for the perturbed scalar recurrence and the inverse-branch estimates of A map -close to has a unique inverse branch for its first component, with derivative bounds.
Perturbed root data (Root bounds and dependence for the perturbed scalar recurrence ): with as the defect bound, the root map satisfies and every root satisfies and .
Elementary arithmetic (Square roots exist: a unique with ; the positives are , Absolute value in an ordered field, Basic properties of the absolute value, Intervals of : the nine order-convex forms, nondegeneracy, and length): , , , , , , , and , .
Verification
Endpoint signs: for the sum ranges over , so at is at most , and at is at least .
Derivative bound and cone constants: substituting , into gives , and the displayed inequalities follow from [L2].
Margins: with and , the endpoint margins guaranteed by the root lemma are and : the endpoint values of have magnitudes at least and , and on . Thus the root distances are at least and , consistent with the general margins of [L1].
Remarks
- Every number is evaluated symbolically at the worst case and ; larger or smaller only improve the margins.
Sources
- G. Teschl, Ordinary Differential Equations and Dynamical Systems, AMS Graduate Studies in Mathematics 140 (author's preliminary online edition, complete PDF), Section 13.1, quadratic horseshoe maps and their invariant values
- 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 fixed points of the Hénon horseshoe
- R. Devaney and Z. Nitecki, Shift automorphisms in the Hénon mapping, Communications in Mathematical Physics 67 (1979) 137-146, invariant sectors with a uniform expansion factor
- G. Teschl, Ordinary Differential Equations and Dynamical Systems, AMS Graduate Studies in Mathematics 140 (author's preliminary online edition, complete PDF), Section 13.2, expanding and contracting directions near 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), Section 13.2, homoclinic orbits and their codes
- R. Devaney and Z. Nitecki, Shift automorphisms in the Hénon mapping, Communications in Mathematical Physics 67 (1979) 137-146, coding of invariant orbits by bi-infinite sequences
- G. Teschl, Ordinary Differential Equations and Dynamical Systems, AMS Graduate Studies in Mathematics 140 (author's preliminary online edition, complete PDF), Section 3.3, the linear planar oscillator and its rotation matrices
- S. Dyatlov, Lecture notes for 18.155, MIT (2022), complete course notes PDF, test functions and normalized smooth bumps
- R. Devaney and Z. Nitecki, Shift automorphisms in the Hénon mapping, Communications in Mathematical Physics 67 (1979) 137-146, 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, perturbation bounds for the horseshoe region