Decomposition theorem of Beilinson, Bernstein and Deligne
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 of relative dimension d between two projective varieties
Here is the fundamental class of a hyperplane section, is the direct image (pushforward) and is the n-th derived functor of the direct image. This derived functor measures the n-th cohomologies of , for . In fact, the particular case when Y is a point, amounts to the isomorphism
This hard Lefschetz isomorphism induces canonical isomorphisms
Moreover, the sheaves 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 between varieties. In a nutshell, the results above remain true when the notion of local systems is replaced by perverse sheaves.
References
- Wikipedia, Decomposition theorem of Beilinson, Bernstein and Deligne, the article this theorem comes from.
Source: Wikipedia
Progress summary
The decomposition theorem is an established result, with no credible recent challenge or new proof claim found.
The theorem extends hard Lefschetz from smooth proper maps to arbitrary proper maps by decomposing the derived direct image into shifted semisimple perverse sheaves. Its origins are associated with Gelfand and MacPherson; the theorem was proved by Beilinson, Bernstein, Deligne, and Gabber.
Known results
- For proper maps, decomposes into shifted semisimple perverse cohomology sheaves (Beilinson, Bernstein, Deligne, and Gabber).
- The summands further decompose into intersection complexes of semisimple local systems on strata.
- Later approaches use mixed Hodge modules (Saito) and geometric arguments based on semismall maps (de Cataldo and Migliorini).
- Applications include support theorems and constraints from higher discriminants.
Current status (as of November 2026): The decomposition theorem is settled; the retrieved sources record established proofs, formulations, and applications, with no credible counterexample or unresolved challenge.
Solutions 0
No solutions have been posted yet.