Alphabeta Math
CorollaryStatement: AI-adaptedProof: 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.

A positive reaction term restores coercivity without Poincar'e

Statement

Assume Countable Choice. Let Ω⊆Rn be open (no boundedness and no Dirichlet boundary condition assumed), and let a be the divergence form of Uniformly elliptic divergence-form operators and their sesquilinear forms on H1(Ω) with ellipticity constant θ, coefficient bounds Ma,Mb,Mc where ∣bi∣≤Mb componentwise, and ess inf⁡ΩRe⁡c≥c0>0,n Mb<2min⁡(θ,c0). Then a is coercive on Ω with constant α:=min⁡(θ,c0)−n Mb/2>0: Re⁡a(u,u)≥α∥u∥H1(Ω)2(u∈H1(Ω)). Consequently The Lax--Milgram theorem applies on the Hilbert space H1(Ω) and gives, for every bounded conjugate-linear functional F on H1(Ω), a unique u∈H1(Ω) with a(u,v)=F(v) for all v: a second legitimate coercivity mechanism, driven by the reaction coefficient rather than by a Poincar'e inequality or boundary condition. When b≡0, taking Mb=0, the condition is ess inf⁡Re⁡c>0 only.

Facts & Assumptions

Given: Countable Choice; an open Ω⊆Rn; divergence-form coefficients aij,bi,c with bounds Ma,Mb,Mc, where ∣bi∣≤Mb componentwise, and ellipticity constant θ>0; ess inf⁡ΩRe⁡c≥c0>0; the assumption n Mb<2min⁡(θ,c0); and α:=min⁡(θ,c0)−n Mb/2>0.

[F1]

Uniform ellipticity gives for a.e. x and ξ=Du(x): Re⁡(aijDjuDiu‾)≥θ∣Du∣2; the coefficient bounds give ∣bi∣≤Mb and ∣c∣≤Mc a.e. (Uniformly elliptic divergence-form operators and their sesquilinear forms, The essential supremum of a measurable function with respect to a measure, The space L∞(μ) of essentially bounded measurable functions).

[F3]

Estimates: Re⁡∫Ωcuu‾ dx=∫Ω(Re⁡c)∣u∣2 dx≥c0∥u∥L22; componentwise ∣bi∣≤Mb and ∑i∣Diu∣≤n ∣Du∣ imply ∣∫ΩbiDiuu‾ dx∣≤n Mb∥Du∥L2∥u∥L2 by pointwise Cauchy--Schwarz and H"older; also 2ab≤a2+b2 for nonnegative reals (Holder's inequality for integrals, including the endpoint cases, Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation, Real and imaginary parts, complex conjugation, and modulus).

[F4]

Lax--Milgram applies to bounded coercive forms on Hilbert spaces (The Lax--Milgram theorem, Bounded, coercive and symmetric sesquilinear forms).

Proof

1.1F1F2

Pointwise decomposition and integration: by [F1], for almost every x the principal integrand satisfies Re⁡(aijDjuDiu‾)≥θ∣Du(x)∣2, and integrating (the principal term is absolutely convergent by [F2]) gives Re⁡∫ΩaijDjuDiu‾ dx≥θ∥Du∥L22.

2.1F1F3step 1.1algebra

Drift and reaction terms: taking real parts of the definition of a, Re⁡a(u,u)≥θ∥Du∥L22−n Mb∥Du∥L2∥u∥L2+c0∥u∥L22, where the drift term is bounded in absolute value by n Mb∥Du∥L2∥u∥L2 via [F3], and the reaction term is bounded below by c0∥u∥L22 using Re⁡c≥c0 a.e.

3.1F3step 2.1algebra

Coercivity: applying 2ab≤a2+b2 to a=∥Du∥L2, b=∥u∥L2 with weight n Mb gives n Mb∥Du∥ ∥u∥≤n Mb2(∥Du∥L22+∥u∥L22), hence Re⁡a(u,u)≥(θ−n Mb2)∥Du∥L22+(c0−n Mb2)∥u∥L22≥α∥u∥H1(Ω)2 with α=min⁡(θ,c0)−n Mb2>0, because ∥u∥H12=∥u∥L22+∥Du∥L22 and both coefficients θ−n Mb2, c0−n Mb2 are at least α by the smallness hypothesis.

4.1F2F4step 3.1∎

Consequences: a is bounded by [F2] and coercive with constant α by step 3.1, so Lax--Milgram applies on the Hilbert space H1(Ω): for every bounded conjugate-linear functional F there is a unique u∈H1(Ω) with a(u,v)=F(v) for all v. No Poincar'e inequality, boundary condition or integration by parts was used; when b≡0, taking Mb=0, the hypothesis reduces to ess inf⁡Re⁡c>0.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

72 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