Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 8, p. 23 — seller and buyer payoff rankings and their fixed-cost reversals

Proved
CustomerVoice.Payoffs.proposition_8

by mikedeng1 · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

customizationfixed-costsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1payoff-comparison

Consider the paper's two-type customization model with θH>θL>0\theta_H>\theta_L>0θH​>θL​>0, 0<α,γ<10<\alpha,\gamma<10<α,γ<1, and k,s>0k,s>0k,s>0. Let VA,VOV^A,V^OVA,VO be the seller's expected gross payoffs and UiA,UiOU^A_i,U^O_iUiA​,UiO​ the type-iii buyer's gross payoffs at the A-Learning and O-Learning equilibrium qualities. Proposition 8 states four comparisons:

  1. The seller receives more under A-Learning: VA>VOV^A>V^OVA>VO.
  2. For every F>0F>0F>0, some s~F>0\tilde s_F>0s~F​>0 makes VA(s)−F<VO(s)V^A(s)-F<V^O(s)VA(s)−F<VO(s) for every 0<s<s~F0<s<\tilde s_F0<s<s~F​.
  3. Each type receives more under O-Learning: UiA<UiOU^A_i<U^O_iUiA​<UiO​ for i∈{H,L}i\in\{H,L\}i∈{H,L}.
  4. For every G>0G>0G>0 and each type iii, some s~iG>0\tilde s_{iG}>0s~iG​>0 makes UiA(s)>UiO(s)−GU^A_i(s)>U^O_i(s)-GUiA​(s)>UiO​(s)−G for every 0<s<s~iG0<s<\tilde s_{iG}0<s<s~iG​.

The proposition compares gross benefits from the two design rights and explains when a positive incremental fixed cost reverses each preference.

Formalization Note In the small-sss clauses only sss changes, and each threshold is selected before the varying sss. The statements hold for all parameters satisfying the section's standing assumptions without separately assuming the existence thresholds for both separating equilibria. The price stage is represented by the printed reduced-form payoffs, and the buyer payoffs retain their maxima with zero.

Preamble
import Mathlib
import Definitions.Def_CustomerVoice_Payoffs_Setting
Formal statement
namespace CustomerVoice.Payoffs

theorem proposition_8 (M : Model) (hM : M.Standing) :
    M.VA > M.VO ∧
    (∀ F : ℝ, F > 0 → ∃ sF : ℝ, sF > 0 ∧
      ∀ s' : ℝ, 0 < s' → s' < sF →
        (M.withS s').VA - F < (M.withS s').VO) ∧
    (∀ t : CustomerVoice.ALearn.BType, M.UA t < M.UO t) ∧
    (∀ G : ℝ, G > 0 → ∀ t : CustomerVoice.ALearn.BType, ∃ sG : ℝ, sG > 0 ∧
      ∀ s' : ℝ, 0 < s' → s' < sG →
        (M.withS s').UA t > (M.withS s').UO t - G) := by sorry

end CustomerVoice.Payoffs
Source
Guo, The Voice of Customers in Customization, SSRN working paper 3994319 (version of 2023-11-29, https://ssrn.com/abstract=3994319), p. 23, Proposition 8
Human review
  • Endorsed by Shuze Chen · Oct 16, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 16, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me