Minimal Model Program¶
A birational-classification program that follows canonical-divisor-negative extremal directions through contractions and flips, seeking a model with nef log canonical divisor or a Mori fiber-space endpoint while admitting only controlled singularities.
Core Idea¶
The minimal model program (MMP), also called the Mori program, is the organizing procedure for birationally classifying projective algebraic varieties by replacing a given variety or pair with a simpler birational model. Its directional instrument is the canonical divisor: for a log pair \((X,\Delta)\), the program examines the numerical behavior of \(K_X+\Delta\) on curves. If that divisor is nef, meaning \((K_X+\Delta)\cdot C\geq 0\) for every curve class \(C\), the pair has reached the minimal-model side of the program. If it is not nef, the cone theorem identifies a \((K_X+\Delta)\)-negative extremal ray, and the contraction theorem supplies a morphism that contracts exactly the curves in that direction.
Scope of Application¶
The home domain is birational algebraic geometry. The program classifies complex projective varieties and log pairs, studies Fano and general-type geometry, analyzes moduli spaces through their birational models, and structures questions about canonical rings and singularities. The language also extends to relative settings over a base, to MMP with scaling, and—under separate theorem packages—to some positive-characteristic, mixed-characteristic, and compact Kähler settings. Those extensions preserve the core roles but do not erase their different hypotheses.
Clarity¶
A compact recognition test is: What is the divisor that directs the process, what negative extremal ray is being contracted, which contraction case occurs, what singularity class is preserved, and which theorem licenses the next step or endpoint? If the answers are \(K_X+\Delta\), an extremal ray of the cone of curves, divisorial/small/fiber type, an explicit category such as Q-factorial klt pairs, and an applicable existence or termination result, the MMP is probably present.
Manages Complexity¶
Birational equivalence classes contain many varieties and many possible birational maps. Directly comparing all representatives would be intractable. The MMP compresses this search by turning the canonical divisor into a compass. Rather than enumerate arbitrary birational modifications, the geometer asks where \(K_X+\Delta\) is negative, uses the cone and contraction theorems to isolate a permitted extremal direction, and applies one of a small number of move types. This converts a sprawling classification problem into a controlled path through the cone of curves.
Abstract Reasoning¶
The MMP licenses a disciplined sequence of inferences:
- If \(K_X+\Delta\) is nef, no \((K_X+\Delta)\)-negative extremal contraction remains, so the run has reached the minimal-model criterion used by the program.
- If it is not nef and the cone/contraction hypotheses hold, a negative extremal ray supplies an admissible next direction; arbitrary contractions are not interchangeable with this one.
- If the contraction is divisorial, relative Picard number falls, so only finitely many such steps can occur in a fixed finite-rank setting.
- If it is small, the target generally fails to retain the divisor behavior needed to continue; a flip is the prescribed replacement, and flip existence must be established.
- If it is fiber type, the output is a Mori fiber space and the program has classified the input on the negative-canonical side rather than failed to find a minimal model.
- If different ray choices produce different minimal models, that nonuniqueness is compatible with the program; one studies their relation, often through flops, instead of declaring one run incorrect.
- If a proposed generalization changes the canonical divisor, singularity category, or permitted surgery, its theorems must be re-established rather than inherited by vocabulary.
Knowledge Transfer¶
The exact mechanism transfers within algebraic geometry. For surfaces, threefolds, log pairs, relative morphisms, and selected characteristic regimes, researchers map the same roles—log canonical divisor, negative ray, contraction type, singularity control, endpoint—onto different theorem packages. MMP with scaling adds an auxiliary ample divisor and varies a scaling parameter so that the next wall or extremal ray becomes controlled, but it remains an MMP because the canonical-divisor-directed contraction logic persists.
Relationships to Other Abstractions¶
Current abstraction Minimal Model Program Domain-specific
Parents (1) — more general patterns this builds on
-
Minimal Model Program presupposes Transformation Prime
The Minimal Model Program presupposes Transformation: every contraction or flip is a rule-governed geometric replacement with explicit invariants and permitted changes.
Hierarchy path (1) — routes to 1 parentless root
- Minimal Model Program → Transformation → Function (Mapping)
Neighborhood in Abstraction Space¶
Minimal Model Program sits in a sparse region of the domain-specific corpus (84th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (1565 abstractions)
Nearest neighbors
- Seshadri Constant — 0.82
- Castelnuovo–Mumford Regularity — 0.81
- Euler sequence — 0.81
- Alexander Duality — 0.80
- Flat Vector Bundle — 0.79
Computed from structural-signature embeddings · 2026-09-08