characterizes a single nonzero mass (Table 3.1)
ProvedKoideRelation.koide_ratio_eq_one_iffFor a nonnegative, not identically zero family of masses, the upper bound is attained exactly in the limit of complete hierarchy, i.e. when all masses but one vanish:
This is the last line of Table 3.1 of the source (, "strong hierarchy", for three generations), made exact: the cross terms in the denominator vanish precisely when at most one mass is nonzero.
import Definitions.Def_KoideRelation_defs
namespace KoideRelation
theorem koide_ratio_eq_one_iff {n : ℕ} (m : Fin n → ℝ) (hm : ∀ i, 0 ≤ m i)
(hpos : ∃ i, 0 < m i) :
koideRatio m = 1 ↔ ∃ i, ∀ j, j ≠ i → m j = 0 := by sorry
end KoideRelationRead-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 be a natural number and a family of real numbers with every and at least one . The assertion is a biconditional between:
- , where is the sum of the entries divided by the square of the sum of their square roots; and
- there exists an index such that for every index different from .
The right-hand side does not itself require ; combined with the standing hypothesis that some entry is strictly positive, it says that exactly one entry is nonzero. The equality is an equality of real numbers. Both directions are claimed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.