nLab theory of G-torsors

Contents

Context

Type theory

natural deduction metalanguage, practical foundations

  1. type formation rule
  2. term introduction rule
  3. term elimination rule
  4. computation rule

type theory (dependent, intensional, observational type theory, homotopy type theory)

syntax object language

computational trinitarianism =
propositions as types +programs as proofs +relation type theory/category theory

logicset theory (internal logic of)category theorytype theory
propositionsetobjecttype
predicatefamily of setsdisplay morphismdependent type
proofelementgeneralized elementterm/program
cut rulecomposition of classifying morphisms / pullback of display mapssubstitution
introduction rule for implicationcounit for hom-tensor adjunctionlambda
elimination rule for implicationunit for hom-tensor adjunctionapplication
cut elimination for implicationone of the zigzag identities for hom-tensor adjunctionbeta reduction
identity elimination for implicationthe other zigzag identity for hom-tensor adjunctioneta conversion
truesingletonterminal object/(-2)-truncated objecth-level 0-type/unit type
falseempty setinitial objectempty type
proposition, truth valuesubsingletonsubterminal object/(-1)-truncated objecth-proposition, mere proposition
logical conjunctioncartesian productproductproduct type
disjunctiondisjoint union (support of)coproduct ((-1)-truncation of)sum type (bracket type of)
implicationfunction set (into subsingleton)internal hom (into subterminal object)function type (into h-proposition)
negationfunction set into empty setinternal hom into initial objectfunction type into empty type
universal quantificationindexed cartesian product (of family of subsingletons)dependent product (of family of subterminal objects)dependent product type (of family of h-propositions)
existential quantificationindexed disjoint union (support of)dependent sum ((-1)-truncation of)dependent sum type (bracket type of)
logical equivalencebijection setobject of isomorphismsequivalence type
support setsupport object/(-1)-truncationpropositional truncation/bracket type
n-image of morphism into terminal object/n-truncationn-truncation modality
equalitydiagonal function/diagonal subset/diagonal relationpath space objectidentity type/path type
completely presented setsetdiscrete object/0-truncated objecth-level 2-type/set/h-set
setset with equivalence relationinternal 0-groupoidBishop set/setoid with its pseudo-equivalence relation an actual equivalence relation
equivalence class/quotient setquotientquotient type
inductioncolimitinductive type, W-type, M-type
higher inductionhigher colimithigher inductive type
-0-truncated higher colimitquotient inductive type
coinductionlimitcoinductive type
presettype without identity types
set of truth valuessubobject classifiertype of propositions
domain of discourseuniverseobject classifiertype universe
modalityclosure operator, (idempotent) monadmodal type theory, monad (in computer science)
linear logic(symmetric, closed) monoidal categorylinear type theory/quantum computation
proof netstring diagramquantum circuit
(absence of) contraction rule(absence of) diagonalno-cloning theorem
synthetic mathematicsdomain specific embedded programming language

homotopy levels

semantics

Contents

Idea

Given a group GG\;, the theory of G-torsors is the logical theory whose models in a category π’ž\mathcal{C} are the G-torsors.

Definition

Let GG be a group. The theory of G-torsors 𝕋 G\mathbb{T}_G is the geometric theory over the signature with one sort UU, a set of unary functions symbols g∈G{g\in G} and the following axiom scheme:

⊀ ⊒(g ig j)u=g i(g ju)for allg i,g j ⊀ ⊒(βˆƒu)⊀(U is inhabited) g iu=g ju ⊒βŠ₯for all pairsg iβ‰ g j(G acts freely) ⊀ βŠ’β‹ g∈Ggx=y(G acts transitively). \begin{aligned} \top & \vdash (g_i g_j)u=g_i(g_j u)\quad\text{for all}\; g_i,g_j \\ \top&\vdash (\exists u)\; \top \quad\text{(U is inhabited)} \\ g_{i}u = g_{j}u &\vdash \bot\quad \text{for all pairs}\;g_i\neq g_j\quad\text{(G acts freely)} \\ \top &\vdash \bigvee_{g\in G} gx=y\quad \text{(G acts transitively)}\quad . \end{aligned}

Properties

Let GG be a group in SetSet and β„°\mathcal{E} be a Grothendieck topos with Ξ”βŠ£Ξ“:β„°β†’Set\Delta\dashv \Gamma:\mathcal{E}\to Set. Recall that a G-torsor over β„°\mathcal{E} is defined as an object TT of β„°\mathcal{E} together with a left action ΞΌ:Ξ”(G)Γ—Tβ†’T\mu:\Delta(G)\times T\to T such that Tβ†’1T\to 1 is epi and ΞΌ\mu induces an isomorphism (ΞΌ,Ο€ 2):Ξ”(G)Γ—Tβ†’TΓ—T(\mu,\pi_2):\Delta(G)\times T\to T \times T.

The category of models of 𝕋 G\mathbb{T}_G in β„°\mathcal{E} is the category Tor(β„°,G)Tor(\mathcal{E},G) of G-torsors over β„°\mathcal{E} and, furthermore, Tor(β„°,G)β‰…Hom Top(β„°,Set G op)Tor(\mathcal{E},G)\cong Hom_{Top}(\mathcal{E},Set^{G^{op}}) i.e. Set G opSet^{G^{op}} is the classifying topos Set[𝕋 G]Set[\mathbb{T}_G] of 𝕋 G\mathbb{T}_G.

It is a standard fact that Boolean presheaf toposes correspond precisely to toposes Set 𝒒 opSet^{\mathcal{G}^{op}} of actions of groupoids 𝒒\mathcal{G} whereas toposes Set G opSet^{G^{op}} of group actions correspond to the connected toposes among these whence the toposes of the form Set G opSet^{G^{op}} can be characterized as the connected Boolean presheaf toposes.

This affords a logical characterization of 𝕋 G\mathbb{T}_G as a complete Boolean theory of presheaf type since Boolean presheaf toposes are atomic and atomic toposes are connected precisely when they are two-valued which is equivalent to the completeness of the classified theory (See at two-valued topos and theory of presheaf type for the logical terminology). To sum up: toposes Set G opSet^{G^{op}} of group actions are up to equivalence precisely the classifying toposes of complete Boolean theories of presheaf type.1

References

The syntactic theory is explicitly stated p.42 in

  • F. William Lawvere, Variable sets etendu and variable structure in topoi , Lecture notes University of Chicago 1975.

The β€œsemantic” side was well known to the Grothendieck school and its elements are nicely exposed e.g. in section VIII.2 of


  1. Looking at 𝕋 G\mathbb{T}_G it seems reasonable to conjecture that the toposes of finite group actions correspond precisely to the classifying toposes of the finitely presentable complete Boolean theories of presheaf type i.e. those with finitely many function symbols and a finite list of axioms. ↩

Last revised on August 31, 2023 at 14:41:26. See the history of this page for a list of all contributions to it.