Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01
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.

A cofinal subsystem has the same inverse limit up to canonical isomorphism

Statement

A cofinal subsystem has the same inverse limit, up to canonical isomorphism.

Facts & Assumptions

Given: An inverse system indexed by I and a cofinal directed subset J⊆I.

[L1]

A cofinal subsystem meets every ambient index eventually (A cofinal subsystem meets every index eventually).

Proof

technique · direct
1.1F1givenconstruct

Restricting a compatible tuple on I to its J-coordinates gives a homomorphism ρ:lim←⁡i∈IGi→lim←⁡j∈JGj. Compatibility is preserved because every relation used in the J-limit is already one of the relations used in the I-limit.

1.2L1F1constructalgebra

For a compatible tuple (xj)j∈J and i∈I, let Ai:={φij(xj):j∈J, i≤j}. Cofinality makes Ai nonempty. If j,j′ both dominate i, choose k∈J dominating both; compatibility gives φij(xj)=φik(xk)=φij′(xj′). Thus Ai is a singleton. Define σ((xj))i to be its unique member. This makes no simultaneous choice, and the transition identities show that the resulting tuple is compatible on I.

2.1step 1.1step 1.2∎

By construction, ρ∘σ and σ∘ρ fix every coordinate, hence are identity maps on the corresponding inverse limits. Therefore ρ and σ are inverse isomorphisms.

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