Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, case ψ<Pρ\psi<P\rhoψ<Pρ (corrected: ψ>0\psi>0ψ>0): Cinv(ξ)<Ch(ξ)C_{{inv}}(\xi)<C_h(\xi)Cinv​(ξ)<Ch​(ξ) for every ξ>0\xi>0ξ>0

Open
DigitalPrivacy.DataStrategy.proof_thm1_case_psi_lt_Prho

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

digital-privacygame-theoryoptimizationplatform-economics

Throughout, β∈[0,1)\beta\in[0,1)β∈[0,1) is the strength of network effects and ρ∈[0,1)\rho\in[0,1)ρ∈[0,1) the users' value of data (p. 6), P∈[0,1]P\in[0,1]P∈[0,1] the business's revenue model and ψ\psiψ the unit cost of data protection (p. 8). If 0<ψ<Pρ0<\psi<P\rho0<ψ<Pρ, then

Cinv(ξ)<Ch(ξ)for every ξ>0.C_{inv}(\xi)<C_h(\xi)\qquad\text{for every }\xi>0 .Cinv​(ξ)<Ch​(ξ)for every ξ>0.

Hence the two best-response curves meet only at ξ=0\xi=0ξ=0, and on [0,1][0,1][0,1] the candidate optima are (0,0)(0,0)(0,0) and (1,Ch(1))(1,C_h(1))(1,Ch​(1)).

Differences from the source:

  • correction: ψ ≥ 0 (p. 8), so the case ψ < Pρ includes ψ = 0 → 0 < ψ < Pρ; reason: C_h divides by ψ and is undefined at ψ = 0; at ψ = 0 the profit has no maximizer (β = 0, ρ = P = 1/2: Π(1, C) = 3C/(2(C + 1)) → 3/2 unattained)
Preamble
import Mathlib
import Definitions.Def_DigitalPrivacy_DataStrategy_cInv
import Definitions.Def_DigitalPrivacy_DataStrategy_cH
Formal statement
namespace DigitalPrivacy.DataStrategy

/-- **Proof of Theorem 1, case `ψ < Pρ` (corrected: `ψ > 0`): `C_inv(ξ) < C_h(ξ)` for every `ξ > 0`.**
Fainmesser, Galeotti, Momot, *Digital Privacy*, author manuscript (April 2022 draft; SSRN 3459274), proof of Theorem 1 (App. A.2), pp. 29–30 (PDF 30–31), unnumbered: "Case ψ < Pρ: We first
show that Cinv(ξ) < Ch(ξ) (where Ch(ξ) is defined in Lemma 1) and they only intersect at ξ = 0
under this condition. … It is easy to check that inequality holds in this case and hence
Cinv(ξ) < Ch(ξ), ∀ξ > 0."

For `β, ρ ∈ [0, 1)`, `P ∈ [0, 1]` and `0 < ψ < Pρ`: `C_inv(ξ) < C_h(ξ)` for every `ξ > 0`.

**Formalization Note.** The page allows `ψ ≥ 0` (p. 8); `C_h` divides by `ψ`, so `ψ = 0` is
excluded. -/
theorem proof_thm1_case_psi_lt_Prho {β ρ P ψ : ℝ}
    (hβ0 : 0 ≤ β) (hβ1 : β < 1) (hρ0 : 0 ≤ ρ) (hρ1 : ρ < 1)
    (hP0 : 0 ≤ P) (hP1 : P ≤ 1) (hψ0 : 0 < ψ) (hψ : ψ < P * ρ) :
    ∀ ξ : ℝ, 0 < ξ → cInv β ρ P ξ < cH β ρ P ψ ξ := by sorry

end DigitalPrivacy.DataStrategy
Source
Fainmesser, Galeotti, Momot, Digital Privacy, author manuscript (April 2022 draft; SSRN 3459274), proof of Theorem 1 (App. A.2), pp. 29–30 (PDF 30–31), unnumbered

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