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.
Cube mean estimate and compact form inclusion
Statement
Assume the finite-dimensional coercive form data and Hilbert space of Coercive polynomial form completion and injection. The inclusion is compact: the closure in of the image of every bounded subset of is compact in the metric topology. The proof below uses an explicit cube-mean approximation for each finite and does not assume a general Rellich theorem.
Facts & Assumptions
Given: , the form domain , its norm, and the injection .
Coercive polynomial form completion and injection: is complete and injects densely into the complete Hilbert space ; for , its weak derivatives and weighted function are in and with .
Compact linear operator: a linear map is compact when the closure of the image of every bounded set is compact; it suffices to check the closed unit ball.
Cauchy–Schwarz: , with equality exactly for dependent pairs: on each space, .
Fubini's theorem for L^1 functions on a sigma-finite product: integrable functions on sigma-finite products have equal iterated integrals; the continuous cube integrands used below are integrable.
Proof
Given: Countable Choice as inherited through [F1], the finite data, and an arbitrary -bounded set.
Let be a cube of side and , with . Expanding the square and using Fubini on the finite cube gives Telescope through the coordinate changes and use . For the th change, the fundamental theorem of calculus and Cauchy–Schwarz give . For fixed values of the other coordinates and fixed , the measure of pairs whose segment contains is ; integrating the displayed bound over the cube variables and dividing by therefore yields the safe estimate It applies to complex because the squared-modulus Cauchy–Schwarz inequality is used.
For and , the coercive weight gives Thus the tails of the unit ball are uniformly small for large .
The estimate of step 1.1 passes to every : approximate in the norm by elements of (the defining completion), restrict to , and use [F1] to pass the and derivative limits.
Fix . Choose so the squared tail in step 1.2 is below . For the unit ball, [F1] gives . Choose an integer large enough that satisfies , and partition into the resulting finitely many cubes of side . Summing the squared estimates of step 2.1 over these disjoint cubes bounds the total mean-approximation error by . The squared error outside is the tail from step 1.2; thus replacing on each cube by its mean and setting it to zero outside the large cube has total squared error below , hence norm error below .
For the finite partition in step 3.1, the piecewise-constant mean function satisfies by Cauchy--Schwarz [F3]. Thus each mean coordinate has modulus at most , so the vectors of means lie in a bounded box in a finite-dimensional complex coordinate space. Subdivide its real-and-imaginary coordinates into finitely many boxes of sufficiently small side length so that the associated piecewise-constant functions approximate every mean vector to error below . Combining with step 3.1 gives a finite -net for the image of the unit ball. Scaling shows that the image of every bounded set is totally bounded.
Let be the closure of the image of the unit ball. It is complete because it is closed in the complete space [F1]. Suppose an open cover of has no finite subcover. For each , step 4.1 supplies a finite -net for the image of the unit ball with centers in ; the corresponding closed balls of radius cover its closure . Starting with , choose the least ball index for which has no finite subcover. Such an index exists, since otherwise finitely many finite subcovers would cover . Each is nonempty, closed, nested, and has diameter at most . For , any point of nonempty lies in both selected balls, so ; hence is Cauchy and converges to some . Since is nonempty and is contained in both and , the distance from to is at most . Therefore ; closedness of gives . For fixed and every , nonempty has a point with . Thus there are points of arbitrarily close to , and closedness gives . An open set of the cover containing contains for some ; for large , , so that one open set covers , a contradiction. Thus is compact. All recursive ball choices are least admissible indices in finite lists.
Step 5.1 proves that the closed-unit-ball image under has compact closure; applying the equivalent criterion in [F2] to the linear inclusion proves that is compact.