Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26
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.

Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed

Statement

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 open and closed sets as in 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 and balls as in Open ball, closed ball and sphere in a metric space. Then:

  1. Balls are open. B(x,r) is open, for every x∈X and every r>0.
  2. Arbitrary unions. If U is any collection of open subsets of X, then ⋃U is open.
  3. Finite intersections. If n≥1 and U0,…,Un−1 are open, then U0∩⋯∩Un−1 is open.
  4. Closed balls are closed. Bˉ(x,r) is closed, for every x∈X and every r>0.

Together with the fact that ∅ and X are open, recorded already in 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, claims 2 and 3 say that Td has exactly the closure properties that the word topology names.

Facts & Assumptions

Given: A metric space (X,d); a point x∈X and a real r>0; a collection U of open subsets of X; a natural n≥1 and open sets U0,…,Un−1⊆X.

[A1]

Open: U is open when every u∈U admits t>0 with B(u,t)⊆U; closed means the complement is open (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).

[A2]

Balls: B(u,t)={w:d(u,w)<t} and Bˉ(u,t)={w:d(u,w)≤t}, and B(u,t)⊆B(u,t′) whenever 0<t≤t′ (Open ball, closed ball and sphere in a metric space).

[L2]

Reverse triangle inequality: ∣d(a,c)−d(b,c)∣≤d(a,b), so in particular d(a,c)−d(b,c)≤d(a,b) (The reverse triangle inequality ∣d(x,z)−d(y,z)∣≤d(x,y) in any metric space).

[L3]

A nonempty finite set of reals has a minimum, which belongs to the set and is a lower bound of it (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

[L4]

Order arithmetic: a constant may be added to both sides of an inequality and inequalities may be chained by transitivity, in the strict form of Order is preserved by adding a constant and by adding inequalities and, with the case of equality settled by totality, in the nonstrict form (Ordered field, Complete ordered field (least-upper-bound property)); and by trichotomy a<b and b≤a cannot both hold.

Proof

technique · direct
1.1

Claim 1: let y∈B(x,r), so d(x,y)<r, and put s:=r−d(x,y)>0; for z∈B(y,s) the triangle inequality gives d(x,z)≤d(x,y)+d(y,z)<d(x,y)+s=r, so B(y,s)⊆B(x,r), and since y was arbitrary B(x,r) is open.

A1A2L1L4
1.2

Claim 2: let y∈⋃U, so y∈U for some U∈U; as U is open there is t>0 with B(y,t)⊆U⊆⋃U, and since y was arbitrary the union is open.

A1
1.3

Claim 3: let y∈U0∩⋯∩Un−1 and for each k<n pick tk>0 with B(y,tk)⊆Uk, which is possible because each Uk is open and y lies in it.

A1choose
1.4

Claim 4: let y∈X∖Bˉ(x,r), so d(x,y)>r, and put s:=d(x,y)−r>0; for z∈B(y,s) the reverse triangle inequality applied to the points y,z,x gives d(y,x)−d(z,x)≤d(y,z)<s, hence d(z,x)>d(y,x)−s=r, so d(x,z)>r by symmetry and z∉Bˉ(x,r).

A2L1L2L4
2.1

Since n≥1, the set {t0,…,tn−1} is a nonempty finite set of reals, so t:=min⁡{t0,…,tn−1} exists, equals some tj and is therefore >0, and satisfies t≤tk for every k<n.

step 1.3L3
2.2

Step 1.4 shows B(y,s)⊆X∖Bˉ(x,r) for the y and s chosen there, and y was an arbitrary point of X∖Bˉ(x,r); hence X∖Bˉ(x,r) is open and Bˉ(x,r) is closed, which is claim 4.

step 1.4A1
3.1

By step 2.1, B(y,t)⊆B(y,tk)⊆Uk for every k<n, so B(y,t)⊆U0∩⋯∩Un−1; as y was arbitrary that intersection is open, which is claim 3.

step 2.1A1A2
4.1

Claims 1, 2, 3 and 4 are established by steps 1.1, 1.2, 3.1 and 2.2 respectively.

step 1.1step 1.2step 2.2step 3.1∎

Remarks

Depends on

Used by

…and 11 more results.

Dependency tree · two levels

17 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