AFTD Auto-Formalizing Theoretical Domains

icosahedron_cartesian_power_diameter_bound_exceeded

theoremverified

For every integer m ≥ 2, the quantity 2 * (5 * m) / (2 + 2) is strictly less than 3 * m.

Statement

theorem icosahedron_cartesian_power_diameter_bound_exceeded (m : ℕ) (hm : 2 ≤ m) :
    2 * (5 * m) / (2 + 2) < 3 * m
Source
arXiv:2610.36620, Proof of Theorem 3.6
Verified
30 Oct 2026
Axioms
Quot.soundpropext

Read back from the Lean

For every natural number m such that 2 ≤ m, the natural number division 2 * (5 * m) / (2 + 2) is strictly less than 3 * m.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

The inequality states that for any natural number m ≥ 2, the integer division 2 * (5 * m) / (2 + 2) is strictly less than 3 * m. Simplifying the constants gives ⌊10m / 4⌋ < 3m, which holds because 10m < 12m = 4 * (3m) for all positive m. The decision procedure `omega` verifies this linear integer arithmetic fact automatically.

  1. For every natural number m ≥ 2, 2 * (5 * m) / (2 + 2) < 3 * m. automation

    The goal is an inequality in Presburger arithmetic with integer division by a constant: in natural arithmetic, 2 * (5 * m) / (2 + 2) is ⌊10m / 4⌋. For m ≥ 2, we have 10m < 12m = 4 * (3m), so the quotient ⌊10m / 4⌋ is strictly less than 3m. The automated tactic `omega` discharges this linear integer arithmetic goal directly.

    line 4

      omega

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- For m ≥ 2, 2 * (5 * m) / (2 + 2) < 3 * m. -/theorem icosahedron_cartesian_power_diameter_bound_exceeded (m : ℕ) (hm : 2 ≤ m) :    2 * (5 * m) / (2 + 2) < 3 * m := by  omega
See it in the graphDiscuss this resultChallenge it