Alphabeta Math
Pipeline-generated
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

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 C1-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 X±={−1,+1}Z, its shift S±, the isometry φ onto the published two-symbol shift space, and the closed ball BR 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 BR 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 Ts(x)n=sna+xn−1+xn+1 is a contraction of BR with a unique coded solution then shows that the square-root recurrence xn=sna+xn−1+xn+1 defines, for a≥100, a contraction of BR with constant 1/L, L=a−2R: each code s has a unique solution x(s) with sign⁡xn(s)=sn, ∣xn(s)∣≥L and xn+1+xn−1=xn2−a. Finite symbol windows determine the code: locality of the iterates, coding continuity and injectivity of h(σ)=(x−1(σ),x0(σ)) shows that the m-th iterate from the zero sequence sees only a window of 2m−1 symbols, with uniform error 2RL−m, and deduces that the coding map h(s)=(x−1(s),x0(s)) is continuous and injective.

The coded invariant set. The quadratic map F(x,y)=(y,y2−a−x) has a compact coded invariant set conjugate to the two-sign shift, with chaos under ACω proves that F(x,y)=(y,y2−a−x) satisfies F∘h=h∘S± and that Λ=h(X±) is invariant. Granting the Axiom of Countable Choice once, through the equivalence between closed and sequentially closed subsets of R2, h 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 ACω. The set Λ is sequentially compact without choice and compact under ACω+DC. Sensitivity with constant 2L 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 (ru,ru), ru=1+ua+1, 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 Cku={∣u∣≤k∣v∣} and Cks={∣v∣≤k∣u∣} with Cku∩Cks={0}, and slope maps Φy(h)=1/(2y−h) and Ψx(r)=1/(2x−r). It distinguishes D(Fa−1) from the pointwise inverse matrix [DFa(x,y)]−1, 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 C1 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 k(2L−k)≥1, the slope contractions with factor λ−2, and uniform convergence of the slope iterations to the unique invariant line fields with slopes in [−k,k]. Weighted half-tail contractions for qn=Msn(qn−1,qn+1) give a unique C1 curve with tangent slope bounded by c/(1−q) 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 C1 family of solutions with derivative bounded by c/(1−q). The coded curves are genuine C1 stable and unstable curves of F, with transverse intersection at every finite-word homoclinic point applies it to the quadratic family to obtain C1 stable and unstable curves through every finite-word homoclinic point, with tangents in cones of aperture 1/2, and identifies the local stable set of each fixed point (ru,ru) with the constructed graph over ∣b−ru∣≤1/8 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 C2 map C1-close to F has a unique inverse branch for its first component, with O(ε) derivative bounds solves the first component of a map close to F by a contraction, giving a unique inverse branch V with O(ε) estimates. Root bounds and C1 dependence for the perturbed scalar recurrence v2−a−u−w+e(u,v,w)=0 shows that the perturbed scalar recurrence v2−a−u−w+e(u,v,w)=0 has, for each sign, exactly one root in the corresponding window, with explicit margins ≥3/4, derivative bounds d≤2/13, and exact orbit form Pu,w(v)=0  ⟺  B(u,V(u,v))=V(v,w). Explicit persistence under the stated forward and conjugated-inverse bounds: coded chaos, hyperbolic fixed points and transverse homoclinic points constructs, for every C2 diffeomorphism G satisfying six explicit closeness inequalities with 0<ε≤1/6 and C(a,R)ε≤1, where C is the defect-bound constant of Root bounds and C1 dependence for the perturbed scalar recurrence v2−a−u−w+e(u,v,w)=0 (and the same bounds for the distinct map Σ∘G−1∘Σ), a coded invariant set ΛG=hG(X±) on which G is conjugate to the shift. Under ACω it is mixing with dense periodic points and chaotic with sensitivity constant 2l; its constant codes give hyperbolic fixed points, and its finite-word codes give transverse homoclinic points. No structural-stability theorem is invoked. The smooth P-periodic pulsed oscillator: the normalized pulse, its Hamiltonian and its stroboscopic (period) map defines the smooth P-periodic pulsed oscillator q′′=−q+βδ(t)(q2−a) with phase form ω=dq∧dp and Hamiltonian convention ιXHω=dH, using a normalized bump pulse of strength ∫βδ=1. The rescaled pulse endpoint map converges to the kick K(q,p)=(q,p+q2−a) in C1, and the period map is smooth, symplectic and C1-close to F proves that the rescaled pulse endpoint map converges to the kick K(q,p)=(q,p+q2−a) in C1 as δ→0, that the period map Gδ=Kδ∘R0 is a symplectic C∞ diffeomorphism close to F with its conjugate map also close to F, 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 a=100, the invariant slope and cone margins, the single-flip homoclinic code, the δ=0 endpoint computation K∘R0=F, and the perturbed root and margin numbers.

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicableprecheck passOpen item page →

The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences

Definition

Write Σ±:={−1,+1} and

X± := Σ±Z = { s : s is a function Z→Σ± },

with the function-set convention of The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}; for s∈X± write sk:=s(k). The elements of X± are called two-sign bilateral sequences.

Coding correspondence with the two-symbol space. Let

φ:X±⟶{0,1}Z,φ(s)k:=sk+12∈{0,1},

and let X2:={0,1}Z, d2 and σ2 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 φ(s)k=(sk+1)/2 and φ−1(t)k=2tk−1 define maps X±→X2 and X2→X± that are inverse to each other, coordinate by coordinate.

Metric expression on X±. Define

D±(s,t):=d2(φ(s),φ(t))(s,t∈X±).

Unwinding the series of The bilateral two-symbol shift space, its metric, its shift map and its cylinder sets and using ∣φ(s)k−φ(t)k∣=12∣sk−tk∣ for every k∈Z gives the explicit expression

D±(s,t)=∑k≥02−(k+1) ∣sk−tk∣  +  ∑k≥12−(k+1) ∣s−k−t−k∣.

Both series converge by comparison with the geometric series ∑k≥02−k=2 (Series, partial sums, convergence and the sum, divergence, and the tail series, For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥1 the series diverges, Integer powers am, Absolute value in an ordered field), because ∣sk−tk∣∈{0,2} for every k; hence D±(s,t) is a well-defined nonnegative real number. Whether D± 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 (X±,D±) onto (X2,d2).

The shift. The (bilateral) shift of X± is

S±:X±⟶X±,S±(s)k:=sk+1(k∈Z, s∈X±).

For m∈Z its iterate satisfies S±m(s)k=sk+m; in particular S± is a bijection with inverse S±−1(s)k=sk−1, and S±=φ−1∘σ2∘φ.

Bounded bilateral sequences. A function x:Z→R is bounded when its range {xk:k∈Z} is a bounded subset of R (Lower bound, bounded below, bounded set). Write

ℓ∞(Z):={ x:Z→R : x is bounded },∥x∥∞:=sup⁡{ ∣xk∣ : k∈Z }.

The set {∣xk∣:k∈Z} whose supremum is taken is nonempty and bounded above (Lower bound, bounded below, bounded set), so ∥x∥∞ is a well-defined nonnegative real number (Suprema and infima are unique, Complete ordered field (least-upper-bound property)). For R≥0 put

BR:={ x∈ℓ∞(Z) : ∥x∥∞≤R }.

Thus BR is the closed ball of radius R in the supremum norm, and ∥x∥∞≤R is by definition the statement that ∣xk∣≤R for every k∈Z (Lower bound, bounded below, bounded set, Absolute value in an ordered field).

Remarks

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

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 S be a nonempty set, let B(S) be the set of bounded functions S→R and let d∞ be the supremum metric on B(S) (The supremum metric d∞(f,g)=sup⁡x∣f(x)−g(x)∣ is a metric on the bounded real-valued functions on a nonempty set); write 0 for the zero function. For R≥0 put

BR(S):={ f∈B(S) : ∣f(s)∣≤R for every s∈S }.

Let X±, φ, X2, d2, D± be as in The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences. Then:

  1. (B(S),d∞) is a complete metric space (Complete metric space: every Cauchy sequence converges in the space);
  2. for every R≥0, (BR(S),d∞) is a complete metric space;
  3. D±(s,t)=d2(φ(s),φ(t)) is a metric on X± (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric), and φ:(X±,D±)→(X2,d2) is a bijective isometry (Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R for the underlying notion of distance);
  4. consequently ℓ∞(Z) with the distance ∥x−y∥∞ is a complete metric space, BR is complete for every R≥0, and the same holds for the one-sided bounded sequences, that is for S=N.

Facts & Assumptions

Given: A nonempty set S, the space B(S) of bounded real functions on S with supremum metric d∞, the numbers R≥0, and the objects X±,φ,X2,d2,D± of The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences.

[F2]

d2 is a metric on X2 (The bilateral shift metric is a metric, cylinders are its basic balls, and the shift space is sequentially compact, clause 1) and D±(s,t)=d2(φ(s),φ(t)) by definition of D±; φ is a bijection with inverse t↦(2tk−1)k∈Z (The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences).

[F3]

Cauchy sequences, convergence and completeness are those of Cauchy sequence in a metric space, Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R and Complete metric space: every Cauchy sequence converges in the space; a sequence in a metric space converges to z exactly when the distances to z tend to 0.

[F5]

Limits preserve eventual inequalities: if the real sequences (xj) and (yj) converge and xj≤yj eventually, then lim⁡jxj≤lim⁡jyj (Limits preserve non-strict inequalities, Sequences of reals: bounded, eventually, frequently, tails, subsequences).

[F6]

Absolute value: ∣a∣≥0, ∣a∣=0 exactly for a=0, ∣a−b∣=∣b−a∣, ∣a+b∣≤∣a∣+∣b∣ and ∣a∣≤M exactly when −M≤a≤M for M≥0 (Absolute value in an ordered field, Basic properties of the absolute value, The triangle inequality).

Proof

technique · direct; take coordinatewise limits of a Cauchy sequence and estimate the supremum distance by an eventual coordinate bound
1.1givenF1F3F4F6

Let (fj)j∈N be a Cauchy sequence in (B(S),d∞) and fix s∈S. For all j,k one has ∣fj(s)−fk(s)∣∈{∣fj(s′)−fk(s′)∣:s′∈S} and therefore ∣fj(s)−fk(s)∣≤d∞(fj,fk) by [F1] and [F6]. Hence (fj(s))j is a Cauchy sequence of reals, so it converges; define f(s):=lim⁡jfj(s)∈R. This defines a function f:S→R.

1.2givenF2F6

Isometry property: for s,t∈X± put Φ(s,t):=d2(φ(s),φ(t)). Then Φ(s,t)=0 if and only if φ(s)=φ(t) (by [F2], [F6] and definiteness of d2), if and only if s=t since φ is injective ([F2]). Symmetry holds because d2 is symmetric, and the triangle inequality follows from that of d2: D±(s,u)=d2(φs,φu)≤d2(φs,φt)+d2(φt,φu)=D±(s,t)+D±(t,u) ([F2], [F6]). Finally D±(s,t)=d2(φs,φt) says exactly that the bijection φ preserves distances, so it is an isometry onto (X2,d2).

2.1step 1.1F1F5F6

Boundedness of f: since (fj) is Cauchy, there is N with d∞(fj,fN)≤1 for all j≥N; then ∣fj(s)∣≤∣fN(s)∣+1≤sup⁡s′∣fN(s′)∣+1=:M for all j≥N and all s, where M<∞ because fN is bounded ([F1], [F6]). For fixed s, the bounds −M≤fj(s)≤M pass to the limit by [F5], giving −M≤f(s)≤M, hence ∣f(s)∣≤M by [F6]. Thus f∈B(S).

3.1step 1.1step 2.1F1F3F5F6

Uniform error estimate: given ε>0, choose N with d∞(fj,fk)≤ε for all j,k≥N. Fix j≥N and s∈S; then ∣fk(s)−fj(s)∣≤d∞(fk,fj)≤ε for every k≥N ([F1], [F6]), thus fj(s)−ε≤fk(s)≤fj(s)+ε. Passing these inequalities to the coordinate limit with [F5] gives fj(s)−ε≤f(s)≤fj(s)+ε, or ∣f(s)−fj(s)∣≤ε by [F6]. Taking the supremum over s in [F1] gives d∞(f,fj)≤ε for every j≥N, so fj→f in (B(S),d∞).

4.1step 2.1step 3.1F1F5F6

The space (BR(S),d∞) is complete: if (fj) is Cauchy in (BR(S),d∞), then by steps 2.1 and 3.1 its pointwise limit f lies in B(S) and fj→f; for each s one has −R≤fj(s)≤R for all j, so [F5] gives −R≤f(s)≤R, hence ∣f(s)∣≤R by [F6]; hence f∈BR(S) and the Cauchy sequence converges inside BR(S).

5.1step 3.1step 4.1step 1.2givenF1∎

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 S=Z: by the definitions of The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences the space B(Z) is exactly ℓ∞(Z) and d∞(f,g)=sup⁡k∣fk−gk∣=∥f−g∥∞, so clauses 1 and 2 give completeness of ℓ∞(Z) and of each BR, R≥0; with S=N 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 (X2,d2) transfers verbatim, and it will be used in this form for sequential compactness and for the chaos properties of the shift.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

The square-root recurrence Ts(x)n=sna+xn−1+xn+1 is a contraction of BR with a unique coded solution

Statement

Fix a≥100 and put

R:=a+3,L:= a−2R .

Let X± and BR 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 s∈X± define

Ts:BR⟶RZ,(Tsx)n:=sn a+xn−1+xn+1 (n∈Z).

For a nonzero real r, define sign⁡r:=+1 when r>0 and sign⁡r:=−1 when r<0. Once clause 2 establishes Ts(BR)⊆BR, its iterates are defined by Ts0:=id⁡BR and Tsm+1:=Ts∘Tsm for m∈N.

Then:

  1. a−2R=(a−1)2−7≥74, so L≥74>1; moreover a+2R<R2, hence a+2R<R;
  2. for every s∈X± and x∈BR the radicands a+xn−1+xn+1 lie in [a−2R,a+2R]⊆(0,∞), so Tsx is a well-defined bounded sequence with ∥Tsx∥∞≤a+2R<R; in particular Ts(BR)⊆BR;
  3. for all x,y∈BR and every s∈X±,

∥Tsx−Tsy∥∞≤1L ∥x−y∥∞,1L<1;

  1. hence Ts has, for each s∈X±, exactly one fixed point x(s)∈BR, and for every n∈Z

sign⁡xn(s)=sn,∣xn(s)∣≥L,xn+1(s)+xn−1(s)=xn(s)2−a.

Facts & Assumptions

Given: The real number a≥100, the constants R=a+3 and L=a−2R, the shift space X± and the complete ball BR 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 Ts.

[F1]

Square roots (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}, Complete ordered field (least-upper-bound property)): every u≥0 has a unique u1/2:=u≥0 with (u)2=u; if 0≤u≤v then u≤v, since u,v≥0 and (u)2=u≤v=(v)2; in particular u2=u for u≥0 and x>0 for x>0. Also a≥10 because a≥100=102 and t↦t2 is increasing on [0,∞).

[F2]

The ball BR is nonempty and, with the supremum distance ∥x−y∥∞, 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: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric); the value ∥x∥∞ satisfies ∥x∥∞≤R exactly when ∣xn∣≤R for all n (The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences, Absolute value in an ordered field).

[F3]

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 0<α≤1, and contraction): a contraction of a nonempty complete metric space into itself, with constant q<1, has exactly one fixed point.

[F4]

Absolute value and order: ∣u∣≤M exactly when −M≤u≤M for M≥0; ∣uv∣=∣u∣∣v∣; and sn∈{−1,+1} for every n (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).

[F5]

Order arithmetic on intervals (Intervals of R: the nine order-convex forms, nondegeneracy, and length, Complete ordered field (least-upper-bound property)): if ∣xj∣≤R for j∈Z then a−R−R≤a+xn−1+xn+1≤a+R+R; and for reals u≥v>0 one has u≥v>0 by [F1].

Proof

technique · direct; bound the radicands on the ball, estimate the square-root Lipschitz constant from below by $2L$, and apply Banach's fixed point theorem
1.1givenF1algebra

Constants: by [F1], a≥10, so R=a+3≥13 and a−2R=a−2a−6=(a−1)2−7≥81−7=74; hence L=a−2R≥74>1 by [F1]. Further R2=a+6a+9 and R2−(a+2R)=a+6a+9−a−2a−6=4a+3>0, so a+2R<R2 and [F1] gives a+2R<R.

2.1givenstep 1.1F1F2F4F5

Well-definedness and self-mapping: let s∈X±, x∈BR and n∈Z. Since ∣xn±1∣≤R by [F2], [F5] gives a−2R≤a+xn−1+xn+1≤a+2R; by step 1.1 this is a positive interval, so [F1] makes a+xn−1+xn+1 a well-defined positive real, and Tsx is a function Z→R. Moreover ∣(Tsx)n∣=∣sn∣a+xn−1+xn+1=a+xn−1+xn+1≤a+2R<R by [F4], [F1] and step 1.1. Taking the supremum over n gives ∥Tsx∥∞≤a+2R<R, so Ts(BR)⊆BR.

2.2givenstep 1.1F1F2F4F5algebra

Contraction: let x,y∈BR and n∈Z, and put u:=a+xn−1+xn+1, v:=a+yn−1+yn+1; by step 1.1 both lie in [a−2R,a+2R]⊆[L2,∞), so u,v≥L>0 by [F1]. Then ∣u−v∣=∣u−v∣u+v≤∣u−v∣2L≤∣xn−1−yn−1∣+∣xn+1−yn+1∣2L≤∥x−y∥∞L, where the first identity is the algebraic identity u−v=(u−v)(u+v) ([F1], [F4]), the second inequality uses [F4] and [F5], and the last uses [F2]. Since ∣(Tsx)n−(Tsy)n∣=∣u−v∣ by [F4], taking the supremum over n gives ∥Tsx−Tsy∥∞≤∥x−y∥∞/L, and 1/L<1 by step 1.1.

3.1step 2.1step 2.2F2F3

Fixed point: BR is nonempty (0∈BR) and complete in the sup distance by [F2]; Ts maps BR into itself by step 2.1 and is a contraction with constant 1/L<1 by step 2.2; [F3] therefore gives exactly one x(s)∈BR with Tsx(s)=x(s).

4.1step 3.1step 1.1F1F4F5∎

Properties of the fixed point: fix n and write r:=a+xn−1(s)+xn+1(s)>0, so that xn(s)=snr by the fixed point equation. If sn=+1 then xn(s)=r>0, and if sn=−1 then xn(s)=−r<0; hence in both cases sign⁡xn(s)=sn and ∣xn(s)∣=r. Squaring the fixed point equation gives xn(s)2=r2=a+xn−1(s)+xn+1(s), which is the recurrence, and ∣xn(s)∣=r≥L by step 1.1, [F1] and [F5].

Remarks

  • The choice a≥100 is a convenient explicit margin: it gives a≥10, hence L2≥74 and the self-mapping inequality a+2R<R with room to spare. The argument works for every a with a−2R>1 and a+2R<R2.

  • No choice principle is used: the contraction and the completeness of BR are choice-free, and the fixed point is unique.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Finite symbol windows determine the code: locality of the iterates, coding continuity and injectivity of h(σ)=(x−1(σ),x0(σ))

Statement

Fix a≥100 and let R=a+3, L=a−2R, X±, D± and BR 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 Ts(x)n=sna+xn−1+xn+1 is a contraction of BR with a unique coded solution. Define the quadratic phase map

F:R2⟶R2,F(x,y):=(y,  y2−a−x),

and for each s∈X± let x(s) be the unique fixed point of Ts in BR. Define the coding map

h:X±⟶R2,h(s):=(x−1(s), x0(s)).

Then:

  1. F is a bijection with F−1(x,y)=(x2−a−y, x), and for every s∈X± and n∈Z

F(xn−1(s),xn(s))=(xn(s),xn+1(s));

  1. (locality) for all m≥0, n∈Z and s,t∈X±: if sj=tj for all j with ∣j−n∣≤m−1, then (Tsm0)n=(Ttm0)n, where Tsm is the m-fold iterate and 0 the zero sequence;
  2. (uniform error) for all m≥0 and s∈X±,

∥Tsm0−x(s)∥∞≤2R L−m;

  1. (coding continuity) if s,t∈X± agree at every coordinate j with ∣j∣≤m, then ∣xn(s)−xn(t)∣≤4R L−m for n∈{−1,0}, and consequently

∥h(s)−h(t)∥2≤42 R L−m;

in particular h is continuous at every s∈X± (Continuity of a map between metric spaces, at a point and globally, in the ε-δ form) when X± carries D± and R2 the Euclidean metric;

  1. (injectivity) h is injective.

Facts & Assumptions

Given: The parameter a≥100, the constants R,L, the shift spaces X±, the balls BR, the operators Ts, their fixed points x(s) of The square-root recurrence Ts(x)n=sna+xn−1+xn+1 is a contraction of BR with a unique coded solution, the map F and the coding map h displayed above.

[F1]

Fixed point data (The square-root recurrence Ts(x)n=sna+xn−1+xn+1 is a contraction of BR with a unique coded solution): for each s∈X±, x(s)∈BR, Tsx(s)=x(s), sign⁡xn(s)=sn, ∣xn(s)∣≥L and xn+1(s)+xn−1(s)=xn(s)2−a for all n. The iterate convention for Tsm is the one fixed in that lemma.

[F2]

Banach error estimate (The a priori bound d(x∗,xn)≤qnd(x1,x0)/(1−q) and the a posteriori bound d(x∗,xn+1)≤q d(xn+1,xn)/(1−q), 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 0<α≤1, and contraction): for a contraction with constant q<1 on a complete metric space, the iterates from any starting point x0 satisfy d(x∗,xm)≤qmd(x1,x0)/(1−q); here q=1/L, L≥74>2, so 1/(1−1/L)=L/(L−1)≤2.

[F3]

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 Ts(x)n=sna+xn−1+xn+1 is a contraction of BR with a unique coded solution clauses 1-3, Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric): 0∈BR; ∥y∥∞≤R for y∈BR; Ts maps BR into itself and contracts with constant 1/L<1; therefore induction gives ∥Tsm0∥∞≤R for every m≥0; the distance on X± is D±(s,t)=d2(φ(s),φ(t)) with the metric d2 of X2={0,1}Z.

[F4]

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 u,v∈X2 and Fm:={−m,…,m}, if d2(u,v)<2−m then uj=vj for ∣j∣≤m; 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 s,t∈X±: if D±(s,t)<2−m then sj=tj for ∣j∣≤m.

[F5]

Absolute value, order and the sequence 0 (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): ∣uv∣=∣u∣∣v∣, ∣u+w∣≤∣u∣+∣w∣, ∣u∣≤M if and only if −M≤u≤M for M≥0, and the zero sequence satisfies (Ts00)n=0.

[F6]

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: xk→x iff d(xk,x)→0 in R): h is continuous at s when for every ε>0 there is δ>0 such that D±(s,t)<δ implies ∥h(s)−h(t)∥2<ε.

Proof

technique · direct; an induction on $m$ for the finite window, the a priori Banach estimate for the uniform error, and the explicit inverse of $F$ for injectivity
1.1givenF1algebra

Inverse of F: for every (x,y)∈R2, the two compositions are F−1(F(x,y))=F−1(y,y2−a−x)=(y2−a−(y2−a−x),y)=(x,y) and F(F−1(x,y))=F(x2−a−y,x)=(x,x2−a−(x2−a−y))=(x,y). Thus F is a bijection with F−1(x,y)=(x2−a−y,x). For s∈X± and n∈Z, [F1] gives xn+1(s)=xn(s)2−a−xn−1(s), hence F(xn−1(s),xn(s))=(xn(s),xn(s)2−a−xn−1(s))=(xn(s),xn+1(s)).

1.2givenF1F3algebra

Locality, by induction on m≥0: for m=0 the sequence Ts00=0 is independent of s, so the claim is vacuous. Assume it holds for m and let s,t agree for ∣j−n∣≤m. Then (Tsm+10)n=sna+(Tsm0)n−1+(Tsm0)n+1. The symbol sn=tn lies in ∣n−n∣=0≤m; by the induction hypothesis applied at n−1 and n+1 (for which the required windows are ∣j−(n−1)∣≤m−1 and ∣j−(n+1)∣≤m−1, both contained in ∣j−n∣≤m) the two radicands coincide; hence the two values coincide. This proves clause 2.

2.1givenstep 1.2F1F2F3

Uniform error: Tsm0 is the m-th Banach iterate of the starting point 0∈BR for the contraction Ts with constant 1/L on the complete space BR ([F3], [F1]). By [F2], ∥Tsm0−x(s)∥∞≤qm∥Ts0−0∥∞/(1−q)≤qmR/(1−q)≤2RL−m, where ∥Ts0∥∞≤R by [F3].

3.1givenstep 1.2step 2.1F5algebra

Coding estimates: let s,t agree for ∣j∣≤m and let n∈{−1,0}. For n=0, locality at level m requires agreement for ∣j∣≤m−1, which holds; for n=−1 it requires agreement for ∣j+1∣≤m−1, which implies ∣j∣≤m, so the required agreement also holds. Hence (Tsm0)n=(Ttm0)n, and two applications of step 2.1 give ∣xn(s)−xn(t)∣≤∣(Tsm0)n−(Ttm0)n∣+4RL−m=4RL−m for n=−1,0 (Absolute value in an ordered field, [F5]). Consequently ∥h(s)−h(t)∥2=∣x−1(s)−x−1(t)∣2+∣x0(s)−x0(t)∣2≤2⋅4RL−m.

4.1givenstep 3.1F4F6algebra

Continuity of h: let ε>0 and choose m≥0 with 42 RL−m<ε, possible because L>1, hence L−m=(1/L)m tends to 0 (For ∣r∣<1 the sequence rk is null, and for ∣r∣>1 the sequence ∣r∣k diverges to +∞, Series, partial sums, convergence and the sum, divergence, and the tail series). Put δ:=2−m. If D±(s,t)<δ, then by [F4] sj=tj for ∣j∣≤m, so step 3.1 gives ∥h(s)−h(t)∥2<ε. By [F6] this is continuity of h at s, and s was arbitrary.

5.1givenstep 1.1F1∎

Injectivity: suppose h(s)=h(t). For u∈X± and n∈Z put zn(u):=(xn−1(u),xn(u)). By step 1.1, zn+1(u)=F(zn(u)) and zn−1(u)=F−1(zn(u)) for all n; induction on n≥0 gives zn(u)=Fn(z0(u)) and induction on n≤0 gives zn(u)=Fn(z0(u)) (using the bijectivity of F from step 1.1). Since z0(s)=h(s)=h(t)=z0(t), it follows that zn(s)=zn(t) for all n, hence xn(s)=xn(t) for all n. By [F1], sn=sign⁡xn(s)=sign⁡xn(t)=tn, so s=t.

Remarks

  • Clause 2 is the quantitative content of "finite memory": the value of the m-th approximation at coordinate n sees only the 2m−1 symbols centred at n. Clause 4 turns this into a modulus of continuity of the coding map through the uniform error estimate.

  • Injectivity uses only that F is invertible and that the sign of xn recovers sn; no differentiability is used in this item.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

The quadratic map F(x,y)=(y,y2−a−x) has a compact coded invariant set conjugate to the two-sign shift, with chaos under ACω

Statement

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

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

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

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

Facts & Assumptions

[F1]

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

[F2]

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

[F4]

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

[F5]

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

Proof

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

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

1.2givenF3

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

2.1step 1.1F1

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

3.1givenstep 2.1F1F2F3F4

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

3.2givenstep 2.1F1F3algebra

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

4.1givenstep 3.1F1F2F3

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

4.2step 2.1step 3.1F2F3F5

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

4.3givenstep 2.1step 3.1F1F2F3

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

4.4step 2.1step 3.1F1F2F3

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

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

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

Remarks

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

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

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

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Constant codes give the fixed points, and finite nonconstant word codes give homoclinic orbits converging to a fixed point at both ends

Statement

Fix a≥100, let R=a+3, L=a−2R, let x(s) and h 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 Ts(x)n=sna+xn−1+xn+1 is a contraction of BR with a unique coded solution and Finite symbol windows determine the code: locality of the iterates, coding continuity and injectivity of h(σ)=(x−1(σ),x0(σ)), and let F(x,y)=(y,y2−a−x). For u∈{−1,+1} write uˉ∈X± for the constant code uˉn:=u, and put

ru:=1+ua+1,

so that r+>0>r−, and write Ws,Wu 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:

  1. xn(uˉ)=ru for every n, and ru2=a+2ru; consequently h(uˉ)=(ru,ru) is a fixed point of F;
  2. if s∈X± satisfies sn=u for all ∣n∣≥N for some N≥0, then

Fn(h(s))⟶(ru,ru)as n→+∞and as n→−∞;

  1. if moreover s is not the constant code uˉ, then h(s)≠(ru,ru), Fn(h(s))≠(ru,ru) for every n∈Z, and h(s)∈Ws(ru,ru)∩Wu(ru,ru); hence h(s) is a homoclinic point of the fixed point (ru,ru);
  2. distinct codes s≠t of the kind in clause 2 give distinct points h(s)≠h(t); in particular the finite-word deviations from the two constant codes produce infinitely many distinct homoclinic points.

Facts & Assumptions

Given: The parameter a≥100, the constants R,L, the coded sequence x(s) and map h, the phase map F, the constant codes uˉ, the numbers ru, and a code s with sn=u for ∣n∣≥N.

[F1]

Coding data (The square-root recurrence Ts(x)n=sna+xn−1+xn+1 is a contraction of BR with a unique coded solution, Finite symbol windows determine the code: locality of the iterates, coding continuity and injectivity of h(σ)=(x−1(σ),x0(σ))): x(s)∈BR is the unique fixed point of Ts, sign⁡xn(s)=sn, ∣xn(s)∣≥L, xn+1(s)+xn−1(s)=xn(s)2−a; locality: (Tsm0)n depends only on sj with ∣j−n∣≤m−1; uniform error: ∥Tsm0−x(s)∥∞≤2RL−m; h is injective; F(xn−1(s),xn(s))=(xn(s),xn+1(s)).

[F2]

Conjugacy and invariant set (The quadratic map F(x,y)=(y,y2−a−x) has a compact coded invariant set conjugate to the two-sign shift, with chaos under ACω): F(h(s))=h(S±s) for all s, and the coded set is invariant.

[F3]

Square roots and the equation r2=a+2r (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}, Absolute value in an ordered field): a+2ru>0, a+2ru=∣ru∣ and ru=ua+2ru, because ru2=a+2ru and sign⁡ru=u.

[F4]

Stable and unstable sets (Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family): Ws(zˉ)={z:Fn(z) defined for all n≥0, Fn(z)→zˉ}, Wu(zˉ)={z:F−n(z)→zˉ}, and a homoclinic point of a fixed point zˉ is a point of Ws(zˉ)∩Wu(zˉ) different from zˉ; convergence is metric convergence (Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R, Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

[F6]

Absolute value and the base arithmetic (Basic properties of the absolute value, Absolute value in an ordered field): ∣uv∣=∣u∣∣v∣, ∣u+w∣≤∣u∣+∣w∣, and 102=100.

[F7]

Squaring is strictly increasing on the nonnegative reals (Squaring is monotone on the nonnegatives): if 0≤x<y then x2<y2, and if 0≤x≤y then x2≤y2.

Proof

technique · direct; check the constant codes against the recurrence, use the locality of the finite windows for the two-sided convergence, and invoke injectivity of the coding for the distinctness of finite-word homoclinic points
1.1givenF3F6F7algebra

The constants ru: since a≥100, [F7] applied to 102≤a=(a)2 gives a≥10. Also (a+1)2=a+2a+1>a+1, so [F7] gives a+1<a+1; and 12<a+1 gives a+1>1. Thus a+2−2a+1>a−2a=a(a−2)>0, so a+2ru=a+2+2ua+1>0 for both signs. The number ru=1+ua+1 satisfies ru2=1+2ua+1+(a+1)=a+2+2ua+1=a+2ru, and sign⁡ru=u by a+1>1. Hence by [F3] ru=ua+2ru.

2.1step 1.1F1F2F6F7algebra

Constant codes: let x~ be the constant sequence x~n:=ru. By step 1.1, (Tuˉx~)n=ua+ru+ru=ua+2ru=ru=x~n for all n; so x~ is a fixed point of Tuˉ in BR (indeed ∣ru∣≤1+a+1<a+2<R by [F7] and a≥100). By uniqueness ([F1]) x(uˉ)=x~, hence h(uˉ)=(ru,ru); and F(ru,ru)=(ru,ru2−a−ru)=(ru,ru) because ru2−a=2ru.

3.1step 2.1F1F2F5algebra

Convergence in the forward direction: let m≥0 and let n≥N+m−1; then every j with ∣j−n∣≤m−1 satisfies j≥n−(m−1)≥N, hence sj=u=uˉj. By [F1], (Tsm0)n=(Tuˉm0)n. Therefore ∣xn(s)−xn(uˉ)∣≤∣xn(s)−(Tsm0)n∣+∣(Tuˉm0)n−xn(uˉ)∣≤4RL−m for n≥N+m−1, using the uniform error bound of [F1] twice and x(uˉ)=x~ of step 2.1. Given ε>0, choose m with 4RL−m<ε, possible by [F5]; then ∣xn(s)−ru∣<ε for all n≥N+m−1. Hence xn(s)→ru as n→+∞, and therefore Fn(h(s))=(xn−1(s),xn(s))→(ru,ru) by [F1].

3.2step 2.1F1F2algebra

Nonconstancy: suppose s≠uˉ; then there is k with sk≠u, and by [F1] sign⁡xk(s)=sk≠u=sign⁡ru, so xk(s)≠ru and h(s)=(x−1(s),x0(s)); if h(s)=(ru,ru) then x−1(s)=x0(s)=ru, and then by the recurrence xn(s)=ru for all n, so sn=sign⁡xn(s)=u for all n, a contradiction. Hence h(s)≠(ru,ru). Since Fn(h(s))=h(S±ns) by [F2] and each S±ns is again not constant, the same argument gives Fn(h(s))≠(ru,ru) for all n∈Z.

4.1step 3.1F1algebra

Convergence in the backward direction: if n≤−N−(m−1) and ∣j−n∣≤m−1, then j≤n+(m−1)≤−N, so ∣j∣≥N and sj=u=uˉj. Locality [F1] therefore gives (Tsm0)n=(Tuˉm0)n, and the same two uniform error bounds as in step 3.1 yield ∣xn(s)−ru∣≤4RL−m. Hence xn(s)→ru as n→−∞. Since F is a bijection ([F1]) and Fn(h(s))=(xn−1(s),xn(s)), this says Fn(h(s))→(ru,ru) as n→−∞.

5.1step 3.1step 4.1step 3.2F1F4

Homoclinic points: by steps 3.1 and 4.1, the point h(s) lies in Ws(ru,ru)∩Wu(ru,ru) (the forward and backward orbits are defined for all times because F is a bijection and Fn(h(s))=(xn−1(s),xn(s)) for all n), and by step 3.2 it differs from the fixed point. By the definition [F4] it is a homoclinic point of (ru,ru).

6.1step 5.1F1∎

Distinctness: if s≠t then h(s)≠h(t) because h is injective by [F1]; the nonconstant finite-word codes are infinite in number (for example the codes differing from uˉ at exactly the coordinates 0,1,…,j for j≥0 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 uˉ for ∣n∣≥N, the deviation satisfies ∣xn(s)−ru∣≤4RL−m whenever ∣n∣≥N+m−1.

  • 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.

DefinitionDefinition: AI-adaptedProof: Not applicableprecheck passOpen item page →

Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family

Definition

The quadratic family. For a∈R let

Fa:R2⟶R2,Fa(x,y):=(y, y2−a−x),

with differential at (x,y)∈R2

DFa(x,y)=(01−12y).

The inverse map is

Fa−1(x,y)=(x2−a−y,x),

and its differential at (x,y) is

D(Fa−1)(x,y)=(2x−110).

Here DFa(x,y)−1 denotes the inverse matrix of DFa(x,y), namely (2y−110); it is not the same notation as D(Fa−1)(x,y), which evaluates the derivative of the inverse map at the point (x,y). All matrices act on column vectors of R2 (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder, The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case).

Complex coordinates and modulus. Use C:=R[x]/(x2+1), with real numbers embedded as constant classes and i:=x+(x2+1), so i2=−1 (The complex numbers as R[x]/(x2+1), with the real embedding and imaginary unit i). This is a field and each element has a unique form α+iβ with α,β∈R (C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (a−bi)/(a2+b2)). Define its modulus by

∣α+iβ∣:=α2+β2,

where the square root is the unique nonnegative real square root (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}). Identify C2 with pairs of complex coordinates; a real matrix acts on it by the same matrix entries, extended C-linearly.

Hyperbolic fixed points. Let U,V⊆R2 be open, let G:U→V be a C1 diffeomorphism, and let zˉ∈U∩V satisfy G(zˉ)=zˉ. Its eigenvalues are the numbers λ∈C for which DG(zˉ)v=λv for some v∈C2∖{0}. The fixed point zˉ is hyperbolic when every such eigenvalue satisfies ∣λ∣≠1. A global C1 diffeomorphism of R2 is the special case U=V=R2.

Cones. Fix k∈(0,1). The unstable cone and stable cone of aperture k are

Cku:={ (u,v)∈R2 : ∣u∣≤k∣v∣ },Cks:={ (u,v)∈R2 : ∣v∣≤k∣u∣ }

(Absolute value in an ordered field); both are closed subsets of R2, they are closed under multiplication by real scalars, and Cku∩Cks={0}, because a nonzero vector in the intersection would satisfy ∣u∣≤k∣v∣ and ∣v∣≤k∣u∣, hence ∣u∣≤k2∣u∣<∣u∣.

Slopes. A line through the origin not contained in the horizontal axis is written uniquely as {(hv,v):v∈R} with the slope parameter h=u/v; here ∣h∣≤k characterises the lines contained in Cku. Similarly a line not contained in the vertical axis is written uniquely as {(u,ru):u∈R} with the slope parameter r=v/u, and ∣r∣≤k characterises the lines contained in Cks.

For real numbers x,y two maps on slope parameters are defined:

Φy(h):=12y−h(h≠2y)(forward slope map),Ψx(r):=12x−r(r≠2x)(backward slope map).

The intended reading is the graph-transform reading: DFa(x,y) carries the line {(hv,v):v∈R} at (x,y) to the line {(h′v,v):v∈R} at Fa(x,y) with h′=Φy(h), and D(Fa−1)(x,y) carries the line {(u,ru):u∈R} at (x,y) to the line {(u,r′u):u∈R} at Fa−1(x,y) with r′=Ψx(r). 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 s:Z→R; write sn:=s(n). Put zn:=(sn−1,sn). An unstable line field along s is a family (Lnu)n∈Z of lines through the origin of R2 such that DFa(zn) maps Lnu onto Ln+1u for every n. A stable line field along s is a family (Lns)n∈Z such that D(Fa−1)(zn+1) maps Ln+1s onto Lns for every n. The latter evaluates the derivative of the inverse map at zn+1. When s satisfies sn+1=sn2−a−sn−1, one has zn+1=Fa(zn), 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 L≥2, sequences with ∣sn∣≥L, and apertures satisfying k(2L−k)≥1, existence and uniqueness of line fields with slopes in [−k,k] are proved in the companion lemma on this page.

Stable and unstable sets. Let G:Z→Z be a bijection of a metric space (Z,d) (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric) with fixed point zˉ (so G(zˉ)=zˉ). Put

Ws(zˉ):={ z∈Z : Gn(z) is defined for every n≥0 and Gn(z)→zˉ as n→∞ },

Wu(zˉ):={ z∈Z : G−n(z) is defined for every n≥0 and G−n(z)→zˉ as n→∞ },

where convergence is that of the metric d (Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R). The sets Ws(zˉ) and Wu(zˉ) are the stable set and the unstable set of zˉ.

These orbit-based definitions also apply to a local map. Let U,V⊆R2 be open, let G:U→V be a C1 diffeomorphism, and let zˉ∈U∩V satisfy G(zˉ)=zˉ. Define G0(z):=z and recursively Gn+1(z):=G(Gn(z)) whenever Gn(z)∈U; define G−n−1(z):=G−1(G−n(z)) whenever G−n(z)∈V. Then

WGs(zˉ):={z∈U:Gn(z) is defined for every n≥0 and Gn(z)→zˉ},

WGu(zˉ):={z∈V:G−n(z) is defined for every n≥0 and G−n(z)→zˉ},

where convergence is Euclidean metric convergence. The explicit domain clauses require every forward iterate to lie in U before applying G, and every backward iterate to lie in V before applying G−1. 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 zˉ. For a global bijection on R2 or a local planar diffeomorphism as above, it is transverse when there are ε>0 and C1 maps (Ck Euclidean maps and diffeomorphisms, The derivative f′(c)=lim⁡x→cf(x)−f(c)x−c of f:A→R at a point c∈A that is a limit point of A, and differentiability on a set)

γs,γu:(−ε,ε)⟶R2

such that γs(0)=γu(0)=z, the stable curve takes values in the stable set and the unstable curve takes values in the unstable set, both are injective on (−ε,ε) with γs′(0)≠0≠γu′(0), and the derivative vectors γs′(0),γu′(0)∈R2 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 R: the nine order-convex forms, nondegeneracy, and length.

Remarks

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Cone invariance and expansion, and convergence of the slope graph transforms to unique invariant stable and unstable line fields

Statement

Let a∈R, k∈(0,1) and L≥2. Let s=(sn)n∈Z be a real bilateral sequence with ∣sn∣≥L for every n, put zn:=(sn−1,sn), and let Cku, Cks, Φy, Ψx, DFa and Fa be as in Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family. Write

λ:=2L−k>1,ρ:=λ−2<1,

Assume in addition the aperture condition k(2L−k)≥1, equivalently 1/λ≤k. This condition is needed for invariance of the stated cones and slope interval; L≥2 alone does not imply it for arbitrarily small k. Then:

  1. (cone invariance and expansion) for every n: DFa(zn) maps Cku into itself, and every (u,v)∈Cku satisfies

max⁡(∣v∣, ∣−u+2snv∣) ≥ λ max⁡(∣u∣,∣v∣);

and D(Fa−1)(zn) maps Cks into itself, with max⁡(∣2sn−1u−v∣,∣u∣)≥λmax⁡(∣u∣,∣v∣) for every (u,v)∈Cks; 2. (slope contractions) for every real y with ∣y∣≥L, the map Φy carries [−k,k] into [−1/λ,1/λ]⊆[−k,k] and satisfies ∣Φy(h)−Φy(h′)∣≤ρ ∣h−h′∣ there; the same holds for Ψx for every ∣x∣≥L; 3. (unstable line field) define hn(0):=0 and hn(m+1):=Φsn−1(hn−1(m)) for m≥0. Then (hn(m))m converges for every n to a limit hn∈[−k,k], uniformly in n, and

hn=12sn−1−hn−1(n∈Z);

furthermore DFa(zn) maps the line {(hnv,v):v∈R} onto the line {(hn+1v,v)} for every n, so the lines form the unique unstable line field along s whose slopes all lie in [−k,k]; 4. (stable line field) similarly, rn(0):=0 and rn(m+1):=Ψsn(rn+1(m)) converge to limits rn∈[−k,k] with rn=1/(2sn−rn+1), and D(Fa−1)(zn+1) maps {(u,rn+1u):u∈R} onto {(u,rnu):u∈R}; this is the unique stable line field along s with slopes in [−k,k].

Facts & Assumptions

Given: The parameter a, the aperture k∈(0,1), the bound L≥2, the sequence s with ∣sn∣≥L, 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 h(m), r(m).

[F1]

Cone, slope and matrix data (Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family): DFa(x,y)(u,v)=(v,−u+2yv) and D(Fa−1)(x,y)(u,v)=(2xu−v,u); Cku={∣u∣≤k∣v∣}, Cks={∣v∣≤k∣u∣}, Cku∩Cks={0}. For h≠2y, the matrix gives DFa(x,y)(hv,v)=(v,(2y−h)v), so its image line has slope Φy(h)=1/(2y−h). Likewise, for r≠2x, D(Fa−1)(x,y)(u,ru)=((2x−r)u,u), so its image line has slope Ψx(r)=1/(2x−r).

[F2]

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)): ∣uv∣=∣u∣∣v∣; ∣u−w∣≥∣u∣−∣w∣; if ∣u∣≤k∣v∣ and 0<k<1 then max⁡(∣u∣,∣v∣)=∣v∣; if ∣v∣≤k∣u∣ then max⁡(∣u∣,∣v∣)=∣u∣; and the stated aperture condition gives 1/λ≤k.

[F4]

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: xk→x iff d(xk,x)→0 in R): 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 [−k,k] lies in [−k,k].

Proof

technique · direct; verify the two cone computations, then solve the slope recurrences by a contraction iteration from the far past and the far future
1.1givenF2algebra

Constants: since L≥2 and 0<k<1, we have 2L−k≥4−k>3, so λ=2L−k>1 and 0<ρ=λ−2<1; moreover the aperture hypothesis gives k(2L−k)≥1, hence 1/λ≤k.

2.1givenstep 1.1F1F2algebra

Unstable cone: let (u,v)∈Cku, so ∣u∣≤k∣v∣ and max⁡(∣u∣,∣v∣)=∣v∣ by [F2]. Then DFa(zn)(u,v)=(v,−u+2snv) and ∣−u+2snv∣≥2∣sn∣∣v∣−∣u∣≥(2L−k)∣v∣=λ∣v∣ by [F2]. Also ∣−u+2snv∣≥λ∣v∣≥∣v∣ since λ>1, so max⁡(∣v∣,∣−u+2snv∣)≥λmax⁡(∣u∣,∣v∣). Finally ∣v∣/∣−u+2snv∣≤1/λ≤k whenever v≠0, so the image is in Cku (the case v=0 gives u=0 and image 0).

2.2givenstep 1.1F1F2algebra

Stable cone: let (u,v)∈Cks, so ∣v∣≤k∣u∣ and max⁡(∣u∣,∣v∣)=∣u∣ by [F2]. Then D(Fa−1)(zn)(u,v)=(2sn−1u−v,u) and ∣2sn−1u−v∣≥2L∣u∣−∣v∣≥(2L−k)∣u∣=λ∣u∣; hence max⁡(∣2sn−1u−v∣,∣u∣)≥λmax⁡(∣u∣,∣v∣) and ∣u∣/∣2sn−1u−v∣≤1/λ≤k whenever u≠0, with the zero case trivial.

2.3givenstep 1.1F1F2algebra

Slope contractions: let ∣y∣≥L and h,h′∈[−k,k]; by step 1.1, ∣2y−h∣≥2L−k=λ>0 and ∣2y−h′∣≥λ, so Φy is defined on [−k,k], ∣Φy(h)∣≤1/λ≤k, and ∣Φy(h)−Φy(h′)∣=∣h−h′∣∣2y−h∣∣2y−h′∣≤λ−2∣h−h′∣=ρ∣h−h′∣. The same computation with Ψx proves the second assertion.

3.1givenstep 2.3F2F3F4algebra

Unstable slopes, uniform bounds and contraction: define hn(0):=0, hn(m+1):=Φsn−1(hn−1(m)). By induction, step 2.3 gives ∣hn(m)∣≤1/λ for all m≥1 and n, and ∣hn(m+1)−hn(m)∣≤ρm/λ for all m≥0. Hence for m′≥m, ∣hn(m′)−hn(m)∣≤∑j=mm′−1ρj/λ≤ρmλ(1−ρ), uniformly in n. Thus (hn(m))m is Cauchy; completeness in [F4] gives its limit hn, with ∣hn∣≤1/λ≤k. Passing m′→∞ in the same estimate gives ∣hn−hn(m)∣≤ρm/(λ(1−ρ)) for every n, proving uniform convergence.

3.2givenstep 2.3F2F3F4

Stable slopes: the same argument with rn(0):=0, rn(m+1):=Ψsn(rn+1(m)) gives ∣rn(m+1)−rn(m)∣≤ρm/λ, limits rn∈[−k,k] satisfying rn=Ψsn(rn+1)=1/(2sn−rn+1).

4.1step 3.1step 2.3F4

Unstable recurrence: fixing n and passing to the limit in hn(m+1)=Φsn−1(hn−1(m)), continuity of Φsn−1 on [−k,k] (step 2.3) and the limit rules of [F4] give hn=Φsn−1(hn−1)=1/(2sn−1−hn−1).

4.2step 3.1step 3.2F2F3F4

Uniqueness: let (h~n) be another family with ∣h~n∣≤k and h~n=Φsn−1(h~n−1) for all n. Comparing with the construction gives, by induction on m, ∣h~n−hn(m)∣≤ρm∣h~n−m−hn−m(0)∣≤ρm⋅2k (step 2.3, [F2]); letting m→∞ and using [F3] gives h~n=hn. The stable case is identical with the future-pointing iteration.

5.1step 4.1step 3.2F1

Invariance: by [F1] and step 4.1, DFa(zn) carries the line {(hnv,v)} to the line with slope Φsn(hn)=1/(2sn−hn)=hn+1; since both lines pass through the origin and the first is mapped onto a line (the differential is invertible), the image is exactly {(hn+1v,v):v∈R}. Similarly, D(Fa−1)(zn+1) uses the first coordinate sn of zn+1; by [F1] and step 3.2 it carries {(u,rn+1u):u∈R} onto {(u,rnu):u∈R}.

6.1step 2.1step 2.2step 2.3step 3.1step 3.2step 4.1step 4.2step 5.1∎

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 n, with the rate ρm/(λ(1−ρ)); no compactness of the sequence space is used.

  • Both recurrences are one-sided compositions: hn is determined by the symbols in the infinite past, rn 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.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Weighted half-tail contractions for qn=Msn(qn−1,qn+1) give a unique C1 curve with tangent slope bounded by c/(1−q)

Statement

Let θ∈(0,1), c>0 and put

q:=c (θ+θ−1),and assume q<1.

Let J⊆R be a nonempty compact interval, let s∈X±, and let O⊆R2 be open with J×J⊆O. For u∈{−1,+1} let M~u:O→R be of class C2 (Ck Euclidean maps and diffeomorphisms); write Mu for its restriction to J×J, assume Mu(J×J)⊆J, and suppose that

∣∂1Mu∣≤c,∣∂2Mu∣≤con J×J.

Let (yn)n≥0 be a sequence with yn∈J and let b∗∈J satisfy

yn=Msn(yn−1,yn+1)(n≥1),y0=Ms0(b∗,y1),

and assume there is ρˉ>0 with [yn−ρˉ, yn+ρˉ]⊆J for every n≥0. Choose δ∗>0 such that

[b∗−δ∗, b∗+δ∗]⊆J,δ∗<(1−q)ρˉc,

and put I:=(b∗−δ∗,b∗+δ∗). Write

ℓθ∞(N):={ u:N→R : ∥u∥θ:=sup⁡n≥0θ−n∣un∣<∞ }

with metric ∥u−v∥θ, and define its closed ball

Bρˉ:={u∈ℓθ∞(N):∥u∥θ≤ρˉ}.

For u∈Bρˉ and b∈I, put z−1:=b and zk:=yk+uk for every k≥0, and define Tb:Bρˉ→Bρˉ by

(Tbu)n:=Msn(zn−1,zn+1)−yn(n≥0).

Then:

  1. ℓθ∞(N) is a complete metric space and Bρˉ is complete in the distance ∥u−v∥θ; for every b∈I the map Tb is a contraction with constant q<1, so it has exactly one fixed point u(b)∈Bρˉ;
  2. for every b∈I one has the a priori bound ∥u(b)∥θ≤c ∣b−b∗∣/(1−q), and the map b↦u(b) is Lipschitz on I with

∥u(b′)−u(b)∥θ≤c1−q ∣b′−b∣;

  1. b↦u(b) is continuously differentiable on I into ℓθ∞(N): with zk∗:=yk+uk(b) for k≥0 and z−1∗:=b, the derivative d(b):=du(b)/db∈ℓθ∞(N) is the unique element of ℓθ∞(N) satisfying

dn(b)=∂1Msn(zn−1∗,zn+1∗) dn−1(b)+∂2Msn(zn−1∗,zn+1∗) dn+1(b)(n≥1),

d0(b)=∂1Ms0(b,z1∗)+∂2Ms0(b,z1∗) d1(b),d−1(b):=1,

and ∥d(b)∥θ≤c/(1−q); 4. consequently the local phase curve

γ(b):=(b,  y0+u0(b))

defined for b∈I is C1 with γ′(b)=(1,d0(b)), and so ∣d0(b)∣≤c/(1−q).

Facts & Assumptions

Given: The parameters θ,c,q, the compact interval J, the open neighborhood O, the C2 extensions M~−1,M~+1 and their restrictions M−1,M+1, the two-sign sequence s, the reference data y,b∗, the radius ρˉ and parameter interval I, the weighted space ℓθ∞(N), its closed ball Bρˉ, and the operators Tb.

[F1]

Each M~u is C2 on the open set O, its restriction maps J×J into J, and ∣∂1Mu∣,∣∂2Mu∣≤c on J×J (given). The box J×J is compact by Heine--Borel; hence the first and second partial derivatives are bounded there (Heine-Borel in Rn: with the Euclidean metric a subset of Rn 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, Ck Euclidean maps and diffeomorphisms, Directional derivatives and partial derivatives of a map U⊆Rm→Rn, The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case). If z,z′∈J×J and Δ:=z′−z, the segment z+tΔ lies in J×J. The function g(t):=M~u(z+tΔ) is C2 on an open interval containing [0,1], and the chain rule gives ∣g′(t)∣≤c∥Δ∥1 and ∣g′′(t)∣≤K∥Δ∥12 with a common finite K for both signs (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)). The mean-value inequality (The mean value inequality: if f:[a,b]→Rm is continuous and differentiable on (a,b) with ∥f′∥2≤M, then ∥f(b)−f(a)∥2≤M(b−a)) applied to g gives

∣Mu(z′)−Mu(z)∣≤c∥z′−z∥1,

For the Taylor remainder, the mean-value inequality applied to g′ on [0,t] gives ∣g′(t)−g′(0)∣≤Kt∥Δ∥12; thus ϕ(t):=g(t)−g(0)−tg′(0) has ∣ϕ′(t)∣≤K∥Δ∥12. Applying the same inequality to ϕ on [0,1] gives

∣Mu(z′)−Mu(z)−DMu(z)(z′−z)∣≤K ∥z′−z∥12.

[F2]

The map W:ℓθ∞(N)→ℓ∞(N), (Wu)n:=θ−nun, is a bijection with ∥Wu∥∞=∥u∥θ; hence (ℓθ∞(N),∥⋅−⋅∥θ) is a complete metric space, as an isometric copy of the complete space ℓ∞(N)=B(N). It maps Bρˉ isometrically onto the closed sup-norm ball Bρˉ(N), so that ball and therefore Bρˉ 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: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

[F3]

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 0<α≤1, and contraction): a map of a nonempty complete metric space into itself with constant q<1 has exactly one fixed point, and it is the limit of the iterates from every starting point.

[F4]

Absolute value and order arithmetic (Absolute value in an ordered field, Basic properties of the absolute value, Complete ordered field (least-upper-bound property)): ∣uv∣=∣u∣∣v∣, ∣u+w∣≤∣u∣+∣w∣, and θ−n>0 for all n.

Proof

technique · direct; contract in the weighted supremum norm, estimate the boundary forcing, and linearise by a Taylor remainder estimate in the same norm
1.1givenF1F4algebra

Contraction: let u,v∈Bρˉ and b∈I. Every argument pair of Msn lies in J×J: b∈J and, for k≥0, ∣uk∣,∣vk∣≤ρˉ with [yk−ρˉ,yk+ρˉ]⊆J. The line segment between the two argument pairs also lies in J×J because J is an interval, so the derivative bound in [F1] gives for n≥1 ∣(Tbu)n−(Tbv)n∣≤c(∣un−1−vn−1∣+∣un+1−vn+1∣)≤θn c(θ−1+θ) ∥u−v∥θ=θn q ∥u−v∥θ. For n=0 only the argument z1 varies, so ∣(Tbu)0−(Tbv)0∣≤c∣u1−v1∣≤q∥u−v∥θ because cθ≤q. Multiplying by θ−n and taking the supremum gives ∥Tbu−Tbv∥θ≤q∥u−v∥θ.

2.1givenstep 1.1F1F4algebra

Ball invariance: let b∈I and u∈Bρˉ. For every k≥0, zk=yk+uk∈J by ∣uk∣≤ρˉ and the margin hypothesis; also z−1=b∈J. For n≥1, using the reference recurrence of the statement and [F1], ∣(Tbu)n∣=∣Msn(zn−1,zn+1)−Msn(yn−1,yn+1)∣≤c(∣un−1∣+∣un+1∣)≤θnq ∥u∥θ≤θnqρˉ. For n=0, (Tbu)0=Ms0(b,z1)−Ms0(b∗,y1), so ∣(Tbu)0∣≤c∣b−b∗∣+c∣u1∣≤(1−q)ρˉ+qρˉ=ρˉ, since ∣b−b∗∣<δ∗<(1−q)ρˉ/c. Hence ∥Tbu∥θ≤ρˉ.

2.2givenstep 1.1F1F3F4

Linearised equation: fix b and put zk∗:=yk+uk(b) for k≥0 and z−1∗:=b. Define the affine map L on ℓθ∞(N) by (Ld)n:=∂1Msn(zn−1∗,zn+1∗) dn−1+∂2Msn(zn−1∗,zn+1∗) dn+1(n≥1),(Ld)0:=∂2Ms0(b,z1∗) d1+∂1Ms0(b,z1∗), where d−1:=1 is held fixed. The homogeneous part d↦Ld−d−1-part is a contraction of constant q by the computation of step 1.1, so [F3] gives a unique d(b)∈ℓθ∞(N) with Ld(b)=d(b), i.e. the displayed system; taking the fixed point of the homogeneous contraction started at 0 gives ∥d(b)∥θ≤c/(1−q) because the forcing ∂1Ms0(b,z1∗)e0 has norm at most c.

3.1step 1.1step 2.1F2F3

Fixed point: by [F2], Bρˉ is a nonempty complete metric space. For every b∈I, step 2.1 shows Tb maps this ball into itself and step 1.1 shows that it is a contraction with constant q<1; [F3] therefore gives exactly one fixed point u(b)∈Bρˉ.

3.2givenstep 2.2F1F4algebra

Taylor remainder: fix b∈I and take h small enough that b+h∈I. Put u′:=u(b+h) and Δ:=u′−u(b), and for k≥0 put zk:=yk+uk(b) and zk′:=yk+uk′, with z−1:=b and z−1′:=b+h. For n≥1, [F1] applied at z=(zn−1∗,zn+1∗) and z′=(zn−1′,zn+1′) gives ∣(Tb+hu′)n−(Tbu)n−∂1MsnΔn−1−∂2MsnΔn+1∣≤K(∣Δn−1∣+∣Δn+1∣)2≤2K(∣Δn−1∣2+∣Δn+1∣2), and multiplying by θ−n bounds this by 2Kθn(θ−2+θ2)∥Δ∥θ2. For n=0 the two input differences are h and Δ1; [F1] gives a remainder bounded by K′(∣h∣+∣Δ1∣)2≤2K′(h2+∣Δ1∣2) with a uniform K′, so altogether ∥u′−(Tbu)−[DuTb(u)]Δ−DbTb(u)h∥θ≤C0(∥Δ∥θ2+h2) with C0<∞.

4.1step 1.1step 3.1F1F3F4algebra

Lipschitz dependence and a priori bound: for u∈Bρˉ and b,b′∈I, (Tb′u)n=(Tbu)n for n≥1, while ∣(Tb′u)0−(Tbu)0∣≤c∣b′−b∣ by [F1]. Applying this with u=u(b′) and using step 1.1 gives ∥u(b′)−u(b)∥θ≤q∥u(b′)−u(b)∥θ+c∣b′−b∣, hence ∥u(b′)−u(b)∥θ≤c∣b′−b∣/(1−q). At b=b∗, u(b∗)=0 because the zero sequence solves the fixed-point equation; taking one parameter to be b∗ gives ∥u(b)∥θ≤c∣b−b∗∣/(1−q).

5.1step 4.1step 2.2step 3.2F1F4algebra

Differentiability: write DuT:=DuTb(u(b)) and DbT:=DbTb(u(b)) for the two partial derivatives of the map (b,u)↦Tbu at (b,u(b)). By step 3.2 applied to the fixed point equations u(b+h)=Tb+hu(b+h) and u(b)=Tbu(b), u(b+h)=u(b)+DuT Δ+DbT h+R1,∥R1∥θ≤C0(∥Δ∥θ2+h2), with Δ=u(b+h)−u(b). By step 2.2, h d(b)=DuT (h d(b))+DbT h; subtracting h d(b) from the displayed equation and putting R:=Δ−h d(b) therefore yields R=DuT R+R1, whence ∥R∥θ≤q∥R∥θ+∥R1∥θ. By step 4.1, ∥Δ∥θ≤c∣h∣/(1−q), so ∥R1∥θ≤C1h2 for ∣h∣ small and hence ∥R∥θ≤C1h2/(1−q): that is, u(b+h)=u(b)+h d(b)+O(h2) in ℓθ∞(N). This proves differentiability with derivative d(b) and identifies it with the solution of clause 3.

5.2step 4.1step 2.2F1F4

Continuity of the derivative: by step 2.2 the difference of the linear operators at b′ and b has coefficients ∂iMsn(zn±1′)−∂iMsn(zn±1), which tend to zero uniformly in n as b′→b by uniform continuity of the ∂iMu on the compact J×J and by the uniform estimate ∣zk′−zk∣≤c∣b′−b∣/(1−q) of step 4.1; the same holds for the forcing. Applying the difference estimate of step 4.1 to the fixed points d(b′),d(b) of the affine maps gives ∥d(b′)−d(b)∥θ→0.

6.1step 2.2step 5.1step 5.2F4F5∎

The curve: the map b↦γ(b)=(b,y0+u0(b)) has components the identity and the affine function of u0, and b↦u0(b) is continuously differentiable by steps 5.1 and 5.2 with derivative d0(b); hence γ is C1 with the displayed derivative ([F5]). The bound ∣d0(b)∣≤∥d(b)∥θ≤c/(1−q) 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 Mu.

  • The weighted growth ∣un∣≤θn∥u∥θ 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.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

The coded curves are genuine C1 stable and unstable curves of F, with transverse intersection at every finite-word homoclinic point

Statement

Fix a≥100 and let R=a+3, L=a−2R, F(x,y)=(y,y2−a−x), x(s), h and the sets Ws,Wu be as in The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences, The square-root recurrence Ts(x)n=sna+xn−1+xn+1 is a contraction of BR with a unique coded solution, Finite symbol windows determine the code: locality of the iterates, coding continuity and injectivity of h(σ)=(x−1(σ),x0(σ)) and Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family. For u∈{−1,+1} put ru:=1+ua+1 and let

Mu (v,w):=ua+v+w

be the square-root update of the coded recurrence. Then:

  1. (hyperbolicity) the fixed points (ru,ru) of F are hyperbolic: DF(ru,ru) has two real eigenvalues, one of modulus >1 and one of modulus <1;
  2. (stable curve at a finite-word point) let s∈X± be nonconstant with sn=u for ∣n∣≥N, and put z∗:=h(s). Then there are δs>0 and a C1 curve γs:(−δs,δs)→R2 with γs(0)=z∗, γs((−δs,δs))⊆Ws(ru,ru) and tangent γs′(0)∈C1/2s;
  3. (unstable curve at a finite-word point) likewise there are δu>0 and a C1 curve γu:(−δu,δu)→R2 with γu(0)=z∗, γu((−δu,δu))⊆Wu(ru,ru) and γu′(0)∈C1/2u; consequently z∗ is a transverse homoclinic point of (ru,ru) (Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family);
  4. (local stable and unstable sets at the fixed point) put ρ:=1/8 and define ∥(x,y)∥max⁡:=max⁡(∣x∣,∣y∣). Then the set of points y=(y−1,y0)∈R2 whose forward orbit stays within max-norm distance ρ of (ru,ru),

Γρs:={ y: ∥Fn(y)−(ru,ru)∥max⁡≤ρ for every n≥0 },

is exactly the graph {(b, ru+u0(b)):∣b−ru∣≤ρ} of the half-tail solution map b↦u0(b) obtained from [F2] with the constant reference yn:=ru and b∗:=ru; in particular it is a C1 embedded curve through (ru,ru) whose tangent at the fixed point lies in C1/2s. With Σ(x,y):=(y,x) the same statement holds in the unstable direction: a point has all its backward iterates F−n(y) within max-norm distance ρ of (ru,ru) if and only if it lies in Σ(Γρs), and Σ(Γρs) is a C1 embedded curve through (ru,ru) whose tangent lies in C1/2u.

Facts & Assumptions

Given: The parameter a≥100, the constants R,L, the coded sequences x(s), the coding map h, the fixed points ru, the square-root updates Mu , and a nonconstant code s with sn=u for ∣n∣≥N.

[F1]

Coding data (The square-root recurrence Ts(x)n=sna+xn−1+xn+1 is a contraction of BR with a unique coded solution, Finite symbol windows determine the code: locality of the iterates, coding continuity and injectivity of h(σ)=(x−1(σ),x0(σ)), The quadratic map F(x,y)=(y,y2−a−x) has a compact coded invariant set conjugate to the two-sign shift, with chaos under ACω): xn(s)=Msn (xn−1(s),xn+1(s)), ∣xn(s)∣∈[L,R], and F(h(s))=h(S±s); moreover ∣xn(s)∣≤a+2R<R and R−a+2R=(4a+3)/(R+a+2R)>(4a+3)/(2R)>1/2, since R2−(a+2R)=4a+3.

[F2]

Weighted half-tail lemma (Weighted half-tail contractions for qn=Msn(qn−1,qn+1) give a unique C1 curve with tangent slope bounded by c/(1−q)): 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)‖_θ.

[F3]

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 uˉ has xn(uˉ)=ru with ru2=a+2ru and sign⁡(ru)=u; for a finite-word code s, Fn(h(s))→(ru,ru) as n→±∞, and h(s)≠(ru,ru) when s≠uˉ.

[F4]

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 Df(a) as the linear first-order approximation with o(∥h∥2) remainder): with Σ(x,y):=(y,x) one has Σ2=id, Σ∘F∘Σ=F−1 (because ΣFΣ(x,y)=ΣF(y,x)=Σ(x,x2−a−y)=(x2−a−y,x)=F−1(x,y)), and Σ maps C1/2s onto C1/2u.

[F5]

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 a≥0 with (a)2=a; the positives are {x2:x≠0}): DF(x,y)=(01−12y); the characteristic polynomial at (ru,ru) is λ2−2ruλ+1, with roots ru±ru2−1. Here r+=1+a+1>1 and r−=1−a+1<−1, so the supplier's definition tests whether each eigenvalue has modulus different from 1.

[F7]

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 a≥0 with (a)2=a; the positives are {x2:x≠0}): let ρ=1/8. For either sign, ∣ru∣=a+1−1 or 1+a+1, so ∣ru∣>9 for a≥100. If ∣b−ru∣≤ρ and v,w:N→R have ∥v∥∞,∥w∥∞≤ρ, then in the update (Tbv)n:=Mu (ru+vn−1,ru+vn+1)−ru,v−1:=b−ru, every radicand lies in [ru2−1/4,ru2+1/4]⊂(64,∞), so Tb is defined. For each n≥1 the difference of two outputs is at most (∣vn−1−wn−1∣+∣vn+1−wn+1∣)/16; at n=0 it is at most ∣v1−w1∣/16. Thus ∥Tbv−Tbw∥∞≤(1/8)∥v−w∥∞.

Proof

technique · direct; solve the two slope-free half-tail problems for the square-root update, use the reflection symmetry for the unstable direction, and read off hyperbolicity and transversality
1.1givenF5algebra

Hyperbolicity: the characteristic polynomial in [F5] has the two real roots ru±ru2−1, whose product is 1. If u=+1, then ru>1, so ru+ru2−1>1 and ru−ru2−1=1/(ru+ru2−1)∈(0,1). If u=−1, write ru=−m with m>1; then ru−ru2−1<−1 and ru+ru2−1=−1/(m+m2−1)∈(−1,0). Thus each fixed point has one eigenvalue of modulus greater than 1 and one of modulus less than 1, 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.

2.1givenstep 1.1F1F2F3algebra

Stable curve: apply [F2] with θ:=1/2, J:=[−R,R], c:=1/16, q:=5/32, the update Msn , reference yn:=xn(s) (n≥0), b∗:=x−1(s), ρˉ:=1/2, and δ∗:=1/4. By [F1], ∣yn∣≥L>1/2 and ∣yn∣≤a+2R<R−1/2, so the margin condition holds; also ∣b∗∣<R−1/2, so [b∗−δ∗,b∗+δ∗]⊆J, and δ∗<(1−q)ρˉ/c. The updates are C2 on the open set a+v+w>0, containing J×J, with first partials u/(2a+v+w) and second partials −u/(4(a+v+w)3/2). On J×J their first partials have absolute value at most 1/(2L)<1/16, since L≥74>8, and ∣Mu ∣≤a+2R<R. Thus their extensions, image and derivative bounds match every premise of [F2]. The recurrence holds by [F1]. Hence there is a C1 curve b↦Z(b):=(b,x0(b)) through Z(b∗)=(x−1(s),x0(s))=z∗ with tangent (1,d0) and ∣d0∣≤c/(1−q)=2/27<1/2. Every point Z(b) has forward orbit tracking the reference orbit Fn(z∗), which converges to (ru,ru) by [F3]; hence Z(b) lies in Ws(ru,ru) and its tangent lies in C1/2s. This proves clause 2.

3.1givenstep 2.1F1F2F3F4algebra

Unstable curve: put w:=Σ(z∗)=(x0(s),x−1(s)) and let yn:=x−n−1(s) for n≥0, with boundary value b∗:=x0(s). By the recurrence of [F1], this is a reference half-orbit for the square-root update, and ∣yn∣≥L>1/2, ∣yn∣≤a+2R<R−1/2. Apply [F2] with θ=1/2, J=[−R,R], c=1/16, q=5/32, ρˉ=1/2, and δ∗=1/4; the margin and parameter-interval conditions hold by [F1]. The resulting C1 curve through w has tangent (1,d0) with ∣d0∣≤2/27, and its forward orbits track that of w: by [F4], Fn(w)=Σ(F−n(z∗)), which converges to (ru,ru) by [F3]. Reflecting the curve by Σ gives a C1 curve γu through z∗, tangent (d0,1)∈C1/2u, whose points lie in Wu(ru,ru). This proves clause 3.

3.2givenstep 1.1step 2.1F1F2F4

Local stable set: apply [F2] with θ=1/2, J=[−R,R], c=1/16, q=5/32, ρˉ=1/8, δ∗=1/4, the constant symbols sn:=u, constant reference yn:=ru, and b∗:=ru. The reference satisfies the recurrence because ru2=a+2ru and sign⁡(ru)=u, so ru=Mu (ru,ru) by [F3]. By [F7], ∣ru∣>9, and ∣ru∣≤a+2R<R−1/2, so the reference-margin condition and [ru−δ∗,ru+δ∗]⊆J hold; also δ∗<(1−q)ρˉ/c=27/16. Hence there is a C1 map b↦u(b) with ∥u(b)∥θ≤(c/(1−q))∣b−ru∣=(2/27)∣b−ru∣. Define Γ:={(b,ru+u0(b)):∣b−ru∣≤ρ} with ρ:=1/8; this closed parameter interval lies inside I because δ∗=1/4.

4.1step 2.1step 3.1F4

Transversality: by steps 2.1 and 3.1 the tangent of γs at z∗ lies in C1/2s and that of γu in C1/2u; since C1/2s∩C1/2u={0} ([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 z∗. This is the transversality assertion of clause 3.

4.2step 3.2F1F2F4algebra

The graph lies in the trapping set: let ∣b−ru∣≤ρ and put x−1:=b, xn:=ru+un(b) for n≥0. By the fixed-point equation of [F2], the sequence satisfies xn=Mu (xn−1,xn+1) for every n≥0, so F(xn−1,xn)=(xn,xn+1) by [F1] and Fn(b,x0)=(xn−1,xn) for all n≥0. Also ∣x−1−ru∣=∣b−ru∣≤ρ and ∣xn−ru∣≤∥u(b)∥θ≤(2/27)∣b−ru∣≤ρ for n≥0. Thus every point of Γ has all forward iterates within max-norm distance ρ of (ru,ru).

4.3givenstep 3.2F1F2F6F7algebra

The trapping set lies in the graph: let y=(y−1,y0) satisfy ∥Fn(y)−(ru,ru)∥max⁡≤ρ for every n≥0, and write Fn(y)=(ξn−1,ξn). Then ∣ξn−ru∣≤ρ for every n≥−1. Since ∣ru∣>9 by [F7], each ξn has sign u and ∣ξn∣>8. The orbit identity ξn+1=ξn2−a−ξn−1 gives a+ξn−1+ξn+1=ξn2>64, so for n≥0 one has ξn=ua+ξn−1+ξn+1=Mu (ξn−1,ξn+1). Put vn:=ξn−ru for n≥0 and b:=y−1. Then ∥v∥∞≤ρ, ∣b−ru∣≤ρ, and the displayed identity says exactly (Tbv)n=vn for all n≥0. The weighted solution u(b) from step 3.2 also satisfies Tbu(b)=u(b) and ∥u(b)∥∞≤∥u(b)∥θ≤(2/27)∣b−ru∣<ρ. By [F7], ∥v−u(b)∥∞=∥Tbv−Tbu(b)∥∞≤(1/8)∥v−u(b)∥∞, so v=u(b) and y=(y−1,ru+u0(y−1))∈Γ.

5.1step 4.1step 4.2step 4.3F2F4

Local stable set identified: steps 4.2 and 4.3 show that the set Γρs of clause 4 equals Γ; by [F2] and step 4.1 the curve Γ is C1 with tangent (1,d0) at the fixed point and ∣d0∣≤c/(1−q)≤2/27<12, so the tangent lies in C1/2s. This is the stable half of clause 4.

6.1step 4.3step 5.1F4F6∎

Local unstable set: by [F4], F−1=ΣFΣ with Σ2=id, and Σ preserves the max norm because it permutes coordinates. Hence for every y and n≥0, ∥F−n(y)−(ru,ru)∥max⁡=∥Fn(Σy)−(ru,ru)∥max⁡. Therefore the set of points whose backward orbit stays within max-norm distance ρ of (ru,ru) is exactly Σ(Γρs)=Σ(Γ). Its tangent at (ru,ru) is Σ(1,d0)=(d0,1)∈C1/2u because Σ maps C1/2s onto C1/2u by [F4], and it is a C1 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 ΣFΣ=F−1 of the quadratic family; this avoids a separate backward half-tail contraction.

  • The aperture 1/2 is the one used throughout; the derivative bound ∣d0∣≤1/2 is verified with the explicit bound L≥74 and is not claimed to be optimal.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

A C2 map C1-close to F has a unique inverse branch for its first component, with O(ε) derivative bounds

Statement

Fix a≥100 and put R:=a+3, so that R≥13. Let 0<ε<1, let U⊆R2 be open with [−R−1,R+1]2⊆U, and let G=(A,B):U→R2 be of class C2 (Ck Euclidean maps and diffeomorphisms) whose components satisfy, on the closed square S:=[−R−1,R+1]2,

∣A(x,y)−y∣≤ε,∣∂xA(x,y)∣≤ε,∣∂yA(x,y)−1∣≤ε,

∣B(x,y)−(y2−a−x)∣≤ε,∣∂xB(x,y)+1∣≤ε,∣∂yB(x,y)−2y∣≤ε.

Then:

  1. for every (q,q′)∈[−R,R]2 the equation A(q,v)=q′ has exactly one solution v=V(q,q′)∈[−R−1,R+1], and this defines a map V:[−R,R]2→[−R−1,R+1];
  2. V is of class C1 on [−R,R]2 (Ck Euclidean maps and diffeomorphisms), with

∂qV(q,q′)=−∂xA(q,V)Ay(q,V),∂q′V(q,q′)=1∂yA(q,V);

  1. V satisfies the uniform estimates

∣V(q,q′)−q′∣≤ε,∣∂qV(q,q′)∣≤ε1−ε,∣∂q′V(q,q′)−1∣≤ε1−ε

for every (q,q′)∈[−R,R]2.

Facts & Assumptions

Given: The parameter a≥100, R=a+3, the open set U, the map G=(A,B) with its closeness bounds on S, and a point (q,q′)∈[−R,R]2.

[F1]

First-component closeness (given, Ck Euclidean maps and diffeomorphisms, The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case): for every v∈[−R−1,R+1] one has ∣A(q,v)−v∣≤ε and ∣∂yA(q,v)−1∣≤ε. The function f(v):=A(q,v)−v is continuous on [−R−1,R+1] and differentiable on its interior, since A is C2 on the open set U. For any distinct v,w in this closed interval, the scalar mean value theorem (The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a)) on [min⁡(v,w),max⁡(v,w)] gives f(v)−f(w)=f′(ξ)(v−w) for an interior ξ. The derivative is ∂yA(q,ξ)−1, of absolute value at most ε; equal endpoints give zero. Thus, including both boundary endpoints,

∣(A(q,v)−v)−(A(q,w)−w)∣≤ε ∣v−w∣(v,w∈[−R−1,R+1]);

equivalently, for Φ(v):=q′+v−A(q,v) one has ∣Φ(v)−q′∣≤ε and ∣Φ(v)−Φ(w)∣≤ε∣v−w∣ on the interval, with ε<1.

[F3]

Implicit differentiation (The Euclidean implicit function theorem with derivative formula, Ck Euclidean maps and diffeomorphisms): A is C1 on the open set U; if ∂yA(q0,v0)≠0 and A(q0,v0)=q0′, then near (q0′,q0) the equation A(q,v)=q′ has a unique C1 solution v=φ(q,q′) with ∂qφ=−∂xA/∂yA and ∂q′φ=1/∂yA.

[F4]

Absolute value and order (Absolute value in an ordered field, Basic properties of the absolute value, The triangle inequality): ∣u+w∣≤∣u∣+∣w∣, ∣uv∣=∣u∣∣v∣, and R≥13 so that [−R,R]⊆[−R−1,R+1] and q′+[−1,1]⊆[−R−1,R+1] for q′∈[−R,R].

Proof

technique · direct; solve the equation by the contraction $v\mapsto q'+v-A(q,v)$ for each fixed $(q,q')$, then use the implicit function theorem for regularity and differentiate the defining identity for the bounds
1.1givenF1F2F4algebra

Location of the root: fix (q,q′)∈[−R,R]2 and define Φ(v):=q′+v−A(q,v) on [−R−1,R+1]. For every such v, Φ(v)−q′=v−A(q,v) so ∣Φ(v)−q′∣≤ε≤1 by [F1]; hence Φ(v)∈[−R−1,R+1] by [F4] (because q′∈[−R,R] gives q′+[−1,1]⊆[−R−1,R+1]). Also ∣Φ(v)−Φ(w)∣=∣(v−w)−(A(q,v)−A(q,w))∣≤sup⁡ξ∣1−∂yA(q,ξ)∣ ∣v−w∣≤ε∣v−w∣ by [F1] and the mean value inequality. Thus Φ maps the complete interval into itself and is a contraction with constant ε<1.

2.1step 1.1F2algebra

Unique root: by [F2], Φ has exactly one fixed point v∈[−R−1,R+1]; the identity Φ(v)=v is equivalent to A(q,v)=q′. This proves clause 1 and defines V.

3.1step 2.1F3F5algebra

Regularity: at a root (q,q′) with v=V(q,q′), the partial derivative ∂yA(q,v) satisfies ∣∂yA(q,v)∣≥1−ε>0 by the closeness bound, so Ay(q,v)≠0. The implicit function theorem [F3] gives a C1 solution φ near (q,q′) with the displayed derivatives, and by clause 1 this local solution coincides with V; since (q,q′)∈[−R,R]2 was arbitrary, V is C1 on the square with the displayed formulas.

4.1step 1.1step 2.1step 3.1F1F3givenalgebra

Regularity needed by the half-tail construction: choose 0<δ<1−ε. For (q,q′)∈(−R−δ,R+δ)2, both parameters lie in [−R−1,R+1], and every (q,v) with v∈[−R−1,R+1] lies in S. Thus the given bounds apply and ∂yA(q,v)≥1−ε>0. The contraction Φ(v)=q′+v−A(q,v) has constant ε; moreover ∣Φ(v)−q′∣≤ε, so Φ(v)∈[−R−1,R+1] because ∣q′∣<R+δ and δ+ε<1. Its unique fixed point therefore defines V on this open parameter rectangle, extending the original branch by uniqueness. The implicit function theorem gives a local C1 branch at each point; uniqueness makes these local branches agree with the contraction-defined extension. Since A is C2, the formulas in step 3.1 make its first partial derivatives C1 compositions and quotients with nonvanishing denominator. Consequently this extension is C2 on the open rectangle, as needed by the later root and weighted-tail constructions; clause 2's C1 conclusion remains valid.

4.2step 3.1step 2.1F4algebra

Estimates: from A(q,V(q,q′))=q′ and the closeness ∣A(q,v)−v∣≤ε evaluated at v=V(q,q′), clause 3's first inequality follows: ∣V(q,q′)−q′∣=∣V−A(q,V)∣≤ε by [F4]. For the derivatives, by step 3.1 ∣∂qV∣=∣∂xA(q,V)∣∣∂yA(q,V)∣≤ε1−ε,∣∂q′V−1∣=∣∂yA(q,V)−1∣∣∂yA(q,V)∣≤ε1−ε, using ∣∂xA∣≤ε and ∣∂yA−1∣≤ε from the hypotheses and ∣∂yA∣≥1−ε from step 3.1.

5.1step 2.1step 3.1step 4.2∎

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 (x,y)↦(y,y2−a−x): its first component is the second variable, so that solving A(q,v)=q′ in v is a near-identity equation, and its second component is a quadratic in v. The quadratic structure enters quantitatively in the split ε between the two components in Root bounds and C1 dependence for the perturbed scalar recurrence v2−a−u−w+e(u,v,w)=0.

  • The estimates are uniform on the square and show that V is a small C1 perturbation of the projection (q,q′)↦q′.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Root bounds and C1 dependence for the perturbed scalar recurrence v2−a−u−w+e(u,v,w)=0

Statement

Fix a≥100 and put

R:=a+3,l:=a−3≥7,S:=[−R−1,R+1]2.

Let 0<ε≤1/6, let U⊆R2 be open with S⊆U, and let G=(A,B):U→R2 be a C2 map satisfying the closeness hypotheses of A C2 map C1-close to F has a unique inverse branch for its first component, with O(ε) derivative bounds on S with constant ε; let V:[−R,R]2→[−R−1,R+1] be its inverse branch. Define the defect

e(u,v,w):=−(V(v,w)−w)+2v (V(u,v)−v)+(V(u,v)−v)2+B(u,V(u,v))−(V(u,v)2−a−u)

for (u,v,w)∈[−R,R]3, and put

Pu,w(v):=v2−a−u−w+e(u,v,w),(u,v,w)∈[−R,R]3.

Then:

  1. e is of class C1 on [−R,R]3, and there is a constant C=C(a,R) such that ∥e∥C1([−R,R]3)≤Cε; in particular, with η:=Cε assumed to satisfy η≤1, for all (u,v,w)

∣e(u,v,w)∣≤η,∣∂ve(u,v,w)∣≤η,∣∂ue(u,v,w)∣≤η,∣∂we(u,v,w)∣≤η;

  1. for every (u,w)∈[−R,R]2 and each sign s∈{−1,+1} the equation Pu,w(v)=0 has exactly one solution v=Ms(u,w) with s v∈[l,R], and this solution satisfies the margins

s Ms(u,w)−l≥34,R−s Ms(u,w)≥34;

moreover Ms is of class C1 on [−R,R]2 with

∣∂uMs∣≤d:=1+η2l−η,∣∂wMs∣≤d;

  1. with d as above and θ:=1/2 one has, for every a≥100 and η≤1,

d≤213,2d≤413<1,d(θ+θ−1)≤513<1,d1−dθ≤16<23.

  1. (orbit form of the root equation) for all (u,v,w)∈[−R,R]3,

Pu,w(v)=0⟺B(u,V(u,v))=V(v,w).

Facts & Assumptions

Given: The parameter a≥100, the constants R,l,S, the map G and its closeness constant ε, the inverse branch V of A C2 map C1-close to F has a unique inverse branch for its first component, with O(ε) derivative bounds, the defect e and the polynomials Pu,w.

[F1]

The inverse branch (A C2 map C1-close to F has a unique inverse branch for its first component, with O(ε) derivative bounds, clauses 2 and 3): V is C1 on [−R,R]2, A(q,V(q,q′))=q′, ∣V(q,q′)−q′∣≤ε, ∣∂qV∣≤ε/(1−ε), ∣∂q′V−1∣≤ε/(1−ε) for all (q,q′)∈[−R,R]2; the hypothesis gives 1/(1−ε)≤6/5<2.

[F2]

The closeness of B: ∣B(x,y)−(y2−a−x)∣≤ε, ∣∂xB+1∣≤ε, ∣∂yB−2y∣≤ε on S (given, and hypotheses of A C2 map C1-close to F has a unique inverse branch for its first component, with O(ε) derivative bounds).

[F3]

C1 calculus and the uniform bound: e is built from V, B and polynomials by composition, product and sum, so it is C1 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 (Ck Euclidean maps and diffeomorphisms, The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a), A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value, Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point); the constant depends only on a and R. This is stated as clause 1 with a single constant C absorbing the finitely many O(1) factors.

l2−a−(u+w)≤l2−a+2R=−4a+15,R2−a−(u+w)≥R2−a−2R=4a+3,

because l2=a−6a+9 and R2=a+6a+9. In particular 4a−15≥25 and 4a+3≥43 for a≥100.

[F5]

The intermediate value theorem and mean value theorem (Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on [a,b] takes every value between f(a) and f(b), The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a), Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) 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, f(b)−f(a)=f′(ξ)(b−a) for some interior ξ. Thus a C1 function with strictly positive derivative is strictly increasing, and ∣f′∣≤D gives ∣f(b)−f(a)∣≤D∣b−a∣, including boundary endpoints.

[F6]

Implicit differentiation in two variables (The Euclidean implicit function theorem with derivative formula, Ck Euclidean maps and diffeomorphisms): if P(u0,w0,v0)=0 and ∂vP(u0,w0,v0)≠0, then locally v=M(u,w) is the unique C1 solution with ∂uM=−∂uP/∂vP and ∂wM=−∂wP/∂vP.

Proof

technique · direct; estimate the defect from the inverse-branch bounds, locate the root by endpoint signs, differentiate the defining equation, and expand once to identify the root equation with the $G$-orbit form
1.1givenF1F2F3algebra

Bounds for the defect: on the cube, [F1] gives ∣V(v,w)−w∣≤ε,∣V(u,v)−v∣≤ε,∣∂u(V(u,v)−v)∣≤ε1−ε,∣∂v(V(u,v)−v)∣≤ε1−ε, and the corresponding partials of V(v,w)−w in (v,w) are bounded by ε/(1−ε); [F2] gives ∣B(u,V(u,v))−(V(u,v)2−a−u)∣≤ε and partial bounds ε plus Lipschitz factors 2∣V∣+1≤2(R+1)+1 from the derivative bounds of B and [F1]. Since ∣2v∣≤2R, every term of e and every first partial derivative of e (computed by the chain rule and product rule) is bounded by a sum of finitely many terms each O(ε), so there is C=C(a,R) with ∥e∥C1≤Cε; the factors 1/(1−ε) are bounded by 6/5<2 under the stated hypothesis. With η:=Cε≤1 clause 1 follows.

2.1step 1.1F4algebra

Endpoint values of P: fix u,w∈[−R,R]. By step 1.1, ∣e(u,v,w)∣≤η for every v. Using [F4], Pu,w(l)=l2−a−u−w+e(u,l,w)≤−(4a−15)+η<0,Pu,w(R)=R2−a−u−w+e(u,R,w)≥(4a+3)−η>0, because η≤1≤25≤4a−15 and η≤1<43≤4a+3. Similarly Pu,w(−R)≥(4a+3)−η>0 and Pu,w(−l)≤−(4a−15)+η<0.

2.2step 1.1F5algebra

Monotonicity: for v∈[l,R], Pu,w′(v)=2v+∂ve(u,v,w)≥2l−η≥14−1>0, and for v∈[−R,−l], Pu,w′(v)=2v+∂ve≤−2l+η<0; hence Pu,w is strictly increasing on [l,R] and strictly decreasing on [−R,−l].

2.3givenstep 1.1F1F2algebra

Orbit form of the root equation: fix (u,v,w)∈[−R,R]3 and put δB:=B(u,V(u,v))−(V(u,v)2−a−u), so that ∣δB∣≤ε by [F2]. Expanding the two inverse-branch values, V(u,v)2=v2+2v(V(u,v)−v)+(V(u,v)−v)2,V(v,w)=w+(V(v,w)−w), one computes B(u,V(u,v))−V(v,w)=v2−a−u−w+[−(V(v,w)−w)+2v(V(u,v)−v)+(V(u,v)−v)2+δB]=Pu,w(v), because the bracket is exactly e(u,v,w). Hence Pu,w(v)=0 if and only if B(u,V(u,v))=V(v,w), which is clause 4.

3.1step 1.1step 2.1step 2.2F5algebra

Existence, uniqueness and margins of the root: by steps 2.1 and 2.2 and the intermediate value theorem [F5], Pu,w has exactly one zero M+(u,w) in [l,R] and exactly one zero M−(u,w) in [−R,−l]. For the margins, on [l,R] one has ∣Pu,w′∣≤2R+η≤2a+7 by step 1.1, while Pu,w(l)≤−(4a−15)+η≤−(4a−16) and Pu,w(R)≥(4a+3)−η≥4a+2 by step 2.1. The mean value theorem applied on [l,M+] and on [M+,R] therefore gives M+−l≥4a−162a+7,R−M+≥4a+22a+7, and both right-hand sides are at least 3/4 because a≥10: the first inequality is equivalent to 10a≥85 and the second to 10a≥13. At a=100 the two bounds read 24/27 and 42/27. The same computation on the interval [−R,−l], where Pu,w is decreasing and Pu,w(−l)≤−(4a−16), Pu,w(−R)≥4a+2, gives ∣M−∣−l≥34 and R−∣M−∣≥34; thus s Ms−l≥34 and R−s Ms≥34 for each sign s.

4.1step 3.1step 1.1F6algebra

Regularity and derivative bounds: at a zero v of Pu,w with sv∈[l,R], step 2.2 gives ∂vPu,w(v)≥2l−η>0 (respectively ≤−(2l−η)), so the implicit function theorem [F6], applied to the C1 function (u,w,v)↦Pu,w(v) and combined with the uniqueness of step 3.1, makes Ms of class C1 with ∂uMs=−∂uP∂vP=1−∂ue2v+∂ve,∂wMs=−∂wP∂vP=1−∂we2v+∂ve. Both numerators are bounded by 1+η in absolute value, and the denominator by 2l−η from below in absolute value; hence ∣∂uMs∣,∣∂wMs∣≤(1+η)/(2l−η)=d, which is clause 2.

5.1step 2.1step 2.2step 4.1F1F3F6givenalgebra

Open-neighborhood C2 regularity for later applications: the “Regularity needed by the half-tail construction” paragraph in the proof of A C2 map C1-close to F has a unique inverse branch for its first component, with O(ε) derivative bounds extends V as a C2 map to an open rectangle containing [−R,R]2. Since B is C2 on U, the formula for e, hence P, is C2 on an open neighborhood of the cube after shrinking the rectangle so that (u,V(u,v))∈U. 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 C1. Their first partials are the quotients in step 4.1 of C1 functions composed with these C1 roots, with nonzero denominator, so the partials are C1 and the roots are C2. This supplies C2 extensions of Ms on an open neighborhood of [−R,R]2, as needed by the weighted half-tail lemma; the original derivative bounds on the closed square are unchanged.

5.2step 4.1algebra

Numerical inequalities: since l≥7 and η≤1, d≤(1+1)/(14−1)=2/13; therefore 2d≤4/13<1; with θ=1/2, d(θ+θ−1)≤(2/13)(5/2)=5/13<1; and d/(1−dθ)≤(2/13)/(1−1/13)=2/12=1/6<2/3.

6.1step 1.1step 2.1step 2.2step 2.3step 3.1step 4.1step 5.2∎

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 e is not an arbitrary perturbation: it is exactly the residual obtained from a genuine G-orbit, because a G-orbit (qn,vn) satisfies vn=V(qn,qn+1) and vn=B(qn−1,vn−1), and substituting the inverse-branch expansions produces precisely Pqn−1,qn+1(qn)=0 (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 qn=Msn(qn−1,qn+1) into the two-step orbit relation of G.

  • All numerical margins are evaluated at the worst case a=100, l=7, η=1; the argument is uniform in a≥100 and only improves with larger a or smaller η.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Explicit persistence under the stated forward and conjugated-inverse bounds: coded chaos, hyperbolic fixed points and transverse homoclinic points

Statement

Fix a≥100 and put

R:=a+3,l:=a−3≥7,Q:=[−R−1,R+1]2,Σ(x,y):=(y,x).

Let C=C(a,R) be the constant of Root bounds and C1 dependence for the perturbed scalar recurrence v2−a−u−w+e(u,v,w)=0, let 0<ε≤1/6 with η:=Cε≤1, and let U⊆R2 be open with Q⊆U. Let G=(A,B):U→R2 be a C2 diffeomorphism onto its image whose components satisfy, on Q,

∣A(x,y)−y∣≤ε,∣∂xA(x,y)∣≤ε,∣∂yA(x,y)−1∣≤ε,

∣B(x,y)−(y2−a−x)∣≤ε,∣∂xB(x,y)+1∣≤ε,∣∂yB(x,y)−2y∣≤ε,

and assume in addition that H:=Σ∘G−1∘Σ is defined and of class C2 on a neighbourhood of Q and satisfies the same six inequalities on Q with the same constant ε. For each sign u let Mu be the root map of Root bounds and C1 dependence for the perturbed scalar recurrence v2−a−u−w+e(u,v,w)=0 applied to G, let V be the inverse branch of A C2 map C1-close to F has a unique inverse branch for its first component, with O(ε) derivative bounds, and let MuH,VH be the corresponding objects for H.

For a nonzero real x, write sign⁡x:=+1 if x>0 and sign⁡x:=−1 if x<0; the sequence coordinates used below are nonzero because their absolute values are at least l≥7. Then:

  1. (coding) for every s∈X± there is exactly one q(s)∈BR with qn(s)=Msn(qn−1(s),qn+1(s)) for all n∈Z; it satisfies l≤∣qn(s)∣≤R, sign⁡qn(s)=sn and R−∣qn(s)∣≥34, ∣qn(s)∣−l≥34; setting vn(s):=V(qn(s),qn+1(s)) and

zn(s):=(qn(s),vn(s)),hG(s):=z0(s)=(q0(s),V(q0(s),q1(s))),

one has G(zn(s))=zn+1(s) for all n; 2. (conjugacy and chaos) hG is a continuous bijection of (X±,D±) onto ΛG:=hG(X±); granting the Axiom of Countable Choice (used once through the equivalence between closed and sequentially closed subsets of R2), it is a homeomorphism, and G∘hG=hG∘S±, so ΛG is G-invariant. The set ΛG is sequentially compact and is compact under ACω+DC. Under ACω, G∣ΛG is continuous, topologically mixing, and has dense periodic points; it is sensitive with sensitivity constant 2l. Hence under ACω it is chaotic in the stated sense. 3. (fixed points) for each sign u the constant code uˉ gives a fixed point zuˉ:=hG(uˉ)=(ρu,V(ρu,ρu)), where ρu=Mu(ρu,ρu) is the unique element of u [l,R] with ρu=Mu(ρu,ρu); these two fixed points are hyperbolic; 4. (transverse homoclinic points) let s∈X± be nonconstant with sn=u for ∣n∣≥N. Then z∗:=hG(s)≠zuˉ, and there are C1 curves γs,γu:(−ε0,ε0)→R2 with γs(0)=γu(0)=z∗, γs((−ε0,ε0))⊆WGs(zuˉ), γu((−ε0,ε0))⊆WGu(zuˉ), tangent vectors γs′(0)∈C3/4s, γu′(0)∈C3/4u; since C3/4s∩C3/4u={0} the tangent lines are distinct, so z∗ is a transverse homoclinic point of zuˉ (Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family).

Facts & Assumptions

Given: The data a,R,l,Q,Σ,ε,η,C, the maps G,H, the root maps Mu,MuH, the inverse branches V,VH, the shift space X± with metric D± and shift S±, the ball BR, and the cones Cks,Cku and stable/unstable sets of Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family.

[F1]

Root and defect bounds (Root bounds and C1 dependence for the perturbed scalar recurrence v2−a−u−w+e(u,v,w)=0): proof step 5.1 supplies C2 extensions of Mu on an open neighborhood of [−R,R]2; in particular Mu is C1 on [−R,R]2 with values in u [l,R], ∣∂iMu∣≤d where d≤2/13, 2d≤4/13<1, d(θ+θ−1)≤5/13<1 for θ=1/2 and d/(1−dθ)≤1/6; the defect e satisfies ∣e∣,∣∂ie∣≤η≤1 on the cube; every root satisfies the margins ∣Mu(u′,w′)∣−l≥34 and R−∣Mu(u′,w′)∣≥34, because the endpoint values of P are at least 4a−16 and 4a+2 in absolute value while ∣∂vP∣≤2R+η≤2a+7, and (4a−16)/(2a+7)≥34 and (4a+2)/(2a+7)≥34 for a≥10; and clause 4 of the same lemma: for all (u,v,w)∈[−R,R]3, Pu,w(v)=0 if and only if B(u,V(u,v))=V(v,w).

[F2]

Inverse-branch estimates (A C2 map C1-close to F has a unique inverse branch for its first component, with O(ε) derivative bounds): V is C1 on [−R,R]2 with ∣V(q,q′)−q′∣≤ε, ∣∂qV∣≤ε/(1−ε), ∣∂q′V−1∣≤ε/(1−ε); here ε≤1/6, so ε/(1−ε)≤1/5 and 1/(1−ε)≤6/5.

[F3]

Weighted half-tail lemma (Weighted half-tail contractions for qn=Msn(qn−1,qn+1) give a unique C1 curve with tangent slope bounded by c/(1−q)): under its hypotheses with parameters θ,c,q and a reference half-orbit, the maps Tb have unique fixed points u(b), the map b↦u(b) is continuously differentiable with ∥du/db∥θ≤c/(1−q), and every derivative entry satisfies ∣dn∣≤θn c/(1−q).

[F7]

Cones and slope vocabulary (Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family): C3/4u={∣u∣≤34∣v∣}, C3/4s={∣v∣≤34∣u∣}, and C3/4u∩C3/4s={0}; the phase curve of a half-tail with boundary value b and sequence xn(b) is the map b↦(b,V(b,x0(b))) at the index −1.

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 G and to H=ΣG−1Σ.

1.1givenF1F8algebra

Constants: by [F1], d≤2/13, 2d≤4/13, and d/(1−dθ)≤1/6; also R≥13, l≥7, and R−l=a+3−(a−3)=6>0. Setting ν:=2d≤4/13<1.

2.1givenstep 1.1F1F4algebra

Coded sequence: for s∈X± define Ts on BR by (Tsq)n:=Msn(qn−1,qn+1). The values lie in sn[l,R]⊆[−R,R] by [F1], so Ts maps BR into itself; and ∥Tsq−Tsq′∥∞≤2d∥q−q′∥∞=ν∥q−q′∥∞ by [F1]. By [F4] and ν<1, Ts has exactly one fixed point q(s)∈BR; and qn(s)∈sn[l,R], so sign⁡qn(s)=sn. The margins of [F1] give R−∣qn(s)∣≥34 and ∣qn(s)∣−l≥34.

3.1givenstep 2.1F1F2

Orbits: with vn:=V(qn(s),qn+1(s)) of [F2], clause 4 of [F1] states that Pu,w(v)=0 is equivalent to B(u,V(u,v))=V(v,w). With (u,v,w)=(qn−1(s),qn(s),qn+1(s)), clause 1 gives Pu,w(v)=0, hence B(qn−1(s),vn−1)=vn; and the defining identity of V gives A(qn−1(s),vn−1)=qn(s). Hence G(qn−1(s),vn−1)=(qn(s),vn), i.e. G(zn−1(s))=zn(s) for all n, and clause 1 is proved.

3.2givenstep 2.1F2F4F5F8algebra

Locality and continuity: iterating Ts from 0, one proves by induction on m that (Tsm0)n depends only on the symbols sj with ∣j−n∣≤m−1, exactly as in the unperturbed case, and that ∥Tsm0−q(s)∥∞≤νm∥Ts0∥∞/(1−ν)≤2Rνm 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 s,t agreeing on ∣j∣≤m one has ∣qn(s)−qn(t)∣≤4Rνm for ∣n∣≤1. By [F2], ∣∂qV∣≤ε/(1−ε)≤15 and ∣∂q′V∣≤1+ε/(1−ε)≤65, so the mean value inequality gives ∣V(q0(s),q1(s))−V(q0(t),q1(t))∣≤15⋅4Rνm+65⋅4Rνm=75⋅4Rνm; with Ch:=125=1+15+65 one therefore has ∥hG(s)−hG(t)∥2≤Δq0+ΔV≤4R Ch νm whenever s,t agree on ∣j∣≤m. Given ε′>0, choose m with 4R Ch νm<ε′ and δ:=2−m; if D±(s,t)<2−m then ([F5], cylinder property) s,t agree for ∣j∣≤m, so ∥hG(s)−hG(t)∥2<ε′. This proves continuity of hG.

3.3givenstep 2.1F1F4F7

Constant codes: for each sign u, the map ρ↦Mu(ρ,ρ) maps the closed interval u[l,R] into itself by [F1] and is a contraction with constant 2d≤4/13<1; hence it has exactly one fixed point ρu∈u[l,R], and the constant sequence qn:=ρu is a fixed point of Tuˉ, so q(uˉ) is constant and zuˉ=hG(uˉ)=(ρu,V(ρu,ρu)) is a fixed point of G.

4.1givenstep 3.1F1

Injectivity: if hG(s)=hG(t) then z0(s)=z0(t); applying the bijection G forward and G−1 (which exists because G is a diffeomorphism onto its image, and z0(s) lies in that image as G(z−1(s))) backward gives zn(s)=zn(t) for all n∈Z by induction; hence qn(s)=qn(t) for all n, and sn=sign⁡qn(s)=sign⁡qn(t)=tn by [F1], so s=t.

4.2givenstep 3.1F1F2

Conjugacy: define q~n:=qn+1(s). Then q~ is a fixed point of TS±s, because (TS±sq~)n=Msn+1(qn(s),qn+2(s))=qn+1(s)=q~n by [F1]; by uniqueness q~=q(S±s), i.e. qn(S±s)=qn+1(s). Hence G(hG(s))=G(q0(s),v0(s))=(q1(s),v1(s))=(q0(S±s),V(q0(S±s),q1(S±s)))=hG(S±s): the conjugacy identity, and G(ΛG)=ΛG follows as in the unperturbed case because S± is bijective.

4.3givenstep 3.3F1F2F8algebra

Hyperbolicity: put M:=DG(zuˉ), E:=M−DF(zuˉ)=(a11a12b1b2) and vu:=V(ρu,ρu). At zuˉ the six closeness hypotheses give ∣a11∣,∣a12∣,∣b1∣≤ε and ∣b2∣≤ε, while [F2] gives ∣vu−ρu∣≤ε and ∣vu∣≤R+1. Since DF(x,y)=(01−12y), expanding trace and determinant of M=DF(zuˉ)+E gives tr⁡M=2vu+a11+b2,det⁡M=1+a11(2vu+b2)+a12−b1−a12b1, so ∣tr⁡M−2ρu∣≤4ε and ∣det⁡M−1∣≤(2R+4)ε+2ε2≤(2l+16)ε+2ε2. Because ε≤16 and l≥7, ∣tr⁡M∣≥2l−4ε≥2l−23,∣det⁡M∣≤1+2l+166+236=l3+6718, and the discriminant is bounded below by tr⁡2M−4det⁡M ≥ (2l−23)2−4(1+2l+166+236) = 4l2−4l−1309 > 0, since 4l2−4l=168 at l=7 and l↦4l2−4l is increasing for l≥1. Hence the eigenvalues are real. Let λ+ be the one of larger modulus; then ∣λ+∣≥12∣tr⁡M∣≥l−13>1, and ∣λ−∣=∣det⁡M∣∣λ+∣≤2∣det⁡M∣∣tr⁡M∣≤2(l3+6718)2l−23<1, the last inequality being equivalent to 7318<2l3, which holds because l≥7 and 143>7318. Thus ∣λ+∣>1>∣λ−∣≥0: zuˉ is hyperbolic.

4.4step 3.2step 3.3F2F8

Tail convergence: suppose sn=u for all ∣n∣≥N, and let m≥0. For n≥N+m+1 every j with ∣j−n∣≤m−1 satisfies j>N, so (Tsm0)n=(Tuˉm0)n; for n≤−N−(m+1) every such j satisfies j<−N, so again (Tsm0)n=(Tuˉm0)n. Hence, by the uniform error estimate of step 3.2 and q(uˉ) constant by step 3.3, ∣qn(s)−ρu∣≤4Rνm whenever ∣n∣≥N+m+1. Letting m→∞ gives qn(s)→ρu as n→±∞; consequently zn(s)→(ρu,V(ρu,ρu))=zuˉ in both directions, by continuity of V ([F2]).

4.5givenstep 3.1F1F2F8algebra

Backward orbit under H: put w:=Σ(z∗) and define wn:=Σ(z−n(s)) for n∈Z. Since qj(s)∈[−R,R] and ∣vj(s)−qj+1(s)∣≤ε≤16 by [F1] and [F2], every zj(s) lies in Q, so every wn lies in the domain where H=Σ∘G−1∘Σ is defined. The orbit identity of step 3.1 gives G−1(z−n(s))=z−n−1(s); hence H(wn)=wn+1, so (wn)n∈Z is the corresponding full H orbit. Its coordinates are (wn)1=v−n(s) and (wn)2=q−n(s), and for every n, ∣(wn)1∣∈[l+712,R−712], because ∣qj+1(s)∣∈[l+34,R−34] by [F1] and ∣vj(s)−qj+1(s)∣≤16 by [F2]; the sign of (wn)1 may depend on n. Set xn:=(wn)1. By definition of the inverse branch VH of the first component H1 of H, the orbit relations H1(wn−1)=(wn)1, H2(wn−1)=(wn)2 say VH(xn−1,xn)=(wn−1)2 and H2(xn−1,VH(xn−1,xn))=VH(xn,xn+1); by clause 4 of [F1] applied to H, this gives Pxn−1,xn+1H(xn)=0. Since xn∈sign⁡(xn)[l,R], clause 1 of [F1] applied to H yields xn=Msign⁡xnH(xn−1,xn+1)(n∈Z).

5.1givenstep 3.2step 4.1F5F6

Topology: let C⊆X± be closed. A sequence in C has a subsequence converging in the sequentially compact space X± ([F5] and the isometry φ of [F6]), and its limit lies in C because closed sets are sequentially closed by the choice-free direction of [F6]; hence C is sequentially compact. The continuous image hG(C) is sequentially compact: given a sequence (hG(xk)) with xk∈C, pick a subsequence xkj→x∈C and use continuity of hG; hence hG(C) is sequentially closed (any convergent sequence in it has a subsequence converging to a point of hG(C), and limits are unique by [F6]), and by the ACω direction of [F6] it is closed in R2. Thus hG is a closed map, so hG−1 is continuous. Under the Axioms of Countable and Dependent Choice, X± is compact by [F5] and hG(X±)=ΛG is a continuous image of it, hence compact.

5.2givenstep 2.1step 3.3step 4.4F1F2F3F7F8algebra

Stable curve for G: let s be nonconstant with sn=u for ∣n∣≥N, and set yn:=qn+1(s) for n≥0, b∗:=q0(s). Then yn=Msn+1(yn−1,yn+1) for n≥0 with y−1:=b∗, and ∣yn∣∈[l+34,R−34] by [F1]. Apply Weighted half-tail contractions for qn=Msn(qn−1,qn+1) give a unique C1 curve with tangent slope bounded by c/(1−q) with θ=1/2, c=d≤2/13, q=d(θ+θ−1)≤5/13<1, J=[−R,R], ρˉ=12, δ∗=14, and update Msn+1. The half-orbit margin follows from the root margins, [b∗−δ∗,b∗+δ∗]⊆J follows from ∣q0(s)∣≤R−34, and δ∗<(1−q)ρˉ/d because d≤2/13. By [F3] there is a C1 family u(b) with ∣d0∣≤d/(1−q)≤1/4, and the phase curve Z(b):=(b,V(b,y0+u0(b))) through Z(b∗)=(q0(s),V(q0(s),q1(s)))=z∗ has tangent (1,T) with T=∂qV(b∗,y0)+∂q′V(b∗,y0)d0,∣T∣≤ε1−ε+11−ε⋅14≤15+65⋅14=12≤34. Thus the tangent lies in C3/4s. The recurrence coordinates remain in [−R,R] by the weighted-ball construction; their phase points (xn,V(xn,xn+1)) lie in Q⊆U because ∣V(xn,xn+1)∣≤R+ε<R+1. Step 3.1 therefore gives every forward iterate without leaving the domain of G. Every point Z(b) has forward orbit tracking that of z∗, which converges to zuˉ by step 4.4; hence these points lie in WGs(zuˉ) near b∗.

5.3step 1.1step 3.2step 4.2F1F6algebra

Sensitivity: let s∈X± and let r>0. Choose m≥0 such that 4RChνm<r, using 0<ν<1 from step 1.1, and define t∈X± by tj=sj for j≠m+1 and tm+1=−sm+1. Since s,t agree on ∣j∣≤m, the estimate in step 3.2 gives ∥hG(s)−hG(t)∥2<r. At coordinate 0, the codes S±m+1s and S±m+1t have opposite signs; by [F1] their coded first coordinates have opposite signs and absolute values at least l+34. Therefore ∥hG(S±m+1s)−hG(S±m+1t)∥2≥2(l+34)>2l. Iterating the conjugacy of step 4.2 identifies these two points with Gm+1(hG(s)) and Gm+1(hG(t)). Thus for every point of ΛG and every radius r>0 there is a point within distance r whose forward iterates are separated by at least 2l, proving sensitivity with constant 2l under the definition in [F6].

6.1givenstep 4.2step 4.1step 5.1F5F6

Mixing and dense periodic points: G is C2 on an open set containing ΛG, so its restriction to ΛG is continuous. Under ACω, hG is a homeomorphism by step 5.1. If U,V⊆ΛG are nonempty and relatively open, then hG−1(U) and hG−1(V) are nonempty open subsets of X±. The shift S± is topologically mixing by [F5], so there is N such that S±n(hG−1(U))∩hG−1(V)≠∅ for all n≥N. By the conjugacy in step 4.2, this gives Gn(U)∩V≠∅ for all n≥N, proving mixing. The same conjugacy and injectivity show that hG maps periodic shift codes exactly to periodic points of G∣ΛG; since periodic shift codes are dense by [F5] and hG is a homeomorphism, these periodic points are dense in ΛG.

6.2givenstep 4.1step 4.4step 5.2step 4.5F1F2F3F7algebra

Unstable curve for G: shift the H-reference to yn′:=xn+1 (n≥0) with y−1′:=x0=v0(s), and apply Weighted half-tail contractions for qn=Msn(qn−1,qn+1) give a unique C1 curve with tangent slope bounded by c/(1−q) to H with θ=1/2, c=d, q≤5/13, J=[−R,R], ρˉ=12, and δ∗=14. The reference recurrence holds by step 4.5. Its margins satisfy ∣yn′∣≥l+34−ε≥l+712>l+12 and ∣yn′∣≤R−34+ε≤R−712<R−12; also ∣y−1′∣=∣v0(s)∣≤R−712, so the margin and parameter interval conditions hold. Moreover δ∗<(1−q)ρˉ/d because d≤2/13. By [F3] we obtain a C1 recurrence curve γH(b)=(b,y0′+u0(b)); composing with the H-phase map gives ZH(b):=(b,VH(b,y0′+u0(b))) through ZH(y−1′)=(v0(s),VH(v0(s),v−1(s)))=w, with tangent (1,TH) and ∣TH∣≤1/5+(6/5)(1/4)=1/2. The reference orbit wn=Σ(z−n) converges to Σ(zuˉ) by step 4.4, so the tracked points lie in WHs(Σ(zuˉ)). Thus γu(t):=Σ(ZH(v0(s)+t)) for sufficiently small ∣t∣ is a C1 curve through z∗ in WGu(zuˉ), since G−n(Σξ)=ΣHn(ξ)→Σ(Σ(zuˉ))=zuˉ. Its tangent is Σ(1,TH)=(TH,1)∈C3/4u. Finally z∗≠zuˉ because hG is injective by step 4.1 and s≠uˉ.

7.1step 3.1step 6.1step 5.3step 4.3step 6.2F7∎

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 ACω; 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 ε0>0 smaller than both parameter-neighbourhood radii and define γs(t):=Z(b∗+t) and γu(t):=Σ(ZH(v0(s)+t)) for ∣t∣<ε0. Then both curves pass through z∗, are injective because their first coordinate is their parameter and Σ is invertible, lie in the respective stable and unstable sets, and have tangents in C3/4s and C3/4u. Those cones intersect only at zero, so the tangent lines are distinct and z∗ is transverse.

Remarks

  • The theorem is deliberately explicit: the constants d≤2/13, q≤5/13, the margins ≥34 and the cone aperture 3/4 are all uniform for a≥100 and ε≤1/6, so the hypothesis on ε is a finite, checkable condition rather than an abstract smallness statement. The genuine smallness requirement is only η=Cε≤1 together with ε≤1/6.

  • The second hypothesis, that H=ΣG−1Σ is again close to F, 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 K(q,p)=(q,p+q2−a) in C1, and the period map is smooth, symplectic and C1-close to F.

  • No structural-stability theorem is invoked: the coded set, its conjugacy with the shift and the two curves are constructed directly.

DefinitionDefinition: AI-adaptedProof: Not applicableprecheck passOpen item page →

The smooth P-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 K={1/2}⊂(0,1), choose χ∈Cc∞((0,1)) with 0≤χ≤1 and χ=1 on a neighborhood of 1/2. Thus there are 0<α<β<1 with χ=1 on [α,β]. Before taking any integral, extend χ by zero to R, retaining the notation χ. Its compact support inside (0,1) makes this extension identically zero near both endpoints, hence smooth on R. The continuous extended function χ is integrable on [0,1]; by additivity and monotonicity of the integral and the integral of a constant,

I:=∫01χ(s) ds≥∫αβχ(s) ds=β−α>0,

using integrability of continuous functions (A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion), additivity and monotonicity (For a<c<b: f is integrable on [a,b] if and only if it is integrable on [a,c] and on [c,b], and then ∫abf=∫acf+∫cbf; with the oriented form for arbitrary a,b,c, If f≤g on [a,b] and both are integrable then ∫abf≤∫abg; and m(b−a)≤∫abf≤M(b−a)), and the integral of a constant (If m≤f≤M on [a,b] then m(b−a)≤L(f,P)≤∫ab‾f≤∫ab‾f≤U(f,P)≤M(b−a) for every partition P; in particular every constant function is integrable, with ∫abc=c(b−a)).

Define w0:=χ/I on (0,1) and let w:R→R be its extension by zero outside (0,1). Since χ has compact support in (0,1), this zero extension is smooth and compactly supported in (0,1). Linearity of the integral (Integrable functions on [a,b] form a set closed under sums and scalar multiples, and ∫ab(λf+μg)=λ∫abf+μ∫abg) gives

w∈Cc∞((0,1)),w≥0,∫01w(s) ds=1.

Fix such a pulse w for the constructions below. The resulting coefficient and endpoint maps may depend on this choice; the later estimates apply to every such w, with constants allowed to depend on it.

The periodic pulse. Fix a real parameter a≥100 and a smallness parameter δ>0, and put P:=π/2+δ. Define βδ:R→R to be the P-periodic function whose restriction to [0,P] is

βδ(t):=0(t∈[0,π2]),βδ(t):=1δ w(t−π/2δ)(t∈[π2,P]).

Both definitions use the same zero extension w:R→R, so the endpoint values w(0) and w(1) are defined and equal to 0. Since w vanishes on neighborhoods of 0 and 1, all its derivatives vanish there; the P-periodic extension of βδ is therefore of class C∞ on R (Ck Euclidean maps and diffeomorphisms). Also βδ≥0. To verify its normalization, put

Bδ(t):={0,0≤t≤π/2,∫0(t−π/2)/δw(s) ds,π/2≤t≤P.

The integral function of the continuous w has derivative w by The first fundamental theorem: if f is integrable on [a,b] and continuous at c, then F′(c)=f(c); in particular a continuous f has F as a primitive and A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion, and the chain rule (The chain rule, in one line from Carathéodory: if g is differentiable at c and f is differentiable at g(c), then f∘g is differentiable at c with (f∘g)′(c)=f′(g(c)) g′(c)) gives Bδ′(t)=βδ(t) on the pulse interval. Since w vanishes near its endpoints, Bδ is differentiable across t=π/2 as well. Since βδ is continuous and therefore integrable on [0,P], the second part of the fundamental theorem (The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a)) gives

∫0Pβδ(t) dt=Bδ(P)−Bδ(0)=∫01w(s) ds=1.

The Hamiltonian and its equations. Use the phase domain U=R2 with coordinates (q,p) and standard symplectic form ω=dq∧dp and matrix J=(01−10), as in A phase domain, its canonical one-form and its standard symplectic two-form. For each fixed time t, define the smooth Hamiltonian function

Hδ:R×R2⟶R,Hδ(t,q,p):=p2+q22+βδ(t)(aq−q33).

The Hamiltonian-vector-field convention is ιXHω=dH, for which The Hamiltonian field of a C2 function on a phase domain is J∇H, and the Poisson bracket is ∑i(∂qif ∂pig−∂pif ∂qig) gives XH=J∇H=(∂pH,−∂qH). Here ∂pHδ=p and ∂qHδ=q+βδ(t)(a−q2), so the associated time-dependent first-order system is

q′=p,p′=−q+βδ(t) (q2−a),

equivalently the second-order equation q′′=−q+βδ(t)(q2−a); the right-hand side is C∞ in (t,q,p), 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 P-periodic in t.

Free rotation and pulse endpoint maps. Over the first subinterval [0,π/2] the pulse vanishes and the system is the free oscillator; define the free rotation

R0:R2→R2,R0(q,p):=(p,−q),

which is the time-π/2 solution operator of q′=p, p′=−q: the map t↦(q0cos⁡t+p0sin⁡t, −q0sin⁡t+p0cos⁡t) 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 (q0,p0). Moreover cos⁡(π/2)=0 by the zero-set statement (The zero sets of sine and cosine and the least positive common period 2 pi), sin⁡(π/2)>0 by positivity on (0,π) (Pi is the first positive zero of sine), and sin⁡2(π/2)+cos⁡2(π/2)=1 (Parity and the Pythagorean identity for sine and cosine), so sin⁡(π/2)=1. Uniqueness of solutions then identifies the endpoint map with R0.

For s∈[0,1] the rescaled pulse equation is

qs=δ p,ps=−δ q+w(s) (q2−a),

obtained from the second half of the period by the substitution s=(t−π/2)/δ. For each initial state z=(q,p)∈R2, let Jzδ be the open maximal interval containing 0 of its solution to the rescaled equation. Define

Dδ:={z∈R2:[0,1]⊆Jzδ},Kδ:Dδ→R2,Kδ(z):=(q(1),p(1)),

where (q(s),p(s)) is the unique maximal solution with (q,p)(0)=z (Every Picard–Lindelöf initial value problem has one maximal solution on an open interval). For the original P-periodic system, let Jz be the maximal existence interval of the solution through z at time 0, and set DP:={z∈R2:[0,P]⊆Jz}. Define the stroboscopic map by

Gδ:DGδ→R2,DGδ:={z∈R2:R0(z)∈Dδ},Gδ(z):=Kδ(R0(z)).

The change of time variable s=(t−π/2)/δ identifies solutions on [π/2,P] with solutions of the rescaled equation on [0,1]. Concatenating with the unique free solution on [0,π/2] shows DGδ=DP and Gδ=θP there, where θP:DP→R2 is the stroboscopic map of The stroboscopic (time-P) map of a P-periodic first-order system. Conversely, restricting any solution through time P to the pulse interval and applying the same change of variables gives a solution of the rescaled equation through s=1; uniqueness identifies both maps.

Remarks

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

The rescaled pulse endpoint map converges to the kick K(q,p)=(q,p+q2−a) in C1, and the period map is smooth, symplectic and C1-close to F

Statement

Fix a≥100, put R:=a+3≥13, S:=[−R−1,R+1]2, and let w, δ, P, βδ, R0, the rescaled pulse equation, the endpoint map Kδ and the stroboscopic map Gδ=Kδ∘R0 be as in The smooth P-periodic pulsed oscillator: the normalized pulse, its Hamiltonian and its stroboscopic (period) map. Let

K(q,p):=(q, p+q2−a),F(q,p):=(p, p2−a−q),J:=(01−10),

so that F=K∘R0. Then there are constants δ1>0 and C1<∞ depending only on a and w such that for every 0<δ≤δ1:

  1. (existence on the pulse) for every (q,p)∈S the solution of the rescaled equation with initial data (q,p) exists on [0,1] and stays in the compact tube T:=[−R−2,R+2]×[−M,M], M:=R+1+(R+1)2+1; hence Kδ is defined on S, Kδ(S)⊆T, and

sup⁡S(∣Kδ−K∣+∥DKδ−DK∥)≤C1δ

for the Euclidean norm and the operator norm; 2. (closeness of the period map) sup⁡S(∣Gδ−F∣+∥DGδ−DF∥)≤C1δ; 3. (smoothness, invertibility, symplecticity) Gδ is of class C∞ on an open neighbourhood N of S; DGδ(z) is invertible for every z∈N and Gδ is injective on N, so Gδ:N→Gδ(N) is a C∞ diffeomorphism onto its image; and

DGδ(z)TJ DGδ(z)=J(z∈N),

that is, Gδ is symplectic; 4. (the reverse-conjugated map) let Sw(q,p):=(p,q) and Hδ:=Sw∘Gδ−1∘Sw on a neighbourhood of S. Then Hδ is of class C∞ there, and there is C2<∞, depending only on a and w, with

sup⁡S(∣Hδ−F∣+∥DHδ−DF∥)≤C2δ.

Consequently, each of the six componentwise closeness inequalities for Gδ and Hδ holds on S with common bound Cˉδ, where Cˉ:=max⁡(C1,C2): 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 w by zero to a smooth function on R, and put fδ(s,q,p)=(δp,−δq+w(s)(q2−a)) for real δ.

[F3]

On an established common compact interval the derivative in initial data solves Y′=Dzf(s,z)Y, Y(0)=I (C1 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.

[F4]

Closed Euclidean boxes are compact (Heine-Borel in Rn: with the Euclidean metric a subset of Rn 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 Ck regular map is Ck. Euclidean calculus uses the chain rule, mean-value inequality, continuity and boundedness of continuous derivatives on compact sets (Ck Euclidean maps and diffeomorphisms, The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder, The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case, The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a), On a convex open set, a uniform bound ∥Df(z)v∥2≤M∥v∥2 implies ∥f(y)−f(x)∥2≤M∥y−x∥2, A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value, Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric, Open ball, closed ball and sphere in a metric space, Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point, Absolute value in an ordered field, Basic properties of the absolute value, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

Proof

technique · direct; trap the forward and backward pulse evolutions in separate compact tubes, compare their state and variational equations, and use uniqueness to identify the backward endpoint as the inverse
1.1givenF1F2algebra

At δ=0 the forward solution through (q0,p0) is z0(s)=(q0,p0+(q02−a)∫0sw). For initial data in S, ∣q0∣≤R+1 and ∣q02−a∣≤(R+1)2; hence ∣p0+(q02−a)∫0sw∣≤M−1 on [0,1]. Thus this reference solution lies at least distance 1 from the boundary of the stated tube T. Its endpoint is K(q0,p0).

2.1step 1.1F1F2F4algebra

On T and for ∣δ∣≤1, there are constants B0,L0 depending only on a,w such that ∣fδ−f0∣≤B0∣δ∣ and ∥Dzfδ∥≤L0: one may take B0=M+R+2 and L0=1+2∥w∥∞(R+2). Up to the first exit from T, subtracting the integral equations gives ∣zδ(s)−z0(s)∣≤B0∣δ∣+L0∫0s∣zδ−z0∣, so Gronwall gives sup⁡∣zδ−z0∣≤B0eL0∣δ∣. Choose d0>0 with B0eL0d0<1/2. An exit on [0,1] 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 S has a solution on [0,1] staying in T.

3.1givenstep 2.1F1F2F4algebra

Larger tubes establish the domains needed for inversion. Set b:=R+2, Q:=[−b,b]2, B:=b+b2+a+2 and E:=[−B,B]2. For every datum in E, the forward reference solution has ∣q∣≤B, ∣p∣≤B+B2+a. For a terminal datum y=(yq,yp)∈E at s=1, the reference backward solution is (yq,yp−(yq2−a)∫s1w) with exactly the same bounds. Both reference families therefore have distance at least 1 from the boundary of TE:=[−B−1,B+1]×[−B−B2−a−1,B+B2+a+1]. Apply the integral comparison of step 2.1 on this tube, in the backward case after τ=1−s so that the field is −fδ(1−τ,z). This field has the same boundedness and Lipschitz estimates. With a smaller threshold dE>0, both evolutions exist over the whole unit interval for all their data in E, and their state differences from the reference evolutions are uniformly O(∣δ∣). All constants depend only on a,w. In particular K−1(Q)⊂int⁡E, since K−1(y)=(yq,yp−yq2+a) and its coordinates are bounded by b and b+b2+a=B−2. This uses the actual inverse preimage, without assuming it lies in Q.

4.1step 3.1F1F3F4choose

These families are smooth in initial or terminal data and δ on neighbourhoods of the compact data sets after decreasing dE. 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 [0,1] 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 Kδ and the backward endpoint map Lδ(y):=z(0) for z(1)=y are smooth near E and Q, respectively, for all sufficiently small ∣δ∣, including 0.

5.1step 2.1step 3.1step 4.1F2F3F4algebra

The state comparisons in steps 2.1 and 3.1 also hold in C1. Indeed, on either compact tube, Dzfδ−Dzf0 is bounded by ∣δ∣, and Dzf0 is uniformly Lipschitz in z, so along compared trajectories ∥Dzfδ(s,zδ)−Dzf0(s,z0)∥≤C∣δ∣. By [F3] their derivative matrices solve the variational equations with the same initial matrix I. Gronwall first bounds both matrices by eL, then, after subtracting their integral equations, bounds the difference by Ce2L∣δ∣, with fixed constants for the tube. The identical argument for the reflected field controls derivatives in terminal data. Consequently there are finite positive Cf,Cb with sup⁡Q(∣Kδ−K∣+∥DKδ−DK∥)≤Cf∣δ∣ and sup⁡Q(∣Lδ−K−1∣+∥DLδ−DK−1∥)≤Cb∣δ∣. Increasing Cf includes the forward estimates on S in the original tube; hence clause 1 follows.

6.1step 4.1step 5.1F1F3F4algebra

Choose δ1>0 below all previous thresholds and with Cbδ1<1. Then Lδ(Q)⊂int⁡E, because K−1(Q) has coordinate margin at least 2 in E. Put V:=(−b,b)2 and O:=int⁡E. Uniqueness of the original and reflected equations shows that Kδ is injective on O: solutions sharing their terminal value coincide when evolved backwards. Its differential is invertible by the following direct calculation: the rescaled field is J∇h for h(s,q,p)=δ(p2+q2)/2+w(s)(aq−q3/3); hence A=Dzfδ=JHess⁡h with symmetric Hessian and ATJ+JA=0. The variational matrix satisfies (YTJY)′=0 and Y(0)=I, so YTJY=J. A vector in the kernel of Y must then lie in the kernel of the invertible matrix J, so Y is invertible. By The Euclidean inverse function theorem, the smooth map Kδ on the open set O has C1 local inverses at every point; A local inverse of a Ck regular map is Ck upgrades these to smooth local inverses, which agree by injectivity; therefore Kδ:O→Kδ(O) is a smooth diffeomorphism onto its open image. For every y∈V, its backward trajectory starts at Lδ(y)∈O and ends at y; hence V⊂Kδ(O) and the inverse on V is exactly Lδ. Define N:=R0−1(O), an open neighbourhood of S. Then Gδ=Kδ∘R0:N→Kδ(O) is a smooth diffeomorphism, and clause 2 follows from step 5.1 and R0(Q)=Q, since R0 is a linear isometry.

7.1givenstep 6.1F3F4algebra

The matrix computation of step 6.1 also gives symplecticity. The rescaled field is J∇h with h(s,q,p)=δ(p2+q2)/2+w(s)(aq−q3/3). Its derivative matrix is A=JHess⁡h with symmetric Hessian. Since JT=−J and J2=−I, direct multiplication gives ATJ+JA=0. Therefore the variational matrix satisfies (YTJY)′=YT(ATJ+JA)Y=0 and Y(0)=I, giving YTJY=J. This identity forces Y invertible (a vector in its kernel must lie in the kernel of J). Also DR0=J satisfies JTJJ=J. Applying the chain rule to the composition yields DGδTJDGδ=J on N, proving clause 3.

7.2step 5.1step 6.1F4algebra

Since Sw(V)=V, the conjugated inverse is defined on the open neighbourhood V of S and has the explicit expression Hδ=R0∘Sw∘Lδ∘Sw, using SwR0−1=R0Sw. At δ=0 this is SwF−1Sw=F. Fixed linear isometries preserve both state and derivative comparison norms, so step 5.1 gives sup⁡S(∣Hδ−F∣+∥DHδ−DF∥)≤Cbδ. The composition is a smooth diffeomorphism onto its image, and clause 4 holds with C2:=Cb and clause 2 with C1:=Cf.

8.1step 5.1step 6.1step 7.1step 7.2F4algebra∎

Increase C1,C2 to positive constants if needed and decrease δ1 to include every threshold above. For 0<δ≤δ1, 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 Cˉδ, where Cˉ:=max⁡(C1,C2). 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 E is used only for forward and inverse domain control. The stated small forward tube T for data in S is retained. Constants and smallness thresholds depend on the fixed a and w; 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 YTJY=J and det⁡Y=1 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.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

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 (ACω), The axiom of dependent choice: a relation in which every element is related to something admits an N-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 a≥100, let w, βδ, P=π/2+δ and the stroboscopic map Gδ be as in The smooth P-periodic pulsed oscillator: the normalized pulse, its Hamiltonian and its stroboscopic (period) map, and let X±, S±, D± 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 δ0>0, depending only on a and w, such that for every 0<δ<δ0:

  1. there is a function hδ:X±→R2 that is a homeomorphism of (X±,D±) onto a compact subset Λδ:=hδ(X±) of R2 and satisfies Gδ∘hδ=hδ∘S±; in particular Λδ is compact and Gδ-invariant, and Gδ∣Λδ is conjugate to the shift;
  2. Gδ∣Λδ 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);
  3. the two constant codes give two hyperbolic fixed points of Gδ, one of each sign;
  4. for every nonconstant code s∈X± that is constant outside a finite set, the point hδ(s) 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 P-periodic ordinary differential equation q′′=−q+βδ(t)(q2−a) and its time-P map; no empirical claim, measurement or physical assumption occurs.

Facts & Assumptions

Given: The parameter a≥100, the fixed normalized pulse w, and for each δ>0 the periodic coefficient βδ, the Hamiltonian Hδ, the rescaled pulse equation, the rotation R0, the endpoint map Kδ and the stroboscopic map Gδ of The smooth P-periodic pulsed oscillator: the normalized pulse, its Hamiltonian and its stroboscopic (period) map.

[F1]

Structure of the model (The smooth P-periodic pulsed oscillator: the normalized pulse, its Hamiltonian and its stroboscopic (period) map): βδ is C∞ and P-periodic with βδ≥0 and ∫0Pβδ=1; the associated system is q′=p, p′=−q+βδ(t)(q2−a), smooth and locally Lipschitz in the state; and Gδ=Kδ∘R0 is its time-P map.

[F2]

Pulse approximation (The rescaled pulse endpoint map converges to the kick K(q,p)=(q,p+q2−a) in C1, and the period map is smooth, symplectic and C1-close to F): there are δ1>0 and C1,C2<∞ depending only on a and w such that for 0<δ≤δ1 the maps Kδ and Gδ=Kδ∘R0 are defined and C∞ on a neighbourhood of S=[−R−1,R+1]2, R=a+3, have sup⁡S(∣Gδ−F∣+∥DGδ−DF∥)≤C1δ with F(q,p)=(p,p2−a−q), Gδ is a symplectic C∞ diffeomorphism onto its image, and the conjugate map Hδ=Sw∘Gδ−1∘Sw, Sw(q,p)=(p,q), satisfies sup⁡S(∣Hδ−F∣+∥DHδ−DF∥)≤C2δ and is likewise C∞ and diffeomorphic onto its image near S; moreover both Gδ and Hδ 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 S with the common constant Cˉδ, where Cˉ:=max⁡(1,C1,C2).

[F3]

Under the Axioms of Countable and Dependent Choice (The Axiom of Countable Choice (ACω), The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain), the perturbed horseshoe (Explicit persistence under the stated forward and conjugated-inverse bounds: coded chaos, hyperbolic fixed points and transverse homoclinic points): for every ε≤1/6 with Cε≤1 and every C2 diffeomorphism G onto its image on a neighbourhood of S satisfying the six closeness inequalities with constant ε on S, and whose conjugate Sw∘G−1∘Sw does the same, the conclusions of clauses 1-4 above hold for G under these same axioms with sensitivity constant 2(a−3) and with all codes constant outside finite sets.

[F4]

A homeomorphism here means a bijection hδ 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 Gδ∘hδ=hδ∘S±. 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 1; a transverse homoclinic point is a point different from the fixed point lying in both invariant sets, with injective C1 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: xk→x iff d(xk,x)→0 in R).

Proof

technique · direct; choose $\delta_0$ so that the pulse approximation puts $G_\delta$ and $H_\delta$ inside the hypotheses of the perturbed horseshoe theorem, then transfer that theorem's conclusions
1.1givenF2F3algebra

Choice of the threshold: put Cˉ:=max⁡(1,C1,C2) and let δ0:=min⁡(δ1,  1/(6max⁡(1,Cˉ)),  1/(max⁡(1,C)max⁡(1,Cˉ)))>0, so that for 0<δ<δ0 the number ε:=Cˉδ satisfies 0<ε≤1/6 and Cε≤1.

2.1step 1.1F1F2F3

Hypotheses of the perturbed horseshoe for Gδ: by [F2] (with the identification of Gδ as the time-P map in [F1]), for 0<δ<δ0 the maps Gδ and Hδ=Sw∘Gδ−1∘Sw are C∞, hence C2, diffeomorphisms onto their images on a neighbourhood of S, and both satisfy each of the six componentwise closeness inequalities of [F3] on S with the common constant ε=Cˉδ; in particular Hδ is defined and C2 on a neighbourhood of S with the same inequalities. Thus the hypotheses of [F3] are met with ε=Cˉδ.

3.1step 2.1F3F4∎

Conclusions: applying [F3] to G=Gδ gives clauses 1-4 for the stroboscopic map: the coding homeomorphism hδ onto a compact invariant set Λδ with Gδ∘hδ=hδ∘S±, chaotic behaviour of Gδ∣Λδ, 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 hδ is injective.

Remarks

  • The threshold δ0 is explicit: it is the minimum of the pulse-approximation threshold and the two smallness conditions on max⁡(1,C1,C2)δ 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 q′′=−q+βδ(t)(q2−a) is a dimensionless mathematical model. A mechanical interpretation with a mass, a length scale and an angular frequency would multiply q and p 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-P map and its compact invariant set.

5 · Examples, experiments and counterexamples

None yet.

Sources