Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Wide pullbacks compute intersections of supplied set-indexed subobject representatives independently of the representatives

Statement

Let (mi:Ai→C)i∈I be a supplied family of monomorphisms indexed by a set. If its wide pullback exists, the induced morphism p:P→C is monic and represents the intersection of the subobjects [mi]. For I=∅, take p=1C. Replacing any mi by an equivalent representative produces the same subobject [p].

Facts & Assumptions

Given: A set I, monomorphisms mi:Ai→C, and their wide-pullback cone (P,pi) when I is nonempty.

[L1]

A limit of a diagram is a cone over it admitting a unique mediating map from every cone over the same diagram (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).

[L2]
[L4]

An intersection is the greatest lower bound in the subobject order (Intersection of a supplied family of subobjects as its greatest lower bound).

[L5]

Mutually factoring monomorphisms have unique inverse isomorphisms as factor maps and represent the same subobject (Mutual factorisation is an equivalence relation on monomorphisms into an object and dually on epimorphisms out of it).

Proof

technique · direct
1.1L4

If I=∅, every subobject of C factors through 1C:C→C, so 1C represents the greatest subobject of C; the empty family imposes no lower-bound condition, so [1C] is its greatest lower bound and hence its intersection by [L4].

1.2L1L2L3L4

Suppose I is nonempty and write p=mi∘pi, independent of i. If p∘x=p∘y, then monicity of every mi gives pi∘x=pi∘y for all i, and joint monicity in [L3] gives x=y; hence p is monic. Each equality p=mipi makes [p]≤[mi]. If q:Q→C factors through every mi, its factor maps form a cone and [L1] gives a unique u:Q→P with q=p∘u, so [q]≤[p]. Thus [L4] makes [p] the intersection.

2.1step 1.2L1L4L5∎

By [L5], representatives of the same subobject mutually factor and their factor maps are unique inverse isomorphisms over C. Composing a wide-pullback cone with these isomorphisms gives a cone for the replacement family, and [L1] supplies mutually inverse comparison maps between the two pullback apices. Their induced monomorphisms into C therefore mutually factor, so they represent the same intersection subobject.

Depends on

Used by

Dependency tree · two levels

12 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources