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.
A coercive Hilbert-complex estimate solves the closed equation
Statement
Assume the Axiom of Choice (AC). Let be complex Hilbert spaces and let and be closed densely defined linear operators with , so that on . Suppose there is a constant with where is the Hilbert adjoint of . Then for every :
(i) there exists with ; (ii) among all such there is exactly one of least norm, and it lies in ; (iii) that least-norm solution satisfies .
Independently of the constant , the following -weighted form of the argument holds.
(iv) Suppose is a bounded self-adjoint operator with for every , that and that has the form for some . Then there exists with , and the least-norm such satisfies
No closedness of the range of and no surjectivity of is assumed.
Facts & Assumptions
Given: The Axiom of Choice; complex Hilbert spaces ; closed densely defined linear operators and with ; a constant with for every ; and an element . For the independent part (iv) assume in addition a bounded self-adjoint operator with for every and for every , together with an element satisfying .
For the operator , define to be the set of for which is bounded in the norm. Density of , [F5] and [F4] give a unique with for every . The graph identities needed below are proved in step 1.3.
For a linear subspace of a Hilbert space, (The double orthogonal complement of a subspace is its closure).
If is a closed linear subspace of a real or complex Hilbert space , then every has a unique decomposition with and (Orthogonal decomposition by a closed subspace).
For a bounded linear functional on a complex Hilbert space there is a unique representing vector of the same norm (Riesz representation for Hilbert spaces).
A bounded functional on a dense linear subspace extends uniquely by limits to the ambient Hilbert space: boundedness makes values on a convergent approximating sequence Cauchy and makes the limit independent of the sequence. The resulting functional has a Riesz vector by [F4].
An operator is densely defined when its domain is dense, and closed when its graph is a closed subset of (Densely defined, closed and closable operators, and cores).
In a real or complex inner-product space for all vectors (Cauchy–Schwarz: , with equality exactly for dependent pairs).
A complex Hilbert space is a complex inner-product space whose induced norm is complete (Hilbert space).
AC states that every family of nonempty sets has a choice function (The Axiom of Choice), and it supplies its countable instance (The Axiom of Countable Choice ()).
A bounded self-adjoint operator satisfies for all , so in particular (The Hilbert-space adjoint of a bounded operator, Self-adjoint, positive, unitary and normal operators, The spaces (\mathcal B(X,Y)) and (\mathcal B(X)) of bounded linear operators).
Choice use. AC is used only through the countable instance consumed by the operator, decomposition and representation facts [F1], [F2], [F3] and [F4]. The adjoint graph argument, functional extension, minimal-norm projection and the -weighted variant select nothing further.
Proof
Since is closed, its kernel is closed: if and in then lies in the closed graph of , so and ; the same argument shows that is a closed subspace of , and says exactly that the composition is zero on .
Semidefinite Cauchy–Schwarz. For all one has : fix and note that for every real , using [F10] and , ; if the discriminant of this nonnegative quadratic is , so , while if the same quadratic forces and the inequality holds trivially; choosing with and and applying the real-part inequality to the pair , whose quadratic values are unchanged because is linear and , gives the stated modulus bound.
The adjoint defined in [F1] has a linear domain. Directly from its defining identity, : vanishing of for every is equivalent to . More precisely, in one has because is orthogonal to every exactly when for every . Since is closed, [F2] gives .
For decompose with and by [F3] applied to the closed subspace of step 1.1; since , taking orthogonal complements gives by step 1.3, so , hence as well, with ; moreover because .
For every the vector of step 2.1 lies in and , so the hypothesis and step 2.1 give , and [F7] together with step 2.1 gives .
Define on the subspace by ; if then step 3.1 gives , so is well defined, and step 3.1 says for every , so is linear and bounded on ; let and define for and any sequence with : the sequence is Cauchy because , and the limit exists by [F8]; the countable instance of [F9] is the choice principle consumed by [F1], [F3], [F4] and [F8] here, and the construction selects nothing further; it is independent of the sequence because two sequences for the same have difference tending to , and passing to limits of the defining inequalities preserves linearity (limits of sums and scalar multiples) and gives .
-weighted estimate. For every , with as in step 2.1, the vector lies in with and (step 3.1 for the first two, step 2.1 for the third), so by step 1.2 applied to the pair , by [F10], by and by the domination hypothesis for (iv) on : , where and by positivity of .
Let be the orthogonal projection onto the closed subspace , defined for by the unique decomposition with of [F3], and put ; then is linear and for all , so by [F4] there is a unique with for all and .
For every , steps 4.1 and 5.1 give . Therefore is orthogonal to every by step 1.3 (take complex conjugates of the displayed identity). Since is closed, ; hence and , proving (i).
Define on by for and put : step 4.2 with shows is well defined, and it shows for every , so is linear and bounded; the extension of to by limits along sequences in , its independence of the chosen sequence, its linearity and its bound are verified by the same computation as in step 4.1 with in place of , with the Cauchy property supplied by [F8] and the same countable instance of [F9]; letting be the orthogonal projection of [F3] onto as in step 5.1, the functional is linear with on , so [F4] gives a unique with for all and .
By step 1.1 the subspace is closed, so [F3] decomposes the solution of step 6.1 as with and ; then , so is a solution lying in , every solution has the form with , and since the Pythagorean identity gives with equality only for ; thus is the unique least-norm solution and by step 5.1, proving (ii) and (iii).
For every , step 6.2 gives . As in step 6.1, the graph identity of step 1.3 and closedness of yield , so and . This proves existence in (iv).
By step 1.1 the subspace is closed, so [F3] decomposes the solution of step 7.2 as with and ; then and the argument of step 7.1 shows that is the unique least-norm solution, with by step 6.2, hence , which proves (iv); moreover with and the hypotheses of (iv) hold by the coercivity assumption, and its conclusion specializes to , in agreement with (iii).
Depends on
Hilbert space
Riesz representation for Hilbert spaces
Orthogonal decomposition by a closed subspace
Cauchy–Schwarz: , with equality exactly for dependent pairs
The Hilbert-space adjoint of a bounded operator
Self-adjoint, positive, unitary and normal operators
The spaces (\mathcal B(X,Y)) and (\mathcal B(X)) of bounded linear operators
Densely defined, closed and closable operators, and cores
The double orthogonal complement of a subspace is its closure
The Axiom of Countable Choice ()
The Axiom of Choice