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.

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

Depends on

Dependency tree · 2 levels

Sources