MétaCan
Menu
Back to cohort
Record W2016130162 · doi:10.1081/agb-120014672

A SIMPLE EXAMPLE OF A NON-FINITELY BASED SYSTEM OF POLYNOMIAL IDENTITIES

2002· article· en· W2016130162 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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueCommunications in Algebra · 2002
Typearticle
Languageen
FieldMathematics
TopicAdvanced Topics in Algebra
Canadian institutionsUniversity of Manitoba
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMathematicsSimple (philosophy)PolynomialFinitely-generated abelian groupAssociative propertyField (mathematics)Prime (order theory)Pure mathematicsAlgebra over a fieldDiscrete mathematicsCombinatoricsMathematical analysis

Abstract

fetched live from OpenAlex

ABSTRACT A system of polynomial identities is called finitely based if it is equivalent to some finite system of polynomial identities. Every system of polynomial identities in associative algebras over a field of characteristic 0 is finitely based: this is a celebrated result of Kemer. The first non-finitely based systems of polynomial identities in associative algebras over a field of a prime characteristic have been constructed recently by Belov, Grishin and Shchigolev. These systems of identities are relatively complicated. In the present paper we construct a simpler example of such a system and give a simple self-contained proof of the fact that the system is non-finitely based.

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.001
Version: codex-gemma-dda1882f352aValidation 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: Empirical
Teacher disagreement score0.151
Threshold uncertainty score0.658

Codex and Gemma teacher scores by category

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

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.117
GPT teacher head0.345
Teacher spread0.227 · 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