Complete intersection¶

A scheme or variety whose defining ideal is locally generated by exactly its codimension number of elements, giving the expected minimal equation count.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3792
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Algebraic Geometry → Mathematics

Core Idea¶

A closed subscheme is a local complete intersection when its ideal sheaf is locally generated by a regular sequence of length equal to codimension; affine or projective global complete intersections impose a global equation presentation.^[1] A regular sequence cuts dimension by one at each non-zero-divisor equation, making the conormal module and homological invariants behave as for a transverse equation set even when singularities occur. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of algebraic geometry. It is the domain-specific identity determined by the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test. This gives the entry an operational identity rather than merely a historical label.

A useful analysis keeps three layers separate. The constitutive layer says what must be true: the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension. The evidential layer asks what observation or proof warrants the claim: type the carrier, state every parameter and convention in the definition, test that the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. The use layer asks what reasoning becomes available once the identity is established: recognizing and comparing instances of Complete intersection, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Conflating the layers is the most common source of scope inflation.

How would you explain it like I'm…

No Wasted Cuts

Imagine a big room. One rule, like 'stay on the floor,' squishes you from the whole room onto a flat floor. A second rule, like 'stay against the wall,' squishes you onto the line where the floor meets the wall. A complete intersection is a shape you get from exactly as many rules as the directions you lose, where every rule actually does its job and none is wasted.

One Equation per Lost Dimension

In algebraic geometry, shapes are described by equations: the shape is the set of points where the equations are true. Each good equation should cut the shape down by one dimension, like a flat wall slicing a solid into a surface. A complete intersection is a shape that is cut out by exactly as many equations as the number of dimensions it loses, where every equation really does its job and none is wasted. For example, a curve in 3D space made by two surfaces crossing properly loses two dimensions using exactly two equations. This can still be true even when the shape has sharp or pinched spots.

Codimension-Many Regular Equations

In algebraic geometry, a shape (a variety or scheme) is cut out of a bigger space by equations. The codimension is how many dimensions the shape loses compared with the surrounding space. A complete intersection is a shape defined by exactly codimension-many equations that form a regular sequence: each new equation is a non-zero-divisor on what the earlier ones left, so it really cuts the dimension by one. A local complete intersection only needs this to hold near each point, while a global complete intersection (in affine or projective space) asks for one set of equations that works everywhere. Having the right number of equations isn't enough on its own if they fail to be regular. Complete intersections can be singular, but they still behave algebraically like a set of transverse equations, which makes many of their invariants easy to compute.

A closed subscheme is a local complete intersection when its ideal sheaf is locally generated by a regular sequence whose length equals the codimension. A regular sequence is one in which each element is a non-zero-divisor modulo the previous ones, so each equation cuts the dimension by exactly one. A global complete intersection in affine or projective space is one presented by such a sequence of global equations. The payoff is that the conormal module and homological invariants behave just as they would for a transverse set of equations, even when the subscheme has singularities. Establishing the property requires stating the ambient space, whether the convention is local or global, the codimension, the generating sequence, and checking regularity, so that the equation count equals the codimension. A subscheme that needs more generators than its codimension does not qualify.

Structural Signature¶

Carrier: the typed algebraic geometry carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets
Inputs or antecedent state: the exact algebraic geometry carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Complete intersection
Constitutive operation: A regular sequence cuts dimension by one at each non-zero-divisor equation, making the conormal module and homological invariants behave as for a transverse equation set even when singularities occur.
Invariant: the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension
Recognition test: type the carrier, state every parameter and convention in the definition, test that the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases
Output or consequence: recognizing and comparing instances of Complete intersection, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions
Failure boundary: the carrier is mistyped, the condition that the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test

What It Is Not¶

It is not the whole field of algebraic geometry. The field contains many questions and methods that do not instantiate Complete intersection.
It is not its most familiar example. A canonical instance directly demonstrates that the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension. exhibits the structure, but the example is evidence for the abstraction rather than its definition.
It is not the neighboring catalog concept Set-theoretic complete intersection. Set-theoretic equality needs only the same underlying zero set; a scheme-theoretic complete intersection requires the ideal structure and regular-sequence condition.
It is not a claim that every boundary case has one uncontested classification. a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Complete intersection must control the decision
It is not an unrestricted metaphor for any process that seems similar. Outside algebraic geometry, the vocabulary and validity conditions do not transfer literally.

Scope of Application¶

Complete intersection belongs to algebraic geometry and is useful where the analyst can specify the typed algebraic geometry carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension. The scope is broad within that domain but bounded by the need for the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.^[n1]

Definition and recognition. Determine whether a proposed instance satisfies the constitutive conditions rather than merely sharing terminology.
Construction or evolution. Track how the exact algebraic geometry carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Complete intersection are converted, constrained, or organized by A regular sequence cuts dimension by one at each non-zero-divisor equation, making the conormal module and homological invariants behave as for a transverse equation set even when singularities occur..
Comparison. Compare instances using carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior, without treating convenience measures as the definition.
Boundary analysis. Diagnose cases where a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Complete intersection must control the decision and state which convention or theorem controls the decision.
Downstream reasoning. Use the established identity to support recognizing and comparing instances of Complete intersection, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions while preserving the assumptions under which the inference is valid.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Complete intersection can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated. The disciplined statement is: given the exact algebraic geometry carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Complete intersection, the structure counts as Complete intersection exactly when the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension.

This format also separates identity from measurement. Empirical, computational, or documentary proxies support recognition only under declared validity and uncertainty assumptions; formal cases require proof rather than measurement. Measurements can be noisy, implementations can approximate, and proofs can use equivalent characterizations; none of those facts licenses changing the object being measured. When reports disagree, first check scope and convention, then data or proof, and only then interpret the disagreement as substantive.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Complete intersection. Complete intersection compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

The compression has a price. A single label can hide canonical, generalized, restricted, approximate, computational, empirical, and historically variant formulations of Complete intersection. Good use therefore carries a small declaration of assumptions alongside the name. The abstraction manages complexity when it reduces the state space of the question while keeping the failure boundary visible; it mismanages complexity when the label substitutes for that boundary analysis.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed algebraic geometry carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension independently of one notation or implementation. This step prevents the canonical example from becoming the definition.
Derive consequences. From the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension, infer recognizing and comparing instances of Complete intersection, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Record each assumption used so that a later change of setting does not silently preserve an invalid conclusion.
Test adversarial cases. Examine a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Complete intersection must control the decision and an object that resembles Complete intersection in purpose or vocabulary but does not satisfy its invariant is outside the class. A robust identity explains why the first is convention-sensitive and why the second is outside the class.
Compare and refine. Use carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior to compare legitimate instances, and refine the model when discrepancies reflect hidden variation rather than failure of the abstraction itself.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of algebraic geometry because they reuse the typed algebraic geometry carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, A regular sequence cuts dimension by one at each non-zero-divisor equation, making the conormal module and homological invariants behave as for a transverse equation set even when singularities occur., and type the carrier, state every parameter and convention in the definition, test that the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. A theorem, diagnostic, or modeling warning can travel when those roles remain literal. For example, the distinction between constitutive identity and a convenient observable transfers from A canonical instance directly demonstrates that the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension. to An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation..^[2]

Transfer outside the home domain is weaker. The skeletal pattern—type the carrier, apply the defining mechanism of Complete intersection, preserve its invariant, and derive only consequences licensed by the stated boundary—may suggest an analogy, but the domain-specific mechanisms, admissible evidence, and consequences do not come along automatically. The safe transfer procedure maps each role explicitly, checks the invariant again, and refuses the name when only a superficial resemblance remains.

Examples¶

Canonical¶

A canonical instance directly demonstrates that the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension. The example exposes the carrier and directly tests that the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension; changing incidental notation preserves the identity, while removing that condition destroys it. This example is canonical because every role can be inspected: the carrier is the typed algebraic geometry carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets; the operative rule is A regular sequence cuts dimension by one at each non-zero-divisor equation, making the conormal module and homological invariants behave as for a transverse equation set even when singularities occur.; the invariant is the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension; and the result supports recognizing and comparing instances of Complete intersection, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions.^[1] Changing incidental notation or scale leaves the structure intact, while removing the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension destroys the classification.

Mapped back: the typed algebraic geometry carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets → A regular sequence cuts dimension by one at each non-zero-divisor equation, making the conormal module and homological invariants behave as for a transverse equation set even when singularities occur. → the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension → recognizing and comparing instances of Complete intersection, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions

Applied / In Practice¶

An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation. The applied case qualifies only because the same invariant and boundary test remain literal under changed parameters or implementation. The applied case is not licensed merely by vocabulary. It qualifies because the same recognition test—type the carrier, state every parameter and convention in the definition, test that the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases—can be run and because the same failure boundary—the carrier is mistyped, the condition that the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test—remains meaningful.^[n1] The case also shows why practical outputs should report assumptions, resolution, and uncertainty instead of a naked label.

Mapped back: declared instance → recognition test → boundary check → qualified use

Structural Tensions¶

T1: Axiomatic identity vs. operational recognition. The defining conditions may be exact while empirical or computational recognition is approximate. Neither pole can be removed without changing the analytical task. Diagnostic: Can the reviewer state both the exact condition and the evidence used to infer it?
T2: Local roles vs. global consequence. The mechanism is enacted through local relations, but the abstraction is usually valued for a global classification or prediction. Neither pole can be removed without changing the analytical task. Diagnostic: Does the claimed global result actually follow from the declared local conditions?
T3: Ideal form vs. finite representation. Theory states a clean invariant while data structures, measurements, or proofs expose only finite representations. Neither pole can be removed without changing the analytical task. Diagnostic: Would increasing resolution converge toward the same classification?
T4: Canonical convention vs. legitimate variants. A standard formulation supports communication, while variants may preserve the same core under changed assumptions. Neither pole can be removed without changing the analytical task. Diagnostic: Which role is invariant across variants, and which convention-specific conclusion changes?
T5: Compression vs. hidden assumptions. The name compresses a complex argument but can conceal prerequisites. Neither pole can be removed without changing the analytical task. Diagnostic: Can each downstream inference be traced to an explicit assumption?
T6: Autonomous residual vs. reduction to catalog neighbors. The candidate uses broader structures but adds an identity-bearing residual. Neither pole can be removed without changing the analytical task. Diagnostic: After subtracting the proposed parent and named neighbors, does the constitutive residual still support independent diagnostics?

Structural–Framed Character¶

The entry is structurally mixed but domain-framed. Its portable skeleton is type the carrier, apply the defining mechanism of Complete intersection, preserve its invariant, and derive only consequences licensed by the stated boundary. Its identity-bearing terms—Complete intersection, carrier, parameter, invariant, boundary, evidence, model, transformation, and application—derive their meaning from algebraic geometry and cannot be replaced by generic systems language without losing the tests that distinguish valid from invalid instances.

This mixed character explains why the abstraction is reusable inside the domain yet does not meet the Prime bar. The structure organizes reasoning, but its claims still depend on domain-specific objects, evidence, and intervention semantics.

Structural Core vs. Domain Accent¶

The structural core consists of a carrier, A regular sequence cuts dimension by one at each non-zero-divisor equation, making the conormal module and homological invariants behave as for a transverse equation set even when singularities occur., a recognition invariant, and a consequence. That skeleton may resemble patterns elsewhere, especially type the carrier, apply the defining mechanism of Complete intersection, preserve its invariant, and derive only consequences licensed by the stated boundary. The domain accent is not decorative: Complete intersection, carrier, parameter, invariant, boundary, evidence, model, transformation, and application determine what counts as an admissible carrier, a valid transition, and successful evidence.

The abstraction therefore remains domain-specific. A cross-domain reuse that preserves only words such as 'balance,' 'cut,' 'sequence,' 'loss,' or 'simulation' is metaphor. Literal transfer requires the original role structure and diagnostics, which in this case remain anchored in algebraic geometry.

This entry is a kind of Constraint.

It remains its own entry because its identity requires the ambient space, the local or global convention, the codimension, the generator sequence, and the regularity condition to agree so that the equation count equals codimension.

Relationships to Other Abstractions¶

Current abstraction Complete intersection Domain-specific

Parents (1) — outgoing typed relations

Complete intersection is a kind of Constraint Prime

What makes it its own entry: the domain-specific identity determined by the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension.

Hierarchy path (1) — routes to 1 parentless root

Complete intersection → is a kind of Constraint

Neighborhood in Abstraction Space¶

Complete intersection sits in a crowded region of the domain-specific corpus (1^st percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Schemes, Varieties & Moduli Spaces (41 abstractions)

Nearest neighbors

Degeneration (algebraic geometry) — 0.94
Ran space — 0.94
Morphism of algebraic varieties — 0.94
Ruled join — 0.94
Curve — 0.94

Computed from structural-signature embeddings · 2026-10-25

Not to Be Confused With¶

Set-theoretic complete intersection. Set-theoretic equality needs only the same underlying zero set; a scheme-theoretic complete intersection requires the ideal structure and regular-sequence condition.
One canonical example. An instance demonstrates the structure but does not define the whole abstraction.
Measurement or implementation of Complete intersection. A proxy or realization is evidence for the abstraction, not the abstraction itself.
Generalized Complete intersection. An extension qualifies only when its changed axioms and retained invariant are stated.

Notes¶

[n1] Tristan Hübsch, 'Calabi-Yau Manifolds, A Bestiary for Physicists', World Scientific. ↩a ↩b

References¶

[1] Joe Harris, 'Algebraic Geometry, A First Course', [[Springer Science+Business Media, 1992.not authoritative registry ↩a ↩b

[2] E. J. N Looijenga, 'Isolated singular points on complete intersections', Cambridge University Press, 1984, doi:10.1017/CBO9780511662720. registry ↩