Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13
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

ABCDEFaxbyzde

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.

[F1]

A pullback supplies a unique factor for each compatible pair (Pullbacks and pushouts as limits and colimits of cospans and spans).

Proof

technique · universal property
1.1

Suppose first that both small squares are pullbacks. Given r:W→D and s:W→C with edr=zs, the right pullback gives a unique t:W→B with yt=dr and bt=s. The left pullback then gives a unique u:W→A with xu=r and au=t.

F1given
1.2

For the cancellation law, assume the right square and outer rectangle are pullbacks. A compatible pair r:W→D, t:W→B for the left square gives bt:W→C and edr=zbt. The outer property yields a unique u:W→A with xu=r and bau=bt. Since yau=dxu=dr=yt, right-pullback uniqueness gives au=t. Outer uniqueness gives uniqueness of u.

F1
2.1

This u satisfies bau=s. If u′ has xu′=r and bau′=s, then the right pullback gives au′=t, and the left pullback gives u′=u. Hence the outer rectangle is a pullback.

F1step 1.1
3.1

Reversing steps 1.1, 1.2, and 2.1 by [L1] proves the corresponding composition and cancellation laws for pushouts.

L1step 1.1step 2.1step 1.2∎

Depends on

Used by

Dependency tree · two levels

5 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