Nonnegative realized valuations as finite candidate prices
DefinitionFBMSP_DiscreteCandidatesFor a rational finite market, the candidate set is zero together with all nonnegative realized valuation breakpoints . This definition only constructs the set; the associated theorem must prove that its cardinality is at most and that restricting prices to it loses no revenue.
import Definitions.Def_FBMSP_Hardness
namespace FBMSP
/-- The zero outside option together with every nonnegative realized
valuation in a finite rational market. This definition does not restrict the
original policy's prices: those may still be arbitrary nonnegative reals. -/
noncomputable def rationalCandidatePrices (I : RationalMarketInput) : Finset ℝ := by
classical
exact insert 0
(((I.means.toFinset.product I.shocks.toFinset).image
(fun z : ℚ × ℚ => ((z.1 + z.2 : ℚ) : ℝ))).filter (fun p => 0 ≤ p))
end FBMSP
Read-back
What the Lean code literally says, in plain math · gpt-6-astra
For any record consisting of rational lists of means, mean weights, shocks, and shock weights, a natural number of slots, and a rational threshold, define its candidate-price set to be , where each sum is first formed in and then embedded in . This is a finite set, so repeated means, repeated shocks, and coinciding sums contribute only one price. Every supplied mean and shock is used regardless of its weight. Negative sums are discarded, and is inserted even if neither list supplies a nonnegative sum or either list is empty. No market-validity condition, weight-length condition, sign condition on the input means, probability normalization, or restriction on the input's threshold or number of slots is required by this definition.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.