Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Einstein–de Sitter universe: the expansion age is t=2/(3H)t=2/(3H)t=2/(3H)

Proved
CosmoConstCentury.einstein_de_sitter_age

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

cosmologygeneral-relativitymathematical-physics

Let GGG and ccc be real constants and let (R,ρ)(R,\rho)(R,ρ) solve the Friedmann–Lemaître dust equations with Λ=0\Lambda=0Λ=0 and flat space (k=0k=0k=0) for all times t>0t>0t>0 — the Einstein–de Sitter model, whose first equation is the review's (18), (R′/R)2=κρc2/3(R'/R)^2=\kappa\rho c^2/3(R′/R)2=κρc2/3. Assume that the universe is expanding, R′(t)>0R'(t)>0R′(t)>0 for all t>0t>0t>0, and that it starts from a big bang at t=0t=0t=0, i.e. R(t)→0R(t)\to0R(t)→0 as t→0+t\to0^+t→0+. Then for every t>0t>0t>0,

t=23H(t),H=R′/R.t=\frac{2}{3H(t)},\qquad H=R'/R .t=3H(t)2​,H=R′/R.

This is the timespan of expansion of the Einstein–de Sitter model quoted in footnote 24 of the review, t=2/(3H0)t=2/(3H_0)t=2/(3H0​).

Formalization Note The predicate IsFriedmannSolution G c Λ k I R ρ requires, at every t∈It\in It∈I, that R(t)>0R(t)>0R(t)>0, that RRR is C2C^2C2 in a neighbourhood of ttt, and that the two equations hold with κ=8πG/c2\kappa=8\pi G/c^2κ=8πG/c2.

Preamble
import Mathlib
import Definitions.Def_CosmoConstCentury_Defs

open Filter Topology
Formal statement
namespace CosmoConstCentury

theorem einstein_de_sitter_age (G c : ℝ) (R ρ : ℝ → ℝ)
    (hsol : IsFriedmannSolution G c 0 0 (Set.Ioi 0) R ρ)
    (hexp : ∀ t > 0, 0 < deriv R t) (hbang : Tendsto R (𝓝[>] 0) (𝓝 0)) :
    ∀ t > 0, t = 2 / (3 * hubbleParam R t) := by sorry

end CosmoConstCentury
Source
C. O'Raifeartaigh, M. O'Keeffe, W. Nahm, S. Mitton, "One hundred years of the cosmological constant: from 'superfluous stunt' to dark energy", Eur. Phys. J. H 43, 73-117 (2018), https://doi.org/10.1140/epjh/e2017-80061-7; Section 5.1, p. 85, eq. (18) (Einstein and de Sitter 1932) and footnote 24 (t = 2/(3H0), Einstein 1933).
Read-back

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

Disclosure: non-blind read-back. This read-back was written by the same agent that drafted the Lean statement (Aristotle, by Harmonic), at the explicit request of the proposal owner. It is not an independent or blind audit, and it must not be treated as independent testimony: its author knew the source paper and the intended meaning while writing it. Reviewers should compare it against the Lean code themselves.

Let G,cG,cG,c be arbitrary real numbers and R,ρ:R→RR,\rho:\mathbb R\to\mathbb RR,ρ:R→R. Assume:

  1. (R,ρ)(R,\rho)(R,ρ) is a Friedmann solution with Λ=0\Lambda=0Λ=0 and k=0k=0k=0 on the open half-line (0,∞)(0,\infty)(0,∞): for every t>0t>0t>0, R(t)>0R(t)>0R(t)>0, RRR is C2C^2C2 near ttt, 3R′(t)2R(t)2=κc2ρ(t)\dfrac{3R'(t)^2}{R(t)^2}=\kappa c^2\rho(t)R(t)23R′(t)2​=κc2ρ(t) and R′(t)2R(t)2+2R′′(t)R(t)=0\dfrac{R'(t)^2}{R(t)^2}+\dfrac{2R''(t)}{R(t)}=0R(t)2R′(t)2​+R(t)2R′′(t)​=0 (with κ=8πG/c2\kappa=8\pi G/c^2κ=8πG/c2);
  2. R′(t)>0R'(t)>0R′(t)>0 for every t>0t>0t>0;
  3. R(t)→0R(t)\to0R(t)→0 as t→0t\to0t→0 from the right.

Conclusion: for every t>0t>0t>0, t=23H(t)t=\dfrac{2}{3H(t)}t=3H(t)2​ where H(t)=R′(t)/R(t)H(t)=R'(t)/R(t)H(t)=R′(t)/R(t).

No positivity of GGG or ccc is assumed. Nothing is assumed about RRR at t≤0t\le0t≤0 other than the right limit at 000.

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

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 8, 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