AFTD Auto-Formalizing Theoretical Domains

multilinear_extension_smul

theoremverified

The multilinear extension commutes with scalar multiplication.

Statement

theorem multilinear_extension_smul {m : ℕ} (c : ℝ) (f : Finset (Fin m) → ℝ) (x : Fin m → ℝ) : multilinear_extension (c • f) x = c * multilinear_extension f x
Source
step towards matroid_symmetry_gap_integral_lt_eight_seventeenths
Verified
25 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • multilinear_extensionThe multilinear extension F(x) = Σ_S f(S) ∏_{u∈S} x_u ∏_{u∉S} (1 − x_u) of a set function f on {0, …, m−1}.

The proof, explained

The proof unfolds the definition of `multilinear_extension` into a finite sum over subsets S ⊆ Fin m. Because each term in the sum is linear in f(S), applying pointwise scalar multiplication replaces f(S) with c * f(S). Distributing c into the sum on the right-hand side and regrouping factors via associativity shows that both sides are identical sums.

  1. multilinear_extension (c • f) x = c * multilinear_extension f x

    Unfold the definition of `multilinear_extension` on both sides. On the left-hand side, each summand begins with (c • f) S, which evaluates pointwise to c • f S by `Pi.smul_apply` and then to c * f S by `smul_eq_mul`. By associativity of multiplication (`mul_assoc`), each term groups as c * (f S * ∏ ...). On the right-hand side, distributing c across the finite sum using `Finset.mul_sum` gives the exact same sum of terms.

    line 3

    uses multilinear_extension, Pi.smul_apply, smul_eq_mul, Finset.mul_sum, mul_assoc

      simp only [multilinear_extension, Pi.smul_apply, smul_eq_mul, Finset.mul_sum, mul_assoc]
multilinear_extension
The definition of the multilinear extension: multilinear_extension f x = ∑ S, f S * (∏ u ∈ S, x u) * ∏ u ∈ Sᶜ, (1 - x u)
Pi.smul_apply
Scalar multiplication on a function space is defined pointwise: (a • f) i = a • f i
smul_eq_mul
Scalar multiplication on the base ring coincides with ring multiplication: a • b = a * b
Finset.mul_sum
Multiplication distributes over finite sums from the left: a * ∑ i ∈ s, f i = ∑ i ∈ s, a * f i
mul_assoc
Multiplication is associative: (a * b) * c = a * (b * c)

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 multilinear extension commutes with scalar multiplication. -/theorem multilinear_extension_smul {m : ℕ} (c : ℝ) (f : Finset (Fin m) → ℝ) (x : Fin m → ℝ) : multilinear_extension (c • f) x = c * multilinear_extension f x := by  simp only [multilinear_extension, Pi.smul_apply, smul_eq_mul, Finset.mul_sum, mul_assoc]
See it in the graphDiscuss this resultChallenge it