Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (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.

Relative isoperimetric inequality on bounded connected Lipschitz domains

Statement

Assume Countable Choice, let n≥2, and let Ω⊆Rn be a bounded connected Lipschitz domain (a bounded open set with a finite Lipschitz graph cover of its boundary, with the domain on one side of each graph, and not separable into two disjoint nonempty relatively open subsets). There is a constant CΩ<∞ such that every measurable E⊆Ω with χE∈BV(Ω) satisfies min⁡{∣E∣,∣Ω∖E∣}(n−1)/n≤CΩP(E;Ω).

Facts & Assumptions

Given: Countable Choice, n≥2, a bounded connected Lipschitz domain Ω, and a finite-perimeter set E⊆Ω.

[F1]

Zero extension has a BV bound controlled by interior variation and the L1 norm. (BV extension and translation bounds)

[F2]

Under Countable Choice, a bounded BV sequence on Ω has an L1-convergent subsequence with a BV limit and lower semicontinuity. (Compactness and lower semicontinuity for bounded-domain BV)

[F3]

Zero distributional gradient on a connected open domain forces an almost-everywhere constant under Countable Choice. (A zero distributional gradient is constant on a connected domain)

[F4]

The full-space BV Sobolev inequality holds under Countable Choice. (BV Sobolev inequality in full space)

[F5]

Under Countable Choice, Lebesgue measure is finite on bounded sets. Every nonempty open subset of Rn contains an open box with positive side lengths, whose measure is their positive product; hence bounded nonempty openness gives 0<∣Ω∣<∞. (Lebesgue measure is a Radon measure on R^n, A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included)

Proof

Given: The hypotheses in the Statement. Put a=(n−1)/n.

1.1F1F4F5givenconstructalgebra

The empty domain gives the inequality with both sides zero, so assume Ω≠∅. Its openness and nonemptiness give an open box with positive side lengths contained in Ω, and its boundedness puts Ω inside a bounded box; [F5] therefore gives 0<∣Ω∣<∞. For m=min⁡(∣E∣,∣Ω∖E∣), take A to be the smaller side. Its indicator is BV: the distributional derivative of the constant function 1 in Ω is zero, so DχΩ∖E=−DχE and both sides have the same relative perimeter P. Its zero extension has Ln/(n−1) norm ma. By [F1] and [F4], ma≤C(m+P) for a fixed C≥1 depending only on Ω. If 0<m≤δ=(2C)−n, then Cm≤ma/2, so ma≤2CP. For m=0 the conclusion is immediate.

2.1F2F3step 1.1choosealgebra

Among sets with δ≤∣E∣≤∣Ω∣−δ, the relative perimeters have a positive lower bound, unless that family is empty. Otherwise, if the infimum were zero, Countable Choice would select a sequence Ej in this family with P(Ej;Ω)<1/j. Its indicators are uniformly BV-bounded. By [F2], a subsequence converges in L1(Ω) to v∈BV(Ω) with TV(v;Ω)=0. The distance from v(x) to {0,1} is bounded by ∣v(x)−χEj(x)∣ for every j, so its integral is zero by L1 convergence; hence v is an indicator almost everywhere. Its volume lies in [δ,∣Ω∣−δ] by L1 convergence. But its zero variation makes every coordinate distributional derivative zero, so [F3] makes v constant almost everywhere. An indicator constant must be zero or one, contradicting the volume bounds. This proves a positive lower bound bΩ whenever the family is nonempty.

3.1step 1.1step 2.1algebra∎

In the remaining case m≥δ, both side volumes meet the bounds in step 2.1, so P≥bΩ and ma≤(∣Ω∣/2)a≤(∣Ω∣/2)abΩ−1P. Combine this constant with 2C from step 1.1. If the intermediate-volume family is empty, step 1.1 already covers every set. Thus a finite domain constant gives the asserted inequality for every finite-perimeter E.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

56 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