• Aucun résultat trouvé

Interpreting LL pol

Dans le document manuscript (Page 40-43)

2.3 Polarized Linear Logic

2.3.1 LL pol and LLP

2.3.2.4 Interpreting LL pol

In Section2.2.2 we interpreted! as a co-monad on L. Here, we take the point of view of a strong monoidal adjunction between!and the forgetful functorU.

Usually one requires Seely’s isomorphism :

!pNˆMq »!Nb!M. (2.12)

We are going to require the strong monoidality of?instead of!: this is justified in a polarized setting by the fact that the above isomorphisms take place in the category interpreting the negative formulas, while the strong monoidiality of!would be interpreted in the category interpreting the positives formulas. Indeed, as it will ap-pear in Chapters6and7, the negatives formulas are the one interpreted by some complete spaces (completeness in understood in this particular exeample in a wide sense: spaces may be Mackey-complete, or quasi-complete).

Complete spaces play the role of co-domainsF of smooth functionf PC8pE, Fq. Positive one the contrary may not be complete, but may verify other properties preserved by inductive limits : in particular, they may be inter-preted by barreled spaces3.4.22or bornological spaces6.2.13. Thus in a setting rich enough to interpret differenti-ation, and thus with some notion of completeness, negative formulas are interpret as complete spaces, and positive ones as the formulas which need not be complete.

However, in the theory of topological vector spaces, the Seely isomorphism is not true with a non-completed tensor product b. More specifically, when interpreting!E as a space of distribution, the Kernel theorem7.3.5 states this isomorphism for a completed tensor product. It does state the density of4 C8pE,Rq bC8pF,Rqin C8pEˆF,Rqand the fact that the topology induced byC8pEˆF,RqonC8pE,Rq bC8pF,Rqis the injective topology. It is by completing the tensor product that we obtain thus an isomorphism, which is dualized to be stated in the above form2.12.

With these arguments in mind, we want to have an interpretation for !and?such that!N “ ?KLpNKRq, satisfying:

?pPbQq »N ?P`?Q (2.13)

When the composition of the negations is not the identity on the positive (as it is the case in our negative chiralities), we have thus:

p!pNˆMqqKLKR»Pp!NKLb!MKRqKR (2.14) Thus, while Seely’s isomorphism2.12is most of the time described as a linear/non-linear monoidal adjunc-tion [59, Def. 21]:

pN 8,ˆq pP,bq

!

U

%

we ask here for astrongmonoidal adjunction:

pP8,op,‘q pN op,`q

?

U

%

Remark2.3.24. In an unpolarized setting,!is a co-monad: L //L, andN8 is the co-Kleisli categoryL!. For any objectN PN 8we have an isomorphism betweenN andUp!Nq “ !N inN 8: the morphismN //!N corresponds tof “1!N inL, while the morphism!N //N corresponds tog : !!N ÝÝÑd!N !N ÝdÝNÑN. They are indeed inverse from one another inN8:

!g “ f˝!g˝µ!Nby definition of˝! (2.15)

“ !dN ˝!d!N˝µ!N (2.16)

“ !dNby the second commutative diagram for comonads, see2.2.12 (2.17) However, inN8 the second commutative diagram for comonads say that!dN andd!N are the same arrow: they both act as a unit for the composition˝!, and thus are equal by the unicity of units. Moreover, we have:

!f “ dN˝d!Ng˝µN “ dN.

Thusgandf are inverse one another, andN »N8 Up!Nqthe adjunction between!andU results in fact in a closure onN 8. Likewise, the adjunction between?andU (another functor denoted byU, as it is thought as a forgetful functor) is a closure onP8.

Definition 2.3.25. A classical model ofLLpolconsists in

• A negative chiralitypP,b,1qandpN ,`,Kqwith a strong monoidal left closurep´qKL :P //Nop % p´qKR :N op //P,with a polarized closure´:N //P %ˆ:P //N suchˆ˝´ “ IdN,

• A cartesian structure onN pN ,ˆ,Jqsuch thatˆis distributive over`

• A co-cartesian categorypP8,‘8,08qand a co-cartesian categorypN 88,J8qwith a strong monoidal left closure

p´qKL,8:P8 //N 8,op% p´qKR,8:N 8,op //P8.

4In the context of topological vector spaces we have a biproduct and in particularEˆF»EF

• A strong monoidal right closure adjunction

? :pP8,op,‘,0q //pN op,`,1q %U :pNop,`,1q //pP8,op,‘,Jq.

• A family of isomorphisms inP:

closP :´PKL » pˆPqKR natural inP.

Then asˆ´»IdN » p´KLqKRone has the isomorphisms´ˆP »PKLKR. Interpreting the exponential connectives

Proposition 2.3.26. We define a strong monoidal functor frompN8,ˆqtopP,bqby

!N “ ?˝UpNKRqKR

!` “ ?˝Up`KRqKR. We interpret the formula?PforPPPas5?UˆP.

Proof. It follows from the fact that,we have a closure betweenN 8andP8,op, that isp´qKL,8˝p´qKR,8 “ IdN8. Remark2.3.27. The previously defined model is calledclassicalas the double-negation is asked to be the identity on negatives. However, this definition would also suits an intuitionist setting by not asking the negation to define a closure. Then!as defined above would not necessarily be a strong monoidal functor betweenpN8,ˆqandpP,bq.

The algebra structure of? Let us detail how the exponential rules are interpreted in this context, following the pattern detailed in Definition2.3.21. From the strong monoidality of!, one has natural isomorphisms inN :

mKP,Q: ?P`?Q»?pP‘Qq m0: ?0» K

If we denote by∇P :P‘P //Pthe co-diagonal, then we obtain as previously, see2.4:

cP : ?P`?P //?P wP :K //?P

These define natural transformations which interprets respectively the contraction and weakening rules, by precomposition.

Interpreting the dereliction rule By definition, the co-unit of the adjunction

? :pP8,op,‘,0q //pN op,`,1q %U :pN op,`,1q //pP8,op,‘,Jq is a natural transformationdKN PN opp?UpNq, Nqwhich interprets the dereliction. We denote by

dN :N //?UpNq

the morphism corresponding todKN inN via the isomorphismN opp?UpNq, Nq »N pN,?UpNqq.

Thus consider a morphismf PNpPKR, Mqinterpreting the proof of$M, P. One constructs the interpreta-tion of the proof of$M,?P as the morphismf˜PN pˆ1, M`?UpˆPqq »N pˆp1b p?UpˆPqqKL:

ˆp1b p?UpˆPqqKL ˆpdˆPq

KL

ÝÝÝÝÝÝшppˆPqKLq »ˆ´PKL »PKRÝÑf M Promotion is interpreted as before by functoriality of!andU.

5We need to apply a shift toPbefore constructing!Pbecause of our categorical definitions. In a interpretation where?NKrepresents the space of smooth scalar functionsC8pN,Rq, it amounts of saying that one needs a complete domain to define smoothness.

Dans le document manuscript (Page 40-43)