MétaCan
Menu
Back to cohort
Record W1996089728 · doi:10.4153/cmb-2005-005-9

Injectivity of the Connecting Maps in AH Inductive Limit Systems

2005· article· en· W1996089728 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.
venuePublished in a venue whose home country is Canada.

Bibliographic record

VenueCanadian Mathematical Bulletin · 2005
Typearticle
Languageen
FieldMathematics
TopicAdvanced Operator Algebra Research
Canadian institutionsUniversity of Toronto
FundersArmy Research OfficeDeutscher Akademischer AustauschdienstNational Science Foundation
KeywordsMathematicsDirect limitInjective functionLimit (mathematics)Projection (relational algebra)Simple (philosophy)Metrization theoremSimplicial complexInverse limitCombinatoricsPure mathematicsDiscrete mathematicsMathematical analysisAlgorithm

Abstract

fetched live from OpenAlex

Abstract Let A be the inductive limit of a system with , where X n,i is a finite simplicial complex, and P n,i is a projection in M [ n,i ]( C ( X n,i )). In this paper, we will prove that A can be written as another inductive limit with , where Y n,i is a finite simplicial complex, and Q n , i is a projection in M { n , i } ( C ( Y n,i )), with the extra condition that all the maps ψ n , n +1 are injective . (The result is trivial if one allows the spaces Y n,i to be arbitrary compact metrizable spaces.) This result is important for the classification of simple AH algebras. The special case that the spaces X n,i are graphs is due to the third author.

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.001
metaresearch head score (Gemma)0.005
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
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.123
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.005
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.001
Insufficient payload (model declined to judge)0.0010.001

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.043
GPT teacher head0.301
Teacher spread0.258 · 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