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

The Poincare inequality with a positive-measure zero set

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let n≥2, let Ω be a bounded John domain with admissible constant cJ, let 1≤p<∞, and let A⊆Ω be measurable with ∣A∣≥γ∣Ω∣ for some γ∈(0,1]. If u∈W1,p(Ω;K) vanishes almost everywhere on A, then ∥u∥Lp(Ω)≤C(n,p,cJ,γ)diam⁡(Ω)∥Du∥Lp(Ω).

Facts & Assumptions

Given: The Axiom of Choice; a bounded John domain Ω with constant cJ (John domains and the John constant); 1≤p<∞; a measurable A⊆Ω with ∣A∣≥γ∣Ω∣, γ∈(0,1]; and a class u∈W1,p(Ω;K) vanishing almost everywhere on A.

[F1]

The mean-zero Poincare inequality on the John domain: ∥w−wΩ∥Lp(Ω)≤C1(n,p,cJ)diam⁡(Ω)∥Dw∥Lp(Ω) for every w∈W1,p(Ω;K), where wΩ=∣Ω∣−1∫Ωw (The mean-zero Poincare inequality on bounded John domains, The average of a locally integrable function over a Euclidean ball).

[F2]

Weak derivatives are linear: D(w−c)=Dw for every constant c (Linearity, locality, and commutation of weak derivatives); W1,p consists of Lp classes with weak gradient in Lp, and Lp is a space of almost-everywhere classes (Integer-order Sobolev spaces and their norms, The space Lp(μ) as the quotient by null functions).

[F3]

Holder's inequality: ∫A∣v∣≤∣A∣1−1/p∥v∥Lp(Ω) for the finite measure set A (Holder's inequality for integrals, including the endpoint cases).

Proof

technique · direct
1.1F1F2givenalgebra

The mean-zero part. Since constants have zero weak derivative, v:=u−uΩ satisfies v∈W1,p(Ω;K) and Dv=Du by [F2]; by [F1], ∥v∥Lp(Ω)≤C1(n,p,cJ)diam⁡(Ω)∥Du∥Lp(Ω). Also v=u−uΩ almost everywhere on A, so u vanishes there if and only if v=−uΩ there.

2.1F3step 1.1givenalgebra

Recovering the mean from the zero set. Because u=0 almost everywhere on A and ∣A∣≤∣Ω∣<∞, ∫Av=∫A(u−uΩ)=−∣A∣uΩ; hence ∣A∣ ∣uΩ∣≤∫A∣v∣≤∣A∣1−1/p∥v∥Lp(Ω)≤∣A∣1−1/pC1diam⁡(Ω)∥Du∥Lp(Ω) by [F3] and step 1.1, and therefore ∣uΩ∣≤∣A∣−1/pC1diam⁡(Ω)∥Du∥Lp(Ω)≤(γ∣Ω∣)−1/pC1diam⁡(Ω)∥Du∥Lp(Ω).

3.1step 1.1step 2.1givenalgebra∎

Conclusion. By the triangle inequality and steps 1.1 and 2.1, ∥u∥Lp(Ω)≤∥u−uΩ∥Lp(Ω)+∣Ω∣1/p∣uΩ∣≤C1diam⁡(Ω)∥Du∥Lp(Ω)+C1γ−1/pdiam⁡(Ω)∥Du∥Lp(Ω)=C(n,p,cJ,γ)diam⁡(Ω)∥Du∥Lp(Ω) with C(n,p,cJ,γ):=C1(1+γ−1/p), which is the asserted inequality.

Source notes

Kinnunen's Remark 3.20 records the zero-set variant: a function vanishing on a set of positive measure can be normalised without the mean, and the mean itself is controlled by the amount of mass on the complement. The proof above implements that normalisation: the mean-zero inequality controls u−uΩ, and the value uΩ is recovered from the zero set by integrating u−uΩ over A. The exponent −1/p in the mean bound is what produces the constant γ−1/p.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

46 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