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.
Geometric numerical integration — Examples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Countability and Uncountability
- Determinants of Matrices over a Commutative Ring
- Direct Matrix Factorisations: LU, Cholesky and QR
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Geometric numerical integration
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hamiltonian Monte Carlo and leapfrog correction
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Order, Zorn's Lemma, and the Axiom of Choice
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Symplectic Manifolds, Moser Stability, and Darboux–Weinstein Theory
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Riemann Integral: Definition and Integrability
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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 , 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
Kick-then-drift symplectic Euler on the harmonic oscillator
Example
For on and , the kick-then-drift symplectic Euler step is The same matrix formula is its algebraic signed-step extension, and that extension is symplectic for every real . The original Hamiltonian need not be exactly conserved.
Facts & Assumptions
Given: , , the local kick-then-drift algorithm, and .
The method applies and then . Local kick-then-drift symplectic Euler step
For , multiplication gives .
Verification
Since , [F1] gives and , which is the displayed matrix.
Its determinant is . By [F2], , verifying symplecticity.
For any , starting from gives by step 1.1. Thus , so the original Hamiltonian is not conserved by every step.
Störmer–Verlet has bounded oscillatory energy error on the harmonic oscillator
Example
For , 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 for real ; for this is the published one-step map, and for it is its same-form signed-step extension. If , this step preserves the positive quadratic form Consequently its original-energy error is bounded uniformly over all step counts by
Facts & Assumptions
Given: The published kick-drift-kick map, , , and .
The force kicks and drifts are defined for real parameters, with formulas and ; their signed composition is . For it is the one-step map in One-step leapfrog map as force and drift shears.
Verification
The first kick gives , the drift gives , and the last kick gives . Thus
Direct multiplication gives because . Hence is exactly invariant. Since , invariance implies for every .
The identity gives Apply the bound from step 2.1 and the triangle inequality to obtain the stated uniform error estimate.
Backward Euler is A-stable but not symplectic
Example
Backward Euler on the oscillator , , is A-stable but not symplectic for any . Here A-stable means its scalar stability function has modulus at most one for every with .
Facts & Assumptions
Given: The backward Euler equation , , and the canonical matrix .
A one-step matrix on this scalar test equation has stability function defined by when ; A-stability is the modulus condition in the Example.
In dimension two, , by direct multiplication.
Verification
For , backward Euler gives , so wherever defined. If , then , whence and the method is A-stable.
For the oscillator, , so By [F2], . It is therefore not symplectic.