Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

First-class closure for a regular constraint family

Definition

Assume ACω as in Regular primary constraints and total generator. Let (P,ω) be a smooth symplectic manifold. For every smooth real function F on an open set U⊆P, define its Hamiltonian vector field XF by ωz(XF(z),v)=dFz(v) for every z∈U and v∈TzP, and define {F,G}:=dF(XG). Nondegeneracy of ω makes XF unique; in local coordinates its coefficients are obtained by inverting the smooth nonsingular matrix of ω, so XF and the bracket are smooth. Let χ1,…,χr∈C∞(U,R) be a regular constraint family on the common zero surface N={z∈U:χa(z)=0 for all a} as defined by Regular primary constraints and total generator: the differentials dχa are linearly independent at every point of N. The family is first-class on N when

{χa,χb}(z)=0for every z∈N and all a,b.

Equivalently, each pairwise bracket is weakly zero in the notation F≈0 of Regular primary constraints and total generator. On a canonical cotangent phase space this intrinsic convention agrees with Canonical Poisson brackets and local Hamiltonian flow: {F,G}=FqiGpi−FpiGqi. This definition is a pointwise closure condition on the stated regular surface; it does not assert multiplier-algorithm termination or global quotient regularity.

Depends on

Dependency tree · 2 levels

Sources