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.

Under choice, every open cover of a metric space has a point-finite open refinement

Statement

Assume the Axiom of Choice. Every open cover of a metric space has a point-finite open refinement.

Facts & Assumptions

Given: Choice, a metric space X, and an open cover {Cα}α∈A.

[A1]

Every set can be well ordered under the Axiom of Choice (The Axiom of Choice, The well-ordering theorem).

[F1]

Metric balls are open and each point of an open set has a ball contained in that set (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement).

Proof

technique · constructive
1.1

Well order {Cα} by [A1], and write R(x,n)=B(x,2−n). A ball R(z,n+1) is chosen for Cα when n is the least natural number with R(z,n)⊆Cα and, in addition, R(z,n)⊆Cβ for some β<α. Let Gα be the union of all balls chosen for Cα.

A1F1L1construct
2.1

Put Cα′:=Cα∖Gα‾. Each Cα′ is open and refines Cα.

step 1.1construct
3.1

The Cα′ cover. Otherwise let Cα be the first original member containing an omitted point x. Then x∈Gα‾. By [L1], choose N with B(x,3⋅2−N)⊆Cα, and put δ=2−(N+2). Some chosen ball R(z,nz+1) meets B(x,δ); write its radius as r=2−(nz+1). If r>δ, then d(x,z)<r+δ<2r, so its expanded ball R(z,nz) contains x. If r≤δ, then d(x,z)<r+δ≤2δ<2−N, so R(z,N)⊆Cα and minimality gives nz≤N; hence r≥2−(N+1)=2δ, a contradiction. Thus in every case an expanded chosen ball contains x. That expanded ball lies in some Cβ with β<α, contradicting the choice of α.

step 1.1step 2.1F1L1
3.2

If x∈Cα′ and n is least with R(x,n)⊆Cα (which exists by [L1]), then Cα is the first cover member containing R(x,n): otherwise R(x,n+1) would be chosen for Cα and would contain x, contrary to x∉Gα‾. For each n there is at most one such first member, and as n increases their ordinal indices are nonincreasing. Infinitely many distinct indices would therefore give an infinite strictly descending sequence of ordinals, impossible because its range has a least member. Thus only finitely many Cα′ contain x.

step 1.1step 2.1L1
4.1

Thus {Cα′} is the point-finite open refinement required by [F2].

F2step 3.1step 3.2discharge-construct∎

Remarks

This is part (A), pages 341–342, of Ornstein's primary proof. Its chosen dyadic-ball construction supplies the point-finite refinement to which the controlled-radius construction in part (B) is then applied.

Depends on

Used by

Dependency tree · two levels

37 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