Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 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.

Boundary trace quotient and chart norm equivalence

Statement

Assume the Axiom of Choice and Countable Choice. Let n≥2 and let Ω⊂Rn be a nonempty bounded connected open set whose boundary is covered by finitely many C1 graph charts. Give H1(Ω;K)=W1,2(Ω;K) its Sobolev norm, let H01(Ω;K) be the H1-closure of Cc∞(Ω;K), and let W1/2,2(∂Ω;K) have the finite-chart Slobodeckij norm. Define D(Ω):=H1(Ω;K)/H01(Ω;K) with its quotient norm. The trace induces a bounded linear bijection T‾:D(Ω)→W1/2,2(∂Ω;K) with bounded inverse, so these two norms are equivalent under the induced identification. The induced map after quotienting by constants is also a bounded linear bijection D(Ω)/K1→W1/2,2(∂Ω;K)/K, with equivalent quotient norms. A continuous linear functional on W1/2,2(∂Ω;K) descends to the constant quotient exactly when it annihilates constants, and its descended functional has the quotient dual norm.

Facts & Assumptions

Given: The Axiom of Choice and Countable Choice; the bounded C1 domain; the trace operator T; and the quotient spaces in the statement.

[F1]

The trace is bounded from H1(Ω) into W1/2,2(∂Ω) and is onto. (The sharp trace theorem: boundedness and range in the fractional space)

[F2]

The kernel of the trace is exactly H01(Ω), the closure of compactly supported smooth functions. (The kernel of the trace is the closure of the test functions, Zero-boundary Sobolev space as a norm closure)

[F3]

There is a bounded right inverse R:W1/2,2(∂Ω)→H1(Ω) with TRf=f. (A bounded right inverse of the trace, supported in a prescribed collar)

[F4]

The trace-page boundary norm is a finite-chart Slobodeckij norm on almost-everywhere boundary classes. (The fractional Sobolev space on a compact C1 boundary)

[A1]

The Axiom of Choice and Countable Choice are assumed at the cited trace and boundary-space interfaces. (The Axiom of Choice, The Axiom of Countable Choice (ACω))

Proof

Given: The data in the statement.

1.1F1F2F4givenalgebra

If u−v∈H01(Ω), then [F2] gives Tu=Tv, so T‾[u]:=Tu is well-defined on D(Ω). By [F1], ∥T‾[u]∥W1/2,2(∂Ω)≤C∥u∥H1(Ω) for every representative u; taking the infimum over its coset gives ∥T‾[u]∥≤C∥[u]∥D. If T‾[u]=0, [F2] gives u∈H01, hence [u]=0; thus the induced map is injective.

1.2A1F1F3givenconstruct

By [F1], every f∈W1/2,2(∂Ω) is Tu for some u∈H1(Ω), so T‾ is onto. More quantitatively, choose the lift Rf from [F3]. Then T‾[Rf]=f and ∥[Rf]∥D≤∥Rf∥H1≤C∥f∥W1/2,2, proving that the inverse is bounded.

2.1step 1.1step 1.2givenalgebra

The trace of a constant function is that same constant, so T‾ maps the closed constant subspace K1⊂D(Ω) onto the constant subspace of W1/2,2(∂Ω). The bounded isomorphism and its bounded inverse from steps 1.1–1.2 therefore induce a bounded isomorphism on the two quotient spaces, with equivalent quotient norms.

3.1givenalgebra∎

If ℓ is a continuous linear functional on W1/2,2(∂Ω) that annihilates constants, then ℓ˙([f]):=ℓ(f) is independent of the representative because ℓ(f+c)=ℓ(f) for every constant c. By the quotient-norm definition, ∣ℓ˙([f])∣≤∥ℓ∥inf⁡c∥f+c∥W1/2,2, so ℓ˙ is continuous with quotient dual norm at most ∥ℓ∥. Conversely, any functional that factors as ℓ=φ∘q vanishes on constants because q(c)=0; and ∣φ(qf)∣≤∥φ∥∥qf∥≤∥φ∥∥f∥ because the quotient map q has norm at most one. Hence ∥ℓ∥≤∥φ∥, while the first inequality gives ∥φ∥≤∥ℓ∥ for the induced functional. This proves the equivalence and equality of dual norms.

Depends on

Used by

Dependency tree · two levels

42 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