A ternary relation between parameter sets A, B over a base C in model theory (typically stable or simple theories) that expresses that the type of A over B∪C does not fork over C; it generalizes linear-algebra-style independence and measures a lack of new dividing information introduced by B beyond C.

Principle

Independence is governed by invariance under automorphisms fixing the base, monotonicity, symmetry, transitivity, existence and extension properties; non-forking captures the absence of dividing formulas and organizes independence calculus in stable and simple contexts.

Demonstration

In an algebraically closed field, non-forking of tuples over a base field coincides with algebraic (field-theoretic) independence: a tuple a does not fork over C with B exactly when the transcendence degree of C(a) over C equals that of C(a) over C(B).

Misapplication

Treating forking simply as syntactic non-derivability or equating it with any informal notion of independence outside the model-theoretic properties (for example, using it naively in theories that are neither simple nor stable where the relation loses expected properties).

Consequence

When correctly applied, forking independence provides a robust independence calculus: it yields canonical bases, controls definable groups and geometries, and allows transfer of classification-theoretic structure across models.

Reversal

The inverse notion is forking/dividing: A forks over C with B when some formula in the type of A over B∪C divides over C, indicating genuine dependence or combinatorial complexity introduced by B.

Boundary

Defined in first-order model theory for complete theories; the usual good properties require stability or simplicity. Outside those frameworks (e.g., arbitrary unstable theories) non-forking may fail extension, symmetry, or behave pathologically.

Semantic Tension

Competes with other independence notions (algebraic independence, linear independence, thorn-forking, Kim-forking): each captures different intuition and technical constraints; choosing one trades generality for desirable axioms.

Synthesis

Forking independence is the model-theoretic formalization of when a parameter set adds no new dividing information relative to a base: via automorphism invariance and the extension/symmetry axioms it organizes types into a usable independence calculus central to classification theory.