Norm-attaining lattice homomorphisms and renormings of Banach lattices
Bibliographic record
Abstract
A well-known theorem due to R. C. James states that a Banach space is reflexive if and only if every bounded linear functional attains its norm. In this note we study Banach lattices on which every (real-valued) lattice homomorphism attains its norm. Contrary to what happens in the Banach space setting, we show that this property is not invariant under lattice isomorphisms. Namely, we show that in an AM-space every lattice homomorphism attains its norm, whereas every infinite-dimensional C ( K ) space admits an equivalent lattice norm with a lattice homomorphism which does not attain its norm. Furthermore, we characterize coordinate functionals of atoms and show that whenever a Banach lattice X supports a strictly positive functional, there exists a renorming with the property that the only (non-trivial) lattice homomorphisms attaining their norm are precisely these coordinate functionals. As a consequence, one can exhibit examples of Dedekind complete Banach lattices admitting a renorming with a non-norm-attaining lattice homomorphism, answering negatively questions posed by Dantas, Rodríguez Abellán, Rueda Zoca and the fourth 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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.005 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.004 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".