Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 k≥1, ni≥1, let Ui⊆Rni be open, and let ui:Ui→R be upper semicontinuous, meaning lim sup⁡y→xui(y)≤ui(x) at each x∈Ui. Suppose ϕ is C2 near z=(z1,…,zk)∈∏iUi and ∑iui(xi)−ϕ(x) has a local maximum at z. Set A=D2ϕ(z), and let ∥A∥ be its Euclidean operator norm (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||). For every ε>0 there are Xi∈Sni such that (Diϕ(z),Xi)∈J‾2,+ui(zi), and −(ε−1+∥A∥)I ≤ diag⁡(X1,…,Xk) ≤ A+εA2. Here all jets are full Euclidean jets. In particular one may take each Ui to be a space-time domain of dimension d+1. For a lower semicontinuous function v, applying the theorem to −v and then negating its jet gives the corresponding closed subjet for v.

Facts & Assumptions

Given: The data of the Statement and The Axiom of Choice.

[A1]

Every family of nonempty sets has a choice function (The Axiom of Choice).

[F1]

Jets and their value-sensitive closures are defined in Second-order elliptic semijets and their value-sensitive closures.

[F2]

Quadratic sup convolutions of compactly restricted upper semicontinuous functions are continuous and semiconvex; an upper jet (q,Y) at η transfers, without changing Y, to the original function at η+q/λ, with original value v^(η)+∣q∣2/(2λ) (Quadratic sup convolution and transfer of upper jets).

[F3]

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).

[F4]

For symmetric A, ∣hTAh∣≤∥A∥∣h∣2 (A symmetric matrix operator norm is its largest absolute Rayleigh quotient). Every bounded finite-dimensional sequence has a convergent subsequence (For n≥1 every bounded sequence in Rn has a convergent subsequence).

Proof

1.1F2F4algebraconstruct

First prove the quadratic compactly localized case. Translate to z=0, subtract ui(0) and the affine terms Diϕ(0)⋅xi, and suppose ui(0)=0 and w(x):=∑iui(xi)≤xTAx/2 on compact neighborhoods Ki of zero. Extend the restrictions by −∞ off Ki, set λ=ε−1+∥A∥>0 and B=A+εA2, and write h=x−ξ. The identity ∣ε−1/2h−ε1/2Aξ∣2≥0 gives xTAx≤ξTBξ+λ∣x−ξ∣2. Define u^i by [F2] and f(ξ)=∑iu^i(ξi). The supremum separates over the finite compact product, so f(ξ)=sup⁡x{w(x)−λ∣x−ξ∣2/2}≤ξTBξ/2. Each u^i(0)≥0, while f(0)≤0, so all are zero; also f+λ∣ξ∣2/2 is convex.

2.1A1step 1.1F3algebrachoose

The function F(ξ)=f(ξ)−ξTBξ/2−∣ξ∣4 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 f lacks a Peano expansion: for each n, [A1] selects ∣ξn∣<1/n, ∣qn∣≤1/n so F+qn⋅ξ has a local maximum at ξn and f has expansion (pn,Zn) there. Restricting to lines gives pn=Bξn+4∣ξn∣2ξn−qn and Zn≤B+8ξnξnT+4∣ξn∣2I; convexity of f+λ∣ξ∣2/2 gives Zn≥−λI. Thus pn→0 and Zn is bounded. AC supplies the countable selections and is inherited from [F3].

3.1step 1.1step 2.1F1F2algebra

Separability makes Zn block diagonal: each coordinate restriction gives the corresponding Peano expansion of u^i, and summing those expansions gives a second expansion of f with Hessian diag⁡(Zn,11,…,Zn,kk). Uniqueness follows because a quadratic form that is o(∣h∣2) vanishes on every direction and hence by polarization. Set Xn,i=Zn,ii. The transfer in [F2] gives yn,i=ξn,i+pn,i/λ, (pn,i,Xn,i)∈J2,+ui(yn,i), and ui(yn,i)=u^i(ξn,i)+∣pn,i∣2/(2λ). Since yn,i→0, they eventually lie inside Ki; continuity of u^i gives ui(yn,i)→0=ui(0).

4.1step 2.1step 3.1F1F4algebra

By [F4], extract one subsequence along which the finitely many entries of Zn converge to Z=diag⁡(Xi). The inequalities in step 2.1 pass to the limit, giving −λI≤Z≤B. The convergent jets and values from step 3.1 imply (0,Xi)∈J‾2,+ui(0) by [F1]; this proves the localized quadratic case.

5.1step 4.1F1algebra

For the general case, translate and subtract affine functions as above. Taylor's formula gives ϕ(x)=xTAx/2+o(∣x∣2), so for every sufficiently small η>0 there are compact neighborhoods Kiη with ∑iui(xi)≤xT(A+ηI)x/2. Apply the quadratic case from step 4.1 with Aη=A+ηI; it gives closed jets (0,Xiη) with −(ε−1+∥Aη∥)I≤diag⁡(Xiη)≤Aη+εAη2. Because zero is interior to each Kiη, localization does not change these closed jets.

6.1A1step 5.1F1F4givenchoosealgebra∎

Take ηn=1/n and, by [A1], choose for each sufficiently large n 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 ∥A+ηI∥→∥A∥. For each closed jet (0,Xiη), [A1] selects an actual approximating jet with point, value, gradient, and matrix within 1/n; the defining value-sensitive closure [F1] then gives the limiting closed jet. Restoring the subtracted affine terms gives gradient Diϕ(z), and negating jets proves the lower-semicontinuous version.

Depends on

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