slice_rank_floor
def
The 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).
Statement
def slice_rank_floor (k : ℕ) : ℕ- Defined in
- arXiv:2610.01024, Proposition 59
- Verified
- 04 Oct 2026
- Axioms
- none listed
- Used by 1
- slice_rank_floor_threeThe slice-rank floor G(3) for the GF(8) multiplication oracle equals 20.
Read back from the Lean
slice_rank_floor is defined as a function from ℕ to ℕ that maps each natural number k to the sum over i ∈ Finset.range (3 * k) (that is, for i from 0 to 3 * k - 1) of (2 * k + 2 + 2 ^ i - 1) / 2 ^ i, where / is truncated natural number division (which computes ⌈(2k + 2) / 2^i⌉).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The Griesmer slice-rank floor G(k) for the GF(2^k) multiplication oracle. -/ def slice_rank_floor (k : ℕ) : ℕ := ∑ i ∈ Finset.range (3 * k), (2 * k + 2 + 2 ^ i - 1) / 2 ^ i