Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)verified 2026-11-04 (gpt-6.1-sol)
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.

Closure of the Calabi continuity path under uniform estimates

Statement

Let (X,ω0) be a compact connected Kähler n-fold, n≥1. Fix finitely many smooth charts κν:Uν→Vν⊆R2n and closed Euclidean balls Dν⋐Vν such that the sets κν−1(int⁡Dν) cover X. For a smooth real function u and integer m≥0, define ∥u∥Cm(ω0):=max⁡νmax⁡∣β∣≤msup⁡x∈Dν∣∂β(u∘κν−1)(x)∣. Convergence in C∞ means convergence in these norms for every integer m≥0. Let μt be a smooth path of positive volume forms with ∫Xμt=∫Xω0n for every t∈[0,1]. Suppose tj→t∞ and smooth real functions ϕj satisfy ∫Xϕjω0n=0, ω0+i∂∂ˉϕj>0, (ω0+i∂∂ˉϕj)n=μtj, and sup⁡j∥ϕj∥Cm(ω0)<∞ for every integer m≥0. Then a subsequence converges in C∞ to a normalized smooth real ϕ∞ satisfying ω0+i∂∂ˉϕ∞>0 and (ω0+i∂∂ˉϕ∞)n=μt∞.

Facts & Assumptions

Given: A compact connected Kähler manifold X, its fixed Kähler form ω0, the fixed chart balls in the Statement, the smooth path μt, and the sequence (tj,ϕj) with the stated bounds and equations.

[F1]

A Kähler form is a smooth real, closed, positive (1,1)-form, and the adopted local convention is ω=igabˉdza∧dzˉb (Kähler class, canonical bundle, and Ricci form).

[F2]

Real and finite-dimensional Euclidean Ascoli–Arzelà criteria supplies uniform subsequences for bounded equicontinuous finite derivative arrays on each compact coordinate subchart; the arrays are finite-dimensional real vectors, and compact chart balls are nonempty compact metric domains.

[A1]

Full AC is assumed for countable sequential selections; it is the choice-function principle recorded in The Axiom of Choice.

Proof

technique · compactness and passage to the limit
1.1A1F2givenchoosealgebra

Use the fixed chart balls Dν from the Statement. For every multi-index β of order at most r, the uniform Cr+1(ω0) bound makes ∂β(ϕj∘κν−1) uniformly bounded and equicontinuous on each closed ball: the mean-value inequality bounds its oscillation by a constant times the Euclidean distance, using the uniform bounds on derivatives of order ∣β∣+1. Apply the Euclidean Arzelà–Ascoli theorem [F2] to the finite collection of derivative arrays and take a finite diagonal subsequence. Uniform convergence of all derivatives through order r gives convergence in the stated Cr(ω0) norm. Successively do this for r=0,1,2,… and take the diagonal subsequence. On each chart interior the derivative limits are the derivatives of the limiting function, by the fundamental theorem of calculus on coordinate line segments; the limits agree on overlaps because each ϕj does. They therefore define a smooth real ϕ∞, and the subsequence converges in every stated Cr norm.

2.1F1givenstep 1.1algebra∎

Convergence in C0 preserves ∫Xϕ∞ω0n=0. Convergence in C2 gives ω∞=ω0+i∂∂ˉϕ∞ as the limit of positive forms, so ω∞ is semipositive. Smooth dependence of μt on t and C2 convergence let the determinant equation pass to ω∞n=μt∞; the right side is strictly positive. At each point the eigenvalues of ω∞ relative to ω0 are nonnegative and their product is positive, so each is positive. Thus ω∞ is Kähler and the limit has every required property.

Depends on

Dependency tree · 2 levels

Sources