Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The maximization equation x=n(1−e−x)x=n(1-e^{-x})x=n(1−e−x) has a unique positive root

Proved
BlackbodyRadiation.existsUnique_pos_root_maximisation_equation

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

analysismathematical-physicsreal-analysis

Setting the derivative of the Planck spectrum to zero produces, after clearing denominators, the transcendental maximization equation

x  =  n (1−e−x),x \;=\; n\,\bigl(1 - e^{-x}\bigr),x=n(1−e−x),

with n=5n = 5n=5 in the wavelength parameterization and n=3n = 3n=3 in the frequency one. The equation has the trivial solution x=0x = 0x=0, which is not the peak; the physically relevant solution is the positive one, and the derivation is only valid if that positive solution is unique.

This milestone establishes exactly that, for every real n>1n > 1n>1: there is one and only one x>0x > 0x>0 with x=n(1−e−x)x = n(1 - e^{-x})x=n(1−e−x). The source solves the equation in closed form using the principal branch of the Lambert WWW function, giving x5=4.965114231…x_5 = 4.965114231\ldotsx5​=4.965114231… and x3=2.821439372…x_3 = 2.821439372\ldotsx3​=2.821439372…; existence and uniqueness here are stated without reference to WWW, so that they can be proved directly and used for both indices at once.

The restriction n>1n > 1n>1 is necessary rather than cosmetic: at n=1n = 1n=1 the only solution is x=0x = 0x=0, and for n≤1n \le 1n≤1 there is no positive root.

Preamble
import Mathlib
import Definitions.Def_BlackbodyRadiation_planck
Formal statement
namespace BlackbodyRadiation
theorem existsUnique_pos_root_maximisation_equation
    (n : ℝ) (hn : 1 < n) :
    ∃! x : ℝ, 0 < x ∧ x = n * (1 - Real.exp (-x)) := 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". — the maximization equations (5 - x = 5 e^{-x}, equivalently x = 5(1 - e^{-x})) for the wavelength case and (3 - x = 3 e^{-x}) for the frequency case, whose positive roots are 4.965114231744276303... and 2.821439372122078893... .
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 unique-existence statement about real numbers, asserted for every real number nnn satisfying the single hypothesis n>1n > 1n>1. Note that nnn ranges over the reals, not over integers, so non-integer values such as n=1.5n = 1.5n=1.5 are covered.

For such an nnn, the assertion is that there exists exactly one real number xxx with the conjunction of the two conditions

x>0andx=n(1−e−x).x > 0 \qquad\text{and}\qquad x = n\bigl(1 - e^{-x}\bigr).x>0andx=n(1−e−x).

"Exactly one" is the full uniqueness statement: some xxx satisfies both conditions, and any x′x'x′ satisfying both conditions equals it. The uniqueness is uniqueness among positive solutions only — the equation x=n(1−e−x)x = n(1-e^{-x})x=n(1−e−x) also holds at x=0x = 0x=0 for every nnn, and that solution is excluded by the positivity conjunct rather than contradicted.

The equation is written with the exponential of −x-x−x, so it reads: xxx equals nnn times the quantity 1−e−x1 - e^{-x}1−e−x. It is not the equation x=n(1−ex)x = n(1 - e^{x})x=n(1−ex), nor xex=nx e^{x} = nxex=n, and no Lambert function or closed form appears. Since 1−e−x<11 - e^{-x} < 11−e−x<1 for all xxx, any solution automatically satisfies x<nx < nx<n.

No numerical value or bound for the root is claimed, for n=5n = 5n=5, for n=3n = 3n=3, or for any other nnn; no continuity, monotonicity, or differentiability statement is made; and nothing connects this equation to any spectral radiance function. The hypothesis n>1n > 1n>1 is satisfiable (e.g. n=5n = 5n=5), so the statement is not vacuous.

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