How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Elliptic theorem of sums with the full block matrix bound
Statement
Assume the Axiom of Choice. Let , , let be open, and let be upper semicontinuous, meaning at each . Suppose is near and has a local maximum at . Set , and let be its Euclidean operator norm (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||). For every there are such that and Here all jets are full Euclidean jets. In particular one may take each to be a space-time domain of dimension . For a lower semicontinuous function , applying the theorem to and then negating its jet gives the corresponding closed subjet for .
Facts & Assumptions
Given: The data of the Statement and The Axiom of Choice.
Every family of nonempty sets has a choice function (The Axiom of Choice).
Jets and their value-sensitive closures are defined in Second-order elliptic semijets and their value-sensitive closures.
Quadratic sup convolutions of compactly restricted upper semicontinuous functions are continuous and semiconvex; an upper jet at transfers, without changing , to the original function at , with original value (Quadratic sup convolution and transfer of upper jets).
A finite locally semiconvex function has a second-order Peano expansion outside a Lebesgue null set, under AC (Alexandrov second differentiability of locally semiconvex functions). At a strict maximum the maximum can be perturbed by an arbitrarily small affine term to occur arbitrarily close to that point outside any specified null set (Jensen maximum principle for locally semiconvex functions).
For symmetric , (A symmetric matrix operator norm is its largest absolute Rayleigh quotient). Every bounded finite-dimensional sequence has a convergent subsequence (For every bounded sequence in has a convergent subsequence).
Proof
First prove the quadratic compactly localized case. Translate to , subtract and the affine terms , and suppose and on compact neighborhoods of zero. Extend the restrictions by off , set and , and write . The identity gives . Define by [F2] and . The supremum separates over the finite compact product, so . Each , while , so all are zero; also is convex.
The function has a strict maximum at zero and is locally semiconvex, since the Hessian of the subtracted polynomial is bounded on every fixed ball. Apply [F3] outside the null set where lacks a Peano expansion: for each , [A1] selects , so has a local maximum at and has expansion there. Restricting to lines gives and ; convexity of gives . Thus and is bounded. AC supplies the countable selections and is inherited from [F3].
Separability makes block diagonal: each coordinate restriction gives the corresponding Peano expansion of , and summing those expansions gives a second expansion of with Hessian . Uniqueness follows because a quadratic form that is vanishes on every direction and hence by polarization. Set . The transfer in [F2] gives , , and . Since , they eventually lie inside ; continuity of gives .
By [F4], extract one subsequence along which the finitely many entries of converge to . The inequalities in step 2.1 pass to the limit, giving . The convergent jets and values from step 3.1 imply by [F1]; this proves the localized quadratic case.
For the general case, translate and subtract affine functions as above. Taylor's formula gives , so for every sufficiently small there are compact neighborhoods with . Apply the quadratic case from step 4.1 with ; it gives closed jets with . Because zero is interior to each , localization does not change these closed jets.
Take and, by [A1], choose for each sufficiently large one tuple of closed-jet matrices supplied by step 5.1. Use [F4] to extract a convergent subsequence of these block matrices. The limit obeys the required bounds because . For each closed jet , [A1] selects an actual approximating jet with point, value, gradient, and matrix within ; the defining value-sensitive closure [F1] then gives the limiting closed jet. Restoring the subtracted affine terms gives gradient , and negating jets proves the lower-semicontinuous version.
Depends on
- The Axiom of Choice
- Second-order elliptic semijets and their value-sensitive closures
- Jensen maximum principle for locally semiconvex functions
- Quadratic sup convolution and transfer of upper jets
- Alexandrov second differentiability of locally semiconvex functions
- A symmetric matrix operator norm is its largest absolute Rayleigh quotient
- The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
- For $n \ge 1$ every bounded sequence in $\mathbb{R}^n$ has a convergent subsequence
Used by
Dependency tree · two levels
49 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Crandall, Ishii and Lions, User's guide to viscosity solutions of second order partial differential equations (standard reference, not scraped)