Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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.

Hilbert-adjoint identities

Statement

Assume the Axiom of Countable Choice. Let H,K,L be real or complex Hilbert spaces and let R,S∈B(H,K) and T∈B(K,L) be bounded linear operators. Then the Hilbert adjoints satisfy:

  1. (aR+bS)∗=a‾ R∗+b‾ S∗ for scalars a,b, and the adjoint of an operator is unique;
  2. (TS)∗=S∗T∗;
  3. T∗∗=T and ∥T∗∥=∥T∥;
  4. ∥T∗T∥=∥T∥2.

Facts & Assumptions

[A1]

The Hilbert adjoint of T∈B(K,L) is the unique map T∗:L→K with ⟨Tx,y⟩L=⟨x,T∗y⟩K for all x,y (The Hilbert-space adjoint of a bounded operator).

[A2]

The pairing is linear in the first argument, conjugate-linear in the second, conjugate symmetric, and ⟨v,v⟩=0 implies v=0 (Real and complex inner-product spaces and their induced length).

[A3]

The operator norm satisfies ∥Tu∥≤∥T∥ ∥u∥ and is the unit-ball supremum (The operator norm as the least bound and as the unit-sphere or unit-ball supremum), while composition obeys ∥UV∥≤∥U∥ ∥V∥ (Composition satisfies |ST|\le|S|,|T|); a linear map is bounded if it admits a finite constant C≥0 with ∥Uy∥≤C∥y∥ for every y (A bounded linear operator between normed spaces).

[A4]

Cauchy–Schwarz gives ∣⟨u,v⟩∣≤∥u∥ ∥v∥ (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[A5]

Countable Choice is the hypothesis of the Riesz construction of adjoints (The Axiom of Countable Choice (ACω)).

Proof

technique · direct

Given: Countable Choice, Hilbert spaces H,K,L and bounded operators R,S∈B(H,K), T∈B(K,L).

1.1A1A2A3A4A5algebra

First let U:X→Y be any bounded linear operator between Hilbert spaces over the same scalar field. The map U∗:Y→X exists by the adjoint construction. For y,z∈Y, scalars a,b and x∈X, its identity gives ⟨x,U∗(ay+bz)⟩=⟨Ux,ay+bz⟩=a‾⟨x,U∗y⟩+b‾⟨x,U∗z⟩=⟨x,aU∗y+bU∗z⟩. Positive definiteness applied to the difference proves that U∗ is linear. Also ∥U∗y∥2=⟨U(U∗y),y⟩≤∣⟨U(U∗y),y⟩∣≤∥U∥ ∥U∗y∥ ∥y∥, so division when U∗y≠0, and the trivial inequality otherwise, give ∥U∗y∥≤∥U∥ ∥y∥. Thus U∗ is bounded and its now-defined operator norm satisfies ∥U∗∥≤∥U∥. This applies to each bounded operator used below, including an adjoint once its boundedness has been established.

2.1step 1.1A1A2A5

For uniqueness of the adjoint and conjugate-linearity in the operator, let U,V∈B(K,H) both satisfy the defining adjoint identity for the same operator in B(H,K). For y∈K, one has ⟨x,(U−V)y⟩H=0 for every x∈H; taking x=(U−V)y gives (U−V)y=0. For scalars a,b, the identities ⟨(aR+bS)x,y⟩K=a⟨Rx,y⟩K+b⟨Sx,y⟩K=⟨x,a‾R∗y+b‾S∗y⟩H hold for all x∈H and y∈K, so (aR+bS)∗=a‾R∗+b‾S∗.

3.1step 1.1step 2.1A1A2

Composition and involution: for x∈H and y∈L, ⟨x,S∗T∗y⟩H=⟨Sx,T∗y⟩K=⟨TSx,y⟩L, so (TS)∗=S∗T∗ by uniqueness. Likewise, for x∈K and y∈L, the defining identity for T∗ gives ⟨T∗y,x⟩K=⟨y,T∗∗x⟩L; conjugate symmetry and the defining identity for T give ⟨T∗∗x,y⟩L=⟨x,T∗y⟩K=⟨Tx,y⟩L, so T∗∗=T by uniqueness.

4.1step 1.1step 3.1A3A4algebra∎

Norms: Cauchy–Schwarz gives ∥T∗y∥2=⟨T∗y,T∗y⟩K=⟨T(T∗y),y⟩L≤∥T∥ ∥T∗y∥ ∥y∥, hence ∥T∗y∥≤∥T∥ ∥y∥ (trivially when T∗y=0) and ∥T∗∥≤∥T∥; applying this to T∗ and using T∗∗=T gives ∥T∗∥=∥T∥. Moreover ∥T∗T∥≤∥T∗∥ ∥T∥=∥T∥2, while for ∥x∥≤1 one has ∥Tx∥2=⟨x,T∗Tx⟩K≤∥x∥ ∥T∗Tx∥≤∥T∗T∥, so ∥T∥2≤∥T∗T∥ and hence ∥T∗T∥=∥T∥2.

Depends on

Dependency tree · 2 levels

Sources