A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Introduction to Topos Theory

Research Depth 93 in the knowledge graph ☐ I know this ☆ Set as goal
546prerequisites beneath it
See this on the map →
Cartesian Closed CategoriesPresheaves+6 more→
topos elementary topos Grothendieck topos subobject classifier internal logic sheaf category

Core Idea

An elementary topos is a category that behaves like a generalized universe of sets: it is finitely complete, cartesian closed, and has a subobject classifier Ω (an object that classifies monomorphisms, generalizing the two-element set {true, false} in Set). A Grothendieck topos is a category of sheaves on a site, and every Grothendieck topos is an elementary topos with additional exactness and generating properties. Toposes support an internal logic—a type-theoretic language interpreted within the category—where propositions correspond to morphisms into Ω. This internal logic is intuitionistic in general, recovering classical logic only when Ω ≅ 1 + 1. Topos theory unifies algebraic geometry (sheaves on schemes), logic (forcing and independence proofs), and type theory.

How It's Best Learned

Start with Set as the canonical example: the subobject classifier is {0,1} with the characteristic function construction. Then move to the presheaf topos [Cop, Set] and construct its subobject classifier (the presheaf of sieves). Verify that [Cop, Set] is cartesian closed and has all finite limits. Finally, internalize a simple logical statement within a topos and see how it differs from classical logic.

Common Misconceptions

Explainer

You already know that presheaves — contravariant functors from a small category C into Set — form a category [Cop, Set] that is Cartesian closed (from your prerequisite on Cartesian closed categories) and has all limits and colimits. The category Set is the simplest topos, and [Cop, Set] is the next most accessible one. What makes a topos more than just "a nice category" is the subobject classifier: an object Ω together with a morphism true: 1 → Ω such that every monomorphism m: A ↪ X in the category is classified by a unique characteristic morphism χ_m: X → Ω making a pullback square. In Set, Ω = {0, 1} and χ_m(x) = 1 iff x ∈ im(m) — this is just the characteristic function of a subset. The subobject classifier generalizes this idea to any topos, replacing {0, 1} with a richer object of "truth values."

In the presheaf topos [Cop, Set], the subobject classifier Ω is the presheaf that assigns to each object c ∈ C the set of sieves on c — collections of morphisms into c that are closed under precomposition. A sieve is a "generalized open set in the logical sense": it captures the idea that if a property holds at c and you have a morphism c' → c, the property still holds at c'. The richness of Ω — which can have far more than two elements — is precisely why the internal logic of a presheaf topos is intuitionistic rather than classical. The truth value of a proposition is not just "true or false" but "true at which stages," and the law of excluded middle fails because a proposition can be partially true.

The internal logic of a topos is a type theory — specifically, a fragment of higher-order intuitionistic logic — interpreted within the topos itself. Every type corresponds to an object, every proposition corresponds to a monomorphism into that object (a "subobject"), and logical connectives (∧, ∨, ⇒, ∀, ∃) are interpreted using the categorical structure (products, coproducts, exponentials, adjoints to pullback). This means you can reason inside a topos using logical syntax, and the categorical semantics guarantees that your proofs are valid. The axiom of choice corresponds to requiring that the epi-mono factorization splits, and the law of excluded middle corresponds to Ω having exactly two global sections — conditions that fail in general toposes.

A Grothendieck topos is a category of sheaves on a site: a category C equipped with a Grothendieck topology (a notion of "covering families" for each object). Sheaves are presheaves satisfying a gluing condition: if you know a section locally on each piece of a cover, and the pieces agree on overlaps, there is a unique global section. The archetypal example is sheaves of continuous functions on a topological space. But the Grothendieck topology framework vastly generalizes this — you can build toposes of étale sheaves over schemes (arithmetic geometry), sheaves on a classifying category (classifying toposes for theories), or the effective topos (where functions are computable). Each topos carries its own internal logic, its own notion of "set," and its own collection of geometric morphisms to other toposes, making topos theory simultaneously a foundation for constructive mathematics, a language for geometry, and a framework for categorical logic.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Cartesian Products and Relations → Partial Orders → Binary Relations → Equivalence Relations → Injective, Surjective, and Bijective Functions → Categories and Morphisms → Functors → Commutative Diagrams in Category Theory → Commutative Diagrams and Composition → Natural Transformations → 2-Categories and Weak Functors → Natural Isomorphisms Between Functors → Isomorphisms in Categories → Universal Properties → Initial and Terminal Objects → Products and Coproducts → Equalizers and Coequalizers → Limits and Colimits → Pullbacks and Pushouts → Adjoint Functors → Closed Monoidal Categories → Symmetric Monoidal Categories → Compact Closed Categories → Cartesian Closed Categories → Introduction to Topos Theory

Longest path: 94 steps · 546 total prerequisite topics

Prerequisites (8)

Leads To (0)

No topics depend on this one yet.