Alphabeta Math
LemmaStatement: 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, Ornstein's second construction turns a point-finite metric open cover into a locally finite open refinement

Statement

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

Facts & Assumptions

Given: Choice, a metric space XX, and a point-finite open cover {Cα}αA\{C_\alpha\}_{\alpha\in A}.

[A1]

The Axiom of Choice permits the cover to be well ordered and used to select its first eligible member (The Axiom of Choice, The well-ordering theorem).

[F1]

Metric balls are open, and every point has a positive-radius ball inside some cover member (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).

[F2]

A locally finite open refinement is the paracompactness refinement of Refinements, locally finite families, point-finite families, and star refinements.

[L1]

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

Proof

technique · constructive
1.1

Well order the point-finite cover. For xXx\in X let ρx=sup{r>0:B(x,r)Cα for some α}.\rho_x=\sup\{r>0:B(x,r)\subseteq C_\alpha \text{ for some }\alpha\}. Put mx=min{1,ρx/4}m_x=\min\{1,\rho_x/4\} when ρx<\rho_x<\infty, and mx=1m_x=1 otherwise. Then 0<mx10<m_x\le1 and B(x,2mx)B(x,2m_x) lies in some cover member: its radius is strictly below ρx\rho_x. Assign xx to the first CαC_\alpha containing B(x,2mx)B(x,2m_x), and let CαC'_\alpha be the union of all B(x,mx)B(x,m_x) assigned to α\alpha.

A1F1construct
2.1

The selected smaller balls cover XX and each lies in its assigned CαC_\alpha, so {Cα}\{C'_\alpha\} is an open refining cover.

step 1.1
2.2

Fix xx. If CαC'_\alpha meets B(x,mx/8)B(x,m_x/8), choose a ball B(y,my)CαB(y,m_y)\subseteq C'_\alpha meeting it. We claim xCαx\in C_\alpha. Otherwise xB(y,2my)x\notin B(y,2m_y), while intersection gives d(x,y)<my+mx/8d(x,y)<m_y+m_x/8; hence my<mx/81/8m_y<m_x/8\le1/8. Thus the truncation in step 1.1 is inactive at yy and ρy=4my\rho_y=4m_y. But B(y,5my)B(x,2mx),B(y,5m_y)\subseteq B(x,2m_x), because d(x,y)+5my<6my+mx/8<7mx/8d(x,y)+5m_y<6m_y+m_x/8<7m_x/8; the right-hand ball lies in some cover member by step 1.1. This contradicts the definition of ρy\rho_y. Thus xCαx\in C_\alpha.

step 1.1
3.1

The input cover is point-finite, so xx belongs to only finitely many CαC_\alpha. Step 2.2 shows that B(x,mx/8)B(x,m_x/8) meets only the corresponding finitely many CαC'_\alpha; hence the new cover is locally finite.

step 2.2F2
4.1

Hence {Cα}\{C'_\alpha\} is a locally finite open refinement of the point-finite cover. For an arbitrary metric open cover, first apply [L1] and then this construction; refinement is transitive, so the result refines the original cover.

L1F2step 2.1step 3.1discharge-construct

Remarks

In the primary paper, part (B) is applied to the point-finite cover obtained in part (A), with that cover renamed {Cα}\{C_\alpha\}. Its local-finiteness test concludes that every new set meeting a fixed small ball has an index α\alpha for which xCαx\in C_\alpha; point-finiteness of the input is exactly what turns this conclusion into finiteness. Thus part (B) upgrades part (A) rather than restarting from the original arbitrary cover.

Depends on

Used by

Dependency tree · next 3 levels

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