Appendix E.2, proof of Proposition 6, p. 52 — ζ(n; λ̲) − ζ(n; λ̄) = 2γ(λ̲ − λ̄)(2n − 1) < 0 for n > 1/2 (corrected value)
ProvedNetFeePlatform.InteropDominance.zeta_subinteroperabilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1platform-competition
Let , let be two levels of interoperability, and let . Then
In the proof of Proposition 6 this is applied at the dominant share of an equilibrium under , where , and shows .
Formalization Note The paper prints the difference as ; the correct value, from the definition of , is . Both are negative under the stated hypotheses, so the argument is unaffected. The Lean states the correct value and the sign.
Preamble
import Mathlib import Definitions.Def_NetFeePlatform_Competition_Setting import Definitions.Def_NetFeePlatform_InteropDominance_Zeta
Formal statement
namespace NetFeePlatform.InteropDominance
theorem zeta_sub (γ lamLo lamHi n : ℝ) (hγ : 0 < γ) (hlt : lamLo < lamHi) (hn : 1 / 2 < n) :
zeta γ lamLo n - zeta γ lamHi n = 2 * γ * (lamLo - lamHi) * (2 * n - 1) ∧
zeta γ lamLo n - zeta γ lamHi n < 0 := by sorry
end NetFeePlatform.InteropDominance
Source
Ekmekci, White & Wu, Platform Competition and Interoperability: The Net Fee Model, accepted working-paper version (December 12, 2024), p. 52, Appendix E.2, proof of Proposition 6
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.