Paper: arXiv 2310.09782
Authors: Roger Lee
Abstract
In a universal framework that expresses any market system in terms of state transition rules, we prove that every DeFi market system has an invariant function and is thus by definition a CFMM; indeed, all automated market makers (AMMs) are CFMMs. Invariants connect directly to arbitrage and to completeness, according to two fundamental equivalences. First, a DeFi market system is, we prove, arbitrage-free if and only if it has a strictly increasing invariant, where arbitrage-free means that no state can be transformed into a dominated state by any sequence of transactions. Second, the invariant is, we prove, unique if and only if the market system is complete, meaning that it allows transitions between all pairs of states in the state space, in at least one direction. Thus a necessary and sufficient condition for no-arbitrage (respectively, for completeness) is the existence of the increasing (respectively, the uniqueness of the) invariant, which, therefore, fulfills in nonlinear DeFi theory the foundational role parallel to the existence (respectively, uniqueness) of the pricing measure in the Fundamental Theorem of Asset Pricing for linear markets. Moreover, a market system is recoverable by its invariant if and only if it is complete; and in all cases, complete or incomplete, every market system has, and is recoverable by, a multi-invariant. A market system is arbitrage-free if and only if its multi-invariant is increasing. Our examples illustrate (non)existence of various specific types of arbitrage in the context of various specific types of market systems – with or without fees, with or without liquidity operations, and with or without coordination among multiple pools – but the fundamental theorems have full generality, applicable to any DeFi market system and to any notion of arbitrage expressible as a strict partial order.
Complexity vs Empirical Score
- Math Complexity: 8.5/10
- Empirical Rigor: 2.0/10
- Quadrant: Lab Rats — high math complexity, limited empirical testing
Why this score: The paper is dense with abstract mathematical definitions, proofs, and formal equivalences (e.g., poset theory, invariant functions, completeness) typical of theoretical research. It lacks any empirical data, backtesting, code, or implementation details, focusing entirely on theoretical foundations and general proofs rather than practical validation.
Research Flowchart
flowchart TD A["Research Goal: Establish a universal framework proving<br>all DeFi markets are CFMMs and their link to<br>arbitrage and completeness"] --> B["Methodology: State Transition Framework"] B --> C["Key Data: General DeFi market systems<br>(AMMs, pools, fees, liquidity operations)"] C --> D["Computational Process: Deriving Invariant Functions"] D --> E["Find 1: Arbitrage-free ⇔ Strictly Increasing Invariant"] D --> F["Find 2: Completeness ⇔ Unique Invariant"] D --> G["Find 3: Complete markets recoverable by invariant<br>Incomplete markets have multi-invariant"] E --> H["Theorem: Invariant serves as the nonlinear<br>FTAP for DeFi markets"] F --> H G --> H
Evidence Card
What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card
Proposes
The paper proposes that every DeFi market system is a constant‑function market maker (CFMM) and that a DeFi market is arbitrage‑free if and only if it possesses a strictly increasing invariant; likewise, a CFMM is complete if and only if its invariant is unique.
Source sentence
In a universal framework that expresses any market system in terms of state transition rules, we prove that every DeFi market system has an invariant function and is thus by definition a CFMM; indeed, all automated market makers (AMMs) are CFMMs. First, a DeFi market system is, we prove, arbitrage-free if and only if it has a strictly increasing invariant, where arbitrage-free means that no state can be transformed
Assumes 2
- Continuity of the market system’s transition rules. model
Source sentence
3.3 Necessary conditions for absence of arbitrage Theorem 3.11 will show, assuming continuity and giftability, that any arbitrage-free market system must have an increasing invariant. Definition 3.9.
- Giftability: for any states x, y with y D x, the system satisfies x ≾ y. model
Source sentence
3.3 Necessary conditions for absence of arbitrage Theorem 3.11 will show, assuming continuity and giftability, that any arbitrage-free market system must have an increasing invariant. Definition 3.9. A market system on X is giftable if x ≾y for all x, y ∈X satisfying y D x.
Data
No dataset named in the text.
Costs
Not applicable
Finds 3
- Theorem 7.1 (First fundamental theorem) shows that a DeFi system is arbitrage‑free exactly when it has a strictly increasing invariant (or weak invariant). theoretical figure from elsewhere in the paper
Source sentence
The following are equivalent: (a) M is arbitrage-free. (b) M has a strictly increasing invariant.
- Theorem 7.2 (Second fundamental theorem) shows that a CFMM is complete exactly when it has a unique invariant (modulo strictly increasing transformations). theoretical figure from elsewhere in the paper
Source sentence
The following are equivalent: (a) M is complete. (b) M has an invariant that recovers M. (c) Each invariant of M recovers M. (d) M has only one invariant (modulo composition with strictly increasing mappings). Proof.
- All automated market makers (AMMs) are CFMMs, and every DeFi market system possesses an invariant function. theoretical
Source sentence
In a universal framework that expresses any market system in terms of state transition rules, we prove that every DeFi market system has an invariant function and is thus by definition a CFMM; indeed, all automated market makers (AMMs) are CFMMs.
Checked by others
No other paper in the archive has been found to support or contradict these findings (compared with 12 related papers). Coverage is partial, so this is neither replication nor refutation.
1 paper in the archive
Code
No repository by the authors found in the paper.
Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.