logic-foundations / Model theory

A Counterexample to the Stable Forking Conjecture

The paper constructs a simple theory in which forking cannot always be witnessed by a stable formula. Precisely, what fails is: in a simple theory, if a̸Cba \not\downarrow_C b then there is φ(x,bˉ)tp(a/Cb)\varphi(x,\bar b) \in \mathrm{tp}(a/Cb) forking over CC whose parameter-free form φ(x,y)\varphi(x,y) is stable. The counterexample is an infinite-dimensional vector space over the division ring of fractions of the quantum graph algebra of the random graph. Forking is characterised by an abstract independence relation, and the random graph is encoded into that relation so that it has the order property; stable formulas therefore cannot determine all forking in simple theories.

26Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

logic-foundationsAug 31, 2026Significance 26/100Registry: unreviewed

A Counterexample to the Stable Forking Conjecture

Prior state unknowndisproved

The paper constructs a simple theory in which forking cannot always be witnessed by a stable formula. Precisely, what fails is: in a simple theory, if a̸Cba \not\downarrow_C b then there is φ(x,bˉ)tp(a/Cb)\varphi(x,\bar b) \in \mathrm{tp}(a/Cb) forking over CC whose parameter-free form φ(x,y)\varphi(x,y) is stable. The counterexample is an infinite-dimensional vector space over the division ring of fractions of the quantum graph alg…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

The paper constructs a simple theory in which forking cannot always be witnessed by a stable formula. Precisely, what fails is: in a simple theory, if a̸Cba \not\downarrow_C b then there is φ(x,bˉ)tp(a/Cb)\varphi(x,\bar b) \in \mathrm{tp}(a/Cb) forking over CC whose parameter-free form φ(x,y)\varphi(x,y) is stable. The counterexample is an infinite-dimensional vector space over the division ring of fractions of the quantum graph algebra of the random graph. Forking is characterised by an abstract independence relation, and the random graph is encoded into that relation so that it has the order property; stable formulas therefore cannot determine all forking in simple theories.

The paper constructs a simple theory in which forking cannot always be witnessed by a stable formula. Precisely, what fails is: in a simple theory, if a̸Cba \not\downarrow_C b then there is φ(x,bˉ)tp(a/Cb)\varphi(x,\bar b) \in \mathrm{tp}(a/Cb) forking over CC whose parameter-free form φ(x,y)\varphi(x,y) is stable. The counterexample is an infinite-dimensional vector space over the division ring of fractions of the quantum graph algebra of the random graph. Forking is characterised by an abstract independence relation, and the random graph is encoded into that relation so that it has the order property; stable formulas therefore cannot determine all forking in simple theories.

Recorded attempts

Evidence graph

Connected research record