Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Open sets of reals are countable unions of open intervals

Proved
AssumptionsOfPhysics.isOpen_real_eq_iUnion_intervals

by Lucas · Oct 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

foundations-of-physicsmathematical-physicstopology

Every set UUU in the standard topology on R\mathbb RR is a countable union U=⋃i=1∞(ai,bi)U=\bigcup_{i=1}^\infty(a_i,b_i)U=⋃i=1∞​(ai​,bi​) of open intervals with ai,bi∈R∪{−∞,+∞}a_i,b_i\in\mathbb R\cup\{-\infty,+\infty\}ai​,bi​∈R∪{−∞,+∞}.

Preamble
import Mathlib
import Definitions.Def_AoP_ExperimentalDomains
import Definitions.Def_AoP_PropertiesQuantities
Formal statement
namespace AssumptionsOfPhysics
theorem isOpen_real_eq_iUnion_intervals (U : Set ℝ)
    (hU : @IsOpen ℝ (TopologicalSpace.generateFrom
      {S : Set ℝ | ∃ a b : ℚ, S = Set.Ioo (a : ℝ) (b : ℝ)}) U) :
    ∃ a b : ℕ → EReal, U = ⋃ i, {x : ℝ | a i < (x : EReal) ∧ (x : EReal) < b i} := by sorry
end AssumptionsOfPhysics
Source
G. Carcassi, C. A. Aidala, Assumptions of Physics, Ver. 3.0 (Dec 31, 2025), https://assumptionsofphysics.org/book — Part II, Chapter 3 (pp. 169–195), Proposition 3.56, p. 192
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic)

Non-blind read-back — not independent testimony. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statements, with full knowledge of the source text and of the intended meaning. It was not produced by a blind, independent auditor, so it must not be mistaken for independent testimony; reviewers should compare the Lean code against the source themselves.

Order notions. For a (pre)ordered set QQQ: QQQ is sparse if every closed interval [a,b]={q:a≤q≤b}[a,b]=\{q: a\le q\le b\}[a,b]={q:a≤q≤b} is finite; QQQ is dense (book sense) if [a,b][a,b][a,b] is infinite whenever a<ba<ba<b; A⊆QA\subseteq QA⊆Q is a dense subset if for all q1<q2q_1<q_2q1​<q2​ there is q∈Aq\in Aq∈A with q1≤q≤q2q_1\le q\le q_2q1​≤q≤q2​; QQQ is complete if every nonempty subset that is bounded above has a least upper bound in QQQ. A linear order ⪯\preceq⪯ on XXX is a natural order if the order topology of ⪯\preceq⪯ (generated by all rays {x:a≺x}\{x: a\prec x\}{x:a≺x} and {x:x≺b}\{x: x\prec b\}{x:x≺b}) equals the natural topology T\mathcal TT. DDD is fully characterized by a topological space QQQ if there is a homeomorphism (X,T)→Q(X,\mathcal T)\to Q(X,T)→Q. "Decidable" means Ω∖s∈D\Omega\setminus s\in\mathcal DΩ∖s∈D for all s∈Ds\in\mathcal Ds∈D.

Statement. For every U⊆RU\subseteq\mathbb RU⊆R that is open in the topology generated by the open intervals with rational endpoints, there are sequences (ai)i∈N,(bi)i∈N(a_i)_{i\in\mathbb N},(b_i)_{i\in\mathbb N}(ai​)i∈N​,(bi​)i∈N​ of extended reals ([−∞,+∞][-\infty,+\infty][−∞,+∞]) with U=⋃i∈N{x∈R:ai<x<bi}U=\bigcup_{i\in\mathbb N}\{x\in\mathbb R: a_i<x<b_i\}U=⋃i∈N​{x∈R:ai​<x<bi​}. (Disjointness of the intervals is not asserted; an empty interval is allowed.)

Human review
  • Endorsed by Shuze Chen · Oct 3, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 3, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me