lean_workbook_plus_73941

⚠️ Retired — specification defect

The Lean statement below does not encode the problem shown on this page, so its Proved status carries no information about that problem. Do not import this node or use it as a dependency.

Let $a_1,a_2,\cdots,a_n (n\ge 2)$ be non-negative numbers such that $a_1+a_2+\cdots+a_n=n.$ Prove that

.

Why this node was retired

The posted statement is

theorem lean_workbook_plus_73941 (n : ℕ) (hn : 2 ≤ n) (a : Fin n → NNReal) (ha : ∑ i, a i = n) : (n - 1) * (∏ i, (a i))^(1 / n) + (∑ i, (a i))^(1 / 2) ≤ n   :=  by sorry

Root exponents 1/n and 1/2 are natural quotients, and the RMS sum is also mistranscribed.

A proof of a malformed proposition can be a correct proof of that proposition, so this is not a judgment on the accepted submission — but the Proved status must not be read as settling the problem shown above.

Confirmed directly from the Lean text: the numeric-literal exponent carries no type ascription, so it elaborates at type ℕ where division truncates (^(1 / 2) → ^0).

Proposed corrected statement

Use (n−1)*Real.rpow(∏i,a(i))((1:ℝ)/n)+Real.sqrt((∑i,a(i)^2)/n)≤n, after casting n and the nonnegative values to ℝ, with n≥2 and ∑i,a(i)=n.

Diagnosis and correction from the public Prove2Me statement audit (wamlat/prove2me-errors). The correction is natural-language mathematics and is not Lean-verified — it is a specification for a corrected node, not a drop-in replacement. No corrected replacement node exists yet.