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.

The level-set kernel measure estimate for the Slobodeckij kernel

Statement

Assume the Axiom of Countable Choice. Let d≥1, 0<θ<1, 1≤p<∞ with pθ<d, let x∈Rd and let E⊆Rd be Lebesgue measurable with 0<∣E∣<∞. Then ∫Rd∖E∣x−y∣−d−pθ dy ≥ c(d,p,θ) ∣E∣−pθ/d. One admissible constant is c=dpθ ω1+pθ/d, where ω:=∣B(0,1)∣ denotes the Lebesgue measure of the unit ball.

Facts & Assumptions

Given: the Axiom of Countable Choice, d≥1, 0<θ<1, 1≤p<∞ with pθ<d, a point x∈Rd, and a Lebesgue measurable set E⊆Rd with 0<∣E∣<∞. Write ω:=∣B(0,1)∣ for the unit-ball measure and ρ:=(∣E∣/ω)1/d>0.

[F2]

C1 change of variables for nonnegative Borel functions. If U,V⊆Rm are open and T:U→V is a C1 diffeomorphism, then every nonnegative Borel h:V→[0,∞] satisfies ∫Vh(y) dy=∫Uh(T(w))∣det⁡DT(w)∣ dw, with 0⋅∞=0 allowed. (Borel change of variables from the compact-support formula and Radon uniqueness)

[F3]

Polar coordinates. For every nonnegative Borel f:Rd→[0,∞], ∫Rdf(z) dz=∫0∞∫Sd−1f(rζ)rd−1 dσ(ζ) dr, where σ is the finite Borel surface measure on the unit sphere. (Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma, The polar surface set function on the unit sphere)

[F4]

Measures of set differences. If A⊆B are measurable with ∣A∣<∞, then ∣B∣=∣A∣+∣B∖A∣. (Measure of a set difference when the smaller set has finite measure)

[F5]

Additivity and monotonicity of the nonnegative integral. For measurable g,h:X→[0,∞]: ∫(g+h)=∫g+∫h, and g≤h implies ∫g≤∫h; moreover ∫cg=c∫g for real c>0; for c=0 the zero function has integral 0. (Additivity of the nonnegative Lebesgue integral, Monotonicity and nonnegative homogeneity of the nonnegative integral)

Proof

technique · Choose the radius $\rho$ carrying the mass of $E$, split the complement of $E$ into its part inside and outside $B(x,\rho)$, use the lower bound $|x-y|\ge\rho$ on the outer part and on $E\setminus B(x,\rho)$ to reach all of $B(x,\rho)^c$, and evaluate the resulting radial integral in polar coordinates
1.1F1F2F4given

The map T(w)=x+ρw is a C1 diffeomorphism of Rd with det⁡DT=ρd, so [F2] applied to the indicator of B(x,ρ) gives ∣B(x,ρ)∣=∫1B(x,ρ)(y) dy=ρd∫1B(0,1)(w) dw=ρdω=∣E∣. Since E∩B(x,ρ)⊆B(x,ρ) and E∩B(x,ρ)⊆E are measurable with ∣E∩B(x,ρ)∣≤∣E∣<∞, [F4] gives ∣(Rd∖E)∩B(x,ρ)∣=∣B(x,ρ)∣−∣E∩B(x,ρ)∣=∣E∣−∣E∩B(x,ρ)∣=∣E∖B(x,ρ)∣.

2.1F5step 1.1

Write C1:=(Rd∖E)∩B(x,ρ) and C2:=(Rd∖E)∩B(x,ρ)c; these are disjoint measurable sets with union Rd∖E. On C1 one has ∣x−y∣−d−pθ≥ρ−d−pθ, on C2 and on E∖B(x,ρ) one has ∣x−y∣≥ρ; hence [F5] gives ∫Rd∖E∣x−y∣−d−pθdy=∫C1+∫C2≥ρ−d−pθ∣C1∣+∫C2∣x−y∣−d−pθdy=ρ−d−pθ∣E∖B(x,ρ)∣+∫C2∣x−y∣−d−pθdy≥∫E∖B(x,ρ)∣x−y∣−d−pθdy+∫C2∣x−y∣−d−pθdy=∫B(x,ρ)c∣x−y∣−d−pθdy, where the last equality uses that E∖B(x,ρ) and C2 partition B(x,ρ)c.

3.1F1F2F3step 2.1∎

Substituting y=x+w by [F2] and evaluating the radial integrand by [F3], ∫B(x,ρ)c∣x−y∣−d−pθdy=∫∣w∣>ρ∣w∣−d−pθdw=σ(Sd−1)∫ρ∞r−1−pθdr=σ(Sd−1)pθρ−pθ. Applying [F3] to the indicator of B(0,1) gives ω=∫Sd−1 ⁣ ⁣∫01rd−1dr dσ=σ(Sd−1)/d, so σ(Sd−1)=dω and the lower bound is dωpθ(∣E∣/ω)−pθ/d=c ∣E∣−pθ/d with c=dpθω1+pθ/d>0 by [F1]; combined with step 2.1 this is the assertion.

Depends on

Used by

Dependency tree · two levels

76 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