Definition · supporting ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a Prop-valued definition: it states the claim without proving it).
Compact sets are those that can be covered by finitely many sets of arbitrarily small size. Show all
IsCompact close match
def IsCompact {X : Type*} [TopologicalSpace X] : Set X → Prop
Mathlib.Topology.Defs.Filter · lines 292–293
Why close, not exact: Lean writes the property out as the condition that every nontrivial filter containing the set clusters at a point of it, the precise form of the finite-covering phrase the article uses as a gloss.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 6277ba8c9957 · pair key 19e4f14bf0ed.
Related, but states something else (2)
isCompact_iff_finite_subcover related
theorem isCompact_iff_finite_subcover {X : Type u} [TopologicalSpace X] {s : Set X} : IsCompact s ↔ ∀ {ι : Type u} (U : ι → Set X), (∀ (i : ι), IsOpen (U i)) → s ⊆ ⋃ i, U i → ∃ t, s ⊆ ⋃ i ∈ t, U i
Mathlib.Topology.Compactness.Compact · lines 385–388
How it differs: This characterises compactness by finite subcovers of open covers, a restatement of the library predicate rather than the article's phrase about sets of small size.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e20579cb0f5d · pair key e53be903fdfe.
finite_cover_balls_of_compact related
theorem finite_cover_balls_of_compact {X : Type*} [PseudoMetricSpace X] {s : Set X} : IsCompact s → ∀ {e : ℝ}, 0 < e → ∃ t ⊆ s, t.Finite ∧ s ⊆ ⋃ x ∈ t, Metric.ball x e
Mathlib.Topology.MetricSpace.Pseudo.Basic · lines 248–251
How it differs: It gives one direction only, that a compact set admits a finite cover by balls of any positive radius, and it assumes a pseudometric.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e6f03a4eda81 · pair key 40b5df159f72.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a Prop-valued definition: it states the claim without proving it).
Connected sets are sets that cannot be divided into two pieces that are far apart. Show all
IsPreconnected close match
def IsPreconnected {α : Type u} [TopologicalSpace α] : Set α → Prop
Mathlib.Topology.Connected.Basic · lines 50–52
Why close, not exact: Lean writes the condition as the absence of two open sets that cover the set, each meeting it, without meeting it in common, which is the precise form of the article's division into pieces that lie apart.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 95e5de1030ba · pair key be49420d29bb.
IsConnected special case
def IsConnected {α : Type u} [TopologicalSpace α] : Set α → Prop
Mathlib.Topology.Connected.Basic · lines 55–56
Why a special case: The library notion adds nonemptiness, so it reads the article's description only for nonempty sets.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 51b167f3210d · pair key 7dc10962be4e.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
Each choice of definition for 'open set' is called a topology. Show all
TopologicalSpace close match
class TopologicalSpace : Type u → Type u
Mathlib.Topology.Defs.Basic · lines 71–81
Why close, not exact: Lean's class carries the open-set predicate on subsets together with the three closure conditions the article lists a few lines further on.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key df03cba7d63e · pair key 68e8af994d79.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
A set with a topology is called a topological space. Show all
TopCat close match
structure TopCat
Mathlib.Topology.Category.TopCat.Basic · lines 31–37
Why close, not exact: Lean packs the carrier and the topology on it into a single structure, whose terms serve as the objects of the category of spaces.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1cefa109dde6 · pair key e5d931da6ee3.
Related, but states something else (1)
TopologicalSpace related
class TopologicalSpace : Type u → Type u
Mathlib.Topology.Defs.Basic · lines 71–81
How it differs: The class is the topology on a type, so it supplies the second ingredient rather than saying what a space is.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 4c5f4d21f2f6 · pair key 6796de01f8a9.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · A topology on a set ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
Let X be a set and let τ be a family of subsets of X. Then τ is called a topology on X if:[1][2] Both the empty set and X are elements of τ Any union of elements of τ is an element of τ Any intersection of finitely many elements of τ is an element of τ Show all
TopologicalSpace close match
class TopologicalSpace : Type u → Type u
Mathlib.Topology.Defs.Basic · lines 71–81
Why close, not exact: Lean axiomatises the whole set, intersections of two members and unions of arbitrary families, an equivalent set of conditions: the empty set is the union of the empty family, and finitely many intersections iterate the two-member one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1f68d04dec05 · pair key ecaafa153285.
isOpen_sUnion states part
theorem isOpen_sUnion {X : Type u} [TopologicalSpace X] {s : Set (Set X)} : (∀ t ∈ s, IsOpen t) → IsOpen (⋃₀ s)
Mathlib.Topology.Defs.Basic · lines 100–101
Why only part: Lean's lemma takes a set of open sets and concludes that the union of that collection is open.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 6c78325cb903 · pair key 2d5ae0473dde.
Set.Finite. isOpen_sInter states part
theorem Set.Finite.isOpen_sInter {X : Type u} [TopologicalSpace X] {s : Set (Set X)} : s.Finite → (∀ t ∈ s, IsOpen t) → IsOpen (⋂₀ s)
Mathlib.Topology.Basic · lines 93–99
Why only part: Lean's lemma asks that the collection be finite and each of its sets open, and concludes that the intersection is open.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 13af1ff0bf37 · pair key 2ee3c8209c7e.
isOpen_univ states part
theorem isOpen_univ {X : Type u} [TopologicalSpace X] : IsOpen Set.univ
Mathlib.Topology.Defs.Basic · line 95
Why only part: It covers the half of the first condition that concerns the whole set.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 74728acf570d · pair key 128a3254bfe2.
isOpen_empty states part
theorem isOpen_empty {X : Type u} [TopologicalSpace X] : IsOpen ∅
Mathlib.Topology.Basic · lines 90–91
Why only part: It covers the half of the first condition that concerns the empty set.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 5 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 0501780613bf · pair key 0e65bd96defb.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · A topology on a set ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
If τ is a topology on X, then the pair (X, τ) is called a topological space. Show all
TopCat close match
structure TopCat
Mathlib.Topology.Category.TopCat.Basic · lines 31–37
Why close, not exact: Lean records the pair as a one-structure object with a carrier field and a topology field, and these objects are the ones its category of spaces has.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3eb8fb121be2 · pair key 755e76bdac0d.
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · A topology on a set ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
The notation Xτ may be used to denote a set X endowed with the particular topology τ. Show all
WithTopology close match
structure WithTopology (X : Type u_1) : TopologicalSpace X → Type u_1
Mathlib.Topology.Defs.Basic · lines 250–254
Why close, not exact: Lean writes a named wrapper around X whose topology is transported from the one supplied, where the article writes the topology as a subscript.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 0ef71a7225db · pair key 6b6a3475f1ff.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · A topology on a set ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a Prop-valued definition: it states the claim without proving it).
The members of τ are called open sets in X. Show all
IsOpen close match
def IsOpen {X : Type u} [TopologicalSpace X] : Set X → Prop
Mathlib.Topology.Defs.Basic · line 93
Why close, not exact: Lean keeps the topology as a predicate on subsets and defines this to hold of a subset when that predicate does.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7b945c606d82 · pair key e395856f5084.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · A topology on a set ✓ Formalized
Formalized: Mathlib states this exactly (a definition).
The members of τ are called open sets in X. A subset of X is said to be closed if its complement is in τ (i.e., its complement is open). Show all
IsClosed exact match
class IsClosed {X : Type u} [TopologicalSpace X] : Set X → Prop
Mathlib.Topology.Defs.Basic · lines 105–107
Note: Mathlib's predicate holds of a set exactly when the complement belongs to the topology.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c1a06f090b22 · pair key aae34c721008.
isOpen_compl_iff close match
theorem isOpen_compl_iff {X : Type u} {s : Set X} [TopologicalSpace X] : IsOpen sᶜ ↔ IsClosed s
Mathlib.Topology.Basic · lines 124–125
Why close, not exact: The lemma unfolds the closedness predicate into the condition that the complement is open.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ec98b42ff3b0 · pair key e1218d2e2558.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · A topology on a set ✓ Formalized
Formalized: Mathlib states this exactly (a Prop-valued definition: it states the claim without proving it).
A subset of X may be open, closed, both (clopen set), or neither. Show all
IsClopen exact match
def IsClopen {X : Type u} [TopologicalSpace X] : Set X → Prop
Mathlib.Topology.Defs.Basic · lines 111–112
Note: Mathlib's predicate is the conjunction of being closed and being open, and the two conditions it conjoins are independent, so a subset may satisfy either, both or neither.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 83d356661a51 · pair key bfb495ab833b.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · A topology on a set ✓ Formalized
Formalized: Mathlib states this exactly (proved).
The empty set and X itself are always both closed and open. Show all
isClopen_empty exact match
theorem isClopen_empty {X : Type u} [TopologicalSpace X] : IsClopen ∅
Mathlib.Topology.Clopen · line 46
Note: Mathlib's clopen predicate conjoins closedness and openness, which is what the passage claims of the empty subset.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key cef55e5a2906 · pair key 75241b63e820.
isOpen_empty states part
theorem isOpen_empty {X : Type u} [TopologicalSpace X] : IsOpen ∅
Mathlib.Topology.Basic · lines 90–91
Why only part: The lemma speaks of openness only.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3a99a15b2fa7 · pair key 06a995aaddb6.
isClosed_empty states part
theorem isClosed_empty {X : Type u} [TopologicalSpace X] : IsClosed ∅
Mathlib.Topology.Basic · line 137
Why only part: The lemma speaks of closedness only.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3ba7875cf046 · pair key 9f60e04153e6.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · A topology on a set ✓ Formalized
Formalized: Mathlib states this exactly (proved).
The empty set and X itself are always both closed and open. Show all
isClopen_univ exact match
theorem isClopen_univ {X : Type u} [TopologicalSpace X] : IsClopen Set.univ
Mathlib.Topology.Clopen · line 48
Note: Mathlib writes the whole space as the universal subset of its carrier type, and the clopen predicate conjoins closedness and openness.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b1d53bc3ed24 · pair key ab231e78826c.
isOpen_univ states part
theorem isOpen_univ {X : Type u} [TopologicalSpace X] : IsOpen Set.univ
Mathlib.Topology.Defs.Basic · line 95
Why only part: The lemma speaks of openness only.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e1339969b64a · pair key a87445218d8c.
isClosed_univ states part
theorem isClosed_univ {X : Type u} [TopologicalSpace X] : IsClosed Set.univ
Mathlib.Topology.Basic · line 140
Why only part: The lemma speaks of closedness only.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7e4abaf12eae · pair key 0b9dd031dbbc.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · A topology on a set › Basis for a topology ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
A base (or basis) B for a topological space X with topology T is a collection of open sets in T such that every open set in T can be written as a union of elements of B.[3][4] Show all
TopologicalSpace. IsTopologicalBasis close match
structure TopologicalSpace.IsTopologicalBasis {α : Type u} [t : TopologicalSpace α] : Set (Set α) → Prop
Mathlib.Topology.Bases · lines 73–79
Why close, not exact: Mathlib encodes the same notion through a covering condition on the family, a condition on intersections of two of its members, and the equality of the topology with the one the family generates.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9f8bf9e997d0 · pair key 693e6cabbdcb.
TopologicalSpace.IsTopologicalBasis. open_iff_eq_sUnion close match
theorem TopologicalSpace.IsTopologicalBasis.open_iff_eq_sUnion {α : Type u} [t : TopologicalSpace α] {B : Set (Set α)} : TopologicalSpace.IsTopologicalBasis B → ∀ {u : Set α}, IsOpen u ↔ ∃ S ⊆ B, u = ⋃₀ S
Mathlib.Topology.Bases · lines 200–202
Why close, not exact: The lemma unfolds Mathlib's basis notion into the statement that the open sets are exactly the unions of subfamilies of the collection.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key fe20fdb29214 · pair key 4aeb0ec65357.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · A topology on a set › Basis for a topology ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
A base (or basis) B for a topological space X with topology T is a collection of open sets in T such that every open set in T can be written as a union of elements of B.[3][4] We say that the base generates the topology T. Show all
TopologicalSpace. generateFrom more general
def TopologicalSpace.generateFrom {α : Type u} : Set (Set α) → TopologicalSpace α
Mathlib.Topology.Order · lines 70–74
Why more general: Mathlib's construction takes any family of subsets to the coarsest topology in which they are open, so it also covers families that are not bases.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 22962aeb42f6 · pair key d0ff0b36474f.
TopologicalSpace. eq_generateFrom_countableBasis special case
theorem TopologicalSpace.eq_generateFrom_countableBasis (α : Type u) [t : TopologicalSpace α] [SecondCountableTopology α] : t = TopologicalSpace.generateFrom (TopologicalSpace.countableBasis α)
Mathlib.Topology.Bases · lines 837–839
Why a special case: The statement is restricted to spaces carrying a countable basis.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 00bfa09bbc05 · pair key 4d253ca3ad7e.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · A topology on a set › Subspace and quotient ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
Every subset of a topological space can be given the subspace topology in which the open sets are the intersections of the open sets of the larger space with the subset. Show all
instTopologicalSpaceSubtype close match
instance instTopologicalSpaceSubtype {X : Type*} {p : X → Prop} [t : TopologicalSpace X] : TopologicalSpace (Subtype p)
Mathlib.Topology.Defs.Induced · lines 77–79
Why close, not exact: Mathlib carries the subset as the subtype of elements satisfying a predicate, and its open sets are the restrictions of the ambient open sets along the inclusion.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f3b9ecbd5e98 · pair key e18ee6e2af22.
TopologicalSpace. induced more general
def TopologicalSpace.induced {X : Type*} {Y : Type*} : (X → Y) → TopologicalSpace Y → TopologicalSpace X
Mathlib.Topology.Defs.Induced · lines 64–74
Why more general: Mathlib's construction works along any map into a topological space, the inclusion of a subset being one instance of it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d0df23144745 · pair key 6eeb05e245f8.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · A topology on a set › Subspace and quotient ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
For any indexed family of topological spaces, the product can be given the product topology, which is generated by the inverse images of open sets of the factors under the projection mappings. Show all
Pi. topologicalSpace close match
instance Pi.topologicalSpace {ι : Type*} {Y : ι → Type v} [t₂ : (i : ι) → TopologicalSpace (Y i)] : TopologicalSpace ((i : ι) → Y i)
Mathlib.Topology.Constructions · lines 65–67
Why close, not exact: Mathlib builds the product topology as the infimum of the topologies induced by the coordinate projections, which is the topology the projections' preimages of open sets generate.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 705688896123 · pair key 6dc1931f5f98.
Related, but states something else (1)
pi_eq_generateFrom related
theorem pi_eq_generateFrom {ι : Type*} {A : ι → Type*} [T : (i : ι) → TopologicalSpace (A i)] : Pi.topologicalSpace = TopologicalSpace.generateFrom {g | ∃ s i, (∀ a ∈ i, IsOpen (s a)) ∧ g = (↑i).pi s}
Mathlib.Topology.Constructions · lines 1170–1177
How it differs: It presents the product topology as generated by the sets that constrain finitely many coordinates to open sets.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key bb83b8f3038f · pair key 44b9b389f63c.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · A topology on a set › Subspace and quotient ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
For example, in finite products, a basis for the product topology consists of all products of open sets. Show all
isOpen_pi_iff' close match
theorem isOpen_pi_iff' {ι : Type*} {A : ι → Type*} [T : (i : ι) → TopologicalSpace (A i)] [Finite ι] {s : Set ((a : ι) → A a)} : IsOpen s ↔ ∀ f ∈ s, ∃ u, (∀ (a : ι), IsOpen (u a) ∧ f a ∈ u a) ∧ Set.univ.pi u ⊆ s
Mathlib.Topology.Constructions · lines 1102–1117
Why close, not exact: Lean writes the basis property pointwise, as a criterion for openness in terms of products of open factors, rather than naming the collection as a basis.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 6af33cb69fd0 · pair key d69c04b6e1cb.
prod_eq_generateFrom special case
theorem prod_eq_generateFrom {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] : instTopologicalSpaceProd = TopologicalSpace.generateFrom {g | ∃ s t, IsOpen s ∧ IsOpen t ∧ g = s ×ˢ t}
Mathlib.Topology.Constructions.SumProd · lines 435–443
Why a special case: Lean fixes the number of factors at two, so it covers the passage only for a product of a pair of spaces.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 8b973dfb6376 · pair key 6484297e0f3d.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · A topology on a set › Subspace and quotient ◔ Partial
Partial: Mathlib states a more general result, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.
For infinite products, there is the additional requirement that in a basic open set, all but finitely many of its projections are the entire space. Show all
pi_eq_generateFrom more general
theorem pi_eq_generateFrom {ι : Type*} {A : ι → Type*} [T : (i : ι) → TopologicalSpace (A i)] : Pi.topologicalSpace = TopologicalSpace.generateFrom {g | ∃ s i, (∀ a ∈ i, IsOpen (s a)) ∧ g = (↑i).pi s}
Mathlib.Topology.Constructions · lines 1170–1177
Why more general: Lean states it for an arbitrary index type, so it also covers products of finitely many factors, where the restriction to finitely many coordinates says nothing new.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a2e8a5b267a1 · pair key 40eb1d089652.
Related, but states something else (1)
isTopologicalBasis_pi related
theorem isTopologicalBasis_pi {ι : Type*} {X : ι → Type*} [(i : ι) → TopologicalSpace (X i)] {T : (i : ι) → Set (Set (X i))} : (∀ (i : ι), TopologicalSpace.IsTopologicalBasis (T i)) → TopologicalSpace.IsTopologicalBasis {S | ∃ U F, (∀ i ∈ F, U i ∈ T i) ∧ S = (↑F).pi U}
Mathlib.Topology.Bases · lines 637–641
How it differs: It carries bases of the factors over to the product, so it yields the passage's basic open sets only after each factor's topology is first read as a basis of itself.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 0a67bd6ec837 · pair key 59c765a07d06.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · A topology on a set › Subspace and quotient ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
A quotient space is defined as follows: if X is a topological space and Y is a set, and if f : X→ Y is a surjective function, then the quotient topology on Y is the collection of subsets of Y that have open inverse images under f. Show all
TopologicalSpace. coinduced more general
def TopologicalSpace.coinduced {X : Type*} {Y : Type*} : (X → Y) → TopologicalSpace X → TopologicalSpace Y
Mathlib.Topology.Defs.Induced · lines 86–90
Why more general: Lean builds this topology for an arbitrary map, so it also covers maps that are not onto, where the construction still carries content.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c5b347f62c9b · pair key 19bc9aafc4fe.
isOpen_coinduced more general
theorem isOpen_coinduced {α : Type*} {β : Type*} {t : TopologicalSpace α} {s : Set β} {f : α → β} : IsOpen s ↔ IsOpen (f ⁻¹' s)
Mathlib.Topology.Order · lines 422–424
Why more general: Lean states the openness criterion for an arbitrary map, so it also applies to maps that are not onto.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key fd60fd830dac · pair key 69ce0a972996.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · A topology on a set › Subspace and quotient ✓ Formalized
Formalized: Mathlib states a more general result (proved).
In other words, the quotient topology is the finest topology on Y for which f is continuous. Show all
continuous_iff_coinduced_le more general
theorem continuous_iff_coinduced_le {α : Type u} {β : Type v} {f : α → β} {t₁ : TopologicalSpace α} {t₂ : TopologicalSpace β} : Continuous f ↔ TopologicalSpace.coinduced f t₁ ≤ t₂
Mathlib.Topology.Order · lines 764–766
Why more general: In Lean's order on topologies the finer one is the smaller, and the equivalence is stated for an arbitrary map rather than a surjection.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 60fe01483250 · pair key c25133ccaa0b.
Related, but states something else (1)
continuous_coinduced_rng related
theorem continuous_coinduced_rng {α : Type u} {β : Type v} {f : α → β} {t : TopologicalSpace α} : Continuous f
Mathlib.Topology.Order · lines 785–787
How it differs: It gives continuity of the map for the constructed topology but says nothing about where that topology sits among the others.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c5901fa62f37 · pair key aa1bd54bfe07.
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · A topology on a set › Subspace and quotient ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
A common example of a quotient topology is when an equivalence relation is defined on the topological space X. The map f is then the natural projection onto the set of equivalence classes. Show all
instTopologicalSpaceQuotient close match
instance instTopologicalSpaceQuotient {X : Type u} {s : Setoid X} [t : TopologicalSpace X] : TopologicalSpace (Quotient s)
Mathlib.Topology.Constructions · lines 57–59
Why close, not exact: Lean carries the classes of the relation as a quotient type and gives it the topology taken along the canonical map onto that type.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2c1853c61ba7 · pair key 4ede0164afb6.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · A topology on a set › Examples of topological spaces ✕ Not formalized
A given set may have many different topologies. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 929f30ab5c59). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · A topology on a set › Examples of topological spaces › Discrete and trivial topologies ◔ Partial
Partial: Mathlib states this up to a convention difference, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.
Any set can be given the discrete topology, in which every subset is open. Show all
discreteTopology_bot close match
theorem discreteTopology_bot (α : Type*) : DiscreteTopology α
Mathlib.Topology.Order · lines 313–314
Why close, not exact: Lean records discreteness as equality with the bottom topology, and openness of all subsets is how that predicate unfolds.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f0fdcd300047 · pair key a91fcb70af35.
discreteTopology_iff_forall_isOpen close match
theorem discreteTopology_iff_forall_isOpen {α : Type*} [TopologicalSpace α] : DiscreteTopology α ↔ ∀ (s : Set α), IsOpen s
Mathlib.Topology.Order · lines 361–363
Why close, not exact: Lean spells out its discreteness predicate as the condition that all subsets are open.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 5f2e8b38c077 · pair key dec9f5ccc6c9.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · A topology on a set › Examples of topological spaces › Discrete and trivial topologies ✓ Formalized
Formalized: Mathlib states a more general result (proved).
The only convergent sequences or nets in this topology are those that are eventually constant. Show all
nhds_discrete more general
theorem nhds_discrete (α : Type*) [TopologicalSpace α] [DiscreteTopology α] : 𝓝 = Pure.pure
Mathlib.Topology.Order · lines 346–347
Why more general: Lean states the neighbourhood filter at each point, which governs nets and filters as well as sequences; reading convergence to such a filter as eventual constancy is only a change of encoding.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 720b2966538c · pair key b1bc71fede2b.
Related, but states something else (1)
Filter. eventuallyConst_iff_tendsto related
theorem Filter.eventuallyConst_iff_tendsto {α : Type*} {β : Type*} {l : Filter α} {f : α → β} [Nonempty β] : Filter.EventuallyConst f l ↔ ∃ x, Filter.Tendsto f l (Pure.pure x)
Mathlib.Order.Filter.EventuallyConst · lines 50–52
How it differs: It links eventual constancy with convergence to a pure filter without mentioning any topology, so it reaches the passage only together with the description of neighbourhoods in a discrete space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e9730f15dea6 · pair key 1676c4b7af30.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · A topology on a set › Examples of topological spaces › Discrete and trivial topologies ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
The only convergent sequences or nets in this topology are those that are eventually constant. Show all
nhds_discrete close match
theorem nhds_discrete (α : Type*) [TopologicalSpace α] [DiscreteTopology α] : 𝓝 = Pure.pure
Mathlib.Topology.Order · lines 346–347
Why close, not exact: The library writes the fact as an equality of neighbourhood filters with the principal filters, and membership in such a filter is eventual equality to the point, so convergence of a net reads off as eventual constancy.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a652dcee6d26 · pair key 9cb62eb4251c.
Related, but states something else (1)
Filter. eventuallyConst_iff_tendsto related
theorem Filter.eventuallyConst_iff_tendsto {α : Type*} {β : Type*} {l : Filter α} {f : α → β} [Nonempty β] : Filter.EventuallyConst f l ↔ ∃ x, Filter.Tendsto f l (Pure.pure x)
Mathlib.Order.Filter.EventuallyConst · lines 50–52
How it differs: This links eventual constancy of a function along a filter with convergence to a principal filter, but it fixes no topology and so says nothing about the discrete one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2348f1eb7892 · pair key 2eee7350ef59.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · A topology on a set › Examples of topological spaces › Discrete and trivial topologies ◔ Partial
Partial: Mathlib states this up to a convention difference, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.
Also, any set can be given the trivial topology (also called the indiscrete topology), in which only the empty set and the whole space are open. Show all
TopologicalSpace. isOpen_top_iff close match
theorem TopologicalSpace.isOpen_top_iff {α : Type*} (U : Set α) : IsOpen U ↔ U = ∅ ∨ U = Set.univ
Mathlib.Topology.Order · lines 288–289
Why close, not exact: The library's greatest topology is the one the passage calls trivial, and this theorem gives it by the defining formula the passage uses for its open sets.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 59e8d81f7783 · pair key f5afcb84e1c8.
IndiscreteTopology. isOpen_iff close match
theorem IndiscreteTopology.isOpen_iff {α : Type*} {t₂ : TopologicalSpace α} [IndiscreteTopology α] (U : Set α) : IsOpen U ↔ U = ∅ ∨ U = Set.univ
Mathlib.Topology.Order · lines 275–286
Why close, not exact: The library names the trivial topology through a class and this theorem gives the open sets of a space carrying it by the passage's formula.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 13eee441df2b · pair key 7ac2028a0908.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · A topology on a set › Examples of topological spaces › Discrete and trivial topologies ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Every sequence and net in this topology converges to every point of the space. Show all
IndiscreteTopology. nhds_eq more general
theorem IndiscreteTopology.nhds_eq {α : Type u} [TopologicalSpace α] [IndiscreteTopology α] (a : α) : 𝓝 a = ⊤
Mathlib.Topology.Order · lines 727–730
Why more general: The declaration covers convergence along every filter, of which the filter of a sequence is one case, so it gives more than the sequences the passage speaks of.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3c9fd4c21289 · pair key 434cbd4284cb.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · A topology on a set › Examples of topological spaces › Discrete and trivial topologies ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
Every sequence and net in this topology converges to every point of the space. Show all
IndiscreteTopology. nhds_eq close match
theorem IndiscreteTopology.nhds_eq {α : Type u} [TopologicalSpace α] [IndiscreteTopology α] (a : α) : 𝓝 a = ⊤
Mathlib.Topology.Order · lines 727–730
Why close, not exact: The library carries nets through their image filters and records the trivial topology by the equation making each point's neighbourhood filter the greatest one, which is the filter every net's image filter sits below.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key fccdf28c9e79 · pair key 44c4287a1846.
Related, but states something else (1)
clusterPt_of_indiscreteTopology related
theorem clusterPt_of_indiscreteTopology {α : Type u} [TopologicalSpace α] [IndiscreteTopology α] {x : α} {f : Filter α} [f.NeBot] : ClusterPt x f
Mathlib.Topology.Order · lines 732–734
How it differs: This gives every point as a cluster point of a nontrivial filter, which is weaker than being a limit, and it adds a nontriviality assumption.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 95f9fb4793ac · pair key c1cbefa9865e.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · A topology on a set › Examples of topological spaces › Discrete and trivial topologies ✕ Not formalized
This example shows that in general topological spaces, limits of sequences need not be unique. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 0ed68e2886d1). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · A topology on a set › Examples of topological spaces › Discrete and trivial topologies ✓ Formalized
Formalized: Mathlib states this exactly (proved).
However, often topological spaces must be Hausdorff spaces where limit points are unique. Show all
tendsto_nhds_unique exact match
theorem tendsto_nhds_unique {X : Type*} {Y : Type*} [TopologicalSpace X] [T2Space X] {f : Y → X} {l : Filter Y} {a b : X} [l.NeBot] : Filter.Tendsto f l (𝓝 a) → Filter.Tendsto f l (𝓝 b) → a = b
Mathlib.Topology.Separation.Hausdorff · lines 180–182
Note: The index filter is required to be nontrivial, a condition met by the filter of any sequence or net, so every object the passage speaks of is covered.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9605f0e1b6fb · pair key 0d2924d06069.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · A topology on a set › Examples of topological spaces › Cofinite and cocountable topologies ✓ Formalized
Formalized: Mathlib states this exactly (a definition).
Any set can be given the cofinite topology in which the open sets are the empty set and the sets whose complement is finite. Show all
TopologicalSpace. cofinite exact match
def TopologicalSpace.cofinite {X : Type*} : TopologicalSpace X
Mathlib.Topology.Constructions · lines 277–287
Note: This is the construction the passage names, defined on any type with the same two cases for an open set.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f677167675c1 · pair key 52d1ddc2dc30.
CofiniteTopology. isOpen_iff' close match
theorem CofiniteTopology.isOpen_iff' {X : Type u} {s : Set (CofiniteTopology X)} : IsOpen s ↔ s = ∅ ∨ sᶜ.Finite
Mathlib.Topology.Constructions · lines 304–305
Why close, not exact: The library packages the construction as a type synonym and this theorem gives its open sets by the defining formula the passage states.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 0c677c33258f · pair key e46a185d2c67.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · A topology on a set › Examples of topological spaces › Cofinite and cocountable topologies ◔ Partial
Partial: Mathlib states part of this (proved).
This is the smallest T1 topology on any infinite set. Show all
CofiniteTopology. continuous_of states part
theorem CofiniteTopology.continuous_of {X : Type*} [TopologicalSpace X] [T1Space X] : Continuous ⇑CofiniteTopology.of
Mathlib.Topology.Separation.Basic · lines 474–475
Why only part: This gives the minimality half of the passage; that the cofinite topology is itself T1 is the other half, recorded separately.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a7fed0cfbd78 · pair key 0e6750f43fe4.
instT1SpaceCofiniteTopology states part
instance instT1SpaceCofiniteTopology {X : Type*} : T1Space (CofiniteTopology X)
Mathlib.Topology.Separation.Basic · lines 424–425
Why only part: This gives membership of the cofinite topology in the family of T1 topologies, not its minimality in that family.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7790456625bf · pair key 837f32306d67.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · A topology on a set › Examples of topological spaces › Cofinite and cocountable topologies ✕ Not formalized
Any set can be given the cocountable topology, in which a set is defined as open if it is either empty or its complement is countable. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 3 candidates examined (receipt 17deea63acea). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · A topology on a set › Examples of topological spaces › Topologies on the real and complex numbers ◔ Partial
Partial: Mathlib states a special case (proved).
The standard topology on R is generated by the open intervals. Show all
Real. isTopologicalBasis_Ioo_rat special case
theorem Real.isTopologicalBasis_Ioo_rat : TopologicalSpace.IsTopologicalBasis (⋃ a, ⋃ b, ⋃ (_ : a < b), {Set.Ioo ↑a ↑b})
Mathlib.Topology.Instances.Real.Lemmas · lines 31–41
Why a special case: Mathlib cuts the endpoints down to rationals, a sub-family of the intervals the passage names.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3963f7db567a · pair key 87926f4faa7e.
Related, but states something else (1)
instOrderTopologyReal related
instance instOrderTopologyReal : OrderTopology ℝ
Mathlib.Topology.MetricSpace.Pseudo.Lemmas · lines 23–25
How it differs: It records that the reals carry the order topology, which Mathlib generates from the open rays rather than from bounded intervals.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b257484af27a · pair key 9f59cf836d54.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · A topology on a set › Examples of topological spaces › Topologies on the real and complex numbers ◔ Partial
Partial: Mathlib states a special case (proved).
The set of all open intervals forms a base or basis for the topology, meaning that every open set is a union of some collection of sets from the base. Show all
Real. isTopologicalBasis_Ioo_rat special case
theorem Real.isTopologicalBasis_Ioo_rat : TopologicalSpace.IsTopologicalBasis (⋃ a, ⋃ b, ⋃ (_ : a < b), {Set.Ioo ↑a ↑b})
Mathlib.Topology.Instances.Real.Lemmas · lines 31–41
Why a special case: The base Mathlib exhibits consists of intervals with rational endpoints, a sub-family of the ones the passage collects.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 6b1d340ef325 · pair key b03fe021518b.
Related, but states something else (2)
TopologicalSpace.IsTopologicalBasis. open_eq_sUnion related
theorem TopologicalSpace.IsTopologicalBasis.open_eq_sUnion {α : Type u} [t : TopologicalSpace α] {B : Set (Set α)} : TopologicalSpace.IsTopologicalBasis B → ∀ {u : Set α}, IsOpen u → ∃ S ⊆ B, u = ⋃₀ S
Mathlib.Topology.Bases · lines 196–198
How it differs: It is the passage from a base to writing an open set as a union of its members, stated for any space and any base.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 0e66cb8b1ec6 · pair key cd3627289fae.
mem_nhds_iff_exists_Ioo_subset related
theorem mem_nhds_iff_exists_Ioo_subset {α : Type u} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] [NoMaxOrder α] [NoMinOrder α] {a : α} {s : Set α} : s ∈ 𝓝 a ↔ ∃ l u, a ∈ Set.Ioo l u ∧ Set.Ioo l u ⊆ s
Mathlib.Topology.Order.Basic · lines 508–510
How it differs: It describes the neighbourhoods of a point in an order topology by the intervals around it, not the open sets themselves.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 84f6c77b8446 · pair key 20dd4caa681b.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · A topology on a set › Examples of topological spaces › Topologies on the real and complex numbers ✓ Formalized
Formalized: Mathlib states a more general result (proved).
In particular, this means that a set is open if there exists an open interval of non zero radius about every point in the set. Show all
Metric. isOpen_iff more general
theorem Metric.isOpen_iff {α : Type u} [PseudoMetricSpace α] {s : Set α} : IsOpen s ↔ ∀ x ∈ s, ∃ ε > 0, Metric.ball x ε ⊆ s
Mathlib.Topology.MetricSpace.Pseudo.Defs · lines 835–836
Why more general: Mathlib spells the interval of radius r around a point as a metric ball; on the real line the two name the same set.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 05b8f7bb9506 · pair key 8de3ce330249.
Related, but states something else (2)
Real. ball_eq_Ioo related
theorem Real.ball_eq_Ioo (x r : ℝ) : Metric.ball x r = Set.Ioo (x - r) (x + r)
Mathlib.Topology.MetricSpace.Pseudo.Defs · lines 1130–1133
How it differs: It identifies a ball of the real line with the interval centred at the same point, which is the spelling the passage uses.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a95adb2b94fc · pair key b277be9cf1f3.
mem_nhds_iff_exists_Ioo_subset related
theorem mem_nhds_iff_exists_Ioo_subset {α : Type u} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] [NoMaxOrder α] [NoMinOrder α] {a : α} {s : Set α} : s ∈ 𝓝 a ↔ ∃ l u, a ∈ Set.Ioo l u ∧ Set.Ioo l u ⊆ s
Mathlib.Topology.Order.Basic · lines 508–510
How it differs: It gives the neighbourhoods of a point by the intervals around it in any order topology without endpoints.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key dfc53aa57e4c · pair key 63137a1c1e82.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · A topology on a set › Examples of topological spaces › Topologies on the real and complex numbers ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
More generally, the Euclidean spaces Rn can be given a topology. Show all
Pi. topologicalSpace more general
instance Pi.topologicalSpace {ι : Type*} {Y : ι → Type v} [t₂ : (i : ι) → TopologicalSpace (Y i)] : TopologicalSpace ((i : ι) → Y i)
Mathlib.Topology.Constructions · lines 65–67
Why more general: Mathlib builds the product topology for any indexed family of spaces; n copies of the real line is the case the passage names, and this is their usual topology.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 603e83de9e9c · pair key f7e7396e89e7.
PiLp. instMetricSpace more general
instance PiLp.instMetricSpace (p : ENNReal) {ι : Type*} (α : ι → Type*) [hp : Fact (1 ≤ p)] [Fintype ι] [(i : ι) → MetricSpace (α i)] : MetricSpace (PiLp p α)
Mathlib.Analysis.Normed.Lp.PiLp · lines 625–626
Why more general: Mathlib states it for every exponent at least one and every finite family of metric spaces, and it carries a distance besides the topology.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 449efb83ab8c · pair key 4fd6a36294bb.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · A topology on a set › Examples of topological spaces › Topologies on the real and complex numbers ◔ Partial
Partial: Mathlib states a more general result, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.
In the usual topology on Rn the basic open sets are the open balls. Show all
Metric. isOpen_iff more general
theorem Metric.isOpen_iff {α : Type u} [PseudoMetricSpace α] {s : Set α} : IsOpen s ↔ ∀ x ∈ s, ∃ ε > 0, Metric.ball x ε ⊆ s
Mathlib.Topology.MetricSpace.Pseudo.Defs · lines 835–836
Why more general: Mathlib states the criterion for any pseudometric space; its balls at the Euclidean metric are the round balls of the passage.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 8c7764e9f08d · pair key 14e2103007b0.
Metric. nhds_basis_ball more general
theorem Metric.nhds_basis_ball {α : Type u} [PseudoMetricSpace α] {x : α} : (𝓝 x).HasBasis (fun x ↦ 0 < x) (Metric.ball x)
Mathlib.Topology.MetricSpace.Pseudo.Defs · lines 775–776
Why more general: Mathlib states it for any pseudometric space and phrases the base as a filter basis of the neighbourhoods of each point.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f1b6bb0c23f3 · pair key 777f797eec6e.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · A topology on a set › Examples of topological spaces › Topologies on the real and complex numbers ◔ Partial
Partial: Mathlib states a more general result, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.
Similarly, C, the set of complex numbers, and Cn have a standard topology in which the basic open sets are open balls. Show all
Metric. isOpen_iff more general
theorem Metric.isOpen_iff {α : Type u} [PseudoMetricSpace α] {s : Set α} : IsOpen s ↔ ∀ x ∈ s, ∃ ε > 0, Metric.ball x ε ⊆ s
Mathlib.Topology.MetricSpace.Pseudo.Defs · lines 835–836
Why more general: Mathlib states the criterion for any pseudometric space; at the complex numbers the balls are the discs of the passage.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 88ae32e7cf20 · pair key b6ae83307867.
Metric. nhds_basis_ball more general
theorem Metric.nhds_basis_ball {α : Type u} [PseudoMetricSpace α] {x : α} : (𝓝 x).HasBasis (fun x ↦ 0 < x) (Metric.ball x)
Mathlib.Topology.MetricSpace.Pseudo.Defs · lines 775–776
Why more general: Mathlib states it for any pseudometric space and phrases the base as a filter basis at each point.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 90d3151130af · pair key 6d17485e4810.
Related, but states something else (1)
Complex. instNormedField related
instance Complex.instNormedField : NormedField ℂ
Mathlib.Analysis.Complex.Basic · lines 65–67
How it differs: It equips the complex numbers with the norm from which Mathlib derives their distance and their standard topology.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e1684fc55d79 · pair key b87b33bc4279.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · A topology on a set › Examples of topological spaces › Topologies on the real and complex numbers ◔ Partial
Partial: Mathlib states a more general result, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.
Similarly, C, the set of complex numbers, and Cn have a standard topology in which the basic open sets are open balls. Show all
Metric. isOpen_iff more general
theorem Metric.isOpen_iff {α : Type u} [PseudoMetricSpace α] {s : Set α} : IsOpen s ↔ ∀ x ∈ s, ∃ ε > 0, Metric.ball x ε ⊆ s
Mathlib.Topology.MetricSpace.Pseudo.Defs · lines 835–836
Why more general: Mathlib states the criterion for any pseudometric space; over n complex coordinates its balls are the ones the passage calls basic.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 4f56c7370f8c · pair key ebea7d212c6c.
Metric. nhds_basis_ball more general
theorem Metric.nhds_basis_ball {α : Type u} [PseudoMetricSpace α] {x : α} : (𝓝 x).HasBasis (fun x ↦ 0 < x) (Metric.ball x)
Mathlib.Topology.MetricSpace.Pseudo.Defs · lines 775–776
Why more general: Mathlib states it for any pseudometric space, as a filter basis of the neighbourhoods of each point.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 31f37f41900b · pair key 4b3a515d807f.
Related, but states something else (1)
PiLp. instMetricSpace related
instance PiLp.instMetricSpace (p : ENNReal) {ι : Type*} (α : ι → Type*) [hp : Fact (1 ≤ p)] [Fintype ι] [(i : ι) → MetricSpace (α i)] : MetricSpace (PiLp p α)
Mathlib.Analysis.Normed.Lp.PiLp · lines 625–626
How it differs: At exponent 2 over n complex factors it gives those tuples the distance from which their standard topology is built.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key adcf4bfc0155 · pair key c1df65bfbead.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · A topology on a set › Examples of topological spaces › Topologies on the real and complex numbers ✕ Not formalized
The real line can also be given the lower limit topology. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 901455491044). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · A topology on a set › Examples of topological spaces › Topologies on the real and complex numbers ✕ Not formalized
Here, the basic open sets are the half open intervals [a, b). Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 043194412017). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · A topology on a set › Examples of topological spaces › Topologies on the real and complex numbers ✕ Not formalized
This topology on R is strictly finer than the Euclidean topology defined above ; a sequence converges to a point in this topology if and only if it converges from above in the Euclidean topology. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 068b9369faaf). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · A topology on a set › Examples of topological spaces › Topologies on the real and complex numbers ✕ Not formalized
This topology on R is strictly finer than the Euclidean topology defined above; a sequence converges to a point in this topology if and only if it converges from above in the Euclidean topology. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt feb39d1ef7d7). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · A topology on a set › Examples of topological spaces › The metric topology ◔ Partial
Partial: Mathlib states a more general result, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.
Every metric space can be given a metric topology, in which the basic open sets are open balls defined by the metric. Show all
Metric. isOpen_iff more general
theorem Metric.isOpen_iff {α : Type u} [PseudoMetricSpace α] {s : Set α} : IsOpen s ↔ ∀ x ∈ s, ∃ ε > 0, Metric.ball x ε ⊆ s
Mathlib.Topology.MetricSpace.Pseudo.Defs · lines 835–836
Why more general: The declaration is stated for pseudometric spaces, where the distance may vanish between distinct points, a wider setting than the passage's metric spaces.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 53a7f567a82a · pair key cf8885bbc7ba.
Metric. nhds_basis_ball more general
theorem Metric.nhds_basis_ball {α : Type u} [PseudoMetricSpace α] {x : α} : (𝓝 x).HasBasis (fun x ↦ 0 < x) (Metric.ball x)
Mathlib.Topology.MetricSpace.Pseudo.Defs · lines 775–776
Why more general: Like the companion lemma it is phrased for pseudometric spaces, so it also covers distances that vanish between distinct points.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 28494df89be8 · pair key 28ba93c2d5ec.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · A topology on a set › Examples of topological spaces › The metric topology ✓ Formalized
Formalized: Mathlib states a more general result (proved).
This is the standard topology on any normed vector space. Show all
NormedAddCommGroup. nhds_basis_norm_lt more general
theorem NormedAddCommGroup.nhds_basis_norm_lt {E : Type*} [SeminormedAddCommGroup E] (x : E) : (𝓝 x).HasBasis (fun ε ↦ 0 < ε) fun ε ↦ {y | ‖y - x‖ < ε}
Mathlib.Analysis.Normed.Group.Basic · line 977
Why more general: The declaration is phrased for seminormed additive commutative groups, which need no scalar action and allow a vanishing seminorm, so it reaches past normed vector spaces.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3adf47add1bc · pair key 8fb103b3027f.
Related, but states something else (1)
dist_eq_norm related
theorem dist_eq_norm {E : Type*} [SeminormedAddCommGroup E] (a b : E) : Dist.dist a b = ‖a - b‖
Mathlib.Analysis.Normed.Group.Basic · line 735
How it differs: It equates the space's distance with the norm of the difference but states nothing about topologies on its own.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d6f285c8d616 · pair key 3997977731d5.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · A topology on a set › Examples of topological spaces › The metric topology ✓ Formalized
Formalized: Mathlib states a more general result (proved).
On a finite-dimensional vector space this topology is the same for all norms. Show all
isModuleTopologyOfFiniteDimensional more general
theorem isModuleTopologyOfFiniteDimensional {𝕜 : Type u} [hnorm : NontriviallyNormedField 𝕜] {E : Type v} [AddCommGroup E] [_root_.Module 𝕜 E] [TopologicalSpace E] [IsTopologicalAddGroup E] [ContinuousSMul 𝕜 E] [CompleteSpace 𝕜] [T2Space E] [FiniteDimensional 𝕜 E] : IsModuleTopology 𝕜 E
Mathlib.Topology.Algebra.Module.FiniteDimension · lines 271–281
Why more general: It is stated for any complete nontrivially normed scalar field and any Hausdorff vector-space topology, so it reaches well past the real and complex norms the passage has in view.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c9f8107e40dc · pair key 5a28ecf3dc75.
Related, but states something else (1)
LinearMap. continuous_of_finiteDimensional related
theorem LinearMap.continuous_of_finiteDimensional {𝕜 : Type u} [hnorm : NontriviallyNormedField 𝕜] {E : Type v} [AddCommGroup E] [_root_.Module 𝕜 E] [TopologicalSpace E] [IsTopologicalAddGroup E] [ContinuousSMul 𝕜 E] {F' : Type x} [AddCommGroup F'] [_root_.Module 𝕜 F'] [TopologicalSpace F'] [IsTopologicalAddGroup F'] [ContinuousSMul 𝕜 F'] [CompleteSpace 𝕜] [T2Space E] [FiniteDimensional 𝕜 E] (f : E →ₗ[𝕜] F') : Continuous ⇑f
Mathlib.Topology.Algebra.Module.FiniteDimension · lines 284–286
How it differs: It says every linear map out of such a space is continuous, which bears on comparing norms but is a different assertion from the equality of the topologies.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 8fbf114c77d3 · pair key dc6d1b66ab98.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · A topology on a set › Examples of topological spaces › Further examples ✕ Not formalized
There exist numerous topologies on any given finite set. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt ec0c622f0b26). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · A topology on a set › Examples of topological spaces › Further examples ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
Such spaces are called finite topological spaces. Show all
FinTopCat close match
structure FinTopCat
Mathlib.Topology.Category.FinTopCat · lines 27–30
Why close, not exact: The library packages a finite carrier together with its topology as one bundled object.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key bce89b54e8a5 · pair key 11971a68840e.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · A topology on a set › Examples of topological spaces › Further examples ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
Every manifold has a natural topology , since it is locally Euclidean. Show all
ChartedSpaceCore. toTopologicalSpace more general
def ChartedSpaceCore.toTopologicalSpace {H : Type u} {M : Type*} [TopologicalSpace H] : ChartedSpaceCore H M → TopologicalSpace M
Mathlib.Geometry.Manifold.ChartedSpace · lines 643–646
Why more general: The construction works for charts into any topological model space, Euclidean space among them.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key fbe427ea0667 · pair key cc742ee3562d.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · A topology on a set › Examples of topological spaces › Further examples ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
Every manifold has a natural topology, since it is locally Euclidean. Show all
ChartedSpace more general
class ChartedSpace (H : Type*) [TopologicalSpace H] (M : Type*) [TopologicalSpace M]
Mathlib.Geometry.Manifold.ChartedSpace · lines 141–147
Why more general: Mathlib states the notion over an arbitrary topological model space, with Euclidean n-space one choice of that model.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ed4a64f2fbbd · pair key b0776f88cde3.
Related, but states something else (1)
mem_chart_source related
theorem mem_chart_source (H : Type*) {M : Type*} [TopologicalSpace H] [TopologicalSpace M] [ChartedSpace H M] (x : M) : x ∈ (chartAt H x).source
Mathlib.Geometry.Manifold.ChartedSpace · lines 160–162
How it differs: The chart it names is an open partial homeomorphism, so its source is an open neighbourhood mapped homeomorphically into the model.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9316d90fe5c8 · pair key 6b6e4b29db2c.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · A topology on a set › Examples of topological spaces › Further examples ✓ Formalized
Formalized: TauCeti states this up to a convention difference (a definition).
Similarly, every simplex and every simplicial complex inherits a natural topology from Rn. Show all
AbstractSimplicialComplex. instTopologicalSpaceStandardSimplex close match
instance AbstractSimplicialComplex.instTopologicalSpaceStandardSimplex {ι : Type*} (σ : Finset ι) : TopologicalSpace (AbstractSimplicialComplex.StandardSimplex σ)
TauCeti.AlgebraicTopology.SimplicialComplex.Realization.Basic · lines 110–111
Why close, not exact: The library writes a simplex in barycentric coordinates indexed by its vertices and gives it the topology induced from the coordinatewise real topology.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key 2cf8191dd6b4 · pair key e858f06e87bf.
Convexity.StdSimplex. topologicalSpace more general
instance Convexity.StdSimplex.topologicalSpace (R : Type u) [PartialOrder R] [Ring R] [TopologicalSpace R] [IsStrictOrderedRing R] (M : Type v) : TopologicalSpace (Convexity.StdSimplex R M)
Mathlib.Geometry.Convex.ConvexSpace.Topology · lines 89–91
Why more general: It is stated for any strictly ordered topological ring and any index type, including infinite ones where the topology is built from the finite pieces.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a4239bb5983f · pair key ac480e78a638.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · A topology on a set › Examples of topological spaces › Further examples ✓ Formalized
Formalized: TauCeti states a more general result (a definition).
Similarly, every simplex and every simplicial complex inherits a natural topology from Rn. Show all
AbstractSimplicialComplex. instTopologicalSpaceRealization more general
instance AbstractSimplicialComplex.instTopologicalSpaceRealization {ι : Type*} (K : AbstractSimplicialComplex ι) : TopologicalSpace K.Realization
TauCeti.AlgebraicTopology.SimplicialComplex.Realization.Basic · lines 165–166
Why more general: The library realizes a complex in real coordinates on its vertex set and topologizes the realization by its faces, each face carrying the induced coordinate topology.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key 7b42f75b70d5 · pair key 0a05638538ae.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · A topology on a set › Examples of topological spaces › Further examples ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
The Zariski topology is defined algebraically on the spectrum of a ring or an algebraic variety. Show all
PrimeSpectrum. zariskiTopology more general
instance PrimeSpectrum.zariskiTopology {R : Type u} [CommSemiring R] : TopologicalSpace (PrimeSpectrum R)
Mathlib.RingTheory.Spectrum.Prime.Topology · lines 125–135
Why more general: It is defined for commutative semirings, so it also covers bases that are not rings.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 6499df4c7a3a · pair key 272ebc82133b.
MvPolynomial.ZariskiSpace. instTopologicalSpace special case
instance MvPolynomial.ZariskiSpace.instTopologicalSpace {K : Type u} {σ : Type v} [Field K] : TopologicalSpace (MvPolynomial.ZariskiSpace K σ)
MultivariatePolynomials.ZariskiTopology · lines 84–86
Why a special case: This is the algebraically defined topology on one family of varieties, affine coordinate space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 6060ee7. Location key 59f016467dca · pair key 6f246357c2da.
MaximalSpectrum. zariskiTopology special case
instance MaximalSpectrum.zariskiTopology {R : Type u} [CommRing R] : TopologicalSpace (MaximalSpectrum R)
Mathlib.RingTheory.Spectrum.Maximal.Topology · lines 42–43
Why a special case: The carrier here is the maximal part of the spectrum rather than all of it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 546c7bb4113b · pair key 596a8ea9ce03.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · A topology on a set › Examples of topological spaces › Further examples ✓ Formalized
Formalized: FF.MultivariatePolynomials states a more general result (proved).
On Rn or Cn, the closed sets of the Zariski topology are the solution sets of systems of polynomial equations. Show all
MvPolynomial.ZariskiSpace. isClosed_iff more general
theorem MvPolynomial.ZariskiSpace.isClosed_iff {K : Type u} {σ : Type v} [Field K] (Z : Set (MvPolynomial.ZariskiSpace K σ)) : IsClosed Z ↔ ∃ I, Z = MvPolynomial.ZariskiSpace.zeroLocus I
MultivariatePolynomials.ZariskiTopology · lines 127–138
Why more general: The library indexes the common zero set by the ideal a system generates, which has the same solutions as the system; it is stated for any field and any set of coordinates.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 6060ee7. Location key dc618cb6413b · pair key 1f7aa72fcd8b.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · A topology on a set › Examples of topological spaces › Further examples ✕ Not formalized
A linear graph has a natural topology that generalises many of the geometric aspects of graphs with vertices and edges. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt aa42747cbdb2). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · A topology on a set › Examples of topological spaces › Further examples ◔ Partial
Partial: Mathlib states a special case (a definition).
Many sets of linear operators in functional analysis are endowed with topologies that are defined by specifying when a particular sequence of functions converges to the zero function. Show all
PointwiseConvergenceCLM special case
abbrev PointwiseConvergenceCLM {𝕜₁ : Type*} {𝕜₂ : Type*} [NormedField 𝕜₁] [NormedField 𝕜₂] : (𝕜₁ →+* 𝕜₂) → (E : Type u_7) → (F : Type u_8) → [AddCommGroup E] → [TopologicalSpace E] → [AddCommGroup F] → [TopologicalSpace F] → [_root_.Module 𝕜₁ E] → [_root_.Module 𝕜₂ F] → Type (max u_7 u_8)
Mathlib.Topology.Algebra.Module.Spaces.PointwiseConvergenceCLM · line 60
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 91174473bbbb · pair key 7b76a6545ad3.
UniformConvergenceCLM special case
def UniformConvergenceCLM {𝕜₁ : Type*} {𝕜₂ : Type*} [inst : NormedField 𝕜₁] [NormedField 𝕜₂] : (𝕜₁ →+* 𝕜₂) → {E : Type u_3} → (F : Type u_4) → [AddCommGroup E] → [_root_.Module 𝕜₁ E] → [TopologicalSpace E] → [AddCommGroup F] → [_root_.Module 𝕜₂ F] → [TopologicalSpace F] → Set (Set E) → Type (max u_3 u_4)
Mathlib.Topology.Algebra.Module.Spaces.UniformConvergenceCLM · line 84
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 5b5618d08fbe · pair key ad2b01ae2c5e.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · A topology on a set › Examples of topological spaces › Further examples ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
Any local field has a topology native to it , and this can be extended to vector spaces over that field. Show all
ValuativeRel. topologicalSpace more general
def ValuativeRel.topologicalSpace (R : Type*) [Ring R] [ValuativeRel R] : TopologicalSpace R
Mathlib.Topology.Algebra.ValuativeRel.ValuativeTopology · line 68
Why more general: Mathlib builds this topology for any ring equipped with a valuative relation, taking the sets of small elements as the neighbourhoods of zero.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c74d1cf152fa · pair key 33d298a3d80f.
Padic. instIsValuativeTopology special case
instance Padic.instIsValuativeTopology {p : ℕ} [hp : Fact (Nat.Prime p)] : IsValuativeTopology ℚ_[p]
Mathlib.NumberTheory.Padics.ValuativeRel · lines 52–70
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e348dde02a58 · pair key b9ab0d7b81af.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · A topology on a set › Examples of topological spaces › Further examples ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
Any local field has a topology native to it, and this can be extended to vector spaces over that field. Show all
moduleTopology more general
abbrev moduleTopology (R : Type*) [TopologicalSpace R] (A : Type*) [Add A] [SMul R A] : TopologicalSpace A
Mathlib.Topology.Algebra.Module.ModuleTopology · lines 128–129
Why more general: Mathlib defines it for any topological ring and any module over it, as the finest topology making addition and the scalar action continuous.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key cb00f2c54290 · pair key 0c7550953d87.
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · A topology on a set › Examples of topological spaces › Further examples ✕ Not formalized
The Sierpiński space is the simplest non-discrete topological space. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 93555a9adcc2). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Related, but states something else (1)
sierpinskiSpace related
instance sierpinskiSpace : TopologicalSpace Prop
Mathlib.Topology.Order · lines 612–613
How it differs: It introduces the two-element space on Prop, with no claim about its place among the spaces that are not discrete.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key df1554d95aba · pair key e76e8b439944.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · A topology on a set › Examples of topological spaces › Further examples ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
If Γ is an ordinal number, then the set Γ = [0, Γ) may be endowed with the order topology generated by the intervals (a, b), [0, b) and (a, Γ) where a and b are elements of Γ. Show all
Preorder. topology more general
def Preorder.topology (α : Type*) [Preorder α] : TopologicalSpace α
Mathlib.Topology.Order.Basic · lines 67–68
Why more general: Mathlib takes the subbase to be the two families of rays, and states the definition for an arbitrary preorder rather than for ordinals.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key dc938ecc6196 · pair key 74ac0bd7d45c.
orderTopology_of_ordConnected more general
instance orderTopology_of_ordConnected {α : Type u} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] {t : Set α} [ht : t.OrdConnected] : OrderTopology ↑t
Mathlib.Topology.Order.Basic · lines 342–345
Why more general: Mathlib proves this for an order-connected subset of any linear order whose topology is the order topology.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 84cebe6b59be · pair key 03251d73d38c.
Related, but states something else (1)
Ordinal. instOrderTopology related
instance Ordinal.instOrderTopology : OrderTopology Ordinal
Mathlib.SetTheory.Ordinal.Topology · line 43
How it differs: It records that the topology on the ordinals of a universe is their order topology, which is the ambient instance the previous card uses.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a9aa4ef06908 · pair key 1bf5ad2af369.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Continuous functions ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a Prop-valued definition: it states the claim without proving it).
Continuity is expressed in terms of neighborhoods: f is continuous at some point x ∈ X if and only if for any neighborhood V of f(x), there is a neighborhood U of x such that f(U) ⊆ V. Show all
ContinuousAt close match
def ContinuousAt {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] : (X → Y) → X → Prop
Mathlib.Topology.Defs.Filter · lines 180–181
Why close, not exact: Mathlib writes the condition with filters: the image of the neighbourhood filter at x refines the neighbourhood filter at the value of f there.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d55d6d4a31e1 · pair key 8f0376b521f8.
continuousAt_def close match
theorem continuousAt_def {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} {x : X} : ContinuousAt f x ↔ ∀ A ∈ 𝓝 (f x), f ⁻¹' A ∈ 𝓝 x
Mathlib.Topology.Continuous · lines 63–64
Why close, not exact: It restates continuity at x as: the preimage of each neighbourhood of the value of f at x is a neighbourhood of x.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1adb953f102d · pair key 405c18a69f84.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Continuous functions ✓ Formalized
Formalized by 2 parts together:
continuous_def Mathlib (proved) continuity is equivalent to every preimage of an open set being open continuous_iff_isClosed Mathlib (proved) continuity is equivalent to every preimage of a closed set being closed
This is equivalent to the condition that the preimages of the open (closed) sets in Y are open (closed) in X. Show all
continuous_def states part
theorem continuous_def {X : Type*} {Y : Type*} {x : TopologicalSpace X} {x_1 : TopologicalSpace Y} {f : X → Y} : Continuous f ↔ ∀ (s : Set Y), IsOpen s → IsOpen (f ⁻¹' s)
Mathlib.Topology.Continuous · lines 35–37
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 8194d29f3cb2 · pair key 4ffb9d0fcadb.
continuous_iff_isClosed states part
theorem continuous_iff_isClosed {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} : Continuous f ↔ ∀ (s : Set Y), IsClosed s → IsClosed (f ⁻¹' s)
Mathlib.Topology.Continuous · lines 184–186
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ce0c0a56e329 · pair key 915df0297fb1.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Continuous functions ✓ Formalized
Formalized: Mathlib states a more general result (proved).
This is equivalent to the condition that the preimages of the open (closed) sets in Y are open (closed) in X. In metric spaces, this definition is equivalent to the ε–δ-definition that is often used in analysis. Show all
Metric. continuous_iff more general
theorem Metric.continuous_iff {α : Type u} {β : Type v} [PseudoMetricSpace α] [PseudoMetricSpace β] {f : α → β} : Continuous f ↔ ∀ (b : α), ∀ ε > 0, ∃ δ > 0, ∀ (a : α), Dist.dist a b < δ → Dist.dist (f a) (f b) < ε
Mathlib.Topology.MetricSpace.Pseudo.Defs · lines 886–888
Why more general: Mathlib states it for pseudometric spaces, where two distinct points are allowed to lie at distance zero.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a0aab6466d38 · pair key 618ce54c960b.
Related, but states something else (1)
Metric. continuousAt_iff related
theorem Metric.continuousAt_iff {α : Type u} {β : Type v} [PseudoMetricSpace α] [PseudoMetricSpace β] {f : α → β} {a : α} : ContinuousAt f a ↔ ∀ ε > 0, ∃ δ > 0, ∀ ⦃x : α⦄, Dist.dist x a < δ → Dist.dist (f x) (f a) < ε
Mathlib.Topology.MetricSpace.Pseudo.Defs · lines 873–875
How it differs: It gives the epsilon-delta test at one fixed point, so reaching the passage's statement about the map needs the further step from pointwise continuity to continuity.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key eed482be21bf · pair key 188c4df0aa03.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions ✓ Formalized
Formalized: Mathlib states this exactly (proved).
An extreme example: if a set X is given the discrete topology, all functions f : X → T to any topological space T are continuous. Show all
continuous_of_discreteTopology exact match
theorem continuous_of_discreteTopology {α : Type*} [TopologicalSpace α] [DiscreteTopology α] {β : Type*} [TopologicalSpace β] {f : α → β} : Continuous f
Mathlib.Topology.Order · lines 334–335
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a3505cac89f0 · pair key 6771956ba00f.
continuous_bot close match
theorem continuous_bot {α : Type u} {β : Type v} {f : α → β} {t : TopologicalSpace β} : Continuous f
Mathlib.Topology.Order · lines 862–863
Why close, not exact: Lean fixes the bottom element of the topology lattice on the domain instead of taking a DiscreteTopology instance.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 729ea38adff9 · pair key d33708180a7b.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions ◔ Partial
Partial: Mathlib states a special case (proved).
On the other hand, if X is equipped with the indiscrete topology and the space T set is at least T0, then the only continuous functions are the constant functions. Show all
PreconnectedSpace. constant special case
theorem PreconnectedSpace.constant {α : Type u} [TopologicalSpace α] {Y : Type*} [TopologicalSpace Y] [DiscreteTopology Y] : PreconnectedSpace α → ∀ {f : α → Y}, Continuous f → ∀ {x y : α}, f x = f y
Mathlib.Topology.Connected.TotallyDisconnected · lines 335–337
Why a special case: The instance path runs from IndiscreteTopology through PreirreducibleSpace to PreconnectedSpace; targets with the discrete topology are among the T0 targets the passage allows.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1ba9fea98b4a · pair key 9b8398d9f40b.
Related, but states something else (2)
Inseparable. all related
theorem Inseparable.all {α : Type u} [TopologicalSpace α] [IndiscreteTopology α] (x y : α) : Inseparable x y
Mathlib.Topology.Order · lines 740–742
How it differs: It records only that no two points of an indiscrete space can be separated; reaching constancy of a map also needs that continuous maps preserve inseparability and that T0 collapses inseparable points.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 52457d10f57f · pair key e2e7debec76d.
t0Space_iff_inseparable related
theorem t0Space_iff_inseparable (X : Type u) [TopologicalSpace X] : T0Space X ↔ ∀ (x y : X), Inseparable x y → x = y
Mathlib.Topology.Separation.Basic · lines 78–80
How it differs: It characterises the T0 axiom by inseparable points being equal and says nothing about maps out of an indiscrete space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b4d4ac44de63 · pair key 815fabb84cdd.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions ✓ Formalized
Formalized: Mathlib states this exactly (proved).
Conversely, any function whose range is indiscrete is continuous. Show all
continuous_of_indiscreteTopology exact match
theorem continuous_of_indiscreteTopology {α : Type*} {t₂ : TopologicalSpace α} {β : Type*} [TopologicalSpace β] [IndiscreteTopology β] {f : α → β} : Continuous f
Mathlib.Topology.Order · lines 303–305
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key cc1f5938d3d2 · pair key 8d47ca99f036.
continuous_top close match
theorem continuous_top {α : Type u} {β : Type v} {f : α → β} {t : TopologicalSpace α} : Continuous f
Mathlib.Topology.Order · lines 866–867
Why close, not exact: Lean fixes the top element of the topology lattice on the codomain instead of taking an IndiscreteTopology instance.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key fd01d8562952 · pair key 12caffbd4b92.
IndiscreteTopology. uniformContinuous special case
theorem IndiscreteTopology.uniformContinuous {β : Type v} [UniformSpace β] {α : Type*} [u : UniformSpace α] [IndiscreteTopology β] {f : α → β} : UniformContinuous f
Mathlib.Topology.UniformSpace.Separation · lines 357–359
Why a special case: It adds uniform structures on both sides and concludes uniform continuity, which covers those of the passage's cases where the spaces are uniformizable.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a794372b517b · pair key 6d0b66db2c5b.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Continuous functions › Alternative definitions › Neighborhood definition ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
The following criterion expresses continuity in terms of neighborhoods: f is continuous at some point x ∈ X if and only if for any neighborhood V of f(x), there is a neighborhood U of x such that f(U) ⊆ V. Show all
continuousAt_def close match
theorem continuousAt_def {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} {x : X} : ContinuousAt f x ↔ ∀ A ∈ 𝓝 (f x), f ⁻¹' A ∈ 𝓝 x
Mathlib.Topology.Continuous · lines 63–64
Why close, not exact: Lean phrases the criterion with preimages: continuity at x holds exactly when the preimage of each neighbourhood of f(x) is a neighbourhood of x.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 5a2994076ad8 · pair key 1f4d62dc6264.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions › Alternative definitions › Neighborhood definition ✓ Formalized
Formalized: Mathlib states a more general result (proved).
If X and Y are metric spaces, it is equivalent to consider the neighborhood system of open balls centered at x and f(x) instead of all neighborhoods. Show all
Metric. continuousAt_iff more general
theorem Metric.continuousAt_iff {α : Type u} {β : Type v} [PseudoMetricSpace α] [PseudoMetricSpace β] {f : α → β} {a : α} : ContinuousAt f a ↔ ∀ ε > 0, ∃ δ > 0, ∀ ⦃x : α⦄, Dist.dist x a < δ → Dist.dist (f x) (f a) < ε
Mathlib.Topology.MetricSpace.Pseudo.Defs · lines 873–875
Why more general: The lemma is stated for pseudometric spaces and writes the balls around x and f(x) as distance inequalities, equating continuity at the point with that ball condition.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 077d470d0db5 · pair key e1c12cd25706.
Related, but states something else (1)
Metric. nhds_basis_ball related
theorem Metric.nhds_basis_ball {α : Type u} [PseudoMetricSpace α] {x : α} : (𝓝 x).HasBasis (fun x ↦ 0 < x) (Metric.ball x)
Mathlib.Topology.MetricSpace.Pseudo.Defs · lines 775–776
How it differs: It says the balls around a point form a basis of that point's neighbourhood filter; obtaining the continuity criterion from it needs a further lemma about filter bases.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 92d94bd15a95 · pair key 03df7ebe1008.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions › Alternative definitions › Neighborhood definition ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Note, however, that if the target space is Hausdorff, it is still true that f is continuous at a if and only if the limit of f as x approaches a is f(a). Show all
continuousAt_iff_punctured_nhds more general
theorem continuousAt_iff_punctured_nhds {α : Type*} {β : Type*} [TopologicalSpace α] [TopologicalSpace β] {f : α → β} {a : α} : ContinuousAt f a ↔ Filter.Tendsto f (𝓝[≠] a) (𝓝 (f a))
Mathlib.Topology.NhdsWithin · lines 308–310
Why more general: Lean writes the limit condition as convergence along the punctured neighbourhood filter of a and imposes no separation axiom on the target, where the passage asks for Hausdorff so that the limit is unambiguous.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 4cebdba07aa4 · pair key b2713dd1d17f.
Related, but states something else (1)
Continuous. limUnder_eq related
theorem Continuous.limUnder_eq {X : Type*} {Y : Type*} [TopologicalSpace X] [T2Space X] [TopologicalSpace Y] {f : Y → X} : Continuous f → ∀ (y : Y), (𝓝 y).limUnder f = f y
Mathlib.Topology.Separation.Hausdorff · lines 304–306
How it differs: It evaluates Mathlib's chosen limit of a globally continuous map, giving one implication for maps continuous everywhere rather than the equivalence at a single point.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 4f19538d6ba7 · pair key d203ac09bd77.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions › Alternative definitions › Neighborhood definition ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
At an isolated point, every function is continuous. Show all
continuousAt_of_not_accPt close match
theorem continuousAt_of_not_accPt {α : Type*} {β : Type*} [TopologicalSpace α] [TopologicalSpace β] {f : α → β} {x : α} : ¬AccPt x (Filter.principal {x}ᶜ) → ContinuousAt f x
Mathlib.Topology.ContinuousOn · lines 312–314
Why close, not exact: Lean spells isolation as the point failing to accumulate the filter generated by the points distinct from it, and its docstring reads the hypothesis as x being isolated.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ea89c6c89792 · pair key e48c69882420.
continuousAt_of_not_accPt_top close match
theorem continuousAt_of_not_accPt_top {α : Type*} {β : Type*} [TopologicalSpace α] [TopologicalSpace β] {f : α → β} {x : α} : ¬AccPt x ⊤ → ContinuousAt f x
Mathlib.Topology.ContinuousOn · lines 317–318
Why close, not exact: The same statement with isolation written against the top filter instead of the filter of points distinct from x; its docstring also reads it as the isolated-point hypothesis.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key de4550a75a6c · pair key 2dd687554eb5.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Continuous functions › Alternative definitions › Sequences and nets ✕ Not formalized
In many instances, this is accomplished by specifying when a point is the limit of a sequence, but for some spaces that are too large in some sense, one specifies also when a point is the limit of more general sets of points indexed by a directed set, known as nets.[5] Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt a6ad0366d634). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions › Alternative definitions › Sequences and nets ✓ Formalized
Formalized: Mathlib states this exactly (proved).
A function is continuous only if it takes limits of sequences to limits of sequences. Show all
Continuous. seqContinuous exact match
theorem Continuous.seqContinuous {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} : Continuous f → SeqContinuous f
Mathlib.Topology.Sequences · lines 212–213
Note: Mathlib's SeqContinuous unfolds to sending each sequence with a limit to one converging to the image of that limit.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2037a77a6e8a · pair key af1d94f529d9.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions › Alternative definitions › Sequences and nets ✓ Formalized
Formalized: Mathlib states this exactly (proved).
In the former case, preservation of limits is also sufficient ; in the latter, a function may preserve all limits of sequences yet still fail to be continuous, and preservation of nets is a necessary and sufficient condition. Show all
SeqContinuous. continuous exact match
theorem SeqContinuous.continuous {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] [SequentialSpace X] {f : X → Y} : SeqContinuous f → Continuous f
Mathlib.Topology.Sequences · lines 216–218
Note: Mathlib's SequentialSpace class holds when sequentially closed sets are closed, its rendering of a topology settled by sequential convergence.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a36b80b9355d · pair key af650f6cd3d1.
continuous_iff_seqContinuous more general
theorem continuous_iff_seqContinuous {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] [SequentialSpace X] {f : X → Y} : Continuous f ↔ SeqContinuous f
Mathlib.Topology.Sequences · lines 222–224
Why more general: The declaration asserts the equivalence in both directions where the passage asks only for sufficiency.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 228b19323123 · pair key 99610211da98.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions › Alternative definitions › Sequences and nets ✕ Not formalized
In the former case, preservation of limits is also sufficient; in the latter, a function may preserve all limits of sequences yet still fail to be continuous , and preservation of nets is a necessary and sufficient condition. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt ef3cc8085df8). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions › Alternative definitions › Sequences and nets ✕ Not formalized
In the former case, preservation of limits is also sufficient; in the latter, a function may preserve all limits of sequences yet still fail to be continuous, and preservation of nets is a necessary and sufficient condition. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt afc3fac01be8). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Related, but states something else (2)
continuous_iff_ultrafilter related
theorem continuous_iff_ultrafilter {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} : Continuous f ↔ ∀ (x : X) (g : Ultrafilter X), ↑g ≤ 𝓝 x → Filter.Tendsto f (↑g) (𝓝 (f x))
Mathlib.Topology.Ultrafilter · lines 56–58
How it differs: It characterises continuity through convergent ultrafilters, not through nets indexed by directed sets.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1094b07d6ec6 · pair key 4bfdf691e7e2.
continuous_iff_continuousAt related
theorem continuous_iff_continuousAt {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} : Continuous f ↔ ∀ (x : X), ContinuousAt f x
Mathlib.Topology.Continuous · lines 154–156
How it differs: It reduces continuity to the neighbourhood-filter condition at each argument, saying nothing about nets over a directed index.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f10a7d2389cd · pair key 97544ec6c17f.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Continuous functions › Alternative definitions › Sequences and nets ✓ Formalized
Formalized: Mathlib states this exactly (a Prop-valued definition: it states the claim without proving it).
In detail, a function f: X → Y is sequentially continuous if whenever a sequence (xn) in X converges to a limit x, the sequence (f(xn)) converges to f(x).[6] Show all
SeqContinuous exact match
def SeqContinuous {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] : (X → Y) → Prop
Mathlib.Topology.Defs.Sequences · lines 66–67
Note: Its docstring says the property holds when the map commutes with limits of convergent sequences, over arbitrary topological spaces.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 103fa9dc1199 · pair key dccae074f6d4.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Continuous functions › Alternative definitions › Sequences and nets ✓ Formalized
Formalized: Mathlib states this exactly (proved).
Every continuous function is sequentially continuous. Show all
Continuous. seqContinuous exact match
theorem Continuous.seqContinuous {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} : Continuous f → SeqContinuous f
Mathlib.Topology.Sequences · lines 212–213
Note: Mathlib proves the implication from Continuous to SeqContinuous with no restriction on either space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 596c3a925f15 · pair key 22f523a7fa7c.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Continuous functions › Alternative definitions › Sequences and nets ✓ Formalized
Formalized: Mathlib states a more general result (proved).
If X is a first-countable space and countable choice holds, then the converse also holds: any function preserving sequential limits is continuous. Show all
SeqContinuous. continuous more general
theorem SeqContinuous.continuous {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] [SequentialSpace X] {f : X → Y} : SeqContinuous f → Continuous f
Mathlib.Topology.Sequences · lines 216–218
Why more general: The instance chain from first countability to the sequential-space class is how Lean supplies the declaration's hypothesis, and the countable choice of the passage is subsumed by Lean's classical foundation.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 8d64d7abe0cc · pair key a5fe94544d19.
continuous_iff_seqContinuous more general
theorem continuous_iff_seqContinuous {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] [SequentialSpace X] {f : X → Y} : Continuous f ↔ SeqContinuous f
Mathlib.Topology.Sequences · lines 222–224
Why more general: The declaration packages both directions, and the passage uses the one that returns continuity.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 0d78cbdde251 · pair key 4f8b48310a43.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions › Alternative definitions › Sequences and nets ✓ Formalized
Formalized: Mathlib states a more general result (proved).
In particular, if X is a metric space, sequential continuity and continuity are equivalent. Show all
continuous_iff_seqContinuous more general
theorem continuous_iff_seqContinuous {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] [SequentialSpace X] {f : X → Y} : Continuous f ↔ SeqContinuous f
Mathlib.Topology.Sequences · lines 222–224
Why more general: Mathlib proves the equivalence for any domain whose topology is settled by sequences, and a metric domain is one of those by the instance chain from its uniformity.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key adac6f565026 · pair key 3a776f7a8275.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions › Alternative definitions › Sequences and nets ✕ Not formalized
For non first-countable spaces, sequential continuity might be strictly weaker than continuity. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 52ac7c22f335). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Continuous functions › Alternative definitions › Sequences and nets ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
(The spaces for which the two properties are equivalent are called sequential spaces.) This motivates the consideration of nets instead of sequences in general topological spaces. Show all
SequentialSpace close match
class SequentialSpace (X : Type*) [TopologicalSpace X] : Prop
Mathlib.Topology.Defs.Sequences · lines 92–93
Why close, not exact: Mathlib writes the class by asking that sequentially closed subsets be closed, which picks out the same spaces as the article's condition on maps out of X.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3211eefae6cc · pair key 6c1284e2c0f5.
Related, but states something else (1)
continuous_iff_seqContinuous related
theorem continuous_iff_seqContinuous {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] [SequentialSpace X] {f : X → Y} : Continuous f ↔ SeqContinuous f
Mathlib.Topology.Sequences · lines 222–224
How it differs: It supplies one half of the identification, namely that a space of Mathlib's class has the article's coincidence of the two continuity notions.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 4faeb7c1c17d · pair key f8d03dcea4ca.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Continuous functions › Alternative definitions › Sequences and nets ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
Continuous functions preserve limits of nets , and in fact this property characterizes continuous functions. Show all
Continuous. tendsto close match
theorem Continuous.tendsto {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} : Continuous f → ∀ (x : X), Filter.Tendsto f (𝓝 x) (𝓝 (f x))
Mathlib.Topology.Continuous · lines 140–142
Why close, not exact: Mathlib has no separate notion of a net: convergence is written with filters, and this says the image of the neighbourhood filter at x sits under the neighbourhood filter at f x.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ecc8ab390a7d · pair key d18cee62aa12.
Continuous. seqContinuous special case
theorem Continuous.seqContinuous {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} : Continuous f → SeqContinuous f
Mathlib.Topology.Sequences · lines 212–213
Why a special case: Sequences are the nets whose index order is the natural numbers, so this is the article's claim restricted to that index order.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f646c080dfcb · pair key 9621c43ffd4d.
Related, but states something else (1)
Filter.Tendsto. comp related
theorem Filter.Tendsto.comp {α : Type*} {β : Type*} {γ : Type*} {f : α → β} {g : β → γ} {x : Filter α} {y : Filter β} {z : Filter γ} : Filter.Tendsto g y z → Filter.Tendsto f x y → Filter.Tendsto (g ∘ f) x z
Mathlib.Order.Filter.Tendsto · lines 122–123
How it differs: Composition of two filter limits, which yields the article's claim only together with the limit statement for a continuous map.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e30961459983 · pair key dc308eb0cb4b.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Continuous functions › Alternative definitions › Sequences and nets ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
Continuous functions preserve limits of nets, and in fact this property characterizes continuous functions. Show all
continuous_iff_continuousAt close match
theorem continuous_iff_continuousAt {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} : Continuous f ↔ ∀ (x : X), ContinuousAt f x
Mathlib.Topology.Continuous · lines 154–156
Why close, not exact: Mathlib phrases the criterion locally at each x, where the local notion unfolds to the filter condition that stands in for convergence of nets.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 207a166e0fad · pair key c763d541f479.
continuous_iff_seqContinuous special case
theorem continuous_iff_seqContinuous {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] [SequentialSpace X] {f : X → Y} : Continuous f ↔ SeqContinuous f
Mathlib.Topology.Sequences · lines 222–224
Why a special case: It restricts the testing families to sequences and asks the source to be sequential, so it is the article's criterion in that special setting.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b3e0cf51e0e3 · pair key 2056e0e3c295.
Related, but states something else (1)
continuous_iff_ultrafilter related
theorem continuous_iff_ultrafilter {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} : Continuous f ↔ ∀ (x : X) (g : Ultrafilter X), ↑g ≤ 𝓝 x → Filter.Tendsto f (↑g) (𝓝 (f x))
Mathlib.Topology.Ultrafilter · lines 56–58
How it differs: An equivalent criterion over ultrafilters refining a neighbourhood filter; matching it with convergence of arbitrary families needs the ultrafilter reduction of a filter limit.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key aca49d11cf7e · pair key dc2fac2e220c.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Continuous functions › Alternative definitions › Closure operator definition ✕ Not formalized
Instead of specifying the open subsets of a topological space, the topology can also be determined by a closure operator (denoted cl), which assigns to any subset A ⊆ X its closure, or an interior operator (denoted int), which assigns to any subset A of X its interior. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 4 candidates examined (receipt e3ce033842f2). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Continuous functions › Alternative definitions › Closure operator definition ✓ Formalized
Formalized: Mathlib states this exactly (proved).
In these terms, a function f : (X , cl) → (X ′, cl′) between topological spaces is continuous in the sense above if and only if for all subsets A of X f (cl(A )) ⊆ cl′(f (A )). That is to say, given any element x of X that is in the closure of any subset A, f(x) belongs to the closure of f(A). Show all
continuous_iff_image_closure_subset_closure_image exact match
theorem continuous_iff_image_closure_subset_closure_image {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} : Continuous f ↔ ∀ (s : Set X), f '' closure s ⊆ closure (f '' s)
Mathlib.Topology.Continuous · lines 231–235
Note: Mathlib's closure is the closure operator of the space's topology, so both sides read as the article writes them.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key eafc88df8b9e · pair key 68f51fcda4fa.
Related, but states something else (1)
image_closure_subset_closure_image related
theorem image_closure_subset_closure_image {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} {s : Set X} : Continuous f → f '' closure s ⊆ closure (f '' s)
Mathlib.Topology.Continuous · lines 213–215
How it differs: It gives the implication that starts from continuity; the converse half of the article's equivalence is elsewhere.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1b4dd1e5e829 · pair key d0886859d4dc.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions › Alternative definitions › Closure operator definition ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
…a function f : (X , cl) → (X ′, cl′) between topological spaces is continuous in the sense above if and only if for all subsets A of X f (cl(A )) ⊆ cl′(f (A )). That is to say, given any element x of X that is in the closure of any subset A, f(x) belongs to the closure of f(A). Show all
image_closure_subset_closure_image close match
theorem image_closure_subset_closure_image {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} {s : Set X} : Continuous f → f '' closure s ⊆ closure (f '' s)
Mathlib.Topology.Continuous · lines 213–215
Why close, not exact: Mathlib writes the conclusion as an inclusion between the image of a closure and the closure of an image, which unfolds to the article's membership claim.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key af997d92293c · pair key d28bc2dcd91f.
closure_subset_preimage_closure_image close match
theorem closure_subset_preimage_closure_image {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} {s : Set X} : Continuous f → closure s ⊆ f ⁻¹' closure (f '' s)
Mathlib.Topology.Continuous · lines 223–225
Why close, not exact: Same conclusion written through a preimage: a member of the closure of A lands in the preimage of the closure of the image of A.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 78f64c788770 · pair key dbc0e898f69b.
ContinuousWithinAt. mem_closure_image more general
theorem ContinuousWithinAt.mem_closure_image {α : Type*} {β : Type*} [TopologicalSpace α] [TopologicalSpace β] {f : α → β} {s : Set α} {x : α} : ContinuousWithinAt f s x → x ∈ closure s → f x ∈ closure (f '' s)
Mathlib.Topology.ContinuousOn · lines 559–562
Why more general: This is the elementwise form of the article's conclusion under a hypothesis localised at one argument, so it covers the article's case and more.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 75c1f628814f · pair key 44e57a7cc04d.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions › Alternative definitions › Closure operator definition ◔ Partial
Partial: Mathlib states part of this (proved).
This is equivalent to the requirement that for all subsets A' of X' f −1 (cl′(A ′)) ⊇ cl(f −1 (A ′)). Moreover, f : (X , int) → (X ′, int′) is continuous if and only if f −1 (int′(A )) ⊆ int(f −1 (A )) for any subset A of X. Show all
Continuous. closure_preimage_subset states part
theorem Continuous.closure_preimage_subset {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} : Continuous f → ∀ (t : Set Y), closure (f ⁻¹' t) ⊆ f ⁻¹' closure t
Mathlib.Topology.Continuous · lines 197–200
Why only part: It gives the half of the article's equivalence that starts from continuity; the recovery of continuity from the inclusion is not stated here.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 361cdcf3c508 · pair key 46013d57fcdd.
Related, but states something else (2)
continuous_iff_isClosed related
theorem continuous_iff_isClosed {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} : Continuous f ↔ ∀ (s : Set Y), IsClosed s → IsClosed (f ⁻¹' s)
Mathlib.Topology.Continuous · lines 184–186
How it differs: It characterises continuity through preimages of closed sets, and reaching the article's inclusion from it takes a further argument about closures.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 6c6ef24de806 · pair key 2d62d5388b31.
continuous_iff_preimage_interior_subset_interior_preimage related
theorem continuous_iff_preimage_interior_subset_interior_preimage {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} : Continuous f ↔ ∀ (s : Set Y), f ⁻¹' interior s ⊆ interior (f ⁻¹' s)
Mathlib.Topology.Continuous · lines 102–105
How it differs: It is the equivalence for the interior operator, which turns into the article's closure form only after passing to complements.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c533a3fb2975 · pair key 7416a11ec332.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions › Alternative definitions › Closure operator definition ✓ Formalized
Formalized: Mathlib states this exactly (proved).
This is equivalent to the requirement that for all subsets A' of X' f −1 (cl′(A ′)) ⊇ cl(f −1 (A ′)). Moreover, f : (X , int) → (X ′, int′) is continuous if and only if f −1 (int′(A )) ⊆ int(f −1 (A )) for any subset A of X. Show all
continuous_iff_preimage_interior_subset_interior_preimage exact match
theorem continuous_iff_preimage_interior_subset_interior_preimage {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} : Continuous f ↔ ∀ (s : Set Y), f ⁻¹' interior s ⊆ interior (f ⁻¹' s)
Mathlib.Topology.Continuous · lines 102–105
Note: Mathlib quantifies the subset over the codomain, which is where the operator int' acts and so where the passage's formula is typed.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1e372bcc75eb · pair key 6a5e174a0a6d.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Continuous functions › Properties ✓ Formalized
Formalized: Mathlib states this exactly (proved).
If f: X → Y and g: Y → Z are continuous, then so is the composition g ∘ f: X → Z. Show all
Continuous. comp exact match
theorem Continuous.comp {X : Type*} {Y : Type*} {Z : Type*} [TopologicalSpace X] [TopologicalSpace Y] [TopologicalSpace Z] {f : X → Y} {g : Y → Z} : Continuous g → Continuous f → Continuous (g ∘ f)
Mathlib.Topology.Continuous · lines 115–117
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e09d74a8df57 · pair key bcfa892f53b6.
ContinuousMap. comp close match
def ContinuousMap.comp {α : Type*} {β : Type*} {γ : Type*} [TopologicalSpace α] [TopologicalSpace β] [TopologicalSpace γ] : C(β, γ) → C(α, β) → C(α, γ)
Mathlib.Topology.ContinuousMap.Basic · lines 112–113
Why close, not exact: Mathlib packages a map together with its continuity proof and returns the composite in that same packaged form.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 223b91ec112c · pair key 41c3cf5e7eca.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Continuous functions › Properties ✓ Formalized
Formalized: Mathlib states this exactly (proved).
If f: X → Y and g: Y → Z are continuous, then so is the composition g ∘ f: X → Z. If f: X → Y is continuous and X is compact, then f(X) is compact. Show all
isCompact_range exact match
theorem isCompact_range {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] [CompactSpace X] {f : X → Y} : Continuous f → IsCompact (Set.range f)
Mathlib.Topology.Compactness.Compact · lines 968–969
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b27e480bae2a · pair key 38c5797c357d.
IsCompact. image more general
theorem IsCompact.image {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {s : Set X} {f : X → Y} : IsCompact s → Continuous f → IsCompact (f '' s)
Mathlib.Topology.Compactness.Compact · lines 124–125
Why more general: The declaration is stated for an arbitrary compact subset of the domain, the whole space being one choice of it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 13f986ea2a50 · pair key d12ad90e1225.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Continuous functions › Properties ✓ Formalized
Formalized: Mathlib states this exactly (proved).
X is connected, then f(X) is connected. Show all
isPreconnected_range exact match
theorem isPreconnected_range {α : Type u} {β : Type v} [TopologicalSpace α] [TopologicalSpace β] [PreconnectedSpace α] {f : α → β} : Continuous f → IsPreconnected (Set.range f)
Mathlib.Topology.Connected.Basic · lines 722–724
Note: The article counts the empty space as connected, and Mathlib's preconnectedness is the notion that admits it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c0cdacba36c8 · pair key b17819e7cf8f.
IsPreconnected. image more general
theorem IsPreconnected.image {α : Type u} {β : Type v} [TopologicalSpace α] [TopologicalSpace β] {s : Set α} : IsPreconnected s → ∀ (f : α → β), ContinuousOn f s → IsPreconnected (f '' s)
Mathlib.Topology.Connected.Basic · lines 294–312
Why more general: The declaration is stated for an arbitrary connected subset of the domain, the whole space being one choice of it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 802da80da4c9 · pair key ae99552842bf.
isConnected_range special case
theorem isConnected_range {α : Type u} {β : Type v} [TopologicalSpace α] [TopologicalSpace β] [ConnectedSpace α] {f : α → β} : Continuous f → IsConnected (Set.range f)
Mathlib.Topology.Connected.Basic · lines 726–728
Why a special case: It covers those of the article's connected domains that are nonempty, Mathlib's connectedness carrying nonemptiness on both sides.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b6fbf38ca65c · pair key 851b5477f941.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Continuous functions › Properties ✓ Formalized
Formalized: Mathlib states this exactly (proved).
X is path-connected, then f(X) is path-connected. Show all
isPathConnected_range exact match
theorem isPathConnected_range {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] [PathConnectedSpace X] {f : X → Y} : Continuous f → IsPathConnected (Set.range f)
Mathlib.Topology.Connected.PathConnected · lines 618–621
Note: Mathlib builds nonemptiness into path-connectedness, so the one domain it sets aside is the empty space, where the conclusion carries no content (PD11).
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 607685c4507f · pair key 0c2c841098d5.
IsPathConnected. image more general
theorem IsPathConnected.image {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {F : Set X} : IsPathConnected F → ∀ {f : X → Y}, Continuous f → IsPathConnected (f '' F)
Mathlib.Topology.Connected.PathConnected · lines 446–448
Why more general: The declaration is stated for an arbitrary path-connected subset of the domain, the whole space being one choice of it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key fdf9a15ffaf6 · pair key 5467e3201b26.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Continuous functions › Properties ✓ Formalized
Formalized: Mathlib states this exactly (proved).
X is Lindelöf, then f(X) is Lindelöf. Show all
isLindelof_range exact match
theorem isLindelof_range {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] [LindelofSpace X] {f : X → Y} : Continuous f → IsLindelof (Set.range f)
Mathlib.Topology.Compactness.Lindelof · lines 599–600
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key dffaf1ed37ae · pair key ef1bc19a5c1a.
IsLindelof. image more general
theorem IsLindelof.image {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {s : Set X} {f : X → Y} : IsLindelof s → Continuous f → IsLindelof (f '' s)
Mathlib.Topology.Compactness.Lindelof · lines 116–117
Why more general: The declaration is stated for an arbitrary Lindelof subset of the domain, the whole space being one choice of it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 90b6fc2c75dc · pair key 096e232d1934.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Continuous functions › Properties ◔ Partial
Partial: Mathlib states a special case (proved).
X is separable, then f(X) is separable. Show all
DenseRange. separableSpace special case
theorem DenseRange.separableSpace {α : Type u} {β : Type*} [t : TopologicalSpace α] [TopologicalSpace.SeparableSpace α] [TopologicalSpace β] {f : α → β} : DenseRange f → Continuous f → TopologicalSpace.SeparableSpace β
Mathlib.Topology.Bases · lines 397–400
Why a special case: Mathlib states it for maps whose values are dense in the codomain, and a map onto the image is one of those.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 89e804f0814e · pair key a76ed7ff7bb1.
Related, but states something else (2)
TopologicalSpace. isSeparable_range related
theorem TopologicalSpace.isSeparable_range {α : Type u} {β : Type*} [t : TopologicalSpace α] [TopologicalSpace β] [TopologicalSpace.SeparableSpace α] {f : α → β} : Continuous f → TopologicalSpace.IsSeparable (Set.range f)
Mathlib.Topology.Bases · lines 593–595
How it differs: Mathlib records separability of a subset by putting that subset inside the closure of some countable set of the ambient space, rather than by a countable dense subset of it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key feb673bc044c · pair key 939c3f0131af.
TopologicalSpace.IsSeparable. image related
theorem TopologicalSpace.IsSeparable.image {α : Type u} [t : TopologicalSpace α] {β : Type*} [TopologicalSpace β] {s : Set α} : TopologicalSpace.IsSeparable s → ∀ {f : α → β}, Continuous f → TopologicalSpace.IsSeparable (f '' s)
Mathlib.Topology.Bases · lines 578–583
How it differs: The declaration is stated for an arbitrary separable subset of the domain, the whole space being one choice of it, and it uses the same encoding of separability for subsets.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 890360ff0753 · pair key e880a456adb8.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions › Properties ✓ Formalized
Formalized: Mathlib states this exactly (a definition).
The possible topologies on a fixed set X are partially ordered: a topology τ1 is said to be coarser than another topology τ2 (notation: τ1 ⊆ τ2) if every open subset with respect to τ1 is also open with respect to τ2. Show all
TopologicalSpace. instPartialOrder exact match
instance TopologicalSpace.instPartialOrder {α : Type u} : PartialOrder (TopologicalSpace α)
Mathlib.Topology.Order · lines 148–150
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 010f089a1ae4 · pair key 85d3e3cdb205.
TopologicalSpace. instCompleteLattice more general
instance TopologicalSpace.instCompleteLattice {α : Type u} : CompleteLattice (TopologicalSpace α)
Mathlib.Topology.Order · line 195
Why more general: The lattice structure carries the order the passage asserts together with arbitrary suprema and infima of families of topologies.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 0181d1ceb5ee · pair key b6b7ef4e97b6.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Continuous functions › Properties ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
The possible topologies on a fixed set X are partially ordered: a topology τ1 is said to be coarser than another topology τ2 (notation: τ1 ⊆ τ2) if every open subset with respect to τ1 is also open with respect to τ2. Show all
TopologicalSpace. instPartialOrder close match
instance TopologicalSpace.instPartialOrder {α : Type u} : PartialOrder (TopologicalSpace α)
Mathlib.Topology.Order · lines 148–150
Why close, not exact: Mathlib writes the comparison with its order symbol, under which the topology with more open sets is the smaller one, so the passage's inclusion appears reversed.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 79e74d6bd67d · pair key a1078a6e25e3.
TopologicalSpace. le_def close match
theorem TopologicalSpace.le_def {α : Type*} {t s : TopologicalSpace α} : t ≤ s ↔ IsOpen ≤ IsOpen
Mathlib.Topology.Order · lines 152–153
Why close, not exact: This spells out Mathlib's order on topologies as the pointwise implication between the two openness predicates, with the order symbol running opposite to the passage's inclusion.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 73920166871c · pair key da1fc00c15d3.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Continuous functions › Properties ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
Then, the identity map idX: (X, τ2) → (X, τ1) is continuous if and only if τ1 ⊆ τ2 (see also comparison of topologies). Show all
continuous_id_iff_le close match
theorem continuous_id_iff_le {α : Type u} {t t' : TopologicalSpace α} : Continuous id ↔ t ≤ t'
Mathlib.Topology.Order · lines 869–870
Why close, not exact: Mathlib expresses the comparison of the two topologies with its order symbol, under which the one with more open sets is the smaller, so the passage's inclusion is written the other way round.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9ad23ed4100a · pair key c96eab759c7a.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions › Properties ◔ Partial
Partial: Mathlib states part of this (proved).
More generally, a continuous function (X , τ X ) → (Y , τ Y ) stays continuous if the topology τY is replaced by a coarser topology and/or τX is replaced by a finer topology. Show all
continuous_le_rng states part
theorem continuous_le_rng {α : Type u} {β : Type v} {f : α → β} {t₁ : TopologicalSpace α} {t₂ t₃ : TopologicalSpace β} : t₂ ≤ t₃ → Continuous f → Continuous f
Mathlib.Topology.Order · lines 798–801
Why only part: This covers the change of the target topology only, leaving the change of the source topology to a separate lemma.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b83b7a9302b5 · pair key 16407b8c855c.
continuous_le_dom states part
theorem continuous_le_dom {α : Type u} {β : Type v} {f : α → β} {t₁ t₂ : TopologicalSpace α} {t₃ : TopologicalSpace β} : t₂ ≤ t₁ → Continuous f → Continuous f
Mathlib.Topology.Order · lines 793–796
Why only part: This covers the change of the source topology only, leaving the change of the target topology to a separate lemma.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key bd63e34c687b · pair key ad0fece0a6a4.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Continuous functions › Homeomorphisms ✓ Formalized
Formalized: Mathlib states this exactly (a Prop-valued definition: it states the claim without proving it).
Symmetric to the concept of a continuous map is an open map, for which images of open sets are open. Show all
IsOpenMap exact match
def IsOpenMap {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] : (X → Y) → Prop
Mathlib.Topology.Defs.Basic · line 166
Note: Mathlib introduces the property as a predicate on a map between two topological spaces, tagged with the same Wikidata item as the passage's notion.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9ac1fe5a349b · pair key 3bda3b2b309c.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions › Homeomorphisms ✓ Formalized
Formalized: Mathlib states a more general result (proved).
In fact, if an open map f has an inverse function, that inverse is continuous , and if a continuous map g has an inverse, that inverse is open. Show all
Equiv. continuous_symm_iff more general
theorem Equiv.continuous_symm_iff {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] (e : X ≃ Y) : Continuous ⇑e.symm ↔ IsOpenMap ⇑e
Mathlib.Topology.Continuous · lines 46–47
Why more general: Mathlib states the equivalence in both directions, so it also gives the converse the passage does not mention here.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7e6e140e9a94 · pair key 072d4430ab5e.
Related, but states something else (1)
IsOpenMap. continuousOn_range_of_leftInverse related
theorem IsOpenMap.continuousOn_range_of_leftInverse {α : Type*} {β : Type*} [TopologicalSpace α] [TopologicalSpace β] {f : α → β} : IsOpenMap f → ∀ {finv : β → α}, Function.LeftInverse finv f → ContinuousOn finv (Set.range f)
Mathlib.Topology.ContinuousOn · lines 864–867
How it differs: It concludes continuity of the inverse only on the image of the map, so reaching the passage's conclusion needs surjectivity and a further lemma about continuity on the whole space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c583e4e6bb5f · pair key 622a29ac0ed4.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions › Homeomorphisms ✓ Formalized
Formalized: Mathlib states this exactly (proved).
In fact, if an open map f has an inverse function, that inverse is continuous, and if a continuous map g has an inverse, that inverse is open. Show all
IsOpenMap. of_inverse exact match
theorem IsOpenMap.of_inverse {X : Type*} {Y : Type*} {f : X → Y} [TopologicalSpace X] [TopologicalSpace Y] {f' : Y → X} : Continuous f' → Function.LeftInverse f f' → Function.RightInverse f f' → IsOpenMap f
Mathlib.Topology.Maps.Basic · lines 429–431
Note: Mathlib phrases the hypothesis as a pair of one-sided inverse conditions, which together say that the map has the passage's inverse function.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7a94a0b7940c · pair key 456433ec1cef.
Equiv. isOpenMap_symm_iff more general
theorem Equiv.isOpenMap_symm_iff {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] (e : X ≃ Y) : IsOpenMap ⇑e.symm ↔ Continuous ⇑e
Mathlib.Topology.Continuous · lines 49–50
Why more general: Mathlib states the equivalence in both directions, so it also gives the converse the passage does not mention here.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3fd5dafa9bb5 · pair key 09d950e73bb4.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions › Homeomorphisms ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Given a bijective function f between two topological spaces, the inverse function f−1 need not be continuous. Show all
Continuous.homeoOfEquivCompactToT2. t1_counterexample more general
theorem Continuous.homeoOfEquivCompactToT2.t1_counterexample : ∃ α β x x_1, CompactSpace α ∧ T1Space β ∧ ∃ f, Continuous ⇑f ∧ ¬Continuous ⇑f.symm
Mathlib.Topology.Compactification.OnePoint.Basic · lines 646–651
Why more general: Mathlib's witness also has a compact source, a target satisfying the T1 condition and a continuous bijection, which the passage does not require of its example.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b08a2eb2fbb3 · pair key 36d9d0e4d149.
TauCeti. not_continuous_restrictedProductSum_symm special case
theorem TauCeti.not_continuous_restrictedProductSum_symm : ¬Continuous ⇑(TauCeti.restrictedProductSum (fun x ↦ ⊥) ⋯ ⋯).symm
TauCeti.Topology.Algebra.RestrictedProduct.NotContinuousMul · lines 270–277
Why a special case: The declaration is about one named bijection of restricted products rather than about bijections of topological spaces in general.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key a52c3521ff30 · pair key b1e871e088d8.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Continuous functions › Homeomorphisms ✓ Formalized
Formalized: Mathlib states this exactly (a definition).
A bijective continuous function with continuous inverse function is called a homeomorphism. Show all
Homeomorph exact match
structure Homeomorph (X : Type*) (Y : Type*) [TopologicalSpace X] [TopologicalSpace Y]
Mathlib.Topology.Homeomorph.Defs · lines 44–51
Note: Mathlib packages the map, its inverse and the two continuity proofs into one structure, which is the notion the passage names, and tags it with the same Wikidata item.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b699e1450b04 · pair key fae20537e343.
IsHomeomorph close match
structure IsHomeomorph {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] : (X → Y) → Prop
Mathlib.Topology.Homeomorph.Defs · lines 552–555
Why close, not exact: Mathlib states the same notion as a property of a plain function instead of as a structure carrying the inverse, and tags it with the same Wikidata item.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 857bd7860cfb · pair key 92dd9e5135e5.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Continuous functions › Homeomorphisms ✓ Formalized
Formalized: Mathlib states this exactly (a definition).
If a continuous bijection has as its domain a compact space and its codomain is Hausdorff, then it is a homeomorphism. Show all
Continuous. homeoOfEquivCompactToT2 exact match
def Continuous.homeoOfEquivCompactToT2 {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] [CompactSpace X] [T2Space Y] {f : X ≃ Y} : Continuous ⇑f → X ≃ₜ Y
Mathlib.Topology.Homeomorph.Lemmas · lines 474–477
Note: The bijection arrives as a bundled equivalence and the result is the bundled homeomorphism on the same underlying map.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c336d931127e · pair key 14aa5c16af1e.
Continuous. continuous_symm_of_equiv_compact_to_t2 close match
theorem Continuous.continuous_symm_of_equiv_compact_to_t2 {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] [CompactSpace X] [T2Space Y] {f : X ≃ Y} : Continuous ⇑f → Continuous ⇑f.symm
Mathlib.Topology.Homeomorph.Lemmas · lines 462–467
Why close, not exact: It writes the conclusion out as continuity of the inverse map instead of naming the homeomorphism.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key fe30b2dbc53f · pair key 8ce415f51dd1.
isHomeomorph_iff_continuous_bijective more general
theorem isHomeomorph_iff_continuous_bijective {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} [CompactSpace X] [T2Space Y] : IsHomeomorph f ↔ Continuous f ∧ Function.Bijective f
Mathlib.Topology.Homeomorph.Lemmas · lines 538–542
Why more general: It also records the reverse implication, which holds of any homeomorphism at all.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 5fa450bd419c · pair key 460c840f24ee.
CompHausLike. isoOfBijective special case
def CompHausLike.isoOfBijective {P : TopCat → Prop} {X Y : CompHausLike P} (f : X ⟶ Y) : Function.Bijective ⇑(CategoryTheory.ConcreteCategory.hom f) → (X ≅ Y)
Mathlib.Topology.Category.CompHausLike.Basic · lines 249–252
Why a special case: Both of its objects carry compactness, where the passage asks compactness only of the domain.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 872a642dda6c · pair key 6dac70158e9b.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Continuous functions › Defining topologies via continuous functions ✓ Formalized
Formalized: Mathlib states this exactly (a definition).
Given a function f : X → S , where X is a topological space and S is a set (without a specified topology), the final topology on S is defined by letting the open sets of S be those subsets A of S for which f−1(A) is open in X. Show all
TopologicalSpace. coinduced exact match
def TopologicalSpace.coinduced {X : Type*} {Y : Type*} : (X → Y) → TopologicalSpace X → TopologicalSpace Y
Mathlib.Topology.Defs.Induced · lines 86–90
Note: A subset of the codomain counts as open here precisely when its preimage under the map is open in the source.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2b7543fdcd6a · pair key 45bbe525fe39.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions › Defining topologies via continuous functions ✓ Formalized
Formalized: Mathlib states this exactly (proved).
Given a function f : X → S , where X is a topological space and S is a set (without a specified topology), the final topology on S is defined by letting the open sets of S be those subsets A of S for which f−1(A) is open in X. If S has an existing topology, f is continuous with respect to this topology if and only if the existing topology is coarser than the final topology on S. Show all
continuous_iff_coinduced_le exact match
theorem continuous_iff_coinduced_le {α : Type u} {β : Type v} {f : α → β} {t₁ : TopologicalSpace α} {t₂ : TopologicalSpace β} : Continuous f ↔ TopologicalSpace.coinduced f t₁ ≤ t₂
Mathlib.Topology.Order · lines 764–766
Note: Mathlib phrases the comparison through its order on topologies, in which coinduced f t₁ ≤ t₂ says every open of the given topology is open in the final one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2f386a5b4a54 · pair key d05e15ac28ac.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Continuous functions › Defining topologies via continuous functions ✓ Formalized
Formalized: Mathlib states a more general result (proved).
…S is a set (without a specified topology), the final topology on S is defined by letting the open sets of S be those subsets A of S for which f−1(A) is open in X. If S has an existing topology, f is continuous with respect to this topology if and only if the existing topology is coarser than the final topology on S. Thus the final topology can be characterized as the finest topology on S that makes f continuous. Show all
continuous_iff_coinduced_le more general
theorem continuous_iff_coinduced_le {α : Type u} {β : Type v} {f : α → β} {t₁ : TopologicalSpace α} {t₂ : TopologicalSpace β} : Continuous f ↔ TopologicalSpace.coinduced f t₁ ≤ t₂
Mathlib.Topology.Order · lines 764–766
Why more general: The equivalence it states quantifies over every topology on S, the final one included.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 6e8b3a3c1794 · pair key 5fb06cb70e66.
Related, but states something else (1)
continuous_coinduced_rng related
theorem continuous_coinduced_rng {α : Type u} {β : Type v} {f : α → β} {t : TopologicalSpace α} : Continuous f
Mathlib.Topology.Order · lines 785–787
How it differs: It records continuity of f once S carries the final topology, and says nothing about other topologies.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 963d082cf52c · pair key 52afc68e2bdf.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions › Defining topologies via continuous functions ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
If f is surjective, this topology is canonically identified with the quotient topology under the equivalence relation defined by f. Show all
Topology.IsQuotientMap. homeomorph close match
def Topology.IsQuotientMap.homeomorph {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {f : C(X, Y)} : Topology.IsQuotientMap ⇑f → Quotient (Setoid.ker ⇑f) ≃ₜ Y
Mathlib.Topology.ContinuousMap.Basic · lines 457–466
Why close, not exact: The map enters bundled with its continuity and with the quotient-map property, and the identification comes out as a homeomorphism of the quotient with the codomain.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7ab5faf661bc · pair key 0eec5f44999c.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Continuous functions › Defining topologies via continuous functions ✓ Formalized
Formalized: Mathlib states this exactly (a definition).
Dually, for a function f from a set S to a topological space X, the initial topology on S has a basis of open sets given by those sets of the form f−1(U) where U is open in X . Show all
TopologicalSpace. induced exact match
def TopologicalSpace.induced {X : Type*} {Y : Type*} : (X → Y) → TopologicalSpace Y → TopologicalSpace X
Mathlib.Topology.Defs.Induced · lines 64–74
Note: Mathlib lists the opens of S as the preimages of opens of X; preimages respect unions and finite intersections, so those sets already form the topology the passage's basis generates.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 27ce9149259e · pair key 48efd39b4be2.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions › Defining topologies via continuous functions ✓ Formalized
Formalized: Mathlib states this exactly (proved).
If S has an existing topology, f is continuous with respect to this topology if and only if the existing topology is finer than the initial topology on S. Show all
continuous_iff_le_induced exact match
theorem continuous_iff_le_induced {α : Type u} {β : Type v} {f : α → β} {t₁ : TopologicalSpace α} {t₂ : TopologicalSpace β} : Continuous f ↔ t₁ ≤ TopologicalSpace.induced f t₂
Mathlib.Topology.Order · lines 768–770
Note: In Mathlib's order t₁ ≤ induced f t₂ says that every open of the initial topology is open for the topology S already carries.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b6994f6a7d3b · pair key 53ba1d6c3576.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Continuous functions › Defining topologies via continuous functions ✓ Formalized
Formalized: Mathlib states a more general result (proved).
If S has an existing topology, f is continuous with respect to this topology if and only if the existing topology is finer than the initial topology on S. Thus the initial topology can be characterized as the coarsest topology on S that makes f continuous. Show all
continuous_iff_le_induced more general
theorem continuous_iff_le_induced {α : Type u} {β : Type v} {f : α → β} {t₁ : TopologicalSpace α} {t₂ : TopologicalSpace β} : Continuous f ↔ t₁ ≤ TopologicalSpace.induced f t₂
Mathlib.Topology.Order · lines 768–770
Why more general: The equivalence it states quantifies over every topology on S, the initial one included.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 0235a845074c · pair key 96f34a3f1a27.
Related, but states something else (1)
continuous_induced_dom related
theorem continuous_induced_dom {α : Type u} {β : Type v} {f : α → β} {t : TopologicalSpace β} : Continuous f
Mathlib.Topology.Order · lines 778–779
How it differs: It records continuity of f once S carries the initial topology, and compares it with no other topology.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 4dc955d139c3 · pair key 9cc3a0c6b6cb.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Continuous functions › Defining topologies via continuous functions ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
If f is injective, this topology is canonically identified with the subspace topology of S, viewed as a subset of X. Show all
Topology.IsEmbedding. toHomeomorph more general
def Topology.IsEmbedding.toHomeomorph {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} : Topology.IsEmbedding f → X ≃ₜ ↑(Set.range f)
Mathlib.Topology.Homeomorph.Lemmas · lines 412–415
Why more general: The declaration builds the identification for every embedding, so it also covers maps whose topology merely coincides with the induced one rather than being given as it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f44900659af4 · pair key 16b391e26692.
Related, but states something else (1)
Topology.IsEmbedding. induced related
theorem Topology.IsEmbedding.induced {X : Type*} {Y : Type*} {f : X → Y} [t : TopologicalSpace Y] : Function.Injective f → Topology.IsEmbedding f
Mathlib.Topology.Maps.Basic · lines 194–196
How it differs: Mathlib records the identification by saying that f is a topological embedding once S carries the topology induced by f; the embedding predicate is how the library encodes the canonical identification of S with its image inside X.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a6828d542e7d · pair key bbfee8b4edbe.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Continuous functions › Defining topologies via continuous functions ✕ Not formalized
A topology on a set S is uniquely determined by the class of all continuous functions S → X into all topological spaces X. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 807c015ee405). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Compact sets ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
Formally, a topological space X is called compact if each of its open covers has a finite subcover. Show all
CompactSpace close match
class CompactSpace (X : Type*) [TopologicalSpace X] : Prop
Mathlib.Topology.Defs.Filter · lines 299–301
Why close, not exact: Mathlib's class says the whole space is compact but writes compactness through cluster points of filters rather than through open covers; the two conditions pick out the same notion of a compact space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3a667f1d7738 · pair key cca96c11e5dc.
isCompact_iff_finite_subcover more general
theorem isCompact_iff_finite_subcover {X : Type u} [TopologicalSpace X] {s : Set X} : IsCompact s ↔ ∀ {ι : Type u} (U : ι → Set X), (∀ (i : ι), IsOpen (U i)) → s ⊆ ⋃ i, U i → ∃ t, s ⊆ ⋃ i ∈ t, U i
Mathlib.Topology.Compactness.Compact · lines 385–388
Why more general: Stated for an arbitrary subset rather than for the space alone, with covering written as inclusion in the union and the finite subfamily indexed by a Finset.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 868592dff474 · pair key c1f4db780285.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Compact sets ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
Otherwise it is called non-compact. Show all
NoncompactSpace close match
class NoncompactSpace (X : Type*) [TopologicalSpace X] : Prop
Mathlib.Topology.Defs.Filter · lines 305–307
Why close, not exact: Mathlib's class negates compactness as the library writes it, through cluster points of filters on the whole space, where the passage negates the cover condition it has just given.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 8864a8ca3928 · pair key 8b752be52ea9.
not_compactSpace_iff close match
theorem not_compactSpace_iff {X : Type u} [TopologicalSpace X] : ¬CompactSpace X ↔ NoncompactSpace X
Mathlib.Topology.Compactness.Compact · lines 901–902
Why close, not exact: A theorem unfolding the library's noncompactness class into the negation of compactness, which is the condition the passage uses to introduce the name.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e145bb6b8dc5 · pair key b291dccfe767.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Compact sets ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Explicitly, this means that for every arbitrary collection {U α }α ∈ A of open subsets of X such that X = ⋃α ∈ A U α , there is a finite subset J of A such that X = ⋃i ∈ J U i . Show all
isCompact_iff_finite_subcover more general
theorem isCompact_iff_finite_subcover {X : Type u} [TopologicalSpace X] {s : Set X} : IsCompact s ↔ ∀ {ι : Type u} (U : ι → Set X), (∀ (i : ι), IsOpen (U i)) → s ⊆ ⋃ i, U i → ∃ t, s ⊆ ⋃ i ∈ t, U i
Mathlib.Topology.Compactness.Compact · lines 385–388
Why more general: Stated for an arbitrary subset of the space; covering is written as inclusion in the indexed union and the finite subfamily is given by a Finset of indices.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a3b5a9eb974e · pair key 719202620ada.
Related, but states something else (1)
TopologicalSpace.IsOpenCover. exists_finite_of_compactSpace related
theorem TopologicalSpace.IsOpenCover.exists_finite_of_compactSpace {ι : Type*} {X : Type*} [TopologicalSpace X] {u : ι → TopologicalSpace.Opens X} : TopologicalSpace.IsOpenCover u → ∀ [CompactSpace X], ∃ s, TopologicalSpace.IsOpenCover fun i ↦ u ↑i
Mathlib.Topology.Sets.OpenCover · lines 66–72
How it differs: Gives only the direction from compactness to the existence of a finite subfamily that still covers, not the equivalence the passage states.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1b90cd8dd238 · pair key 3f65df250387.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Compact sets ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Every closed interval in R of finite length is compact. Show all
ConditionallyCompleteLinearOrder. isCompact_Icc more general
theorem ConditionallyCompleteLinearOrder.isCompact_Icc {α : Type*} [ConditionallyCompleteLinearOrder α] [TopologicalSpace α] [OrderTopology α] (a b : α) : IsCompact (Set.Icc a b)
Mathlib.Topology.Order.IsLUB · lines 244–263
Why more general: Stated for every conditionally complete linear order with the order topology; the real line is one such order, and endpoints in the order make the interval of finite length.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 82f5422b78c7 · pair key 0b13cde4965b.
compactSpace_Icc more general
instance compactSpace_Icc {α : Type*} [Preorder α] [TopologicalSpace α] [CompactIccSpace α] (a b : α) : CompactSpace ↑(Set.Icc a b)
Mathlib.Topology.Order.Compact · lines 113–114
Why more general: Stated for any preorder whose closed intervals are compact, and it presents the interval as a subspace rather than as a subset of the line.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3c919a93aa66 · pair key e0a633b8b974.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Compact sets ✓ Formalized
Formalized: Mathlib states a more general result (proved).
More is true: In Rn, a set is compact if and only if it is closed and bounded. (See Heine–Borel theorem). Show all
Metric. isCompact_iff_isClosed_bounded more general
theorem Metric.isCompact_iff_isClosed_bounded {α : Type*} {s : Set α} [MetricSpace α] [ProperSpace α] : IsCompact s ↔ IsClosed s ∧ Bornology.IsBounded s
Mathlib.Topology.MetricSpace.Bounded · lines 335–337
Why more general: Stated for every proper metric space; boundedness is the bornological notion, which on a metric space is boundedness in the metric.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2bd33069223f · pair key c1069787b681.
Related, but states something else (1)
Metric. isCompact_of_isClosed_isBounded related
theorem Metric.isCompact_of_isClosed_isBounded {α : Type u} {s : Set α} [PseudoMetricSpace α] [ProperSpace α] : IsClosed s → Bornology.IsBounded s → IsCompact s
Mathlib.Topology.MetricSpace.Bounded · lines 320–325
How it differs: Gives only the direction from closed and bounded to compact, so by itself it is not the equivalence the passage asserts.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 837e96d2e79e · pair key ec9248a139d9.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Compact sets ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Every continuous image of a compact space is compact. Show all
IsCompact. image more general
theorem IsCompact.image {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {s : Set X} {f : X → Y} : IsCompact s → Continuous f → IsCompact (f '' s)
Mathlib.Topology.Compactness.Compact · lines 124–125
Why more general: Stated for every compact subset of the domain, so it covers images of parts of the space as well as of the space itself.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ad1664d1e06a · pair key 37d828786ba9.
Function.Surjective. compactSpace special case
theorem Function.Surjective.compactSpace {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} : Continuous f → ∀ [CompactSpace X], Function.Surjective f → CompactSpace Y
Mathlib.Topology.Compactness.Compact · lines 971–975
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f198bdbdae8e · pair key da5b06e51680.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Compact sets ✓ Formalized
Formalized: Mathlib states this exactly (proved).
A compact subset of a Hausdorff space is closed. Show all
IsCompact. isClosed exact match
theorem IsCompact.isClosed {X : Type*} [TopologicalSpace X] [T2Space X] {s : Set X} : IsCompact s → IsClosed s
Mathlib.Topology.Separation.Hausdorff · lines 600–603
Note: Mathlib writes the Hausdorff separation axiom as the class T2Space, and the subset is an arbitrary compact set.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 292d4f9fbec6 · pair key 047223c703a0.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Compact sets ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
Every continuous bijection from a compact space to a Hausdorff space is necessarily a homeomorphism. Show all
Continuous. homeoOfEquivCompactToT2 close match
def Continuous.homeoOfEquivCompactToT2 {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] [CompactSpace X] [T2Space Y] {f : X ≃ Y} : Continuous ⇑f → X ≃ₜ Y
Mathlib.Topology.Homeomorph.Lemmas · lines 474–477
Why close, not exact: The bijection is supplied as a bundled Equiv and the result is returned as a bundled Homeomorph carrying its inverse.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 137a92758284 · pair key cc6c7136bf05.
Continuous. continuous_symm_of_equiv_compact_to_t2 close match
theorem Continuous.continuous_symm_of_equiv_compact_to_t2 {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] [CompactSpace X] [T2Space Y] {f : X ≃ Y} : Continuous ⇑f → Continuous ⇑f.symm
Mathlib.Topology.Homeomorph.Lemmas · lines 462–467
Why close, not exact: This spells the conclusion out as continuity of the inverse map rather than packaging it as a single object.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key dad53f098703 · pair key 1c913cb2fdbd.
isHomeomorph_iff_continuous_bijective more general
theorem isHomeomorph_iff_continuous_bijective {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} [CompactSpace X] [T2Space Y] : IsHomeomorph f ↔ Continuous f ∧ Function.Bijective f
Mathlib.Topology.Homeomorph.Lemmas · lines 538–542
Why more general: Mathlib records the two way equivalence between being a homeomorphism and being a continuous bijection in this setting.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 496a5bd23835 · pair key ac3039a16792.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Compact sets ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Every sequence of points in a compact metric space has a convergent subsequence. Show all
CompactSpace. tendsto_subseq more general
theorem CompactSpace.tendsto_subseq {X : Type*} [TopologicalSpace X] [FirstCountableTopology X] [CompactSpace X] (x : ℕ → X) : ∃ a φ, StrictMono φ ∧ Filter.Tendsto (x ∘ φ) Filter.atTop (𝓝 a)
Mathlib.Topology.Sequences · lines 307–309
Why more general: Mathlib proves the statement for compact first countable spaces, a class that contains every compact metric space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c7d2381e7f5a · pair key 126331af6642.
SeqCompactSpace. tendsto_subseq more general
theorem SeqCompactSpace.tendsto_subseq {X : Type*} [TopologicalSpace X] [SeqCompactSpace X] (x : ℕ → X) : ∃ a φ, StrictMono φ ∧ Filter.Tendsto (x ∘ φ) Filter.atTop (𝓝 a)
Mathlib.Topology.Sequences · lines 277–280
Why more general: The hypothesis is stated as the class SeqCompactSpace, which instance resolution derives for a compact metric space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ecbf4a9fcf74 · pair key 19e3540a8d6b.
IsCompact. tendsto_subseq more general
theorem IsCompact.tendsto_subseq {X : Type*} [TopologicalSpace X] [FirstCountableTopology X] {s : Set X} {x : ℕ → X} : IsCompact s → (∀ (n : ℕ), x n ∈ s) → ∃ a ∈ s, ∃ φ, StrictMono φ ∧ Filter.Tendsto (x ∘ φ) Filter.atTop (𝓝 a)
Mathlib.Topology.Sequences · lines 298–300
Why more general: This is the version for a compact subset that the sequence lives in, with the limit found inside that subset.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3c4936f25b74 · pair key be230c658d1d.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Compact sets ◔ Partial
Partial: Mathlib states a special case (proved).
Every compact finite-dimensional manifold can be embedded in some Euclidean space Rn. Show all
exists_embedding_euclidean_of_compact special case
theorem exists_embedding_euclidean_of_compact {E : Type uE} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {H : Type uH} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} {M : Type uM} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I (↑⊤) M] [T2Space M] [CompactSpace M] : ∃ n e, ContMDiff I (modelWithCornersSelf ℝ (EuclideanSpace ℝ (Fin n))) (↑⊤) e ∧ Topology.IsClosedEmbedding e ∧ ∀ (x : M), Function.Injective ⇑(mfderiv% e x)
Mathlib.Geometry.Manifold.WhitneyEmbedding · lines 132–139
Why a special case: Mathlib asks the manifold to carry a smooth structure and returns a smooth closed embedding, where the passage speaks of finite dimensional manifolds without naming one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 382b0f10de7a · pair key 4f8ed174c374.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Connected sets ◔ Partial
Partial: Mathlib states a more general result, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.
A topological space X is said to be disconnected if it is the union of two disjoint nonempty open sets. Show all
IsClopen. not_isPreconnected_iff more general
theorem IsClopen.not_isPreconnected_iff {α : Type u} [TopologicalSpace α] {s : Set α} : IsClopen s → (¬IsPreconnected s ↔ ∃ a b, IsClopen a ∧ IsClopen b ∧ a.Nonempty ∧ b.Nonempty ∧ Disjoint a b ∧ s = a ∪ b)
Mathlib.Topology.Connected.Clopen · lines 356–359
Why more general: The theorem is given for an arbitrary clopen subset, so the whole space is one case of it, and it writes the two pieces as clopen sets; for a disjoint pair whose union is the whole space those are exactly the open pieces of the passage, each being the complement of the other.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f1a83f3f1636 · pair key 5bf1693ad34d.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Connected sets ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
Otherwise, X is said to be connected. Show all
PreconnectedSpace close match
class PreconnectedSpace (α : Type u) [TopologicalSpace α] : Prop
Mathlib.Topology.Connected.Basic · lines 697–699
Why close, not exact: Mathlib gives the name preconnected to the property the passage calls connected, and like the passage it allows the empty space to have it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 51ae6bafd651 · pair key f4590fdf8408.
ConnectedSpace special case
class ConnectedSpace (α : Type u) [TopologicalSpace α] : Prop
Mathlib.Topology.Connected.Basic · lines 705–707
Why a special case: Mathlib's ConnectedSpace adds a nonemptiness requirement, and the article says explicitly that it does not impose one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2354e18501c8 · pair key d88695523682.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Connected sets ◔ Partial
Partial: Mathlib states this up to a convention difference, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.
A subset of a topological space is said to be connected if it is connected under its subspace topology. Show all
isPreconnected_iff_preconnectedSpace close match
theorem isPreconnected_iff_preconnectedSpace {α : Type u} [TopologicalSpace α] {s : Set α} : IsPreconnected s ↔ PreconnectedSpace ↑s
Mathlib.Topology.Connected.Basic · lines 807–809
Why close, not exact: The theorem equates the library's predicate on a subset with the same property of the subtype that carries the subspace topology.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key bf5fd746ea77 · pair key 8eae6c071d48.
isConnected_iff_connectedSpace special case
theorem isConnected_iff_connectedSpace {α : Type u} [TopologicalSpace α] {s : Set α} : IsConnected s ↔ ConnectedSpace ↑s
Mathlib.Topology.Connected.Basic · lines 811–813
Why a special case: Both sides here carry mathlib's nonemptiness requirement, which the article declines to impose on connected sets.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a866d126cd82 · pair key 6d65a6cc8f5b.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Connected sets ◔ Partial
Partial: Mathlib states part of this (proved).
For a topological space X the following conditions are equivalent: X is connected. X cannot be divided into two disjoint nonempty closed sets. The only subsets of X that are both open and closed (clopen sets) are X and the empty set. The only subsets of X with empty boundary are X and the empty set. X cannot be written as the union of two nonempty separated sets. The only continuous functions from X to {0,1}, the two-point space endowed with the discrete topology, are constant. Show all
preconnectedSpace_iff_clopen states part
theorem preconnectedSpace_iff_clopen {α : Type u} [TopologicalSpace α] : PreconnectedSpace α ↔ ∀ (s : Set α), IsClopen s → s = ∅ ∨ s = Set.univ
Mathlib.Topology.Connected.Clopen · lines 692–698
Why only part: Mathlib names the property preconnected, and the condition on the right is that the only clopen subsets are the empty set and the whole space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key af5389701d8f · pair key 1fd62a929a1f.
isPreconnected_closed_iff states part
theorem isPreconnected_closed_iff {α : Type u} [TopologicalSpace α] {s : Set α} : IsPreconnected s ↔ ∀ (t t' : Set α), IsClosed t → IsClosed t' → s ⊆ t ∪ t' → (s ∩ t).Nonempty → (s ∩ t').Nonempty → (s ∩ (t ∩ t')).Nonempty
Mathlib.Topology.Connected.Basic · lines 319–339
Why only part: The theorem is stated for an arbitrary subset, and the passage's case is the one where that subset is the whole space; the condition is phrased as two covering closed sets being forced to meet.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f1c67070f25d · pair key 062d76af9c98.
PreconnectedSpace. constant states part
theorem PreconnectedSpace.constant {α : Type u} [TopologicalSpace α] {Y : Type*} [TopologicalSpace Y] [DiscreteTopology Y] : PreconnectedSpace α → ∀ {f : α → Y}, Continuous f → ∀ {x y : α}, f x = f y
Mathlib.Topology.Connected.TotallyDisconnected · lines 335–337
Why only part: It gives only the direction from connectedness to constancy, not the converse the passage's equivalence also asserts.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 91492638979a · pair key 865084aeb4dd.
preconnectedSpace_of_forall_constant states part
theorem preconnectedSpace_of_forall_constant {α : Type u} [TopologicalSpace α] : (∀ (f : α → Bool), Continuous f → ∀ (x y : α), f x = f y) → PreconnectedSpace α
Mathlib.Topology.Connected.Clopen · lines 687–690
Why only part: It gives only the converse direction of that equivalence, with Bool standing for the two point discrete space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 04e9cbfe1fb5 · pair key d979f339fc88.
frontier_eq_empty_iff states part
theorem frontier_eq_empty_iff {α : Type u} [TopologicalSpace α] [PreconnectedSpace α] {s : Set α} : frontier s = ∅ ↔ s = ∅ ∨ s = Set.univ
Mathlib.Topology.Connected.Clopen · lines 181–183
Why only part: Connectedness is a hypothesis here rather than a side of the equivalence, so the converse direction is not stated.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 5 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1e0712872728 · pair key 1966eb812d9e.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Connected sets ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Every interval in R is connected. Show all
Real. convex_iff_isPreconnected more general
theorem Real.convex_iff_isPreconnected {s : Set ℝ} : Convex ℝ s ↔ IsPreconnected s
Mathlib.Analysis.Convex.Topology · lines 43–44
Why more general: Stated as a two-way equivalence, so it also records the converse that the passage does not claim.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b5d7acdd08a3 · pair key 0c200efe479b.
Set.OrdConnected. isPreconnected more general
theorem Set.OrdConnected.isPreconnected {α : Type u} [TopologicalSpace α] [ConditionallyCompleteLinearOrder α] [OrderTopology α] [DenselyOrdered α] {s : Set α} : s.OrdConnected → IsPreconnected s
Mathlib.Topology.Order.IntermediateValue · lines 474–476
Why more general: It is stated for any densely ordered conditionally complete order with its order topology, so it reaches past the real line.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 35f331abfcc8 · pair key f41589239fd0.
isPreconnected_Icc special case
theorem isPreconnected_Icc {α : Type u} [TopologicalSpace α] [ConditionallyCompleteLinearOrder α] [OrderTopology α] [DenselyOrdered α] {a b : α} : IsPreconnected (Set.Icc a b)
Mathlib.Topology.Order.IntermediateValue · lines 460–469
Why a special case: It covers only intervals with two endpoints included, not half-open, unbounded or empty ones.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key cc44096b7d86 · pair key d3ee1bce108d.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Connected sets ✓ Formalized
Formalized: Mathlib states this exactly (proved).
The continuous image of a connected space is connected. Show all
isPreconnected_range exact match
theorem isPreconnected_range {α : Type u} {β : Type v} [TopologicalSpace α] [TopologicalSpace β] [PreconnectedSpace α] {f : α → β} : Continuous f → IsPreconnected (Set.range f)
Mathlib.Topology.Connected.Basic · lines 722–724
Note: Lean's PreconnectedSpace admits the empty space, which is the convention this article adopts for connectedness.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7b535aaecd6b · pair key 20f55c0ed710.
isConnected_range close match
theorem isConnected_range {α : Type u} {β : Type v} [TopologicalSpace α] [TopologicalSpace β] [ConnectedSpace α] {f : α → β} : Continuous f → IsConnected (Set.range f)
Mathlib.Topology.Connected.Basic · lines 726–728
Why close, not exact: Lean's IsConnected bundles nonemptiness together with connectedness, the usage the article mentions but does not adopt, so only the empty domain falls outside it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 5e544ef5c883 · pair key ac7633ca34c7.
IsPreconnected. image more general
theorem IsPreconnected.image {α : Type u} {β : Type v} [TopologicalSpace α] [TopologicalSpace β] {s : Set α} : IsPreconnected s → ∀ (f : α → β), ContinuousOn f s → IsPreconnected (f '' s)
Mathlib.Topology.Connected.Basic · lines 294–312
Why more general: It is phrased for an arbitrary connected subset and for maps continuous merely on that subset.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 953ae554660f · pair key 5392d0c2af5d.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Connected sets › Connected components ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
The maximal connected subsets (ordered by inclusion) of a nonempty topological space are called the connected components of the space. Show all
connectedComponent close match
def connectedComponent {α : Type u} [TopologicalSpace α] : α → Set α
Mathlib.Topology.Connected.Basic · lines 495–496
Why close, not exact: Lean indexes the components by a member of the space rather than singling them out as the maximal elements under inclusion; its docstring gives the maximality.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key cd4e527fa83a · pair key 988381ab2342.
ConnectedComponents close match
def ConnectedComponents (α : Type u) [TopologicalSpace α] : Type u
Mathlib.Topology.Connected.Clopen · lines 500–501
Why close, not exact: Lean presents the collection of components as a quotient type instead of a family of subsets of the space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 55a74edac238 · pair key 91e11841e3b3.
Related, but states something else (1)
IsPreconnected. subset_connectedComponent related
theorem IsPreconnected.subset_connectedComponent {α : Type u} [TopologicalSpace α] {x : α} {s : Set α} : IsPreconnected s → x ∈ s → s ⊆ connectedComponent x
Mathlib.Topology.Connected.Basic · lines 552–553
How it differs: It records half of the maximality, that any connected set sits inside the component of one of its members, rather than defining the components.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 04359ab99702 · pair key 4a3c226381e8.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Connected sets › Connected components ✓ Formalized
Formalized by 3 parts together (more general):
connectedComponent_disjoint Mathlib (proved) distinct components are disjoint isConnected_connectedComponent Mathlib (proved) every component is nonempty mem_connectedComponent Mathlib (proved) the union of all components is the whole space
The components of any topological space X form a partition of X: they are disjoint, nonempty, and their union is the whole space. Show all
connectedComponent_disjoint states part
theorem connectedComponent_disjoint {α : Type u} [TopologicalSpace α] {x y : α} : connectedComponent x ≠ connectedComponent y → Disjoint (connectedComponent x) (connectedComponent y)
Mathlib.Topology.Connected.Basic · lines 601–604
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9e54a6949968 · pair key 0bff4061ca2a.
isConnected_connectedComponent states part
theorem isConnected_connectedComponent {α : Type u} [TopologicalSpace α] {x : α} : IsConnected (connectedComponent x)
Mathlib.Topology.Connected.Basic · lines 544–545
Why only part: It also records connectedness of the component, which c2 does not ask for.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f51466d4adbf · pair key 10169160a5de.
mem_connectedComponent states part
theorem mem_connectedComponent {α : Type u} [TopologicalSpace α] {x : α} : x ∈ connectedComponent x
Mathlib.Topology.Connected.Basic · lines 516–517
Why only part: It also names which component holds the element, which the union claim does not record.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 512836db3cff · pair key 61d1ee01b960.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Connected sets › Connected components ✓ Formalized
Formalized: Mathlib states this exactly (proved).
Every component is a closed subset of the original space. Show all
isClosed_connectedComponent exact match
theorem isClosed_connectedComponent {α : Type u} [TopologicalSpace α] {x : α} : IsClosed (connectedComponent x)
Mathlib.Topology.Connected.Basic · lines 606–609
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 02557e0820eb · pair key 4adf956f117c.
isClopen_connectedComponent special case
theorem isClopen_connectedComponent {α : Type u} [TopologicalSpace α] [LocallyConnectedSpace α] {x : α} : IsClopen (connectedComponent x)
Mathlib.Topology.Connected.LocallyConnected · lines 81–83
Why a special case: It asks the space to be locally connected, which only some of the passage's spaces are.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 8cbd80d07615 · pair key 02c349bd6885.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Connected sets › Connected components ◔ Partial
Partial: FF.SchemeProperties states a special case (proved).
It follows that, in the case where their number is finite, each component is also an open subset. Show all
NoetherianSpace. isOpen_connectedComponent special case
theorem NoetherianSpace.isOpen_connectedComponent {X : Type u} [TopologicalSpace X] [TopologicalSpace.NoetherianSpace X] (x : X) : IsOpen (connectedComponent x)
SchemeProperties.NoetherianComponents · lines 49–74
Why a special case: A Noetherian space has finitely many components in this index, so such spaces are among the ones the passage speaks about.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit b9f054b. Location key 986ec30020a6 · pair key 187b5d2d0ec4.
Related, but states something else (1)
isOpen_connectedComponent related
theorem isOpen_connectedComponent {α : Type u} [TopologicalSpace α] [LocallyConnectedSpace α] {x : α} : IsOpen (connectedComponent x)
Mathlib.Topology.Connected.LocallyConnected · lines 76–79
How it differs: Local connectedness neither follows from nor implies having finitely many components, so its setting and the passage's only overlap.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 5e9aa667455b · pair key 35426caa37ba.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Connected sets › Connected components ✕ Not formalized
However, if their number is infinite, this might not be the case ; for instance, the connected components of the set of the rational numbers are the one-point sets, which are not open. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt c334a76c274d). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Connected sets › Connected components ◔ Partial
Partial: Mathlib states part of this (proved).
However, if their number is infinite, this might not be the case; for instance, the connected components of the set of the rational numbers are the one-point sets, which are not open. Show all
Rat. instTotallyDisconnectedSpace states part
instance Rat.instTotallyDisconnectedSpace : TotallyDisconnectedSpace ℚ
Mathlib.Topology.Instances.RatLemmas · lines 81–92
Why only part: It leaves the failure of openness of those one-element components unstated.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9ded27cbdf59 · pair key 6299b9495409.
Related, but states something else (2)
totallyDisconnectedSpace_iff_connectedComponent_singleton related
theorem totallyDisconnectedSpace_iff_connectedComponent_singleton {α : Type u} [TopologicalSpace α] : TotallyDisconnectedSpace α ↔ ∀ (x : α), connectedComponent x = {x}
Mathlib.Topology.Connected.TotallyDisconnected · lines 108–113
How it differs: It is the general reading of total disconnectedness as components being one-element sets, and names no particular space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 4c69b4352955 · pair key 41adee62b0fb.
dense_compl_singleton_iff_not_open related
theorem dense_compl_singleton_iff_not_open {X : Type u} [TopologicalSpace X] {x : X} : Dense {x}ᶜ ↔ ¬IsOpen {x}
Mathlib.Topology.Closure · lines 460–467
How it differs: It turns the failure of openness of a one-element set into density of its complement, but does not carry out that check for the rationals.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, low confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3ccc6e366f1f · pair key ea85c7fa4bf6.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Connected sets › Connected components ◔ Partial
Partial: Mathlib states part of this (proved).
Let Γx be the connected component of x in a topological space X, and Γx ′ be the intersection of all open-closed sets containing x (called quasi-component of x.) Then Γx ⊂ Γ′x where the equality holds if X is compact Hausdorff or locally connected. Show all
connectedComponent_subset_iInter_isClopen states part
theorem connectedComponent_subset_iInter_isClopen {α : Type u} [TopologicalSpace α] {x : α} : connectedComponent x ⊆ ⋂ Z, ↑Z
Mathlib.Topology.Connected.Clopen · lines 367–369
Why only part: The indexed intersection runs over the subtype of clopen sets holding the point, which is the quasi-component the passage names.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 6b897f229d31 · pair key fc8324993670.
connectedComponent_eq_iInter_isClopen states part
theorem connectedComponent_eq_iInter_isClopen {X : Type*} [TopologicalSpace X] [T2Space X] [CompactSpace X] (x : X) : connectedComponent x = ⋂ s, ↑s
Mathlib.Topology.Separation.Regular · lines 794–845
Why only part: This covers only the compact Hausdorff half of the conjunct; the locally connected half is not asserted here.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 276a34ac8e4c · pair key 14eedecee36f.
Related, but states something else (1)
isClopen_connectedComponent related
theorem isClopen_connectedComponent {α : Type u} [TopologicalSpace α] [LocallyConnectedSpace α] {x : α} : IsClopen (connectedComponent x)
Mathlib.Topology.Connected.LocallyConnected · lines 81–83
How it differs: Clopenness of the component gives one inclusion only; the reverse inclusion needs the separate subset lemma, so this alone does not give the equality.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2772f69c6792 · pair key b47b3b8d87ea.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Connected sets › Disconnected spaces ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
A space in which all components are one-point sets is called totally disconnected. Show all
TotallyDisconnectedSpace close match
class TotallyDisconnectedSpace (α : Type u) [TopologicalSpace α] : Prop
Mathlib.Topology.Connected.TotallyDisconnected · lines 48–50
Why close, not exact: Mathlib spells the condition as its set-level predicate at the whole space, asking that preconnected subsets have at most one element; that is the same property under a different encoding, and the library's own description of it speaks of components being singletons.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7198ff245e1f · pair key cffb67eb549b.
totallyDisconnectedSpace_iff_connectedComponent_singleton close match
theorem totallyDisconnectedSpace_iff_connectedComponent_singleton {α : Type u} [TopologicalSpace α] : TotallyDisconnectedSpace α ↔ ∀ (x : α), connectedComponent x = {x}
Mathlib.Topology.Connected.TotallyDisconnected · lines 108–113
Why close, not exact: It spells out the library's class as the condition that each point's component is the singleton on that point, which is the wording the passage uses.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 5bd8f30800c5 · pair key 9a9052308043.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Connected sets › Disconnected spaces ✓ Formalized
Formalized: Mathlib states this exactly (a definition).
Related to this property, a space X is called totally separated if, for any two distinct elements x and y of X, there exist disjoint open neighborhoods U of x and V of y such that X is the union of U and V. Show all
TotallySeparatedSpace exact match
class TotallySeparatedSpace (α : Type u) [TopologicalSpace α] : Prop
Mathlib.Topology.Connected.TotallyDisconnected · lines 214–216
Note: The library writes the covering requirement as the whole space being contained in the union of the two open sets, which asks the same thing as their union being the space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 979eb64841eb · pair key d03e9c14009c.
IsTotallySeparated more general
def IsTotallySeparated {α : Type u} [TopologicalSpace α] : Set α → Prop
Mathlib.Topology.Connected.TotallyDisconnected · lines 190–192
Why more general: It is the same separation condition stated for an arbitrary subset, the covering being asked of that subset.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d85ef2e6a3dd · pair key 6bd9fcb62d85.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Connected sets › Disconnected spaces ◔ Partial
Partial: Mathlib states part of this (proved).
Related to this property, a space X is called totally separated if, for any two distinct elements x and y of X, there exist disjoint open neighborhoods U of x and V of y such that X is the union of U and V. Clearly any totally separated space is totally disconnected, but the converse does not hold. Show all
TotallySeparatedSpace. totallyDisconnectedSpace states part
instance TotallySeparatedSpace.totallyDisconnectedSpace (α : Type u) [TopologicalSpace α] [TotallySeparatedSpace α] : TotallyDisconnectedSpace α
Mathlib.Topology.Connected.TotallyDisconnected · lines 219–221
Why only part: The library records the implication as an instance, so the conclusion is found automatically for any totally separated space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1f5187b07574 · pair key 053885c7f5d3.
IsTotallySeparated. isTotallyDisconnected states part
theorem IsTotallySeparated.isTotallyDisconnected {α : Type u} [TopologicalSpace α] {s : Set α} : IsTotallySeparated s → IsTotallyDisconnected s
Mathlib.Topology.Connected.TotallyDisconnected · line 210
Why only part: It is the subset form of the same implication, with the separation and the disconnectedness both read on the chosen subset.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c8021e30ac81 · pair key f44537a524a3.
Related, but states something else (1)
totallyDisconnectedSpace_iff_totallySeparatedSpace related
theorem totallyDisconnectedSpace_iff_totallySeparatedSpace {X : Type*} [TopologicalSpace X] [T2Space X] [WeaklyLocallyCompactSpace X] : TotallyDisconnectedSpace X ↔ TotallySeparatedSpace X
Mathlib.Topology.Separation.Regular · lines 930–933
How it differs: It says the two properties agree under extra separation and local compactness assumptions, which neither asserts the unconditional implication nor exhibits the failure of the converse.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 81c5162accd9 · pair key d9f3b803df95.
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Connected sets › Disconnected spaces ✕ Not formalized
For example, take two copies of the rational numbers Q, and identify them at every point except zero. The resulting space, with the quotient topology, is totally disconnected. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt ae4cf3c73c85). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Connected sets › Disconnected spaces ✕ Not formalized
However, by considering the two copies of zero, one sees that the space is not totally separated. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 0f5a996f1dc4). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Connected sets › Disconnected spaces ✕ Not formalized
In fact, it is not even Hausdorff , and the condition of being totally separated is strictly stronger than the condition of being Hausdorff. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 5db114d041b8). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Connected sets › Disconnected spaces ◔ Partial
Partial: Mathlib states part of this (proved).
In fact, it is not even Hausdorff, and the condition of being totally separated is strictly stronger than the condition of being Hausdorff. Show all
TotallySeparatedSpace. t2Space states part
instance TotallySeparatedSpace.t2Space {X : Type*} [TopologicalSpace X] [TotallySeparatedSpace X] : T2Space X
Mathlib.Topology.Connected.Separation · lines 27–30
Why only part: Only the implication is recorded; the universe holds no space that is Hausdorff and fails total separation, so the strictness the passage also claims is not stated.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a35220b30cd3 · pair key 370e6396011d.
Related, but states something else (1)
instTotallySeparatedSpaceOfT2SpaceOfPrespectralSpace related
instance instTotallySeparatedSpaceOfT2SpaceOfPrespectralSpace {X : Type*} [TopologicalSpace X] [T2Space X] [PrespectralSpace X] : TotallySeparatedSpace X
Mathlib.Topology.Spectral.Prespectral · lines 55–59
How it differs: It goes the other way, from the Hausdorff property plus a basis condition to total separation, so it neither gives the implication nor shows it strict.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key dfa27169d7e8 · pair key 2670581bba89.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Connected sets › Path-connected sets ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
A path from a point x to a point y in a topological space X is a continuous function f from the unit interval [0,1] to X with f(0) = x and f(1) = y. Show all
Path close match
structure Path {X : Type u_1} [TopologicalSpace X] : X → X → Type u_1
Mathlib.Topology.Path · lines 60–64
Why close, not exact: Mathlib packages the continuous map on the unit-interval subtype together with its two endpoint equalities into a single structure.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 67d8ec2e921b · pair key d7ba4f21ec0d.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Connected sets › Path-connected sets ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
A path-component of X is an equivalence class of X under the equivalence relation, which makes x equivalent to y if there is a path from x to y. Show all
pathComponent close match
def pathComponent {X : Type*} [TopologicalSpace X] : X → Set X
Mathlib.Topology.Connected.PathConnected · lines 291–292
Why close, not exact: Mathlib names the class of a point directly, as the set of points that a continuous path joins to it, instead of quantifying over classes of the relation.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d007b56b0b3f · pair key c181bc495381.
Related, but states something else (1)
ZerothHomotopy related
def ZerothHomotopy (X : Type u_1) [TopologicalSpace X] : Type u_1
Mathlib.Topology.Connected.PathConnected · lines 117–118
How it differs: This is the quotient type collecting all path components of X, not one component of it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a37457cf01bf · pair key 959849c43f1e.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Connected sets › Path-connected sets ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
The space X is said to be path-connected (or pathwise connected or 0-connected) if there is at most one path-component; that is, if there is a path joining any two points in X. Show all
PathConnectedSpace close match
class PathConnectedSpace (X : Type*) [TopologicalSpace X] : Prop
Mathlib.Topology.Connected.PathConnected · lines 577–581
Why close, not exact: Mathlib's class fixes the convention that the space also has a point, so it agrees with the article on every space but the empty one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c84a209c09a8 · pair key 9e5019e9dec1.
Related, but states something else (1)
IsPathConnected related
def IsPathConnected {X : Type*} [TopologicalSpace X] : Set X → Prop
Mathlib.Topology.Connected.PathConnected · lines 412–413
How it differs: This is the property of a subset of a space, phrased through a point joined within the subset to all others, not the property of the space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 297c5f3113f2 · pair key 7eb16b61115d.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Connected sets › Path-connected sets ✓ Formalized
Formalized: Mathlib states this exactly (proved).
Every path-connected space is connected. Show all
PathConnectedSpace. connectedSpace exact match
instance PathConnectedSpace.connectedSpace {X : Type*} [TopologicalSpace X] [PathConnectedSpace X] : ConnectedSpace X
Mathlib.Topology.Connected.PathConnected · lines 721–727
Note: Both classes involved in Mathlib carry the existence of a point, so the only space the declaration passes over is the empty one, where connectedness holds with no content.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d4ea24a5b237 · pair key bab714d80c6f.
Related, but states something else (1)
IsPathConnected. isConnected related
theorem IsPathConnected.isConnected {X : Type*} [TopologicalSpace X] {F : Set X} : IsPathConnected F → IsConnected F
Mathlib.Topology.Connected.PathConnected · lines 733–736
How it differs: It draws connectedness of a subset from path-connectedness of that subset; moving to the article's statement about spaces needs further library lemmas.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c71674f48d0a · pair key 2626ef06fb46.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Connected sets › Path-connected sets ✕ Not formalized
The converse is not always true : examples of connected spaces that are not path-connected include the extended long line L* and the topologist's sine curve. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 6ddf99ecc300). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Related, but states something else (1)
MathlibExt.Analysis.MandelbarWanted.ComplexAnalysis. mandelbar_not_path_connected related
theorem MathlibExt.Analysis.MandelbarWanted.ComplexAnalysis.mandelbar_not_path_connected : ¬IsPathConnected MathlibExt.Analysis.MandelbarWanted.ComplexAnalysis.Mandelbar
WantedExt.Analysis.MandelbarWanted · line 72
How it differs: It records of one planar set that path-connectedness fails for it, while its connectedness is nowhere stated in the index.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773. Location key a420e966997c · pair key 708545ff8236.
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Connected sets › Path-connected sets ✕ Not formalized
The converse is not always true: examples of connected spaces that are not path-connected include the extended long line L* and the topologist's sine curve. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 4697103f1ed7). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Connected sets › Path-connected sets ✕ Not formalized
The converse is not always true: examples of connected spaces that are not path-connected include the extended long line L* and the topologist's sine curve. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt ca208bed9839). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Connected sets › Path-connected sets ◔ Partial
Partial: Mathlib states a special case (proved).
However, subsets of the real line R are connected if and only if they are path-connected ; these subsets are the intervals of R. Also, open subsets of Rn or Cn are connected if and only if they are path-connected. Show all
IsOpen. isConnected_iff_isPathConnected special case
theorem IsOpen.isConnected_iff_isPathConnected {X : Type*} [TopologicalSpace X] [LocallyPathConnectedSpace X] {U : Set X} : IsOpen U → (IsConnected U ↔ IsPathConnected U)
Mathlib.Topology.Connected.LocallyPathConnected · lines 190–194
Why a special case: The declaration asks that the subset be open, and open subsets of the line are among the subsets the article speaks of.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f09baccbba5c · pair key 2fbb53135bec.
Related, but states something else (2)
IsPathConnected. isConnected related
theorem IsPathConnected.isConnected {X : Type*} [TopologicalSpace X] {F : Set X} : IsPathConnected F → IsConnected F
Mathlib.Topology.Connected.PathConnected · lines 733–736
How it differs: It gives only the implication from path-connectedness to connectedness, so it leaves the equivalence the article asserts unsettled.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3050a1d2ca54 · pair key 65643c36f7e6.
Convex. isPathConnected related
theorem Convex.isPathConnected {E : Type*} [AddCommGroup E] [_root_.Module ℝ E] [TopologicalSpace E] [ContinuousAdd E] [ContinuousSMul ℝ E] {s : Set E} : Convex ℝ s → s.Nonempty → IsPathConnected s
Mathlib.Analysis.Convex.PathConnected · lines 84–86
How it differs: It yields path-connectedness from convexity, and reaching the article's equivalence from it needs the lemmas tying connected subsets of the line to order-convex ones.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, low confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 34730b5c7793 · pair key b091a8c8884d.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Connected sets › Path-connected sets ✓ Formalized
Formalized: Mathlib states a more general result (proved).
However, subsets of the real line R are connected if and only if they are path-connected; these subsets are the intervals of R. Show all
setOf_isPreconnected_eq_of_ordered more general
theorem setOf_isPreconnected_eq_of_ordered {α : Type u} [TopologicalSpace α] [ConditionallyCompleteLinearOrder α] [OrderTopology α] [DenselyOrdered α] : {s | IsPreconnected s} = Set.range (Function.uncurry Set.Icc) ∪ Set.range (Function.uncurry Set.Ico) ∪ Set.range (Function.uncurry Set.Ioc) ∪ Set.range (Function.uncurry Set.Ioo) ∪ (Set.range Set.Ici ∪ Set.range Set.Ioi ∪ Set.range Set.Iic ∪ Set.range Set.Iio ∪ {Set.univ, ∅})
Deprecated at this commit, in favour of setOfPred_isPreconnected_eq_of_ordered .
Mathlib.Topology.Order.IntermediateValue · line 559
Why more general: The declaration equates the family of preconnected subsets with the family built from the closed, half-open, open, one-sided and whole-line intervals together with the empty set, over any dense conditionally complete linear order.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 90f89260ef9a · pair key 729f5f04ae4a.
isPreconnected_iff_ordConnected more general
theorem isPreconnected_iff_ordConnected {α : Type u} [TopologicalSpace α] [ConditionallyCompleteLinearOrder α] [OrderTopology α] [DenselyOrdered α] {s : Set α} : IsPreconnected s ↔ s.OrdConnected
Mathlib.Topology.Order.IntermediateValue · lines 478–479
Why more general: Being an interval is written here in the order-theoretic form Set.OrdConnected, a set that contains the whole closed segment between any two of its points.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 931a2a6a152b · pair key 4ddfb03cb69e.
Related, but states something else (1)
IsPreconnected. mem_intervals related
theorem IsPreconnected.mem_intervals {α : Type u} [TopologicalSpace α] [ConditionallyCompleteLinearOrder α] [OrderTopology α] {s : Set α} : IsPreconnected s → s ∈ {Set.Icc (InfSet.sInf s) (SupSet.sSup s), Set.Ico (InfSet.sInf s) (SupSet.sSup s), Set.Ioc (InfSet.sInf s) (SupSet.sSup s), Set.Ioo (InfSet.sInf s) (SupSet.sSup s), Set.Ici (InfSet.sInf s), Set.Ioi (InfSet.sInf s), Set.Iic (SupSet.sSup s), Set.Iio (SupSet.sSup s), Set.univ, ∅}
Mathlib.Topology.Order.IntermediateValue · lines 265–288
How it differs: The converse inclusion, that every interval is connected, is not reached by this declaration; its docstring says the reverse needs density of the order.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7e49a3da34ba · pair key 42c2b7a92cd3.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Connected sets › Path-connected sets ✓ Formalized
Formalized: Mathlib states a more general result (proved).
However, subsets of the real line R are connected if and only if they are path-connected; these subsets are the intervals of R. Also, open subsets of Rn or Cn are connected if and only if they are path-connected. Show all
IsOpen. isConnected_iff_isPathConnected more general
theorem IsOpen.isConnected_iff_isPathConnected {X : Type*} [TopologicalSpace X] [LocallyPathConnectedSpace X] {U : Set X} : IsOpen U → (IsConnected U ↔ IsPathConnected U)
Mathlib.Topology.Connected.LocallyPathConnected · lines 190–194
Why more general: The declaration proves the equivalence for an open subset of any locally path connected space, and real n-space is one such space through its norm.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key de3d1aef82de · pair key a4b48f882a63.
Related, but states something else (1)
pathConnectedSpace_iff_connectedSpace related
theorem pathConnectedSpace_iff_connectedSpace {X : Type*} [TopologicalSpace X] [LocallyPathConnectedSpace X] : PathConnectedSpace X ↔ ConnectedSpace X
Mathlib.Topology.Connected.LocallyPathConnected · lines 122–123
How it differs: It speaks about a whole locally path connected space rather than about an open subset of real n-space, so reaching the article's sentence needs the subspace to be set up first.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 8bc3615dffa3 · pair key 29c19f266c8e.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Connected sets › Path-connected sets ✓ Formalized
Formalized: Mathlib states a more general result (proved).
However, subsets of the real line R are connected if and only if they are path-connected; these subsets are the intervals of R. Also, open subsets of Rn or Cn are connected if and only if they are path-connected. Show all
IsOpen. isConnected_iff_isPathConnected more general
theorem IsOpen.isConnected_iff_isPathConnected {X : Type*} [TopologicalSpace X] [LocallyPathConnectedSpace X] {U : Set X} : IsOpen U → (IsConnected U ↔ IsPathConnected U)
Mathlib.Topology.Connected.LocallyPathConnected · lines 190–194
Why more general: The declaration covers an open subset of any locally path connected space, and complex n-space is such a space once its norm is read over the reals.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9e520f66f687 · pair key 2a714611591a.
Related, but states something else (1)
NormedSpace. complexToReal related
instance NormedSpace.complexToReal {E : Type*} [SeminormedAddCommGroup E] [NormedSpace ℂ E] : NormedSpace ℝ E
Mathlib.Analysis.Complex.Basic · lines 82–83
How it differs: This is the instance that makes a complex normed space a real one; it records no connectedness property at all.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 674d0cb63a87 · pair key 4cc6a856c29a.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Connected sets › Path-connected sets ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Additionally, connectedness and path-connectedness are the same for finite topological spaces. Show all
pathConnectedSpace_iff_connectedSpace more general
theorem pathConnectedSpace_iff_connectedSpace {X : Type*} [TopologicalSpace X] [LocallyPathConnectedSpace X] : PathConnectedSpace X ↔ ConnectedSpace X
Mathlib.Topology.Connected.LocallyPathConnected · lines 122–123
Why more general: The declaration proves the equivalence of path connectedness and connectedness for every locally path connected space, and finiteness of the underlying set delivers that hypothesis.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e7053a299628 · pair key 4aee2d380af3.
PathConnectedSpace. of_locallyPathConnectedSpace states part
theorem PathConnectedSpace.of_locallyPathConnectedSpace {X : Type*} [TopologicalSpace X] [LocallyPathConnectedSpace X] [ConnectedSpace X] : PathConnectedSpace X
Mathlib.Topology.Connected.LocallyPathConnected · lines 116–117
Why only part: The reverse direction, that path connectedness implies connectedness, is left to a separate declaration.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key eed0db034cac · pair key bfdf46e536d1.
Related, but states something else (1)
AlexandrovDiscrete. locallyPathConnectedSpace related
instance AlexandrovDiscrete.locallyPathConnectedSpace {X : Type*} [TopologicalSpace X] [AlexandrovDiscrete X] : LocallyPathConnectedSpace X
Mathlib.Topology.Connected.LocallyPathConnected · lines 389–397
How it differs: It records that an Alexandrov discrete space is locally path connected, which is the bridge a finite space uses, not the article's equivalence itself.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9aa6d6cfce10 · pair key f8373eb1b091.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Products of spaces ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
X := ∏i ∈ I X i , is the Cartesian product of the topological spaces Xi, indexed by i ∈ I , and the canonical projections pi : X → Xi, the product topology on X is defined as the coarsest topology (i.e. the topology with the fewest open sets) for which all the projections pi are continuous. Show all
Pi. topologicalSpace close match
instance Pi.topologicalSpace {ι : Type*} {Y : ι → Type v} [t₂ : (i : ι) → TopologicalSpace (Y i)] : TopologicalSpace ((i : ι) → Y i)
Mathlib.Topology.Constructions · lines 65–67
Why close, not exact: Mathlib builds the topology on a dependent product as the infimum of the topologies induced by the coordinate maps, the order-theoretic spelling of the article's description.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 95d004b10ae6 · pair key a3f009b60a8e.
Related, but states something else (1)
continuous_apply related
theorem continuous_apply {ι : Type*} {A : ι → Type*} [T : (i : ι) → TopologicalSpace (A i)] (i : ι) : Continuous fun p ↦ p i
Mathlib.Topology.Constructions · lines 775–776
How it differs: It records continuity of the projections but not the minimality that the article's definition turns on.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 769d04a8fb7f · pair key fbce8d93c4d9.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Products of spaces ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
The open sets in the product topology are unions (finite or infinite) of sets of the form ∏i ∈ I U i , where each Ui is open in Xi and Ui ≠ Xi only finitely many times. Show all
isOpen_pi_iff close match
theorem isOpen_pi_iff {ι : Type*} {A : ι → Type*} [T : (i : ι) → TopologicalSpace (A i)] {s : Set ((a : ι) → A a)} : IsOpen s ↔ ∀ f ∈ s, ∃ I u, (∀ a ∈ I, IsOpen (u a) ∧ f a ∈ u a) ∧ (↑I).pi u ⊆ s
Mathlib.Topology.Constructions · lines 1075–1100
Why close, not exact: Mathlib writes the condition pointwise: a subset is open when every one of its points sits in a product of factor-open sets, constrained on a finite index set only, that lies inside the subset.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key cc80ed334f84 · pair key 6180eb342fd7.
Related, but states something else (1)
isTopologicalBasis_pi related
theorem isTopologicalBasis_pi {ι : Type*} {X : ι → Type*} [(i : ι) → TopologicalSpace (X i)] {T : (i : ι) → Set (Set (X i))} : (∀ (i : ι), TopologicalSpace.IsTopologicalBasis (T i)) → TopologicalSpace.IsTopologicalBasis {S | ∃ U F, (∀ i ∈ F, U i ∈ T i) ∧ S = (↑F).pi U}
Mathlib.Topology.Bases · lines 637–641
How it differs: It builds a basis of the product out of given bases of the factors, so it becomes the article's description only after the factors' bases are taken to be their full families of open sets.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 82efb450161b · pair key 5a679cfb8b9c.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Products of spaces ◔ Partial
Partial: Mathlib states a special case (proved).
In particular, for a finite product (in particular, for the product of two topological spaces), the products of base elements of the Xi gives a basis for the product ∏i ∈ I X i . Show all
TopologicalSpace.IsTopologicalBasis. prod special case
theorem TopologicalSpace.IsTopologicalBasis.prod {α : Type u} {β : Type*} [t : TopologicalSpace α] [TopologicalSpace β] {B₁ : Set (Set α)} {B₂ : Set (Set β)} : TopologicalSpace.IsTopologicalBasis B₁ → TopologicalSpace.IsTopologicalBasis B₂ → TopologicalSpace.IsTopologicalBasis (Set.image2 (fun x1 x2 ↦ x1 ×ˢ x2) B₁ B₂)
Mathlib.Topology.Bases · lines 282–285
Why a special case: This is the case of two factors, which the article itself singles out inside the finite case; the general finite product is not covered by it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 29240ad366fa · pair key 5f7c169a1547.
Related, but states something else (1)
isTopologicalBasis_pi related
theorem isTopologicalBasis_pi {ι : Type*} {X : ι → Type*} [(i : ι) → TopologicalSpace (X i)] {T : (i : ι) → Set (Set (X i))} : (∀ (i : ι), TopologicalSpace.IsTopologicalBasis (T i)) → TopologicalSpace.IsTopologicalBasis {S | ∃ U F, (∀ i ∈ F, U i ∈ T i) ∧ S = (↑F).pi U}
Mathlib.Topology.Bases · lines 637–641
How it differs: Its basis consists of boxes constrained on an arbitrary finite set of indices, not of full products of base elements over all the factors, so it states a different family even when the index set is finite.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 670d9efec8bc · pair key 1b234fcd266b.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Products of spaces ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
The product topology on X is the topology generated by sets of the form pi−1(U), where i is in I and U is an open subset of Xi. Show all
pi_eq_generateFrom close match
theorem pi_eq_generateFrom {ι : Type*} {A : ι → Type*} [T : (i : ι) → TopologicalSpace (A i)] : Pi.topologicalSpace = TopologicalSpace.generateFrom {g | ∃ s i, (∀ a ∈ i, IsOpen (s a)) ∧ g = (↑i).pi s}
Mathlib.Topology.Constructions · lines 1170–1177
Why close, not exact: Mathlib displays the generating family already intersected over a finite set of indices, each piece being one coordinate preimage of an open set.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f4e165761fac · pair key e070d5a14e2f.
pi_generateFrom_eq more general
theorem pi_generateFrom_eq {ι : Type*} {A : ι → Type*} {g : (a : ι) → Set (Set (A a))} : Pi.topologicalSpace = TopologicalSpace.generateFrom {t | ∃ s i, (∀ a ∈ i, s a ∈ g a) ∧ t = (↑i).pi s}
Mathlib.Topology.Constructions · lines 1156–1168
Why more general: Each factor topology may be presented by any family of sets here; the article's situation is the family of all open sets of X_i.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f60f87062870 · pair key feae506a1abb.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Products of spaces ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
In other words, the sets {pi−1(U)} form a subbase for the topology on X. Show all
pi_eq_generateFrom close match
theorem pi_eq_generateFrom {ι : Type*} {A : ι → Type*} [T : (i : ι) → TopologicalSpace (A i)] : Pi.topologicalSpace = TopologicalSpace.generateFrom {g | ∃ s i, (∀ a ∈ i, IsOpen (s a)) ∧ g = (↑i).pi s}
Mathlib.Topology.Constructions · lines 1170–1177
Why close, not exact: Mathlib has no predicate for a subbase and records the claim as the equation for the generated topology, writing the family closed under intersection over a finite set of indices.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 415cbf70d1eb · pair key 0f10ff79a7af.
isTopologicalBasis_pi more general
theorem isTopologicalBasis_pi {ι : Type*} {X : ι → Type*} [(i : ι) → TopologicalSpace (X i)] {T : (i : ι) → Set (Set (X i))} : (∀ (i : ι), TopologicalSpace.IsTopologicalBasis (T i)) → TopologicalSpace.IsTopologicalBasis {S | ∃ U F, (∀ i ∈ F, U i ∈ T i) ∧ S = (↑F).pi U}
Mathlib.Topology.Bases · lines 637–641
Why more general: The declaration works from any base of each factor; the article's case is the base of all open sets.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b548f73f88f2 · pair key 17ad61822a90.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Products of spaces ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
In other words, the sets {pi−1(U)} form a subbase for the topology on X. A subset of X is open if and only if it is a (possibly infinite) union of intersections of finitely many sets of the form pi−1(U). Show all
isOpen_pi_iff close match
theorem isOpen_pi_iff {ι : Type*} {A : ι → Type*} [T : (i : ι) → TopologicalSpace (A i)] {s : Set ((a : ι) → A a)} : IsOpen s ↔ ∀ f ∈ s, ∃ I u, (∀ a ∈ I, IsOpen (u a) ∧ f a ∈ u a) ∧ (↑I).pi u ⊆ s
Mathlib.Topology.Constructions · lines 1075–1100
Why close, not exact: Mathlib states the criterion elementwise: each member of the subset sits in a set cut out by finitely many coordinate conditions that stays inside the subset.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e4b84f405412 · pair key c63a1b5b231c.
isTopologicalBasis_pi more general
theorem isTopologicalBasis_pi {ι : Type*} {X : ι → Type*} [(i : ι) → TopologicalSpace (X i)] {T : (i : ι) → Set (Set (X i))} : (∀ (i : ι), TopologicalSpace.IsTopologicalBasis (T i)) → TopologicalSpace.IsTopologicalBasis {S | ∃ U F, (∀ i ∈ F, U i ∈ T i) ∧ S = (↑F).pi U}
Mathlib.Topology.Bases · lines 637–641
Why more general: The declaration starts from any base of each factor; the article reads it with the base of all open sets.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 854cee8643dc · pair key cc89f77da888.
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Products of spaces ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
The pi−1(U) are sometimes called open cylinders , and their intersections are cylinder sets. Show all
MeasureTheory. cylinder more general
def MeasureTheory.cylinder {ι : Type*} {α : ι → Type*} (s : Finset ι) : Set ((i : ↥s) → α ↑i) → Set ((i : ι) → α i)
Mathlib.MeasureTheory.Constructions.Cylinders · lines 163–164
Why more general: Mathlib's construction takes any finite set of coordinates and any base set; the article names the one-coordinate instances with open base.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 8f68aa7742be · pair key 9c1e64ba0720.
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Products of spaces ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
The pi−1(U) are sometimes called open cylinders, and their intersections are cylinder sets. Show all
MeasureTheory. squareCylinders more general
def MeasureTheory.squareCylinders {ι : Type*} {α : ι → Type*} : ((i : ι) → Set (Set (α i))) → Set (Set ((i : ι) → α i))
Mathlib.MeasureTheory.Constructions.Cylinders · lines 59–60
Why more general: Mathlib defines the family of products of sides over a finite set of coordinates, the sides drawn from an arbitrary family for each coordinate.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 163d00ab316c · pair key e98bfb74959f.
PiNat. cylinder special case
def PiNat.cylinder {E : ℕ → Type*} : ((n : ℕ) → E n) → ℕ → Set ((n : ℕ) → E n)
Mathlib.Topology.MetricSpace.PiNat · lines 112–113
Why a special case: It is the article's notion for products indexed by the naturals with singleton sides over an initial segment, those sides being open when the factors are discrete as in the companion base lemma.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3035912fde18 · pair key b9cd4d125beb.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Products of spaces ◔ Partial
Partial: Mathlib states a special case (proved).
In general, the product of the topologies of each Xi forms a basis for what is called the box topology on X. Show all
pi_generateFrom_eq_finite special case
theorem pi_generateFrom_eq_finite {ι : Type*} {X : ι → Type*} {g : (a : ι) → Set (Set (X a))} [Finite ι] : (∀ (a : ι), ⋃₀ g a = Set.univ) → Pi.topologicalSpace = TopologicalSpace.generateFrom {t | ∃ s, (∀ (a : ι), s a ∈ g a) ∧ t = Set.univ.pi s}
Mathlib.Topology.Constructions · lines 1179–1195
Why a special case: The article's family of products of open sets appears here as the generating family; the universe carries no box topology for an unrestricted index set, and the declaration covers the finite index sets, where that topology is the product topology.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, low confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 0de7f14a1001 · pair key bbba06bec272.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Products of spaces ◔ Partial
Partial: Mathlib states part of this (proved).
In general, the product of the topologies of each Xi forms a basis for what is called the box topology on X. In general, the box topology is finer than the product topology, but for finite products they coincide. Show all
pi_generateFrom_eq_finite states part
theorem pi_generateFrom_eq_finite {ι : Type*} {X : ι → Type*} {g : (a : ι) → Set (Set (X a))} [Finite ι] : (∀ (a : ι), ⋃₀ g a = Set.univ) → Pi.topologicalSpace = TopologicalSpace.generateFrom {t | ∃ s, (∀ (a : ι), s a ∈ g a) ∧ t = Set.univ.pi s}
Mathlib.Topology.Constructions · lines 1179–1195
Why only part: The declaration admits any covering family of sides per coordinate, and the box topology enters as the topology generated by the products of open sets rather than under that name.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, low confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key bd0adc773e29 · pair key 4238a7b8b861.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Products of spaces ✓ Formalized
Formalized: Mathlib states this exactly (proved).
Related to compactness is Tychonoff's theorem: the (arbitrary) product of compact spaces is compact. Show all
Pi. compactSpace exact match
instance Pi.compactSpace {ι : Type*} {X : ι → Type*} [(i : ι) → TopologicalSpace (X i)] [∀ (i : ι), CompactSpace (X i)] : CompactSpace ((i : ι) → X i)
Mathlib.Topology.Compactness.Compact · lines 1175–1176
Note: The product type in Lean carries the product topology, so the compactness asserted is compactness in that topology.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 6b8c3468977b · pair key c9a6863c5139.
isCompact_univ_pi more general
theorem isCompact_univ_pi {ι : Type*} {X : ι → Type*} [(i : ι) → TopologicalSpace (X i)] {s : (i : ι) → Set (X i)} : (∀ (i : ι), IsCompact (s i)) → IsCompact (Set.univ.pi s)
Mathlib.Topology.Compactness.Compact · lines 1172–1173
Why more general: Stated for compact subsets of the factors over an arbitrary index set; the article's case is the subsets equal to the factors.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9e0a3b2c9bd0 · pair key 4c0464169844.
instCompactSpaceProd special case
instance instCompactSpaceProd {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] [CompactSpace X] [CompactSpace Y] : CompactSpace (X × Y)
Mathlib.Topology.Compactness.Compact · lines 1096–1097
Why a special case: The binary product is the article's product over a two-element index set.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 851828cd8134 · pair key 74c0bf4fe018.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Separation axioms ✓ Formalized
Formalized: Mathlib states this exactly (a definition).
X is T0, or Kolmogorov, if any two distinct points in X are topologically distinguishable. Show all
T0Space exact match
class T0Space (X : Type u) [TopologicalSpace X] : Prop
Mathlib.Topology.Separation.Basic · lines 74–76
Note: Mathlib writes the axiom through its Inseparable relation, which holds when two points have equal neighbourhood filters; distinct points for which it fails are the passage's distinguishable pairs.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 5c7158c98b40 · pair key b2b1f81b3419.
t0Space_iff_exists_isOpen_xor_mem close match
theorem t0Space_iff_exists_isOpen_xor_mem (X : Type u) [TopologicalSpace X] : T0Space X ↔ Pairwise fun x y ↦ ∃ U, IsOpen U ∧ Xor (x ∈ U) (y ∈ U)
Mathlib.Topology.Separation.Basic · lines 135–138
Why close, not exact: The theorem rewrites the library's class into the passage's defining condition: for two points that differ, some open set contains one of them and not the other.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2d263988bc78 · pair key d3a51f36e000.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Separation axioms ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
(It is a common theme among the separation axioms to have one version of an axiom that requires T0 and one version that doesn't.) X is T1, or accessible or Fréchet, if any two distinct points in X are separated. Show all
T1Space close match
class T1Space (X : Type u) [TopologicalSpace X] : Prop
Mathlib.Topology.Separation.Basic · lines 363–365
Why close, not exact: Mathlib writes the same class of spaces with closed singletons as its defining clause, the form it carries throughout the library, in place of the passage's condition on pairs of points.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 0c96627e98b2 · pair key b5c3d56a0106.
t1Space_iff_exists_open close match
theorem t1Space_iff_exists_open {X : Type*} [TopologicalSpace X] : T1Space X ↔ Pairwise fun x y ↦ ∃ U, IsOpen U ∧ x ∈ U ∧ y ∉ U
Mathlib.Topology.Separation.Basic · lines 477–479
Why close, not exact: The theorem gives the library's class by the passage's own condition, quantified over ordered pairs of points that differ.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b4e8b3b2c150 · pair key 496a72b968d0.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Separation axioms ✓ Formalized
Formalized: Mathlib states this exactly (proved).
Thus, X is T1 if and only if it is both T0 and R0. Show all
t1Space_iff_t0Space_and_r0Space exact match
theorem t1Space_iff_t0Space_and_r0Space {X : Type*} [TopologicalSpace X] : T1Space X ↔ T0Space X ∧ R0Space X
Mathlib.Topology.Separation.Basic · lines 490–491
Note: Mathlib's R0Space is symmetry of the specialization relation, the R0 axiom the passage names on the same space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 219758cabdc0 · pair key 8eb3aa7ded89.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Separation axioms ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
(Though you may say such things as T1 space, Fréchet topology, and Suppose that the topological space X is Fréchet, avoid saying Fréchet space in this context, since there is another entirely different notion of Fréchet space in functional analysis.) X is Hausdorff, or T2 or separated, if any two distinct points in X are separated by neighbourhoods. Show all
T2Space close match
class T2Space (X : Type u) [TopologicalSpace X] : Prop
Mathlib.Topology.Separation.Hausdorff · lines 84–86
Why close, not exact: Mathlib's class asks for disjoint open sets around the two points; such sets are neighbourhoods of them, and conversely disjoint neighbourhoods contain disjoint open ones.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b3209e0c3969 · pair key c3310a02f4bf.
t2Space_iff close match
theorem t2Space_iff (X : Type u) [TopologicalSpace X] : T2Space X ↔ Pairwise fun x y ↦ ∃ u v, IsOpen u ∧ IsOpen v ∧ x ∈ u ∧ y ∈ v ∧ Disjoint u v
Mathlib.Topology.Separation.Hausdorff · line 83
Why close, not exact: The theorem states the library's class by the passage's defining condition, written with two disjoint open sets around the two points.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 890b33420940 · pair key 459e629b4cea.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Separation axioms ◔ Partial
Partial: Mathlib states part of this (proved).
Thus, X is Hausdorff if and only if it is both T0 and R1. Show all
instT2SpaceOfR1SpaceOfT0Space states part
instance instT2SpaceOfR1SpaceOfT0Space {X : Type*} [TopologicalSpace X] [R1Space X] [T0Space X] : T2Space X
Mathlib.Topology.Separation.Hausdorff · lines 131–133
Why only part: The instance gives one half of the passage's equivalence; the other half, that a Hausdorff space is both R1 and T0, is carried by separate declarations.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e5f9888d4288 · pair key 96e1048b7def.
T2Space. r1Space states part
instance T2Space.r1Space {X : Type*} [TopologicalSpace X] [T2Space X] : R1Space X
Mathlib.Topology.Separation.Hausdorff · lines 120–121
Why only part: Mathlib reaches the Kolmogorov half of the same direction through T2Space.t1Space followed by T1Space.t0Space rather than in one declaration.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3374fea99a47 · pair key a7e517e9ac2f.
R1Space. t2Space_iff_t0Space states part
theorem R1Space.t2Space_iff_t0Space {X : Type*} [TopologicalSpace X] [R1Space X] : T2Space X ↔ T0Space X
Mathlib.Topology.Separation.Hausdorff · lines 135–136
Why only part: The equivalence is stated under preregularity as a hypothesis, so it carries the passage's claim only once R1 is known of the space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 5615dc8b89db · pair key 1e55e0ba8edd.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Separation axioms ✓ Formalized
Formalized: Mathlib states this exactly (proved).
A Hausdorff space must also be T1. Show all
T2Space. t1Space exact match
instance T2Space.t1Space {X : Type*} [TopologicalSpace X] [T2Space X] : T1Space X
Mathlib.Topology.Separation.Hausdorff · lines 115–117
Note: The instance derives the T1 class from the T2 class for one and the same space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ba5f90805be4 · pair key e301ceba808e.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Separation axioms ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
X is T2½, or Urysohn, if any two distinct points in X are separated by closed neighbourhoods. Show all
T25Space close match
class T25Space (X : Type u) [TopologicalSpace X] : Prop
Mathlib.Topology.Separation.Regular · lines 393–396
Why close, not exact: Mathlib writes the separation with two open sets whose closures are disjoint, where the passage names the disjoint closed neighbourhoods those closures are.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2c9fadc8114c · pair key 85dd17d68a1e.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Separation axioms ✓ Formalized
Formalized: Mathlib states this exactly (proved).
A T2½ space must also be Hausdorff. Show all
T25Space. t2Space exact match
instance T25Space.t2Space {X : Type*} [TopologicalSpace X] [T25Space X] : T2Space X
Mathlib.Topology.Separation.Regular · lines 404–406
Note: The instance derives the Hausdorff class from the Urysohn class for one and the same space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1a0f355c4e62 · pair key ed48300f2f74.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Separation axioms ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
X is regular, or T3, if it is T0 and if given any point x and closed set F in X such that x does not belong to F, they are separated by neighbourhoods. Show all
T3Space close match
class T3Space (X : Type u) [TopologicalSpace X] : Prop
Mathlib.Topology.Separation.Regular · line 441
Why close, not exact: The library writes the neighbourhood separation as disjointness of the neighbourhood filter of the closed set and the neighbourhood filter of the point, the same demand as disjoint open sets around each.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key be76263185e0 · pair key 808ee9cf04ac.
RegularSpace more general
class RegularSpace (X : Type u) [TopologicalSpace X] : Prop
Mathlib.Topology.Separation.Regular · lines 79–82
Why more general: Mathlib's regularity class drops the T0 requirement that the passage attaches to the name, so it covers more spaces than the passage's notion does.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b80e4c9897ee · pair key 6f738ba390bd.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Separation axioms ✕ Not formalized
(In fact, in a regular space, any such x and F is also separated by closed neighbourhoods.) Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 5 candidates examined (receipt a639cc10bc4c). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Related, but states something else (1)
exists_mem_nhds_isClosed_subset related
theorem exists_mem_nhds_isClosed_subset {X : Type*} [TopologicalSpace X] [RegularSpace X] {x : X} {s : Set X} : s ∈ 𝓝 x → ∃ t ∈ 𝓝 x, IsClosed t ∧ t ⊆ s
Mathlib.Topology.Separation.Regular · lines 169–172
How it differs: It shrinks any neighbourhood of a point to a closed neighbourhood of that point, and says nothing about a neighbourhood of the closed set F.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 75a0e1d4f6d0 · pair key bab32402e190.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Separation axioms ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
(In fact, in a regular space, any such x and F is also separated by closed neighbourhoods.) X is Tychonoff, or T3½, completely T3, or completely regular, if it is T0 and if f, given any point x and closed set F in X such that x does not belong to F, they are separated by a continuous function. Show all
T35Space close match
class T35Space (X : Type u) [TopologicalSpace X] : Prop
Mathlib.Topology.Separation.CompletelyRegular · line 249
Why close, not exact: The library fixes the separating map as a continuous map into the unit interval taking the value zero at the point and one on the closed set, and packages complete regularity as its own class.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 538ee5aacee0 · pair key 51cace457749.
CompletelyRegularSpace more general
class CompletelyRegularSpace (X : Type u) [TopologicalSpace X] : Prop
Mathlib.Topology.Separation.CompletelyRegular · lines 69–71
Why more general: Mathlib's class drops the T0 requirement the passage attaches to the name, so it holds for more spaces than the passage's notion.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 6df99ef5e562 · pair key 1ed8b517969f.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Separation axioms ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
X is normal, or T4, if it is Hausdorff and if any two disjoint closed subsets of X are separated by neighbourhoods. Show all
T4Space close match
class T4Space (X : Type u) [TopologicalSpace X] : Prop
Mathlib.Topology.Separation.Regular · line 614
Why close, not exact: Mathlib builds the class from normality together with T1 rather than from the Hausdorff requirement the passage writes; among normal spaces those two pick out the very same spaces, and the separation of disjoint closed sets is recorded as disjointness of their neighbourhood filters.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 0fbbf6e03e6e · pair key 467e48d6ad7b.
NormalSpace more general
class NormalSpace (X : Type u) [TopologicalSpace X] : Prop
Mathlib.Topology.Separation.Regular · lines 498–500
Why more general: Mathlib's normality class carries no point-separation requirement at all, so it applies to more spaces than the passage's notion does.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key cf98a35e52c1 · pair key 68559c52b8fd.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Separation axioms ◔ Partial
Partial: Mathlib states part of this (proved).
(In fact, a space is normal if and only if any two disjoint closed sets can be separated by a continuous function; this is Urysohn's lemma.) Show all
exists_continuous_zero_one_of_isClosed states part
theorem exists_continuous_zero_one_of_isClosed {X : Type*} [TopologicalSpace X] [NormalSpace X] {s t : Set X} : IsClosed s → IsClosed t → Disjoint s t → ∃ f, Set.EqOn (⇑f) 0 s ∧ Set.EqOn (⇑f) 1 t ∧ ∀ (x : X), f x ∈ Set.Icc 0 1
Mathlib.Topology.UrysohnsLemma · lines 322–339
Why only part: This is the direction of the passage that runs from normality to the separating function; the reverse implication, that such functions force normality, is not stated in the universe.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 5230aad0bbb8 · pair key 17918699cc10.
exists_bounded_zero_one_of_closed states part
theorem exists_bounded_zero_one_of_closed {X : Type*} [TopologicalSpace X] [NormalSpace X] {s t : Set X} : IsClosed s → IsClosed t → Disjoint s t → ∃ f, Set.EqOn (⇑f) 0 s ∧ Set.EqOn (⇑f) 1 t ∧ ∀ (x : X), f x ∈ Set.Icc 0 1
Mathlib.Topology.UrysohnsBounded · lines 37–41
Why only part: Same direction as the lemma above, with the separating map packaged as a bounded continuous function.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 05a35dda6022 · pair key b8293d5a3680.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Separation axioms ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
(In fact, a space is normal if and only if any two disjoint closed sets can be separated by a continuous function; this is Urysohn's lemma.) X is completely normal, or T5 or completely T4, if it is T1 and if any two separated sets are separated by neighbourhoods. Show all
T5Space close match
class T5Space (X : Type u) [TopologicalSpace X] : Prop
Mathlib.Topology.Separation.Regular · line 733
Why close, not exact: Mathlib spells separatedness of two sets as each being disjoint from the closure of the other, and records the separation by neighbourhoods as disjointness of the two neighbourhood filters.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9b547c995b7a · pair key 0798eebfb322.
CompletelyNormalSpace more general
class CompletelyNormalSpace (X : Type u) [TopologicalSpace X] : Prop
Mathlib.Topology.Separation.Regular · lines 652–656
Why more general: Mathlib's class drops the T1 requirement the passage attaches to the name, so it holds of more spaces.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ba8808721fb5 · pair key 446e9129f945.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Separation axioms ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
A completely normal space must also be normal. Show all
T5Space. toT4Space close match
instance T5Space.toT4Space {X : Type*} [TopologicalSpace X] [T5Space X] : T4Space X
Mathlib.Topology.Separation.Regular · line 745
Why close, not exact: Mathlib's T4 class is built from normality with T1 where the passage writes Hausdorff; among normal spaces those two requirements select the same spaces, so the implication recorded is the passage's.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b3e492ed3a0b · pair key 223bdc8f0005.
CompletelyNormalSpace. toNormalSpace more general
instance CompletelyNormalSpace.toNormalSpace {X : Type*} [TopologicalSpace X] [CompletelyNormalSpace X] : NormalSpace X
Mathlib.Topology.Separation.Regular · lines 662–665
Why more general: The library proves the implication between the bare separation classes, with no point-separation requirement on either side, so it covers more spaces than the passage's sentence.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a52b28e0c08e · pair key 0215f1da1deb.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Separation axioms ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
X is perfectly normal, or T6 or perfectly T4, if it is T1 and if any two disjoint closed sets are precisely separated by a continuous function. Show all
T6Space close match
class T6Space (X : Type u) [TopologicalSpace X] : Prop
Mathlib.Topology.Separation.GDelta · line 131
Why close, not exact: Mathlib builds the class from perfect normality with T0, where perfect normality is written as normality with every closed set a countable intersection of open sets, equivalently every closed set the zero set of a continuous map into the unit interval; T0 with perfect normality gives T1, so the class is the one the passage names.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9305ba86fb9e · pair key 30911a357dab.
PerfectlyNormalSpace more general
class PerfectlyNormalSpace (X : Type u) [TopologicalSpace X] : Prop
Mathlib.Topology.Separation.GDelta · lines 66–67
Why more general: Mathlib's class drops the T1 requirement the passage attaches to the name, so it applies to more spaces than the passage's notion.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 6fa6e92c0add · pair key 7306898950eb.
Related, but states something else (1)
perfectlyNormalSpace_iff_forall_isClosed_preimage_zero related
theorem perfectlyNormalSpace_iff_forall_isClosed_preimage_zero {X : Type*} [TopologicalSpace X] : PerfectlyNormalSpace X ↔ ∀ (s : Set X), IsClosed s → ∃ f, s = ⇑f ⁻¹' {0} ∧ ∀ (x : X), f x ∈ Set.Icc 0 1
Mathlib.Topology.Separation.PerfectlyNormal · lines 30–107
How it differs: It characterises perfect normality by each closed set being the zero set of a continuous unit-interval-valued function, a statement about one closed set rather than about a precisely separating function for a pair.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ab6c46da990f · pair key eefbe01281a1.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Separation axioms ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
A perfectly normal Hausdorff space must also be completely normal Hausdorff. Show all
T6Space. toT5Space close match
instance T6Space.toT5Space {X : Type*} [TopologicalSpace X] [T6Space X] : T5Space X
Mathlib.Topology.Separation.GDelta · line 135
Why close, not exact: Mathlib writes the hypothesis as its T6 class, normality with closed sets of type Gδ plus T0, and the conclusion as T5, separated sets having disjoint neighbourhoods plus T1; these name the same two classes of spaces the sentence does.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7bf6152ae918 · pair key 7c1daa8f0ba8.
PerfectlyNormalSpace. toCompletelyNormalSpace more general
instance PerfectlyNormalSpace.toCompletelyNormalSpace {X : Type*} [TopologicalSpace X] [PerfectlyNormalSpace X] : CompletelyNormalSpace X
Mathlib.Topology.Separation.GDelta · lines 98–105
Why more general: Mathlib's two classes here carry the separation conditions on their own, the T1 axiom being kept in the T5 and T6 classes built on top of them.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b4c5eae359bb · pair key c9c783bdd2eb.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Separation axioms ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
The Tietze extension theorem: In a normal space, every continuous real-valued function defined on a closed subspace can be extended to a continuous map defined on the whole space. Show all
Real. instTietzeExtension close match
instance Real.instTietzeExtension : TietzeExtension ℝ
Mathlib.Topology.TietzeExtension · lines 518–521
Why close, not exact: Mathlib records this theorem as the real line being an instance of its Tietze extension class, whose unfolding is the extension statement for continuous real-valued maps.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 986921c624e6 · pair key eab89e1e6020.
ContinuousMap. exists_restrict_eq more general
theorem ContinuousMap.exists_restrict_eq {X : Type u} [TopologicalSpace X] [NormalSpace X] {s : Set X} {Y : Type v} [TopologicalSpace Y] [TietzeExtension Y] : IsClosed s → ∀ (f : C(↑s, Y)), ∃ g, ContinuousMap.restrict s g = f
Mathlib.Topology.TietzeExtension · lines 69–71
Why more general: The theorem is stated for any codomain carrying Mathlib's Tietze extension property, the real line among them.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key eb4aee983862 · pair key 43048f110142.
BoundedContinuousFunction. exists_norm_eq_restrict_eq_of_closed special case
theorem BoundedContinuousFunction.exists_norm_eq_restrict_eq_of_closed {Y : Type*} [TopologicalSpace Y] [NormalSpace Y] {s : Set Y} (f : BoundedContinuousFunction ↑s ℝ) : IsClosed s → ∃ g, ‖g‖ = ‖f‖ ∧ g.domRestrict s = f
Deprecated at this commit, in favour of BoundedContinuousFunction. exists_norm_eq_domRestrict_eq_of_closed .
Mathlib.Topology.TietzeExtension · line 289
Why a special case: Mathlib restricts here to bounded continuous functions and pins the norm of the extension.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ac8eb015e2c6 · pair key 78ac39ad1614.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Countability axioms ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
Important countability axioms for topological spaces: sequential space: a set is open if every sequence convergent to a point in the set is eventually in the set Show all
SequentialSpace close match
class SequentialSpace (X : Type*) [TopologicalSpace X] : Prop
Mathlib.Topology.Defs.Sequences · lines 92–93
Why close, not exact: Mathlib states the condition on closed sets, asking that each sequentially closed set be closed, where the article states the matching condition on open sets.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key bf8a904bcbcf · pair key 158fedcded84.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Countability axioms ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
sequential space: a set is open if every sequence convergent to a point in the set is eventually in the set first-countable space: every point has a countable neighbourhood basis (local base) Show all
FirstCountableTopology close match
class FirstCountableTopology (α : Type u) [t : TopologicalSpace α] : Prop
Mathlib.Topology.Bases · lines 714–716
Why close, not exact: Mathlib asks that the neighbourhood filter at each point of the space be countably generated, which is the countable local base the sentence names.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7817f0162b44 · pair key 660e583f644a.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Countability axioms ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
first-countable space: every point has a countable neighbourhood basis (local base) second-countable space: the topology has a countable base Show all
SecondCountableTopology close match
class SecondCountableTopology (α : Type u) [t : TopologicalSpace α] : Prop
Mathlib.Topology.Bases · lines 788–790
Why close, not exact: Mathlib asks for a countable family of sets that generates the topology, where the sentence asks for a countable base of it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 87a8a939b126 · pair key 7afa97049f03.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Countability axioms ✓ Formalized
Formalized: Mathlib states this exactly (a definition).
second-countable space: the topology has a countable base separable space: there exists a countable dense subspace Show all
TopologicalSpace. SeparableSpace exact match
class TopologicalSpace.SeparableSpace (α : Type u) [t : TopologicalSpace α] : Prop
Mathlib.Topology.Bases · lines 346–348
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 71133debbe5e · pair key ad28868cb455.
TopologicalSpace. separableSpace_iff close match
theorem TopologicalSpace.separableSpace_iff (α : Type u) [t : TopologicalSpace α] : TopologicalSpace.SeparableSpace α ↔ ∃ s, s.Countable ∧ Dense s
Mathlib.Topology.Bases · line 346
Why close, not exact: The theorem spells Mathlib's separability class out as the existence of a countable dense set in the space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1058819292f6 · pair key b926e70e4d95.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Countability axioms ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
separable space: there exists a countable dense subspace Lindelöf space: every open cover has a countable subcover Show all
LindelofSpace close match
class LindelofSpace (X : Type*) [TopologicalSpace X] : Prop
Mathlib.Topology.Compactness.Lindelof · lines 485–487
Why close, not exact: Mathlib defines the class through the filter form of the Lindelöf property for the whole space, and its documentation reads that form as a countable subcover for each open cover.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 69e5e71d7a4c · pair key 695747921ade.
isLindelof_iff_countable_subcover more general
theorem isLindelof_iff_countable_subcover {X : Type u} [TopologicalSpace X] {s : Set X} : IsLindelof s ↔ ∀ {ι : Type u} (U : ι → Set X), (∀ (i : ι), IsOpen (U i)) → s ⊆ ⋃ i, U i → ∃ t, t.Countable ∧ s ⊆ ⋃ i ∈ t, U i
Mathlib.Topology.Compactness.Lindelof · lines 291–294
Why more general: The theorem is stated for an arbitrary subset, whose Lindelöf property Mathlib characterises by the same countable-subcover condition.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b0d0eb219eef · pair key 547a4ed5905f.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Countability axioms ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
Lindelöf space: every open cover has a countable subcover σ-compact space: there exists a countable cover by compact spaces Show all
SigmaCompactSpace close match
class SigmaCompactSpace (X : Type*) [TopologicalSpace X] : Prop
Mathlib.Topology.Compactness.SigmaCompact · lines 142–144
Why close, not exact: Mathlib asks for a sequence of compact sets indexed by the naturals whose union is everything, where the sentence asks for a countable cover by compact subspaces.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f55af15cd98c · pair key c104f0be5593.
SigmaCompactSpace_iff_exists_compact_covering close match
theorem SigmaCompactSpace_iff_exists_compact_covering {X : Type*} [TopologicalSpace X] : SigmaCompactSpace X ↔ ∃ K, (∀ (n : ℕ), IsCompact (K n)) ∧ ⋃ n, K n = Set.univ
Mathlib.Topology.Compactness.SigmaCompact · lines 156–158
Why close, not exact: The theorem spells the library's σ-compactness class out as a sequence of compact sets, indexed by the naturals, whose union is the whole space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 71263bf3dd11 · pair key 20622f4c1d82.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Countability axioms ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Relations: Every first countable space is sequential. Show all
FrechetUrysohnSpace. to_sequentialSpace more general
instance FrechetUrysohnSpace.to_sequentialSpace {X : Type*} [TopologicalSpace X] [FrechetUrysohnSpace X] : SequentialSpace X
Mathlib.Topology.Sequences · lines 154–156
Why more general: Lean's instance resolution reaches sequentiality from first countability through FirstCountableTopology.frechetUrysohnSpace and then this instance.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ae6d9376c882 · pair key 772a8ca6fa8e.
Related, but states something else (1)
FirstCountableTopology. frechetUrysohnSpace related
instance FirstCountableTopology.frechetUrysohnSpace {X : Type*} [TopologicalSpace X] [FirstCountableTopology X] : FrechetUrysohnSpace X
Mathlib.Topology.Sequences · lines 148–150
How it differs: Mathlib routes the passage through the Frechet-Urysohn property, which is what this instance concludes.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key dd1d3d87c948 · pair key d19024f39655.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Countability axioms ✓ Formalized
Formalized by 3 parts together (more general):
TopologicalSpace.SecondCountableTopology. to_firstCountableTopology Mathlib (proved) a second-countable space is first-countable TopologicalSpace.SecondCountableTopology. to_separableSpace Mathlib (proved) a second-countable space is separable SecondCountableTopology. toHereditarilyLindelof Mathlib (proved) a second-countable space is Lindelof
Every second-countable space is first-countable, separable, and Lindelöf. Show all
TopologicalSpace.SecondCountableTopology. to_firstCountableTopology states part
instance TopologicalSpace.SecondCountableTopology.to_firstCountableTopology (α : Type u) [t : TopologicalSpace α] [SecondCountableTopology α] : FirstCountableTopology α
Mathlib.Topology.Bases · lines 854–859
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key baaa9facfa1b · pair key 9518aa93c876.
TopologicalSpace.SecondCountableTopology. to_separableSpace states part
instance TopologicalSpace.SecondCountableTopology.to_separableSpace {α : Type u} [t : TopologicalSpace α] [SecondCountableTopology α] : TopologicalSpace.SeparableSpace α
Mathlib.Topology.Bases · lines 911–915
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key dbf8f4e78940 · pair key 46dc081cde99.
SecondCountableTopology. toHereditarilyLindelof states part
instance SecondCountableTopology.toHereditarilyLindelof {X : Type u} [TopologicalSpace X] [SecondCountableTopology X] : HereditarilyLindelofSpace X
Mathlib.Topology.Compactness.Lindelof · lines 729–737
Why only part: Mathlib concludes the hereditary form of the Lindelof property, which covers the whole space as one of its subsets.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 51c97bd28f9e · pair key 72c408d976d7.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Countability axioms ✓ Formalized
Formalized: Mathlib states this exactly (proved).
Every σ-compact space is Lindelöf. Show all
instLindelofSpaceOfSigmaCompactSpace exact match
instance instLindelofSpaceOfSigmaCompactSpace {X : Type u} [TopologicalSpace X] [SigmaCompactSpace X] : LindelofSpace X
Mathlib.Topology.Compactness.Lindelof · lines 535–536
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c75f6cecf2e5 · pair key ad67c23ffc61.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Countability axioms ✓ Formalized
Formalized: Mathlib states a more general result (proved).
A metric space is first-countable. Show all
TopologicalSpace.PseudoMetrizableSpace. firstCountableTopology more general
instance TopologicalSpace.PseudoMetrizableSpace.firstCountableTopology {X : Type*} [TopologicalSpace X] [h : TopologicalSpace.PseudoMetrizableSpace X] : FirstCountableTopology X
Mathlib.Topology.Metrizable.Basic · lines 91–96
Why more general: The declaration covers every space carrying a compatible pseudometric, so it holds in particular of the passage's metric spaces.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e6f97e8be3e7 · pair key 64dc0a6593be.
UniformSpace. firstCountableTopology more general
instance UniformSpace.firstCountableTopology (α : Type u) [uniformSpace : UniformSpace α] [(uniformity α).IsCountablyGenerated] : FirstCountableTopology α
Mathlib.Topology.UniformSpace.Cauchy · lines 916–917
Why more general: The declaration is phrased for uniform spaces whose uniformity has a countable generating family, a class containing the passage's metric spaces.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key eb8a13f7ea25 · pair key 1912e8adcb44.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Countability axioms ◔ Partial
Partial: Mathlib states part of this (proved).
For metric spaces second-countability, separability, and the Lindelöf property are all equivalent. Show all
UniformSpace. secondCountable_of_separable states part
instance UniformSpace.secondCountable_of_separable (α : Type u) [uniformSpace : UniformSpace α] [(uniformity α).IsCountablyGenerated] [TopologicalSpace.SeparableSpace α] : SecondCountableTopology α
Mathlib.Topology.UniformSpace.Cauchy · lines 922–943
Why only part: It gives one direction of the equivalence between the two properties, from separability to a countable base.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b16ef0f877e8 · pair key e46e5887fcda.
TopologicalSpace.SecondCountableTopology. to_separableSpace states part
instance TopologicalSpace.SecondCountableTopology.to_separableSpace {α : Type u} [t : TopologicalSpace α] [SecondCountableTopology α] : TopologicalSpace.SeparableSpace α
Mathlib.Topology.Bases · lines 911–915
Why only part: It gives the converse direction of the same equivalence, from a countable base to separability.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 12d1c84e5f6c · pair key 9f63a564b8fe.
TopologicalSpace. instSecondCountableTopologyOfLindelofSpaceOfPseudoMetrizableSpace states part
instance TopologicalSpace.instSecondCountableTopologyOfLindelofSpaceOfPseudoMetrizableSpace (X : Type*) [TopologicalSpace X] [LindelofSpace X] [TopologicalSpace.PseudoMetrizableSpace X] : SecondCountableTopology X
Mathlib.Topology.Metrizable.Basic · lines 166–180
Why only part: It gives one direction of the equivalence between the Lindelof property and a countable base, for metrizable spaces.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 119e03496e7f · pair key ea9a87477690.
SecondCountableTopology. toHereditarilyLindelof states part
instance SecondCountableTopology.toHereditarilyLindelof {X : Type u} [TopologicalSpace X] [SecondCountableTopology X] : HereditarilyLindelofSpace X
Mathlib.Topology.Compactness.Lindelof · lines 729–737
Why only part: It gives the converse direction, from a countable base to the Lindelof property.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f52a9655b1c5 · pair key 68e596c06936.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Metric spaces ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
A metric space[7] is an ordered pair (M , d ) where M is a set and d is a metric on M , i.e., a function d : M × M → ℝ such that for any x , y , z ∈ M , the following holds: Show all
MetricSpace close match
class MetricSpace : Type u → Type u
Mathlib.Topology.MetricSpace.Defs · lines 70–71
Why close, not exact: Mathlib puts the real-valued distance on the carrier type itself, in curried form, and carries the uniformity and topology it induces as further fields.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 18f4902d46e3 · pair key f85bfb9a2fd6.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Metric spaces ✓ Formalized
Formalized by 4 parts together (more general):
dist_eq_zero Mathlib (proved) the distance between two points vanishes exactly when the points are equal dist_nonneg Mathlib (proved) the distance between any two points is non-negative dist_comm Mathlib (proved) the distance is symmetric in its two arguments dist_triangle Mathlib (proved) the distance satisfies the triangle inequality
such that for any x , y , z ∈ M , the following holds: d (x , y ) ≥ 0 (non-negative), d (x , y ) = 0 iff x = y (identity of indiscernibles), d (x , y ) = d (y , x ) (symmetry) and d (x , z ) ≤ d (x , y ) + d (y , z ) (triangle inequality) .Show all
dist_eq_zero states part
theorem dist_eq_zero {γ : Type w} [MetricSpace γ] {x y : γ} : Dist.dist x y = 0 ↔ x = y
Mathlib.Topology.MetricSpace.Defs · lines 97–98
Why only part: Mathlib states this condition as an iff at the level of its metric class.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7a6da1dd3108 · pair key a841050761ff.
dist_nonneg states part
theorem dist_nonneg {α : Type u} [PseudoMetricSpace α] {x y : α} : 0 ≤ Dist.dist x y
Mathlib.Topology.MetricSpace.Pseudo.Defs · lines 251–252
Why only part: Mathlib proves it for pseudometric spaces, a class that contains the passage's metric spaces.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 78371551baea · pair key 0c4c175b572c.
dist_comm states part
theorem dist_comm {α : Type u} [PseudoMetricSpace α] (x y : α) : Dist.dist x y = Dist.dist y x
Mathlib.Topology.MetricSpace.Pseudo.Defs · lines 205–206
Why only part: Mathlib proves it for pseudometric spaces, a class that contains the passage's metric spaces.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key dbf41f1470bd · pair key 3472c40968d5.
dist_triangle states part
theorem dist_triangle {α : Type u} [PseudoMetricSpace α] (x y z : α) : Dist.dist x z ≤ Dist.dist x y + Dist.dist y z
Mathlib.Topology.MetricSpace.Pseudo.Defs · lines 212–213
Why only part: Mathlib proves it for pseudometric spaces, a class that contains the passage's metric spaces.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3567ffcace73 · pair key feefb863519a.
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Metric spaces ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
The function d is also called distance function or simply distance. Show all
Dist more general
class Dist : Type u_3 → Type u_3
Mathlib.Topology.MetricSpace.Pseudo.Defs · lines 102–104
Why more general: Mathlib names the distance through a class that imposes no conditions, so it covers types well beyond the passage's metric spaces.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 0be33cf8fd65 · pair key 32c140fed653.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Metric spaces ✓ Formalized
Formalized by 3 parts together (more general):
Metric. instParacompactSpace Mathlib (proved) a metric space is paracompact TopologicalSpace. t2Space_of_metrizableSpace Mathlib (proved) a metric space is Hausdorff instNormalSpaceOfPseudoMetrizableSpace Mathlib (proved)
Every metric space is paracompact and Hausdorff, and thus normal. Show all
Metric. instParacompactSpace states part
instance Metric.instParacompactSpace {α : Type*} [PseudoEMetricSpace α] : ParacompactSpace α
Mathlib.Topology.EMetricSpace.Paracompact · lines 43–165
Why only part: Mathlib proves paracompactness for pseudo-extended-metric spaces, a class that contains every metric space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1799255ca008 · pair key c88a5f51bf15.
TopologicalSpace. t2Space_of_metrizableSpace states part
instance TopologicalSpace.t2Space_of_metrizableSpace {X : Type*} [TopologicalSpace X] [TopologicalSpace.MetrizableSpace X] : T2Space X
Mathlib.Topology.Metrizable.Basic · lines 135–137
Why only part: Mathlib derives the Hausdorff separation property from metrizability, a property every metric space has.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b5d4e124e16a · pair key 94ae955c9879.
instNormalSpaceOfPseudoMetrizableSpace states part
instance instNormalSpaceOfPseudoMetrizableSpace {X : Type*} [TopologicalSpace X] [TopologicalSpace.PseudoMetrizableSpace X] : NormalSpace X
Mathlib.Topology.GDelta.MetrizableSpace · lines 28–31
Why only part: Mathlib states normality for every space whose topology comes from a pseudometric, which covers metric spaces.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e6534f6c1cd0 · pair key efa9704224de.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Baire category theorem ◔ Partial
Partial: Mathlib states a special case (proved).
The Baire category theorem says: If X is a complete metric space or a locally compact Hausdorff space, then the interior of every union of countably many nowhere dense sets is empty. Show all
BaireSpace. of_completelyPseudoMetrizable special case
instance BaireSpace.of_completelyPseudoMetrizable {X : Type*} [TopologicalSpace X] [TopologicalSpace.IsCompletelyPseudoMetrizableSpace X] : BaireSpace X
Mathlib.Topology.Baire.CompleteMetrizable · lines 27–118
Why a special case: Mathlib writes the Baire property in its dense-intersection form, which baireSpace_iff_interior_iUnion_eq_empty shows to be the same condition the passage phrases with nowhere dense sets; this record reaches only the complete-metric branch of the hypothesis.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d7faee6c5abb · pair key 2d7d8afecfc8.
BaireSpace. of_t2Space_locallyCompactSpace special case
instance BaireSpace.of_t2Space_locallyCompactSpace {X : Type*} [TopologicalSpace X] [R1Space X] [LocallyCompactSpace X] : BaireSpace X
Mathlib.Topology.Baire.LocallyCompactRegular · lines 24–60
Why a special case: The record reaches the locally compact branch of the passage and asks only for preregularity where the passage says Hausdorff; the Baire property is again in Mathlib's dense-intersection form.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ed6775a23bee · pair key 1f2dc06afd45.
Related, but states something else (1)
baireSpace_iff_interior_iUnion_eq_empty related
theorem baireSpace_iff_interior_iUnion_eq_empty {X : Type*} [TopologicalSpace X] : BaireSpace X ↔ ∀ (f : ℕ → Set X), (∀ (n : ℕ), IsClosed (f n)) → (∀ (n : ℕ), IsNowhereDense (f n)) → interior (⋃ n, f n) = ∅
Mathlib.Topology.Baire.Lemmas · lines 49–58
How it differs: It identifies the Baire property with the emptiness of the interior of a union of closed nowhere dense sets indexed by the naturals, the form the passage uses, but it assumes neither of the passage's two hypotheses.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c6c124b937a8 · pair key d5e2ef8bed37.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Baire category theorem ✓ Formalized
Formalized: Mathlib states this exactly (proved).
Any open subspace of a Baire space is itself a Baire space. Show all
IsOpen. baireSpace exact match
theorem IsOpen.baireSpace {X : Type*} [TopologicalSpace X] [BaireSpace X] {s : Set X} : IsOpen s → BaireSpace ↑s
Mathlib.Topology.Baire.Lemmas · lines 127–128
Note: The subspace is the coercion of the open set carrying the topology induced from the ambient space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 152025476d13 · pair key 25f943dc5cc9.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Main areas of research › Continuum theory ✕ Not formalized
A continuum (pl continua) is a nonempty compact connected metric space, or less frequently, a compact connected Hausdorff space. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 36596d41520a). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Main areas of research › Topological algebras ✕ Not formalized
A topological algebra A over a topological field K is a topological vector space together with a continuous multiplication ⋅ : A × A ⟶ A (a , b ) ⟼ a ⋅ b that makes it an algebra over K. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 2 candidates examined (receipt 46878be374cb). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Main areas of research › Topological algebras ✓ Formalized
Formalized: Mathlib states a more general result (proved).
that makes it an algebra over K. A unital associative topological algebra is a topological ring. Show all
IsTopologicalSemiring. toIsTopologicalRing more general
theorem IsTopologicalSemiring.toIsTopologicalRing {R : Type*} [TopologicalSpace R] [NonAssocRing R] : IsTopologicalSemiring R → IsTopologicalRing R
Mathlib.Topology.Algebra.Ring.Basic · lines 103–105
Why more general: Mathlib proves this for any unital ring whose addition and multiplication are continuous, with no scalar field involved, and obtains continuity of negation from multiplication by minus one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2e4ddcd7cd57 · pair key a8c76a4f7bd6.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Main areas of research › Metrizability theory ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
In topology and related areas of mathematics, a metrizable space is a topological space that is homeomorphic to a metric space. Show all
TopologicalSpace. MetrizableSpace close match
class TopologicalSpace.MetrizableSpace (X : Type*) [t : TopologicalSpace X] : Prop
Mathlib.Topology.Metrizable.Basic · lines 125–126
Why close, not exact: Mathlib asks for a metric on the space itself inducing its topology, written by way of a uniformity with a generating sequence of entourages, where the passage asks instead for a homeomorphism onto a metric space.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e9ac33f604da · pair key e34220683ff8.
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Main areas of research › Metrizability theory ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
That is, a topological space (X , τ ) is said to be metrizable if there is a metric d : X × X → [0, ∞) Show all
TopologicalSpace. MetrizableSpace close match
class TopologicalSpace.MetrizableSpace (X : Type*) [t : TopologicalSpace X] : Prop
Mathlib.Topology.Metrizable.Basic · lines 125–126
Why close, not exact: Mathlib phrases the condition as the existence of a countably generated uniformity inducing the topology, an equivalent encoding of carrying a compatible distance, and hands back the distance itself through TopologicalSpace.metrizableSpaceMetric.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 542cf7908814 · pair key b4f1887d32ed.
Related, but states something else (1)
TopologicalSpace. metrizableSpaceMetric related
abbrev TopologicalSpace.metrizableSpaceMetric (X : Type*) [TopologicalSpace X] [TopologicalSpace.MetrizableSpace X] : MetricSpace X
Mathlib.Topology.Metrizable.Uniformity · lines 274–277
How it differs: It constructs a distance compatible with the topology on a space already assumed metrizable, so it presupposes the notion the passage defines instead of defining it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 000d64ab5b6f · pair key cdf4c226d6df.
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Main areas of research › Set-theoretic topology ✕ Not formalized
The answer to the normal Moore space question was eventually proved to be independent of ZFC. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 3 candidates examined (receipt 4011c557eeea). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Open in card list · Copy link · Read on Wikipedia ↗