Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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)(X,d) be a metric space (Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = 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)B(x,r) is open, for every xXx \in X and every r>0r > 0.
  2. Arbitrary unions. If U\mathcal{U} is any collection of open subsets of XX, then U\bigcup \mathcal{U} is open.
  3. Finite intersections. If n1n \ge 1 and U0,,Un1U_0, \dots, U_{n-1} are open, then U0Un1U_0 \cap \dots \cap U_{n-1} is open.
  4. Closed balls are closed. Bˉ(x,r)\bar B(x,r) is closed, for every xXx \in X and every r>0r > 0.

Together with the fact that \emptyset and XX 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\mathcal{T}_d has exactly the closure properties that the word topology names.

Facts & Assumptions

Given: A metric space (X,d)(X,d); a point xXx \in X and a real r>0r > 0; a collection U\mathcal{U} of open subsets of XX; a natural n1n \ge 1 and open sets U0,,Un1XU_0, \dots, U_{n-1} \subseteq X.

[A1]

Open: UU is open when every uUu \in U admits t>0t > 0 with B(u,t)UB(u,t) \subseteq 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}B(u,t) = \{w : d(u,w) < t\} and Bˉ(u,t)={w:d(u,w)t}\bar B(u,t) = \{w : d(u,w) \le t\}, and B(u,t)B(u,t)B(u,t) \subseteq B(u,t') whenever 0<tt0 < t \le t' (Open ball, closed ball and sphere in a metric space).

[L2]

Reverse triangle inequality: d(a,c)d(b,c)d(a,b)|d(a,c) - d(b,c)| \le d(a,b), so in particular d(a,c)d(b,c)d(a,b)d(a,c) - d(b,c) \le d(a,b) (The reverse triangle inequality d(x,z)d(y,z)d(x,y)|d(x,z) - d(y,z)| \le 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<ba < b and bab \le a cannot both hold.

Proof

technique · direct
1.1

Claim 1: let yB(x,r)y \in B(x,r), so d(x,y)<rd(x,y) < r, and put s:=rd(x,y)>0s := r - d(x,y) > 0; for zB(y,s)z \in B(y,s) the triangle inequality gives d(x,z)d(x,y)+d(y,z)<d(x,y)+s=rd(x,z) \le d(x,y) + d(y,z) < d(x,y) + s = r, so B(y,s)B(x,r)B(y,s) \subseteq B(x,r), and since yy was arbitrary B(x,r)B(x,r) is open.

A1A2L1L4
1.2

Claim 2: let yUy \in \bigcup \mathcal{U}, so yUy \in U for some UUU \in \mathcal{U}; as UU is open there is t>0t > 0 with B(y,t)UUB(y,t) \subseteq U \subseteq \bigcup \mathcal{U}, and since yy was arbitrary the union is open.

A1
1.3

Claim 3: let yU0Un1y \in U_0 \cap \dots \cap U_{n-1} and for each k<nk < n pick tk>0t_k > 0 with B(y,tk)UkB(y,t_k) \subseteq U_k, which is possible because each UkU_k is open and yy lies in it.

A1choose
1.4

Claim 4: let yXBˉ(x,r)y \in X \setminus \bar B(x,r), so d(x,y)>rd(x,y) > r, and put s:=d(x,y)r>0s := d(x,y) - r > 0; for zB(y,s)z \in B(y,s) the reverse triangle inequality applied to the points y,z,xy, z, x gives d(y,x)d(z,x)d(y,z)<sd(y,x) - d(z,x) \le d(y,z) < s, hence d(z,x)>d(y,x)s=rd(z,x) > d(y,x) - s = r, so d(x,z)>rd(x,z) > r by symmetry and zBˉ(x,r)z \notin \bar B(x,r).

A2L1L2L4
2.1

Since n1n \ge 1, the set {t0,,tn1}\{t_0, \dots, t_{n-1}\} is a nonempty finite set of reals, so t:=min{t0,,tn1}t := \min\{t_0, \dots, t_{n-1}\} exists, equals some tjt_j and is therefore >0> 0, and satisfies ttkt \le t_k for every k<nk < n.

step 1.3L3
2.2

Step 1.4 shows B(y,s)XBˉ(x,r)B(y,s) \subseteq X \setminus \bar B(x,r) for the yy and ss chosen there, and yy was an arbitrary point of XBˉ(x,r)X \setminus \bar B(x,r); hence XBˉ(x,r)X \setminus \bar B(x,r) is open and Bˉ(x,r)\bar B(x,r) is closed, which is claim 4.

step 1.4A1
3.1

By step 2.1, B(y,t)B(y,tk)UkB(y,t) \subseteq B(y,t_k) \subseteq U_k for every k<nk < n, so B(y,t)U0Un1B(y,t) \subseteq U_0 \cap \dots \cap U_{n-1}; as yy 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

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 27 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