Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Hasse derivatives and polynomial restriction to affine lines

Definition
KakeyaPolynomialMethods

by xwh · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

finite-fieldshasse-derivativeskakeyapolynomial-method

For polynomials over a commutative semiring, this interface defines multivariate Hasse derivatives by their coefficients, without division by factorials. If iii is the derivative multi-index, the coefficient at bbb of HiPH_iPHi​P is the coefficient of PPP at b+ib+ib+i multiplied by the product of the binomial coefficients (bj+ijij)\binom{b_j+i_j}{i_j}(ij​bj​+ij​​). It also defines multi-index total order and the algebra homomorphism restricting a polynomial to the affine line t↦a+tbt\mapsto a+tbt↦a+tb. These operations provide the statement interface for the mixed-jet polynomial detection lemma used in the sharp finite-field Kakeya proof. They are valid in positive characteristic.

Definition code
import Mathlib

/-! Multivariate Hasse derivatives, valid in arbitrary characteristic. -/

open scoped BigOperators
open MvPolynomial

namespace KakeyaHasse

variable {σ R : Type*} [Fintype σ] [CommSemiring R]

/-- The multi-index binomial coefficient, interpreted in the coefficient semiring. -/
noncomputable def multiChoose (a i : σ →₀ ℕ) : R :=
  ∏ j : σ, (Nat.choose (a j) (i j) : R)

/-- The Hasse derivative. Its coefficients are defined directly, without factorial division. -/
noncomputable def hasse (i : σ →₀ ℕ) (P : MvPolynomial σ R) : MvPolynomial σ R := by
  classical
  exact AddMonoidAlgebra.ofCoeff (Finsupp.onFinset
    (P.support.image fun a => a - i)
    (fun b => multiChoose (b + i) i * P.coeff (b + i)) (by
      intro b hb
      have hc : P.coeff (b + i) ≠ 0 := by
        intro hc
        simp only [hc, mul_zero] at hb
        exact hb rfl
      exact Finset.mem_image.mpr ⟨b + i, mem_support_iff.mpr hc, by simp⟩))

/-- The total order of a multi-index. -/
def order (i : σ →₀ ℕ) : ℕ := i.sum fun _ e => e

end KakeyaHasse

namespace KakeyaPolynomialMethods

/-- Restriction of a multivariate polynomial to the affine line `t ↦ a + t • b`. -/
noncomputable def lineMap {σ F : Type*} [CommSemiring F] (a b : σ → F) :
    MvPolynomial σ F →ₐ[F] Polynomial F :=
  MvPolynomial.aeval (fun j => Polynomial.C (a j) + Polynomial.X * Polynomial.C (b j))

end KakeyaPolynomialMethods
Source
Bukh and Chao, Sharp density bounds on the finite field Kakeya problem, arXiv:2108.00074v2, Discrete Analysis 2021:26, pp. 3–4, Definition 4 (Hasse derivatives) and Definition 8 (vanishing along a line). Coefficient formula is the binomial expansion of P(X+Y); affine line restriction is polynomial substitution. Necessary interface for Lemma 9 and public target448b0e69-57fd-4028-ab8b-07964b7b3c5b.
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me