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 — Examples

1 · Prerequisites

2 · Summary

The companion page to cm-math-chaos records explicit finite checks of its results. Everything here is mathematics: the examples carry domain: mathematics, depend only on the mathematical items of the parent page and on mathematical suppliers, and make no physical or empirical claim. No measurement, simulation or numerical integration is involved; every number is an exact algebraic expression in 74, 101 and rational constants.

Explicit constants at a=100: the contraction factor, the fixed points r± and the constant-code solutions evaluates the model at a=100: R=13, L=74, 126<R, contraction factor 1/74, and the constant-code fixed points r±=1±101 with the exact identity r±2=100+2r±.

The constant-code slope transform at a=100: the invariant slope of h↦1/(2r+−h) and the cone constants solves the fixed-slope equation h=1/(2r+−h) exactly, obtaining the small root h=r+−r+2−1∈(0,1/2), and verifies the cone constants λ=274−12, λ−1<1/2 and λ−2<1/2 that the slope lemma requires.

The single-flip code at a=100: a nonperiodic coded orbit converging to the fixed point at both ends exhibits the single-flip code s0=−1, sn=+1 for n≠0: it is nonperiodic and nonconstant, its coded orbit is not periodic and differs from (r+,r+), and it converges to (r+,r+) at both ends, so h(s) is a homoclinic point of the fixed point.

The δ=0 endpoint computation: the free rotation (q,p)↦(p,−q), the kick (q,p)↦(q,p+q2−a) and K∘R0=F computes the δ=0 endpoint data of the pulsed oscillator: the free oscillator carries (q0,p0) to (p0,−q0)=R0(q0,p0) over [0,π/2], the limiting pulse carries it to K(q0,p0)=(q0,p0+q02−a), and hence K∘R0=F; it also checks the pulse support and normalisation ∫0Pβδ=1.

Explicit root margins at a=100: endpoint signs 25 and 43, and d=2/13 for η=1 evaluates the perturbed root bounds at a=100, η=1: the unperturbed quadratic has endpoint values −25 and 43 at v=7 and v=13, the derivative bound is d=2/13, and the cone margins 2d=4/13<1, d(1/2+2)=5/13<1 and d/(1−d/2)=1/6<2/3 hold, with root margins at least 24/27 and 42/27.

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

None yet.

5 · Examples, experiments and counterexamples

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

Explicit constants at a=100: the contraction factor, the fixed points r± and the constant-code solutions

Example

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

R=100+3=13,L=a−2R=74,a+2R=126.

Then 126<169=132, so 126<R=13; 74>1, so L>1; and the contraction constant of Ts on B13 is

1L=174<1.

The constant codes uˉ (u=±1) are solved by the constant sequences xn=ru with

11<r+=1+101<12,−10<r−=1−101<−9,

the two displayed bounds hold because 100<101<121; and both satisfy the exact identity ru2=100+2ru. Every coded sequence has ∣xn∣≥74, and its sign is the corresponding symbol.

Facts & Assumptions

Given: The parameter a=100, the constants R=13, L=74, and the numbers r±=1±101.

[L1]

Model data (The square-root recurrence Ts(x)n=sna+xn−1+xn+1 is a contraction of BR with a unique coded solution, The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences): for a≥100, R=a+3, L=a−2R, the operator Ts is a contraction of BR with constant 1/L; its unique fixed point satisfies sign⁡xn(s)=sn, ∣xn(s)∣≥L and xn+1(s)+xn−1(s)=xn(s)2−a.

[L2]

Square roots and squares (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}, Absolute value in an ordered field, Integer powers am, Basic properties of the absolute value): 132=169, (101)2=101, 74>1 because 74>1, and 126<13 because 126<169 and both sides are nonnegative.

Verification

technique · direct; evaluate the defining inequalities and identities at the explicit constants
1.1givenL2algebra

Endpoint inequality: a+2R=100+26=126 and R2=169, so a+2R<R2; by [L2] 126<13=R, which is the self-mapping inequality of The square-root recurrence Ts(x)n=sna+xn−1+xn+1 is a contraction of BR with a unique coded solution. Similarly a−2R=100−26=74>1, so L=74>1 and 1/L<1.

1.2givenL1L2algebra

The fixed points: for r±=1±101 one has, using [L2], r±2=1±2101+101=102±2101=100+2(1±101)=100+2r±. Hence (Tuˉx~)n=u100+ru+ru=u100+2ru=uru2=ru by [L2] and sign⁡ru=u, so the constant sequence x~n=ru is a fixed point of Tuˉ; by uniqueness it is x(uˉ).

2.1givenstep 1.2L1L2algebra∎

Bounds: ∣r±∣≥101−1>9>74=L and ∣r±∣<12<13=R, consistent with the general bounds of [L1]; the strict bounds 9>74 and 101<11 follow from 74<81 and 101<121.

Remarks

  • All verifications are exact algebraic identities involving 101, 74 and 126, with rational comparisons for the inequalities; no numerical integration, simulation or measurement is involved.
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

The constant-code slope transform at a=100: the invariant slope of h↦1/(2r+−h) and the cone constants

Example

Take a=100, so L=74, k=1/2, and let r+=1+101 be the constant-code value of the all-+1 code. The fixed slope of the forward transform Φy(h)=1/(2y−h) at y=r+ is the small root of h=1/(2r+−h), i.e. of

h2−2r+h+1=0:h=r+−r+2−1=1r++r+2−1,

and one has 0<h<1/2. Moreover λ=2L−k=274−12>1 and Φr+ maps [−1/2,1/2] into [−λ−1,λ−1]⊆[−1/2,1/2] with Lipschitz constant λ−2<1/2.

Facts & Assumptions

Given: The parameter a=100, the constants L=74, k=1/2, r+=1+101, and the slope maps of Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family.

[L1]

Slope transform data (Stable and unstable cones, invariant line slopes, stable and unstable sets, and transverse homoclinic points of the quadratic family, Cone invariance and expansion, and convergence of the slope graph transforms to unique invariant stable and unstable line fields): for L≥2, 0<k<1, k(2L−k)≥1, ∣y∣≥L and ∣h∣,∣h′∣≤k, the forward slope map satisfies ∣Φy(h)∣≤(2L−k)−1 and ∣Φy(h)−Φy(h′)∣≤(2L−k)−2∣h−h′∣; under these hypotheses the cone Cku is invariant under DF at points with second coordinate of absolute value at least L, with expansion factor 2L−k>1.

[L2]

Constant-code check using The square-root recurrence Ts(x)n=sna+xn−1+xn+1 is a contraction of BR with a unique coded solution, clause 4: for the given r+=1+101, direct expansion gives r+2=100+2r+ and 0<r+<12<13=R. Thus the constant sequence xn=r+ lies in BR and satisfies r+=100+2r+; uniqueness of the coded fixed point identifies it with the all-+1 code.

[L3]

Square roots and inequalities (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}, Absolute value in an ordered field, Basic properties of the absolute value): r+>10 because 101>10; r+2−1>r+−1; 274>17 because 4⋅74=296>289=172.

Verification

technique · direct; solve the fixed-slope equation exactly and evaluate the cone constants at $a=100$
1.1givenL2L3algebra

Fixed slope: the equation h=1/(2r+−h) is equivalent to h2−2r+h+1=0, whose roots are r+±r+2−1; the small root is h=r+−r+2−1=1/(r++r+2−1). Since r+>10 and r+2−1>9, one has 0<h<1/(10+9)<1/2.

2.1givenstep 1.1L1L3algebra∎

Cone constants: L=74>8≥2 and 0<k=1/2<1. Also r+>10>L, since 74<100. By [L3], λ=274−12>17−12>1; also k(2L−k)=12(274−12)>12⋅16>1, so the invariance and expansion hypotheses of [L1] hold with λ=274−12. The induced bounds are ∣Φr+(h)∣≤λ−1<1/2 and ∣Φr+(h)−Φr+(h′)∣≤λ−2∣h−h′∣ with λ−2<1/2, in agreement with [L1].

Remarks

  • The fixed slope h is the slope of the invariant unstable line at the fixed point in the cone C1/2u; the computation uses only the exact fixed-point relation r+2=100+2r+ and rational estimates for the two square roots.
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

The single-flip code at a=100: a nonperiodic coded orbit converging to the fixed point at both ends

Example

Take a=100 and let s∈X± be the code with

s0=−1,sn=+1 (n≠0),

the single-flip code. Then s is constant outside a finite set (indeed outside {0}), is not the constant code +1ˉ, and is not periodic: S±ms≠s for every m≥1, because the unique coordinate at which S±ms equals −1 is −m≠0 whereas s equals −1 only at 0. Consequently the coded point z:=h(s) satisfies z≠(r+,r+) and Fm(z)≠z for every m≥1, while

Fn(z)⟶(r+,r+)(n→+∞ and n→−∞).

Facts & Assumptions

[L1]

Finite-word data (Constant codes give the fixed points, and finite nonconstant word codes give homoclinic orbits converging to a fixed point at both ends): a code that equals the constant code uˉ outside a finite set has coded orbit converging to (ru,ru) at both ends, and h(s)≠(ru,ru) for s≠uˉ; distinct codes give distinct points.

[L2]

Conjugacy and injectivity (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ω, Finite symbol windows determine the code: locality of the iterates, coding continuity and injectivity of h(σ)=(x−1(σ),x0(σ))): Fn(h(t))=h(S±nt) for all t and n, and h is injective; hence Fm(h(s))=h(s) would force S±ms=s, and h(s)=h(+1ˉ) would force s=+1ˉ.

[L3]

The constant code (Constant codes give the fixed points, and finite nonconstant word codes give homoclinic orbits converging to a fixed point at both ends, clause 1): h(+1ˉ)=(r+,r+) with r+=1+101.

Verification

technique · direct; combine the finite-word convergence with the injectivity of the coding to exclude periodicity
1.1givenalgebra

Nonperiodicity of the code: for m≥1, the coordinate 0 of S±ms equals sm=+1, while s0=−1; hence S±ms≠s. Also s≠+1ˉ because s0=−1.

2.1givenstep 1.1L2L4

The point differs from the fixed point: by [L4], x0(s)<0<r+, so h(s)≠(r+,r+) directly; alternatively this follows from the injectivity and s≠+1ˉ in [L1], [L2].

2.2step 1.1L2

No return to the initial point: if Fm(h(s))=h(s) for some m≥1, then h(S±ms)=h(s) by [L2], so S±ms=s by injectivity, contradicting step 1.1.

3.1step 2.1step 2.2L1L3∎

Two-sided convergence: the code s equals +1ˉ outside {0}, so [L1] applies with u=+1 and gives Fn(h(s))→(r+,r+) as n→±∞. Together with steps 2.1 and 2.2 this exhibits h(s) as a nonperiodic homoclinic point of the fixed point (r+,r+).

Remarks

  • The verification uses only the coding dictionary and the finite-word convergence; it does not compute the coordinates of h(s), which have no closed form.

  • The same argument applies to every nonconstant code that is constant outside a finite set: none of these coded orbits is periodic, and each converges to the corresponding fixed point in both time directions.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

The δ=0 endpoint computation: the free rotation (q,p)↦(p,−q), the kick (q,p)↦(q,p+q2−a) and K∘R0=F

Example

In the model of The smooth P-periodic pulsed oscillator: the normalized pulse, its Hamiltonian and its stroboscopic (period) map:

  1. the free oscillator q′=p, p′=−q on the interval [0,π/2] carries the initial data (q0,p0) to

(q,p)(π2)=(q0cos⁡π2+p0sin⁡π2,  −q0sin⁡π2+p0cos⁡π2)=(p0,−q0)=R0(q0,p0);

  1. the δ=0 rescaled equation qs=0, ps=w(s)(q2−a) has the exact solution q(s)=q0, p(s)=p0+(q02−a)∫0sw, so its endpoint map is

K(q0,p0)=(q0,  p0+q02−a)

because ∫01w=1; and

(K∘R0)(q0,p0)=K(p0,−q0)=(p0, −q0+p02−a)=F(q0,p0).

Moreover βδ≥0 with ∫0Pβδ=1 and the restriction of the pulse to [0,P] has support contained in (π/2,P). On R its support is the periodic union ⋃j∈Z(π/2+δ supp⁡w+jP).

Facts & Assumptions

Given: The model data w, δ>0, βδ, R0, the rescaled equation and the maps K,F of The smooth P-periodic pulsed oscillator: the normalized pulse, its Hamiltonian and its stroboscopic (period) map.

[L1]

Trigonometric solution (The derivatives of sine and cosine are cosine and minus sine, Sine and cosine defined by their real power series, Parity and the Pythagorean identity for sine and cosine, The zero sets of sine and cosine and the least positive common period 2 pi, Pi is the first positive zero of sine): the functions q(t)=q0cos⁡t+p0sin⁡t, p(t)=−q0sin⁡t+p0cos⁡t satisfy q′=p, p′=−q and the initial conditions; cos⁡(π/2)=0, sin⁡(π/2)>0, and the Pythagorean identity gives sin⁡(π/2)=1.

[L2]

Pulse data (The smooth P-periodic pulsed oscillator: the normalized pulse, its Hamiltonian and its stroboscopic (period) map): w:R→R is smooth, nonnegative and compactly supported inside (0,1) with ∫01w=1; βδ is P-periodic with ∫0Pβδ=1; βδ=0 on [0,π/2] and βδ(t)=δ−1w((t−π/2)/δ) on [π/2,P].

[L3]

Since w is continuous on [0,1], it is integrable (A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion); its integral function W(s):=∫0sw(u) du satisfies W′(s)=w(s) on [0,1] by the first part of the fundamental theorem of calculus (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 W(1)=1 by [L2].

[L4]

Uniqueness of solutions (Every Picard–Lindelöf initial value problem has one maximal solution on an open interval): the free oscillator field (q,p)↦(p,−q) is continuous and locally Lipschitz, so its initial value problems have a unique maximal solution; every solution with the same initial data is a restriction of that maximal solution.

Verification

direct; differentiate the displayed trigonometric solutions, integrate the constant right-hand side, and substitute the two endpoint maps.

1.1givenL1L4algebra

Free rotation: by [L1] the displayed (q,p) solves the free equations with the stated initial data, so by the uniqueness clause of [L4] it is the solution and the time-π/2 map is (q0,p0)↦(q0cos⁡π2+p0sin⁡π2,−q0sin⁡π2+p0cos⁡π2)=(p0,−q0)=R0(q0,p0).

1.2givenL2L3algebra

Kick: for δ=0 the rescaled equation is qs=0, ps=w(s)(q02−a). By [L3], q(s)=q0 and p(s)=p0+(q02−a)W(s) solve it with the stated initial data; evaluating at s=1 and using W(1)=1 gives K(q0,p0)=(q0,p0+q02−a).

2.1step 1.1step 1.2algebra

Composition: substituting (q0,p0)↦(p0,−q0) into K and expanding gives (K∘R0)(q0,p0)=(p0,−q0+p02−a)=F(q0,p0), which is the displayed identity.

3.1givenL2∎

Pulse support and normalization: by [L2], on the single period [0,P] the coefficient vanishes outside the compact set π/2+δ supp⁡w⊂(π/2,P), is nonnegative, and has integral 1. Periodicity translates that set by each jP, j∈Z, giving the stated global support union. The integral on one period is 1; the global periodic coefficient does not have bounded support.

Remarks

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

Explicit root margins at a=100: endpoint signs 25 and 43, and d=2/13 for η=1

Example

Take a=100 in Root bounds and C1 dependence for the perturbed scalar recurrence v2−a−u−w+e(u,v,w)=0, so that R=13, l=7, and suppose the defect bound is η=1. Then:

  1. for all u,w∈[−13,13] the unperturbed quadratic v2−100−u−w satisfies

v2−100−u−w∣v=7≤49−100+26=−25,v2−100−u−w∣v=13≥169−100−26=43,

so the signs at the endpoints are strictly opposite with margins 25 and 43; 2. the derivative bound is d=(1+η)/(2l−η)=(1+1)/(14−1)=2/13, and

2d=413<1,d(12+2)=513<1,d1−d/2=2/1312/13=16<23;

  1. the root margins are at least 24/27>3/4 and 42/27>3/4, since the slope of Pu,w is bounded by 2R+η=27 on [7,13].

Facts & Assumptions

[L1]

Perturbed root data (Root bounds and C1 dependence for the perturbed scalar recurrence v2−a−u−w+e(u,v,w)=0): with η as the defect bound, the root map satisfies ∣∂uMs∣,∣∂wMs∣≤d=(1+η)/(2l−η) and every root v=Ms(u,w) satisfies sv−l≥34 and R−sv≥34.

[L2]

Elementary arithmetic (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}, Absolute value in an ordered field, Basic properties of the absolute value, Intervals of R: the nine order-convex forms, nondegeneracy, and length): 72=49, 132=169, 2⋅13=26, 14−1=13, 4/13<1, 5/13<1, 1/6<2/3, and 24/27>3/4, 42/27>3/4.

Verification

technique · direct; evaluate the quadratic at the two endpoints in the worst case and substitute the numerical data into the general bounds
1.1givenL2algebra

Endpoint signs: for u,w∈[−13,13] the sum u+w ranges over [−26,26], so v2−100−u−w at v=7 is at most 49−100+26=−25<0, and at v=13 is at least 169−100−26=43>0.

1.2givenL1L2algebra

Derivative bound and cone constants: substituting l=7, η=1 into d=(1+η)/(2l−η) gives d=2/13, and the displayed inequalities follow from [L2].

2.1givenstep 1.1L1L2algebra∎

Margins: with η=1 and 2R+η=27, the endpoint margins guaranteed by the root lemma are 24/27 and 42/27: the endpoint values of Pu,w have magnitudes at least 25−1=24 and 43−1=42, and ∣Pu,w′∣≤27 on [7,13]. Thus the root distances are at least 24/27>3/4 and 42/27>3/4, consistent with the general margins of [L1].

Remarks

  • Every number is evaluated symbolically at the worst case a=100 and η=1; larger a or smaller η only improve the margins.

Sources