Finite affine maxima reduce to -argument hinges
ProvedWangSun.affineMax_isHHLet be a nonempty finite index set and let be affine functions from to . Then the convex piecewise-linear function
is a finite sum of signed maxima of exactly affine functions. Equivalently, it has a generalized hinging-hyperplane representation of order . Maxima involving fewer than distinct affine functions are represented by repeating arguments, and arbitrary integer coefficients are represented by repeating signed hinge summands.
This is the single-maximum height-reduction core of the theorem that every piecewise-linear function on is an integral linear combination of maxima of at most affine functions. It is reusable independently of the lattice-normal-form step for general CPWL functions.
Formalization Note The family is indexed by an arbitrary nonempty finite type. The conclusion uses the shared mission predicate IsHH from Definitions.Def_CPWL.
import Definitions.Def_CPWL open Finset
namespace WangSun
theorem affineMax_isHH {n : ℕ} {I : Type} [Fintype I] [Nonempty I]
(L : I → ((Fin n → ℝ) →ᵃ[ℝ] ℝ)) :
IsHH (fun x => (Finset.univ : Finset I).sup' Finset.univ_nonempty fun i => L i x) := by
sorry
end WangSun