Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.3, p. 16 — the seller accepts a request q from a buyer believed to be θ̂ iff q ≤ γθ̂/(s+γk)

Proved
CustomerVoice.OLearn.seller_acceptance

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

customizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1signaling

Under the standing assumptions, let θ^∈{θH,θL}\hat\theta\in\{\theta_H,\theta_L\}θ^∈{θH​,θL​} be the seller's belief about a buyer, and let q≥0q\ge 0q≥0 be the buyer's quality request. The seller accepts the request (that is, γ(θ^q−kq2)−sq2≥0\gamma(\hat\theta q-kq^2)-sq^2\ge 0γ(θ^q−kq2)−sq2≥0) if and only if

q≤γθ^s+γk.q \le \frac{\gamma\hat\theta}{s+\gamma k}.q≤s+γkγθ^​.

This turns the acceptance inequality into the upper bound on acceptable requests that the rest of the O-Learning analysis uses.

Formalization Note The restriction q≥0q \ge 0q≥0 is needed: for q<0q<0q<0 the acceptance inequality fails while the bound holds. Requests are in R+\mathbb R_+R+​ in the paper (p. 9).

Preamble
import Mathlib
import Definitions.Def_CustomerVoice_OLearn_Setting
Formal statement
namespace CustomerVoice.OLearn

theorem seller_acceptance (M : Model) (hM : M.Standing) :
    ∀ t : CustomerVoice.ALearn.BType, ∀ q : ℝ, 0 ≤ q →
      (M.accepts (M.θ t) q ↔ q ≤ M.γ * M.θ t / (M.s + M.γ * M.k)) := by sorry

end CustomerVoice.OLearn
Source
Guo, The Voice of Customers in Customization, SSRN working paper 3994319 (version of 2023-11-29, https://ssrn.com/abstract=3994319), p. 16, §3.3, before (9)
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