Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 3, p. 36 — no differentiation in the high-direct-quality branch

Proved
QualityEncroach.FixedCost.claim_3

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

encroachmentoptimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1product-qualitysupply-chain

Let k>0k>0k>0 and c>0c>0c>0. Maximize the high-direct-quality reduced profit over pairs (t,u)(t,u)(t,u) with 0<t≤10<t\le10<t≤1 and u>(8−3t)c/(8−5t)u>(8-3t)c/(8-5t)u>(8−3t)c/(8−5t). Every maximizer (t,u)(t,u)(t,u) satisfies

t=1.t=1.t=1.

This is the high-direct-quality half of Proposition 6(i).

Formalization Note The maximization is joint in (t,u)(t,u)(t,u) and uses the strict positive-direct-sales domain. The added c>0c>0c>0 is necessary: at c=0c=0c=0 this reduced profit is independent of ttt.

Preamble
import Mathlib
import Definitions.Def_QualityEncroach_FixedCost_Reduced
Formal statement
namespace QualityEncroach.FixedCost

/-- Claim 3, p. 36, read as a joint maximization over the open
encroachment-feasible set. The page's fixed-`u` derivative argument does not
assert that `t = 1` is feasible for that fixed `u`. -/
theorem claim_3 (k c t u : ℝ) (hk : 0 < k) (hc : 0 < c)
    (ht0 : 0 < t) (ht1 : t ≤ 1)
    (hu : (8 - 3 * t) * c / (8 - 5 * t) < u)
    (hopt : ∀ t' u' : ℝ, 0 < t' → t' ≤ 1 →
      (8 - 3 * t') * c / (8 - 5 * t') < u' →
      PiHi k c t' u' ≤ PiHi k c t u) :
    t = 1 := by sorry

end QualityEncroach.FixedCost
Source
Ha, Long & Nasiry, Quality in Supply Chain Encroachment, authors' manuscript, SSRN 3970373, p. 36, Claim 3 and its proof
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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