Compact inverse categories -...
Transcript of Compact inverse categories -...
![Page 1: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/1.jpg)
Compact inverse categories
Robin Cockett Chris Heunen
1 / 15
![Page 2: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/2.jpg)
Inverse monoids
Every x has x† with x = xx†x, and x†xy†y = y†yx†x
I any groupI any semilatticeI untyped reversible computationI partial injections on fixed set
2 / 15
![Page 3: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/3.jpg)
(Commutative) inverse monoids
Theorem (Ehresmann-Schein-Nambooripad):{inverse monoids} ' {inductive groupoids}
(groupoid in category of posets,etale for Alexandrov topology,
objects are semilattice)
Theorem (Jarek):{commutative inverse monoids} ' {semilattices of abelian groups}
(functor from a semilattice to category of abelian groups)
3 / 15
![Page 4: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/4.jpg)
(Commutative) inverse monoids
Theorem (Ehresmann-Schein-Nambooripad):{inverse monoids} ' {inductive groupoids}
(groupoid in category of posets,etale for Alexandrov topology,
objects are semilattice)
Theorem (Jarek):{commutative inverse monoids} ' {semilattices of abelian groups}
(functor from a semilattice to category of abelian groups)
3 / 15
![Page 5: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/5.jpg)
Inverse categories
Every f has f † with f = ff †f , and f †fg†g = g†gf †f
I fundamental groupoid of pointed topological spaceI sets and partial injectionsI typed reversible computation
Theorem (DeWolf-Pronk):{inverse categories} ' {locally complete inductive groupoids}
(groupoid in category of posets,etale for Alexandrov topology,
objects are coproduct of semilattices)
4 / 15
![Page 6: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/6.jpg)
Inverse categories
Every f has f † with f = ff †f , and f †fg†g = g†gf †f
I fundamental groupoid of pointed topological spaceI sets and partial injectionsI typed reversible computation
Theorem (DeWolf-Pronk):{inverse categories} ' {locally complete inductive groupoids}
(groupoid in category of posets,etale for Alexandrov topology,
objects are coproduct of semilattices)
4 / 15
![Page 7: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/7.jpg)
Structure theorems
objects general case commutative case
one inductive groupoid semilattice of abelian groupsmany locally inductive groupoid semilattice of compact groupoids
5 / 15
![Page 8: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/8.jpg)
Semilattices of categories
Semilattice is partial order with greatest lower bounds s ∧ t and >
Semilattice over a subcategory V ⊆ Cat is functor F : Sop → Vwhere S is semilattice, all categories F (s) have the same objects
Sop
S′op
VF
F ′
Theorem (Jarek): cInvMon ' SLat[Ab]M 7→ S = {s ∈M | ss† = s}
F (s) = {x ∈M | xx† = s}∐s F (s) ←[ F
6 / 15
![Page 9: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/9.jpg)
Semilattices of categories
Semilattice is partial order with greatest lower bounds s ∧ t and >
Semilattice over a subcategory V ⊆ Cat is functor F : Sop → Vwhere S is semilattice, all categories F (s) have the same objects
Sop
S′op
VF
F ′
Theorem (Jarek): cInvMon ' SLat[Ab]M 7→ S = {s ∈M | ss† = s}
F (s) = {x ∈M | xx† = s}∐s F (s) ←[ F
6 / 15
![Page 10: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/10.jpg)
The one-object case{commutative inverse monoids} ' {one-object compact inverse cats}
Symmetric monoidal, every object has dualη : I → A∗ ⊗A with (ε⊗ 1) ◦ (1⊗ η) = 1 for ε = σ ◦ η†
I A and A∗ adjoint in one-object 2-categoryI any abelian group as discrete monoidal categoryI fundamental groupoid of pointed topological space
=
In any monoidal category:I scalars I → I form commutative monoidI I dual to itself
7 / 15
![Page 11: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/11.jpg)
The one-object case{commutative inverse monoids} ' {one-object compact inverse cats}
Symmetric monoidal, every object has dualη : I → A∗ ⊗A with (ε⊗ 1) ◦ (1⊗ η) = 1 for ε = σ ◦ η†
I A and A∗ adjoint in one-object 2-categoryI any abelian group as discrete monoidal categoryI fundamental groupoid of pointed topological space
=
In any monoidal category:I scalars I → I form commutative monoidI I dual to itself
7 / 15
![Page 12: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/12.jpg)
The one-object case{commutative inverse monoids} ' {one-object compact inverse cats}
Symmetric monoidal, every object has dualη : I → A∗ ⊗A with (ε⊗ 1) ◦ (1⊗ η) = 1 for ε = σ ◦ η†
I A and A∗ adjoint in one-object 2-categoryI any abelian group as discrete monoidal categoryI fundamental groupoid of pointed topological space
=
In any monoidal category:I scalars I → I form commutative monoidI I dual to itself
7 / 15
![Page 13: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/13.jpg)
Compact categoriesI scalar multiplication of f : A→ B with s : I → I
A B
I ⊗A I ⊗B
s • f
' 's⊗ f
fs
I dual morphism of f : A→ B
f∗ = (1⊗ ε) ◦ (1⊗ f ⊗ 1) ◦ (η ⊗ 1) : B∗ → A∗ f
I trace of f : A→ A
Tr(f) = ε ◦ (f ⊗ 1) ◦ η : I → I f
tr(f) = Tr(f)∗
8 / 15
![Page 14: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/14.jpg)
Compact categoriesI scalar multiplication of f : A→ B with s : I → I
A B
I ⊗A I ⊗B
s • f
' 's⊗ f
fs
I dual morphism of f : A→ B
f∗ = (1⊗ ε) ◦ (1⊗ f ⊗ 1) ◦ (η ⊗ 1) : B∗ → A∗ f
I trace of f : A→ A
Tr(f) = ε ◦ (f ⊗ 1) ◦ η : I → I f
tr(f) = Tr(f)∗
8 / 15
![Page 15: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/15.jpg)
Compact categoriesI scalar multiplication of f : A→ B with s : I → I
A B
I ⊗A I ⊗B
s • f
' 's⊗ f
fs
I dual morphism of f : A→ B
f∗ = (1⊗ ε) ◦ (1⊗ f ⊗ 1) ◦ (η ⊗ 1) : B∗ → A∗ f
I trace of f : A→ A
Tr(f) = ε ◦ (f ⊗ 1) ◦ η : I → I f
tr(f) = Tr(f)∗
8 / 15
![Page 16: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/16.jpg)
EndomorphismsLemma: endomorphism f in compact inverse category is tr(f) • 1
Proof :
1. because h = hh†h: = = =
2. gg† and hh† commute: = = =
3. by 1 and 2: = = =
4. therefore: f = f∗ = f∗ = tr(f)
9 / 15
![Page 17: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/17.jpg)
EndomorphismsLemma: endomorphism f in compact inverse category is tr(f) • 1Proof :
1. because h = hh†h: = = =
2. gg† and hh† commute: = = =
3. by 1 and 2: = = =
4. therefore: f = f∗ = f∗ = tr(f)
9 / 15
![Page 18: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/18.jpg)
EndomorphismsLemma: endomorphism f in compact inverse category is tr(f) • 1Proof :
1. because h = hh†h: = = =
2. gg† and hh† commute: = = =
3. by 1 and 2: = = =
4. therefore: f = f∗ = f∗ = tr(f)
9 / 15
![Page 19: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/19.jpg)
EndomorphismsLemma: endomorphism f in compact inverse category is tr(f) • 1Proof :
1. because h = hh†h: = = =
2. gg† and hh† commute: = = =
3. by 1 and 2: = = =
4. therefore: f = f∗ = f∗ = tr(f)
9 / 15
![Page 20: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/20.jpg)
EndomorphismsLemma: endomorphism f in compact inverse category is tr(f) • 1Proof :
1. because h = hh†h: = = =
2. gg† and hh† commute: = = =
3. by 1 and 2: = = =
4. therefore: f = f∗ = f∗ = tr(f)
9 / 15
![Page 21: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/21.jpg)
Arbitrary morphisms
Corollary: compact dagger category is compact inverse category⇐⇒
every morphism f satisfies f = tr(ff †) • f
Proof: =⇒: ff † = tr(ff †ff †) • 1 = tr(ff †) • 1
⇐=: restriction category with f = tr(ff †) • 1every map is restriction isomorphism
10 / 15
![Page 22: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/22.jpg)
Semilattices of groupoids
Theorem: If C is compact inverse category
I S = {s : I → I | ss† = s} is semilatticeI s ∈ S induces compact groupoid F (s) with same objects,
and morphisms F (s)(A,B) = {f : A→ B | tr(ff †) = s}I semilattice F : Sop → CptGpd of compact groupoids
If F : Sop → CptGpd is semilattice of compact groupoids
I inverse category C with same objects as F (>),and morphisms C(A,B) =
∐s∈S F (s)(A,B)
Equivalence CptInvCat ' SLat[CptGpd]
11 / 15
![Page 23: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/23.jpg)
Semilattices of groupoids
Theorem: If C is compact inverse category
I S = {s : I → I | ss† = s} is semilatticeI s ∈ S induces compact groupoid F (s) with same objects,
and morphisms F (s)(A,B) = {f : A→ B | tr(ff †) = s}I semilattice F : Sop → CptGpd of compact groupoids
If F : Sop → CptGpd is semilattice of compact groupoids
I inverse category C with same objects as F (>),and morphisms C(A,B) =
∐s∈S F (s)(A,B)
Equivalence CptInvCat ' SLat[CptGpd]
11 / 15
![Page 24: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/24.jpg)
Semilattices of groupoids
Theorem: If C is compact inverse category
I S = {s : I → I | ss† = s} is semilatticeI s ∈ S induces compact groupoid F (s) with same objects,
and morphisms F (s)(A,B) = {f : A→ B | tr(ff †) = s}I semilattice F : Sop → CptGpd of compact groupoids
If F : Sop → CptGpd is semilattice of compact groupoids
I inverse category C with same objects as F (>),and morphisms C(A,B) =
∐s∈S F (s)(A,B)
Equivalence CptInvCat ' SLat[CptGpd]
11 / 15
![Page 25: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/25.jpg)
2-categories
Redefinition of SLat[V] as 2-category:
Sop
S′op
V
F
F ′
ϕ ϕ′≤ θ′θγ
Write SLat=[V] for full subcategory where all F (s) same objects
Lemma: SLat[CptGpd] ' SLat=[CptGpd](Compare inductive groupoids)
12 / 15
![Page 26: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/26.jpg)
2-categories
Redefinition of SLat[V] as 2-category:
Sop
S′op
V
F
F ′
ϕ ϕ′≤ θ′θγ
Write SLat=[V] for full subcategory where all F (s) same objects
Lemma: SLat[CptGpd] ' SLat=[CptGpd](Compare inductive groupoids)
12 / 15
![Page 27: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/27.jpg)
Compact groupoids
Proposition [Baez-Lauda]: compact groupoids C are, up to ':I abelian group G of isomorphism classes of C under ⊗, I, A∗
I abelian group H of scalars C(I, I) under ◦, 1, f †
I conjugation action G×H → H given by (A, s) 7→ tr(A⊗ s)I 3-cocycle G×G×G→ H given by (A,B,C) 7→ Tr(αA,B,C)
Proof: make C skeletal, strictify everything but associators
Theorem: CptInvCat ' SLat[Cocycle]
13 / 15
![Page 28: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/28.jpg)
Compact groupoids
Proposition [Baez-Lauda]: compact groupoids C are, up to ':I abelian group G of isomorphism classes of C under ⊗, I, A∗
I abelian group H of scalars C(I, I) under ◦, 1, f †
I conjugation action G×H → H given by (A, s) 7→ tr(A⊗ s)I 3-cocycle G×G×G→ H given by (A,B,C) 7→ Tr(αA,B,C)
Proof: make C skeletal, strictify everything but associators
Theorem: CptInvCat ' SLat[Cocycle]
13 / 15
![Page 29: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/29.jpg)
Traced inverse categories
What do traced inverse categories look like?
TrDagCat CptDagCat
TrInvCat
CptInvCat⊥ ⊥
14 / 15
![Page 30: Compact inverse categories - conferences.inf.ed.ac.ukconferences.inf.ed.ac.uk/ct2019/slides/41.pdf · I sets and partial injections I typed reversible computation Theorem (DeWolf-Pronk):](https://reader034.fdocuments.in/reader034/viewer/2022050918/600660aceea406584f647f41/html5/thumbnails/30.jpg)
Open ends
I SLat[V] as completion procedure?
I Bratelli diagrams?
I description internal to Rel?
15 / 15