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.

H(div) is Hilbert and H0(div) is closed

Statement

Assume Countable Choice. For every open D⊆Rd, the real space H(div⁡;D) with the graph inner product

(v,w)H(div⁡):=(v,w)L2(D;Rd)+(div⁡v,div⁡w)L2(D)

is a Hilbert space. Its subspace H0(div⁡;D) of Zero-normal-trace H(div) space is closed, hence is Hilbert with the restricted inner product.

Facts & Assumptions

Given: Countable Choice and an open set D⊆Rd.

[A1]

Countable Choice is inherited from the real L2 Hilbert-space interface used for graph completeness. (The Axiom of Countable Choice (ACω))

[F1]

Real L2 is complete for its integral inner product and quotient norm. (L2 with the integral pairing is a Hilbert space)

[F2]

The graph norm is ∥v∥H(div⁡)2=∥v∥22+∥div⁡v∥22. (The real H(div) space)

[F3]

The weak normal trace is bounded by the H(div) graph norm. (Weak normal trace by Green duality)

[F4]

Holder's inequality passes the two L2 pairings to their limits. (Holder's inequality for integrals, including the endpoint cases)

[F5]

A closed subspace of a Banach space is complete in the restricted norm. (A closed subspace of a Banach space is Banach)

Proof

1.1A1F1F2F4algebraalgebra

Let (vn) be Cauchy in the graph norm. By [F1] applied componentwise, vn→v in L2(D;Rd) and div⁡vn→g in L2(D) for some v,g. For every ϕ∈Cc∞(D;R), the distributional identity gives ∫Dvn⋅∇ϕ=−∫D(div⁡vn)ϕ. Holder's inequality [F4] passes both pairings to their L2 limits, so ∫Dv⋅∇ϕ=−∫Dgϕ. Hence g=div⁡v distributionally, v∈H(div⁡;D), and [F2] gives graph-norm convergence vn→v.

2.1F1F2step 1.1algebra

The displayed graph inner product is the sum of the real L2 inner products of v and its divergence, so it induces exactly the graph norm. By step 1.1 that norm is complete; therefore H(div) is Hilbert.

3.1F3F5step 2.1algebra∎

By [F3], if vn∈H0(div⁡;D) and vn→v in H(div), then γnvn→γnv in TD′. Since each γnvn=0, the limit trace is zero, so v∈H0(div⁡;D). This proves closedness; [F5] and step 2.1 show that the restricted inner-product space is complete.

Depends on

Used by

Dependency tree · two levels

39 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