Alphabeta Math
TheoremStatement: 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.

Poincare-Wirtinger on bounded connected extension domains by Rellich compactness

Statement

Assume the Axiom of Choice. Let n≥1, let Ω⊆Rn be a nonempty bounded connected extension domain, and let 1≤p<∞. Then there is C=C(Ω,p) such that every u∈W1,p(Ω;K) satisfies ∥u−uΩ∥Lp(Ω)≤C∥Du∥Lp(Ω),uΩ:=∣Ω∣−1∫Ωu(x) dx.

Facts & Assumptions

Given: the Axiom of Choice, a nonempty bounded connected extension domain Ω⊆Rn of finite positive measure, 1≤p<∞, and the mean uΩ of u. Nonempty openness supplies a ball inside Ω, and boundedness supplies a containing ball; thus 0<∣Ω∣<∞ by Euclidean balls have positive finite Lebesgue measure.

[F1]

Rellich compactness. Every sequence bounded in W1,p(Ω) has a subsequence converging in Lp(Ω). (Compactness of W1,p(Ω)↪Lp(Ω) on bounded extension domains, Sobolev extension domains and extension operators)

[F2]

The mean is continuous for the Lp norm. ∣uΩ∣≤∣Ω∣−1/p∥u∥Lp and hence ∣∫Ω(uj−u)∣≤∣Ω∣1−1/p∥uj−u∥Lp(Ω), by H"older's inequality on the finite-measure set Ω. (Holder's inequality for integrals, including the endpoint cases, The space Lp(μ) as the quotient by null functions)

[F3]

Weak gradients vanish when tested against convergent subsequences. If uj→u in Lp(Ω) and ∥Duj∥Lp(Ω)→0, then for every φ∈Cc∞(Ω) and every coordinate i, ∫Ωu ∂iφ=lim⁡j∫Ωuj∂iφ=−lim⁡j∫ΩDiuj φ=0. (Integer-order Sobolev spaces and their norms, The space Lp(μ) as the quotient by null functions)

[F4]

Zero gradient implies constancy on components. If u∈Wloc1,p(Ω) and Diu=0 almost everywhere for all i, then u is almost everywhere constant on each connected component of Ω. (Zero weak gradient gives componentwise constants)

Proof

technique · suppose no constant exists, normalise a violating sequence, extract a strongly convergent subsequence by Rellich, and use the vanishing gradient to force the limit to be a constant, contradicting unit norm
1.1F2givenassume-contra

Suppose the assertion fails: for every j≥1 there is vj∈W1,p(Ω) with ∥vj−(vj)Ω∥p>j∥Dvj∥p, and vj is not almost everywhere constant. Put uj:=(vj−(vj)Ω)/∥vj−(vj)Ω∥p; then the mean of uj is 0, ∥uj∥Lp=1, and ∥Duj∥p≤1/j, so ∥uj∥W1,p(Ω)≤(1+n/jp)1/p≤(1+n)1/p for all j.

2.1F1F2step 1.1

By [F1] there is a subsequence ujk→u in Lp(Ω). By [F2] and step 1.1 the means pass to the limit, so ∫Ωu=0; and ∥u∥Lp=1 because ∣∥ujk∥p−∥u∥p∣≤∥ujk−u∥p→0.

3.1F3F4step 2.1discharge-contradiction∎

By [F3] applied to the convergent subsequence of step 2.1 with ∥Dujk∥p≤1/jk→0, ∫Ωu ∂iφ=0 for every test function φ and every i, so Diu=0 almost everywhere and u∈W1,p(Ω); [F4] then makes u an almost everywhere constant on the connected Ω, and since its mean is 0 that constant is 0, contradicting ∥u∥Lp=1 from step 2.1. Hence the constant C exists. Countable Choice selects the violating sequence in step 1.1; the assumed Axiom of Choice also supplies [F1] and [F4].

Depends on

Used by

Dependency tree · two levels

69 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