Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definitions for Crossed Module Bundle Gerbes; Classification, String Group and Differential Geometry

Definition
QAlgorithms_Papers_Independent_Intakenext100_P59

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

The objects the formalized statements of Crossed Module Bundle Gerbes; Classification, String Group and Differential Geometry (arXiv:math/0510078) are stated in. Each was checked against the paper by a blind read-back and a moderator.

  • GroupLevel: The degree-n group of a simplicial group (source: PDF p. 3).
  • BaseLevel: The degree-n set of the simplicial base (source: PDF p. 3).
  • Twisting: All four twisting identities of section 1.1, PDF p. 3. There is no value on X_0: value n is the twisting from X_(n+1) to G_n.
  • trivialTwisting: The trivial twisting, used to test the exceptional zeroth-face convention.
  • TwistedPoint: Degreewise total space G_n times X_n of P(tau), section 1.2, PDF p. 4.
  • twistedFace: The source's twisted face maps, including right multiplication by tau in face zero. Together with twistedDegeneracy these specify the full simplicial object, rather than a product with the untwisted zeroth face (PDF p. 4).
  • twistedDegeneracy: Degeneracies of the twisted product are componentwise (PDF p. 4).
  • twistedLeft: The principal left action on P(tau), section 1.2, PDF p. 4.
  • canonicalSection: Canonical pseudo-cross section; its value need not commute with face zero (section 1.2, PDF p. 4). The projection is the second coordinate.
  • TwistingGauge: The degreewise gauge functions satisfying exactly the three displayed laws of section 1.3, PDF p. 4. Correction: the printed word "simplicial" is replaced by those laws; ordinary zeroth-face naturality is not also imposed.
  • TwistedBundleIso: Actual equivariant bundle isomorphisms over X in the twisted-product presentation: degreewise bijections preserve the projection and action and commute with every face and degeneracy (sections 1.2-1.3, PDF p. 4).
  • identityGauge: Identity gauge, testing that no ordinary face-zero law is added to a gauge.
  • identityBundleIso: Identity bundle isomorphism for the explicit twisted maps.
  • positiveFaceKernel: The source's Gbar_n, section 3, PDF p. 7: kernel of the composite partial_1 ... partial_n, equivalently restriction to the first vertex. This is not the intersection of the face kernels. Gbar_0 is the trivial subgroup.
  • boundaryImage: The actual image of Gbar_(n+1) under face zero (section 3, PDF p. 7).
Definition code
import Mathlib

/-!
Statements from Jurco, arXiv:math/0510078v2. The geometric results whose full
interfaces are not implemented are individually recorded in the unit's HARD.md.
Only the two theorem declarations below are proof targets; examples are sanity tests.
-/

open CategoryTheory
open scoped Simplicial

universe u

namespace QAlgorithms.Papers.Independent.Intakenext100.P59

/-- The degree-n group of a simplicial group (source: PDF p. 3). -/
abbrev GroupLevel (G : SimplicialObject GrpCat.{u}) (n : ℕ) : Type u :=
  G.obj (Opposite.op (SimplexCategory.mk n))

/-- The degree-n set of the simplicial base (source: PDF p. 3). -/
abbrev BaseLevel (X : SSet.{u}) (n : ℕ) : Type u :=
  X.obj (Opposite.op (SimplexCategory.mk n))

/-- All four twisting identities of section 1.1, PDF p. 3. There is no value
on X_0: `value n` is the twisting from X_(n+1) to G_n. -/
structure Twisting (G : SimplicialObject GrpCat.{u}) (X : SSet.{u}) where
  value : ∀ n : ℕ, BaseLevel X (n + 1) → GroupLevel G n
  faceZero : ∀ (n : ℕ) (x : BaseLevel X (n + 2)),
    (G.δ (n := n) 0).hom (value (n + 1) x) =
      value n (X.δ (n := n + 1) 1 x) *
        (value n (X.δ (n := n + 1) 0 x))⁻¹
  facePositive : ∀ (n : ℕ) (i : Fin (n + 2)), 0 < i.val →
    ∀ x : BaseLevel X (n + 2),
      (G.δ (n := n) i).hom (value (n + 1) x) =
        value n (X.δ (n := n + 1) i.succ x)
  degeneracy : ∀ (n : ℕ) (i : Fin (n + 1)) (x : BaseLevel X (n + 1)),
    (G.σ (n := n) i).hom (value n x) =
      value (n + 1) (X.σ (n := n + 1) i.succ x)
  degeneracyZero : ∀ (n : ℕ) (x : BaseLevel X n),
    value n (X.σ (n := n) 0 x) = 1

/-- The trivial twisting, used to test the exceptional zeroth-face convention. -/
def trivialTwisting (G : SimplicialObject GrpCat.{u}) (X : SSet.{u}) :
    Twisting G X where
  value := fun _ _ => 1
  faceZero := by intros; simp
  facePositive := by intros; simp
  degeneracy := by intros; simp
  degeneracyZero := by intros; rfl

example (G : SimplicialObject GrpCat.{u}) (X : SSet.{u})
    (n : ℕ) (x : BaseLevel X (n + 1)) :
    (trivialTwisting G X).value n x = 1 := rfl

/-- Degreewise total space G_n times X_n of P(tau), section 1.2, PDF p. 4. -/
abbrev TwistedPoint (G : SimplicialObject GrpCat.{u}) (X : SSet.{u}) (n : ℕ) :=
  GroupLevel G n × BaseLevel X n

/-- The source's twisted face maps, including right multiplication by tau in
face zero. Together with `twistedDegeneracy` these specify the full simplicial
object, rather than a product with the untwisted zeroth face (PDF p. 4). -/
def twistedFace {G : SimplicialObject GrpCat.{u}} {X : SSet.{u}}
    (tau : Twisting G X) (n : ℕ) (i : Fin (n + 2))
    (p : TwistedPoint G X (n + 1)) : TwistedPoint G X n :=
  if i.val = 0 then
    ((G.δ (n := n) i).hom p.1 * tau.value n p.2,
      X.δ (n := n) i p.2)
  else
    ((G.δ (n := n) i).hom p.1, X.δ (n := n) i p.2)

/-- Degeneracies of the twisted product are componentwise (PDF p. 4). -/
def twistedDegeneracy {G : SimplicialObject GrpCat.{u}} {X : SSet.{u}}
    (n : ℕ) (i : Fin (n + 1)) (p : TwistedPoint G X n) :
    TwistedPoint G X (n + 1) :=
  ((G.σ (n := n) i).hom p.1, X.σ (n := n) i p.2)

/-- The principal left action on P(tau), section 1.2, PDF p. 4. -/
def twistedLeft {G : SimplicialObject GrpCat.{u}} {X : SSet.{u}}
    (n : ℕ) (g : GroupLevel G n) (p : TwistedPoint G X n) :
    TwistedPoint G X n :=
  (g * p.1, p.2)

/-- Canonical pseudo-cross section; its value need not commute with face zero
(section 1.2, PDF p. 4). The projection is the second coordinate. -/
def canonicalSection (G : SimplicialObject GrpCat.{u}) (X : SSet.{u})
    (n : ℕ) (x : BaseLevel X n) : TwistedPoint G X n :=
  (1, x)

example {G : SimplicialObject GrpCat.{u}} {X : SSet.{u}}
    (tau : Twisting G X) (n : ℕ) (p : TwistedPoint G X (n + 1)) :
    twistedFace tau n 0 p =
      ((G.δ (n := n) 0).hom p.1 * tau.value n p.2,
        X.δ (n := n) 0 p.2) := rfl

example {G : SimplicialObject GrpCat.{u}} {X : SSet.{u}}
    (n : ℕ) (p : TwistedPoint G X n) : twistedLeft n 1 p = p := by
  simp [twistedLeft]

example (G : SimplicialObject GrpCat.{u}) (X : SSet.{u})
    (n : ℕ) (x : BaseLevel X n) : (canonicalSection G X n x).2 = x := rfl

example {G : SimplicialObject GrpCat.{u}} {X : SSet.{u}}
    (n : ℕ) (i : Fin (n + 1)) (x : BaseLevel X n) :
    twistedDegeneracy n i (canonicalSection G X n x) =
      canonicalSection G X (n + 1) (X.σ (n := n) i x) := by
  simp [twistedDegeneracy, canonicalSection]

/-- The degreewise gauge functions satisfying exactly the three displayed
laws of section 1.3, PDF p. 4. Correction: the printed word "simplicial" is
replaced by those laws; ordinary zeroth-face naturality is not also imposed. -/
structure TwistingGauge {G : SimplicialObject GrpCat.{u}} {X : SSet.{u}}
    (tau tauPrime : Twisting G X) where
  value : ∀ n : ℕ, BaseLevel X n → GroupLevel G n
  faceZero : ∀ (n : ℕ) (x : BaseLevel X (n + 1)),
    (G.δ (n := n) 0).hom (value (n + 1) x) * tauPrime.value n x =
      tau.value n x * value n (X.δ (n := n) 0 x)
  facePositive : ∀ (n : ℕ) (i : Fin (n + 2)), 0 < i.val →
    ∀ x : BaseLevel X (n + 1),
      (G.δ (n := n) i).hom (value (n + 1) x) =
        value n (X.δ (n := n) i x)
  degeneracy : ∀ (n : ℕ) (i : Fin (n + 1)) (x : BaseLevel X n),
    (G.σ (n := n) i).hom (value n x) =
      value (n + 1) (X.σ (n := n) i x)

/-- Actual equivariant bundle isomorphisms over X in the twisted-product
presentation: degreewise bijections preserve the projection and action and
commute with every face and degeneracy (sections 1.2-1.3, PDF p. 4). -/
structure TwistedBundleIso {G : SimplicialObject GrpCat.{u}} {X : SSet.{u}}
    (tau tauPrime : Twisting G X) where
  map : ∀ n : ℕ, TwistedPoint G X n ≃ TwistedPoint G X n
  overBase : ∀ (n : ℕ) (p : TwistedPoint G X n), (map n p).2 = p.2
  equivariant : ∀ (n : ℕ) (g : GroupLevel G n) (p : TwistedPoint G X n),
    map n (twistedLeft n g p) = twistedLeft n g (map n p)
  face : ∀ (n : ℕ) (i : Fin (n + 2)) (p : TwistedPoint G X (n + 1)),
    map n (twistedFace tau n i p) = twistedFace tauPrime n i (map (n + 1) p)
  degeneracy : ∀ (n : ℕ) (i : Fin (n + 1)) (p : TwistedPoint G X n),
    map (n + 1) (twistedDegeneracy n i p) = twistedDegeneracy n i (map n p)

/-- Identity gauge, testing that no ordinary face-zero law is added to a gauge. -/
def identityGauge {G : SimplicialObject GrpCat.{u}} {X : SSet.{u}}
    (tau : Twisting G X) : TwistingGauge tau tau where
  value := fun _ _ => 1
  faceZero := by intros; simp
  facePositive := by intros; simp
  degeneracy := by intros; simp

/-- Identity bundle isomorphism for the explicit twisted maps. -/
def identityBundleIso {G : SimplicialObject GrpCat.{u}} {X : SSet.{u}}
    (tau : Twisting G X) : TwistedBundleIso tau tau where
  map := fun _ => Equiv.refl _
  overBase := by intros; rfl
  equivariant := by intros; rfl
  face := by intros; rfl
  degeneracy := by intros; rfl

example {G : SimplicialObject GrpCat.{u}} {X : SSet.{u}}
    (tau : Twisting G X) (n : ℕ) (p : TwistedPoint G X n) :
    (identityBundleIso tau).map n p =
      (p.1 * (identityGauge tau).value n p.2, p.2) := by
  simp [identityBundleIso, identityGauge]

/-- The source's Gbar_n, section 3, PDF p. 7: kernel of the composite
partial_1 ... partial_n, equivalently restriction to the first vertex. This is
not the intersection of the face kernels. Gbar_0 is the trivial subgroup. -/
def positiveFaceKernel (G : SimplicialObject GrpCat.{u}) :
    (n : ℕ) → Subgroup (GroupLevel G n) := fun n =>
  match n with
  | 0 => ⊥
  | n + 1 =>
    MonoidHom.ker
      (G.map (SimplexCategory.const (SimplexCategory.mk 0)
        (SimplexCategory.mk (n + 1)) 0).op).hom

/-- The actual image of Gbar_(n+1) under face zero (section 3, PDF p. 7). -/
def boundaryImage (G : SimplicialObject GrpCat.{u}) (n : ℕ) :
    Subgroup (GroupLevel G n) :=
  (positiveFaceKernel G (n + 1)).map (G.δ (n := n) 0).hom

example (G : SimplicialObject GrpCat.{u}) : positiveFaceKernel G 0 = ⊥ := rfl

example (G : SimplicialObject GrpCat.{u}) (n : ℕ) :
    (1 : GroupLevel G (n + 1)) ∈ positiveFaceKernel G (n + 1) := by
  exact (positiveFaceKernel G (n + 1)).one_mem

example (G : SimplicialObject GrpCat.{u}) (n : ℕ) :
    (1 : GroupLevel G n) ∈ boundaryImage G n := by
  exact (boundaryImage G n).one_mem

end QAlgorithms.Papers.Independent.Intakenext100.P59
Source
Crossed Module Bundle Gerbes; Classification, String Group and Differential Geometry, arXiv:math/0510078v2, https://arxiv.org/abs/math/0510078v2
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

QAlgorithms.Papers.Independent.Intakenext100.P59.BaseLevel

For any simplicial set XXX with values in universe uuu, and every natural number nnn, including n=0n=0n=0, BaseLevel⁡(X,n)\operatorname{BaseLevel}(X,n)BaseLevel(X,n) denotes the type XnX_nXn​ obtained by evaluating the contravariant functor XXX at the standard ordered simplex [n]={0,…,n}[n]=\{0,\ldots,n\}[n]={0,…,n}. This type is allowed to be empty.

QAlgorithms.Papers.Independent.Intakenext100.P59.GroupLevel

For any simplicial group GGG whose underlying groups have types in universe uuu, and every natural number nnn, including n=0n=0n=0, GroupLevel⁡(G,n)\operatorname{GroupLevel}(G,n)GroupLevel(G,n) denotes the underlying type of the group obtained by evaluating the contravariant functor GGG at the standard ordered simplex [n]={0,…,n}[n]=\{0,\ldots,n\}[n]={0,…,n}.

QAlgorithms.Papers.Independent.Intakenext100.P59.TwistedBundleIso

Let GGG be any simplicial group and XXX any simplicial set, with levels Gk,XkG_k,X_kGk​,Xk​ in universe uuu, and write diG,diX,siG,siXd_i^G,d_i^X,s_i^G,s_i^XdiG​,diX​,siG​,siX​ for their face and degeneracy maps. Let τ\tauτ and τ′\tau'τ′ be families Xk+1→GkX_{k+1}\to G_kXk+1​→Gk​ such that, for either family ρ\rhoρ, every k≥0k\geq0k≥0 and z∈Xk+2z\in X_{k+2}z∈Xk+2​ satisfy d0G(ρk+1(z))=ρk(d1Xz)ρk(d0Xz)−1d_0^G(\rho_{k+1}(z))=\rho_k(d_1^Xz)\rho_k(d_0^Xz)^{-1}d0G​(ρk+1​(z))=ρk​(d1X​z)ρk​(d0X​z)−1 and djG(ρk+1(z))=ρk(dj+1Xz)d_j^G(\rho_{k+1}(z))=\rho_k(d_{j+1}^Xz)djG​(ρk+1​(z))=ρk​(dj+1X​z) for 1≤j≤k+11\leq j\leq k+11≤j≤k+1; every y∈Xk+1y\in X_{k+1}y∈Xk+1​ and 0≤j≤k0\leq j\leq k0≤j≤k satisfy sjG(ρk(y))=ρk+1(sj+1Xy)s_j^G(\rho_k(y))=\rho_{k+1}(s_{j+1}^Xy)sjG​(ρk​(y))=ρk+1​(sj+1X​y); and every w∈Xkw\in X_kw∈Xk​ satisfies ρk(s0Xw)=1Gk\rho_k(s_0^Xw)=1_{G_k}ρk​(s0X​w)=1Gk​​. A twisted bundle isomorphism from τ\tauτ to τ′\tau'τ′ consists of a bijection Fn:Gn×Xn→Gn×XnF_n:G_n\times X_n\to G_n\times X_nFn​:Gn​×Xn​→Gn​×Xn​, with an inverse, for every n≥0n\geq0n≥0, together with the following requirements. For every n≥0n\geq0n≥0 and (h,x)∈Gn×Xn(h,x)\in G_n\times X_n(h,x)∈Gn​×Xn​, if Fn(h,x)=(a,b)F_n(h,x)=(a,b)Fn​(h,x)=(a,b), then b=xb=xb=x, and for every g∈Gng\in G_ng∈Gn​,

Fn(gh,x)=(ga,b).F_n(gh,x)=(ga,b).Fn​(gh,x)=(ga,b).

For every n≥0n\geq0n≥0 and (h,x)∈Gn+1×Xn+1(h,x)\in G_{n+1}\times X_{n+1}(h,x)∈Gn+1​×Xn+1​, if Fn+1(h,x)=(a,b)F_{n+1}(h,x)=(a,b)Fn+1​(h,x)=(a,b), then

Fn(d0Gh  τn(x),d0Xx)=(d0Ga  τn′(b),d0Xb),Fn(diGh,diXx)=(diGa,diXb)(1≤i≤n+1).F_n\bigl(d_0^Gh\;\tau_n(x),d_0^Xx\bigr) =\bigl(d_0^Ga\;\tau'_n(b),d_0^Xb\bigr), \qquad F_n(d_i^Gh,d_i^Xx)=(d_i^Ga,d_i^Xb) \quad(1\leq i\leq n+1).Fn​(d0G​hτn​(x),d0X​x)=(d0G​aτn′​(b),d0X​b),Fn​(diG​h,diX​x)=(diG​a,diX​b)(1≤i≤n+1).

Finally, for every n≥0n\geq0n≥0, 0≤i≤n0\leq i\leq n0≤i≤n, and (h,x)∈Gn×Xn(h,x)\in G_n\times X_n(h,x)∈Gn​×Xn​, if Fn(h,x)=(a,b)F_n(h,x)=(a,b)Fn​(h,x)=(a,b), then

Fn+1(siGh,siXx)=(siGa,siXb).F_{n+1}(s_i^Gh,s_i^Xx)=(s_i^Ga,s_i^Xb).Fn+1​(siG​h,siX​x)=(siG​a,siX​b).

All requirements include degree zero; when XnX_nXn​ is empty, the degree-nnn bijection is between empty types and requirements quantified over its elements are vacuous.

QAlgorithms.Papers.Independent.Intakenext100.P59.TwistedPoint

For every simplicial group GGG, simplicial set XXX, and natural number nnn, including zero, with levels in universe uuu, the type of twisted points in degree nnn is the Cartesian product Gn×XnG_n\times X_nGn​×Xn​, where GnG_nGn​ is the underlying type of the group in degree nnn and XnX_nXn​ is the type of simplices in degree nnn. Its elements are precisely pairs (g,x)(g,x)(g,x) with g∈Gng\in G_ng∈Gn​ and x∈Xnx\in X_nx∈Xn​; it is empty when XnX_nXn​ is empty.

QAlgorithms.Papers.Independent.Intakenext100.P59.Twisting

For any simplicial group GGG and simplicial set XXX, with levels in universe uuu, write GnG_nGn​ and XnX_nXn​ for their degree-nnn underlying types, and diG,diX,siG,siXd_i^G,d_i^X,s_i^G,s_i^XdiG​,diX​,siG​,siX​ for their face and degeneracy maps. A twisting consists of functions τn:Xn+1→Gn\tau_n:X_{n+1}\to G_nτn​:Xn+1​→Gn​ for every integer n≥0n\geq0n≥0, together with the following identities: for every n≥0n\geq0n≥0 and x∈Xn+2x\in X_{n+2}x∈Xn+2​,

d0G(τn+1(x))=τn(d1Xx) τn(d0Xx)−1,diG(τn+1(x))=τn(di+1Xx)(1≤i≤n+1);d_0^G(\tau_{n+1}(x)) =\tau_n(d_1^Xx)\,\tau_n(d_0^Xx)^{-1}, \qquad d_i^G(\tau_{n+1}(x)) =\tau_n(d_{i+1}^Xx)\quad(1\leq i\leq n+1);d0G​(τn+1​(x))=τn​(d1X​x)τn​(d0X​x)−1,diG​(τn+1​(x))=τn​(di+1X​x)(1≤i≤n+1);

for every n≥0n\geq0n≥0, 0≤i≤n0\leq i\leq n0≤i≤n, and y∈Xn+1y\in X_{n+1}y∈Xn+1​,

siG(τn(y))=τn+1(si+1Xy);s_i^G(\tau_n(y))=\tau_{n+1}(s_{i+1}^Xy);siG​(τn​(y))=τn+1​(si+1X​y);

and for every n≥0n\geq0n≥0 and z∈Xnz\in X_nz∈Xn​,

τn(s0Xz)=1Gn.\tau_n(s_0^Xz)=1_{G_n}.τn​(s0X​z)=1Gn​​.

All these requirements include degree zero, and an identity quantified over an empty level of XXX imposes no condition at that level.

QAlgorithms.Papers.Independent.Intakenext100.P59.TwistingGauge

Let GGG be any simplicial group and XXX any simplicial set, with levels Gk,XkG_k,X_kGk​,Xk​ in universe uuu, and denote their face and degeneracy maps by diG,diX,siG,siXd_i^G,d_i^X,s_i^G,s_i^XdiG​,diX​,siG​,siX​. Let τ\tauτ and τ′\tau'τ′ be families of functions Xk+1→GkX_{k+1}\to G_kXk+1​→Gk​, each satisfying the following conditions: for either family ρ\rhoρ, every k≥0k\geq0k≥0 and z∈Xk+2z\in X_{k+2}z∈Xk+2​ satisfy d0G(ρk+1(z))=ρk(d1Xz)ρk(d0Xz)−1d_0^G(\rho_{k+1}(z))=\rho_k(d_1^Xz)\rho_k(d_0^Xz)^{-1}d0G​(ρk+1​(z))=ρk​(d1X​z)ρk​(d0X​z)−1 and djG(ρk+1(z))=ρk(dj+1Xz)d_j^G(\rho_{k+1}(z))=\rho_k(d_{j+1}^Xz)djG​(ρk+1​(z))=ρk​(dj+1X​z) for 1≤j≤k+11\leq j\leq k+11≤j≤k+1; every y∈Xk+1y\in X_{k+1}y∈Xk+1​ and 0≤j≤k0\leq j\leq k0≤j≤k satisfy sjG(ρk(y))=ρk+1(sj+1Xy)s_j^G(\rho_k(y))=\rho_{k+1}(s_{j+1}^Xy)sjG​(ρk​(y))=ρk+1​(sj+1X​y); and every w∈Xkw\in X_kw∈Xk​ satisfies ρk(s0Xw)=1Gk\rho_k(s_0^Xw)=1_{G_k}ρk​(s0X​w)=1Gk​​. A gauge from τ\tauτ to τ′\tau'τ′ consists of functions an:Xn→Gna_n:X_n\to G_nan​:Xn​→Gn​ for every n≥0n\geq0n≥0, together with identities, for every n≥0n\geq0n≥0 and x∈Xn+1x\in X_{n+1}x∈Xn+1​,

d0G(an+1(x)) τn′(x)=τn(x) an(d0Xx),diG(an+1(x))=an(diXx)(1≤i≤n+1),d_0^G(a_{n+1}(x))\,\tau'_n(x) =\tau_n(x)\,a_n(d_0^Xx), \qquad d_i^G(a_{n+1}(x))=a_n(d_i^Xx) \quad(1\leq i\leq n+1),d0G​(an+1​(x))τn′​(x)=τn​(x)an​(d0X​x),diG​(an+1​(x))=an​(diX​x)(1≤i≤n+1),

and, for every n≥0n\geq0n≥0, 0≤i≤n0\leq i\leq n0≤i≤n, and y∈Xny\in X_ny∈Xn​,

siG(an(y))=an+1(siXy).s_i^G(a_n(y))=a_{n+1}(s_i^Xy).siG​(an​(y))=an+1​(siX​y).

Degree zero is included throughout, and conditions quantified over empty levels of XXX are vacuous.

QAlgorithms.Papers.Independent.Intakenext100.P59.boundaryImage

For any universe uuu, simplicial group GGG whose level groups GmG_mGm​ have underlying types in uuu, and natural number nnn, let vn+1:Gn+1→G0v_{n+1}:G_{n+1}\to G_0vn+1​:Gn+1​→G0​ be the homomorphism induced contravariantly by the order-preserving map [0]→[n+1][0]\to[n+1][0]→[n+1] selecting vertex 000, and let d0G:Gn+1→Gnd_0^G:G_{n+1}\to G_nd0G​:Gn+1​→Gn​ be the zeroth face homomorphism. This definition gives the subgroup Bn=d0G(ker⁡vn+1)={d0G(h)∣h∈Gn+1, vn+1(h)=1G0}B_n=d_0^G(\ker v_{n+1})=\{d_0^G(h)\mid h\in G_{n+1},\ v_{n+1}(h)=1_{G_0}\}Bn​=d0G​(kervn+1​)={d0G​(h)∣h∈Gn+1​, vn+1​(h)=1G0​​} of GnG_nGn​. This includes n=0n=0n=0, when the subgroup lies in G0G_0G0​.

QAlgorithms.Papers.Independent.Intakenext100.P59.canonicalSection

For every simplicial group GGG and simplicial set XXX, with degree-nnn underlying types Gn,XnG_n,X_nGn​,Xn​ in universe uuu, every natural number nnn, including zero, and every x∈Xnx\in X_nx∈Xn​, this defines the pair

x⟼(1Gn,x)∈Gn×Xn,x\longmapsto(1_{G_n},x)\in G_n\times X_n,x⟼(1Gn​​,x)∈Gn​×Xn​,

where 1Gn1_{G_n}1Gn​​ is the identity of GnG_nGn​. When XnX_nXn​ is empty this is the function with empty domain.

QAlgorithms.Papers.Independent.Intakenext100.P59.identityBundleIso

For any universe uuu, simplicial group GGG and simplicial set XXX with level types in uuu, write GnG_nGn​ and XnX_nXn​ for their degree-nnn groups and sets, and diG,diX,siG,siXd_i^G,d_i^X,s_i^G,s_i^XdiG​,diX​,siG​,siX​ for their face and degeneracy maps. Suppose τ\tauτ consists of maps τn:Xn+1→Gn\tau_n:X_{n+1}\to G_nτn​:Xn+1​→Gn​ satisfying, for every n≥0n\ge0n≥0, d0G(τn+1(x))=τn(d1Xx)τn(d0Xx)−1d_0^G(\tau_{n+1}(x))=\tau_n(d_1^Xx)\tau_n(d_0^Xx)^{-1}d0G​(τn+1​(x))=τn​(d1X​x)τn​(d0X​x)−1 for x∈Xn+2x\in X_{n+2}x∈Xn+2​, diG(τn+1(x))=τn(di+1Xx)d_i^G(\tau_{n+1}(x))=\tau_n(d_{i+1}^Xx)diG​(τn+1​(x))=τn​(di+1X​x) for x∈Xn+2x\in X_{n+2}x∈Xn+2​ and 1≤i≤n+11\le i\le n+11≤i≤n+1, siG(τn(x))=τn+1(si+1Xx)s_i^G(\tau_n(x))=\tau_{n+1}(s_{i+1}^Xx)siG​(τn​(x))=τn+1​(si+1X​x) for x∈Xn+1x\in X_{n+1}x∈Xn+1​ and 0≤i≤n0\le i\le n0≤i≤n, and τn(s0Xx)=1\tau_n(s_0^Xx)=1τn​(s0X​x)=1 for x∈Xnx\in X_nx∈Xn​. This definition constructs a family of bijections In:Gn×Xn→Gn×XnI_n:G_n\times X_n\to G_n\times X_nIn​:Gn​×Xn​→Gn​×Xn​ given by In(g,x)=(g,x)I_n(g,x)=(g,x)In​(g,x)=(g,x). Each bijection preserves the second coordinate and commutes with left multiplication a⋅(g,x)=(ag,x)a\cdot(g,x)=(ag,x)a⋅(g,x)=(ag,x). It also commutes with all twisted faces D0τ(g,x)=(d0Gg τn(x),d0Xx)D_0^\tau(g,x)=(d_0^Gg\,\tau_n(x),d_0^Xx)D0τ​(g,x)=(d0G​gτn​(x),d0X​x) and Diτ(g,x)=(diGg,diXx)D_i^\tau(g,x)=(d_i^Gg,d_i^Xx)Diτ​(g,x)=(diG​g,diX​x) for 1≤i≤n+11\le i\le n+11≤i≤n+1, from degree n+1n+1n+1 to degree nnn, and with all degeneracies Si(g,x)=(siGg,siXx)S_i(g,x)=(s_i^Gg,s_i^Xx)Si​(g,x)=(siG​g,siX​x) for 0≤i≤n0\le i\le n0≤i≤n, from degree nnn to degree n+1n+1n+1. These assertions hold in every degree, including degree zero.

QAlgorithms.Papers.Independent.Intakenext100.P59.identityGauge

Let GGG be any simplicial group and XXX any simplicial set, with levels Gk,XkG_k,X_kGk​,Xk​ in universe uuu, and write diG,diX,siG,siXd_i^G,d_i^X,s_i^G,s_i^XdiG​,diX​,siG​,siX​ for their face and degeneracy maps. Suppose τ\tauτ consists of functions τk:Xk+1→Gk\tau_k:X_{k+1}\to G_kτk​:Xk+1​→Gk​ such that, for every k≥0k\geq0k≥0 and z∈Xk+2z\in X_{k+2}z∈Xk+2​, d0G(τk+1(z))=τk(d1Xz)τk(d0Xz)−1d_0^G(\tau_{k+1}(z))=\tau_k(d_1^Xz)\tau_k(d_0^Xz)^{-1}d0G​(τk+1​(z))=τk​(d1X​z)τk​(d0X​z)−1 and djG(τk+1(z))=τk(dj+1Xz)d_j^G(\tau_{k+1}(z))=\tau_k(d_{j+1}^Xz)djG​(τk+1​(z))=τk​(dj+1X​z) for 1≤j≤k+11\leq j\leq k+11≤j≤k+1; for every y∈Xk+1y\in X_{k+1}y∈Xk+1​ and 0≤j≤k0\leq j\leq k0≤j≤k, sjG(τk(y))=τk+1(sj+1Xy)s_j^G(\tau_k(y))=\tau_{k+1}(s_{j+1}^Xy)sjG​(τk​(y))=τk+1​(sj+1X​y); and for every w∈Xkw\in X_kw∈Xk​, τk(s0Xw)=1Gk\tau_k(s_0^Xw)=1_{G_k}τk​(s0X​w)=1Gk​​. This defines a gauge from τ\tauτ to itself whose functions are an:Xn→Gna_n:X_n\to G_nan​:Xn​→Gn​, an(x)=1Gna_n(x)=1_{G_n}an​(x)=1Gn​​, for all n≥0n\geq0n≥0 and x∈Xnx\in X_nx∈Xn​. Its supplied identities are, for every n≥0n\geq0n≥0 and x∈Xn+1x\in X_{n+1}x∈Xn+1​,

d0G(1Gn+1) τn(x)=τn(x) 1Gn,diG(1Gn+1)=1Gn(1≤i≤n+1),d_0^G(1_{G_{n+1}})\,\tau_n(x)=\tau_n(x)\,1_{G_n}, \qquad d_i^G(1_{G_{n+1}})=1_{G_n}\quad(1\leq i\leq n+1),d0G​(1Gn+1​​)τn​(x)=τn​(x)1Gn​​,diG​(1Gn+1​​)=1Gn​​(1≤i≤n+1),

and, for every n≥0n\geq0n≥0, 0≤i≤n0\leq i\leq n0≤i≤n, and y∈Xny\in X_ny∈Xn​,

siG(1Gn)=1Gn+1.s_i^G(1_{G_n})=1_{G_{n+1}}.siG​(1Gn​​)=1Gn+1​​.

Degree zero and empty levels of XXX are included.

QAlgorithms.Papers.Independent.Intakenext100.P59.positiveFaceKernel

For any universe uuu and simplicial group GGG whose level groups GmG_mGm​ have underlying types in uuu, this definition assigns a subgroup Km≤GmK_m\le G_mKm​≤Gm​ to every natural number mmm. In degree zero, K0={1G0}K_0=\{1_{G_0}\}K0​={1G0​​}. In degree m=n+1m=n+1m=n+1, for every n≥0n\ge0n≥0, let vm:Gm→G0v_m:G_m\to G_0vm​:Gm​→G0​ be the group homomorphism induced contravariantly by the order-preserving map [0]→[m][0]\to[m][0]→[m] sending its sole element to vertex 000. Then Km=ker⁡(vm)={g∈Gm∣vm(g)=1G0}K_m=\ker(v_m)=\{g\in G_m\mid v_m(g)=1_{G_0}\}Km​=ker(vm​)={g∈Gm​∣vm​(g)=1G0​​}.

QAlgorithms.Papers.Independent.Intakenext100.P59.trivialTwisting

For every simplicial group GGG and simplicial set XXX, with levels in universe uuu, this defines the twisting whose degree-nnn function Xn+1→GnX_{n+1}\to G_nXn+1​→Gn​ sends every element to the identity 1Gn1_{G_n}1Gn​​, for every n≥0n\geq0n≥0, including zero. Here Gn,XnG_n,X_nGn​,Xn​ are the degree-nnn underlying types. Writing did_idi​ and sis_isi​ for the respective face and degeneracy maps, the supplied twisting identities are, for every n≥0n\geq0n≥0 and x∈Xn+2x\in X_{n+2}x∈Xn+2​, d0G(1Gn+1)=1Gn1Gn−1d_0^G(1_{G_{n+1}})=1_{G_n}1_{G_n}^{-1}d0G​(1Gn+1​​)=1Gn​​1Gn​−1​ and diG(1Gn+1)=1Gnd_i^G(1_{G_{n+1}})=1_{G_n}diG​(1Gn+1​​)=1Gn​​ for 1≤i≤n+11\leq i\leq n+11≤i≤n+1; for every 0≤i≤n0\leq i\leq n0≤i≤n and y∈Xn+1y\in X_{n+1}y∈Xn+1​, siG(1Gn)=1Gn+1s_i^G(1_{G_n})=1_{G_{n+1}}siG​(1Gn​​)=1Gn+1​​; and for every z∈Xnz\in X_nz∈Xn​, the value on s0Xzs_0^Xzs0X​z is 1Gn1_{G_n}1Gn​​. Empty levels of XXX are permitted.

QAlgorithms.Papers.Independent.Intakenext100.P59.twistedDegeneracy

For any simplicial group GGG and simplicial set XXX, with degree-kkk underlying types Gk,XkG_k,X_kGk​,Xk​ in universe uuu, every n≥0n\geq0n≥0, every integer iii with 0≤i≤n0\leq i\leq n0≤i≤n, and every pair (g,x)∈Gn×Xn(g,x)\in G_n\times X_n(g,x)∈Gn​×Xn​, this defines a pair in Gn+1×Xn+1G_{n+1}\times X_{n+1}Gn+1​×Xn+1​ by

(g,x)⟼(siGg, siXx),(g,x)\longmapsto \bigl(s_i^Gg,\,s_i^Xx\bigr),(g,x)⟼(siG​g,siX​x),

where siGs_i^GsiG​ and siXs_i^XsiX​ are the respective simplicial degeneracy maps. At n=0n=0n=0 the only index is i=0i=0i=0; empty levels of XXX give no input pairs.

QAlgorithms.Papers.Independent.Intakenext100.P59.twistedFace

Let GGG be any simplicial group and XXX any simplicial set, with levels Gk,XkG_k,X_kGk​,Xk​ in universe uuu, and write diG,diX,siG,siXd_i^G,d_i^X,s_i^G,s_i^XdiG​,diX​,siG​,siX​ for their face and degeneracy maps. Let τ\tauτ consist of functions τk:Xk+1→Gk\tau_k:X_{k+1}\to G_kτk​:Xk+1​→Gk​ satisfying, for every k≥0k\geq0k≥0 and z∈Xk+2z\in X_{k+2}z∈Xk+2​, d0G(τk+1(z))=τk(d1Xz)τk(d0Xz)−1d_0^G(\tau_{k+1}(z))=\tau_k(d_1^Xz)\tau_k(d_0^Xz)^{-1}d0G​(τk+1​(z))=τk​(d1X​z)τk​(d0X​z)−1 and djG(τk+1(z))=τk(dj+1Xz)d_j^G(\tau_{k+1}(z))=\tau_k(d_{j+1}^Xz)djG​(τk+1​(z))=τk​(dj+1X​z) for 1≤j≤k+11\leq j\leq k+11≤j≤k+1; for every y∈Xk+1y\in X_{k+1}y∈Xk+1​ and 0≤j≤k0\leq j\leq k0≤j≤k, sjG(τk(y))=τk+1(sj+1Xy)s_j^G(\tau_k(y))=\tau_{k+1}(s_{j+1}^Xy)sjG​(τk​(y))=τk+1​(sj+1X​y); and for every w∈Xkw\in X_kw∈Xk​, τk(s0Xw)=1Gk\tau_k(s_0^Xw)=1_{G_k}τk​(s0X​w)=1Gk​​. For every n≥0n\geq0n≥0, 0≤i≤n+10\leq i\leq n+10≤i≤n+1, and pair (g,x)∈Gn+1×Xn+1(g,x)\in G_{n+1}\times X_{n+1}(g,x)∈Gn+1​×Xn+1​, the defined face in Gn×XnG_n\times X_nGn​×Xn​ is

{(d0Gg  τn(x), d0Xx),i=0,(diGg, diXx),1≤i≤n+1.\begin{cases} \bigl(d_0^Gg\;\tau_n(x),\,d_0^Xx\bigr),&i=0,\\ \bigl(d_i^Gg,\,d_i^Xx\bigr),&1\leq i\leq n+1. \end{cases}{(d0G​gτn​(x),d0X​x),(diG​g,diX​x),​i=0,1≤i≤n+1.​

The multiplication in the first case has τn(x)\tau_n(x)τn​(x) on the right. Degree zero is included, and if the input level of XXX is empty there are no input pairs.

QAlgorithms.Papers.Independent.Intakenext100.P59.twistedLeft

For any simplicial group GGG and simplicial set XXX, with degree-nnn underlying types Gn,XnG_n,X_nGn​,Xn​ in universe uuu, every natural number nnn, every g∈Gng\in G_ng∈Gn​, and every pair (h,x)∈Gn×Xn(h,x)\in G_n\times X_n(h,x)∈Gn​×Xn​, this defines

(g,(h,x))⟼(gh,x)∈Gn×Xn.(g,(h,x))\longmapsto(gh,x)\in G_n\times X_n.(g,(h,x))⟼(gh,x)∈Gn​×Xn​.

Thus the first coordinate is multiplied on the left by ggg, and the second coordinate is retained. The definition includes n=0n=0n=0; if XnX_nXn​ is empty there are no input pairs.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me