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

Maximal orthogonal family of cyclic reducing subspaces

Statement

Assume AC. Let T be a bounded normal operator on a nonzero complex Hilbert space H. Then:

  1. there is a family (Hj)j∈J of pairwise orthogonal nonzero closed subspaces of H, each reducing T and cyclic for T∣Hj, whose Hilbert sum is all of H: the closed span of ⋃jHj equals H;
  2. if in addition H is separable and (vn)n≥0 is a dense sequence in H, put Sn=H0⊕⋯⊕Hn−1 with S0={0}. Project vn onto Sn⊥ to obtain xn, and take Hn to be its cyclic subspace for the original operator T on H. The Hn are closed and reducing, zero summands are allowed, and the nonzero summands are cyclic for their restrictions. Their closed span is H, denoted H=⨁n≥0Hn. After discarding zero summands this is a finite or countable family with the properties in claim 1.

Facts & Assumptions

[A1]

A closed subspace reduces T if it is invariant under T and T∗. For every y∈H the ambient cyclic subspace Hy is closed, reducing and contains y; it is the closed span of the unital polynomial orbit in T,T∗ (Cyclic vector and cyclic normal operator). If y=0 it is {0}. On a nonzero reducing subspace M, the restriction of T∗ is the adjoint of T∣M by the defining pairing, so T∣M is normal. A closed subspace is complete because Cauchy sequences converge in H and their limits stay in the subspace. For nonzero y, restricting the same polynomial orbit to Hy shows y is cyclic for T∣Hy. No spectrum or calculus on a zero space is used. The adjoint pairing and involution are supplied by The Hilbert-space adjoint of a bounded operator and Hilbert-adjoint identities, and bounded operators are continuous by For a linear operator, boundedness, continuity at 0, continuity, and Lipschitz continuity are equivalent.

[A2]

If M reduces T, then M⊥ reduces T: for y∈M⊥ and m∈M one has ⟨Ty,m⟩=⟨y,T∗m⟩=0 and ⟨T∗y,m⟩=⟨y,Tm⟩=0, since T∗M⊆M and TM⊆M (Orthogonality and the orthogonal complement, The Hilbert-space adjoint of a bounded operator, Hilbert-adjoint identities).

[A3]

Orthogonal decompositions: for a closed subspace M one has H=M⊕M⊥, and the orthogonal complement of a closed subspace is closed; a vector orthogonal to a closed subspace N lies in N⊥ (Orthogonal decomposition by a closed subspace, Orthogonal complements are closed, Orthogonality and the orthogonal complement).

[A4]

Zorn's lemma: a nonempty poset in which every chain has an upper bound has a maximal element (Zorn's lemma, The Axiom of Choice).

[A5]

If a closed linear subspace L has L⊥={0}, then H=L⊕L⊥=L. Equivalently, double orthogonal complementation of any linear subspace gives its closure (Orthogonal decomposition by a closed subspace, The double orthogonal complement of a subspace is its closure). A closed set containing a dense subset is the whole space (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets).

[A6]

Separability means existence of an at most countable dense subset (Separability: the existence of an at most countable dense subset). Finite sums of pairwise orthogonal closed subspaces are closed: their orthogonal projections Pj are bounded, are the identity on their own subspace and vanish on the others (The Hilbert orthogonal projection onto a closed subspace, Hilbert projections are linear, self-adjoint and contractive). Thus P=∑j<nPj satisfies P2=P and has range S=∑j<nHj, so S=ker⁡(I−P). This kernel is closed: for x∉S, a ball of radius ∥x−Px∥/(2(1+∥P∥)) misses it, by ∥(I−P)(y−x)∥≤(1+∥P∥)∥y−x∥. For n=0, P=0 and S={0}. If each summand reduces T, their finite sum does too by linearity. No closedness of an infinite algebraic sum is asserted.

[A7]

AC is the declared choice hypothesis of this page from the construction item onward (The Axiom of Choice).

Proof

technique · direct

Given: A nonzero complex Hilbert space H and a bounded normal operator T∈B(H); in the separable case also a dense sequence (vn).

1.1A1A4

Every chain in the poset P⊆P(P(H)) of sets {Mj}j∈J of pairwise orthogonal nonzero closed T-reducing subspaces, cyclic for T∣Mj, ordered by inclusion, has an upper bound (the empty family belongs to this poset): the union of the chain is again such a family, because any two of its members lie in a common family of the chain and are therefore orthogonal, and each is reducing and cyclic by membership.

1.2A1A2A3A6

Separable construction: start with S0={0}, K0=H, x0=v0 and the ambient cyclic subspace H0=Hx0. Recursively, once Hj for j<n are defined, their finite orthogonal sum Sn is closed and reducing by [A6]. Its orthogonal complement Kn=Sn⊥ is closed and reducing by [A2, A3]. Let xn=PKnvn and define Hn=Hxn using the original T on H. Since Kn is closed and invariant under T,T∗, the whole polynomial orbit of xn and its closure lie in Kn. Thus Hn is closed, reducing and orthogonal to all earlier summands. If xn=0, set Hn={0} with no restriction calculus.

2.1step 1.1A4

By Zorn's lemma P has a maximal element (Hj)j∈J; its members are pairwise orthogonal, nonzero, T-reducing and cyclic for the restrictions.

2.2step 1.2A1

The family (Hn) is pairwise orthogonal and every Hn reduces T and each nonzero Hn is cyclic for the restriction, by construction and by the preceding paragraph; the nonzero members form a pairwise orthogonal family of cyclic reducing subspaces.

2.3step 1.2A5A6

Spanning in the separable case: each vn splits as vn=pn+xn with pn∈H0⊕⋯⊕Hn−1 and xn∈Kn, and xn∈Hn by the ambient cyclic-subspace construction, including xn=0; hence vn∈H0⊕⋯⊕Hn for every n, so the closed sum ⨁nHn contains the dense sequence (vn) and therefore equals H.

3.1step 2.1A1A2A3

Maximality forces K:=(span⁡⋃jHj)⊥={0}: K is the orthogonal complement of the closed span of a family of cyclic reducing subspaces, hence closed and T-reducing: the algebraic span is invariant under T,T∗, its closure stays invariant by their continuity, and [A2] applies; if y∈K is nonzero, its ambient cyclic subspace M:=Hy is nonzero, closed and T-reducing, and lies in K by invariance of K under the polynomial orbit and orthogonal to every Hj, and it is cyclic for T∣M, so (Hj)j∈J∪{M} is a strictly larger element of P, contradicting maximality.

4.1step 3.1A3A5

Hence no nonzero vector is orthogonal to the closed span of ⋃jHj, so [A5] gives that this closed span equals H, which is the first assertion.

5.1step 2.2step 2.3A7∎

The separable construction therefore yields a finite or countable family of nonzero members of (Hn)n≥0, consisting of pairwise orthogonal cyclic reducing subspaces with H=⨁nHn, as claimed.

Depends on

Used by

Dependency tree · two levels

59 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