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
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- 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
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite generator master equations and uniformization
- Foundations of the Real Numbers for Analysis
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- 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
- Matrix Norms, Condition Numbers and Numerical Stability
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- 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
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Splitting Fields
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
3 · Logical flowchart
4 · Definitions, postulates, theorems and proofs
Finite compatible matrix system
Pure mathematics; no physical premise.
Definition
Let be nonnegative integers. For dimension zero, has its single empty vector and its unique square matrix acts as the identity on that space. Choose real matrices and that are symmetric positive definite, meaning , , for every nonzero , and for every nonzero ; these positivity conditions are vacuous on . Choose , a symmetric positive semidefinite , meaning and for every , and matrices and satisfying and . These are finite real matrix data; no mesh or continuum field is assumed.
Let be an open interval, let be continuous, and let candidate states and be of class . The finite compatible matrix system is
Its quadratic energy is . Its magnetic constraint is the vector . For the chosen , its weak-divergence coordinate is . The term “weak-divergence” names this finite-dimensional quantity only. If the columns of form a basis of , then exactly when .
Definition references
Facts & Assumptions
Given: The finite real matrices and the interval and maps specified in the Definition; for the final characterization, assume additionally that .
Every subspace of a finite-dimensional real inner-product space satisfies (For a subspace of a finite-dimensional inner product space, ).
Proof
In positive dimension, if , then , so positive definiteness gives ; the same argument applies to . 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.
For and , , hence . Also exactly when for every , which is exactly ; therefore . By [F1], decompose any as with and . Both and are orthogonal to , so and . Hence .
Assume . If , then , so is orthogonal to every column of and hence to . By step 1.2, .
Conversely, if , then step 1.2 gives . Every column of lies in , so and therefore . The two implications prove the stated characterization.
Energy, existence and algebraic constraints
Pure mathematics; no physical premise.
Statement
For the finite compatible matrix system on an open interval , let , choose initial data and , and assume the forcing is continuous. There is a unique solution on all of . At every it satisfies
Statement references
Facts & Assumptions
Given: The finite compatible matrix system of Finite compatible matrix system, an open interval , a point , initial vectors , and continuous forcing .
The system matrices have the stated sizes, are symmetric positive definite, is symmetric positive semidefinite, and (Finite compatible matrix system).
For a finite real square matrix , is differentiable with derivative , and when and commute (Finite matrix exponential series and its identities).
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 is Riemann integrable).
For a nondegenerate interval , covering by itself gives outer Jordan content at most and inscribing itself gives inner content at least ; since inner content is at most outer content, is Jordan measurable (Jordan inner and outer content and Jordan measurable bounded sets in , Axis-parallel rectangles in and their volume). The Riemann integral over a bounded Jordan measurable set is the integral of its zero extension over a bounding rectangle; taking gives the rectangular integral used below (The Riemann integral of a bounded function over a bounded Jordan measurable set).
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 whose derivative vanishes at every interior point of is constant on ; consequently two such functions with the same derivative differ by a constant).
If is a nondegenerate closed interval and is continuous, then [F3] makes Riemann integrable and, taking and , Linearity, monotonicity, the absolute-value estimate and coordinate-slice additivity for the Riemann integral in gives linearity, monotonicity, integrability of , , and additivity across any cut strictly inside . By [F4], the Jordan-set integral over is this rectangular integral.
For every constant , each lower and upper Darboux sum on equals : on each cell its infimum and supremum are , the cell volumes sum to , and for . Thus by Lower and upper Darboux sums over a grid partition in , Grid partitions of a rectangle in , their cells, refinements and mesh, Axis-parallel rectangles in and their volume, and The lower and upper Darboux integrals over a nondegenerate rectangle in .
Proof
Put and define and . The inverses exist by positive definiteness in [F1]: if , then forces , and an injective square map in finite dimensions is invertible; the same holds for . Thus the system is exactly .
Let and , interpreting each coordinate as a Riemann integral and using the oriented convention when and . If , then and are the unique empty vector for all , so vacuously. Otherwise, on every nondegenerate compact segment in , each coordinate of is continuous, so [F3] gives integrability and [F4] defines . For each coordinate , the cut-additivity in [F6], together with the oriented convention, gives whenever : 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 , , where [F7] evaluates the integral of the constant . Given , continuity of at gives such that whenever ; since is open, reduce so . If , then on the absolute-value estimate and monotonicity in [F6], followed by [F7], give . Therefore each coordinate has derivative and throughout .
Define , where . By [F2] and step 1.2, the product rule gives , since by the commuting-product identity in [F2]; also . Thus a solution exists on all of . If , every state is the unique empty vector, so the solution is unique. Otherwise, if is another solution with the same initial value, then has derivative zero by [F2] and the two differential equations. Each coordinate of is constant by [F5] and vanishes at , so .
Differentiate and substitute the system equations. Symmetry of gives , because the real scalar cross terms and are equal and cancel.
The magnetic quantity satisfies by [F1]; each coordinate is constant by [F5], and its value at is .
Since , differentiation and the first system equation give , using from [F1]. This proves all three identities.
Staggered compatible leapfrog
Pure mathematics; no physical premise.
Definition
Inputs are real matrices and that are symmetric positive definite, , and compatible matrices satisfying , with and in the finite compatible matrix system. All dimensions are nonnegative integers as in that system. Also input a real step size , an integer horizon , and initial vectors and . The matrix is positive definite, so each mass equation below has a unique exact solution, including the unique empty solve when . For each integer , first set
then solve uniquely for in
and set . Output the electric vectors and magnetic vectors . When , 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 and . The horizontal coordinate in the diagram is the normalized time . Electric vectors are stored at integer indices and magnetic vectors at half-integer indices. At each loop index, the algorithm computes from and the previous magnetic vector, then computes from that new magnetic vector. The diagram records this indexing convention only; no proof uses it.
CFL energy stability and finite termination
Pure mathematics; no physical premise.
Statement
For the matrices and algorithm of the finite compatible matrix system, set . If , define ; if , define , where . For a zero-dimensional symmetric positive-definite matrix, define its square root and inverse square root to be its unique matrix. For a positive-dimensional real symmetric positive-definite matrix , define by applying the positive scalar square root to its eigenvalues in an orthonormal eigenbasis, and define . Call the strict CFL condition for this finite matrix system. With and , define
For every , the algorithm terminates after updates. If , then each step preserves , and
Consequently this modified energy is positive definite under the strict CFL condition. The constraint is preserved. If , set . There are unit vectors and with and . For a normalized state with and , one update sends the coefficient vector by
The matrix has a real eigenvalue with . Starting from a nonzero coefficient eigenvector, the Euclidean norm of the corresponding normalized state is multiplied by at each update. Equality at is excluded from both assertions; no stability claim is made there.
Statement references
Facts & Assumptions
Given: The finite compatible matrix system with , , symmetric positive definite, , nonnegative state dimensions as in its definition, and a step size and finite horizon for the staggered leapfrog algorithm.
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).
Every linear map between finite-dimensional real or complex inner-product spaces has orthonormal right and left singular bases and singular values (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).
For a map between finite-dimensional inner-product spaces, its operator norm is the maximum of 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||).
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).
In a real or complex inner-product space, (Cauchy–Schwarz: , with equality exactly for linearly dependent vectors).
The matrices are symmetric positive definite and (Finite compatible matrix system).
The algorithm's exact updates are and (Staggered compatible leapfrog).
Proof
For a zero-dimensional mass space, the unique square matrix is the identity, its own inverse, and its root. In positive dimension, and are symmetric and therefore self-adjoint in the standard Euclidean inner product; by [F1] each has an orthonormal eigenbasis. If is a unit eigenvector of either matrix with eigenvalue , positive definiteness in [F6] gives . Define the square root to act by on the full -eigenspace, and its inverse to act by there. These definitions are independent of a basis choice within an eigenspace, satisfy and , and agree with the Statement's root convention.
Let and . Multiplying the first update in [F7] by gives . Multiplying the second update by and using the root identities from step 1.1 gives .
Write , , , and . From step 2.1, and . Expanding gives , , and .
Suppose . By the zero-domain clause of [F3], the domain is nonzero; [F2]–[F4] then give unit vectors for , with and . The recurrence in step 2.1 sends states , to states of the same form, with coefficient matrix . Its trace is and determinant is , so its characteristic polynomial has two distinct real negative reciprocal roots, one with modulus greater than . A nonzero eigenvector for that root therefore has its coefficient norm multiplied by a factor greater than at every update, proving the supercritical growth claim.
Adding the identities in step 3.1 cancels the terms; substituting in the remainder gives . Therefore at each update.
By [F5] and [F3]–[F4], . Since , the cross term in has absolute value at most . Substitution gives both displayed energy bounds, whose lower coefficient is strictly positive when .
For every update, [F7] and [F6] give , so induction preserves . The loop in [F7] has exactly the finite index set ; each exact mass solve is unique by [F6] and step 1.1. It therefore terminates after updates, including the case .
5 · Examples, experiments and counterexamples
None yet.