Lawvere–Tierney topology

From testwiki
Jump to navigation Jump to search

Template:Short description In mathematics, a Lawvere–Tierney topology is an analog of a Grothendieck topology for an arbitrary elementary topos, used to construct a topos of sheaves. A Lawvere–Tierney topology is also sometimes also called a local operator or coverage or topology or geometric modality. They were introduced by Template:Harvs and Myles Tierney.

Definition

If E is a topos, then a topology on E is a morphism j from the subobject classifier Ω to Ω such that j preserves truth (j∘true=true), preserves intersections (j∘∧=∧∘(j×j)), and is idempotent (j∘j=j).

j-closure

Commutative diagrams showing how j-closure operates. Ω and t are the subobject classifier. χs is the characteristic morphism of s as a subobject of A and j∘χs is the characteristic morphism of s¯ which is the j-closure of s. The bottom two squares are pullback squares and they are contained in the top diagram as well: the first one as a trapezoid and the second one as a two-square rectangle.

Given a subobject s:S↣A of an object A with classifier χs:A→Ω, then the composition j∘χs defines another subobject s¯:S¯↣A of A such that s is a subobject of s¯, and s¯ is said to be the j-closure of s.

Some theorems related to j-closure are (for some subobjects s and w of A):

  • inflationary property: s⊆s¯
  • idempotence: s¯≡s¯¯
  • preservation of intersections: s∩w‾≡s¯∩w¯
  • preservation of order: s⊆w⟹s¯⊆w¯
  • stability under pullback: f−1(s)‾≡f−1(s¯).

Examples

  • Grothendieck topologies on a small category C are essentially the same as Lawvere–Tierney topologies on the topos of presheaves of sets over C.
  • Lawvere–Tierney topologies on the effective topos generalize the notion of an oracle in computability theory.Template:R

Internal point of view

The statement that a morphism j:Ω→Ω is a Lawvere–Tierney topology can be expressed purely in the internal language of the elementary topos. Indeed, a rephrasing of the definition is that j is a Lawvere–Tierney topology when the following three conditions are satisfied internally:

  1. j(⊤)=⊤
  2. ∀p:Ω,j(j(p))⇔j(p)
  3. ∀pq:Ω,j(p∧q)⇔j(p)∧j(q)

An equivalent definition uses the following three conditions instead:Template:R

  1. ∀pq:Ω,(p⇒q)⇒(j(p)⇒j(q))
  2. ∀p:Ω,p⇒j(p)
  3. ∀p:Ω,j(j(p))⇒j(p)

This reveals that a Lawvere–Tierney topology is the same as a monad on the set of truth values Ω partially ordered by implication, viewed as a posetal category. In particular, another equivalent definition is by the following conditions, which follow the standard convention of defining monads in functional programming by the ret and bind operators:

  1. ∀p:Ω,p⇒j(p)
  2. ∀pq:Ω,(p⇒j(q))⇒(j(p)⇒j(q))

The second condition can be informally stated as: to prove a proposition of the form j(q), one can without loss of generality replace any hypothesis j(p) with just p.

References

  1. ↑ Template:NLab Cite error: <ref> tag with name "nlab" defined in <references> is not used in prior text.
  2. ↑ Template:Cite journal Cite error: <ref> tag with name "kihara" defined in <references> is not used in prior text.