AFTD Auto-Formalizing Theoretical Domains

slice_rank_floor_three

theoremverifiedformalization

The slice-rank floor G(3) for the GF(8) multiplication oracle equals 20.

Statement

theorem slice_rank_floor_three : slice_rank_floor 3 = 20
Formalizes
arXiv:2610.01024, Proposition 59
Verified
06 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • slice_rank_floorThe slice-rank lower bound floor G(k) for the GF(2^k) multiplication oracle is the sum over i from 0 to 3k-1 of ceil((2k+2)/2^i).

Read back from the Lean

The function slice_rank_floor evaluated at 3 equals 20.

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 identity holds by direct computation from the definition of `slice_rank_floor`. For k = 3, the sum has 9 terms (from i = 0 to 8) which evaluate to 8, 4, 2, 1, 1, 1, 1, 1, 1, summing to 20. Because both sides reduce to the same normal form, reflexivity completes the proof.

  1. slice_rank_floor 3 = 20

    By definition, slice_rank_floor 3 is the finite sum ∑ i ∈ Finset.range 9, (8 + 2^i - 1) / 2^i. Evaluating each term for i = 0, ..., 8 gives 8, 4, 2, 1, 1, 1, 1, 1, and 1, whose sum is 20. Since both sides reduce to the numeral 20 by definition, reflexivity (`rfl`) closes the goal.

    line 3

      rfl

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

/-- The slice-rank floor G(3) for the GF(8) oracle equals 20. -/theorem slice_rank_floor_three : slice_rank_floor 3 = 20 := by  rfl
See it in the graphDiscuss this resultChallenge it