Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

Finite 2-group homotopy gauging and cochain gluing

Statement

Fix a finite group G, finite abelian group A, action ρ, normalized 3-cocycle β, and a finite ordered simplicial complex K. Let B(K) be the full background gauge 2-groupoid, retaining its vertex 2-gauge transformations, and let WK:Ob⁡B(K)→U(1) be constant on 1-arrows. Let VK,EK be the numbers of vertices and edges and define

c(K)=∣A∣VK−EK∣G∣VK.

Then its higher gauging sum satisfies

ZK(2)(WK)=∑[x]WK(x)∣π2(B(K),x)∣∣π1(B(K),x)∣=c(K)∑x∈Ob⁡B(K)WK(x).

For any subcomplex L and fixed field s on L, the higher sum over the relative 2-groupoid is

ZK,L(2)(s)=c(K)c(L)∑x∣L=sWK(x).

In particular let K=K1∪ΣK2, where the intersection is the subcomplex Σ and all orders are induced. Assume invariant weights Wi and WK obey WK(x)=W2(x∣K2)W1(x∣K1). Put Zi(s)=ZKi,Σ(2)(s). These boundary functions are invariant on 1-arrows of B(Σ) and obey the actual finite 2-group gluing law

ZK(2)(WK)=∑[s]∈π0B(Σ)Z2(s)Z1(s)∣π2(B(Σ),s)∣∣π1(B(Σ),s)∣.

The empty complex has c=1 and one empty field. For a point and unit weight the sum is ∣A∣/∣G∣. When A is trivial these formulas reduce to ordinary finite flat G-connection normalization. The theorem assumes scalar invariant weights and their stated factorization; it does not assert that an arbitrary higher cocycle defines such boundary scalar data.

Facts & Assumptions

Given: the finite data, invariant weights, subcomplexes and factorization hypothesis in the Statement.

[F1]

Finite background groupoid and cocycle-weighted gauging data defines higher integration with ∣π2∣/∣π1∣ and exact relative fields.

[F2]

Finite background gauge 2-groupoid gives all objects, raw gauge parameters, affine composition and relative arrow conditions.

[F3]

Coherence and stabilizers of finite background gauge 2-groupoids proves the 2-groupoid laws, reverses and kernel/image stabilizer formulas.

Proof

1.1givenF1F2F3algebra

Fix x=(a,B) and let Sx be its raw 1-automorphism set. By [F3], ∣π2(x)∣=∣ker⁡δa∣ and ∣π1(x)∣=∣Sx∣/∣im⁡δa∣. Since δa:C0→C1 is a homomorphism of finite abelian groups, its image has order ∣A∣VK/∣ker⁡δa∣. Hence ∣π2(x)∣/∣π1(x)∣=∣A∣VK/∣Sx∣. For relative cochains the identical argument replaces VK by VK−VL.

1.2givenF2F3algebra

There are N=∣G∣VK∣A∣EK raw gauge parameters with source x, each having a target by [F3]. For any target y in the component of x, fix a raw arrow f:x→y. Composition u↦f∘u identifies raw automorphisms at x bijectively with raw arrows x→y: its vertex equation uniquely solves for the vertex labels of u, and its edge equation uniquely solves for its edge labels since the coefficient of each is the automorphism ρgf. The solved vertex labels fix a because both resulting arrows have target edge labels of y. The solved edge labels fix B because f is affine with invertible linear coefficient on B, and f already sends x to y. Thus the solved parameter is indeed in Sx. Therefore each target has ∣Sx∣ arrows from x, and this component has N/∣Sx∣ objects. The same argument is relative: compositions and inverses retain identity/zero boundary labels and the parameter count is NK,L=∣G∣VK−VL∣A∣EK−EL.

1.3givenF2F3construct

Every fixed raw parameter acts bijectively on all background objects: the edge formula determines the original edge labels uniquely and the face formula is affine in B with invertible coefficient ρg. The source-wise reverse from [F3] shows the inverse preserves the background constraints. A boundary parameter on L extends to a raw bulk parameter by identity labels on other vertices and zero labels on other edges. This bijection carries the set of extensions of s to that of its transformed boundary field and preserves WK. Thus relative extension sums, and hence their normalized versions, are invariant under boundary 1-arrows.

1.4givenF2algebra

Local equations identify a field on K1∪ΣK2 with exactly a pair of fields agreeing on Σ: each simplex lies in one of the subcomplexes, so assignments glue uniquely and all flatness and tetrahedron equations remain valid. Vertex and edge counts satisfy inclusion-exclusion, so c(K)=c(K1)c(K2)/c(Σ).

2.1givenF1step 1.1step 1.2step 1.3algebra

On each component the weight is constant. Its higher mass by step 1.1 is ∣A∣VK/∣Sx∣, while its unnormalized object sum has N/∣Sx∣ terms by step 1.2. Their ratio is ∣A∣VK/N=c(K). Summing gives the absolute formula. Relatively the ratio is ∣A∣VK−VL/NK,L=c(K)/c(L), including empty extension sets. This proves the relative formula and, with step 1.3, boundary invariance.

3.1givenF1step 1.4step 2.1algebra

By step 2.1, the object-sum form of the proposed boundary integral is c(Σ)∑sZ2(s)Z1(s). Substituting the two relative formulas gives c(K2)c(K1)/c(Σ) times ∑s∑x2∣Σ=s∑x1∣Σ=sW2(x2)W1(x1). Step 1.4 and weight factorization identify this with c(K)∑xWK(x)=ZK(2). Applying the absolute formula on Σ to the invariant product Z2Z1 converts its object sum to the stated π2/π1 boundary sum. The formula for complex-valued invariant products follows from the same component counting, which uses only constancy and finite addition, not unit modulus.

4.1givenF1step 2.1step 3.1algebra∎

The empty and point cases follow by inserting their vertex/edge counts and object sets. If A is trivial, the only 2-gauge labels are zero and c(K)=∣G∣−VK, yielding ordinary finite flat-connection normalization. The finite sums, relative formula, invariance and gluing identity have all been established under precisely the stated weight hypotheses.

Depends on

Dependency tree · 2 levels

Sources