Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-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.

Local defect bound for frozen-slow Euler with fast microsteps

Statement

Let Ω⊆Rr+s be open, let r,s≥1, and let F=(f,g):Ω→Rr×Rs be continuous. Assume K,M≥0, and that F is jointly K-Lipschitz and bounded by M on a common set containing the exact solution U(t)=(x(t),z(t)), 0≤t≤H, and every microstate (x0,zj) of Frozen-slow explicit Euler with fast microsteps started at U(0)=(x0,z0). Assume the exact path and those microstates lie in the domain where these bounds hold, H>0, m≥1, and h=H/m. Then the successful macro output (x+,zm) satisfies ∥(x+,zm)−U(H)∥2≤4KMH2.

Facts & Assumptions

Given: The exact IVP solution, jointly Lipschitz and bounded field, positive macro step, positive integer microstep count, and the common-domain conditions in the Statement.

[F1]

View the autonomous field as F^(t,u):=F(u) on R×Ω. An exact first-order IVP solution then satisfies the componentwise Volterra integral equation on every subinterval (First-order systems, initial value problems, and solutions on intervals, A first-order initial value problem is equivalent to its Volterra integral equation, The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral).

[F2]

The vector integral obeys ∥∫abV(t) dt∥2≤∫ab∥V(t)∥2 dt (For a≤b and f:[a,b]→Rm integrable when a<b, ∥∫abf∥2≤∫ab∥f∥2; for a<b, ∥f∥2 is integrable).

[F3]

A successful step uses x+=x0+Hf(x0,z0) and zm=z0+∑j=0m−1hg(x0,zj) (Frozen-slow explicit Euler with fast microsteps).

[F4]

Along the exact path, ∥U(s)−U(0)∥2≤Ms; for every microstate, ∥zj−z0∥2≤jhM (Block variation bounds for a frozen-slow Euler step).

[F5]

A coordinate projection does not increase the Euclidean norm, and ∥(a,b)∥2≤∥a∥2+∥b∥2 (Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation).

[F6]

If an integrable real-valued function w satisfies 0≤w≤C on [a,b], then ∫abw≤C(b−a) (If f≤g on [a,b] and both are integrable then ∫abf≤∫abg; and m(b−a)≤∫abf≤M(b−a), claim 3).

[A1]

On all points compared below, ∥F(u)−F(v)∥2≤K∥u−v∥2 and ∥F(u)∥2≤M.

Proof

1.1F1F2F3F4F5F6F7A1algebra

By [F1] and [F3], the slow coordinate defect is the integral of the continuous vector-valued integrand f(x0,z0)−f(x(s),z(s)), integrable by [F7]. The projection bound [F5], Lipschitz condition [A1], and [F4] show its pointwise norm is at most KMH. Applying [F2] and [F6] to this integrand gives ∥x+−x(H)∥2≤KMH2.

1.2F1F3F4F5F7algebra

By [F1] and [F3], the fast-coordinate defect is the sum over j of integrals of the continuous vector-valued functions g(x0,zj)−g(x(s),z(s)) on [jh,(j+1)h], integrable by [F7]. For such an s, [F4] gives ∥x(s)−x0∥2≤Ms≤MH and ∥z(s)−zj∥2≤∥z(s)−z0∥2+∥zj−z0∥2≤Ms+jhM≤2MH. By [F5], the product-state distance is at most the sum of these coordinate distances, hence at most 3MH.

2.1F2F5F6F7A1step 1.2algebra

The projection bound [F5] and [A1] therefore bound each fast integrand norm by 3KMH. Applying [F2] and [F6] on each interval, then summing the m interval norms, gives ∥zm−z(H)∥2≤mh(3KMH)=3KMH2.

3.1F5step 1.1step 2.1algebra∎

By [F5], the product output error is at most the sum of the coordinate errors from steps 1.1 and 2.1. Thus it is at most (1+3)KMH2=4KMH2, as claimed.

Depends on

Used by

Dependency tree · two levels

78 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources