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.

A transverse local gauge condition gives a second-class slice

Physical scope

Local slice near a point where the gauge matrix is invertible; no uniqueness for distant orbits.

Statement

Let χ1,…,χr be regular first-class constraints on N as in Regular first-class constraints admit local symplectic reduction, and choose a point z0∈N. Let ϕ1,…,ϕr be smooth functions with ϕb(z0)=0 and suppose Aab={χa,ϕb} is invertible at z0. By continuity, it remains invertible on a neighborhood of z0 in N. Then the combined constraint matrix for (χ,ϕ) is invertible near z0, so the combined surface is second class and carries the Dirac symplectic form. After shrinking the neighborhood, each nearby characteristic leaf intersects the gauge surface in exactly one point within that coordinate neighborhood. This is a local slice assertion only. When r=0 the characteristic leaves are points and the empty gauge condition is immediate; the proof below treats r≥1.

Facts & Assumptions

Given: A regular first-class constraint surface, smooth gauge functions, and an invertible transverse bracket matrix A near the chosen point.

[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]

Regular first-class constraints admit local symplectic reduction: the independent characteristic fields span a smooth rank-r involutive distribution with local leaf coordinates.

[F2]

Second-class constraints and the Dirac bracket: invertible constraint bracket matrix implies an embedded symplectic joint level with Dirac bracket.

[F3]

Choice-free smooth inverse function theorem in Euclidean space: a smooth map between equal-dimensional Euclidean open sets with invertible derivative at a point is a diffeomorphism between suitable neighborhoods.

Proof

1.1givenA1F1algebra

On the common zero set, the combined matrix has block form (BA−ATD), where B={χ,χ}=0 there by first-classness and D={ϕ,ϕ}. If it annihilates (u,v), its first block equation is Av=0, so v=0; its second is −ATu=0, so u=0. Thus it is invertible; continuity preserves invertibility on a smaller neighborhood.

2.1givenF2step 1.1

[F2] applied to the combined list makes its zero surface embedded and symplectic with the displayed Dirac bracket.

2.2givenF1F3step 1.1algebra

In Frobenius coordinates from [F1] around z0, use the local frame Xχa along each leaf. At z0, its derivative on the gauge map has entries Xχa(ϕb)={ϕb,χa}=−Aab, so it is invertible; changing to the s-coordinate frame multiplies by an invertible matrix. For r≥1, [F3] therefore gives a local diffeomorphism of the gauge map along each leaf.

3.1givenF3step 2.2algebra∎

At z0=(s0,y0) the gauge map has value ϕ(z0)=0 by the statement. Consider the equal-dimensional map (s,y)↦(ϕ1(s,y),…,ϕr(s,y),y). Its derivative at z0 is block triangular with invertible diagonal blocks by step 2.2 and the identity on y. Applying [F3] gives a neighborhood on which this map is a diffeomorphism; therefore, for each nearby y, the gauge equations have exactly one local solution s. This proves exactly one intersection within that product neighborhood, with no claim about distant portions of a leaf.

Depends on

Dependency tree · 2 levels

Sources