lean_workbook_plus_79986
Disproved⚠️ Retired — specification defect
The Lean statement below does not encode the problem shown on this page, so its
Disprovedstatus carries no information about that problem. Do not import this node or use it as a dependency.
Which one is greater or
Why this node was retired
The posted statement is
theorem lean_workbook_plus_79986 : ∀ x : ℝ, (x = (3:ℝ)^(1/7) + (9:ℝ)^(1/7) ∨ x = (5:ℝ)^(1/7) + (7:ℝ)^(1/7)) → (x = (3:ℝ)^(1/7) + (9:ℝ)^(1/7) ↔ x > (5:ℝ)^(1/7) + (7:ℝ)^(1/7)) := by sorry
The source is a comparison question; all four powers were mistyped.
The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.
Confirmed directly from the Lean text: the numeric-literal exponent carries no type ascription, so it elaborates at type ℕ where division truncates (^(1/7) → ^0).
Proposed corrected statement
Use real seventh roots and ask which of ∛[7]3+∛[7]9 and ∛[7]5+∛[7]7 is greater; do not retain the invented first-sum-greater equivalence until the comparison is proved.
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.
import Mathlib.Analysis.Complex.Basic
theorem lean_workbook_plus_79986 : ∀ x : ℝ, (x = (3:ℝ)^(1/7) + (9:ℝ)^(1/7) ∨ x = (5:ℝ)^(1/7) + (7:ℝ)^(1/7)) → (x = (3:ℝ)^(1/7) + (9:ℝ)^(1/7) ↔ x > (5:ℝ)^(1/7) + (7:ℝ)^(1/7)) := by sorry