Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

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.

Depends on

Dependency tree · 2 levels

Sources