Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proposition 3(3), p. 22 — splitting a constant product pool into k equal pools and the order into k equal parts leaves the total cost unchanged

Proved
CPAMMFlaws.Properties.proposition_3_3

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

automated-market-makingconstant-productp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let a constant product pool hold X>0X>0X>0 units of token AAA and Y>0Y>0Y>0 units of token BBB, let 0<x<X0<x<X0<x<X and k>0k>0k>0. If the liquidity is split into kkk equal pools (X/k, Y/k)(X/k,\,Y/k)(X/k,Y/k) and the order into kkk equal parts x/kx/kx/k, one on each pool, the total cost equals the cost on the single pool:

pcmm(x,X,Y)=k⋅pcmm(xk,Xk,Yk).p^{\mathrm{cmm}}(x,X,Y)=k\cdot p^{\mathrm{cmm}}\Bigl(\frac{x}{k},\frac{X}{k},\frac{Y}{k}\Bigr).pcmm(x,X,Y)=k⋅pcmm(kx​,kX​,kY​).

Fragmenting liquidity across identical constant product pools, with the order split pro rata, does not change execution cost.

Formalization Note X>0X>0X>0, Y>0Y>0Y>0 are the deposits of §II.C, not printed in the proposition. kkk is any positive real, as in the proposition's preamble "k>0k>0k>0".

Preamble
import Mathlib
import Definitions.Def_CPAMMFlaws_Properties_Setting
Formal statement
namespace CPAMMFlaws.Properties

theorem proposition_3_3 (X Y x k : ℝ) (hX : 0 < X) (hY : 0 < Y)
    (hx : 0 < x) (hxX : x < X) (hk : 0 < k) :
    pcmm x X Y = k * pcmm (x / k) (X / k) (Y / k) := by sorry

end CPAMMFlaws.Properties
Source
Park, The Conceptual Flaws of Constant Product Automated Market Making, working paper dated June 8, 2021, p. 22, Proposition 3(3)
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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me