Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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 symmetry realization and background coupling

Physical scope

Finite-regulator Euclidean models on closed oriented triangulated d-manifolds with finite discrete 2-group backgrounds. This is a model-data interface; it asserts no QFT realization, anomaly absence, continuum limit, or empirical result.

Definition

Fix an integer d≥2, a closed compact oriented smooth d-manifold M, and a finite ordered triangulation K of M, meaning a finite vertex-ordered simplicial complex whose geometric realization is M. The model specifies its tangential structure as follows. Write BO(d)=Gr⁡d(R∞) for the space of d-dimensional linear subspaces of R∞=⋃NRN, with the direct-limit topology, and γd→BO(d) for the vector bundle whose fiber at a plane is that plane. Fix a continuous map τM:M→BO(d) and a vector-bundle isomorphism TM≅τM∗γd. Fix a topological space X and a continuous map ξ:X→BO(d) with the homotopy lifting property: for every topological space Y, continuous u:Y→X and continuous H:Y×[0,1]→BO(d) satisfying H(y,0)=ξ(u(y)), there is a continuous H~:Y×[0,1]→X with H~(y,0)=u(y) and ξ∘H~=H. Such a map is called a fibration here. Specify a continuous lift θ:M→X satisfying ξ∘θ=τM, and an orientation of θ∗ξ∗γd inducing the chosen orientation of TM. Pullback here gives the bundle with fiber (γd)ξ(θ(m)) at m∈M. These maps, bundle identification and orientation are specified data and remain fixed under the internal background gauge arrows below; the existence of a lift is an admissibility condition, not asserted for arbitrary M and ξ. For orientation alone, one may take X to be the space of oriented d-planes and ξ the map forgetting their orientations; additional lifting requirements must instead be encoded by the specified X, ξ and θ. A selected finite-regulator Euclidean model on K specifies its exact symmetry groups, field representations, finite field-value sets Xσ for cells σ∈K, constraints, and configuration spaces Φx⊆∏σ∈KXσ for each background x. It also specifies a dimensionless Euclidean action Sx:Φx→R, finite measure weights μx:Φx→C, and a unital complex subalgebra Ox⊆Fun⁡(Φx,C) of model-defined observables. For a subcomplex L⊆K, write Ox(L) for the subalgebra of functions depending only on field variables on L; an observable is local if it belongs to Ox(L) for some specified L. A line observable has support on a one-dimensional subcomplex. Write Wx(ϕ):=μx(ϕ)e−Sx(ϕ). For local insertion functions oj,x:Φx→C, define the unnormalized correlator by Cx(O1,…,On):=∑ϕ∈ΦxWx(ϕ)∏j=1noj,x(ϕ); the empty tuple has value Zx=Cx(). Use natural units c=ℏ=1; cochain labels, action phases, and the partition weight are dimensionless. The model separately assigns dimensions to any continuous field quantities or observables it includes. No continuum limit or Lorentzian continuation is part of this definition.

The ordinary-observable sum above is the no-defect sector of the model's complete insertion functional. For each background x, the model declares a set Ix of admissible inputs I=(b;D;X1,…,Xn): b specifies all remaining geometric and boundary data (there is no physical boundary for the closed M here); D is a finite decorated defect network; and each Xj is a typed local, line, or other model-admitted insertion, possibly another decorated network. A network has finitely many smooth locally closed strata whose closures obey the frontier condition, the complete incidence relation, and model-specified field, orientation, coorientation, framing, and ordered junction data on each stratum, as in the topological-defect definition. The model states all disjointness, incidence, and label admissibility conditions. For every I∈Ix it supplies a finite set Ωx(I) of field configurations, including any defect or junction variables and modified constraints, and a complex weight wx(I;ω) with its declared normalization. Its unnormalized complete correlator is

C^x(I):=∑ω∈Ωx(I)wx(I;ω)∈C.

For no defect and a tuple of ordinary local insertions this must reduce to Ωx(I)=Φx and wx(I;ϕ)=Wx(ϕ)∏joj,x(ϕ), so C^x(I)=Cx(O1,…,On). The empty network, empty insertion tuple has value Zx. This is conditional finite model data, not a construction of defect correlators from the ordinary observable algebra or from the 2-group labels.

The regulator includes a precise support-move convention. Defect supports at the displayed regulator inputs are represented by subcomplexes, with their smooth strata and decorations specified. A permitted decorated isotopy preserves strata, incidence and ordered junctions, transports every label and framing, fixes b and the background, and avoids all other insertions. A claim of topologicality along such a smooth path requires the model to supply complete correlators at every intermediate support and comparisons with the endpoint regulator inputs; if subdivisions or other regulator presentations are used, their field sums and comparison maps must be supplied. The model must verify equality of the complete correlators under these comparisons. At a fixed triangulation the same requirement applies to each declared discrete support move, with its exact transport of complete inputs. A path through supports not represented by subcomplexes is not evaluated merely by writing the fixed-K ordinary sum. These extra assignments do not assert a continuum limit or triangulation independence.

Let G be the selected finite discrete internal 0-form symmetry group. Its action on the model's local field and observable data is specified by group homomorphisms into the corresponding automorphism groups. Let A be the selected finite discrete abelian 1-form symmetry group, written additively, with the exact support, charge, and background conventions of the selected p-form symmetry model. The Abelian group A is the ordinary local invertible 1-form branch of the p-form definition. The 0-form group G may be non-Abelian, and its action on A and the Postnikov data below retain the mixed 2-group structure; this does not replace A by a non-Abelian local 1-form label group. The group is effective in the selected model: elements inducing identical actions in every admitted correlator, observable, and background are identified. Each generator Ua(Σ) is a defect insertion with support j(Σ), where Σ is a smooth manifold without boundary and j:Σ↪M is a smooth embedding with closed codimension-two image represented by a subcomplex of K; the insertion includes the model-specified local field or operator data and any required orientation, coorientation, framing, or junction data on that image. It is topological when C^x is invariant for every complete admissible input under the permitted decorated support isotopies and regulator comparisons just specified, avoiding all other insertions. The generators fuse by UaUa′=Ua+a′. Following the selected p-form symmetry model, a genuine line observable is supported on a closed embedded one-dimensional submanifold, represented here by a one-dimensional subcomplex of K, and is defined without an attached higher-dimensional support; the model specifies its crossing junction and action. If, for a nonzero genuine line observable Oγ, the crossing maps restrict to a complex-linear representation R:A→GL⁡(COγ), write Ra(Oγ)=χγ(a)Oγ. Then χγ:A→C× is a homomorphism. Since A is finite, every a∈A has finite order m, so χγ(a)m=χγ(0)=1 and ∣χγ(a)∣=1. Thus χγ is a character in A^:=Hom⁡(A,U(1)); it is continuous because A is finite and discrete. Sweeping Ua(Σ) once across the line in the chosen positive orientation multiplies the correlator by χγ(a). Other line observables need not carry a scalar character. The selected 0-form symmetry acts on these defect labels through a specified left action ρ:G→Aut⁡(A).

Here the representation condition means Ra+a′=RaRa′ and R0=id⁡; C×=C∖{0} and U(1)={z∈C:∣z∣=1}. The unit-modulus conclusion uses finiteness of A and this representation law, not a Hilbert-space inner product.

Choose a normalized inhomogeneous 3-cocycle β:G3→A for this left action; normalized means it vanishes if any argument is the identity, and the cocycle equation is

ρgβ(h,k,l)−β(gh,k,l)+β(g,hk,l)−β(g,h,kl)+β(g,h,k)=0.

For a normalized 2-cochain c:G2→A, set

(δρc)(g,h,k):=ρgc(h,k)−c(gh,k)+c(g,hk)−c(g,h).

Two normalized 3-cocycles represent the same Postnikov class when their difference is δρc for such a normalized c; [β] denotes this equivalence class. The skeletal associator convention is directed from (gh)k to g(hk). A discrete background is nondynamical model data and is not summed over. It is an object x=(a,B) of the finite background gauge 2-groupoid on K: aij∈G is a flat edge cochain, aijajk=aik on every ordered triangle; Bijk∈A is a face cochain at its first vertex; and on every ordered tetrahedron

(δaB)ijkl:=ρaijBjkl−Bikl+Bijl−Bijk=β(aij,ajk,akl)=(a∗β)ijkl.

Thus the two background fields are constrained and are not independent. A 1-gauge arrow is given by vertex labels gi∈G and edge labels λij∈A, with

aij′=giaijgj−1,ζijkg=−β(gi,aij,ajk)+β(aij′,gj,ajk)−β(aij′,ajk′,gk), Bijk′=ρgiBijk+ζijkg+ρaij′λjk−λik+λij.

A 2-arrow between 1-arrows with the same vertex labels g and edge labels λ,λ′ is a vertex A-cochain t satisfying λ′−λ=δa′t, where (δa′t)ij=ρaij′tj−ti; vertical composition adds these cochains. For consecutive 1-arrows (g,λ) then (h,μ), their composite has vertex labels hg and edge labels νij=ρhiλij+μij+τij, where τij=β(hi,gi,aij)−β(hi,aij′,gj)+β(aij′′,hj,gj) and aij′′=hiaij′hj−1. Horizontal composition sends 2-arrow cochains t,s to s+ρht. For three consecutive arrows with vertex labels g,h,k, the associator is the vertex cochain σi=β(ki,hi,gi); identity arrows have vertex labels e and edge labels 0, and unit constraints are identity 2-arrows. The pentagon and triangle coherence equations are those of this finite background gauge 2-groupoid.

A finite model fiber is a tuple Dx=(Φx,Ox,Wx,{Ox(L)}L⊆K) as specified above. Let M be the strict 2-category whose objects are these fibers. A 1-morphism F=(T,α):Dx→Dy consists of a bijection T:Φx→Φy and a unital complex-algebra isomorphism α:Ox→Oy such that (αO)(Tϕ)=O(ϕ) for all O∈Ox and ϕ∈Φx, and such that α preserves the declared local subalgebras. It must also transport weights by a configuration-independent nonzero scalar: there exists cF∈C× with Wy(Tϕ)=cFWx(ϕ) for every ϕ∈Φx. The scalar is not additional morphism data; it is unique when Wx is not identically zero, while no uniqueness is asserted for zero-weight or empty fibers. The phase-law case requires a model-specified choice in U(1), with the coherence stipulated below. Composition is (S,γ)∘(T,α)=(S∘T,γ∘α) and the identity is (id⁡Φx,id⁡Ox). A 2-morphism (J,j):(T,α)⇒(T′,α′) has target-fiber data J:Φy→Φy a bijection and j:Oy→Oy a unital complex-algebra automorphism, with T′=J∘T, α′=j∘α, j(O)=O∘J−1 for every O∈Oy, j preserving the declared local subalgebras, and Wy(Jψ)=Wy(ψ) for every ψ∈Φy. Identity 2-morphisms are identity pairs; vertical composition is (J′,j′)∘(J,j)=(J′∘J,j′∘j). If (J,j):F⇒F′ and (Q,q):H⇒H′ with F=(T,α):Dx→Dy and H=(S,γ):Dy→Dz, their horizontal composite is (Q∘S∘J∘S−1, q∘γ∘j∘γ−1):H∘F⇒H′∘F′. These formulas define the target's identity and composition laws.

In the target 2-category, locality preservation means α(Ox(L))=Oy(L) for each subcomplex L⊆K, and j(Oy(L))=Oy(L) for each target-side 2-morphism. Every 2-morphism compares 1-morphisms with the same source and target fibers. The identity 1-morphism has scalar 1, a composite H∘F has an admissible scalar cHcF, and the inverse pair (T−1,α−1) has scalar cF−1. Thus 1-morphisms are closed under these operations, including when some configuration weights vanish. Vertical composites and inverses of 2-morphisms preserve the target weight and local algebras.

For horizontal closure, put ψ=Sξ∈Φz. Since Wz(Sξ)=cHWy(ξ) and J preserves Wy, one has Wz(SJS−1ψ)=cHWy(Jξ)=cHWy(ξ)=Wz(ψ). Composing with Q still preserves Wz. The algebra component is pullback by the inverse of the resulting configuration bijection and preserves each local subalgebra, because q, γ, j, and their inverses do so. Its source and target are correct since (QSJS−1)(ST)=QSJT=S′T′ and (qγjγ−1)(γα)=qγjα=γ′α′. Here S′=QS, T′=JT, γ′=qγ, and α′=jα.

Finally, for fixed parallel 1-morphisms (T,α) and (T′,α′), any 2-morphism is uniquely forced to have J=T′T−1 and j=α′α−1; it exists precisely when this pair meets the stated conditions. Consequently the hom categories have at most one arrow between any two objects. The displayed 1-composition is strictly associative and unital. Every iterated horizontal composition, horizontal identity law, and either side of the interchange equation is now a well-typed 2-morphism with the same source and target as its counterpart, so uniqueness proves the required equalities. This verifies that M is a strict 2-category.

A finite 2-group background coupling is a pseudofunctor F:B(K)→M, where B(K) denotes the finite background gauge 2-groupoid on K defined above. Explicitly, it assigns a model fiber Dx to each background object, a 1-morphism (Tf,αf) to each 1-arrow, and a target-fiber 2-morphism (Jη,jη) to each 2-arrow η:f⇒f′. It preserves identity 2-arrows and vertical composition. It also supplies invertible comparison 2-morphisms κg,f:F(g)∘F(f)⇒F(g∘f) and unit 2-morphisms ιx:id⁡Dx⇒F(id⁡x). For composable 2-arrows η:f⇒f′ and θ:g⇒g′, horizontal naturality requires

F(θ∗η)∘κg,f=κg′,f′∘(F(θ)∗F(η)).

For the background associator ah,g,f:(h∘g)∘f⇒h∘(g∘f), the comparison maps obey

F(ah,g,f)∘κh∘g,f∘(κh,g∗id⁡F(f))=κh,g∘f∘(id⁡F(h)∗κg,f).

For the left and right unitors ℓf:id⁡y∘f⇒f and rf:f∘id⁡x⇒f, they obey

F(ℓf)∘κid⁡y,f∘(ιy∗id⁡F(f))=id⁡F(f),F(rf)∘κf,id⁡x∘(id⁡F(f)∗ιx)=id⁡F(f).

The coupling also specifies a bijective transport f∗:Ix→Iy of complete admissible inputs along each gauge arrow f:x→y, including its action on b, all support decorations, and junctions, together with a bijection T~f,I:Ωx(I)→Ωy(f∗I). On the ordinary sector these reduce to the specified observable transport and Tf. For a 2-arrow η:f⇒f′, the model supplies a bijection of target input data sending f∗I to f∗′I and a configuration bijection J~η,I:Ωy(f∗I)→Ωy(f∗′I) with T~f′,I=J~η,IT~f,I and preservation of the complete integrand. Comparison maps similarly run from g∗(f∗I) to (g∘f)∗I, with configuration maps from Ωz(g∗f∗I) to Ωz((g∘f)∗I); unit maps run from I to (id⁡x)∗I. On each such fiber these maps obey the identity, vertical, horizontal, associator and unit equations displayed above, using their stated source and target inputs, and they intertwine every declared support move. Their weight transformation law is additional model data. In the coherent phase-law setting on complete inputs the model must in particular verify

wy(f∗I;T~f,Iω)=χf(x)wx(I;ω)

for every admitted I and ω, with the same configuration-independent phase and identity, composition and 2-isomorphism conditions as below. This implies C^y(f∗I)=χf(x)C^x(I) by finite reindexing; ordinary-sector covariance alone does not establish this extension. Likewise, every claimed internal symmetry action on observables and defects includes a bijection on the complete typed insertion and combined background/boundary data, preserving admissibility and the complete correlator after that simultaneous transport; a specified anomalous background gauge transformation instead has its stated phase law. Crossing actions and their junctions must be defined on these complete inputs before a defect-charge relation is asserted.

Here ∗ denotes horizontal composition or whiskering of 2-morphisms. These equations give the precise identity, vertical, horizontal, associator, and unit coherence required of the model assignment. The action and measure are model inputs; the finite 2-group data alone do not choose them or determine their transformation phase.

A permitted background counterterm is a model-declared dimensionless functional Lx∈R/(2πZ) that is a finite sum of functions, each depending only on cochain labels in one simplex or a specified finite cluster of simplices; it reweights the model by eiLx. If under a gauge arrow f:x→y all unnormalized correlators transform by a common phase χf(x)∈U(1), coherence requires χidx(x)=1, χg∘f(x)=χg(y)χf(x) for composable arrows, and equal phases for 2-isomorphic arrows. The residual background anomaly is the class of these phases under χf(x)↦eiLyχf(x)e−iLx for the permitted counterterms. The anomaly is absent in the selected scheme exactly when an allowed counterterm makes every such phase 1. The Postnikov class specifies the background constraint and gauge transformations; it is not itself the model's transformation phase or anomaly. It may enter an anomaly calculation for a specified action and measure.

Depends on

Dependency tree · 1 level

Sources