An element is primitive if it does not descend along any surjection . All elements at cardinality one are primitive. Repeated descent reaches a primitive ancestor in finitely many steps, and the primitive-element kernel rigidity lemma makes the ancestor unique up to bijection.
Partition the elements of a sheaf by their primitive-ancestor equivalence classes under bijection. Each class gives a sheaf subfunctor, because its membership is preserved and reflected along covering surjections. A representative primitive element names an epic representable map onto its class component. Thus every sheaf is the coproduct of these components, each an atom in a topos.
If primitive elements have equal restrictions along and , then these surjections have equal kernels. To rule out with unequal images, identify those two images by . The set of pairs equal under and maps surjectively both to by projection and to the kernel pair of by applying . Injective restrictions force the kernel-pair matching condition on the primitive element, contradicting descent along .
Articles by others on the same topic
There are currently no matching articles.