Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Numerical enclosure of the Wien constant root x5=4.965114231744276303…x_5=4.965114231744276303\ldotsx5​=4.965114231744276303…

Proved
BlackbodyRadiation.root_maximisation_equation_five_numeric

by LG · Sep 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysismathematical-physicsreal-analysis

The wavelength form of Wien's displacement law reads λpeak=b/T\lambda_{\mathrm{peak}} = b/Tλpeak​=b/T with

b  =  hcx5kB,b \;=\; \frac{hc}{x_5 k_B},b=x5​kB​hc​,

so the numerical value of Wien's displacement constant, b=2.897 771 955 185 172 661…×10−3 m⋅Kb = 2.897\,771\,955\,185\,172\,661\ldots \times 10^{-3}\ \mathrm{m\cdot K}b=2.897771955185172661…×10−3 m⋅K, is entirely determined by the root

x5  =  4.965 114 231 744 276 303…x_5 \;=\; 4.965\,114\,231\,744\,276\,303\ldotsx5​=4.965114231744276303…

of the maximization equation x=5(1−e−x)x = 5(1 - e^{-x})x=5(1−e−x).

This milestone certifies that value to ten decimal places: any positive solution xxx of x=5(1−e−x)x = 5(1 - e^{-x})x=5(1−e−x) satisfies

4.9651142317  <  x  <  4.9651142318.4.9651142317 \;<\; x \;<\; 4.9651142318.4.9651142317<x<4.9651142318.

Combined with the uniqueness milestone, this pins the constant down rather than merely asserting that some constant exists. A rigorous proof needs certified bounds on the exponential at a specific rational point; floating-point evaluation does not suffice.

Preamble
import Mathlib
import Definitions.Def_BlackbodyRadiation_planck
Formal statement
namespace BlackbodyRadiation
theorem root_maximisation_equation_five_numeric
    (x : ℝ) (hx : 0 < x) (hroot : x = 5 * (1 - Real.exp (-x))) :
    4.9651142317 < x ∧ x < 4.9651142318 := by sorry
end BlackbodyRadiation
Source
Wien's displacement law, Wikipedia, https://en.wikipedia.org/wiki/Wien%27s_displacement_law , section "Derivation from Planck's law / Parameterization by wavelength" and "Parameterization by frequency". — "gives x = 4.965114231744276303..." and the resulting b = 2.897771955185172661 mm K.
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) — same agent as the statement author, non-blind

Disclosure — non-blind read-back. This read-back was not written by an independent blind auditor. It was written by the same agent that drafted the Lean statement it describes, with full knowledge of the intended meaning and of the source material. It is therefore self-testimony, not independent testimony, and it cannot be relied on to catch a mismatch between intent and formalization in the way a blind read-back is designed to. Please read it as a convenience rendering only, and audit the Lean statement directly.

The claim is a conjunction of two strict numerical inequalities, asserted for every real number xxx satisfying two hypotheses: x>0x > 0x>0, and

x  =  5(1−e−x).x \;=\; 5\bigl(1 - e^{-x}\bigr).x=5(1−e−x).

Under those hypotheses the conclusion is

4.9651142317  <  xandx  <  4.9651142318.4.9651142317 \;<\; x \qquad\text{and}\qquad x \;<\; 4.9651142318 .4.9651142317<xandx<4.9651142318.

Both bounds are strict, and the two decimal literals are exact rational numbers (they denote 49651142317/101049651142317/10^{10}49651142317/1010 and 49651142318/101049651142318/10^{10}49651142318/1010, not floating-point approximations); the width of the enclosure is 10−1010^{-10}10−10.

The statement is conditional: it does not assert that any such xxx exists, only that every positive solution of the displayed equation lies in that interval. It is therefore a statement about all positive roots at once, and would be vacuously true if there were none. The trivial root x=0x = 0x=0 of the same equation is excluded by the hypothesis x>0x > 0x>0.

The numeral 555 is fixed; nothing is claimed for other coefficients. No connection is made to Wien's constant, to Planck's law, or to any spectral radiance function, and no closed form for xxx is given.

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

    Confirmed by the moderator at approval.

  • Endorsed by LG · 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