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.

Compatible matrix evolution and time stepping

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

DefinitionDefinition: AI-adaptedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Finite compatible matrix system

Physical scope

Pure mathematics; no physical premise.

Definition

Let ne,nb,nc,ng be nonnegative integers. For dimension zero, R0 has its single empty vector and its unique square matrix acts as the identity on that space. Choose real matrices Me∈Rne×ne and Mb∈Rnb×nb that are symmetric positive definite, meaning MeT=Me, MbT=Mb, xTMex>0 for every nonzero x∈Rne, and yTMby>0 for every nonzero y∈Rnb; these positivity conditions are vacuous on R0. Choose C∈Rnb×ne, a symmetric positive semidefinite S∈Rne×ne, meaning ST=S and xTSx≥0 for every x∈Rne, and matrices D∈Rnc×nb and G∈Rne×ng satisfying DC=0 and CG=0. These are finite real matrix data; no mesh or continuum field is assumed.

Let I⊆R be an open interval, let j:I→Rne be continuous, and let candidate states e:I→Rne and b:I→Rnb be of class C1. The finite compatible matrix system is

Mee˙(t)=CTMbb(t)−Se(t)−j(t),b˙(t)=−Ce(t)(t∈I).

Its quadratic energy is W(e,b):=12(eTMee+bTMbb). Its magnetic constraint is the vector Db∈Rnc. For the chosen G, its weak-divergence coordinate is q:=−GTMee∈Rng. The term “weak-divergence” names this finite-dimensional quantity only. If the columns of G form a basis of ker⁡C:={v∈Rne:Cv=0}, then q=0 exactly when Mee∈im⁡CT:={CTu:u∈Rnb}.

Facts & Assumptions

Given: The finite real matrices and the interval and maps specified in the Definition; for the final characterization, assume additionally that im⁡G=ker⁡C.

[F1]

Every subspace U of a finite-dimensional real inner-product space V satisfies V=U⊕U⊥ (For a subspace W of a finite-dimensional inner product space, V=W⊕W⊥).

Proof

1.1givenalgebra

In positive dimension, if Mex=0, then xTMex=0, so positive definiteness gives x=0; the same argument applies to Mb. In dimension zero the unique square matrix is the identity map on the singleton space and is invertible. Thus both matrices are injective and hence invertible in their finite-dimensional domains, so their inverse operations used by consumers are defined in every allowed dimension.

1.2givenF1algebra

For u∈Rnb and v∈ker⁡C, ⟨CTu,v⟩=uTCv=0, hence im⁡CT⊆(ker⁡C)⊥. Also z∈(im⁡CT)⊥ exactly when uTCz=0 for every u∈Rnb, which is exactly Cz=0; therefore (im⁡CT)⊥=ker⁡C. By [F1], decompose any w∈(ker⁡C)⊥ as w=u+v with u∈im⁡CT and v∈(im⁡CT)⊥=ker⁡C. Both w and u are orthogonal to v, so ∥v∥2=⟨w−u,v⟩=0 and v=0. Hence (ker⁡C)⊥=im⁡CT.

2.1givenstep 1.2algebra

Assume im⁡G=ker⁡C. If q=0, then GTMee=0, so Mee is orthogonal to every column of G and hence to ker⁡C. By step 1.2, Mee∈im⁡CT.

3.1givenstep 1.2algebra∎

Conversely, if Mee∈im⁡CT, then step 1.2 gives Mee∈(ker⁡C)⊥. Every column of G lies in ker⁡C, so GTMee=0 and therefore q=0. The two implications prove the stated characterization.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Energy, existence and algebraic constraints

Physical scope

Pure mathematics; no physical premise.

Statement

For the finite compatible matrix system on an open interval I⊆R, let t0∈I, choose initial data e(t0)=e0 and b(t0)=b0, and assume the forcing j:I→Rne is continuous. There is a unique C1 solution (e,b) on all of I. At every t∈I it satisfies

ddtW(e(t),b(t))=−e(t)TSe(t)−e(t)Tj(t),Db(t)=Db(t0),q˙(t)=GT(Se(t)+j(t)).

Facts & Assumptions

Given: The finite compatible matrix system of Finite compatible matrix system, an open interval I, a point t0∈I, initial vectors e0,b0, and continuous forcing j.

[F1]

The system matrices have the stated sizes, Me,Mb are symmetric positive definite, S is symmetric positive semidefinite, and DC=CG=0 (Finite compatible matrix system).

[F2]

For a finite real square matrix A, etA is differentiable with derivative AetA=etAA, and eAeB=eA+B when A and B commute (Finite matrix exponential series and its identities).

[F3]

A continuous real function on a closed nondegenerate interval is Riemann integrable; apply this coordinatewise to continuous finite-dimensional vector functions (Every continuous function on a closed nondegenerate rectangle in Rm is Riemann integrable).

[F4]

For a nondegenerate interval J=[a,b], covering J by itself gives outer Jordan content at most vol⁡(J) and inscribing J itself gives inner content at least vol⁡(J); since inner content is at most outer content, J is Jordan measurable (Jordan inner and outer content and Jordan measurable bounded sets in Rm, Axis-parallel rectangles in Rm and their volume). The Riemann integral over a bounded Jordan measurable set is the integral of its zero extension over a bounding rectangle; taking E=Q=J gives the rectangular integral used below (The Riemann integral of a bounded function over a bounded Jordan measurable set).

[F5]

A function continuous on an interval and differentiable with zero derivative at every interior point is constant on that interval (A function continuous on an interval I whose derivative vanishes at every interior point of I is constant on I; consequently two such functions with the same derivative differ by a constant).

[F6]

If J=[a,b] is a nondegenerate closed interval and ϕ:J→R is continuous, then [F3] makes ϕ Riemann integrable and, taking m=1 and Q=J, Linearity, monotonicity, the absolute-value estimate and coordinate-slice additivity for the Riemann integral in Rm gives linearity, monotonicity, integrability of ∣ϕ∣, ∣∫Jϕ∣≤∫J∣ϕ∣, and additivity across any cut strictly inside J. By [F4], the Jordan-set integral over J is this rectangular integral.

[F7]

For every constant c∈R, each lower and upper Darboux sum on J=[a,b] equals c(b−a): on each cell its infimum and supremum are c, the cell volumes sum to vol⁡(J), and vol⁡(J)=b−a for m=1. Thus ∫Jc=c(b−a) by Lower and upper Darboux sums over a grid partition in Rm, Grid partitions of a rectangle in Rm, their cells, refinements and mesh, Axis-parallel rectangles in Rm and their volume, and The lower and upper Darboux integrals over a nondegenerate rectangle in Rm.

Proof

1.1givenF1algebra

Put z=(e,b)∈Rne+nb and define A:=(−Me−1SMe−1CTMb−C0) and f(t):=(−Me−1j(t)0). The inverses exist by positive definiteness in [F1]: if Mex=0, then xTMex=0 forces x=0, and an injective square map in finite dimensions is invertible; the same holds for Mb. Thus the system is exactly z′=Az+f(t).

1.2givenF3F4F6F7algebra

Let g(s):=e−(s−t0)Af(s) and H(t):=∫t0tg(s) ds, interpreting each coordinate as a Riemann integral and using the oriented convention ∫ab=−∫ba when b<a and ∫aa=0. If ne+nb=0, then g(s) and H(t) are the unique empty vector for all s,t, so H′=g vacuously. Otherwise, on every nondegenerate compact segment in I, each coordinate of g is continuous, so [F3] gives integrability and [F4] defines H. For each coordinate k, the cut-additivity in [F6], together with the oriented convention, gives Hk(t+h)−Hk(t)=∫tt+hgk(s) ds whenever t,t+h∈I: positive-oriented additivity follows by splitting at an interior point, and reversing endpoints or using a zero-length interval gives the other endpoint orders. Thus, for h≠0, Hk(t+h)−Hk(t)h−gk(t)=1h∫tt+h(gk(s)−gk(t)) ds, where [F7] evaluates the integral of the constant gk(t). Given ε>0, continuity of gk at t gives δ>0 such that ∣gk(s)−gk(t)∣<ε whenever ∣s−t∣<δ; since I is open, reduce δ so [t−δ,t+δ]⊂I. If 0<∣h∣<δ, then on J=[min⁡(t,t+h),max⁡(t,t+h)] the absolute-value estimate and monotonicity in [F6], followed by [F7], give ∣1h∫tt+h(gk(s)−gk(t)) ds∣≤1∣h∣∫J∣gk(s)−gk(t)∣ ds≤ε. Therefore each coordinate has derivative gk(t) and H′(t)=g(t) throughout I.

2.1givenF2F5step 1.2algebra

Define z(t):=e(t−t0)A(z0+H(t)), where z0=(e0,b0). By [F2] and step 1.2, the product rule gives z′=Az+f(t), since e(t−t0)Ae−(t−t0)A=I by the commuting-product identity in [F2]; also z(t0)=z0. Thus a C1 solution exists on all of I. If ne+nb=0, every state is the unique empty vector, so the solution is unique. Otherwise, if z~ is another solution with the same initial value, then ξ(t):=e−(t−t0)A(z~(t)−z(t)) has derivative zero by [F2] and the two differential equations. Each coordinate of ξ is constant by [F5] and vanishes at t0, so z~=z.

3.1givenF1step 2.1algebra

Differentiate W=12(eTMee+bTMbb) and substitute the system equations. Symmetry of Me,Mb gives W˙=eT(CTMbb−Se−j)+bTMb(−Ce)=−eTSe−eTj, because the real scalar cross terms eTCTMbb and bTMbCe are equal and cancel.

3.2givenF1F5step 2.1algebra

The magnetic quantity satisfies (Db)′=Db˙=−DCe=0 by [F1]; each coordinate is constant by [F5], and its value at t0 is Db(t0).

4.1givenF1step 2.1algebra∎

Since q=−GTMee, differentiation and the first system equation give q˙=−GT(CTMbb−Se−j)=−(CG)TMbb+GT(Se+j)=GT(Se+j), using CG=0 from [F1]. This proves all three identities.

AlgorithmAlgorithm: AI-adaptedProof: Not applicableprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Staggered compatible leapfrog

Physical scope

Pure mathematics; no physical premise.

Definition

Inputs are real matrices Me∈Rne×ne and Mb∈Rnb×nb that are symmetric positive definite, C∈Rnb×ne, and compatible matrices D,G satisfying DC=CG=0, with S=0 and j≡0 in the finite compatible matrix system. All dimensions are nonnegative integers as in that system. Also input a real step size h>0, an integer horizon N≥0, and initial vectors e0∈Rne and b−1/2∈Rnb. The matrix Me is positive definite, so each mass equation below has a unique exact solution, including the unique empty solve when ne=0. For each integer n=0,1,…,N−1, first set

bn+1/2:=bn−1/2−hCen,

then solve uniquely for vn∈Rne in

Mevn=CTMbbn+1/2

and set en+1:=en+hvn. Output the electric vectors e0,e1,…,eN and magnetic vectors b−1/2,b1/2,…,bN−1/2. When N=0, the loop makes no updates and the output consists only of the two initial vectors. Every mass solve is exact; no inexact-solve error model is part of this procedure.

Definition references

Remarks

Set tn=nh and tn+1/2=(n+1/2)h. The horizontal coordinate in the diagram is the normalized time t/h. Electric vectors are stored at integer indices and magnetic vectors at half-integer indices. At each loop index, the algorithm computes bn+1/2 from en and the previous magnetic vector, then computes en+1 from that new magnetic vector. The diagram records this indexing convention only; no proof uses it.

t=helectricmagnetice0e1e2b¡1=2b1=2b3=2
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

CFL energy stability and finite termination

Physical scope

Pure mathematics; no physical premise.

Statement

For the matrices and algorithm of the finite compatible matrix system, set K:=Mb1/2CMe−1/2:Rne→Rnb. If ne=0, define ∥K∥2:=0; if ne>0, define ∥K∥2:=max⁡∥x∥2=1∥Kx∥2, where ∥x∥2:=(xTx)1/2. For a zero-dimensional symmetric positive-definite matrix, define its square root and inverse square root to be its unique 0×0 matrix. For a positive-dimensional real symmetric positive-definite matrix M, define M1/2 by applying the positive scalar square root to its eigenvalues in an orthonormal eigenbasis, and define M−1/2:=(M1/2)−1. Call h∥K∥2<2 the strict CFL condition for this finite matrix system. With xn:=Me1/2en and yn−1/2:=Mb1/2bn−1/2, define

Eh(xn,yn−1/2):=12(∥xn∥22+∥yn−1/2∥22−hyn−1/2TKxn).

For every N≥0, the algorithm terminates after N updates. If h∥K∥2<2, then each step preserves Eh, and

1−h∥K∥2/22(∥xn∥22+∥yn−1/2∥22)≤Eh(xn,yn−1/2)≤1+h∥K∥2/22(∥xn∥22+∥yn−1/2∥22).

Consequently this modified energy is positive definite under the strict CFL condition. The constraint Dbn−1/2 is preserved. If h∥K∥2>2, set σ:=∥K∥2. There are unit vectors v∈Rne and u∈Rnb with Kv=σu and KTu=σv. For a normalized state with xn=av and yn−1/2=bu, one update sends the coefficient vector by

(ab)⟼Tσ(ab),Tσ:=(1−h2σ2hσ−hσ1).

The matrix Tσ has a real eigenvalue λ with ∣λ∣>1. Starting from a nonzero coefficient eigenvector, the Euclidean norm of the corresponding normalized state is multiplied by ∣λ∣ at each update. Equality at h∥K∥2=2 is excluded from both assertions; no stability claim is made there.

Facts & Assumptions

Given: The finite compatible matrix system with S=0, j=0, Me,Mb symmetric positive definite, DC=0, nonnegative state dimensions as in its definition, and a step size h>0 and finite horizon N≥0 for the staggered leapfrog algorithm.

[F1]

Every self-adjoint endomorphism of a finite-dimensional real inner-product space has an orthonormal eigenbasis (Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis).

[F2]

Every linear map T:V→W between finite-dimensional real or complex inner-product spaces has orthonormal right and left singular bases and singular values s1≥⋯≥sr>0 (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).

[F3]

For a map between finite-dimensional inner-product spaces, its operator norm is the maximum of ∥Tv∥ over unit vectors, with norm zero on the zero domain (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).

[F4]

On a nonzero finite-dimensional domain, the operator norm equals the largest singular value and is attained at a right singular vector (The operator norm is 0 on the zero domain and otherwise equals the largest singular value, attained at a right-singular vector).

[F5]

In a real or complex inner-product space, ∣⟨u,v⟩∣≤∥u∥∥v∥ (Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors).

[F6]

The matrices Me,Mb are symmetric positive definite and DC=CG=0 (Finite compatible matrix system).

[F7]

The algorithm's exact updates are bn+1/2=bn−1/2−hCen and en+1=en+hMe−1CTMbbn+1/2 (Staggered compatible leapfrog).

Proof

1.1givenF1F6algebra

For a zero-dimensional mass space, the unique square matrix is the identity, its own inverse, and its root. In positive dimension, Me and Mb are symmetric and therefore self-adjoint in the standard Euclidean inner product; by [F1] each has an orthonormal eigenbasis. If v is a unit eigenvector of either matrix with eigenvalue λ, positive definiteness in [F6] gives λ=vTMv>0. Define the square root to act by λ on the full λ-eigenspace, and its inverse to act by 1/λ there. These definitions are independent of a basis choice within an eigenspace, satisfy (M1/2)2=M and M−1/2M1/2=I, and agree with the Statement's root convention.

2.1givenF7step 1.1algebra

Let xn=Me1/2en and yn−1/2=Mb1/2bn−1/2. Multiplying the first update in [F7] by Mb1/2 gives yn+1/2=yn−1/2−hKxn. Multiplying the second update by Me1/2 and using the root identities from step 1.1 gives xn+1=xn+hKTyn+1/2.

3.1step 2.1algebra

Write x=xn, y=yn−1/2, y′=yn+1/2, and x′=xn+1. From step 2.1, x′=x+hKTy′ and y′=y−hKx. Expanding gives ∥x′∥22=∥x∥22+2h(y′)TKx+h2∥KTy′∥22, ∥y′∥22=∥y∥22−2hyTKx+h2∥Kx∥22, and −h(y′)TKx′=−h(y′)TKx−h2∥KTy′∥22.

3.2givenF2F3F4step 2.1algebra

Suppose h∥K∥2>2. By the zero-domain clause of [F3], the domain is nonzero; [F2]–[F4] then give unit vectors v,u for σ=∥K∥2, with Kv=σu and KTu=σv. The recurrence in step 2.1 sends states x=av, y=bu to states of the same form, with coefficient matrix Tσ:=(1−h2σ2hσ−hσ1). Its trace is 2−h2σ2<−2 and determinant is 1, so its characteristic polynomial has two distinct real negative reciprocal roots, one with modulus greater than 1. A nonzero eigenvector for that root therefore has its coefficient norm multiplied by a factor greater than 1 at every update, proving the supercritical growth claim.

4.1step 3.1algebra

Adding the identities in step 3.1 cancels the ∥KTy′∥22 terms; substituting y′=y−hKx in the remainder gives ∥x′∥22+∥y′∥22−h(y′)TKx′=∥x∥22+∥y∥22−hyTKx. Therefore Eh(x′,y′)=Eh(x,y) at each update.

4.2givenF3F4F5step 3.1algebra

By [F5] and [F3]–[F4], ∣yTKx∣≤∥y∥2∥Kx∥2≤∥K∥2∥x∥2∥y∥2. Since 2∥x∥2∥y∥2≤∥x∥22+∥y∥22, the cross term in Eh has absolute value at most 12h∥K∥2(∥x∥22+∥y∥22). Substitution gives both displayed energy bounds, whose lower coefficient is strictly positive when h∥K∥2<2.

5.1givenF6F7step 1.1algebra∎

For every update, [F7] and [F6] give Dbn+1/2=Dbn−1/2−hDCen=Dbn−1/2, so induction preserves Db. The loop in [F7] has exactly the finite index set 0,…,N−1; each exact mass solve is unique by [F6] and step 1.1. It therefore terminates after N updates, including the case N=0.

5 · Examples, experiments and counterexamples

None yet.

Sources