Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08
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.

The complex Hessian of a C2 function dominates that of a minorant at a common minimum

Facts & Assumptions

Given: An integer m≥1, an open set U⊆Cm, real-valued functions u,v∈C2(U), a point a∈U, a neighbourhood V⊆U of a on which u≥v, and u(a)=v(a).

[F1]

The identification of Cm with R2m transports open sets and real coordinate regularity, and C2 means all ordered real coordinate derivatives through order two exist and are continuous (Complex m-space and its real coordinate dictionary, Ck maps and multi-index derivative notation in Euclidean space).

[F2]

For a real C2 function on a real open set, its real Hessian quadratic form is nonpositive at an interior local maximum (The Hessian is negative semidefinite at an interior local maximum).

[F3]

The Wirtinger operators are ∂zk=12(∂xk−i∂yk) and ∂zˉk=12(∂xk+i∂yk) (Wirtinger operators in Cm).

[F4]

If a map has continuous coordinate partial derivatives on a neighbourhood, it is totally differentiable there, and the ordinary chain rule for total derivatives applies (If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative, The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)). Applied to an affine complex line and to the first coordinate derivatives of a real C2 function, it gives the line-composition derivative formulas used below.

[F5]

The real coordinate mixed partial derivatives of a C2 function commute (Clairaut--Schwarz theorem for continuous second partial derivatives).

[F6]

The Levi form is Lu(a;X)=∑j,k=1muzjzˉk(a)XjXk‾, with the one-based indices of The Levi form and strict plurisubharmonicity.

Statement

Let m≥1, let U⊆Cm be open, let u,v∈C2(U,R), and let a∈U. If u≥v on a neighbourhood of a and u(a)=v(a), then for every X∈Cm

∑j,k=1m∂2u∂zj∂z‾k(a)XjXk‾ ≥ ∑j,k=1m∂2v∂zj∂z‾k(a)XjXk‾.

Here C2 is interpreted in the real coordinates of Complex m-space and its real coordinate dictionary, and the one-based complex-coordinate aliases and Wirtinger derivatives are those of The Levi form and strict plurisubharmonicity.

Proof

technique · direct

Given: m,U,u,v,a as in the statement and an arbitrary X∈Cm.

1.1F1F4givenalgebra

Put w=u−v. If X=0, both sides of the claimed inequality are zero. Otherwise, since U is open, the affine map λ↦a+λX maps a sufficiently small disc about 0 into U. On a possibly smaller such disc, Φ(λ):=w(a+λX) is real C2 by [F4], is nonnegative, and satisfies Φ(0)=0; hence 0 is a local minimum of Φ.

2.1F2step 1.1given

The function −Φ is real C2 and has a local maximum at 0. Apply [F2] in the real coordinates λ=s+it. Its Hessian quadratic form is nonpositive on each coordinate vector, so Φss(0)≥0 and Φtt(0)≥0. Therefore Φss(0)+Φtt(0)≥0.

3.1F3F4F5F6step 2.1algebragiven∎

Write Xj=αj+iβj. By the definitions in [F3] and the chain rule in [F4], ∂λˉΦ(λ)=∑kXk‾(∂zˉkw)(a+λX) and therefore ∂λ∂λˉΦ(0)=∑j,kXjXk‾ ∂zj∂zˉkw(a). Also, the one-variable Wirtinger formulas give 4∂λ∂λˉΦ=Φss+Φtt+i(Φst−Φts)=Φss+Φtt by [F5]. Thus [F6] and step 2.1 imply 4(Lu(a;X)−Lv(a;X))=Φss(0)+Φtt(0)≥0, which is the required inequality for this arbitrary X.

Depends on

Used by

Dependency tree · two levels

43 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