Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

q=1nq = \tfrac1nq=n1​ characterizes complete degeneracy (Table 3.1)

Proved
KoideRelation.koide_ratio_eq_inv_card_iff

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

algebramathematical-physics

For a nonnegative, not identically zero family of nnn masses, the lower bound of the previous milestone is attained exactly at complete degeneracy:

q(m)=1n  ⟺  m1=m2=⋯=mn.q(m) = \frac1n \iff m_1 = m_2 = \dots = m_n.q(m)=n1​⟺m1​=m2​=⋯=mn​.

This is the first line of Table 3.1 of the source (q=13q = \tfrac13q=31​, ψ=0\psi = 0ψ=0 for three degenerate masses), stated as an exact characterization: it is the equality case of Cauchy–Schwarz for the vectors (mi)i(\sqrt{m_i})_i(mi​​)i​ and (1,…,1)(1,\dots,1)(1,…,1).

Preamble
import Definitions.Def_KoideRelation_defs
Formal statement
namespace KoideRelation

theorem koide_ratio_eq_inv_card_iff {n : ℕ} (m : Fin n → ℝ) (hm : ∀ i, 0 ≤ m i)
    (hpos : ∃ i, 0 < m i) :
    koideRatio m = 1 / (n : ℝ) ↔ ∀ i j, m i = m j := 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", pp. 61-63, Table 3.1 (degeneracy row: q=1/3q = 1/3q=1/3, ψ=0\psi = 0ψ=0), stated for general nnn
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 nnn be a natural number and mmm a family of nnn real numbers such that every mi≥0m_i \ge 0mi​≥0 and at least one mi>0m_i > 0mi​>0. The assertion is a biconditional between:

  • q(m)=1/nq(m) = 1/nq(m)=1/n, where q(m)q(m)q(m) is the sum of the entries divided by the square of the sum of their square roots and nnn is coerced to a real number; and
  • for every pair of indices i,ji, ji,j, mi=mjm_i = m_jmi​=mj​ (all entries are equal to one another).

The right-hand condition quantifies over all ordered pairs, including i=ji = ji=j, so it says precisely that the family is constant. The positivity hypothesis excludes n=0n = 0n=0 and the all-zero family, for which qqq would be 000 by the division convention. Neither side is assumed a priori; the biconditional is claimed in both directions.

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