CACrown ArchivesThe cinema collection
Menu
Research dossier · General Reference

Decomposition theorem of Beilinson, Bernstein and Deligne

set of results concerning the cohomology of algebraic varieties

Cross-disciplinary reference desk with index cards, atlas, dictionary and catalogue
General referenceInterpretive dossier study · Crown Archives visual atlas
Record originEnglish Wikipedia
Text licenseCC BY-SA 4.0
Source revisionMay 24, 2026
Entity authorityQ25345219 ↗
Source-derived summary

In mathematics, especially algebraic geometry, the decomposition theorem of Beilinson, Bernstein, Deligne and Gabber or BBDG decomposition theorem is a set of results concerning the cohomology of algebraic varieties. It was originally conjectured by Gelfand and MacPherson.

Statement

Decomposition for smooth proper maps

The first case of the decomposition theorem arises via the hard Lefschetz theorem which gives isomorphisms, for a smooth proper map

f

:

X

→

Y

{\displaystyle f:X\to Y}

of relative dimension d between two projective varieties

−

∪

η

i

:

R

d

−

i

f

∗

(

Q

)

→

≅

R

d

+

i

f

∗

(

Q

)

.

{\displaystyle -\cup \eta ^{i}:R^{d-i}f_{*}(\mathbb {Q} ){\stackrel {\cong }{\to }}R^{d+i}f_{*}(\mathbb {Q} ).}

Here

η

{\displaystyle \eta }

is the fundamental class of a hyperplane section,

f

∗

{\displaystyle f_{*}}

is the direct image (pushforward) and

R

n

f

∗

{\displaystyle R^{n}f_{*}}

is the n-th derived functor of the direct image. This derived functor measures the n-th cohomologies of

f

−

1

(

U

)

{\displaystyle f^{-1}(U)}

, for

U

⊂

Y

{\displaystyle U\subset Y}

.

In fact, the particular case when Y is a point, amounts to the isomorphism

−

∪

η

i

:

H

d

−

i

(

X

,

Q

)

→

≅

H

d

+

i

(

X

,

Q

)

.

{\displaystyle -\cup \eta ^{i}:H^{d-i}(X,\mathbb {Q} ){\stackrel {\cong }{\to }}H^{d+i}(X,\mathbb {Q} ).}

This hard Lefschetz isomorphism induces canonical isomorphisms

R

f

∗

(

Q

)

→

≅

⨁

i

=

−

d

d

R

d

+

i

f

∗

(

Q

)

[

−

d

−

i

]

.

{\displaystyle Rf_{*}(\mathbb {Q} ){\stackrel {\cong }{\to }}\bigoplus _{i=-d}^{d}R^{d+i}f_{*}(\mathbb {Q} )[-d-i].}

Moreover, the sheaves

R

d

+

i

f

∗

Q

{\displaystyle R^{d+i}f_{*}\mathbb {Q} }

appearing in this decomposition are local systems, i.e., locally free sheaves of Q-vector spaces, which are moreover semisimple, i.e., a direct sum of local systems without nontrivial local subsystems.

Decomposition for proper maps

The decomposition theorem generalizes this fact to the case of a proper, but not necessarily smooth map

f

:

X

→

Y

{\displaystyle f:X\to Y}

between varieties. In a nutshell, the results above remain true when the notion of local systems is replaced by perverse sheaves.

Editorial summary

This brief starts where responsible research should: with the source description of “Decomposition theorem of Beilinson, Bernstein and Deligne” as set of results concerning the cohomology of algebraic varieties. Everything that follows is an evidence route, not borrowed authority.

Editorial reviewA practical starting point whose main value is the path it opens into stronger specialist and primary sources. The current 371-word lead offers orientation but no explicit four-digit date, so chronology should not be assumed. The selected authority fields contribute no independent date. The account is most persuasive where Decomposition, theorem and Beilinson can be independently traced.
Editorial analysis

Why this record matters

The subject matters to the general reference register because the source frames it as set of results concerning the cohomology of algebraic varieties. Its deeper value depends on whether names, dates, institutions and citations support that framing.

Evidence profile

Named sources, stable identifiers and responsible institutions provide the strongest route from overview to verifiable evidence. The source revision retrieved here is dated May 24, 2026. The linked authority identifier is Q25345219. None of the 0 selected statements returned an explicit reference.

Critical limits

Overview language is designed for orientation and should not be treated as a substitute for the evidence cited beneath it. The lead is largely declarative, so disagreement and counter-evidence require a deliberate search beyond the opening account. Authority statements aid reconciliation but still require their own references, qualifiers and ranks to be checked.

How to read it

Use the entry as an orientation point, then follow its citations and revision history. Names, dates and institutional relationships should be checked against the original record.

Best used for
  • Subject orientation
  • Search vocabulary
  • Locating named sources
Verify next

The closest primary source, responsible institution and strongest cited specialist reference.

Three-step research path

  1. Establish the record: confirm the title “Decomposition theorem of Beilinson, Bernstein and Deligne”, its source revision and the description used here.
  2. Expand the search: follow Decomposition theorem of Beilinson, Bernstein and Deligne primary sources, Decomposition theorem of Beilinson, Bernstein and Deligne archive and Decomposition research across catalogues and specialist indexes.
  3. Test the account: compare the strongest cited source with the responsible institution’s current record and note any disagreement.

Questions for further research

  1. Which source most directly establishes the central claim about “Decomposition theorem of Beilinson, Bernstein and Deligne”?
  2. Which institution is responsible for the underlying evidence?
  3. Which cited source is closest to the event, object or claim?
Subject index

Search terms from this dossier

Source & attribution

This entry incorporates text from “Decomposition theorem of Beilinson, Bernstein and Deligne” on English Wikipedia. Contributors are listed in the page history. Text is available under the Creative Commons Attribution-ShareAlike 4.0 License. Selected authority identifiers and statements are retrieved from Wikidata under CC0; their references and qualifiers remain part of the verification path.