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.
Weak tangential trace on a Lipschitz polyhedron
Statement
Let be a bounded Lipschitz polyhedron admitting a finite matching affine tetrahedral mesh as in Matching affine simplicial meshes and shape regularity. Use the product spaces and , with , using the scalar conventions of Integer-order Sobolev spaces and their norms and Zero-boundary Sobolev space as a norm closure. Put with quotient norm , and write for its real norm dual. For , the formula defines a bounded linear functional on , independent of the representative . For , meaning restrictions of fields on a neighborhood of , it equals . Thus is the weak tangential trace in the trace-quotient norm. In particular, every element of Zero tangential trace H(curl) space has zero weak tangential trace. No converse characterization of that closure is asserted here.
Facts & Assumptions
Given: Countable Choice; a bounded Lipschitz polyhedron and as in The real H(curl) graph space on a polyhedron. The quotient and closure conventions are those of Integer-order Sobolev spaces and their norms and Zero-boundary Sobolev space as a norm closure.
Countable Choice is assumed for the Sobolev closure, representative, and smooth-density interfaces used below; no full Axiom of Choice is used. (The Axiom of Countable Choice ())
The distributional curl is the class characterized by for all compactly supported smooth vector tests. (The real H(curl) graph space on a polyhedron)
is the -closure of compactly supported smooth vector fields, and the quotient norm is the infimum of lift norms. (Zero-boundary Sobolev space as a norm closure, Integer-order Sobolev spaces and their norms)
is the graph-norm closure of compactly supported smooth vector fields. (Zero tangential trace H(curl) space)
On every affine tetrahedron , the integral of the divergence of a field equals the sum of its outward face fluxes. (Gauss–Green formula on an affine simplex)
Interior face orientations of a matching tetrahedral mesh cancel in the sum of cell boundaries. (Interior facet orientations cancel in a matching mesh)
A compact subset of an open set admits a smooth cutoff equal to one near that compact set. (A Euclidean bump for a compact set inside an open set)
Under Countable Choice, a compactly supported function in has an zero extension, and compactly supported smooth functions are dense in (the density statement is used with ). (Compactly supported Sobolev functions extend by zero in every integer order, Compactly supported smooth functions are dense in W^{k,p}(R^n))
Under Countable Choice, multiplication by a smooth compactly supported function is continuous on and obeys the weak Leibniz rule. (Weak Leibniz rule with a smooth factor)
For scalar real functions, . (Cauchy-Schwarz inequality for )
Proof
If , choose converging to in by [F2]. The difference of the two proposed pairings is . The convergence of both fields and curls permits passage to the limit from , and each approximating pairing is zero by [F1]. Hence the formula is independent of the representative.
For as specified in the statement, apply [F4] on every tetrahedron to , using . By [F5], interior face fluxes cancel, while the remaining boundary flux is ; hence the formula is the stated boundary integral.
For real vector fields , componentwise use of [F9] gives ; applying [F9] again on the three-point counting measure to the component norms bounds this sum by . Applying this inequality to and gives . A further [F9] application on the two-point counting measure bounds the right side by . The coordinate formula for curl and give , hence . Taking the infimum over all lifts of the quotient class proves boundedness in the quotient norm. Linearity follows from the integral formula.
If converges to in the graph norm, choose a cutoff equal to one near the compact support of by [F6]. For any , has compact support in and its zero extension lies in by [F7]. Choose another cutoff equal to one on that support. Approximate the zero extension by using [F7]; then and in by [F8], proving . For each , [F1] applied to and the compactly supported smooth test gives . Since convergence implies convergence of both and , Cauchy–Schwarz passes this identity to the limit . Because and on the support of , the limiting identity is . Step 2.1 gives in , so the limit trace is zero.
Depends on
- The real H(curl) graph space on a polyhedron
- Zero tangential trace H(curl) space
- Matching affine simplicial meshes and shape regularity
- Oriented simplicial cell chains and boundary
- Integer-order Sobolev spaces and their norms
- Zero-boundary Sobolev space as a norm closure
- Gauss–Green formula on an affine simplex
- Interior facet orientations cancel in a matching mesh
- A Euclidean bump for a compact set inside an open set
- Compactly supported Sobolev functions extend by zero in every integer order
- Compactly supported smooth functions are dense in W^{k,p}(R^n)
- Weak Leibniz rule with a smooth factor
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Cauchy-Schwarz inequality for $L^2$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
58 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
- Long Chen, Finite Element Methods for Maxwell Equations, complete lecture notes (standard reference, not scraped)
- Ralf Hiptmair and Clemens Pechstein, Regular Decompositions of Vector Fields—Continuous, Discrete, and Structure-Preserving (standard reference, not scraped)