Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

Dimension can be computed on an open cover

Statement

For every open cover T=iIUi of a Noetherian space, dimT=supidimUi, with empty supremum .

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[F1]

For a Noetherian topological space T, define dimT as the supremum of the lengths s of strict chains Z0Zs of nonempty irreducible closed subsets of T. Thus a one-member chain has length zero. Set dim=, and allow dimT=+. The supremum of an empty family of dimensions is . (Chain dimension and the empty-space convention).

Proof

1.1

If T is empty all terms have dimension . Otherwise, for a chain of irreducible closed subsets C0Cs in an open U, their closures in T are irreducible and closed, and CjU=Cj. Hence their closures remain strictly nested and dimUdimT.

F1
2.1

For a chain Z0Zs in T, choose xZ0 and a covering open Ui containing x. Each ZjUi is nonempty, irreducible and closed in Ui. A nonempty open of an irreducible space is dense: two disjoint nonempty opens would give a cover by two proper closed subsets. Thus ZjUi=Zj. The intersections form a strict chain of the same length. Taking suprema proves the claim.

F1step 1.1

Depends on

Used by

Dependency tree · two levels

3 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