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.
Pullback and pushout pasting, with cancellation of the square adjacent to the outer edge
Statement
Consider a commutative diagram of two adjacent squares
If both small squares are pullbacks, then the outer rectangle is a pullback. If the right square and the outer rectangle are pullbacks, then the left square is a pullback. Reversing all arrows gives the corresponding composition and cancellation laws for pushouts.
Facts & Assumptions
Given: The displayed commutative diagram.
A pullback supplies a unique factor for each compatible pair (Pullbacks and pushouts as limits and colimits of cospans and spans).
Pullbacks and pushouts are exact formal duals (A limiting cone for a diagram is exactly a colimiting cocone for the formally dual diagram in the opposite category).
Proof
Suppose first that both small squares are pullbacks. Given and with , the right pullback gives a unique with and . The left pullback then gives a unique with and .
For the cancellation law, assume the right square and outer rectangle are pullbacks. A compatible pair , for the left square gives and . The outer property yields a unique with and . Since , right-pullback uniqueness gives . Outer uniqueness gives uniqueness of .
This satisfies . If has and , then the right pullback gives , and the left pullback gives . Hence the outer rectangle is a pullback.
Reversing steps 1.1, 1.2, and 2.1 by [L1] proves the corresponding composition and cancellation laws for pushouts.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 8 results over 6 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- E. Riehl, Category Theory in Context, Exercise 3.1.vi (standard reference, not scraped)