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

The shifted Hilbert-space normal operator is invertible with inverse norm at most 1/λ

Statement

Assume the Axiom of Countable Choice. Let X and Y be real or complex Hilbert spaces and let A:X→Y be bounded, with Hilbert adjoint A∗. For λ>0, define

Bλ:=A∗A+λIX.

Then Bλ:X→X is bijective and

∥Bλ−1∥≤1λ.

Facts & Assumptions

Given: The Axiom of Countable Choice, real or complex Hilbert spaces X,Y, a bounded linear map A:X→Y, its Hilbert adjoint A∗, and a real λ>0.

[F1]

Hilbert space: A Hilbert space is an inner-product space complete for the norm induced by its inner product.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice states that every countable family of nonempty sets has a choice function.

[F2]

The Hilbert-space adjoint of a bounded operator: Under Countable Choice, the adjoint assigns to each y the unique vector A∗y satisfying ⟨Ax,y⟩Y=⟨x,A∗y⟩X.

[F3]

A bounded linear operator between normed spaces: A linear map is bounded when some finite C≥0 satisfies ∥Tx∥≤C∥x∥ for every x.

[F4]

Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs: For vectors in a real or complex inner-product space, ∣⟨x,y⟩∣≤∥x∥ ∥y∥.

[F5]

Orthogonal decomposition by a closed subspace: Under Countable Choice, a closed linear subspace M of a Hilbert space satisfies H=M⊕M⊥.

[F6]

Real and complex inner product spaces, with the inner product linear in the first argument: The inner product is linear in its first argument, conjugate symmetric, and positive definite.

[F7]

The operator norm as the least bound and as the unit-sphere or unit-ball supremum: The operator norm is the supremum of ∥Tx∥ over vectors satisfying ∥x∥≤1.

[F8]

Orthogonality and the orthogonal complement: A vector z lies in M⊥ exactly when ⟨z,m⟩=0 for every m∈M.

[F9]

The induced length is a norm: The induced norm satisfies ∥v∥2=⟨v,v⟩.

Proof

1.1givenA1F1F2F3F4F6F7F9algebra

Uniqueness in [F2] gives linearity of A∗: for scalars a,b and y1,y2∈Y, conjugate-linearity of the second slot shows that aA∗y1+bA∗y2 satisfies the defining identity for ay1+by2, so it equals A∗(ay1+by2). For w=A∗y, [F2], [F4] and [F7] give ∥w∥2=⟨Aw,y⟩≤∣⟨Aw,y⟩∣≤∥A∥∥w∥∥y∥. Dividing when w≠0, and treating w=0 directly, proves ∥A∗y∥≤∥A∥∥y∥. Thus A∗ is bounded, and composition and addition make Bλ linear and bounded with ∥Bλx∥≤(∥A∥2+λ)∥x∥. The adjoint identity and conjugate symmetry [F6] give ⟨Bλx,z⟩=⟨Ax,Az⟩+λ⟨x,z⟩=⟨x,Bλz⟩ for all x,z∈X. In particular, ⟨Bλx,x⟩=∥Ax∥2+λ∥x∥2≥λ∥x∥2.

2.1givenF1F4F9step 1.1algebra

By [F4], ∥Bλx∥ ∥x∥≥∣⟨Bλx,x⟩∣=⟨Bλx,x⟩≥λ∥x∥2. Thus ∥Bλx∥≥λ∥x∥ for x≠0; the same inequality is trivial for x=0. Hence Bλ is injective. If Bλxn converges, this inequality applied to xn−xm makes (xn) Cauchy; completeness of X and boundedness of Bλ show its limit lies in ran⁡Bλ. Therefore the range is closed.

3.1F6F8step 1.1step 2.1algebra

If z∈(ran⁡Bλ)⊥, [F8] gives ⟨z,Bλx⟩=0 for every x∈X. By conjugate symmetry [F6] this is ⟨Bλx,z⟩=0, and the symmetry identity from step 1.1 gives ⟨x,Bλz⟩=0 for every x∈X. Taking x=Bλz and using positive definiteness [F6] yields Bλz=0; injectivity from step 2.1 then gives z=0. Thus the closed range has zero orthogonal complement.

4.1A1F5F7step 2.1step 2.1algebra∎

By [F5] and the Countable Choice assumption [A1], a closed subspace with zero orthogonal complement is all of X; so Bλ is surjective as well as injective. For y=Bλx, step 2.1 gives ∥Bλ−1y∥=∥x∥≤∥y∥/λ, proving ∥Bλ−1∥≤1/λ.

Depends on

Used by

Dependency tree · two levels

36 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