MétaCan
Menu
Back to cohort

A new class of Ramsey-classification theorems and their application in the Tukey theory of ultrafilters, Part 1

2013· article· en· W4253715132 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.

Bibliographic record

VenueTransactions of the American Mathematical Society · 2013
Typearticle
Languageen
FieldMathematics
TopicAdvanced Topology and Set Theory
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsUltrafilterMathematicsFubini's theoremCountable setCombinatoricsEquivalence (formal languages)Type (biology)Class (philosophy)Equivalence class (music)Space (punctuation)Regular cardinalRamsey theoryDiscrete mathematicsPure mathematics

Abstract

fetched live from OpenAlex

Motivated by a Tukey classification problem, we develop a new topological Ramsey space $\mathcal {R}_1$ that in its complexity comes immediately after the classical Ellentuck space. Associated with $\mathcal {R}_1$ is an ultrafilter $\mathcal {U}_1$ which is weakly Ramsey but not Ramsey. We prove a canonization theorem for equivalence relations on fronts on $\mathcal {R}_1$. This is analogous to the Pudlak-Rödl Theorem canonizing equivalence relations on barriers on the Ellentuck space. We then apply our canonization theorem to completely classify all Rudin-Keisler equivalence classes of ultrafilters which are Tukey reducible to $\mathcal {U}_1$: Every ultrafilter which is Tukey reducible to $\mathcal {U}_1$ is isomorphic to a countable iteration of Fubini products of ultrafilters from among a fixed countable collection of ultrafilters. Moreover, we show that there is exactly one Tukey type of nonprincipal ultrafilters strictly below that of $\mathcal {U}_1$, namely the Tukey type of a Ramsey ultrafilter.

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.000
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: none
Teacher disagreement score0.694
Threshold uncertainty score0.606

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.002
Scholarly communication0.0000.000
Open science0.0000.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.024
GPT teacher head0.277
Teacher spread0.253 · 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