Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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.

Second-class constraints and the Dirac bracket

Physical scope

Local result on an open neighborhood where the constraint bracket matrix is invertible.

Statement

Let (P,ω) be symplectic and let χ1,…,χ2k be smooth on an open set U, with Cab={χa,χb} invertible at every point of U. Write Cab for its inverse and N={χ=0}∩U. Then N is an embedded symplectic submanifold, and the bracket

{F,G}D={F,G}−{F,χa}Cab{χb,G}

is the Poisson bracket of the restricted symplectic form on N. It is independent of ambient extensions of F,G, and every χa is a Casimir. This is local and assumes invertibility on U; it does not cover singular points.

Facts & Assumptions

Given: A symplectic manifold, an even family of smooth constraints, and an everywhere invertible bracket matrix on U.

[A1]

The Axiom of Countable Choice (ACω): Assume countable choice ACω, meaning every sequence of nonempty sets has a choice function; no full Axiom of Choice is assumed.

[F1]

Symplectic form and symplectic manifold: ω is smooth, closed and nondegenerate. The convention of Poisson bracket on a symplectic manifold is ιXFω=dF and {F,G}=dF(XG). Inverting the smooth nonsingular local matrix of ω gives a unique smooth XF.

[F2]

Smooth functions form a Poisson algebra: the ambient bracket is Poisson.

[F3]

A regular level set is an embedded submanifold: independent differentials at a level yield an embedded level and the stated tangent kernel.

[F4]

Regular primary constraints and total generator: regularity means independence of the constraint differentials at their common zero level, and weak equality is equality after restriction to that level. This mathematical result imposes no physical unit assignment.

Proof

1.1givenA1F1F3F4algebra

If ∑aλadχa=0, evaluate on each Xχb. This gives ∑aλaCab=0 for every b, so invertibility implies λ=0. The differentials are independent throughout U; [F3] makes each nonempty joint level embedded with tangent space TN=∩aker⁡dχa. If N=∅, its unique empty smooth structure and restricted form satisfy the embedding and symplectic conditions vacuously.

2.1givenF1F2step 1.1algebra

For any F, set XFD=XF−XχaCab{χb,F}. Then dχc(XFD)={χc,F}−CcaCab{χb,F}=0, so it is tangent to N. For tangent v, ω(XFD,v)=dF(v), because dχa(v)=0.

3.1givenF1step 1.1step 2.1algebra

A vector tangent to N in the radical of ω∣N lies in (TN)ω, which is spanned by the independent Xχa because the annihilator of TN is spanned by independent dχa and ω♭ is an isomorphism. Tangency of a linear combination of these fields gives a coefficient vector annihilated by C, hence zero. Thus ω∣N is nondegenerate; it is closed by pullback of dω=0.

4.1givenF1F2step 2.1step 3.1algebra∎

Contracting the tangent field XFD with (dG) gives XFD(G)={G,F}−{G,χa}Cab{χb,F}={G,F}D with the declared convention after skewness and Cab=−Cba. Since XFD is exactly the Hamiltonian field on N proved in step 2.1, the bracket is the induced symplectic Poisson bracket and obeys Jacobi by [F2] applied to the symplectic N. If an extension vanishes on N, its tangent differential vanishes, so its restricted Hamiltonian field and bracket vanish; this proves extension independence. Substitution of F=χc in the formula gives zero by CC−1=I, so constraints are Casimirs.

Depends on

Dependency tree · 2 levels

Sources