Theorem 8.1, proof — the monomials τ^k (k ≠ 0) span a dense subspace of V^n in the C¹ norm
ProvedFuzzyGames.Values.monomials_denseapproximationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1polynomialsvalue
Let be a coalitional worth function vanishing at and let . Then there are finitely many nonzero exponents and real coefficients such that the polynomial satisfies
Hence a continuous linear map on is determined by its values on the monomials, which is how the uniqueness part of Theorem 8.1 is reduced to monomials.
Formalization Note The exponent is excluded because the constant does not vanish at and so is not in . The seminorm is the seminorm of the cube, with the sup norm on ; both suprema are finite because is and the cube is compact.
Preamble
import Mathlib import Definitions.Def_FuzzyGames_Values_Basic
Formal statement
namespace FuzzyGames.Values
/-- §8, proof of Theorem 8.1 (pp. 10–11): the polynomials `τ ↦ τ_1^{k_1} ⋯ τ_n^{k_n}`
(`k ≠ 0`) span a dense subspace of `V^n` for the C¹ norm on the FuzzyGames.NTUCore.cube. -/
theorem monomials_dense (n : ℕ) (v : Vn n) (ε : ℝ) (hε : 0 < ε) :
∃ (K : Finset (Fin n → ℕ)) (a : (Fin n → ℕ) → ℝ), 0 ∉ K ∧
c1seminorm (fun τ => v.1 τ - ∑ k ∈ K, a k * monomial k τ) < ε := by sorry
end FuzzyGames.Values
Source
Aubin, Cooperative Fuzzy Games, Math. Oper. Res. 6(1) (1981), §8, proof of Theorem 8.1, pp. 10–11
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.