Constant rank theorems for curvature problems via a viscosity approach
Bibliographic record
Abstract
Abstract An important set of theorems in geometric analysis consists of constant rank theorems for a wide variety of curvature problems. In this paper, for geometric curvature problems in compact and non-compact settings, we provide new proofs which are both elementary and short. Moreover, we employ our method to obtain constant rank theorems for homogeneous and non-homogeneous curvature equations in new geometric settings. One of the essential ingredients for our method is a generalization of a differential inequality in a viscosity sense satisfied by the smallest eigenvalue of a linear map Brendle et al. (Acta Math 219:1–16, 2017) to the one for the subtrace. The viscosity approach provides a concise way to work around the well known technical hurdle that eigenvalues are only Lipschitz in general. This paves the way for a simple induction argument.
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.005 | 0.015 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.005 | 0.001 |
| Science and technology studies | 0.001 | 0.005 |
| Scholarly communication | 0.004 | 0.009 |
| Open science | 0.002 | 0.006 |
| Research integrity | 0.002 | 0.005 |
| Insufficient payload (model declined to judge) | 0.010 | 0.001 |
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".