MétaCan
Menu
Back to cohort
Record W3091214701 · doi:10.24193/fpt-ro.2020.2.48

An ultra-product method via left reversible semigroups to study Bruck's generalized conjecture

2020· article· en· W3091214701 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

VenueFixed Point Theory · 2020
Typearticle
Languageen
FieldMathematics
TopicAdvanced Operator Algebra Research
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsMathematicsConjectureProduct (mathematics)Banach spaceGeneralityMathematical proofPure mathematicsProperty (philosophy)Order (exchange)SemigroupRegular polygonFixed pointSpace (punctuation)Discrete mathematicsMathematical analysisComputer science

Abstract

fetched live from OpenAlex

It has been asked by Lau several times whether a Banach space with weak fixed point property has weak fixed point property for left reversible semigroups. This problem is known as Bruck generalized conjecture (BGC). The aim of this note is to propose a new approach to tackle the BGC. Our approach uses the order structure of the semigroup for the first time in literature to construct an ultra-product structure. Then, we use this ultra-product structure to give an affirmative answer to BGC for the case of nearly uniformly convex (NUC) Banach spaces. One should note that alternatives proofs are available in the case of NUC Banach spaces, but what we hope for is that the originality of our method could pave the way for studying the BGC in its utmost generality.

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.003
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 categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.239
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0030.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.046
GPT teacher head0.373
Teacher spread0.327 · 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