Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pseudo-masses reduce to physical masses at U=IdU = \mathrm{Id}U=Id (eqs. 3.31-3.32)

Proved
KoideRelation.pseudoMass_one_eq_mass

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

algebramathematical-physics

The source's proposed extension of the relation to the neutrino and quark sectors replaces the physical masses by the pseudo-masses m~i=∣∑j(UL)ijmj∣\tilde m_i = \left|\sum_j (U_L)_{ij} m_j\right|m~i​=​∑j​(UL​)ij​mj​​ built from the flavour mixing matrix, and asks for ∑im~i=23(∑im~i)2\sum_i \tilde m_i = \tfrac23\left(\sum_i \sqrt{\tilde m_i}\right)^2∑i​m~i​=32​(∑i​m~i​​)2 (eqs. (3.31)–(3.32)). This milestone records the consistency requirement that makes (3.31) an extension rather than a different relation: for nonnegative masses and trivial mixing UL=IdU_L = \mathrm{Id}UL​=Id, the pseudo-masses are the masses themselves,

m~=m,q(m~)=q(m),\tilde m = m, \qquad q(\tilde m) = q(m),m~=m,q(m~)=q(m),

so (3.31) specializes to the original relation (3.1).

Preamble
import Definitions.Def_KoideRelation_defs
Formal statement
namespace KoideRelation

theorem pseudoMass_one_eq_mass (m : Fin 3 → ℝ) (hm : ∀ i, 0 ≤ m i) :
    pseudoMass 1 m = m ∧ koideRatio (pseudoMass 1 m) = koideRatio m := by sorry

end KoideRelation
Source
Goffinet, François, "A bottom-up approach to fermion masses", PhD thesis, Université catholique de Louvain, December 2008, http://hdl.handle.net/2078.1/20873, Chapter 3 "A Mass Relation", p. 73, eqs. (3.31)-(3.32)
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) - drafting agent; NON-INDEPENDENT self-authored read-back

Provenance note — this read-back is NOT independent and NOT blind. It was written by the same agent that drafted the Lean statements in this proposal, on the explicit instruction of the proposal owner, rather than by a separate auditor with a fresh context that had never seen the source material or the intended meaning. It is therefore not independent testimony and must not be read as corroboration of faithfulness: it can only restate the formal statement, and it inherits any misreading already present in the drafting. Reviewers who want the usual independent check should have a blind auditor redo it.

Let m=(m0,m1,m2)m = (m_0, m_1, m_2)m=(m0​,m1​,m2​) be three real numbers with mi≥0m_i \ge 0mi​≥0 for each iii. Let III denote the 3×33\times33×3 identity matrix over the complex numbers, and define the family m~\tilde mm~ by m~i=∥∑jIij mj∥\tilde m_i = \left\lVert \sum_j I_{ij}\, m_j \right\rVertm~i​=​∑j​Iij​mj​​, the complex absolute value of the iii-th entry of III applied to the vector whose entries are the mjm_jmj​ coerced to C\mathbb{C}C. The conclusion is a conjunction of two claims:

  1. m~=m\tilde m = mm~=m as functions on the three-element index set (equality of families, entry by entry);
  2. q(m~)=q(m)q(\tilde m) = q(m)q(m~)=q(m), where qqq of a family is the sum of its entries divided by the square of the sum of their square roots.

The second claim follows from the first but is stated separately. Nonnegativity of every mim_imi​ is essential, since the absolute value would otherwise change the sign of a negative entry. Nothing is claimed for mixing matrices other than the identity.

Human review
  • Endorsed by Shuze Chen · Sep 26, 2026

    Confirmed by the moderator at approval.

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