Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedjudge 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.

Nonzero Postnikov data retain higher gauge volume on a tetrahedron

Example

On the ordered tetrahedron 0<1<2<3, take G=A=Z2 with trivial action and β(g,h,k)=ghk. This is a normalized 3-cocycle of nonzero class. There are 64 background objects, all gauge equivalent. For unit weight the higher sum is 1, with π1≅Z2 and π2≅Z2 at any background. The nonzero Postnikov cocycle is retained in the gauge transformations and their associator.

Facts & Assumptions

Given: the full ordered tetrahedron (including all its faces and edges), the finite data in the Example, and the absolute background gauge 2-groupoid, with all arithmetic modulo 2. No boundary field is held fixed and no relative gauge restriction is imposed.

[F1]

Finite 2-group homotopy gauging and cochain gluing gives Z(2)=∑[x]∣π2(x)∣/∣π1(x)∣=c(K)∑x1, where c(K)=∣A∣V−E/∣G∣V for unit weight. Its proof counts raw parameters; the particular stabilizers and transitivity below are calculated locally using [F2]–[F3].

[F2]

Finite background gauge 2-groupoid gives flat edges aij+ajk=aik and face constraint B123+B023+B013+B012=β(a01,a12,a23). A raw arrow has arbitrary vertex labels gi and edge labels λij, target edges bij=gi+aij+gj, and target faces C=B+ζg(a)+δλ, where ζijkg(a)=β(gi,aij,ajk)+β(bij,gj,ajk)+β(bij,bjk,gk) and (δλ)ijk=λjk+λik+λij. Two arrows with the same g are related by a vertex 2-cochain t exactly when their edge labels differ by (δt)ij=tj+ti; different g have no 2-arrows between them. Composition has edge label λ+μ+τ, with τ(h,g;a)ij=β(hi,gi,aij)+β(hi,bij,gj)+β(cij,hj,gj) for successive edge backgrounds a,b,c. Its associator is the vertex cochain σi=β(ki,hi,gi). The normalized group cocycle and group coboundary conventions are those inherited by this definition from its background-cochain supplier.

[F3]

Coherence and stabilizers of finite background gauge 2-groupoids establishes that these arrows preserve background constraints and form the stated 2-groupoid. It identifies π2(x) with ker⁡(δa:C0→C1) and π1(x) with raw 1-automorphisms modulo the 2-arrows of [F2]. Thus ∣π1(x)∣=∣Sx∣/∣im⁡δa∣, with no quotient of raw parameters by equality of their induced functions on backgrounds.

Verification

1.1givenF2algebra

Normalization is immediate. The cocycle equation expands to hkl−(g+h)kl+g(h+k)l−gh(k+l)+ghk=0 since each monomial occurs twice modulo 2. If β=δc, its values at (0,1,1) and (1,0,1) imply c(0,0)=c(0,1)=c(1,0). Then (δc)(1,1,1)=c(1,0)−c(0,1)=0, contradicting β(1,1,1)=1.

1.2givenF1F2algebra

Set x0=0 and xi=a0i for i>0. Flatness on 0ij gives aij=xi+xj, so flat edges are in bijection with the three unrestricted potentials x1,x2,x3, giving 8 edge backgrounds. For each, the tetrahedron constraint in [F2] uniquely determines one face label from the other three, giving 8 face assignments and 64 objects in total. There are V=4,E=6, so [F1] gives c=24−6/24=1/64 and Z=c⋅64=1.

2.1givenF2F3step 1.2algebra

For any object choose the vertex labels gi=xi from step 1.2 and first take edge parameters zero. The target has bij=0 and face labels C=B+ζg(a). By [F3] it is still a background, hence δC=β(0,0,0)=0. Now take identity vertex labels and set λ0j=0 and λij=C0ij for 0<i<j. Normalization makes this second arrow's ζ zero. On 0ij, (δλ)0ij=C0ij; on 123, (δλ)123=C023+C013+C012=C123 by δC=0. Thus its target faces are C+δλ=0. Every object is therefore equivalent to the zero background.

3.1givenF2F3step 2.1algebra

At the zero background, an automorphism's target edges vanish exactly when all gi equal one constant r∈Z2. Every term of ζ then has a zero argument, so normalization gives ζ=0; the remaining condition is δλ=0. Such edge cocycles have exactly the form λij=yi+yj with y0=0, yi=λ0i, by the triangle equations. Hence there are 8 of them and 16 raw automorphisms. The map t↦δt has kernel the two constant vertex cochains and image precisely these 8 edge cocycles: take ti=yi for surjectivity. Therefore π2≅Z2 under addition. For two raw automorphisms all successive edge backgrounds are zero, so each term of τ also has a zero argument and composition is (r,λ)(s,μ)=(r+s,λ+μ). The 2-arrows quotient the entire edge-cocycle factor, preserving r, so π1≅Z2 as a group, also with order 16/8=2. By the equivalence in step 2.1, these homotopy groups have the stated isomorphism types at every background.

4.1F1F2step 1.1step 1.2step 2.1step 3.1∎

The single component has higher mass 2/2=1 by [F1], agreeing with step 1.2. The nonzero β is still present in the full background and gauge formulas. In particular, for three constant automorphism vertex labels g,h,k at the zero background the associator is the constant vertex 2-cochain σi=khg, nonzero when g=h=k=1. Its coboundary is zero, so it is a retained 2-automorphism, not a discarded parameter. Thus no quotient by induced functions or replacement by a split model has entered the calculation.

Depends on

Dependency tree · 2 levels