Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck 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.

Every open cover of a compact Hausdorff space has a finite open star-refinement

Statement

Every open cover of a compact Hausdorff space has a finite open star-refinement.

Facts & Assumptions

Given: A compact Hausdorff space X and an open cover U.

[L1]

A compact Hausdorff space is regular and normal (A compact Hausdorff space is regular and normal, hence T3 and T4).

[L3]

A finite family is indexed by a natural number (The cardinality ∣A∣ of a finite set).

Proof

technique · constructive
1.1

Let V be the family of all open sets V such that V‾⊆U for some U∈U. This family covers X. Indeed, for x∈U∈U, normality separates the closed sets {x} and X∖U by disjoint open sets; the open set containing x has closure contained in U. This definition uses no choices indexed by X.

L1L4construct
1.2

We record a finite shrinking construction. Given a finite open cover A0,…,Am−1, recursively put Fi=X∖(⋃j<iBj∪⋃j>iAj). The earlier covering clauses imply Fi⊆Ai. Normality separates Fi from X∖Ai, giving an open Bi with Fi⊆Bi⊆Bi‾⊆Ai. At the last stage the Bi cover X. Thus every finite open cover has an open shrinking whose closures remain in the original members.

L1L3L4construct
2.1

Compactness gives a finite subcover V0,…,Vn−1 of V. Finite choice supplies Ui∈U with Vi‾⊆Ui for each i<n.

step 1.1L2L4
2.2

From a finite cover Ai and an open shrinking Bi as in step 1.2, form, for each nonempty S⊆{0,…,m−1}, WS=(⋂i∈SAi)∖(⋃j∉SBj‾), discarding empty members. These finitely many sets are open and cover X: at x, take S={i:x∈Ai}. Moreover, choose k with x∈Bk. Every WS containing x has k∈S, so WS⊆Ak. Hence the point-star St⁡(x,W) lies in Ak. Call this a barycentric refinement of (Ai).

step 1.2L3construct
3.1

Apply step 2.2 to the finite cover (Ui) and its shrinking (Vi) from step 2.1, obtaining a finite open barycentric refinement W of U. Apply steps 1.2 and 2.2 again to W, obtaining a finite open barycentric refinement Z of W.

step 2.1step 1.2step 2.2
4.1

The cover Z star-refines U. Fix Z0∈Z and x∈Z0. Barycentricity of W gives U∈U with St⁡(x,W)⊆U. If Z∈Z meets Z0 at y, barycentricity of Z gives Wy∈W containing St⁡(y,Z). Both Z0 and Z lie in Wy, and x∈Wy, so Z⊆Wy⊆St⁡(x,W)⊆U. Thus St⁡(Z0,Z)⊆U.

step 3.1
5.1

The finite open cover Z is therefore a star-refinement of the original cover.

step 4.1discharge-construct∎

Depends on

Used by

Dependency tree · two levels

31 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