Forking independence (often abbreviated to forking) is a ternary relation a ⟂_A b (or between types) expressing that the type of a over A∪{b} does not fork over A; intuitively, a is independent from b over A when no formula in the type of a over A∪{b} divides over A. Forking formalizes a robust notion of independence relative to a complete first-order theory.

Principle

At its core, forking is defined via dividing: a formula φ(x,b) divides over A if it implies an inconsistent family of instances indexed by an indiscernible sequence over A; a type forks if it implies a finite disjunction of formulas each dividing. The principle yields locality, monotonicity, invariance, and in stable theories symmetry and transitivity.

Demonstration

In a stable theory, forking independence coincides with non-splitting and has symmetry: for example, in algebraically closed fields non-forking of tuples corresponds to algebraic independence, so two tuples are independent over a base exactly when neither lies in the algebraic closure of the base together with the other.

Misapplication

Assuming forking behaves uniformly across all theories (e.g., has symmetry or base monotonicity without hypothesis) or identifying forking with more elementary notions like linear independence or algebraic independence in theories where those do not align leads to invalid deductions.

Consequence

When correctly applied, forking provides the principal independence calculus in classification theory: it yields canonical bases, allows construction of Morley sequences, and serves as a detector of stability, simplicity, NIP, and other dividing lines in model theory.

Reversal

Forking-dependence is the negation: a type forks over A when it encodes combinatorial complexity relative to A (via dividing) and thus indicates a dependence that blocks free extension; dependence witnesses nontrivial interaction between parameters and the type.

Boundary

Forking is theory-dependent and defined relative to a complete theory and the chosen ambient model (usually a monster). Its formal properties vary: full symmetry and transitivity hold in stable theories but may fail or need replacement (by Kim-independence, thorn-forking, etc.) in other classes.

Semantic Tension

There is semantic tension between forking and alternate independence notions (thorn-forking, Kim-independence, non-dividing): all aim to capture independence but differ in technical definition and adequacy across unstable settings, prompting careful choice depending on the dividing line considered.

Synthesis

Forking independence is the model-theoretic instrument that detects when types extend freely over a base: defined via dividing and packaged by properties like invariance and (in good theories) symmetry and transitivity, it unifies many algebraic intuitions of independence into a language-sensitive, theory-dependent calculus.