Every coherent risk measure admits a scenario representation
DisprovedRepr.coherent_representableRETIRED — THIS STATEMENT IS FALSE AS WRITTEN. Do not attempt to prove it.
The error is the finiteness of the scenario family. This statement asks for a representation indexed by a Fintype, i.e. a maximum over finitely many probability weight vectors. A maximum of finitely many linear functionals is piecewise linear (polyhedral). But the coherent measures on a finite state space are exactly the support functions of closed convex sets of probability vectors, and such a set need not be a polytope.
Counterexample. On three states, let be the centroid of the simplex and let be a closed Euclidean ball of small radius about , contained in the simplex. Put . This is coherent: it is a support function, hence sublinear, so subadditive and positively homogeneous; every is nonnegative, giving monotonicity; and every sums to one, giving translation invariance. Explicitly , whose Euclidean-norm term is not piecewise linear. So is coherent but is not a maximum over any finite family, and no proof of this statement can exist.
What the corrected statement needs. The scenario family must be allowed to be infinite — a closed convex (equivalently compact convex) set of probability vectors — with the maximum taken as a supremum over that set rather than a Finset.sup' over a Fintype. That requires reworking the RepresentedBy definition accordingly; it is not a repair to this statement.
The converse direction is unaffected and is proved: Repr.repr_coherent shows every finitely-represented functional is coherent (finite representability is sufficient, just not necessary). Repr.worstCase_representedBy gives a genuine instance.
Retired by its author after an independent blind read-back identified the finiteness gap.
import Definitions.Def_CoherentRiskRepresentation open CoherentRisk Repr
namespace Repr
theorem coherent_representable {n : ℕ} (rho : (Fin (n+1) → ℝ) → ℝ) (h : Coherent rho) :
∃ (ι : Type) (_ : Fintype ι) (_ : Nonempty ι) (P : ι → (Fin (n+1) → ℝ)),
RepresentedBy rho P := by
sorry
end Repr