Graphical reasoning in symmetric monoidal categories

giantsneckspiffyΗλεκτρονική - Συσκευές

13 Οκτ 2013 (πριν από 3 χρόνια και 8 μήνες)

62 εμφανίσεις

Graphical reasoning
in symmetric monoidal categories
Lucas Dixon,University of Edinburgh
Joint work with:Ross Duncan and Aleks Kissinger,University of Oxford
5 Nov 2009
Lucas Dixon
Graphical reasoningin symmetric monoidal categories
5 Nov 2009
1
Outline

Motivation:characterise processes (quantum computation)

Symmetric Monoidal Categories and Graphs

Example with boolean circuits

Extended graphs,Matching and Plugging

Inductive patterns of graphs with!-boxes
Lucas Dixon
Graphical reasoningin symmetric monoidal categories
5 Nov 2009
2
Symmetric Monoidal Categories (SMC)

C is a monoidal category:it has associative and unital bifunctor ⊗:

⊗ operation on objects:X ⊗Y;and specific identity object I
(⊗ is associative and has I as identify)

⊗ operation on morphisms:if f:X →Y and g:X
￿
→Y
￿
then (f ⊗g):(X ⊗X
￿
) →(Y ⊗Y
￿
)
(associative and has identity id)

Braided:has ‘braiding’ isomorphisms:σ
X,Y
:X ⊗Y →Y ⊗X.

Symmetric:σ
X,Y
◦ σ
Y,X
= id.
Lucas Dixon
Graphical reasoningin symmetric monoidal categories
5 Nov 2009
3
Typed Graphs = SMC
X ⊗X
￿
Y ⊗Y
￿
f ⊗g
￿
X ⊗X
￿
f ⊗g
Y ⊗Y
￿
￿
X X
￿
f ⊗g
￿
￿
Y Y
￿
￿
￿
Category Theory ⇒swap edges and vertices ⇒tensor is spacial

already the generic way to draw processes,e.g.circuits:
Vertices are operations
and
Edges are objects
,

Coherence conditions provide correctness for graphical notation:
equality for graph = equality for SMC
Lucas Dixon
Graphical reasoningin symmetric monoidal categories
5 Nov 2009
4
Graphical Representation
f ⊗g:=
f
g
g ◦ f:=
f
g

We can express the bifunctoriality of ⊗ and the symmetric braiding of σ as:
f
g
=
f
g
f
g
=
f
g
Lucas Dixon
Graphical reasoningin symmetric monoidal categories
5 Nov 2009
5
Example:Boolean Circuits
Values:B = {0,1};Operations:N:B ⊗B →B,C:B →B ⊗B,⊥:B →1
1
￿
0
￿
1
￿
0
￿
N
￿
￿
￿
C
￿
￿
￿

￿
Out 1 Out 0 In 1 In 0 Nand Copy Ignore
Symmetric monoidal categories composition of diagrams;need additional
equational structure to describe equivalences between circuits...
Lucas Dixon
Graphical reasoningin symmetric monoidal categories
5 Nov 2009
6
Example:Boolean Circuit Graphical Equations
0
X
N
￿
￿
Y
￿
=
X
1

￿
Y
￿
X
1
X
2
N
￿
￿

￿
=
X
1
X
2

￿

￿
1
1
N
￿
￿
Y
￿
=
0
Y
￿
0
C
￿
Y
1
￿
Y
2
￿
=
0
0
Y
1
￿
Y
2
￿
Lucas Dixon
Graphical reasoningin symmetric monoidal categories
5 Nov 2009
7
Graphical Reasoning:

Goal:
to develop suitable formalism for reasoning about equational structure in
symmetric monoidal categories.

Based on SMC as graphs.

Incident edges to a vertex define its type

‘subject reduction’:rewriting preserves types

rewriting and plugging commute (plugging doesn’t break matching)

reason with common inductive structures
Lucas Dixon
Graphical reasoningin symmetric monoidal categories
5 Nov 2009
8
Graphs

Directed graph:
E
s
￿
t
￿
V
Any number of edges are allowed between vertices (not a binary relation)

G = (G
E
,G
V
,s,t);E = G
E
;V = G
V
;in(v):= t
−1
(v);out(v):= s
−1
(v)

graph morphism (graphs:G,H) f
E
:E
G
→E
H
and f
V
:V
G
→V
H
where:
s
H
◦ f
E
= f
V
◦ s
G
t
H
◦ f
E
= f
V
◦ t
G
Lucas Dixon
Graphical reasoningin symmetric monoidal categories
5 Nov 2009
9
Extended Open Graphs

Extended open graph:(G,X)
X ⊆ V (exterior);Int G = V\X (interior)

Exterior vertices define an interface (hierarchical)
a subgraph has the same character as a vertex

Morphismof open graphs:f:(G,G
X
) →(H,H
X
) (only map to H
X
fromG
X
)
∀v ∈ V
G
.f
V
(v) ∈ ∂H ⇒v ∈ ∂G

Strict Morphism:f:(G,G
X
) →(H,H
X
) (no extra interior edges)
∀e ∈ E
H
.s
H
(e) ∈ f
V
(Int G) ∨t
H
(e) ∈ f
V
(Int G) ⇒∃e
￿
∈ E
G
.f
E
(e
￿
) = e.

There is also a topological interpretation:morphisms as continuous maps
Lucas Dixon
Graphical reasoningin symmetric monoidal categories
5 Nov 2009
10
Matching for Extended Graphs

Relaxed subgraph:cut and relaxed

cut an edge:introduce two-clique new exterior vertices

cut a vertex:throw away data,make exterior

relax a vertex:makes incidence 1 ‘loving’ vertex-cliques of exterior vertex

love:relation between cliques of exterior vertices

G ≤ H (Gmatches H) = ∃f which is an open graph morphismfroma relaxed
G to a relaxed subgraph of H,such that (it is an exact embedding):
1.
f is a strict love morphism;(locally preserves type)
2.
f
E
and f
V
are injective;(mapped 1-1 in subgraph)
3.
∀v ∈ V
G
.f
V
(v) ∈ ∂H ⇔v ∈ ∂G (exact X map)
Lucas Dixon
Graphical reasoningin symmetric monoidal categories
5 Nov 2009
11
Matching Example 1






cut vertex relax vertex cut edge
Lucas Dixon
Graphical reasoningin symmetric monoidal categories
5 Nov 2009
12
Matching Example 2
G relax(G) H
￿
an open-subgraph relax(H) H
of relax(H)

Efficient algorithm by graph traversal:

relaxation built in

cuts implicit by left-over graph.
Lucas Dixon
Graphical reasoningin symmetric monoidal categories
5 Nov 2009
13
Composing Graphs:a picture
Plugging of G and H via the two-sided e-graph π with embeddings p
1
and p
2
.
Lucas Dixon
Graphical reasoningin symmetric monoidal categories
5 Nov 2009
14
Composing Graphs:Plugging

((π,π
X
),(F,B)) a graph,π,with π
V
= π
X
and partition of π
V
into F and B

Pair of embeddings:p
1
:(π,π
X
) →(G,G
X
) and p
2
:(π,π
X
) →(H,H
X
)
such that p
1
(F) ⊆ X and p
2
(B) ⊆ Y

plugging,π
p
1
p
2
(G,H),defined by pushout:
π

p
1
￿
G
H
p
2
￿

￿
π
p
1
p
2
￿
(G,H)
(minimal graph matched by both G and H where the two π’s are identified)

Properties:π(G,H)

= π(H,G);G ≤
e
π(G,H) and H ≤
e
π(G,H);
K ≤
e
G implies K ≤
e
π(G,H);
Lucas Dixon
Graphical reasoningin symmetric monoidal categories
5 Nov 2009
15
Representing Inductive Families of Graphs
...X
n
1

￿
￿
X
n

￿
￿
Y
￿
=
X
1
...X
n

￿
￿
Y
￿

Want a higher level language to capture such repeated structure;allow
rewriting etc
Lucas Dixon
Graphical reasoningin symmetric monoidal categories
5 Nov 2009
16
!-Box Graphs
!-Box Graphs
= (G,B) where B is a disjoint set of subsets of G
V
(draw a box around elements of each member of B)
!-Box Matching
:G matches H:(H ∈ G closed under:
copy
:copy subgraph including incident edges some number of times
drop
:removes the!-box,keep the contents.
merge
:combines two!-boxes:{B
1
,B
2
,...} →{(B
1
∪B
2
),...}.
Semantics
:
￿G￿
!
subset of matches that have no!-boxes.
Lucas Dixon
Graphical reasoningin symmetric monoidal categories
5 Nov 2009
17
!-Box Graphs:Example
A:

copy B:

merge C:

drop D:
Example showing how A matches D
Lucas Dixon
Graphical reasoningin symmetric monoidal categories
5 Nov 2009
18
Conclusions

Symmetric monoidal categories have a natural graphical presentation

Many processes form SMCs with extra equational structure

High level language for processes motivates!-boxes to capture inductive
structure (ellipsis notation)

Initial goal was to reason about quantuminformation;also has applications to
traditional circuits

Developed a formalism for equational reasoning over graph-based
representations of symmetric monoidal categories

Implementation:http://dream.inf.ed.ac.uk/projects/quantomatic
Lucas Dixon
Graphical reasoningin symmetric monoidal categories
5 Nov 2009