Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)
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 normal trace by Green duality

Statement

Assume Countable Choice for the Sobolev-space interfaces below. Let D⊆Rd be open and v∈H(div⁡;D). Define the trace quotient TD:=H1(D)/H01(D),∥[w]∥TD:=inf⁡z∈H01(D)∥w+z∥H1(D). Then the formula

⟨γnv,[w]⟩:=∫D(v⋅∇w+(div⁡v)w) dx

is independent of the representative w, defines a bounded real linear functional γnv∈TD′, and satisfies ∥γnv∥TD′≤∥v∥H(div⁡;D). This functional is the weak normal trace; no pointwise boundary value is asserted.

Facts & Assumptions

Given: Countable Choice; an open set D; a real v∈H(div⁡;D); H1(D)=W1,2(D) and H01(D)=W01,2(D).

[A1]

Countable Choice is assumed by the cited Sobolev class and zero-boundary closure interfaces. (The Axiom of Countable Choice (ACω), Integer-order Sobolev spaces and their norms, Zero-boundary Sobolev space as a norm closure)

[F1]

The distributional divergence satisfies ∫Dv⋅∇ϕ+(div⁡v)ϕ=0 for every ϕ∈Cc∞(D;R). (The real H(div) space)

[F2]

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

[F3]

The real L2 Cauchy–Schwarz inequality controls both scalar pairings and the componentwise vector pairing. (Cauchy-Schwarz inequality for L2)

Proof

1.1F1F3algebra

For w∈H1(D) put Lv(w):=∫D(v⋅∇w+(div⁡v)w). The two integrals are finite by [F3], and Cauchy–Schwarz in R2 gives ∣Lv(w)∣≤∥v∥2∥∇w∥2+∥div⁡v∥2∥w∥2≤∥v∥H(div⁡;D)∥w∥H1(D). Thus Lv is a bounded real linear functional on H1(D).

2.1A1F1F2step 1.1choosealgebra

For every ϕ∈Cc∞(D;R), [F1] gives Lv(ϕ)=0. If z∈H01(D), then for each ε>0, [F2] gives such a ϕ with ∥z−ϕ∥H1<ε; step 1.1 yields ∣Lv(z)∣=∣Lv(z−ϕ)∣≤∥v∥H(div⁡)ε. Since this holds for every ε>0, Lv(z)=0. Therefore Lv is constant on each coset of H01(D) and defines γnv on TD.

3.1step 1.1step 2.1algebra∎

For any [w]∈TD, step 2.1 makes Lv(w) the same for every representative. Applying step 1.1 to every representative w+z, z∈H01(D), and taking the infimum of their H1 norms gives ∣⟨γnv,[w]⟩∣≤∥v∥H(div⁡;D)∥[w]∥TD. Hence γnv is bounded with the claimed norm.

Depends on

Used by

Dependency tree · two levels

23 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