Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-13 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Iterated small limits commute: either order is canonically isomorphic to the limit over the product category

Statement

Let J and K be small and let D:J×KC. Whenever the displayed limits exist, there are canonical compatible isomorphisms

limjlimkD(j,k)lim(j,k)D(j,k)limklimjD(j,k).

Facts & Assumptions

Given: Small J,K, the diagram D, and the limits in the statement.

[F2]

The product category has objects (j,k) and componentwise morphisms (Product category and its projection functors).

[F3]

The cardinality of a small category is the cardinality of its morphism set, and a small diagram is one with a small indexing category (Assuming Choice, cardinality of a small category and κ-small diagrams).

Proof

technique · universal property
1.1

By [F2], a cone from X to D is exactly a family of arrows XD(j,k) compatible separately with every J-arrow and every K-arrow.

F2
2.1

For each j, the K-limit turns such a compatible k-family into one unique arrow XlimkD(j,k). Compatibility in j turns these into a cone over the resulting J-diagram, and its limit turns the family into one unique arrow XlimjlimkD(j,k). Both constructions reverse by the two universal properties.

F1step 1.1
3.1

Hence the first iterated limit has the universal property of the J×K-limit. By [L1] it is uniquely compatibly isomorphic to that limit. Interchanging j and k proves the second isomorphism.

F1L1step 2.1
4.1

If either index category is empty, step 1.1 describes an empty family, so each existing expression is a terminal object and [L1] gives the same canonical isomorphisms. The morphisms of J×K form a subset of the Cartesian product of the two morphism sets, so [F3] makes the product category small and no large diagram has been introduced.

L1F3step 1.1

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: 37 results over 11 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