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 be a metric space (Metric space: iff , 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:
- Balls are open. is open, for every and every .
- Arbitrary unions. If is any collection of open subsets of , then is open.
- Finite intersections. If and are open, then is open.
- Closed balls are closed. is closed, for every and every .
Together with the fact that and 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 has exactly the closure properties that the word topology names.
Facts & Assumptions
Given: A metric space ; a point and a real ; a collection of open subsets of ; a natural and open sets .
Open: is open when every admits with ; 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).
Balls: and , and whenever (Open ball, closed ball and sphere in a metric space).
Triangle inequality and symmetry of (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
Reverse triangle inequality: , so in particular (The reverse triangle inequality in any metric space).
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).
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 and cannot both hold.
Proof
Claim 1: let , so , and put ; for the triangle inequality gives , so , and since was arbitrary is open.
Claim 2: let , so for some ; as is open there is with , and since was arbitrary the union is open.
Claim 3: let and for each pick with , which is possible because each is open and lies in it.
Claim 4: let , so , and put ; for the reverse triangle inequality applied to the points gives , hence , so by symmetry and .
Since , the set is a nonempty finite set of reals, so exists, equals some and is therefore , and satisfies for every .
Step 1.4 shows for the and chosen there, and was an arbitrary point of ; hence is open and is closed, which is claim 4.
By step 2.1, for every , so ; as was arbitrary that intersection is open, which is claim 3.
Claims 1, 2, 3 and 4 are established by steps 1.1, 1.2, 3.1 and 2.2 respectively.
Remarks
- Finiteness in claim 3 is essential and is exactly what step 2.1 uses. An infinite family of positive radii need have no positive lower bound, and the minimum of an infinite set of reals need not exist at all (Every nonempty finite set of reals has a maximum and a minimum is stated for finite sets for that reason). The intersection of the balls over all is a standard example of an intersection of open sets that need not be open.
- The empty intersection is not covered and does not need to be. Claim 3 is stated for ; the conventional value of an empty intersection is , which is open anyway (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).
- Claim 4 is not the statement that is the closure of , which is false in general (FALSE: in every metric space the closure of is the closed ball of radius ). All that is proved here is that the closed ball is a closed set.
Depends on
- 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
- Open ball, closed ball and sphere in a metric space
- Every nonempty finite set of reals has a maximum and a minimum
- Maximum and minimum of a set
- Order is preserved by adding a constant and by adding inequalities
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- The reverse triangle inequality $|d(x,z) - d(y,z)| \le d(x,y)$ in any metric space
- Ordered field
- Complete ordered field (least-upper-bound property)
Used by
- In ℝ the interiors of ℚ and of its complement are both empty while the interior of their union is everything Counterexample
- In the bounded real-valued functions on ℕ with the supremum metric, the closed unit ball is closed and bounded and is not compact: the indicator functions of the singletons are pairwise at distance 1 Counterexample
- ℝ covered by its closed singletons: every restriction of the indicator of {0} is continuous and the map is not, so the closed pasting lemma needs finiteness Counterexample
- The identity from the cocountable topology on ℝ to the usual topology is sequentially continuous and not continuous Counterexample
- The identity from the discrete topology on ℝ to the usual topology is a continuous bijection that is not a homeomorphism Counterexample
- Interior, closure, boundary, limit point, isolated point and dense subset of a metric space Definition
- Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not Definition
- Closure and complement generate at most fourteen sets from any subset, and (0,1) ∪ (1,2) ∪ {3} ∪ ([4,5] ∩ ℚ) attains fourteen Example
- The discrete metric induces the discrete topology, in which every subset is clopen Example
- The order topology on a totally ordered set, with the open rays as a subbasis, and its agreement with the usual topology of ℝ Example
- The Sorgenfrey line: ℝ with the half-open intervals [a,b) as a basis is strictly finer than the usual topology, is first countable, has a countable dense subset, and its sequences converge only from the right Example
- FALSE: a sequentially continuous map between topological spaces is continuous False statement
- FALSE: an arbitrary intersection of open sets is open in every topological space False statement
- FALSE: in every metric space the closure of B(x,r) is the closed ball of radius r False statement
- FALSE: the evaluation map on C(X,Y) with the compact-open topology is continuous for every metric X False statement
- A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it Lemma
- In a locally compact metric space every point has arbitrarily small compact closed balls, hence a neighbourhood base of compact sets Lemma
- The balls B(x, 1/n), n ≥ 1, form a countable neighbourhood base at x, so every metric space is first countable Lemma
- A compact metric space is complete and totally bounded, and neither implication uses any choice principle Theorem
- A compact subset of a metric space is closed and bounded Theorem
- A point lies in the closure of A iff some sequence in A converges to it, and a set is closed iff it is sequentially closed Theorem
- Distinct points of a metric space have disjoint balls around them Theorem
- For a map of metric spaces the following agree: ε-δ continuity everywhere, preimages of open sets are open, preimages of closed sets are closed, sequential continuity, and f(overlineA) ⊆ overlinef(A) Theorem
- For a metric domain and a metric target the compact-open topology on C(X,Y) is the topology of compact convergence Theorem
- Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous Theorem
- If X is a locally compact metric space then the evaluation map is continuous for the compact-open topology Theorem
- In a metric space any two separated sets have disjoint open neighbourhoods, so every metrizable space is completely normal Theorem
- In any metric space compactness implies countable compactness and limit point compactness, and each of countable compactness and limit point compactness implies sequential compactness; every implication here is proved without a choice principle Theorem
- The closure of a nonempty A is {x : d(x,A) = 0}, equals A together with its limit points, and is the smallest closed superset Theorem
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
- Open set (Wikipedia) (standard reference, not scraped)
- Metric space (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 2 (standard reference, not scraped)
- R. Gardner, Introduction to Topology, notes on Munkres Section 20: The Metric Topology (East Tennessee State University) (standard reference, not scraped)