MétaCan
Menu
Back to cohort
Record W1973654200 · doi:10.4153/cjm-2000-028-9

Chern Characters of Fourier Modules

2000· article· en· W1973654200 on OpenAlexafffund
Samuel G. Walters

Bibliographic record

VenueCanadian Journal of Mathematics · 2000
Typearticle
Languageen
FieldMathematics
TopicAdvanced Operator Algebra Research
Canadian institutionsUniversity of Northern British Columbia
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMathematicsPure mathematicsCrossed productFourier seriesTRACE (psycholinguistics)AutomorphismCommutative propertyTheta functionOrder (exchange)Algebra over a fieldGroup (periodic table)Product (mathematics)Mathematical analysisGeometry

Abstract

fetched live from OpenAlex

Abstract Let Aθ denote the rotation algebra—the universal C*-algebra generated by unitaries U, V satisfying VU = e2πiθUV, where θ is a fixed real number. Let σ denote the Fourier automorphism of Aθ defined by U ↦ V, V ↦ U-1, and let denote the associated C*-crossed product. It is shown that there is a canonical inclusion for each θ given by nine canonical modules. The unbounded trace functionals of Bθ (yielding the Chern characters here) are calculated to obtain the cyclic cohomology group of order zero HC0(Bθ) when θ is irrational. The Chern characters of the nine modules—and more importantly, the Fourier module—are computed and shown to involve techniques from the theory of Jacobi’s theta functions. Also derived are explicit equations connecting unbounded traces across strongMorita equivalence, which turn out to be non-commutative extensions of certain theta function equations. These results provide the basis for showing that for a dense Gδ set of values of θ one has and is generated by the nine classes constructed here.

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.001
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: Empirical
Teacher disagreement score0.009
Threshold uncertainty score0.029

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0020.001
Science and technology studies0.0010.002
Scholarly communication0.0020.002
Open science0.0000.002
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0090.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.047
GPT teacher head0.308
Teacher spread0.260 · 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

Citations22
Published2000
Admission routes2
Has abstractyes

Explore more

Same venueCanadian Journal of MathematicsSame topicAdvanced Operator Algebra ResearchFrench-language works237,207