Complete spectral sets and numerical range
Bibliographic record
Abstract
We define the complete numerical radius norm for homomorphisms from any operator algebra into <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper B left-parenthesis script upper H right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">B</mml:mi> </mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">H</mml:mi> </mml:mrow> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathcal B(\mathcal H)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , and show that this norm can be computed explicitly in terms of the completely bounded norm. This is used to show that if <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper K"> <mml:semantics> <mml:mi>K</mml:mi> <mml:annotation encoding="application/x-tex">K</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is a complete <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper C"> <mml:semantics> <mml:mi>C</mml:mi> <mml:annotation encoding="application/x-tex">C</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -spectral set for an operator <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper T"> <mml:semantics> <mml:mi>T</mml:mi> <mml:annotation encoding="application/x-tex">T</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , then it is a complete <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper M"> <mml:semantics> <mml:mi>M</mml:mi> <mml:annotation encoding="application/x-tex">M</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -numerical radius set, where <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper M equals one half left-parenthesis upper C plus upper C Superscript negative 1 Baseline right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>M</mml:mi> <mml:mo>=</mml:mo> <mml:mfrac> <mml:mn>1</mml:mn> <mml:mn>2</mml:mn> </mml:mfrac> <mml:mo stretchy="false">(</mml:mo> <mml:mi>C</mml:mi> <mml:mo>+</mml:mo> <mml:msup> <mml:mi>C</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mo> − </mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:msup> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">M=\frac 12(C+C^{-1})</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . In particular, in view of Crouzeix’s theorem, there is a universal constant <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper M"> <mml:semantics> <mml:mi>M</mml:mi> <mml:annotation encoding="application/x-tex">M</mml:annotation> </mml:semantics> </mml:math> </inline-formula> (less than 5.6) so that if <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper P"> <mml:semantics> <mml:mi>P</mml:mi> <mml:annotation encoding="application/x-tex">P</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is a matrix polynomial and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper T element-of script upper B left-parenthesis script upper H right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>T</mml:mi> <mml:mo> ∈ </mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">B</mml:mi> </mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">H</mml:mi> </mml:mrow> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">T \in \mathcal B(\mathcal H)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , then <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="w left-parenthesis upper P left-parenthesis upper T right-parenthesis right-parenthesis less-than-or-equal-to upper M double-vertical-bar upper P double-vertical-bar Subscript upper W left-parenthesis upper T right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>w</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>P</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>T</mml:mi> <mml:mo stretchy="false">)</mml:mo> <mml:mo stretchy="false">)</mml:mo> <mml:mo> ≤ </mml:mo> <mml:mi>M</mml:mi> <mml:mo fence="false" stretchy="false"> ‖ </mml:mo> <mml:mi>P</mml:mi> <mml:msub> <mml:mo fence="false" stretchy="false"> ‖ </mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>W</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>T</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:msub> </mml:mrow> <mml:annotation encoding="application/x-tex">w(P(T)) \le M \|P\|_{W(T)}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . When <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper W left-parenthesis upper T right-parenthesis equals double-struck upper D overbar"> <mml:semantics> <mml:mrow> <mml:mi>W</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>T</mml:mi> <mml:mo stretchy="false">)</mml:mo>
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.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.002 | 0.004 |
| Scholarly communication | 0.004 | 0.008 |
| Open science | 0.001 | 0.005 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.009 | 0.003 |
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".