AFTD Auto-Formalizing Theoretical Domains

minimal_advantage_eleven

theoremverified

The minimal winning advantage threshold for 11-sided dice is 61.

Statement

theorem minimal_advantage_eleven : minimal_advantage 11 = 61
Source
arXiv:2610.40321 Sec 3
Verified
31 Oct 2026
Axioms
Quot.soundpropext
Built on 1
  • minimal_advantageThe minimal winning advantage threshold for an n-sided die: n^2 / 2 + 1 if n is even, and (n^2 + 1) / 2 if n is odd.

Read back from the Lean

The value of minimal_advantage 11 is equal to 61.

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 theorem states that the minimal winning advantage threshold for an 11-sided die is 61. This is proved by unfolding the definition of `minimal_advantage` and evaluating the arithmetic expression $(11^2 + 1) / 2 = 61$ via the `norm_num` tactic.

  1. minimal_advantage 11 = 61 automation

    Unfolding the definition of `minimal_advantage` at $n = 11$, since 11 is odd, yields $(11^2 + 1) / 2 = (121 + 1) / 2 = 61$. The `norm_num` tactic unfolds this definition and performs the numerical evaluation to close the goal.

    line 3

    uses minimal_advantage

      norm_num [minimal_advantage]
minimal_advantage
For any natural number $n$, if $n$ is even, `minimal_advantage n` is $n^2 / 2 + 1$; otherwise it is $(n^2 + 1) / 2$.

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 n = 11, the minimal winning advantage is 61. -/theorem minimal_advantage_eleven : minimal_advantage 11 = 61 := by  norm_num [minimal_advantage]
See it in the graphDiscuss this resultChallenge it