Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

John domains and the John constant

Definition

Assume Countable Choice. Let n≥2 and let Ω⊆Rn be open, bounded and nonempty. Its boundary ∂Ω is then a nonempty compact subset of Rn contained in a sufficiently large closed ball (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space, For n≥1, every Euclidean closed ball and every Euclidean sphere of positive radius is compact), and the distance dist⁡(x,∂Ω) is defined for every x and is a 1-Lipschitz function of x (∣d(x,A)−d(y,A)∣≤d(x,y), so the distance to a fixed nonempty set is 1-Lipschitz).

Rectifiable curves, their arclength functions are used with the conventions of The arc-length function sγ(t)=L(γ∣[a,t]) of a rectifiable path.

John domain and John constant. A pair (Ω,x0) with x0∈Ω satisfies the John condition with constant c≥1 if for every x∈Ω there is a rectifiable curve γ:[0,l]→Ω parametrised by arclength, with γ(0)=x, γ(l)=x0 and dist⁡(γ(t),∂Ω)≥c−1∣x−γ(t)∣for every t∈[0,l]. Write cJ(Ω,x0) for the infimum of the admissible constants c≥1; with the convention inf⁡∅=+∞, this value belongs to [1,+∞]. The domain Ω is a John domain if cJ(Ω,x0)<∞ for some x0∈Ω, and cJ(Ω,x0) is the John constant of the pair (Ω,x0). The estimates below use an admissible constant, never the finiteness of the infimum alone, and whether the infimum is attained is immaterial.

Arclength form. If γ is arclength parametrised from x, then t≥∣γ(t)−x∣ for 0≤t≤l, because the straight segment from x to γ(t) is no longer than the curve. Hence a curve satisfying the arclength normalisation dist⁡(γ(t),∂Ω)≥c−1t for all t also satisfies the displayed relative-distance condition with the same constant c. Only this implication is used here; the chain construction below uses the displayed relative-distance condition.

Connectedness. A John domain is path-connected and hence connected: given x,y∈Ω, choose curves γx from x to x0 and γy from y to x0 as in the definition (under Countable Choice the two curves may be chosen simultaneously) and traverse γx followed by the reverse of γy. No regularity of ∂Ω is assumed beyond what the definition uses.

Depends on

Used by

Dependency tree · two levels

32 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