Personal tools

User:Michiexile/MATH198/Lecture 10

From HaskellWiki

Jump to: navigation, search

IMPORTANT NOTE: THESE NOTES ARE STILL UNDER DEVELOPMENT. PLEASE WAIT UNTIL AFTER THE LECTURE WITH HANDING ANYTHING IN, OR TREATING THE NOTES AS READY TO READ.

This lecture will be shallow, and leave many things undefined, hinted at, and is mostly meant as an appetizer, enticing the audience to go forth and seek out the literature on topos theory for further studies.

Contents

1 Subobject classifier

One very useful property of the category Set is that the powerset of a given set is still a set; we have an internal concept of object of all subobjects. Certainly, for any category (small enough) C, we have a contravariant functor Sub(-): C\to Set taking an object to the set of all equivalence classes of monomorphisms into that object; with the image Sub(f) given by the pullback diagram

SubobjectFunctorMorphismPullback.png

If the functor Sub( − ) is representable - meaning that there is some object X\in C_0 such that Sub( − ) = hom( − ,X) - then the theory surrounding representable functors, connected to the Yoneda lemma - give us a number of good properties.

One of them is that every representable functor has a universal element; a generalization of the kind of universal mapping properties we've seen in definitions over and over again during this course; all the definitions that posit the unique existence of some arrow in some diagram given all other arrows.

Thus, in a category with a representable subobject functor, we can pick a representing object \Omega\in C_0, such that Sub(X) = hom(X,Ω). Furthermore, picking a universal element corresponds to picking a subobject \Omega_0\hookrightarrow\Omega such that for any object A and subobject A_0\hookrightarrow A, there is a unique arrow \chi: A\to\Omega such that there is a pullback diagram

SubobjectClassifierPullback.png

One can prove that Ω0 is terminal in C, and we shall call Ω the subobject classifier, and this arrow \Omega_0=1\to\Omega true. The arrow χ is called the characteristic arrow of the subobject.

In Set, all this takes on a familiar tone: the subobject classifier is a 2-element set, with a true element distinguished; and a characteristic function of a subset takes on the true value for every element in the subset, and the other (false) value for every element not in the subset.

2 Defining topoi

Definition A topos is a cartesian closed category with all finite limits and with a subobject classifier.

It is worth noting that this is a far stronger condition than anything we can even hope to fulfill for the category of Haskell types and functions. The functional proogramming relevance will take a back seat in this lecture, in favour of usefulness in logic and set theory replacements.

3 Properties of topoi

The meat is in the properties we can prove about topoi, and in the things that turn out to be topoi.

Theorem Let E be a topos.

  • E has finite colimits.

3.1 Power object

Since a topos is closed, we can take exponentials. Specifically, we can consider [A\to\Omega]. This is an object such that hom(B,[A\to\Omega]) = hom(A\times B, \Omega) = Sub(A\times B). Hence, we get an internal version of the subobject functor. (pick B to be the terminal object to get a sense for how global elements of [A\to\Omega] correspond to subobjects of A)

3.2 Internal logic

We can use the properties of a topos to develop a logic theory - mimicking the development of logic by considering operations on subsets in a given universe:

Classically, in Set, and predicate logic, we would say that a predicate is some function from a universe to a set of truth values. So a predicate takes some sort of objects, and returns either True or False.

Furthermore, we allow the definition of sets using predicates:

\{x\in U: P(x)\}

Looking back, though, there is no essential difference between this, and defining the predicate as the subset of the universe directly; the predicate-as-function appears, then, as the characteristic function of the subset. And types are added as easily - we specify each variable, each object, to have a set it belongs to.

This way, predicates really are subsets. Type annotations decide which set the predicate lives in. And we have everything set up in a way that open sup for the topos language above.

We'd define, for predicates P,Q acting on the same type:

\{x\in A : \top\} = A
\{x\in A : \bot\} = \emptyset
\{x : (P \wedge Q)(x)\} = \{x : P(x)\} \cap \{x : Q(x)\}
\{x : (P \vee Q)(x)\} = \{x : P(x)\} \cup \{x : Q(x)\}
\{x\in A : (\neg P)(x) \} = A \setminus \{x\in A : P(x)\}

We could then start to define primitive logic connectives as set operations; the intersection of two sets is the set on which both the corresponding predicates hold true, so \wedge = \cap. Similarily, the union of two sets is the set on which either of the corresponding predicates holds true, so \vee = \cup. The complement of a set, in the universe, is the negation of the predicate, and all other propositional connectives (implication, equivalence, ...) can be built with conjunction (and), disjunction (or) and negation (not).

So we can mimic all these in a given topos:

We say that a universe U is just an object in a given topos.

A predicate is a subobject of the universe.


Conjunction: Given predicates P,Q, we need to define the conjunction P\wedge Q as some P\wedge Q: U\to\Omega that corresponds to both P and Q simultaneously.

We can construct pullback diagrams

File:ToposConjunctionPart1.png File:ToposConjunctionPart2.png

in which u = \chi_P\times\chi_Q. Furthermore, the arrow Failed to parse (unknown function\true): true\times\true: 1\to\Omega\times\Omega

is monic, and thus has a classifier \wedge:\Omega\times\Omega\to\Omega.

Now, we define P\wedge Q as the composition \wedge\circ\chi_P\times\chi_Q, and observe that P\wedge Q classifies the intersection P\cap Q.

Implication: Next we define \leq_1 to be the equalizer of \wedge and proj1. Given v\times w: T\to\Omega\times\Omega, we write v\leq_1 w if v\times w factors through \leq_1.

Using the definition of an equalizer we arrive at v\leq_1 w iff v = v\wedge w. From this, we can deduce

u\leq_1 true
u\leq_1 u
If u\leq_1 v and v\leq_1 w then u\leq_1 w.
If u\leq_1 v and v\leq_1 u then u = v

and thus, \leq_1 is a partial order on [T\to\Omega]. Intuitively, u\leq_1 v if v is at least as true as u.

This relation corresponds to inclusion on subobjects. Note that \leq_1:\Omega_1\to\Omega\times\Omega, given from the equalizer, gives us Ω1 as a relation on Ω - a subobject of \Omega\times\Omega. Specifically, it has a classifying arrow \Rightarrow:\Omega\times\Omega\to\Omega. We write h\Rightarrow k = \Rightarrow\circ h\times k. And for subobjects P,Q\subseteq A, we write P\Rightarrow Q for the subobject classified by \chi_P\Rightarrow\chi_Q.

It turns out, without much work, that this P\Rightarrow Q behaves just like classical implication in its relationship to \wedge.

Membership: We can internalize the notion of membership as a subobject \in^A\subseteq A\times\Omega^A, and thus get the membership relation from a pullback:

ToposMembershipPullback.png

For generalized elements x\times h: T\to A\times\Omega^A, we write x\in^A h<math> for <math>x\times h\in\in^A. Both notations indicate ev_A\circ h\times x = true.

Universal quantification: For any object A, the maximal subobject of A is A itself, embedded with 1A into itself. Thus, we have an arrow t_A:1\to\Omega^A representing this subobject. Being a map from 1, it is specifically monic, so it has a classifying arrow \forall_A:\Omega^A\to\Omega that takes a given subobject of A to true precisely if it is in fact the maximal subobject.

Now, with a relation r:R\to B\times A, we define \forall a. R by the following pullback:

ToposForallPullback.png

where λχr comes from the universal property of the exponential.

Theorem For any s:S\to B monic, S\subseteq \forall a.R iff S\times A\subseteq R.

This theorem tells us that the subobject given by \forall a.R is the largest subobject of B that is related by R to all of A.

Falsum: We can define the false truth value using these tools as \forall w\in\Omega.w. This might be familiar to the more advanced Haskell type hackers - as the type

x :: forall a. a
which has to be able to give us an element of any type, regardless of the type itself. And in Haskell, the only element that inhabits all types is
undefined
.

From a logical perspective, we use a few basic inference rules:

ToposTrivialSequent.png ToposForallConnective.png ToposSubstitution.png

and connect them up to derive

*
\forall w.w : \forall w.w
\forall w.w : w
\forall w.w : \phi

for any φ not involving w - and we can always adjust any φ to avoid w.

Thus, the formula \forall w.w has the property that it implies everything - and thus is a good candidate for the false truth value; since the inference

ToposExFalsoQuodlibet.png

is the defining introduction rule for false.


Negation: We define negation the same way as in classical logic: \neg \phi = \phi \Rightarrow false.


Disjunction: We can define

P\vee Q = \forall w. ((\phi\Rightarrow w)\wedge(\psi\Rightarrow w))\Rightarrow w

Note that this definition uses one of our primary inference rules:

ToposDisjunctionConnective.png

as the defining property for the disjunction, and we may derive any properties we like from these.

Existential quantifier: Finally, the existential quantifier is derived similarly to the disjunction - by figuring out a rule we want it to obey, and using that as a definition for it:

\exists x.\phi = \forall w. (\forall x. \phi \Rightarrow w)\Rightarrow w

Here, the rule we use as defining property is

File:ToposExistentsConnective.png

Before we leave this exploration of logic, some properties worth knowing about: While we can prove \neg(\phi\wedge\neg\phi) and \phi\Rightarrow\neg\neg\phi, we cannot, in just topos logic, prove things like

\neg(\phi\wedge\psi)\Rightarrow(\neg\phi\vee\neg\psi)
\neg\neg\phi\Rightarrow\phi

nor any statements like

\neg(\forall x.\neg\phi)\Rightarrow(\exists x.\phi)
\neg(\forall x.\phi)\Rightarrow(\exists x.\neg\phi)
\neg(\exists x.\neg\phi)\Rightarrow(\forall x.\phi)

We can, though, prove

\neg(\exists x.\phi)\Rightarrow(\forall x.\neg\phi)

If we include, extra, an additional inference rule (called the Boolean negation rule) given by

BooleanNegation.png

then suddenly we're back in classical logic, and can prove \neg\neg\phi\Rightarrow\phi and \phi\or\neg\phi.

3.3 Examples

3.4 Sheaves, topology and time sheaves

4 Exercises

No homework at this point. However, if you want something to think about, a few questions and exercises:

  1. blah