Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedaudited 2026-09-22
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.

Development stars form a countable local base

Example

Let (X,d) be a metric space (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric) with its metric topology (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). For n∈N let Gn:={ B(x,2−n):x∈X }, the cover by open balls of radius 2−n (Open ball, closed ball and sphere in a metric space). The example computes the stars St⁡(x,Gn) and verifies that (Gn) is a development, so that every metric space is a Moore space in the sense of Moore spaces and developments.

Facts & Assumptions

Given: A metric space (X,d), its balls B(x,r), and the covers Gn={B(x,2−n):x∈X}.

[F1]

Star: St⁡(x,Gn)=⋃{ B(z,2−n):x∈B(z,2−n) }, and each Gn is an open cover because x∈B(x,2−n) and every metric ball is open (Refinements, locally finite families, point-finite families, and star refinements, Open ball, closed ball and sphere in a metric space, Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed, claim 1).

[L1]

Metric axioms: d(x,y)=0 if and only if x=y, symmetry, and the triangle inequality d(x,y)≤d(x,z)+d(z,y) (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

[L4]

For every ε>0 some integer m≥1 satisfies 1/m<ε (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε).

[L5]

A development is a sequence of open covers whose stars refine every open neighbourhood at each point; a Moore space is regular T1 and developable. These stars give a countable local base, also for neighbourhoods that are not open (Moore spaces and developments, Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open).

Verification

technique · direct
1.1givenF1L1

For every x and n one has B(x,2−n)⊆St⁡(x,Gn)⊆B(x,21−n): the first inclusion holds because x∈B(x,2−n); for the second, if y∈B(z,2−n) with x∈B(z,2−n) then d(x,y)≤d(x,z)+d(z,y)<2−n+2−n=21−n by [L1].

2.1step 1.1L2L4L5

Hence (Gn) is a development. Let U be open and x∈U (Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open). By [L2] there is ε>0 with B(x,ε)⊆U; take m≥1 with 1/m<ε by [L4] and set n=m+1. Induction gives 2m≥m, so 21−n=2−m≤1/m<ε; then step 1.1 gives St⁡(x,Gn)⊆B(x,21−n)⊆B(x,ε)⊆U.

3.1step 1.1step 2.1L2L3L5∎

Consequently every metric space is developable, and [L3] makes it regular T1, so it is a Moore space; the star family {St⁡(x,Gn):n∈N} is the countable local base at x supplied by step 2.1: each star is open as a union of open balls and contains x, and every neighbourhood contains an open neighbourhood to which step 2.1 applies. If X is empty, the covers are empty and the assertions about points are vacuous.

Remarks

  • The star bound doubles the radius. The lower bound shows the star is not smaller than the ball of radius 2−n, and the upper bound shows it is contained in the ball of radius 21−n; that two-to-one gap is exactly what makes the development property hold with the factor 2.

  • The same computation works with any null sequence of radii, the powers 2−n being chosen only for definiteness.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

56 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