Geometry of interaction
(→The Geometry of Interaction as operators: generalities on operators) |
(→Preliminaries: Notation B(H)) |
||
Line 28: | Line 28: | ||
: <math> x = \sum_{n\in\mathbb{N}} x_ne_n</math>. |
: <math> x = \sum_{n\in\mathbb{N}} x_ne_n</math>. |
||
− | In this article we call ''operator'' on <math>H</math> a ''continuous'' linear map from <math>H</math> to <math>H</math>. The continuity allows to define the ''norm'' of an operator <math>u</math> to be the sup on the unit ball of the norms of its values: |
+ | In this article we call ''operator'' on <math>H</math> a ''continuous'' linear map from <math>H</math> to <math>H</math>. The continuity is equivalent to the fact that operators are ''bounded'', which means that one may define the ''norm'' of an operator <math>u</math> as the sup on the unit ball of the norms of its values: |
: <math>\|u\| = \sup_{\{x\in H,\, \|x\| = 1\}}\|u(x)\|</math>. |
: <math>\|u\| = \sup_{\{x\in H,\, \|x\| = 1\}}\|u(x)\|</math>. |
||
+ | |||
+ | The set of (bounded) operators is denoted <math>\mathcal{B}(H)</math>. This is our proof space. |
||
The ''range'' or ''codomain'' of the operator <math>u</math> is the set of images of vectors; the ''kernel'' of <math>u</math> is the set of vectors that are anihilated by <math>u</math>; the ''domain'' of <math>u</math> is the set of vectors orthogonal to the kernel: |
The ''range'' or ''codomain'' of the operator <math>u</math> is the set of images of vectors; the ''kernel'' of <math>u</math> is the set of vectors that are anihilated by <math>u</math>; the ''domain'' of <math>u</math> is the set of vectors orthogonal to the kernel: |
Revision as of 15:32, 28 March 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 (lambda-calculus) didn't interpret a proof of as a morphism from (the space interpreting) A to (the space interpreting) B and proof composition (cut rule) as the composition of morphisms. Rather the proof was interpreted as an operator acting on (the space interpreting) , 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 originally expressed as a feedback equation solved by the execution formula. The execution formula has some formal analogies with Kleene's formula for recursive functions, which allowed to claim that GoI was 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 lambda-calculus. 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 proof-nets 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 lambda-calculus in the Abadi-Gonthier-Lé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 coherent semantics under the name symmetric reducibility. First set a general space in which the interpretations of proofs will live; here, in the case of GoI, the space is the space of bounded operators on .
Second define a suitable duality on this space that will be denoted as . For the GoI, two dualities have proved to work, the first one being nilpotency: two operators u and v are dual if uv is nilpotent, that is, if there is an nonegative integer n such that (uv)^{n} = 0.
Last define a type as a subset T of the proof space that is equal to its bidual: . In the case of GoI this means that iff for all operator v, if , that is if u'v is nilpotent for all , then , that is uv is nilpotent.
It remains now to interpret logical operations, that is 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
We begin by a brief tour of the operations in Hilbert spaces that will be used in the sequel. In this article H will stand for the Hilbert space of sequences of complex numbers such that the series converges. If and are two vectors of H we denote by their scalar product:
- .
Two vectors of H are othogonal if their scalar product is nul. This notion is not to be confused with the orthogonality of operators defined above. 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. Thus if is a sequence in H we have:
- .
In this article we call operator on H a continuous linear map from H to H. The 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:
- .
The set of (bounded) operators is denoted . This is our proof space.
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:
- ;
- ;
- .
These three sets are closed subspaces of H.
The adjoint of an operator u is the operator u^{ * } defined by for any .
A projector is an idempotent operator of norm 1, that is an operator p such that p^{2} = p and . A projector is auto-adjoint and its domain is equal to its codomain.
A partial isometry is an operator u satisfying uu^{ * }u = u; as a consequence uu^{ * } is a projector the range of which is the range of u. Similarly u^{ * }u is also a projector the range of which is the domain of 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 orthogonal and that their direct sum is H.
Partial permutations and partial isometries
It turns out that most of the operators needed to interpret logical operations are generated by partial permutations on the basis, which in particular entails that they are partial isometries.
More precisely a partial permutation on is a function defined on a subset of which is one-to-one 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.
A partial identitie is a partial permutation 1_{D} whose domain and codomain are both equal to a subset D on which 1_{D} is the identity function. Among partial identities one finds the identity on the empty subset, that is the empty map, that we will denote as 0 and the identity on that we will denote 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:
Given a partial permutation one defines a partial isometry by if , 0 otherwise. In other terms if is a sequence in then is the sequence defined by:
- if , 0 otherwise.
The domain of is the subspace spaned by the family and the codomain of is the subspace spaned by . As a particular case if is 1_{D} the partial identity on D then is the projector on the subspace spaned by .
If ψ is another partial permutation then we have:
- .
If is a partial permutation then the adjoint of is:
- .
In particular the projector on the domain of is given by:
- .
and similarly the projector on the codomain of is:
- .
Interpreting the tensor
The first step is, given two types A and B, to construct the type . For this purpose we will define an isomorphism by where and are partial isometries given by:
- p(e_{n}) = e_{2n},
- q(e_{n}) = e_{2n + 1}.
This is actually arbitrary, any two partial isometries p,q with full domain and such that the sum of their codomains is H would do the job.
We shall From the definition p and q have full domain, that is satisfy p^{ * }p = q^{ * }q = 1. On the other hand their codomains are orthogonal, thus we have p^{ * }q = q^{ * }p = 0. Note that we also have pp^{ * } + qq^{ * } = 1 although this property is not needed in the sequel.
Let U be an operator on . We can write U as a matrix:
where each U_{ij} operates on H.
Now through the isomorphism we may transform U into the operator on H defined by:
- .
We call the internalization of U.
Given A and B two types, we define their tensor by:
From what precedes we see that is generated by the internalizations of operators on of the form: