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.

Separable H1-zero space and compact L2 inclusion on a cube

Statement

Assume Countable Choice and let Q=(0,1)d, d≥1. Then H01(Q;R) is a separable real Hilbert space. It satisfies ∥v∥L2(Q)≤∥∂0v∥L2(Q)≤∥∇v∥L2(Q)(v∈H01(Q)). Moreover, every sequence bounded in H01(Q) has a subsequence converging in L2(Q). These conclusions use Countable Choice only; no Axiom of Choice or Dependent Choice is needed in the proof below.

Facts & Assumptions

Given: Countable Choice, the unit cube Q, and the Sobolev-closure convention for H01(Q).

[F1]

Zero-boundary Sobolev space as a norm closure: H01(Q) is the H1-norm closure of Cc∞(Q), and Integer-order Sobolev spaces and their norms gives ∥v∥H12=∥v∥22+∑i<d∥∂iv∥22; coordinate derivatives are indexed by 0≤i<d (Ck maps and multi-index derivative notation in Euclidean space).

[F2]

The Sobolev space H1 is a Hilbert space: under Countable Choice, H1(Q) is Hilbert and H01(Q) is its closed Hilbert subspace.

[F3]

Rational box-step functions form a countable dense subset of Lp(Rn) for 1≤p<∞: rational box-step functions give a countable dense family in L2(Rd).

[F4]

The Fourier basis and Parseval's identity on the finite torus: on a finite torus, Fourier characters are a complete orthonormal basis and Parseval holds.

[F5]

Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence: every bounded real sequence has a convergent subsequence.

[F7]

Affine pullback of weak derivatives and Sobolev seminorms and A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions: affine rescaling preserves Sobolev membership, transforms weak derivatives by the affine chain rule, and changes L2 integrals by its determinant.

Proof

1.1F1F6algebra

Let v∈Cc∞(Q) and write x=(t,x′) with first library coordinate t=x0 and x′=(x1,…,xd−1) (the empty tuple when d=1). For fixed x′ and 0<t<1, the one-dimensional fundamental theorem gives v(t,x′)=∫0t∂0v(s,x′) ds. Cauchy--Schwarz and t≤1 imply ∣v(t,x′)∣2≤∫01∣∂0v(s,x′)∣2 ds. Integrating first in t and then in x′ gives ∥v∥22≤∥∂0v∥22. By [F1], approximating any v∈H01(Q) in H1 and passing to the limit proves the displayed Poincaré bound.

1.2F1F3F2algebra

The map J:H1(Q)→L2(Q)d+1, J(v)=(v,∂0v,…,∂d−1v), is an isometry for the Sobolev norm by [F1]. The target is separable: extend each coordinate by zero to Rd and restrict the countable dense rational-box family [F3]. The image J(H1(Q)) and its subset J(H01(Q)) are separable subspaces of a second-countable metric space: intersect a countable base with the subspace and choose one point from each nonempty basic set, a countable selection allowed by Countable Choice. Thus H01(Q) is separable.

1.3F1F4algebra

For v∈Cc∞(Q), extend it by zero to D=(−1,2)d and identify opposite faces of D to obtain a smooth function on the torus of side length 3. The extension preserves the H1 norms. By [F1], for every v∈H01(Q) choose test functions converging to v in H1; their periodic zero extensions are Cauchy in H1 on this torus, so the extension is in periodic H1(D) and the same norm bound holds.

2.1F4F7step 1.3F1algebra

Rescale D affinely to the unit torus using [F7]; the characters on the side-length-3 torus are e2πik⋅x/3. For a periodic H1(D) function V, integration by parts on smooth periodic approximants and passage in H1 give ∂jV^(k)=(2πikj/3)V^(k) for 0≤j<d. The zero extension in step 1.3 is supported away from the identified faces, so its weak derivatives on the torus are exactly its zero-extended weak derivatives on Q. Parseval [F4] therefore yields ∑k∈Zd(1+∣k∣2)∣V^(k)∣2≤Cd∥V∥H1(D)2, with a fixed constant accounting for the side length 3. Hence for every integer N≥1, ∑∣k∣>N∣V^(k)∣2≤CdN−2∥V∥H1(D)2.

3.1step 1.3F5step 2.1F4algebra∎

Let (vn) be bounded in H01(Q), and write Vn for the periodic zero extensions from step 1.3. For each fixed Fourier mode k, the complex coefficients are bounded, so their real and imaginary parts are bounded real sequences. Use the following fixed extraction rule for any bounded real sequence (bn): let m be the least positive integer bounding all ∣bn∣, start with [−m,m], and bisect repeatedly, keeping the left closed half if it contains infinitely many terms and otherwise the right closed half. At stage r take the least index larger than the previous index whose term lies in the retained interval. Each such index exists, and the selected terms are Cauchy because the intervals are nested with lengths tending to zero; [F5] then implies they converge. This defines a unique subsequence from the input sequence, without choice. Enumerate the real and imaginary parts of the Fourier modes, recursively apply this fixed rule to the current subsequence for the next coordinate, and let nr be the rth index of the rth nested subsequence. These diagonal indices increase strictly and form a tail subsequence of every fixed earlier extraction, so every coefficient converges; this recursion uses a specified function, not Dependent Choice. If its terms are Vnr,Vns, then for fixed N the sum of squared coefficient differences over ∣k∣≤N tends to zero as r,s→∞, while by step 2.1 the sum over ∣k∣>N is at most CN−2 uniformly in r,s. First choose N large, then r,s large; Parseval shows (Vnr) is Cauchy in L2(D). Completeness gives an L2(D) limit, and restriction to Q gives the required L2(Q) convergence.

Depends on

Used by

Dependency tree · two levels

105 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