MétaCan
Menu
Back to cohort
Record W3103424700

A categorification of Morelli’s theorem

2016· article· en· W3103424700 on OpenAlexfundno aff
Bohan Fang, Chiu-Chu Melissa Liu, David Treumann, Eric Zaslow

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldMathematics
TopicAlgebraic structures and combinatorial models
Canadian institutionsnot available
FundersPacific Institute for the Mathematical SciencesNational Science Foundation
KeywordsMathematicsCategorificationTensor productCoherent sheafToric varietyDerived categoryPure mathematicsTriangulated categoryEquivariant mapProduct (mathematics)CohomologyCombinatoricsAlgebra over a fieldGeometryFunctor
DOInot available

Abstract

fetched live from OpenAlex

We prove a theorem relating torus-equivariant coherent sheaves on toric varieties to polyhedrally-constructible sheaves on a vector space. At the level of K-theory, the theorem recovers Morelli's description of the K-theory of a smooth projective toric variety. Specifically, let $X$ be a proper toric variety of dimension $n$ and let $M_\bR = \mathrm{Lie}(T_\bR^\vee)\cong \bR^n$ be the Lie algebra of the compact dual (real) torus $T_\bR^\vee\cong U(1)^n$. Then there is a corresponding conical Lagrangian $\Lambda \subset T^*M_\bR$ and an equivalence of triangulated dg categories $\Perf_T(X) \cong \Sh_{cc}(M_\bR;\Lambda),$ where $\Perf_T(X)$ is the triangulated dg category of perfect complexes of torus-equivariant coherent sheaves on $X$ and $\Sh_{cc}(M_\bR;\Lambda)$ is the triangulated dg category of complex of sheaves on $M_\bR$ with compactly supported, constructible cohomology whose singular support lies in $\Lambda$. This equivalence is monoidal---it intertwines the tensor product of coherent sheaves on $X$ with the convolution product of constructible sheaves on $M_\bR$.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.016
Threshold uncertainty score0.052

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.001
Science and technology studies0.0020.004
Scholarly communication0.0030.009
Open science0.0010.004
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0160.002

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.036
GPT teacher head0.290
Teacher spread0.254 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations49
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicAlgebraic structures and combinatorial modelsFrench-language works237,207