Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31
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.

Under choice and dependent choice, every open cover of a compact Hausdorff space admits a finite subordinate partition of unity

Statement

Assume the Axiom of Choice and the Axiom of Dependent Choice. Every open cover of a compact Hausdorff space admits a finite partition of unity subordinate to that cover.

Facts & Assumptions

Given: Choice, dependent choice, a compact Hausdorff space XX, and an open cover U\mathcal U.

[L1]

A compact space is paracompact (Every compact space is paracompact).

[L2]

A paracompact Hausdorff space has a locally finite partition subordinate to each of its open covers (Under choice and dependent choice, every open cover of a paracompact Hausdorff space admits a locally finite subordinate partition of unity).

[L3]

A locally finite sum of continuous nonnegative functions is continuous (A locally finite family of continuous nonnegative functions has a continuous pointwise sum).

Proof

technique · direct
1.1

Compactness gives a finite subcover U0={U1,,Un}\mathcal U_0=\{U_1,\ldots,U_n\} of U\mathcal U.

F1choose
2.1

By [L1] and [L2], apply the partition theorem to the finite cover U0\mathcal U_0 and take a locally finite partition {φs}sS\{\varphi_s\}_{s\in S} subordinate to it.

L1L2step 1.1choose
3.1

Assign each φs\varphi_s to the first UjU_j containing its support, and set hjh_j equal to the corresponding sum. By [L3] the hjh_j are continuous; by [L4] their supports are contained in UjU_j; and h1++hn=1h_1+\cdots+h_n=1.

L3L4step 2.1construct
4.1

Discarding the zero hjh_j leaves a finite subordinate partition of unity.

step 3.1

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 78 results over 17 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