Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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.

Finite cochain Maxwell phase space

Definition

Fix nonnegative integers n0,n1,n2,n3 and ordered coordinate bases, and put Ck:=Rnk for k=0,1,2,3. The dual space (Ck)∗ is the vector space of linear functionals Ck→R, with the dual basis to the chosen coordinate basis. Let D0∈Rn1×n0, D1∈Rn2×n1, and D2∈Rn3×n2 be linear maps satisfying D1D0=0 and D2D1=0. This data is a finite cochain complex. The transpose DkT denotes the representing matrix of the dual linear map in the dual bases. Let M1∈Rn1×n1 and M2∈Rn2×n2 be symmetric positive-definite matrices: vTMkv>0 for each nonzero v∈Ck. They represent linear maps M1:C1→(C1)∗ and M2:C2→(C2)∗ in the chosen bases; in positive dimensions their inverses exist by the finite-dimensional positive-matrix result cited below, and the unique map on a zero-dimensional space is its own inverse.

The finite state space is X:=C2⊕(C1)∗, with state (b,d), where b is a column of C2 coordinates and d is a column in the dual basis of (C1)∗. In this item, “phase space” means this finite-dimensional state space only; no symplectic form is asserted. On an open interval J⊆R, a semidiscrete trajectory is a continuously differentiable map t↦(b(t),d(t))∈X satisfying

b˙(t)=−D1M1−1d(t),d˙(t)=D1TM2b(t).

Its two discrete constraints are D2b(t)=0 in C3 and D0Td(t)=0 in (C0)∗. The associated quadratic energy is

E(b,d):=12(bTM2b+dTM1−1d).

All objects here are finite-dimensional real linear-algebra data. The term “Maxwell” names this algebraic model and does not identify it with a continuum Maxwell or Einstein–Maxwell solution.

Remarks

For a finite oriented cell complex, signed incidence matrices give one source of such maps: an entry is +1 or −1 according as the oriented lower cell occurs in the oriented boundary with agreeing or opposite orientation, and is 0 when it does not occur. In a simplicial realization, the boundary of an ordered simplex is ∂[v0,…,vk]=∑i=0k(−1)i[v0,…,v^i,…,vk]. Each codimension-two face obtained by deleting vertices i<j occurs in ∂2 twice, with coefficients (−1)i(−1)j−1 and (−1)j(−1)i, which are opposites. Hence ∂2=0; taking transposes of the boundary matrices gives the two zero-composition identities for the cochain maps. This definition also admits any real matrices satisfying the displayed identities. Positive-definite mass maps are additional data and are not determined by incidence alone.

The cochain sequence is displayed below. The arrows are exactly D0,D1,D2 in the ordered coordinate bases; the zero-composition identities are hypotheses of the definition and are not proved by the diagram.

C^0 \arrow[r,"D_0"] & C^1 \arrow[r,"D_1"] & C^2 \arrow[r,"D_2"] & C^3

The incidence identities support exact finite constraint calculations. They do not supply a family of meshes, commuting projections, approximation estimates, uniform energy or CFL bounds, or a continuum-limit theorem. The source’s cochain-sampling and Whitney-form results have those additional geometric and approximation scopes; none is claimed here.

Depends on

Dependency tree · 2 levels

Sources