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

Finite orthogonal sums of self-adjoint operators and of bounded operators

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)), the choice hypothesis of the cited definitions of the adjoint. Fix an integer r≥1, let H1,…,Hr be complex Hilbert spaces with inner products linear in the first argument (Hilbert space), and let H:=⨁l=1rHl,⟨(xl),(yl)⟩:=∑l=1r⟨xl,yl⟩Hl, be their orthogonal sum. For each l let Al:D(Al)⊂Hl→Hl be a densely defined self-adjoint operator (Adjoint of a densely defined operator, Symmetric, self-adjoint and essentially self-adjoint operators) and put D(A):={(xl)∈H: xl∈D(Al) for all l, ∑l=1r∥Alxl∥Hl2<∞},A(xl):=(Alxl). Then:

(a) H is a complex Hilbert space, D(A) is a dense linear subspace of H, and A:D(A)→H is a linear operator;

(b) A is symmetric and self-adjoint, and ∥Ax∥2=∑l=1r∥Alxl∥Hl2 for every x∈D(A);

(c) if Bl∈B(Hl) for every l (A bounded linear operator between normed spaces), then B:=⨁l=1rBl, defined by B(xl):=(Blxl) for all (xl)∈H, is bounded with ∥B∥=max⁡1≤l≤r∥Bl∥ (The operator norm as the least bound and as the unit-sphere or unit-ball supremum), its adjoint is B∗=⨁l=1rBl∗ (The Hilbert-space adjoint of a bounded operator), and B is unitary if every Bl is unitary.

No assertion is made about infinite orthogonal sums: only the finite case is proved here.

Facts & Assumptions

Given: The Axiom of Countable Choice; the integer r≥1; complex Hilbert spaces H1,…,Hr with pairings linear in the first argument; densely defined self-adjoint operators Al on Hl; bounded operators Bl∈B(Hl); vectors x=(xl),y=(yl)∈H; unit vectors ul∈Hl; scalars α,β∈C.

[F1]

The orthogonal sum. ⟨(xl),(yl)⟩=∑l⟨xl,yl⟩l is a Hermitian sesquilinear form, linear in the first argument, with ⟨x,x⟩=∑l∥xl∥2≥0 and equality exactly for x=0; the induced norm is ∥x∥2=∑l∥xl∥2 (Hilbert space). A complex Hilbert space is complete for its norm.

[F2]

Adjoints. For a densely defined operator T on a Hilbert space, D(T∗) consists of those y for which x↦⟨Tx,y⟩ is a bounded linear functional on D(T), and T∗y is its Riesz representative; T is symmetric when ⟨Tx,y⟩=⟨x,Ty⟩ for all x,y∈D(T), and self-adjoint when D(T∗)=D(T) and T∗=T (Adjoint of a densely defined operator, Symmetric, self-adjoint and essentially self-adjoint operators). In particular a symmetric operator with D(T∗)⊆D(T) is self-adjoint.

[F3]

Bounded operators. For B∈B(H) one has ∥Bx∥≤∥B∥ ∥x∥, and ∥B∥=sup⁡∥x∥≤1∥Bx∥ is attained as a supremum over the unit ball (A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum). The Hilbert adjoint B∗ is characterized by ⟨Bx,y⟩=⟨x,B∗y⟩ for all x,y∈H; B is unitary exactly when B∗B=BB∗=I (The Hilbert-space adjoint of a bounded operator).

Proof

technique · direct; verify the Hilbert-space axioms componentwise, prove density, symmetry and the adjoint computation slot by slot, and compute the norm and adjoint of a bounded orthogonal sum

Given: The data of the statement and [F1]-[F3].

1.1F1algebra

[Hilbert-space axioms] [F1] gives sesquilinearity, Hermitian symmetry and positive definiteness of the displayed form, since all of these are checked componentwise and the sum over l=1,…,r is finite. For completeness let (x(n))n be a Cauchy sequence in H, x(n)=(xl(n))l. For each l and all m,n one has ∥xl(n)−xl(m)∥l≤∥x(n)−x(m)∥, so (xl(n))n is Cauchy in Hl and converges to some xl∈Hl; then ∑l∥xl∥2=lim⁡n∑l∥xl(n)∥2≤lim sup⁡n∥x(n)∥2<∞ because a Cauchy sequence is bounded, so x:=(xl)∈H, and ∥x(n)−x∥2=lim⁡m∑l∥xl(n)−xl(m)∥2=lim⁡m∥x(n)−x(m)∥2, which tends to 0 as n→∞ uniformly in n because the sequence is Cauchy; hence x(n)→x. This proves (a) for the space.

1.2F1F2algebra

[Density and linearity of the domain] The algebraic sum ⨁lD(Al)⊆D(A): each (xl) with xl∈D(Al) has a finite sum ∑l∥Alxl∥2. It is dense in H: given x∈H and ε>0, density of D(Al) gives for each l a vector yl∈D(Al) with ∥xl−yl∥<ε/r, so y:=(yl)∈⨁lD(Al) and ∥x−y∥2=∑l∥xl−yl∥2<ε2. The set D(A) is a linear subspace because ∑l∥αAlxl+βAlyl∥2≤2∣α∣2∑l∥Alxl∥2+2∣β∣2∑l∥Alyl∥2<∞ for x,y∈D(A), and A is linear because each Al is.

1.3F2algebra

[Symmetry] Let x,y∈D(A). Then ⟨Ax,y⟩=∑l⟨Alxl,yl⟩l=∑l⟨xl,Alyl⟩l=⟨x,Ay⟩, because each Al is self-adjoint and hence symmetric; all sums are finite.

1.4F1F2algebra

[The adjoint domain] Let y∈D(A∗) and z:=A∗y. For fixed l and each u∈D(Al) let x(l,u)∈H have u in slot l and 0 in all other slots; then x(l,u)∈D(A) and Ax(l,u) has Alu in slot l. Using [F2] for A and the componentwise pairing, ⟨Alu,yl⟩l=⟨Ax(l,u),y⟩=⟨x(l,u),z⟩=⟨u,zl⟩l for every u∈D(Al). Hence u↦⟨Alu,yl⟩l is bounded on D(Al), represented by zl; so yl∈D(Al∗)=D(Al) and Al∗yl=zl, that is Alyl=zl. Summing, ∑l∥Alyl∥2=∑l∥zl∥2=∥z∥2<∞, so y∈D(A) and Ay=z. Hence D(A∗)⊆D(A) and A∗y=Ay.

2.1step 1.1step 1.2step 1.3step 1.4F1F2algebra

[Self-adjointness] Step 1.3 gives symmetry; symmetry gives D(A)⊆D(A∗) with A∗ agreeing with A there (Adjoint of a densely defined operator), and step 1.4 gives the converse inclusion, so A∗=A by [F2]. The norm identity is [F1] applied to Ax=(Alxl). This proves (b).

3.1F3step 1.1algebra∎

[Bounded sums] Let Bl∈B(Hl) and put M:=max⁡1≤l≤r∥Bl∥, which exists because the index set is finite and nonempty. For x∈H, ∥Bx∥2=∑l∥Blxl∥2≤M2∑l∥xl∥2=M2∥x∥2, so B is bounded with ∥B∥≤M by [F3]. If M>0, choose l0 with ∥Bl0∥=M; since ∥Bl0∥>0, Hl0≠{0}. For each η>0, the unit-sphere formula for the operator norm in [F3] gives a unit vector ul0∈Hl0 with ∥Bl0ul0∥>M−η. The vector with ul0 in slot l0 and 0 elsewhere is a unit vector of H, so ∥B∥≥∥Bx∥=∥Bl0ul0∥>M−η; letting η↓0 gives ∥B∥≥M. If M=0, the upper bound already gives ∥B∥=0=M. Thus ∥B∥=max⁡l∥Bl∥. For Bl∗ the adjoint of Bl, the operator ⨁lBl∗ satisfies ⟨Bx,y⟩=∑l⟨Blxl,yl⟩l=∑l⟨xl,Bl∗yl⟩l=⟨x,(⨁lBl∗)y⟩ for all x,y∈H, so B∗=⨁lBl∗ by [F3]. If every Bl is unitary then B∗B=⨁lBl∗Bl=⨁lIHl=I and likewise BB∗=I, so B is unitary. This proves (c).

Remarks

  • Where the finiteness is used. Both the norm identity of (b) and the norm formula of (c) are finite-sum statements; for infinite orthogonal sums the domain condition in (b) and the supremum in (c) require separate arguments, and no such statement is made here.
  • Choice. Only the Axiom of Countable Choice is declared, as the choice hypothesis of the cited definitions of the adjoint; the argument itself handles finitely many slots and makes no further selection.

Depends on

Dependency tree · 2 levels

Sources