Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge 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.

Real and complex Hilbert source powers and fixed-reference Tikhonov filter bounds

Statement

Assume AC. Let A:X→Y be bounded between real or complex Hilbert spaces, and set S=A∗A. For ν>0, define Sν by the continuous calculus of t↦tν 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 S=0, this power is zero. It is bounded self-adjoint, and Sνh=0 for h∈ker⁡A, so Sνw⊥ker⁡A. For α>0 put Tα=(S+αI)−1. Then ∥αTαSν∥≤αν(0<ν≤1),∥AαTαSν∥≤αν+1/2(0<ν≤1/2), ∥TαA∗∥≤12α,∥ATαA∗∥≤1,∥Sν∥≤∥A∥2ν. No compactness or lower singular-value bound is assumed.

Facts & Assumptions

Given: The bounded operator, Hilbert spaces, positive exponents and shift in the Statement.

[A1]

The Axiom of Choice: AC is assumed for the complex calculus, and implies the Countable Choice needed by Hilbert adjoints.

[F1]

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.

[F2]

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 [0,∥S∥].

[F3]

Polynomials are uniformly dense in C([a,b],R) for every closed interval: continuous real functions on a closed interval have uniform real-polynomial approximants.

[F4]

Hilbert-adjoint identities: adjoints preserve the reversed product, ∥T∗∥=∥T∥, and ∥T∗T∥=∥T∥2.

[F5]

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.

[F6]

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; 0ν=0 for ν>0.

[F7]

The shifted Hilbert-space normal operator is invertible with inverse norm at most 1/λ: the shifted normal inverse exists in either field; Hilbert-space Tikhonov amplifies data by at most 1/(2λ) gives ∥(S+αI)−1A∗∥≤1/(2α).

Proof

1.1A1F4F5F7givenalgebra

If X={0} or A=0, all asserted powers and products involving A are zero, and the bounds and kernel conclusions follow directly. In the remaining case S=A∗A is positive self-adjoint and ∥S∥=∥A∥2>0 by the adjoint identities.

2.1F4F5step 1.1givenconstructalgebra

For real X, construct Xc=X×X with (a+ib)(x,y)=(ax−by,bx+ay) and ⟨(x,y),(u,v)⟩c=⟨x,u⟩+⟨y,v⟩+i(⟨y,u⟩−⟨x,v⟩). Expansion verifies conjugate symmetry, complex linearity in the first argument and norm squared ∥x∥2+∥y∥2; completeness follows by taking the two component limits of a Cauchy sequence. Thus this is a complex Hilbert space. Construct Yc similarly. The extensions Ac(x,y)=(Ax,Ay) and Sc(x,y)=(Sx,Sy) have the same operator norms as A,S: the upper bound follows by summing squared component bounds, and real vectors give the reverse inequality. The inner-product identity gives Ac∗=(A∗)c and Sc=Ac∗Ac. This construction uses the Hilbert sum norm, not a rotation-supremum Banach norm.

3.1A1F1F2F3F6F8step 2.1givenconstructalgebra

In the nonzero complex space, or in step 2.1's complexification, apply [F1]–[F2]. For ν>0, tν extends continuously to zero: for 0<t<ε1/ν, the positive derivative and [F8], followed by the power laws, give tν<ε. Hence [F3] supplies real polynomials converging uniformly to tν on [0,∥S∥]. The calculus maps them to a norm-convergent sequence of self-adjoint operators. In the real case each polynomial in Sc preserves j(X)={(x,0)}, a closed real subspace, so the limit preserves it too. Restriction defines Sν over the real field, independent of approximants by the norm estimate from [F1]. Polynomial identities and norm bounds pass to these restrictions.

4.1F1F4F5step 3.1algebra

For h∈ker⁡A, Sh=0, so every polynomial satisfies p(S)h=p(0)h. Taking step 3.1's approximants gives Sνh=0. Self-adjointness then gives ⟨Sνw,h⟩=⟨w,Sνh⟩=0. Also the calculus norm gives ∥Sν∥≤∥S∥ν=∥A∥2ν.

4.2F1F6F7step 3.1algebra

The calculus identifies Tα with (t+α)−1: multiplying this function by t+α gives the identity, so uniqueness of the inverse in [F7] applies. For 0<γ≤1 and u≥0, uγ≤1+u (use u≤1 and u≥1 separately). Scaling t=αu therefore gives αtν/(t+α)≤αν for 0<ν≤1. Applying the isometric calculus and its real restriction proves the first filter bound.

5.1A1F1F2F4F7step 3.1step 4.2algebra∎

Put Q=αTαSν. By [F4], ∥AQ∥2=∥Q∗SQ∥. Its scalar function is [αtν+1/2/(t+α)]2. Since ν+1/2≤1, the same scalar estimate as step 4.2 bounds this by α2ν+1, proving the second bound. The noise bound is [F7]. Finally (AA∗+αI)A=A(S+αI) yields ATαA∗=(AA∗+αI)−1AA∗. Apply the calculus to AA∗ on Y, or directly use zero if Y={0}: its function t/(t+α) is at most one. This proves the last bound in either field.

Depends on

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