Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck 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.

H1-zero fields have zero weak H(div) normal trace

Statement

Assume Countable Choice and let D⊂Rd be open. Every real vector field w∈H01(D;Rd) belongs to H0(div⁡;D), where the latter is the kernel of the weak normal trace. In particular, div⁡w∈L2(D) and its weak normal trace vanishes on the whole boundary trace quotient.

Facts & Assumptions

Given: Countable Choice, an open set D, and w∈H01(D;Rd).

[A1]

Countable Choice selects the compactly supported smooth approximants in the H1-zero closure. (The Axiom of Countable Choice (ACω))

[F1]

Each component of H1(D;Rd) has its first weak derivatives in L2(D); their finite sum is the distributional divergence. (Integer-order Sobolev spaces and their norms, The real H(div) space)

[F2]

H01(D) is the H1-norm closure of Cc∞(D). (Zero-boundary Sobolev space as a norm closure)

[F3]

Green duality defines the weak normal trace by ⟨γnw,[ϕ]⟩=∫D(w⋅∇ϕ+(div⁡w)ϕ). (Weak normal trace by Green duality)

[F4]

H0(div⁡;D) is exactly the kernel of this weak normal trace. (Zero-normal-trace H(div) space)

[F5]

Cauchy–Schwarz controls each volume pairing in Green duality. (Cauchy-Schwarz inequality for L2)

Proof

1.1F1constructalgebra

Since each component of w and each first weak derivative is in L2(D) by [F1], the finite sum div⁡w=∑j=1d∂jwj lies in L2(D). Thus w∈H(div⁡;D) by its definition.

2.1A1F2F3F4F5choosealgebra∎

By [A1,F2], choose vector fields wn∈Cc∞(D;Rd) with wn→w in H1. For arbitrary ϕ∈H1(D), the weak-derivative identity for ϕ, tested against each compactly supported component (wn)j, gives ∫Dwn⋅∇ϕ+∫D(div⁡wn)ϕ=0. The H1 convergence implies wn→w in L2 and div⁡wn→div⁡w in L2. Specifically, [F5] bounds the difference of the Green pairings by ∥wn−w∥2∥∇ϕ∥2+∥div⁡wn−div⁡w∥2∥ϕ∥2⟶0. Thus ∫Dw⋅∇ϕ+∫D(div⁡w)ϕ=0. This holds for every ϕ∈H1(D); hence [F3] gives γnw=0, and [F4] implies w∈H0(div⁡;D).

Depends on

Used by

Dependency tree · two levels

25 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