Execises 3: Coherence spaces and lazy integers

Teacher: Thomas Ehrhard

Recap: about Scott-continuity

Let P,Q be two partially ordered sets.

f:PQ is Scott-continuous:

iff for every directed subset DP such that DP, f(D) exists in Q and f(D)=f(D)

The Scott topology on P:

is the topology whose opens are upper sets (sets upper-closed) that are inaccessible by directed joins (i.e. if D is directed and DO, then DO)


Lemma: f:PQ is Scott-continuous iff it is continuous for the Scott-topology

: Let VQ be an open set. Let’s show that f1(V)P is open.

  • upper set: if xf1(V) and yx, then as f is monotone:

    Vf(x)f(y)as V is an upper-setV
  • inaccessible by directed joins: if D is directed and Df1(V), then if there existed a xf1(V)D, then we would have f(x)Vf(D)= as f(D) is directed, f(D)=f(D)V, but V is inaccessible by directed joins.

: Let DP be a directed set such that DP.

f:Cl(E)Cl(F) monotone is Scott-continuous iff xCl(E),b|F|,bf(x)x0𝒫f(x);bf(x0)



Exercise Sheet: Problem statement

1.

Let f:Cl(E)Cl(F)

Assume f is linear. Let (xi)iICl(E)I such that

  • I is at most countable
  • ijxixj=
  • iIxiCl(E)

Let’s show that f preserves disjointness, compatibility of the family, and preserves the sup of (xi).

  • Disjointness preservation: If ij

    xixjxkCl(E), so xixj, and by conditional multiplicativity and linearity:

    =f()=f(xixj)=f(xi)f(xj)
  • Preserves the sup:

    f(iIxi)=f(JfiniteIjJxj)=continuityJfiniteIf(jJxj)

    since (jJxj)JfI is directed in Cl(E), and

    JfiniteIf(jJxj)=linearityJfiniteIjJf(xj)=iIf(xi)

Conversely, suppose f preserves disjointness, compatibility of the family, and preserves the sup of (xi).

f is monotone

Let xy. As yx is a clique of E and yx and x are disjoint:

f(x)f(x)f(yx)=f(xyx)=f(y)

Scott-continuity of f

Fact: f:Cl(E)Cl(F) monotone is Scott-continuous iff

xCl(E),b|F|,bf(x)x0𝒫f(x);bf(x0)

Scott-continuity: to have a finite approximation in the output, you only need a finite approximation in the input.

Let xCl(E),b|F| such that bf(x).

Then

bf(x)=f(ax{a})=axf({a})

And there exists a singleton {a} that is suitable.

Actually, we have shown:

Lemma:

xCl(E),bf(x),!ax;bf({a})

Uniqueness comes from the fact that if you have two distinct suitable a and a, then as f preserves disjointness bf({a})f({a})=: contradiction.

Conditional multiplicativity

As f is monotone, f(xy)f(x)f(y). So we need to show

f(x)f(y)f(xy) if x,yCl(E) and xyCl(E)

Let bf(x)f(y), then there exists unique ax, ay such that

bf({a})f({a})

So as {a,a}Cl(E) (since xyCl(E)), a=a.

Other conditions

f()= for the empty family

Let x,yCl(E) st xyCl(E). As f is monotone:

f(x)f(y)f(xy)

And conversely:

f(xy)=f(xxy)f(yxy)f(xy)=(f(xxy)f(xy))(f(yxy)f(xy))=f(x)f(y)

2.

2.1.

f:Cl(E1)×Cl(E2)Cl(E1&E2)Cl(F)

Assume f is bilinear, show that it is stable.

Monotone

(x1,x2)(y1,y2){x1y1x2y2 f(x1,x2)f(y1,x2)f(y1,y2)

Continuous

Let D(xi,yi)iI be a directed set.

Then

  • D1(xi)iI directed in Cl(E1)
  • D2(yi)iI directed in Cl(E2)
f(iI(xi,yi))=f(iIxi,iIyi))=linearity ×2iIjIf((xi,yj))D directediIf((xi,yi))

Stable

  • (x1,x2) and (y1,y2) compatible
  • i.e. x1,y1 compatible and x2,y2 compatible
f((x1,x2)(y1,y2))=f((x1,x2))f((x1,y2))f((y1,x2))f((y1,y2))f((x1,x2))f((y1,y2))

Lemma: f:Cl(E)Cl(F) is stable iff f is monotone and

xCl(E),bf(x),x0𝒫f(x);bf(x0) and x0 is minimal: xx,(bf(x)x0x)

and

If f:Cl(E1)×Cl(E2)Cl(F) is separately stable, then it is stable

Bilinear and linear

f((x1,x2)(y1,y2))=f((x1,x2))f((x1,y2))f((y1,x2))f((y1,y2))

So suppose f is linear and bilinear: then for all x1,x2

f((x1,x2))=f((,x2))=f((x1,))=

Example of a function which is bilinear but not linear:

  • E1=E2=F={}
  • f((,))=
  • f((,{}))=
  • f(({},))=
  • f(({},{}))={}

2.2.

You can straightforwardly use the characterisation of question 1, as intersection and union is taken pointwise.

2.3.

f,g:Cl(E)Cl(F) linear: f=ga|E|,f({a})=g({a})

f~ defined on singletons:

f~({(a,b)})=f({a},{b})

Uniqueness:

f1({(a,b)})=f1τ({a},{b})=f2τ({a},{b})=f2({(a,b)})

Leave a comment