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 and let be a nonempty bounded connected open set whose boundary is covered by finitely many graph charts. Give its Sobolev norm, let be the -closure of , and let have the finite-chart Slobodeckij norm. Define with its quotient norm. The trace induces a bounded linear bijection 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 , with equivalent quotient norms. A continuous linear functional on descends to the constant quotient exactly when it annihilates constants, and its descended functional has the quotient dual norm.
Statement references
Facts & Assumptions
Given: The Axiom of Choice and Countable Choice; the bounded domain; the trace operator ; and the quotient spaces in the statement.
The trace is bounded from into and is onto. (The sharp trace theorem: boundedness and range in the fractional space)
The kernel of the trace is exactly , 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)
There is a bounded right inverse with . (A bounded right inverse of the trace, supported in a prescribed collar)
The trace-page boundary norm is a finite-chart Slobodeckij norm on almost-everywhere boundary classes. (The fractional Sobolev space on a compact boundary)
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 ())
Proof
Given: The data in the statement.
If , then [F2] gives , so is well-defined on . By [F1], for every representative ; taking the infimum over its coset gives . If , [F2] gives , hence ; thus the induced map is injective.
By [F1], every is for some , so is onto. More quantitatively, choose the lift from [F3]. Then and , proving that the inverse is bounded.
The trace of a constant function is that same constant, so maps the closed constant subspace onto the constant subspace of . 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.
If is a continuous linear functional on that annihilates constants, then is independent of the representative because for every constant . By the quotient-norm definition, , so is continuous with quotient dual norm at most . Conversely, any functional that factors as vanishes on constants because ; and because the quotient map 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
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The fractional Sobolev space on a compact $C^1$ boundary
- The notation $H^k$ and the reserved zero-boundary symbol
- Zero-boundary Sobolev space as a norm closure
- A bounded right inverse of the trace, supported in a prescribed collar
- The kernel of the trace is the closure of the test functions
- The sharp trace theorem: boundedness and range in the fractional space
Used by
- Weak Dirichlet-to-Neumann map for bounded conductivities Definition
- Centered Neumann voltage sequences on the three-dimensional ball Lemma
- Centered NtD data control the exact CGO identity with its modulation factor Lemma
- DN spectrum of a concentric radial conductivity inclusion Lemma
- Mean-zero weak Neumann problem for uniformly elliptic conductivities Lemma
- Planar BV logarithmic Calderón stability Lemma
- Planar DN comparison under disk enclosure and conductivity reciprocation Lemma
- Uniform NtD estimates from a fixed harmonic boundary collar Lemma
- Well-posedness of the weak conductivity Dirichlet-to-Neumann map Lemma
- Logarithmic L2 stability for Calderón conductivity classes Theorem
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
- Petru Mironescu, Fine properties of functions: an introduction (author-hosted 89-page edition) (standard reference, not scraped)
- Pedro Caro, Andoni García and Juan Manuel Reyes, Stability of the Calderón problem for less regular conductivities (standard reference, not scraped)