Subobjects in categories extend the idea of "parts" or "subsets" to abstract mathematical structures. They're represented by equivalence classes of monomorphisms, allowing us to compare and analyze substructures across different mathematical domains.
Characteristic functions of subobjects generalize indicator functions, connecting subobjects to logic and type theory . This concept finds applications in various fields, from set theory to algebraic geometry and computer science , highlighting its versatility and importance.
Subobjects in Categories
Definition of subobjects
Top images from around the web for Definition of subobjects Category:Lattice of subgroups Hasse diagrams - Wikimedia Commons View original
Is this image relevant?
Partially ordered set - Wikipedia View original
Is this image relevant?
Category:Lattice of subgroups Hasse diagrams - Wikimedia Commons View original
Is this image relevant?
1 of 3
Top images from around the web for Definition of subobjects Category:Lattice of subgroups Hasse diagrams - Wikimedia Commons View original
Is this image relevant?
Partially ordered set - Wikipedia View original
Is this image relevant?
Category:Lattice of subgroups Hasse diagrams - Wikimedia Commons View original
Is this image relevant?
1 of 3
Subobject represents equivalence class of monomorphisms capturing notion of "part" or "subset" in abstract categories
Two monomorphisms deemed equivalent if they factor through each other allowing different representations of same substructure
Denoted m : A → B m: A \rightarrow B m : A → B , where m m m is a monomorphism embedding substructure A A A into larger structure B B B
Generalizes familiar concepts like subsets (Set), subgroups (Group), and subspaces (Top )
Subobjects vs monomorphisms
Monomorphisms serve as representatives for subobjects but not in one-to-one correspondence
Factorization property defines equivalence: f : A → C f: A \rightarrow C f : A → C and g : B → C g: B \rightarrow C g : B → C represent same subobject if isomorphisms h : A → B h: A \rightarrow B h : A → B and k : B → A k: B \rightarrow A k : B → A exist with f = g ∘ h f = g \circ h f = g ∘ h and g = f ∘ k g = f \circ k g = f ∘ k
Subobjects form partially ordered set based on factorization relation enabling comparison of "size" or "inclusion"
Distinction crucial for understanding abstract structure preservation in category theory
Characteristic functions of subobjects
Morphism χ m : B → Ω \chi_m: B \rightarrow \Omega χ m : B → Ω where Ω \Omega Ω is subobject classifier generalizing indicator functions
Constructed using universal property of subobject classifier ensuring unique factorization through true morphism t r u e : 1 → Ω true: 1 \rightarrow \Omega t r u e : 1 → Ω
Exhibits uniqueness for each subobject and pullback property allowing recovery of subobject
Connects to internal logic and type theory in elementary toposes
Applications in various categories
Set: Subobjects as subsets with characteristic functions acting as indicator functions (0 and 1)
Top: Open subsets as subobjects utilizing local homeomorphisms for characteristic functions
Algebraic geometry: Closed subschemes as subobjects related to ideal sheaves
Computer science: Modeling data structures (trees, graphs) and type systems in programming languages
Logic: Internal logic of toposes leveraging subobject classifiers for intuitionistic reasoning