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.

✓ 3 results · all verified · 3 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 3 also cleared it.

Geometric numerical integration — Examples

1 · Prerequisites

2 · Summary

Summary

These computations verify the fixed kick-then-drift convention for symplectic Euler, exhibit the exactly preserved positive modified quadratic form for Störmer–Verlet when ∣h∣<2, and give backward Euler as an A-stable but non-symplectic method. The identities are derived from the actual step matrices. The Verlet estimate is specific to the harmonic oscillator and does not substitute for the finite-order theorem on the A page.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Kick-then-drift symplectic Euler on the harmonic oscillator

Example

For H(q,p)=12(q2+p2) on R2 and h>0, the kick-then-drift symplectic Euler step is (q+p+)=(1−h2h−h1)(qp). The same matrix formula is its algebraic signed-step extension, and that extension is symplectic for every real h. The original Hamiltonian need not be exactly conserved.

Facts & Assumptions

Given: V(q)=q2/2, M=1, the local kick-then-drift algorithm, and J=(01−10).

[F1]

The method applies p+=p−hV′(q) and then q+=q+hp+. Local kick-then-drift symplectic Euler step

[F2]

For S=(abcd), multiplication gives STJS=(0ad−bcbc−ad0)=(det⁡S)J.

Verification

1.1givenF1algebra

Since V′(q)=q, [F1] gives p+=p−hq and q+=q+h(p−hq)=(1−h2)q+hp, which is the displayed matrix.

2.1F2step 1.1algebra

Its determinant is (1−h2)⋅1−h(−h)=1. By [F2], STJS=J, verifying symplecticity.

3.1step 1.1givenalgebra∎

For any h>0, starting from (q,p)=(0,1) gives (q+,p+)=(h,1) by step 1.1. Thus H(q+,p+)−H(q,p)=h2/2>0, so the original Hamiltonian is not conserved by every step.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Störmer–Verlet has bounded oscillatory energy error on the harmonic oscillator

Example

For H(q,p)=12(q2+p2), use the real-parameter kick and drift shears of One-step leapfrog map as force and drift shears and define the signed kick-drift-kick step Sh:=Kh/2∘Dh∘Kh/2 for real h; for h>0 this is the published one-step map, and for h<0 it is its same-form signed-step extension. If 0<∣h∣<2, this step preserves the positive quadratic form H~h(q,p)=12((1−h2/4)q2+p2). Consequently its original-energy error is bounded uniformly over all step counts by ∣H(qn,pn)−H(q0,p0)∣≤h28(2H~h(q0,p0)1−h2/4+q02).

Facts & Assumptions

Given: The published kick-drift-kick map, M=1, V(q)=q2/2, and 0<∣h∣<2.

[F1]

The force kicks and drifts are defined for real parameters, with formulas Ka(q,p)=(q,p−aq) and Db(q,p)=(q+bp,p); their signed composition is Sh=Kh/2∘Dh∘Kh/2. For h>0 it is the one-step map in One-step leapfrog map as force and drift shears.

Verification

1.1F1givenalgebra

The first kick gives p1/2=p−hq/2, the drift gives q1=q+hp1/2=(1−h2/2)q+hp, and the last kick gives p1=p1/2−hq1/2=−h(1−h2/4)q+(1−h2/2)p. Thus Sh=(ah−hsa),a=1−h2/2,s=1−h2/4.

2.1step 1.1algebra

Direct multiplication gives ShT(s001)Sh=(s(a2+h2s)00a2+h2s)=(s001), because a2+h2s=1. Hence H~h is exactly invariant. Since s>0, invariance implies qn2≤2H~h(q0,p0)/s for every n.

3.1step 2.1algebra∎

The identity H~h=H−(h2/8)q2 gives H(qn,pn)−H(q0,p0)=h28(qn2−q02). Apply the bound from step 2.1 and the triangle inequality to obtain the stated uniform error estimate.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Backward Euler is A-stable but not symplectic

Example

Backward Euler on the oscillator y′=Ay, A=(01−10), is A-stable but not symplectic for any h>0. Here A-stable means its scalar stability function has modulus at most one for every z with Re⁡z≤0.

Facts & Assumptions

Given: The backward Euler equation y+=y+hAy+, h>0, and the canonical matrix J=(01−10).

[F1]

A one-step matrix on this scalar test equation has stability function R(z) defined by y+=R(hλ)y when y′=λy; A-stability is the modulus condition in the Example.

[F2]

In dimension two, STJS=(det⁡S)J, by direct multiplication.

Verification

1.1givenF1algebra

For y′=λy, backward Euler gives (1−hλ)y+=y, so R(z)=1/(1−z) wherever defined. If Re⁡z≤0, then ∣1−z∣2=1−2Re⁡z+∣z∣2≥1, whence ∣R(z)∣≤1 and the method is A-stable.

2.1F2algebra∎

For the oscillator, I−hA=(1−hh1), so SBE=(I−hA)−1=11+h2(1h−h1),det⁡SBE=11+h2<1. By [F2], SBETJSBE=(det⁡SBE)J≠J. It is therefore not symplectic.

Sources