Behrend function¶

An intrinsic integer-valued constructible weight on a complex scheme whose Euler integral can recover suitable virtual counts.

Version: v1 · 2026-09-28 · History
Domain-specific #: 8154
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Algebraic Geometry and Moduli → Mathematics
Aliases: Behrend constructible function, Ν X function

Core Idea¶

The Behrend function ν_X assigns an intrinsic integer weight to points of a complex algebraic scheme X. It is constructible: the scheme can be stratified so the weight is constant on suitable pieces, allowing an Euler-characteristic sum over its level sets. The weights are not selected to make a target number come out right. Behrend constructs them from a signed cycle attached to the intrinsic normal cone, then applies a local Euler-obstruction operation. This makes ν_X sensitive to the scheme's singularity structure rather than simply counting geometric points.

For a smooth pure-dimensional scheme the function has the familiar sign (-1)^dimension, but singular cases need not be constant. Its major use is a theorem with conditions, not a definitional equality for all spaces: if an appropriate proper scheme carries a symmetric obstruction theory, the virtual fundamental class has degree equal to χ(X,ν_X). That connection turns a virtual Donaldson–Thomas count into a weighted Euler characteristic of a moduli scheme. The function itself is defined more broadly than that theorem's virtual-count setting. It is not a generic constructible function and is unrelated to the identically named resource-constructible function in computational complexity.

How would you explain it like I'm…

No faithful explanation at this level. All three generators agree any child-level picture reduces to counting points or giving spots a chosen score to hit a total, both explicitly ruled out: the weights are intrinsic, built from singularity structure, and summed as a weighted Euler characteristic.

Weights for Crinkly Spots

In some advanced geometry, mathematicians study shapes that can have pinched or crumpled spots. The Behrend function gives every point of such a shape a whole-number weight that is worked out from the shape itself, especially from how crumpled it is near that point. On smooth, nice parts the weight is just plus one or minus one, depending on the shape's dimension. Adding up the weights in a certain careful way gives a special count, which in some important situations matches a much harder count that mathematicians care about.

Singularity-Sensitive Point Weights

The Behrend function is a rule that assigns an integer weight to every point of a complex algebraic scheme, a kind of geometric space studied in algebraic geometry that can have singular points. The weights aren't chosen to make an answer come out; Behrend builds them from the scheme's own local structure, so they reflect how singular it is near each point. For a smooth scheme of dimension d, the weight is (-1)^d everywhere, but at singular points it can vary. The function is constructible, meaning the space splits into pieces where the weight is constant, so you can form a weighted Euler characteristic, a sort of weighted topological count. Its famous use is a theorem: under specific conditions, a hard 'virtual' count from Donaldson-Thomas theory equals this weighted count.

The Behrend function ν_X is an integer-valued constructible function intrinsically attached to a complex algebraic scheme X. Constructibility means X admits a stratification on whose pieces ν_X is constant, so the weighted Euler characteristic χ(X, ν_X), a sum of Euler characteristics of level sets weighted by their values, is defined. Behrend constructs ν_X from a signed cycle associated with the intrinsic normal cone of X, to which a local Euler obstruction operation is applied; the weights therefore encode the singularity structure of X rather than counting geometric points. For X smooth of pure dimension n, ν_X is the constant (−1)^n, while on singular schemes it need not be constant. The central theorem is conditional: if X is proper and carries a symmetric obstruction theory, the degree of the virtual fundamental class equals χ(X, ν_X). This expresses virtual Donaldson–Thomas counts as weighted Euler characteristics of moduli schemes, though ν_X is defined more generally than that setting. It is a specific intrinsic function, not an arbitrary constructible function, and has nothing to do with the similarly named construction in computational complexity.

Scope of Application¶

These uses depend on intrinsic complex-scheme weights and, for virtual counts, extra theorem hypotheses.

Donaldson–Thomas theory. Translate suitable virtual counts into ν-weighted Euler characteristics.
Moduli-space analysis. Track singularity-sensitive local contributions across strata.
Smooth benchmark. Check the (-1)^dimension sign as a limiting case.
Theorem audit. Separate existence of ν_X from hypotheses for equality with virtual degree.

Clarity¶

The function ν_X is a canonical integer weight determined by complex scheme X, not an arbitrary constructible label. The nearest miss is another integer-valued constructible function whose weighted Euler sum may exist but lacks the intrinsic normal-cone construction. Smooth dimension d gives the sign (-1)^d; singularities can change it. Equating the weighted sum with virtual degree requires the cited proper symmetric-obstruction setting, not merely existence of ν_X.

Manages Complexity¶

The name compresses intrinsic normal-cone geometry, local Euler obstruction, constructible strata, Euler integration, and virtual-cycle theory. Separating the function from the conditional theorem prevents a smooth sign rule from being treated as the whole construction or a moduli-space count from being applied without properness. It also explains why singular scheme structure, not merely the set of geometric points, matters.

Abstract Reasoning¶

Fix the complex scheme and distinguish its scheme structure from its point set.
Identify the canonical ν_X derived from the signed intrinsic normal cone and Euler obstruction.
Organize the constructible weight by integer level strata.
Form the weighted Euler characteristic when the stated Euler theory is available.
Check properness and symmetric obstruction theory before equating that sum with virtual degree.

Knowledge Transfer¶

The intrinsic-weight/weighted-Euler method transfers among suitable complex moduli schemes when the scheme structure and theorem conditions are re-established. A smooth sign value does not transfer to a singular moduli space; a stable-sheaf Donaldson–Thomas result does not automatically extend to an open stack or arbitrary obstruction theory. The term 'constructible' in computational complexity carries none of this local algebraic-geometric meaning.

Relationships to Other Abstractions¶

Current abstraction Behrend function Domain-specific

Parents (1) — more general patterns this builds on

Behrend function is a kind of Representation Prime

Behrend's function maps selected intrinsic scheme geometry to interpretable integer weights for Euler integration.

Hierarchy path (1) — routes to 1 parentless root

Behrend function → Representation → Abstraction

Neighborhood in Abstraction Space¶

Behrend function sits in a moderately populated region (49^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Algebraic Varieties & Topological Invariants (27 abstractions)

Nearest neighbors

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