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.

Any two limits, or any two colimits, of one diagram are uniquely isomorphic compatibly with their structure maps

Statement

If (L,λ) and (L′,λ′) are limits of one diagram D, there is a unique isomorphism u:L→L′ satisfying λj′u=λj for every j. Dually, any two colimits of D are joined by a unique isomorphism that commutes with every cocone leg.

Facts & Assumptions

Given: Two limiting cones (L,λ) and (L′,λ′) over D.

[F1]

A limit is a terminal cone: every cone has a unique morphism to it, and a colimit is an initial cocone (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).

[L1]

Any two terminal objects are uniquely isomorphic, as are any two initial objects (Initial and terminal objects are unique up to a unique isomorphism).

[L2]

An isomorphism has a two-sided inverse (Isomorphism, groupoid, and connected category).

Proof

technique · universal property
1.1

By [F1], there are unique cone morphisms u:L→L′ and v:L′→L; hence λj′u=λj and λjv=λj′ for every j.

F1
2.1

Both vu and 1L are cone morphisms from (L,λ) to itself, so terminal uniqueness gives vu=1L. Similarly uv=1L′.

F1step 1.1
3.1

Thus u is an isomorphism with inverse v. Any compatible isomorphism is a cone morphism L→L′, so it equals u by uniqueness.

L2step 1.1step 2.1
4.1

The same argument in Cocone⁡(D) uses initial rather than terminal uniqueness [L1]: the unique morphisms between the two initial cocones are inverse and commute with all cocone legs.

F1L1∎

Depends on

Used by

Dependency tree · two levels

7 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