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.
Lipschitz polyhedral boundary, orientation, and trace spaces
Definition
Assume Countable Choice.
Let be a nonempty bounded connected open subset of whose boundary is a compact connected orientable Lipschitz surface. A Lipschitz graph chart is a rigid coordinate change in which is the graph of a Lipschitz function on an open subset of , with on one side of that graph. A polyhedral boundary is such a boundary made from finitely many planar polygonal faces meeting along edges and vertices; all surface-discretization claims below use this polyhedral subclass. Put and assume is connected. For the fixed-atlas space conventions below, the boundary data include a compatible Borel surface measure and an almost-everywhere unit outward normal , with the following graph realizations and bounded positive graph area densities on every chosen chart. These compatible realizations are supplied data for the Countable-Choice space assertions, not conclusions from bare Lipschitzness under Countable Choice. Under the Axiom of Choice, Sobolev pullback and Green identity on Lipschitz graphs constructs them for every compact Lipschitz boundary and proves their compatibility; the general analytical trace and layer theorems state that axiom. On polyhedral charts the data are directly the finite face areas and face normals. The normal points from into . In a rigid chart with above the graph it is almost everywhere; reverse the sign when the domain is below the graph. Rigid coordinates transform this vector to physical coordinates. The graph surface measure is . Compatibility on overlaps is part of the fixed boundary data; the cited AC graph theorem proves it for arbitrary Lipschitz charts. On a polyhedron these are the face-area measure and outward face normals.
Fix a finite Lipschitz graph atlas , with surface parametrizations in the rigid chart coordinates, and a subordinate finite Lipschitz partition of unity whose chartwise supports have positive distance from the chart edges. On , use the real subspace of the real-order Bessel-potential completion in Real-order Bessel-potential completion H^s. Its published norm uses the weight . Fix here the equivalent Hilbert norm The inequalities identify the same completion and classes under the negative-sign Fourier convention of Real-order H^s as weighted Fourier distributions. Define the real space by requiring every localized chart pullback , extended by zero outside its chart, to belong to that Euclidean space, and fix the square-sum chart norm Its inner product is the sum of the real weighted Fourier inner products. The following fixed-data norm and completeness assertions use only Countable Choice and the supplied compatible measure with bounded positive chart densities; they make no geometry-existence or atlas-compatibility assertion under that weaker axiom. This Hilbert norm is equivalent to the finite sum of chart norms: . It controls , because graph surface Jacobians are bounded above and below and . It is complete: a chart-norm Cauchy sequence has a global limit by that bound; its localized pullbacks converge in to the pullbacks of this limit, while completeness of each Euclidean weighted space gives convergence in each norm. The two limits agree, so the limit belongs to the defined chart space and convergence holds in the finite square sum.
Let real be the continuous real dual, with its operator norm and pairing ; the dual of this real Hilbert space is Hilbert by Riesz representation for Hilbert spaces. The interior and exterior traces of an function are denoted and ; their common chartwise trace space is once the applicable trace theorem is proved. This fixed-atlas chart-space convention applies to the stated Lipschitz geometry, including its polyhedral and subclasses. It defines the Hilbert and dual norms; no boundary trace or lifting theorem is assumed by that convention.
The complex space is the Hilbert complexification of the real space: . Its is the continuous conjugate dual, with pairing linear in the density and conjugate-linear in the trace, extending the real pairing. A complex density is a distribution via the bilinear test action . For either scalar field the continuous realization uses in the complex case and in the real case. These inclusions follow from the just-proved bound and Cauchy–Schwarz.
No smoothness at edges or vertices is included in this definition. The normal is only used almost everywhere. On every Lipschitz boundary use the intrinsic graph surface measure just specified, with the chart partition; on a polyhedral boundary it equals the sum of planar face-area measures. The general Lipschitz class and its subclass therefore use the same measure and orientation conventions.
Depends on
- Real-order Bessel-potential completion H^s
- Real-order H^s as weighted Fourier distributions
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Cauchy–Schwarz: $|\langle u,v\rangle|\leq\lVert u\rVert\lVert v\rVert$, with equality exactly for linearly dependent vectors
- Riesz representation for Hilbert spaces
- $L^2$ with the integral pairing is a Hilbert space
- Sobolev pullback and Green identity on Lipschitz graphs
Used by
- Calderon boundary operators and trace conventions Definition
- Shape-regular surface meshes and conforming P0 densities Definition
- The combined-field operator for smooth-boundary Helmholtz scattering Definition
- The finite-energy double-layer transmission space Definition
- Weak Laplace single-layer potentials and energy spaces Definition
- A reentrant polyhedral edge has an H1 harmonic singularity Example
- Exterior finite-energy functions have a trace controlled by their gradient Lemma
- Finite-energy transmission pairs have the double-layer kernel representation across polyhedral edges Lemma
- Lipschitz finite-energy transmission pairs have the double-layer kernel representation Lemma
- P0 averages approximate smooth densities in H negative one half Lemma
- Smooth-boundary trace lifts and Sobolev Helmholtz layer extensions Lemma
- The chart and chordal surface H1/2 norms are equivalent Lemma
- The H1 trace and lifting theorem on a compact Lipschitz boundary Lemma
- A certified matrix defect transfers to a Galerkin error bound Theorem
- P0 Galerkin BEM for the single layer is well posed and quasioptimal Theorem
- The double-layer potential has the stated jumps and bounds Theorem
- The hypersingular operator is elliptic modulo constants Theorem
- The three-dimensional single layer is bounded and coercive Theorem
Dependency tree · two levels
60 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
- Martin Costabel, Boundary Integral Operators on Lipschitz Domains: Elementary Results (1988) (standard reference, not scraped)
- Francisco-Javier Sayas, First Steps in the Boundary Element Method (2015 lecture notes) (standard reference, not scraped)