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.

Block variation bounds for a frozen-slow Euler step

Statement

Let r,s,m be positive integers, H>0, h=H/m, Ω⊆Rr+s open, and let F=(f,g):Ω→Rr×Rs be continuous. Use the product Euclidean norm ∥(x,z)∥22=∥x∥22+∥z∥22. Let S⊆Ω, and suppose ∥F(u)∥2≤M for all u∈S, where M≥0. Let U:[0,H]→Ω be an exact solution of U′=F(U), and run Frozen-slow explicit Euler with fast microsteps from U(0)=(x0,z0) with U([0,H])⊆S and every frozen state (x0,zj)∈S. Then ∥U(b)−U(a)∥2≤M(b−a)(0≤a≤b≤H),∥zj−z0∥2≤jhM(0≤j≤m).

Facts & Assumptions

Given: The dimensions, macro and micro steps, field bound, exact solution, and admissible microstates in the Statement.

[F1]

View the autonomous field as F^(t,u):=F(u) on R×Ω. An exact IVP solution then satisfies its Volterra equation on every subinterval, with the value at the left endpoint as initial data (First-order systems, initial value problems, and solutions on intervals, A first-order initial value problem is equivalent to its Volterra integral equation).

[F2]

For an integrable vector field on an increasing interval, ∥∫abV(t) dt∥2≤∫ab∥V(t)∥2 (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]

At each fast-loop iteration whose pre-update state (x0,zj) lies in D, the procedure sets zj+1=zj+hg(x0,zj), with the same frozen x0 at every microstep (Frozen-slow explicit Euler with fast microsteps). If all m pre-update states lie in D, all loop updates are performed even when the final state (x+,zm) is outside D and the procedure consequently returns domain-exit.

[F4]

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]

U([0,H])⊆S and every microstate (x0,zj) belongs to S, where F is bounded by M.

Proof

1.1F1F2F4A1algebra

Fix 0≤a≤b≤H. If a=b, the oriented integral is zero and the bound holds. Suppose a<b. Apply [F1] to the restriction of U with initial time a, then [F2], [A1], and [F4]: ∥U(b)−U(a)∥2=∥∫abF(U(t)) dt∥2≤∫ab∥F(U(t))∥2 dt≤M(b−a). Here ∥F(U(t))∥2 is integrable by [F2] and lies between 0 and M by [A1].

2.1F3A1inductionalgebra∎

By [F3] and [A1], ∥zj+1−zj∥2=h∥g(x0,zj)∥2≤h∥F(x0,zj)∥2≤hM, since a block projection has norm at most the product norm. Starting with z0−z0=0 and summing these j increments gives ∥zj−z0∥2≤jhM for every 0≤j≤m.

Depends on

Used by

Dependency tree · two levels

59 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