Alphabeta Math
TheoremStatement: 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 paracompact Hausdorff space admits a locally finite subordinate partition of unity

Statement

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

Facts & Assumptions

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

[L1]

There are locally finite covers {Vs}\{V_s\}, {Ws}\{W_s\} and UsUU_s\in\mathcal U with VsWsWsUs\overline{V_s}\subseteq W_s\subseteq\overline{W_s}\subseteq U_s (Under choice, every open cover of a paracompact Hausdorff space has locally finite open refinements {Vs}\{V_s\} and {Ws}\{W_s\} with VsWsWsUs\overline{V_s}\subseteq W_s\subseteq\overline{W_s}\subseteq U_s).

[L2]

Every paracompact Hausdorff space is normal (Every paracompact Hausdorff space is normal).

[L3]

Under dependent choice, Urysohn's lemma separates disjoint closed sets in a normal space by a continuous map into [0,1][0,1] (Urysohn's lemma, under the axiom of dependent choice: in a normal space two disjoint closed sets are separated by a continuous function into [0,1][0,1], and conversely such a space is normal, clause 1).

[L4]

If {fs:X[0,)}sS\{f_s:X\to[0,\infty)\}_{s\in S} is a continuous family with locally finite cozero family and everywhere-positive sum f=sfsf=\sum_sf_s, then the functions φs=fs/f\varphi_s=f_s/f form a partition of unity, with the same cozero sets and supports as the corresponding fsf_s (A locally finite nonnegative family with positive pointwise sum normalizes to a partition of unity).

Proof

technique · constructive
1.1

Apply [L1] to obtain Vs,Ws,UsV_s,W_s,U_s as stated.

L1construct
2.1

By [L2], XX is normal. For each ss, the closed sets Vs\overline{V_s} and XWsX\setminus W_s are disjoint, so [L3] gives a continuous fs:X[0,1]f_s:X\to[0,1] equal to 11 on Vs\overline{V_s} and 00 on XWsX\setminus W_s.

step 1.1L2L3choose
3.1

The cozero set of fsf_s lies in WsW_s, while its support lies in WsUs\overline{W_s}\subseteq U_s; since {Ws}\{W_s\} is locally finite, so is the cozero family.

step 1.1step 2.1
3.2

Because {Vs}\{V_s\} covers XX and fs=1f_s=1 on VsV_s, the pointwise sum sfs\sum_sf_s is positive everywhere.

step 1.1step 2.1
4.1

By [L4], the normalized functions φs=fs/(tft)\varphi_s=f_s/(\sum_tf_t) form a locally finite partition of unity; their supports equal those of fsf_s, so step 3.1 makes the partition subordinate to U\mathcal U.

step 3.1step 3.2L4discharge-construct

Depends on

Used by

Dependency tree · next 3 levels

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