MétaCan
Menu
Back to cohort
Record W2035397444 · doi:10.4153/cmb-2001-018-x

On Quantizing Nilpotent and Solvable Basic Algebras

2001· article· en· W2035397444 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueCanadian Mathematical Bulletin · 2001
Typearticle
Languageen
FieldMathematics
TopicAdvanced Topics in Algebra
Canadian institutionsnot available
Fundersnot available
KeywordsMathematicsPoisson algebraAlgebra over a fieldPoisson bracketCommutatorPure mathematicsCellular algebraUniversal enveloping algebraSubalgebraAlgebra representationLie conformal algebraLie algebra

Abstract

fetched live from OpenAlex

Abstract We prove an algebraic “no-go theorem” to the effect that a nontrivial Poisson algebra cannot be realized as an associative algebra with the commutator bracket. Using it, we show that there is an obstruction to quantizing the Poisson algebra of polynomials generated by a nilpotent basic algebra on a symplectic manifold. This result generalizes Groenewold’s famous theorem on the impossibility of quantizing the Poisson algebra of polynomials on R 2n . Finally, we explicitly construct a polynomial quantization of a symplectic manifold with a solvable basic algebra, thereby showing that the obstruction in the nilpotent case does not extend to the solvable case.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Insufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.143
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0110.005

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.039
GPT teacher head0.281
Teacher spread0.242 · 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