Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (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.

Coercivity of the principal Dirichlet form

Statement

Assume the Axiom of Choice, inherited through the Poincaré supplier named below, together with Countable Choice. Let Ω⊆Rn be open and bounded in one direction, and let a0(u,v)=∫ΩaijDjuDiv‾ dx be the principal part of a uniformly elliptic form with constants θ and Ma (Uniformly elliptic divergence-form operators and their sesquilinear forms), restricted to u,v∈H01(Ω). Then a0 is a bounded sesquilinear form on H01(Ω) and Re⁡a0(u,u)=∫ΩRe⁡(aijDjuDiu‾)dx≥θ∥Du∥L22≥θ1+CP2∥u∥H012(u∈H01(Ω)), where CP is the Poincar'e constant of The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction for p=2. Hence a0 is coercive on H01(Ω) with constant α=θ/(1+CP2), and Re⁡a0(u,u)=θ∥Du∥2 in the model case aij=δij (so θ=1).

Facts & Assumptions

Given: The Axiom of Choice and Countable Choice; an open Ω⊆Rn bounded in one direction; uniformly elliptic coefficients aij with constants θ>0 and Ma (Uniformly elliptic divergence-form operators and their sesquilinear forms); and the principal form a0(u,v)=∫ΩaijDjuDiv‾ dx on H01(Ω).

[F1]

Uniform ellipticity: for almost every x∈Ω and every ξ∈Cn, Re⁡(∑i,jaij(x)ξjξi‾)≥θ∣ξ∣2, and ∣aij∣≤Ma a.e. (Uniformly elliptic divergence-form operators and their sesquilinear forms).

[F2]

Absolute convergence and boundedness: the principal term is absolutely convergent for u,v∈H1(Ω) and ∣a0(u,v)∣≤nMa∥u∥H01∥v∥H01 on H01(Ω); in particular a0 is a bounded sesquilinear form (The elliptic form is well defined and bounded on H1).

[F3]

Poincar'e at p=2: ∥u∥L2(Ω)≤CP∥Du∥L2(Ω) for every u∈H01(Ω), where Du=(D1u,…,Dnu) and CP is the constant of the cited theorem at p=2; hence ∥u∥H012=∥u∥L22+∥Du∥L22≤(1+CP2)∥Du∥L22 (The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction, Integer-order Sobolev spaces and their norms, Zero-boundary Sobolev space as a norm closure).

[F4]

Nonnegative measurable functions have nonnegative integrals, and the integral of a nonnegative function is monotone under pointwise comparison; the real part of an integral of a complex-valued integrable function is the integral of its real part (Monotone convergence for the integral, Integral over a measurable subset, Real and imaginary parts, complex conjugation, and modulus).

[F5]

Coercivity of a sesquilinear form means Re⁡a(u,u)≥α∥u∥2 for all u and some α>0 (Bounded, coercive and symmetric sesquilinear forms).

Proof

1.1F1given

Pointwise bound: substituting ξ=Du(x) in the ellipticity condition of [F1] and taking real parts gives, for almost every x∈Ω, Re⁡(aij(x)Dju(x)Diu(x)‾)≥θ∣Du(x)∣2≥0.

1.2F3

Poincar'e bound: by [F3], ∥u∥H012≤(1+CP2)∥Du∥L22 for every u∈H01(Ω), that is ∥Du∥L22≥∥u∥H012/(1+CP2).

2.1F1F2F4step 1.1

Integrating the pointwise bound: the function x↦Re⁡(aijDjuDiu‾) is measurable and its negative part is bounded by (nMa+nMa)∣Du∣2 a.e., so Re⁡a0(u,u)=∫ΩRe⁡(aijDjuDiu‾) dx; the difference from θ∣Du∣2 is nonnegative and measurable, so its integral is nonnegative and Re⁡a0(u,u)≥θ∫Ω∣Du∣2 dx=θ∥Du∥L22.

3.1F2F5step 2.1step 1.2algebra∎

Coercivity and the model case: combining steps 2.1 and 1.2 gives Re⁡a0(u,u)≥θ∥Du∥L22≥θ1+CP2∥u∥H012 for every u∈H01(Ω), so a0 is coercive with constant α=θ/(1+CP2); it is bounded by [F2]. In the model case aij=δij, θ=1, the pointwise identity Re⁡(aijDjuDiu‾)=∣Du∣2 gives Re⁡a0(u,u)=∥Du∥L22.

Depends on

Used by

Dependency tree · two levels

59 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