MétaCan
Menu
Back to cohort
Record W2952671711 · doi:10.48550/arxiv.math/0611633

Perturbation of complex polynomials and normal operators

2006· preprint· en· W2952671711 on OpenAlexaff
Armin Rainer

Bibliographic record

VenuearXiv (Cornell University) · 2006
Typepreprint
Languageen
FieldMathematics
TopicHolomorphic and Operator Theory
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsMathematicsAbsolute continuityMonic polynomialEigenvalues and eigenvectorsDifferentiable functionPure mathematicsOrder (exchange)Perturbation (astronomy)TrivialityCombinatoricsDiscrete mathematicsMathematical analysisPolynomialPhysics

Abstract

fetched live from OpenAlex

We study the regularity of the roots of complex monic polynomials $P(t)$ of fixed degree depending smoothly on a real parameter $t$. We prove that each continuous parameterization of the roots of a generic $C^\infty$ curve $P(t)$ (which always exists) is locally absolutely continuous. Generic means that no two of the continuously chosen roots meet of infinite order of flatness. Simple examples show that one cannot expect a better regularity than absolute continuity. This result will follow from the proposition that for any $t_0$ there exists a positive integer $N$ such that $t \mapsto P(t_0\pm (t-t_0)^N)$ admits smooth parameterizations of its roots near $t_0$. We show that $C^n$ curves $P(t)$ (where $n = °P$) admit differentiable roots if and only if the order of contact of the roots is $\ge 1$. We give applications to the perturbation theory of normal matrices and unbounded normal operators with compact resolvents and common domain of definition: The eigenvalues and eigenvectors of a generic $C^\infty$ curve of such operators can be arranged locally in an absolutely continuous way.

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.000
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.002
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0010.002
Scholarly communication0.0010.001
Open science0.0000.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0020.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.119
GPT teacher head0.218
Teacher spread0.099 · 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

Citations0
Published2006
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicHolomorphic and Operator TheoryFrench-language works237,207