Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck pendingjudge pass (gpt-6-luna)
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.

Translation action with a unit Faddeev–Popov Jacobian

Example

Take M={⋆} and G=SU(2):={q∈M2(C):q∗q=I2, det⁡q=1} with matrix multiplication and Lie algebra su(2)={Z∈M2(C):Z∗=−Z, tr⁡Z=0}. Its elements are exactly (ab−b‾a‾) with ∣a∣2+∣b∣2=1, giving a diffeomorphism with the unit sphere in C2; matrix multiplication and inversion are smooth. Thus G is a compact noncommutative finite-dimensional real Lie group, as checked in the Verification. Let P=SU(2)→M with right multiplication, H=0, and ωq(V)=q−1V for V∈TqSU(2); this specifies the principal bundle and connection datum. Choose the independent regulator X=R2 with coordinates (u,v) and density du dv, the additive Lie group K=(R,+) with left-invariant density dt, and the smooth right action

(u,v)⋅t=(u+t,v).

Let S={(0,v):v∈R}, choose s0=(0,0)∈S, and set U=X. Let χ(u,v)=u and give S density dv. For every s=(0,v)∈S, the Faddeev–Popov operator is Ms(t)=t, so ΔFP(s)=1. The local orbit-to-slice map is Ψ(t,(0,v))=(t,v), with density Jacobian 1. For x=(a,b), the gauge condition along its orbit is Fx(t)=a+t; it has one transverse zero t0=−a, and the slice meets this orbit once. If Γ⊂R is relatively compact and open with t0∈Γ, and φ∈Cc∞(Γ) has t0∈supp⁡φ, then for every nonnegative compactly supported smooth η of integral 1, the regularized intersection expression tends to φ(t0).

Facts & Assumptions

Given: The countable-choice background, the finite-dimensional gauge-slice definition, and its local Jacobian and intersection theorem.

[A1]

The antecedent non-Abelian bundle datum and regulator conventions are those required in the definition; the regulator group K is independent data and is not identified with the full gauge group. Finite-dimensional gauge slices and Faddeev–Popov operators

[F1]

Finite-dimensional gauge slices and Faddeev–Popov operators: for a smooth right action, Rs=d(αs)e, Ms=dχs∘Rs, and Ms∗λ=ΔFP(s)ν relative to the chosen positive densities.

[F2]

Local Faddeev–Popov slice Jacobian and orbit-intersection count: at a transverse slice point the map Ψ(g,s)=s⋅g is a local diffeomorphism with Jacobian ρX(0,z0)ΔFP(s0)/ρS(z0); for finitely many transverse zeros the regularized integral tends to the sum of the test-function values.

Verification

technique · direct substitution and one-dimensional change of variables
1.1givenA1F1algebra

The set SU(2) is closed and bounded in the finite-dimensional space M2(C), hence compact; the matrices diag⁡(i,−i) and (01−10) lie in SU(2) and do not commute. The projection P→{⋆} with right multiplication is a smooth principal bundle, VP=TP, and H=0 is a smooth right-invariant complement. For Z∈su(2), the defining one-parameter subgroup t↦exp⁡G(tZ) has initial velocity Z, so differentiating qexp⁡G(tZ) gives the fundamental vector ZP(q)=qZ and ωq(ZP(q))=Z; also ker⁡ω=0=H and ωqh(Vh)=h−1ωq(V)h. Thus ω is a principal connection. The specified s0 and U satisfy the slice-data requirement. The regulator group is independent of the ambient full gauge group, as required by the Definition. Translation is a smooth right action because ((u,v)⋅t)⋅h=(u+t+h,v)=(u,v)⋅(t+h). The zero set of χ is exactly S, and dχ(0,v)(δu,δv)=δu has kernel T(0,v)S={(0,δv)}.

1.2givenF1algebra

The orbit derivative sends c∈T0R≅R to (c,0); composing with dχ gives Ms(c)=c. Since dt and du have unit coefficients in these coordinates, ΔFP(s)=∣det⁡(1)∣=1. Also Ψ(t,(0,v))=(t,v) preserves the product coordinate density, so JΨ=1.

2.1givenF1step 1.2algebra

For x=(a,b), Fx(t)=a+t, hence its unique zero is t0=−a, and x⋅t0=(0,b)∈S. This is a transverse intersection because the operator there is the isomorphism c↦c; no second group parameter produces the same point on this orbit.

3.1givenF1F2step 1.2step 2.1algebra∎

Extend φ by zero outside Γ; this is smooth because φ has compact support in Γ. In the regularized expression, substitute y=a+t. Since t0∈Γ, we have 0=a+t0∈a+Γ, so for all sufficiently small ϵ the support of ηϵ lies in a+Γ and change of variables gives ∫Γφ(t)ηϵ(a+t) dt=∫Rφ(y−a)ηϵ(y) dy. The last integral differs from φ(−a) by at most sup⁡∣y∣≤Cϵ∣φ(y−a)−φ(−a)∣∫ηϵ(y) dy, where C bounds the support of η. This tends to zero by continuity and normalization. Since ΔFP=1, the required limit is φ(t0), as asserted.

Remarks

This is a finite-dimensional coordinate calculation. It supplies no functional determinant or continuum path-integral measure.

Depends on

Dependency tree · 2 levels

Sources