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.
Real and complex Hilbert source powers and fixed-reference Tikhonov filter bounds
Statement
Assume AC. Let be bounded between real or complex Hilbert spaces, and set . For , define by the continuous calculus of in the complex case; in the real case use the Hilbert complexification and restrict to the real copy, as constructed below. On a zero space or for , this power is zero. It is bounded self-adjoint, and for , so . For put . Then No compactness or lower singular-value bound is assumed.
Facts & Assumptions
Given: The bounded operator, Hilbert spaces, positive exponents and shift in the Statement.
The Axiom of Choice: AC is assumed for the complex calculus, and implies the Countable Choice needed by Hilbert adjoints.
Continuous functional calculus for bounded self adjoint operators: on a nonzero complex Hilbert space a bounded self-adjoint operator has an isometric unital star-homomorphism from continuous functions on its spectrum.
Spectrum of a positive operator is nonnegative and Spectrum is nonempty compact and norm bounded: for a bounded positive operator on a nonzero complex Hilbert space, its spectrum is contained in .
Polynomials are uniformly dense in for every closed interval: continuous real functions on a closed interval have uniform real-polynomial approximants.
Hilbert-adjoint identities: adjoints preserve the reversed product, , and .
Real and complex inner-product spaces and their induced length and Hilbert space: the pairing is linear in the first argument, conjugate symmetric, and its norm is complete in a Hilbert space.
Real powers for positive bases, with the zero-base positive-exponent convention, The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents and Continuity and derivatives of positive-base real powers: positive real powers obey the exponent laws and are continuous with positive derivative on positive bases for positive exponents; for .
The shifted Hilbert-space normal operator is invertible with inverse norm at most : the shifted normal inverse exists in either field; Hilbert-space Tikhonov amplifies data by at most gives .
The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with : a positive derivative on an interval implies that endpoint increments are positive, hence the real power function is increasing.
Proof
If or , all asserted powers and products involving are zero, and the bounds and kernel conclusions follow directly. In the remaining case is positive self-adjoint and by the adjoint identities.
For real , construct with and . Expansion verifies conjugate symmetry, complex linearity in the first argument and norm squared ; completeness follows by taking the two component limits of a Cauchy sequence. Thus this is a complex Hilbert space. Construct similarly. The extensions and have the same operator norms as : the upper bound follows by summing squared component bounds, and real vectors give the reverse inequality. The inner-product identity gives and . This construction uses the Hilbert sum norm, not a rotation-supremum Banach norm.
In the nonzero complex space, or in step 2.1's complexification, apply [F1]–[F2]. For , extends continuously to zero: for , the positive derivative and [F8], followed by the power laws, give . Hence [F3] supplies real polynomials converging uniformly to on . The calculus maps them to a norm-convergent sequence of self-adjoint operators. In the real case each polynomial in preserves , a closed real subspace, so the limit preserves it too. Restriction defines over the real field, independent of approximants by the norm estimate from [F1]. Polynomial identities and norm bounds pass to these restrictions.
For , , so every polynomial satisfies . Taking step 3.1's approximants gives . Self-adjointness then gives . Also the calculus norm gives .
The calculus identifies with : multiplying this function by gives the identity, so uniqueness of the inverse in [F7] applies. For and , (use and separately). Scaling therefore gives for . Applying the isometric calculus and its real restriction proves the first filter bound.
Put . By [F4], . Its scalar function is . Since , the same scalar estimate as step 4.2 bounds this by , proving the second bound. The noise bound is [F7]. Finally yields . Apply the calculus to on , or directly use zero if : its function is at most one. This proves the last bound in either field.
Depends on
- Continuous functional calculus for bounded self adjoint operators
- Spectrum of a positive operator is nonnegative
- Spectrum is nonempty compact and norm bounded
- Polynomials are uniformly dense in $C([a,b],\mathbb R)$ for every closed interval
- Hilbert-adjoint identities
- Real and complex inner-product spaces and their induced length
- Hilbert space
- Real powers for positive bases, with the zero-base positive-exponent convention
- The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents
- Continuity and derivatives of positive-base real powers
- The shifted Hilbert-space normal operator is invertible with inverse norm at most $1/\lambda$
- Hilbert-space Tikhonov amplifies data by at most $1/(2\sqrt{\lambda})$
- The Axiom of Choice
- The mean value theorem, as the case $g(x) = x$ of Cauchy's: for $f$ continuous on $[a,b]$ with $a < b$ and differentiable on $(a,b)$ there is $c \in (a,b)$ with $f(b) - f(a) = f'(c)(b-a)$
Used by
Dependency tree · two levels
68 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
- Barbara Kaltenbacher, Methods for Inverse Problems: IV. Newton type methods (full lecture); anchored formulation/source-filter context, local constants proved here (standard reference, not scraped)
- Christian Clason, Regularization of Inverse Problems (anchored formulation and spectral-error proof context) (standard reference, not scraped)