Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedPipeline-generatedprecheck passverified 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.

Holonomy and discrete geometric interfaces — antisymmetric invariant tensor at a bivalent SU(2) vertex

Statement

Assume the full Axiom of Choice. Take the graph with three distinct vertices u1,u2,v, edges a1:u1→v, a2:u2→v and their reverses aˉ1,aˉ2, and no other edges. Order the edges as a1<a2<aˉ1<aˉ2 and fix any vertex order. Assign the defining representation ρ(g)w:=gw on V=C2, with its standard inner product, to a1,a2; assign the trivial representation on C to each reverse edge. Thus ρaˉj(g)z=z for every g∈SU(2) and z∈C; the Haar projection's hypotheses impose no relation between representations assigned to reverse orientations.

The full vertex space is Wv=V⊗V⊗C∗⊗C∗. Write 1∗(z)=z and identify V⊗V with Wv by the linear isomorphism ι(ξ)=ξ⊗1∗⊗1∗. For any basis e1,e2 of V, the nonzero tensor

ϵ=e1⊗e2−e2⊗e1

is invariant under ρ(g)⊗ρ(g). Consequently the normalized Haar projection Pv:Wv→Wv fixes ι(ϵ); equivalently, ι−1Pvι(ϵ)=ϵ.

Facts & Assumptions

Given: Full AC, the specified four oriented edges and their representations, the vertex space Wv, the map ι, and a basis e1,e2 of V.

[F1]

Finite graph vertex Haar averaging is an orthogonal projection: under full AC, the normalized Haar average projects onto vertex-invariant tensors.

[F2]

Finite SU(2) graph holonomy model: the graph includes both edge orientations, and a finite-dimensional unitary representation is a strongly continuous group homomorphism into the unitary operators. The complete vertex factor formula is supplied by [F1].

[F3]

The Axiom of Choice: full AC is the set-theoretic assumption inherited by the averaging supplier.

Proof

technique · direct determinant calculation
1.1givenF1F2algebra

The defining action is a group homomorphism, preserves the standard inner product because g†g=I2, and is strongly continuous because its matrix entries are continuous. The trivial reverse-edge actions have these properties as well. By [F1], their dual factors at v are trivial one-dimensional spaces, so the displayed Wv and ι are well-defined and Rv(g)ι=ι(ρ(g)⊗ρ(g)). For g∈SU(2), write the matrix of ρ(g) in the chosen basis as (abcd); its determinant is det⁡g=1. Expanding the tensor product gives (g⊗g)ϵ=(ae1+ce2)⊗(be1+de2)−(be1+de2)⊗(ae1+ce2)=(ad−bc)ϵ=(det⁡g)ϵ=ϵ. The tensor is nonzero because e1⊗e2 and e2⊗e1 are distinct basis tensors.

2.1givenF1F3step 1.1algebra∎

By [F1], Pvι(ϵ)=∫SU(2)Rv(g)ι(ϵ) dμ(g). Step 1.1 makes the integrand the constant vector ι(ϵ), and the normalized Haar probability has total mass one; hence the integral equals ι(ϵ). Applying ι−1 gives the equivalent asserted formula.

Remarks

V¬VV¬VWvWv½(g)¬½(g)Rv(g)

The diagram records the full vertex action under the specified trivial reverse-edge factors; the determinant computation proves invariance independently of the diagram.

Depends on

Dependency tree · 2 levels

Sources