Geometry of interaction
m (references fixed) 
m (typos, style) 

Line 1:  Line 1:  
The ''geometry of interaction'', GoI in short, was defined in the early nineties by Girard as an interpretation of linear logic into operators algebra: formulae were interpreted by Hilbert spaces and proofs by partial isometries. 
The ''geometry of interaction'', GoI in short, was defined in the early nineties by Girard as an interpretation of linear logic into operators algebra: formulae were interpreted by Hilbert spaces and proofs by partial isometries. 

−  This was a striking novelty as it was the first time that a mathematical model of logic (lambdacalculus) didn't interpret a proof of <math>A\limp B</math> as a morphism ''from'' <math>A</math> ''to'' <math>B</math><ref>to be precise one should say from ''the space interpreting'' <math>A</math> to the space interpreting'' <math>B</math></ref>and proof composition (cut rule) as the composition of morphisms. Rather the proof was interpreted as an operator acting ''on'' <math>A\limp B</math>, that is a morphism from <math>A\limp B</math> to <math>A\limp B</math>. For proof composition the problem was then, given an operator on <math>A\limp B</math> and another one on <math>B\limp C</math> to construct a new operator on <math>A\limp C</math>. This problem was solved by the ''execution formula'' that bares some formal analogies with Kleene's formula for recursive functions. For this reason GoI was claimed to be an ''operational semantics'', as opposed to traditionnal [[Semanticsdenotational semantics]]. 
+  This was a striking novelty as it was the first time that a mathematical model of logic (lambdacalculus) didn't interpret a proof of <math>A\limp B</math> as a morphism ''from'' <math>A</math> ''to'' <math>B</math> and proof composition (cut rule) as the composition of morphisms. Rather the proof was interpreted as an operator acting ''on'' <math>A\limp B</math>, that is a morphism from <math>A\limp B</math> to <math>A\limp B</math>. For proof composition the problem was then, given an operator on <math>A\limp B</math> and another one on <math>B\limp C</math> to construct a new operator on <math>A\limp C</math>. This problem was solved by the ''execution formula'' that bares some formal analogies with Kleene's formula for recursive functions. For this reason GoI was claimed to be an ''operational semantics'', as opposed to traditionnal [[Semanticsdenotational semantics]]. 
The first instance of the GoI was restricted to the <math>MELL</math> fragment of linear logic (Multiplicative and Exponential fragment) which is enough to encode lambdacalculus. Since then Girard proposed several improvements: firstly the extension to the additive connectives known as ''Geometry of Interaction 3'' and more recently a complete reformulation using Von Neumann algebras that allows to deal with some aspects of [[Light linear logicsimplicit complexity]] 
The first instance of the GoI was restricted to the <math>MELL</math> fragment of linear logic (Multiplicative and Exponential fragment) which is enough to encode lambdacalculus. Since then Girard proposed several improvements: firstly the extension to the additive connectives known as ''Geometry of Interaction 3'' and more recently a complete reformulation using Von Neumann algebras that allows to deal with some aspects of [[Light linear logicsimplicit complexity]] 

−  The GoI has been a source of inspiration for various authors. Danos and Regnier have reformulated the original model exhibiting its combinatorial nature using a theory of reduction of paths in proofnets and showing the link with abstract machines; in particular the execution formula appears as the composition of two automata that interact one with the other through their common interface. Also the execution formula has rapidly been understood as expressing the composition of strategies in game semantics. It has been used in the theory of sharing reduction for lambdacalculus in the AbadiGonthierLévy reformulation and simplification of Lamping's representation of sharing. Finally the original GoI for the <math>MELL</math> fragment has been reformulated in the framework of traced monoidal categories following an idea originally proposed by Joyal. 
+  The GoI has been a source of inspiration for various authors. Danos and Regnier have reformulated the original model exhibiting its combinatorial nature using a theory of reduction of paths in proofnets and showing the link with abstract machines; the execution formula appears as the composition of two automata interacting through a common interface. Also the execution formula has rapidly been understood as expressing the composition of strategies in game semantics. It has been used in the theory of sharing reduction for lambdacalculus in the AbadiGonthierLévy reformulation and simplification of Lamping's representation of sharing. Finally the original GoI for the <math>MELL</math> fragment has been reformulated in the framework of traced monoidal categories following an idea originally proposed by Joyal. 
= The Geometry of Interaction as operators = 
= The Geometry of Interaction as operators = 

−  The original construction of GoI by Girard follows a general pattern already mentionned in [[coherent semantics]] under the name ''symmetric reducibility'' and that was first put to use in [[phase semantics]]. First set a general space <math>P</math> called the ''proof space'' because this is where the interpretations of proofs will live. Make sure that <math>P</math> is a (not necessarily commutative) monoid. In the case of GoI, the proof space is a subset of the space of bounded operators on <math>\ell^2</math>. 
+  The original construction of GoI by Girard follows a general pattern already mentionned in the section on [[coherent semantics]] under the name ''symmetric reducibility'' and that was first put to use in [[phase semantics]]. First set a general space <math>P</math> called the ''proof space'' because this is where the interpretations of proofs will live. Make sure that <math>P</math> is a (not necessarily commutative) monoid. In the case of GoI, the proof space is a subset of the space of bounded operators on <math>\ell^2</math>. 
Second define a particular subset of <math>P</math> that will be denoted by <math>\bot</math>; then derive a duality on <math>P</math>: for <math>u,v\in P</math>, <math>u</math> and <math>v</math> are dual<ref>In modern terms one says that <math>u</math> and <math>v</math> are ''polar''.</ref>iff <math>uv\in\bot</math>. 
Second define a particular subset of <math>P</math> that will be denoted by <math>\bot</math>; then derive a duality on <math>P</math>: for <math>u,v\in P</math>, <math>u</math> and <math>v</math> are dual<ref>In modern terms one says that <math>u</math> and <math>v</math> are ''polar''.</ref>iff <math>uv\in\bot</math>. 

−  For the GoI, two dualities have proved to work; we will consider the first one: nilpotency, ''ie'', <math>\bot</math> is the set of nilpotent operators in <math>P</math>. Let us explicit this: two operators <math>u</math> and <math>v</math> are dual if there is a nonegative integer <math>n</math> such that <math>(uv)^n = 0</math>. Note in particular that <math>uv\in\bot</math> iff <math>vu\in\bot</math>. 
+  For the GoI, two dualities have proved to work; we will consider the first one: nilpotency, ''ie'', <math>\bot</math> is the set of nilpotent operators in <math>P</math>. Let us explicit this: two operators <math>u</math> and <math>v</math> are dual if there is a nonegative integer <math>n</math> such that <math>(uv)^n = 0</math>. This duality is symmetric: if <math>uv</math> is nilpotent then <math>vu</math> is nilpotent also. 
When <math>X</math> is a subset of <math>P</math> define <math>X\orth</math> as the set of elements of <math>P</math> that are dual to all elements of <math>X</math>: 
When <math>X</math> is a subset of <math>P</math> define <math>X\orth</math> as the set of elements of <math>P</math> that are dual to all elements of <math>X</math>: 

Line 28:  Line 28:  
== Preliminaries == 
== Preliminaries == 

+  
+  === Operators, partial isometries === 

We will denote by <math>H</math> the Hilbert space <math>\ell^2(\mathbb{N})</math> of sequences <math>(x_n)_{n\in\mathbb{N}}</math> of complex numbers such that the series <math>\sum_{n\in\mathbb{N}}x_n^2</math> converges. If <math>x = (x_n)_{n\in\mathbb{N}}</math> and <math>y = (y_n)_{n\in\mathbb{N}}</math> are two vectors of <math>H</math> their ''scalar product'' is: 
We will denote by <math>H</math> the Hilbert space <math>\ell^2(\mathbb{N})</math> of sequences <math>(x_n)_{n\in\mathbb{N}}</math> of complex numbers such that the series <math>\sum_{n\in\mathbb{N}}x_n^2</math> converges. If <math>x = (x_n)_{n\in\mathbb{N}}</math> and <math>y = (y_n)_{n\in\mathbb{N}}</math> are two vectors of <math>H</math> their ''scalar product'' is: 

Line 70:  Line 72:  
If the domain of <math>u</math> is <math>H</math> that is if <math>u^* u = 1</math> we say that <math>u</math> has ''full domain'', and similarly for codomain. If <math>u</math> and <math>v</math> are two partial isometries, the equation <math>uu^* + vv^* = 1</math> means that the codomains of <math>u</math> and <math>v</math> are disjoint but their direct sum is <math>H</math>. 
If the domain of <math>u</math> is <math>H</math> that is if <math>u^* u = 1</math> we say that <math>u</math> has ''full domain'', and similarly for codomain. If <math>u</math> and <math>v</math> are two partial isometries, the equation <math>uu^* + vv^* = 1</math> means that the codomains of <math>u</math> and <math>v</math> are disjoint but their direct sum is <math>H</math>. 

−  === Partial permutations and partial isometries === 
+  === Partial permutations === 
We will now define our proof space which turns out to be the set of partial isometries acting as permutations on the canonical basis <math>(e_n)_{n\in\mathbb{N}}</math>. 
We will now define our proof space which turns out to be the set of partial isometries acting as permutations on the canonical basis <math>(e_n)_{n\in\mathbb{N}}</math>. 

Line 82:  Line 84:  
Partial permutations are well known to form a structure of ''inverse monoid'' that we detail now. 
Partial permutations are well known to form a structure of ''inverse monoid'' that we detail now. 

−  A ''partial identitie'' is a partial permutation <math>1_D</math> whose domain and codomain are both equal to a subset <math>D</math> on which <math>1_D</math> is the identity function. Partial identities are idempotent for composition. 
+  Given a a subset <math>D</math> of <math>\mathbb{N}</math>, the ''partial identity'' on <math>D</math> is the partial permutation <math>\varphi</math> defined by: 
+  * <math>D_\varphi = D</math>; 

+  * <math>\varphi(n) = n</math> for any <math>n\in D_\varphi</math>. 

+  Thus the codomain of <math>\varphi</math> is <math>D</math>. 

+  
+  The partial identity on <math>D</math> will be denoted by <math>1_D</math>. Partial identities are idempotent for composition. 

Among partial identities one finds the identity on the empty subset, that is the empty map, that we will denote by <math>0</math> and the identity on <math>\mathbb{N}</math> that we will denote by <math>1</math>. This latter permutation is the neutral for composition. 
Among partial identities one finds the identity on the empty subset, that is the empty map, that we will denote by <math>0</math> and the identity on <math>\mathbb{N}</math> that we will denote by <math>1</math>. This latter permutation is the neutral for composition. 

Line 90:  Line 92:  
: <math>\varphi^{1}\circ\varphi = 1_{D_\varphi}</math> 
: <math>\varphi^{1}\circ\varphi = 1_{D_\varphi}</math> 

: <math>\varphi\circ\varphi^{1} = 1_{C_\varphi}</math> 
: <math>\varphi\circ\varphi^{1} = 1_{C_\varphi}</math> 

+  
+  === The proof space === 

Given a partial permutation <math>\varphi</math> one defines a partial isometry <math>u_\varphi</math> by: 
Given a partial permutation <math>\varphi</math> one defines a partial isometry <math>u_\varphi</math> by: 

Line 105:  Line 109:  
The domain of <math>u_\varphi</math> is the subspace spanned by the family <math>(e_n)_{n\in D_\varphi}</math> and the codomain of <math>u_\varphi</math> is the subspace spanned by <math>(e_n)_{n\in C_\varphi}</math>. In particular if <math>\varphi</math> is <math>1_D</math> then <math>u_\varphi</math> is the projector on the subspace spanned by <math>(e_n)_{n\in D}</math>. 
The domain of <math>u_\varphi</math> is the subspace spanned by the family <math>(e_n)_{n\in D_\varphi}</math> and the codomain of <math>u_\varphi</math> is the subspace spanned by <math>(e_n)_{n\in C_\varphi}</math>. In particular if <math>\varphi</math> is <math>1_D</math> then <math>u_\varphi</math> is the projector on the subspace spanned by <math>(e_n)_{n\in D}</math>. 

+  
+  {{Definition 

+  We call ''<math>p</math>isometry'' a partial isometry of the form <math>u_\varphi</math> where <math>\varphi</math> is a partial permutation on <math>\mathbb{N}</math>. The ''proof space'' <math>\mathcal{P}</math> is the set of all <math>p</math>isometries. 

+  }} 

{{Proposition 
{{Proposition 

Line 119:  Line 127:  
: <math>u^*_\varphi u_\varphi = u_{1_{C_\varphi}}</math>. 
: <math>u^*_\varphi u_\varphi = u_{1_{C_\varphi}}</math>. 

−  Projectors generated by partial identities commute: 
+  If <math>p</math> is a projector in <math>\mathcal{P}</math> then there is a partial identity <math>1_D</math> such that <math>p= u_{1_D}</math>. 
+  
+  Projectors commute, in particular we have: 

: <math>u_\varphi u_\varphi^*u_\psi u_\psi^* = u_\psi u_\psi^*u_\varphi u_\varphi^*</math>. 
: <math>u_\varphi u_\varphi^*u_\psi u_\psi^* = u_\psi u_\psi^*u_\varphi u_\varphi^*</math>. 

}} 
}} 

−  Note that this entails all the other commutations of projectors: <math>u^*_\varphi u_\varphi u_\psi u^*\psi = u_\psi u^*_\psi u^*_\varphi u_\varphi</math> and <math>u^*_\varphi u_\varphi u^*_\psi u\psi = u^*_\psi u_\psi u^*_\varphi u_\varphi</math>. 

−  {{Definition 
+  Note that this entails all the other commutations of projectors: <math>u^*_\varphi u_\varphi u_\psi u^*_\psi = u_\psi u^*_\psi u^*_\varphi u_\varphi</math> and <math>u^*_\varphi u_\varphi u^*_\psi u\psi = u^*_\psi u_\psi u^*_\varphi u_\varphi</math>. 
−  We call ''<math>p</math>isometry'' a partial isometry of the form <math>u_\varphi</math> where <math>\varphi</math> is a partial permutation on <math>\mathbb{N}</math>. The ''proof space'' <math>\mathcal{P}</math> is the set of all <math>p</math>isometries. 

−  }} 

In particular note that <math>0</math> is a <math>p</math>isometry. The set <math>\mathcal{P}</math> is a submonoid of <math>\mathcal{B}(H)</math> but it is not a subalgebra.<ref><math>\mathcal{P}</math> is the normalizing groupoid of the maximal commutative subalgebra of <math>\mathcal{B}(H)</math> consisiting of all operators ''diagonalizable'' in the canonical basis.</ref>In general given <math>u,v\in\mathcal{P}</math> we don't necessarily have <math>u+v\in\mathcal{P}</math>. However we have: 
In particular note that <math>0</math> is a <math>p</math>isometry. The set <math>\mathcal{P}</math> is a submonoid of <math>\mathcal{B}(H)</math> but it is not a subalgebra.<ref><math>\mathcal{P}</math> is the normalizing groupoid of the maximal commutative subalgebra of <math>\mathcal{B}(H)</math> consisiting of all operators ''diagonalizable'' in the canonical basis.</ref>In general given <math>u,v\in\mathcal{P}</math> we don't necessarily have <math>u+v\in\mathcal{P}</math>. However we have: 
Revision as of 08:25, 30 April 2010
The geometry of interaction, GoI in short, was defined in the early nineties by Girard as an interpretation of linear logic into operators algebra: formulae were interpreted by Hilbert spaces and proofs by partial isometries.
This was a striking novelty as it was the first time that a mathematical model of logic (lambdacalculus) didn't interpret a proof of as a morphism from A to B and proof composition (cut rule) as the composition of morphisms. Rather the proof was interpreted as an operator acting on , that is a morphism from to . For proof composition the problem was then, given an operator on and another one on to construct a new operator on . This problem was solved by the execution formula that bares some formal analogies with Kleene's formula for recursive functions. For this reason GoI was claimed to be an operational semantics, as opposed to traditionnal denotational semantics.
The first instance of the GoI was restricted to the MELL fragment of linear logic (Multiplicative and Exponential fragment) which is enough to encode lambdacalculus. Since then Girard proposed several improvements: firstly the extension to the additive connectives known as Geometry of Interaction 3 and more recently a complete reformulation using Von Neumann algebras that allows to deal with some aspects of implicit complexity
The GoI has been a source of inspiration for various authors. Danos and Regnier have reformulated the original model exhibiting its combinatorial nature using a theory of reduction of paths in proofnets and showing the link with abstract machines; the execution formula appears as the composition of two automata interacting through a common interface. Also the execution formula has rapidly been understood as expressing the composition of strategies in game semantics. It has been used in the theory of sharing reduction for lambdacalculus in the AbadiGonthierLévy reformulation and simplification of Lamping's representation of sharing. Finally the original GoI for the MELL fragment has been reformulated in the framework of traced monoidal categories following an idea originally proposed by Joyal.
Contents

The Geometry of Interaction as operators
The original construction of GoI by Girard follows a general pattern already mentionned in the section on coherent semantics under the name symmetric reducibility and that was first put to use in phase semantics. First set a general space P called the proof space because this is where the interpretations of proofs will live. Make sure that P is a (not necessarily commutative) monoid. In the case of GoI, the proof space is a subset of the space of bounded operators on .
Second define a particular subset of P that will be denoted by ; then derive a duality on P: for , u and v are dual^{[1]}iff .
For the GoI, two dualities have proved to work; we will consider the first one: nilpotency, ie, is the set of nilpotent operators in P. Let us explicit this: two operators u and v are dual if there is a nonegative integer n such that (uv)^{n} = 0. This duality is symmetric: if uv is nilpotent then vu is nilpotent also.
When X is a subset of P define as the set of elements of P that are dual to all elements of X:
 .
This construction has a few properties that we will use without mention in the sequel. Given two subsets X and Y of P we have:
 if then ;
 ;
 .
Last define a type as a subset T of the proof space that is equal to its bidual: . This means that iff for all operator , that is such that for all , we have .
The real work^{[2]}is now to interpret logical operations, that is to associate a type to each formula, an object to each proof and show the adequacy lemma: if u is the interpretation of a proof of the formula A then u belongs to the type associated to A.
Preliminaries
Operators, partial isometries
We will denote by H the Hilbert space of sequences of complex numbers such that the series converges. If and are two vectors of H their scalar product is:
 .
Two vectors of H are othogonal if their scalar product is nul. We will say that two subspaces are disjoint when any two vectors taken in each subspace are orthorgonal. Note that this notion is different from the set theoretic one, in particular two disjoint subspaces always have exactly one vector in common: 0.
The norm of a vector is the square root of the scalar product with itself:
 .
Let us denote by the canonical hilbertian basis of H: where δ_{kn} is the Kroenecker symbol: δ_{kn} = 1 if k = n, 0 otherwise. Thus if is a sequence in H we have:
 .
An operator on H is a continuous linear map from H to H.^{[3]}The set of (bounded) operators is denoted by .
The range or codomain of the operator u is the set of images of vectors; the kernel of u is the set of vectors that are anihilated by u; the domain of u is the set of vectors orthogonal to the kernel, ie, the maximal subspace disjoint with the kernel:
 ;
 ;
 .
These three sets are closed subspaces of H.
The adjoint of an operator u is the operator u^{ * } defined by for any . Adjointness is well behaved w.r.t. composition of operators:
 (uv)^{ * } = v^{ * }u^{ * }.
A projector is an idempotent operator of norm 0 (the projector on the null subspace) or 1, that is an operator p such that p^{2} = p and or 1. A projector is autoadjoint and its domain is equal to its codomain.
A partial isometry is an operator u satisfying uu^{ * }u = u; this condition entails that we also have u^{ * }uu^{ * } = u^{ * }. As a consequence uu^{ * } and uu^{ * } are both projectors, called respectively the initial and the final projector of u because their (co)domains are respectively the domain and the codomain of u:
 Dom(u^{ * }u) = Codom(u^{ * }u) = Dom(u);
 Dom(uu^{ * }) = Codom(uu^{ * }) = Codom(u).
The restriction of u to its domain is an isometry. Projectors are particular examples of partial isometries.
If u is a partial isometry then u^{ * } is also a partial isometry the domain of which is the codomain of u and the codomain of which is the domain of u.
If the domain of u is H that is if u^{ * }u = 1 we say that u has full domain, and similarly for codomain. If u and v are two partial isometries, the equation uu^{ * } + vv^{ * } = 1 means that the codomains of u and v are disjoint but their direct sum is H.
Partial permutations
We will now define our proof space which turns out to be the set of partial isometries acting as permutations on the canonical basis .
More precisely a partial permutation on is a onetoone map defined on a subset of onto a subset of . is called the domain of and its codomain. Partial permutations may be composed: if ψ is another partial permutation on then is defined by:
 iff and ;
 if then ;
 the codomain of is the image of the domain: .
Partial permutations are well known to form a structure of inverse monoid that we detail now.
Given a a subset D of , the partial identity on D is the partial permutation defined by:
 ;
 for any .
Thus the codomain of is D.
The partial identity on D will be denoted by 1_{D}. Partial identities are idempotent for composition.
Among partial identities one finds the identity on the empty subset, that is the empty map, that we will denote by 0 and the identity on that we will denote by 1. This latter permutation is the neutral for composition.
If is a partial permutation there is an inverse partial permutation whose domain is and who satisfies:
The proof space
Given a partial permutation one defines a partial isometry by:
In other terms if is a sequence in then is the sequence defined by:
 if , 0 otherwise.
We will (not so abusively) write when is undefined so that the definition of reads:
 .
The domain of is the subspace spanned by the family and the codomain of is the subspace spanned by . In particular if is 1_{D} then is the projector on the subspace spanned by .
Definition
We call pisometry a partial isometry of the form where is a partial permutation on . The proof space is the set of all pisometries.
Proposition
Let and ψ be two partial permutations. We have:
 .
The adjoint of is:
 .
In particular the initial projector of is given by:
 .
and the final projector of is:
 .
If p is a projector in then there is a partial identity 1_{D} such that .
Projectors commute, in particular we have:
 .
Note that this entails all the other commutations of projectors: and .
In particular note that 0 is a pisometry. The set is a submonoid of but it is not a subalgebra.^{[4]}In general given we don't necessarily have . However we have:
Proposition
Let . Then iff u and v have disjoint domains and disjoint codomains, that is:
 iff uu^{ * }vv^{ * } = u^{ * }uv^{ * }v = 0.
Proof. Suppose for contradiction that e_{n} is in the domains of u and v. There are integers p and q such that u(e_{n}) = e_{p} and v(e_{n}) = e_{q} thus (u + v)(e_{n}) = e_{p} + e_{q} which is not a basis vector; therefore u + v is not a ppermutation.
As a corollary note that if u + v = 0 then u = v = 0.
From operators to matrices: internalization/externalization
It will be convenient to view operators on H as acting on , and conversely. For this purpose we define an isomorphism by where and are partial isometries given by:
 p(e_{n}) = e_{2n},
 q(e_{n}) = e_{2n + 1}.
From the definition p and q have full domain, that is satisfy p^{ * }p = q^{ * }q = 1. On the other hand their codomains are disjoint, thus we have p^{ * }q = q^{ * }p = 0. As the sum of their codomains is the full space H we also have pp^{ * } + qq^{ * } = 1.
Note that we have choosen p and q in . However the choice is arbitrary: any two pisometries with full domain and disjoint codomains would do the job.
Given an operator u on H we may externalize it obtaining an operator U on defined by the matrix:
where the u_{ij}'s are given by:
 u_{11} = p^{ * }up;
 u_{12} = p^{ * }uq;
 u_{21} = q^{ * }up;
 u_{22} = q^{ * }uq.
The u_{ij}'s are called the external components of u. The externalization is functorial in the sense that if v is another operator externalized as:
then the externalization of uv is UV.
As pp^{ * } + qq^{ * } = 1 we have:
 u = (pp^{ * } + qq^{ * })u(pp^{ * } + qq^{ * }) = pu_{11}p^{ * } + pu_{12}q^{ * } + qu_{21}p^{ * } + qu_{22}q^{ * }
which entails that externalization is reversible, its converse being called internalization.
If we suppose that u is a pisometry then so are the components u_{ij}'s. Thus the formula above entails that the four terms of the sum have pairwise disjoint domains and pairwise disjoint codomains from which we deduce:
Proposition
If u is a pisometry and u_{ij} are its external components then:
 u_{1j} and u_{2j} have disjoint domains, that is for j = 1,2;
 u_{i1} and u_{i2} have disjoint codomains, that is for i = 1,2.
As an example of computation in let us check that the product of the final projectors of pu_{11}p^{ * } and pu_{12}q^{ * } is null:
where we used the fact that all projectors in commute, which is in particular the case of pp^{ * } and u^{ * }pp^{ * }u.
Interpreting the multiplicative connectives
Recall that when u and v are pisometries we say they are dual when uv is nilpotent, and that denotes the set of nilpotent operators. A type is a subset of that is equal to its bidual. In particular is a type for any . We say that X generates the type .
The tensor and the linear application
If u and v are two pisometries summing them doesn't in general produces a pisometry. However as pup^{ * } and qvq^{ * } have disjoint domains and disjoint codomains it is true that pup^{ * } + qvq^{ * } is a pisometry. Given two types A and B, we thus define their tensor by:
Note the closure by bidual to make sure that we obtain a type.
From what precedes we see that is generated by the internalizations of operators on of the form:
Remark: This socalled tensor resembles a sum rather than a product. We will stick to this terminology though because it defines the interpretation of the tensor connective of linear logic.
The linear implication is derived from the tensor by duality: given two types A and B the type is defined by:
 .
Unfolding this definition we get:
 .
The identity
Given a type A we are to find an operator ι in type , thus satisfying:
 .
An easy solution is to take ι = pq^{ * } + qp^{ * }. In this way we get ι(pup^{ * } + qvq^{ * }) = qup^{ * } + pvq^{ * }. Therefore (ι(pup^{ * } + qvq^{ * }))^{2} = quvq^{ * } + pvup^{ * }, from which one deduces that this operator is nilpotent iff uv is nilpotent. It is the case since u is in A and v in .
It is interesting to note that the ι thus defined is actually the internalization of the operator on given by the matrix:
 .
We will see once the composition is defined that the ι operator is the interpretation of the identity proof, as expected.
The execution formula, version 1: application
Definition
Let u and v be two operators; as above denote by u_{ij} the external components of u. If u_{11}v is nilpotent we define the application of u to v by:
App(u,v) = u_{22} + u_{21}v  ∑  (u_{11}v)^{k}u_{12} 
k 
.
Note that the hypothesis that u_{11}v is nilpotent entails that the sum
∑  (u_{11}v)^{k} 
k 
is actually finite. It would be enough to assume that this sum converges. For simplicity we stick to the nilpotency condition, but we should mention that weak nilpotency would do as well.
Theorem
If u and v are pisometries such that u_{11}v is nilpotent, then App(u,v) is also a pisometry.
Proof. Let us note E_{k} = u_{21}v(u_{11}v)^{k}u_{12}. Recall that u_{22} and u_{12} being external components of the pisometry u, they have disjoint domains. Thus it is also the case of u_{22} and E_{k}. Similarly u_{22} and E_{k} have disjoint codomains because u_{22} and u_{21} have disjoint codomains.
Let now k and l be two integers such that k > l and let us compute for example the intersection of the codomains of E_{k} and E_{l}:
As k > l we may write . Let us note so that . We have:
because u_{11} and u_{12} have disjoint codomains, thus .
Similarly we can show that E_{k} and E_{l} have disjoint domains. Therefore we have proved that all terms of the sum App(u,v) have disjoint domains and disjoint codomains. Consequently App(u,v) is a pisometry.
Theorem
Let A and B be two types and u a pisometry. Then the two following conditions are equivalent:
 ;
 for any we have:
 u_{11}v is nilpotent and
 .
Proof. Let v and w be two pisometries. If we compute
we get a finite sum of monomial operators of the form:
 ,
 or
 ,
for all tuples of (nonnegative) integers such that .
Each of these monomial is a pisometry. Furthermore they have disjoint domains and disjoint codomains because their sum is the pisometry (u.(pvp^{ * } + qwq^{ * }))^{n}. This entails that (u.(pvp^{ * } + qwq^{ * }))^{n} = 0 iff all these monomials are null.
Suppose u_{11}v is nilpotent and consider:
 .
Developping we get a finite sum of monomials of the form:
 5.
for all tuples such that and k_{i} is less than the degree of nilpotency of u_{11}v for all i.
Again as these monomials are pisometries and their sum is the pisometry (App(u,v)w)^{n}, they have pairwise disjoint domains and pairwise disjoint codomains. Note that each of these monomial is equal to q^{ * }Mq where M is a monomial of type 4 above.
As before we thus have that iff all monomials of type 5 are null.
Suppose now that and . Then, since (0 belongs to any type) u.(pvp^{ * }) = pu_{11}vp^{ * } is nilpotent, thus u_{11}v is nilpotent.
Suppose further that . Then u.(pvp^{ * } + qwq^{ * }) is nilpotent, thus there is a N such that (u.(pvp^{ * } + qwq^{ * }))^{n} = 0 for any . This entails that all monomials of type 1 to 4 are null. Therefore all monomials appearing in the developpment of (App(u,v)w)^{N} are null which proves that App(u,v)w is nilpotent. Thus .
Conversely suppose for any and , u_{11}v and App(u,v)w are nilpotent. Let P and N be their respective degrees of nilpotency and put n = N(P + 1) + N. Then we claim that all monomials of type 1 to 4 appearing in the development of (u.(pvp^{ * } + qwq^{ * }))^{n} are null.
Consider for example a monomial of type 1:
with . Note that m must be even.
If for some then thus our monomial is null. Otherwise if i_{2k} < P for all k we have:
thus:
 .
Now if then . Otherwise thus
 .
Since N is the degree of nilpotency of App(u,v)w we have that the monomial:
is null, thus also the monomial of type 1 we started with.
Corollary
If A and B are types then we have:
 .
As an example if we compute the application of the interpretation of the identity ι in type to the operator then we have:
 .
Now recall that ι = pq^{ * } + qp^{ * } so that ι_{11} = ι_{22} = 0 and ι_{12} = ι_{21} = 1 and we thus get:
 App(ι,v) = v
as expected.
The tensor rule
Let now A,A',B and B' be types and consider two operators u and u' respectively in and . We define an operator denoted by by:
Once again the notation is motivated by linear logic syntax and is contradictory with linear algebra practice since what we denote by actually is the internalization of the direct sum .
Indeed if we think of u and u' as the internalizations of the matrices:
 and
then we may write:
Thus the components of are given by:
 .
and we see that is actually the internalization of the matrix:
We are now to show that if we suppose uand u' are in types and , then is in . For this we consider v and v' in respectively in A and A', so that pvp^{ * } + qv'q^{ * } is in , and we show that .
Since u and u' are in and we have that App(u,v) and App(u',v') are respectively in B and B', thus:
 .
We know that both u_{11}v and u'_{11}v' are nilpotent. But we have:
Therefore is nilpotent. So we can compute :
thus lives in .
Other monoidal constructions
Contraposition
Let A and B be some types; we have:
Indeed, means that for any v and w in respectively A and we have which is exactly the definition of .
We will denote the operator:
where u_{ij} is given by externalization. Therefore the externalization of is:
 where is defined by .
From this we deduce that and that .
Commutativity
Let σ be the operator:
 σ = ppq^{ * }q^{ * } + pqp^{ * }q^{ * } + qpq^{ * }p^{ * } + qqp^{ * }p^{ * }.
One can check that σ is the internalization of the operator S on defined by: . In particular the components of σ are:
 σ_{11} = σ_{22} = 0;
 σ_{12} = σ_{21} = pq^{ * } + qp^{ * }.
Let A and B be types and u and v be operators in A and B. Then pup^{ * } + qvq^{ * } is in and as σ_{11}.(pup^{ * } + qvq^{ * }) = 0 we may compute:
But , thus we have shown that:
 .
Distributivity
We get distributivity by considering the operator:
 δ = ppp^{ * }p^{ * }q^{ * } + pqpq^{ * }p^{ * }q^{ * } + pqqq^{ * }q^{ * } + qppp^{ * }p^{ * } + qpqp^{ * }q^{ * }p^{ * } + qqq^{ * }q^{ * }p^{ * }
that is similarly shown to be in type for any types A, B and C.
Weak distributivity
We can finally get weak distributivity thanks to the operators:
 δ_{1} = pppp^{ * }q^{ * } + ppqp^{ * }q^{ * }q^{ * } + pqq^{ * }q^{ * }q^{ * } + qpp^{ * }p^{ * }p^{ * } + qqpq^{ * }p^{ * }p^{ * } + qqqq^{ * }p^{ * } and
 δ_{2} = ppp^{ * }p^{ * }q^{ * } + pqpq^{ * }p^{ * }q^{ * } + pqqq^{ * }q^{ * } + qppp^{ * }p^{ * } + qpqp^{ * }q^{ * }p^{ * } + qqq^{ * }q^{ * }p^{ * }.
Given three types A, B and C then one can show that:
 δ_{1} has type and
 δ_{2} has type .
Execution formula, version 2: composition
Let A, B and C be types and u and v be operators respectively in types and .
As usual we will denote u_{ij} and v_{ij} the operators obtained by externalization of u and v, eg, u_{11} = p^{ * }up, ...
As u is in we have that ; similarly as , thus , we have . Thus u_{22}v_{11} is nilpotent.
We define the operator Comp(u,v) by:
This is well defined since u_{11}v_{22} is nilpotent. As an example let us compute the composition of u and ι in type ; recall that ι_{ij} = δ_{ij}, so we get:
 Comp(u,ι) = pu_{11}p^{ * } + pu_{12}q^{ * } + qu_{21}p^{ * } + qu_{22}q^{ * } = u
Similar computation would show that Comp(ι,v) = v (we use pp^{ * } + qq^{ * } = 1 here).
Coming back to the general case we claim that Comp(u,v) is in : let a be an operator in A. By computation we can check that:
 App(Comp(u,v),a) = App(v,App(u,a)).
Now since u is in , App(u,a) is in B and since v is in , App(v,App(u,a)) is in C.
If we now consider a type D and an operator w in then we have:
 Comp(Comp(u,v),w) = Comp(u,Comp(v,w)).
Putting together the results of this section we finally have:
Theorem
Let GoI(H) be defined by:
 objects are types, ie sets A of operators satisfying: ;
 morphisms from A to B are operators in type ;
 composition is given by the formula above.
Then GoI(H) is a starautonomous category.
The Geometry of Interaction as an abstract machine
Notes and references
 ↑ In modern terms one says that u and v are polar.
 ↑ The difficulty is to find the right duality that will make logical operations interpretable. General conditions that allows to achieve this have been formulated by Hyland and Schalk thanks to their theory of double gluing.
 ↑ Continuity is equivalent to the fact that operators are bounded, which means that one may define the norm of an operator u as the sup on the unit ball of the norms of its values:
 .
 ↑ is the normalizing groupoid of the maximal commutative subalgebra of consisiting of all operators diagonalizable in the canonical basis.