Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Mean-zero Poincare inequality on a bounded connected C1 domain

Statement

Assume the Axiom of Choice (used through the smooth-up-to-the-boundary density theorem below) and the Axiom of Countable Choice (declared by the flattening and Sobolev suppliers). The axiom interfaces are The Axiom of Choice and The Axiom of Countable Choice (ACω). Let Ω⊂R3 be a bounded connected C1 domain in the graph sense (Bounded C^k domains and boundary charts, Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets); its closure is compact, so the boundary has a finite cover by boundary charts (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right). There is a constant CΩ, depending only on Ω, with

∥v−vΩ∥L2(Ω)≤CΩ ∥∇v∥L2(Ω)for every v∈H1(Ω),vΩ:=1∣Ω∣∫Ωv dx.

Here H1(Ω)=W1,2(Ω;R) with the weak coordinate derivatives, and ∇v denotes the weak gradient. The estimate is the mean-zero (Poincare) inequality needed for weak Neumann solvability, where the mean-zero subspace carries the gradient norm.

Facts & Assumptions

Given: A bounded connected C1 domain Ω⊂R3 in the graph sense of Bounded C^k domains and boundary charts, the Axiom of Choice and Countable Choice, and a function v∈H1(Ω)=W1,2(Ω;R). For a measurable A⊆Ω with ∣A∣>0 write vA=∣A∣−1∫Av.

[L1]

Sobolev conventions. Integer-order Sobolev spaces and their norms (Countable Choice): W1,2(Ω;R) is the set of L2 classes whose weak coordinate derivatives Dαv, ∣α∣≤1, exist as L2 classes; for the multi-index ei, Deiv is the weak gradient component ∂iv, and ∥∇v∥2=(∑i∥∂iv∥22)1/2. Bounded restriction and cutoff localisation in Sobolev spaces (Axiom of Choice): restriction to an open U⊆Ω maps W1,2(Ω) contractively into W1,2(U).

[L2]

One-dimensional absolute continuity and product integration. The ACL characterisation of W1,p: a W1,2 function on a box is, after modification on a null set, absolutely continuous on almost every line parallel to each coordinate axis, with the one-variable fundamental theorem and the L2 derivative along that line. Fubini's theorem for L^1 functions on a sigma-finite product and Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: iterated integrals of nonnegative and L1 functions over product domains agree. Cauchy-Schwarz inequality for L2: ∫∣fg∣≤∥f∥2∥g∥2; in particular ∣1∣A∣∫Ah∣2≤1∣A∣∫A∣h∣2 for h∈L2(A).

[L3]

Charts, flattening, density and change of variables. Bounded C^k domains and boundary charts: about each boundary point there is a C1 flattening chart Φ of the local graph, with C1 inverse, mapping the local piece of Ω exactly onto the half-box {t<0}; on compact patches the chart and its inverse have bounded first derivatives. C^k boundary flattening preserves local W^{k,p} (Countable Choice, k=1, p=2): composition with such a chart is a bounded operation on W1,2 between the compact patches, in both directions when the patches correspond. Ambient smooth restrictions are dense on bounded C^k domains (Axiom of Choice, k=1, p=2): the restrictions to Ω of compactly supported smooth functions are dense in W1,2(Ω). A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions (Countable Choice): a C1 diffeomorphism T gives ∫f dλ=∫(f∘T)∣det⁡DT∣ dλ for nonnegative measurable f.

[L5]

Choice. The Axiom of Choice supplies the density and localization interfaces of [L1] and [L3], the ACL interface of [L2], and the countable selection of density approximants. The Axiom of Countable Choice (ACω) is declared by the Sobolev, flattening and change-of-variables interfaces of [L1] and [L3].

Proof

1.1L1L2

Let R=∏i=13Ii be a box of positive side lengths and u∈W1,2(R∘). For almost every pair x,y∈R, put p0=x and pi=(y1,…,yi,xi+1,…,x3) for 1≤i≤3, so p3=y. The telescoping sum gives ∣u(x)−u(y)∣2≤3∑i=13∣u(pi−1)−u(pi)∣2. Along the coordinate segment from pi−1 to pi, ACL and Cauchy--Schwarz [L2] bound its squared difference by ∣Ii∣∫Ii∣∂iu(y1,…,yi−1,s,xi+1,…,x3)∣2ds. Fubini makes all these statements valid for almost every pair; integrating in x,y gives ∫R∫R∣u(pi−1)−u(pi)∣2dx dy≤∣R∣ ∣Ii∣2∫R∣∂iu∣2. Thus ∫R∫R∣u(x)−u(y)∣2dx dy≤CR∣R∣∫R∣∇u∣2 with CR=3max⁡i∣Ii∣2.

2.1step 1.1L1L2

The identity u(x)−uR=∣R∣−1∫R(u(x)−u(y))dy and averaged Cauchy--Schwarz [L2], integrated in x, give ∫R∣u−uR∣2≤∣R∣−1∫R∫R∣u(x)−u(y)∣2dx dy≤CR∫R∣∇u∣2. A nonempty half-box obtained by truncating the third interval at zero is itself a product of three intervals, so the same coordinate-line proof applies to it; no ACL assertion along arbitrary slanted segments is used.

3.1step 2.1L3algebra

Shrink each graph chart to the inverse image of a box compactly contained in its ambient chart range; its intersection U with Ω maps to a half-box H. For v smooth near Ω‾, w=v∘Φ−1 is C1 on H‾, which suffices for step 2.1. The mean vU minimizes ∫U∣v−a∣2 over constants a: expanding about vU gives ∫U∣v−a∣2=∫U∣v−vU∣2+∣U∣∣a−vU∣2. Choose a=wH. The bounded Jacobian and inverse-chart derivatives [L3] then give ∫U∣v−vU∣2≤∫U∣v−wH∣2≤C∫H∣w−wH∣2≤CU∫U∣∇v∣2. Interior boxes obey step 2.1 directly.

4.1step 3.1L1L2L3L4L5

The ambient chart boxes of step 3.1 and interior boxes cover the compact closure, so a finite subcover gives Ω=⋃j=1NUj with nonempty open patches. Every nonempty overlap is open in R3, contains a box, and has positive measure. The graph joining nonempty overlaps is connected: otherwise its component unions would partition the connected Ω into disjoint nonempty relatively open sets [L4]. Choose ambient smooth approximants vm→v in H1(Ω) using density [L3] and Countable Choice [L5]. Restrictions and gradients converge in L2, and ∣(vm)Uj−vUj∣≤∣Uj∣−1/2∥vm−v∥L2(Uj) by [L2]. Hence step 3.1 passes to the limit, giving ∫Uj∣v−vUj∣2≤Cj∫Uj∣∇v∣2.

5.1step 4.1L2algebra

For an edge (j,k), integrating ∣vUj−vUk∣2≤2∣vUj−v(x)∣2+2∣v(x)−vUk∣2 over its positive-measure overlap and using step 4.1 bounds the squared mean difference by a cover-dependent constant times ∫Ω∣∇v∣2. A path of at most N−1 edges from 1 to j exists by connectedness; the squared sum of its differences is at most the path length times the sum of their squares. Thus ∣vUj−vU1∣2≤C′′∫Ω∣∇v∣2 for every j, also for N=1 when the difference is zero.

6.1step 3.1step 4.1step 5.1L5∎

The constant-minimization identity of step 3.1 on Ω gives ∫Ω∣v−vΩ∣2≤∫Ω∣v−vU1∣2≤∑j∫Uj∣v−vU1∣2≤2∑j∫Uj∣v−vUj∣2+2∑j∣Uj∣∣vUj−vU1∣2. Step 4.1 bounds the first sum by 2∑jCj∫Ω∣∇v∣2, and step 5.1 bounds the second by a cover-dependent multiple of the same integral. Taking square roots gives the stated estimate with a constant depending only on the fixed domain and cover. The choice uses are those recorded in [L5].

Depends on

Dependency tree · 2 levels

Sources