Skip to content

Degree of an algebraic variety

The multiplicity-counted number of intersections between an embedded algebraic variety and a general complementary-dimensional linear subspace.

Version
v1 · 2026-09-28 · History
Domain-specific #
8896
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
Algebraic Geometry → Mathematics

Core Idea

The degree of an algebraic variety measures how many points remain after a generic linear slice reduces the embedded variety to dimension zero. If V has dimension d in projective n-space, intersect it with a general linear subspace of codimension d and sum the resulting points with intersection multiplicity. Affine degree is handled through projective closure so points at infinity are not lost.

Degree is extrinsic: it belongs to a chosen embedding. For hypersurfaces it recovers polynomial degree, while proper transverse intersections exhibit the multiplicative pattern of Bézout's theorem. The same invariant appears algebraically in the leading growth of the Hilbert function or the Hilbert-series numerator and can be computed from defining ideals.

How would you explain it like I'm…

Count the Poke-Throughs

Draw a curvy shape, like a circle, and slice it with a straight line in an ordinary, not-special way. Count where the line pokes through. For a circle you get 2 spots, and that count is what mathematicians call the shape's degree. (Mathematicians have a careful way to count hidden spots too, so the number doesn't change with the line.)

Counting Every Slice Point

Mathematicians describe some curves with equations, like a circle or a parabola. To find the degree, you slice the curve with a straight line tilted in a typical way and count the meeting points. There is a catch: they count hidden meeting points too, ones that need imaginary numbers or that happen 'at infinity,' and a place where the line just touches counts twice. With all of those counted, a circle always gives 2, and the number stays the same for almost every line you choose.

Generic Slice Point Count

The degree of an algebraic variety measures how many points you get when you slice it down to single points with a generic flat slice. For a curve in the plane, you intersect with a general line; for a surface in 3D space, with a general line too, because you need to cut away two dimensions. The count includes complex points, points at infinity (which is why mathematicians work in projective space), and multiplicities for tangencies. For a curve defined by one polynomial, the degree is simply the polynomial's degree. Degree depends on how the variety sits in its space, not only on its shape, and when two curves meet properly, the number of intersection points is the product of their degrees (Bézout's theorem).

 

Let V be a variety of dimension d embedded in projective space ℙⁿ. Intersect V with a general linear subspace of codimension d; the intersection is zero-dimensional, and the Degree of an algebraic variety is the number of resulting points counted with intersection multiplicity. Genericity matters, since special slices can be tangent or pass through bad loci. For affine varieties one uses the projective closure so points at infinity are included. Degree is extrinsic: it depends on the chosen embedding, not only on V as an abstract variety. For a hypersurface it recovers the degree of the defining polynomial, and for proper, transverse intersections degrees multiply, as in Bézout's theorem. Algebraically, the same number appears as the leading growth of the Hilbert function (the leading coefficient of the Hilbert polynomial times d!) or via the numerator of the Hilbert series, so it can be computed directly from a defining ideal.

Structural Signature

Sig role-phrases:

  • embedded variety — fixes the geometric object together with its realization in affine or projective space It is essential. Counterfactual: The abstract variety alone need not have one degree.
  • complementary linear subspace — reduces a d-dimensional variety to a zero-dimensional intersection It is essential. Counterfactual: Wrong codimension leaves a positive-dimensional set or generically no intersection.
  • general position — avoids special incidence that changes raw intersection behavior It is essential. Counterfactual: A tangent or containing subspace can give misleading counts.
  • intersection multiplicity — counts tangency and nonreduced contributions algebraically It is essential. Counterfactual: Counting only distinct points breaks deformation stability and Bézout relations.
  • projective closure — accounts for affine intersections escaping to infinity It is essential for affine case. Counterfactual: Ignoring infinity can make degree depend on a special affine slice.
  • coordinate ring — provides Hilbert-series and ideal-based computational access It is characteristic. Counterfactual: Geometry and algebra would otherwise appear as unrelated definitions.

What It Is Not

  • It is not the dimension of the variety.
  • It is not intrinsic to an abstract variety without an embedding.
  • It is not always the number of distinct visible intersection points.
  • It is not the largest exponent occurring in any arbitrary generating equation.
  • Closest near-miss. For a hypersurface the invariant coincides with defining polynomial degree, but this shortcut does not define arbitrary higher-codimension varieties.

Scope of Application

  • Intersection theory. Complementary slices yield multiplicity-weighted counts.
  • Projective geometry. Degree measures embedded complexity.
  • Computational algebra. Gröbner bases and Hilbert series compute degree.
  • Enumerative geometry. Generic incidence counts use degree as a basic invariant.

Clarity

State base field, affine or projective setting, embedding, dimension, projective closure, slice codimension, general-position condition, and multiplicity convention. Distinguish degree of variety, map, line bundle, and defining polynomial.

Manages Complexity

Degree compresses a high-dimensional embedded object into one stable integer. Its power comes from algebraic multiplicity, which preserves counts when intersections merge. The compression hides singularities, components, and embedding details that other invariants must recover.

Abstract Reasoning

  1. Fix the variety and its embedding.
  2. Determine dimension and complementary linear-subspace codimension.
  3. Pass to projective closure if beginning affine.
  4. Choose a general slice yielding a finite intersection.
  5. Compute local intersection multiplicities.
  6. Sum them over all points, including infinity.
  7. Cross-check through Hilbert polynomial, Hilbert series, or defining ideal.

Knowledge Transfer

Generic-slice counting transfers among embedded algebraic sets and supports Bézout-style reasoning. The numerical degree does not transfer across embeddings without tracking the polarization. The cargo is stable multiplicity-weighted intersection count.

Examples

Applied / In Practice

A projective plane curve defined by a square-free homogeneous polynomial of degree m meets a general line in m points counted with multiplicity.

Mapped back: slice → A line has complementary codimension one.; multiplicity → Tangencies preserve the total count..

Applied / In Practice

A projective line embedded by a degree-n map has image degree n rather than the degree of its standard linear embedding.

Mapped back: extrinsic nature → The abstract source is unchanged while the embedding changes..

Applied / In Practice

A special line contained in a surface produces infinitely many intersection points.

Mapped back: boundary → The slice is not general and the intersection is not zero-dimensional..

Structural Tensions

T1 — Geometric Count versus Scheme-Theoretic Multiplicity. Visible distinct points can merge under specialization while algebraic degree should remain stable.

Diagnostic: Use intersection multiplicities or Hilbert data rather than naive point count.

T2 — Intrinsic Object versus Extrinsic Embedding. Isomorphic varieties can have different degrees under different projective realizations.

Diagnostic: Attach the embedding or polarizing line bundle to every degree claim.

Structural–Framed Character

Embedding, slice, and multiplicity are structural; 'general' is a geometric condition expressed relative to a parameter space. A simple integer can be canonical for an embedding while remaining nonintrinsic to the abstract variety.

Structural Core vs. Domain Accent

The skeleton is complexity measured by generic complementary probing. Algebraic geometry supplies varieties, projective closure, multiplicity, Hilbert growth, and line bundles. Those commitments define degree here.

  • Approved root. Frozen DAG placement is unparented.

  • Related — Bézout's theorem, Hilbert polynomial, and intersection multiplicity. They provide its product law, algebraic computation, and stable counting rule.

Neighborhood in Abstraction Space

Degree of an algebraic variety sits in a crowded region of the domain-specific corpus (36th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Algebraic Varieties & Topological Invariants (27 abstractions)

Nearest neighbors

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

Not to Be Confused With

  • Dimension. Tell: Counts independent parameters rather than generic intersections.
  • Polynomial degree. Tell: Coincides for a hypersurface but not by itself for every variety.
  • Field extension degree. Tell: Is an arithmetic invariant of fields.
  • Topological degree. Tell: Counts preimages with orientation for maps, under a different framework.

References

  • Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Degree_of_an_algebraic_variety (revision 1260611582).

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.