Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 Ω⊂R3 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 H1(Ω;R3):=(H1(Ω;R))3 and H01(Ω;R3):=(H01(Ω;R))3, with ∥v∥H12:=∑j=13(∥vj∥22+∑∣α∣=1∥Dαvj∥22), using the scalar conventions of Integer-order Sobolev spaces and their norms and Zero-boundary Sobolev space as a norm closure. Put T(∂Ω):=H1(Ω;R3)/H01(Ω;R3) with quotient norm ∥[v]∥T:=inf⁡z∈H01∥v+z∥H1, and write T(∂Ω)′ for its real norm dual. For u∈H(curl⁡;Ω), the formula ⟨γτu,[v]⟩:=∫Ω(curl⁡u⋅v−u⋅curl⁡v) dx defines a bounded linear functional on T(∂Ω), independent of the representative v. For u,v∈C1(Ω‾;R3), meaning restrictions of C1 fields on a neighborhood of Ω‾, it equals ∫∂Ω(n×u)⋅v dS. Thus γτu 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 u∈H(curl⁡;Ω) 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.

[A1]

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 (ACω))

[F1]

The distributional curl is the L2 class characterized by ∫Ωcurl⁡u⋅φ=∫Ωu⋅curl⁡φ for all compactly supported smooth vector tests. (The real H(curl) graph space on a polyhedron)

[F2]

H01(Ω;R3) is the H1-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)

[F3]

H0(curl⁡;Ω) is the graph-norm closure of compactly supported smooth vector fields. (Zero tangential trace H(curl) space)

[F4]

On every affine tetrahedron K, the integral of the divergence of a C1(K‾) field equals the sum of its outward face fluxes. (Gauss–Green formula on an affine simplex)

[F5]

Interior face orientations of a matching tetrahedral mesh cancel in the sum of cell boundaries. (Interior facet orientations cancel in a matching mesh)

[F6]

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)

[F7]

Under Countable Choice, a compactly supported H1 function in Ω has an H1(R3) zero extension, and compactly supported smooth functions are dense in H1(R3) (the density statement is used with p=2<∞). (Compactly supported Sobolev functions extend by zero in every integer order, Compactly supported smooth functions are dense in W^{k,p}(R^n))

[F8]

Under Countable Choice, multiplication by a smooth compactly supported function is continuous on H1 and obeys the weak Leibniz rule. (Weak Leibniz rule with a smooth factor)

[F9]

For scalar real L2 functions, ∫∣fg∣≤∥f∥2∥g∥2. (Cauchy-Schwarz inequality for L2)

Proof

1.1A1F1F2givenconstruct

If v1−v2∈H01(Ω;R3), choose φm∈Cc∞(Ω;R3) converging to v1−v2 in H1 by [F2]. The difference of the two proposed pairings is ∫Ω(curl⁡u⋅(v1−v2)−u⋅curl⁡(v1−v2)). The L2 convergence of both fields and curls permits passage to the limit from φm, and each approximating pairing is zero by [F1]. Hence the formula is independent of the representative.

1.2F4F5algebra

For u,v∈C1(Ω‾;R3) as specified in the statement, apply [F4] on every tetrahedron to u×v, using div⁡(u×v)=v⋅curl⁡u−u⋅curl⁡v. By [F5], interior face fluxes cancel, while the remaining boundary flux is n⋅(u×v)=(n×u)⋅v; hence the formula is the stated boundary integral.

2.1F1F2F9step 1.1algebra

For real vector fields a,b∈L2(Ω;R3), componentwise use of [F9] gives ∣∫Ωa⋅b∣≤∑j=13∥aj∥2∥bj∥2; applying [F9] again on the three-point counting measure to the component norms bounds this sum by ∥a∥2∥b∥2. Applying this inequality to (a,b)=(curl⁡u,v) and (u,curl⁡v) gives ∣⟨γτu,[v]⟩∣≤∥curl⁡u∥2∥v∥2+∥u∥2∥curl⁡v∥2. A further [F9] application on the two-point counting measure bounds the right side by ∥u∥H(curl⁡)(∥v∥22+∥curl⁡v∥22)1/2. The coordinate formula for curl and (a−b)2≤2(a2+b2) give ∥curl⁡v∥22≤2∑ℓ,m∈{x,y,z}∥∂ℓvm∥22, hence (∥v∥22+∥curl⁡v∥22)1/2≤2∥v∥H1. Taking the infimum over all lifts of the quotient class proves boundedness in the quotient norm. Linearity follows from the integral formula.

3.1A1F1F3F6F7F8step 2.1algebra∎

If um∈Cc∞ converges to u∈H0(curl⁡) in the graph norm, choose a cutoff χ equal to one near the compact support of um by [F6]. For any v∈H1, χv has compact support in Ω and its zero extension lies in H1(R3) by [F7]. Choose another cutoff θ∈Cc∞(Ω) equal to one on that support. Approximate the zero extension by gj∈Cc∞(R3) using [F7]; then qj:=θgj∈Cc∞(Ω) and qj→χv in H1 by [F8], proving χv∈H01. For each j, [F1] applied to um and the compactly supported smooth test qj gives ∫Ωcurl⁡um⋅qj=∫Ωum⋅curl⁡qj. Since H1 convergence implies L2 convergence of both qj and curl⁡qj, Cauchy–Schwarz passes this identity to the limit qj→χv. Because χ=1 and ∇χ=0 on the support of um, the limiting identity is ∫Ω(curl⁡um⋅v−um⋅curl⁡v)=0. Step 2.1 gives γτum→γτu in T′, so the limit trace is zero.

Depends on

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