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.

Discrete gradient gap from a relative commuting projection

Statement

Assume AC. Let Ω⊂R3 be nonempty, bounded, and open. Write H=L2(Ω;R3), B=∇H01(Ω), and let PB denote the H-orthogonal projection onto B. Let Sh⊂H01(Ω) and Vh⊂H0(curl⁡;Ω) be finite-dimensional subspaces with Bh=∇Sh⊂Vh. Suppose linear projections Πh0:H01→Sh and Πh1:H0(curl⁡)→Vh satisfy Πh1∇=∇Πh0. For vh∈Vh∩Bh⊥, put wh=(I−PB)vh. Then wh∈H0(curl⁡)∩B⊥, curl⁡wh=curl⁡vh, and ∥vh−wh∥2≤∥Πh1wh−wh∥2. If moreover sup⁡h∥Πh1∥H→H≤M and Πh1f→f in H for each fixed f∈H0(curl⁡), every H-convergent sequence of lifts wh has ∥vh−wh∥2→0. Here the H operator norm means that the graph-space operators possess bounded extensions to H.

Facts & Assumptions

Given: AC, the spaces and relative commuting projections in the Statement. When the domain and mesh satisfy the projection theorem's hypotheses, its separate homogeneous family supplies a concrete instance of these relative-degree-zero, L2-boundedness and strong-convergence interfaces. The present result is conditional only on the abstract projection hypotheses in its own Statement, and the unrestricted family is not used here.

[F2]

A nonempty closed convex subset of a real Hilbert space has a unique nearest point under CC, characterized by the variational inequality. (Projection onto a nonempty closed convex set, Variational characterisation of the nearest point)

[F3]

Sobolev spaces are complete under AC; H01 is a closed subspace by its closure definition. Real L2 is Hilbert under CC, and compactly supported smooth functions are dense in L2 on every open set under CC, applied in each of three components. (Integer-order Sobolev spaces are Banach, L2 with the integral pairing is a Hilbert space, Smooth compactly supported functions of an open set are dense in L2)

[A1]

AC implies the CC used in [F1] and [F2]. (The Axiom of Choice)

Proof

1.1F1F2F3A1givenconstruct

If ∇pn is Cauchy in H, [F1] makes pn Cauchy in H01, so its limit p∈H01 has ∇pn→∇p. Thus B is closed. Apply [F2] to B. For its nearest point PBv, testing the variational inequality with PBv±b, b∈B, gives v−PBv⊥B. Uniqueness of this decomposition proves linearity, and its Pythagorean identity proves that PB and I−PB are contractions. Finally, if p∈H01, smooth compactly supported approximation shows ∇p∈H0(curl⁡) with curl zero: convergence of the gradients is convergence in the curl graph norm. Therefore wh=vh−PBvh has the stated membership and curl.

2.1step 1.1givenalgebra

Write vh−wh=∇ph with ph∈H01, and put eh=vh−Πh1wh. Identity on Vh and commutation give eh=Πh1(vh−wh)=∇Πh0ph∈Bh. Both vh and wh are orthogonal to Bh, hence (vh−wh,eh)=0. Since vh−wh=eh+(Πh1wh−wh), Cauchy–Schwarz yields ∥vh−wh∥22=(vh−wh,Πh1wh−wh)≤∥vh−wh∥2∥Πh1wh−wh∥2. Division if the left factor is nonzero proves the inequality; the zero case is immediate. This is the missing discrete-gradient estimate.

3.1F3step 2.1givenalgebra∎

Suppose wh→w in H. The L2 extensions of the projections converge strongly to identity on all H: first approximate an arbitrary f∈H by a smooth compactly supported vector field g, then use ∥(I−Πh1)f∥2≤(1+M)∥f−g∥2+∥(I−Πh1)g∥2. Consequently ∥Πh1wh−wh∥2≤(1+M)∥wh−w∥2+∥Πh1w−w∥2→0. Step 2.1 gives the last assertion.

Depends on

Used by

Dependency tree · two levels

72 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