Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-09-23 (gpt-6-sol)
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 reduced resolvent satisfies the standard projector and inverse identities on the complementary invariant subspace

Statement

Let λ be a simple eigenvalue of A, let x,y be compatible eigenvectors normalized by y∗x=1, and let P=xy∗. Then the restriction of A−λI to ker⁡y∗ is a bijection ker⁡y∗→ker⁡y∗. If S is its inverse on ker⁡y∗ and Sx=0, then

SP=PS=0,S(A−λI)=(A−λI)S=I−P,

and this S is unique.

Facts & Assumptions

Given: A simple eigenvalue λ, normalized compatible eigenvectors x,y, and the projector P=xy∗.

[F1]

Under the normalization y∗x=1, the simple spectral projector is P=xy∗ (The simple spectral projector P=xy∗/(y∗x)).

Proof

technique · direct
1.1givenalgebra

Every vector v decomposes uniquely as v=(y∗v)x+(v−(y∗v)x), with the second term in ker⁡y∗. Because y∗A=λy∗, the operator A−λI maps ker⁡y∗ into itself. If z∈ker⁡y∗ and (A−λI)z=0, then z is a right eigenvector for the simple eigenvalue λ, so z=cx for some scalar c. Applying y∗ gives 0=y∗z=c y∗x=c, hence z=0. Therefore the restriction of A−λI to ker⁡y∗ is injective, and since both domain and codomain have dimension n−1, it is bijective.

2.1F1constructstep 1.1algebra

Define S to be the inverse of that restriction on ker⁡y∗ and to vanish on span⁡{x}. Then SP=PS=0 by construction. For v=αx+z with z∈ker⁡y∗, [F1] gives Pv=(y∗v)x=(α+y∗z)x=αx, so (I−P)v=z. Therefore S(A−λI)v=S(A−λI)z=z=(I−P)v, and similarly (A−λI)Sv=(A−λI)Sz=z=(I−P)v. Thus all displayed identities hold.

3.1step 1.1step 2.1algebra∎

If S′ is another linear map with the same identities, then S′x=0 because S′P=0 and Px=x. On ker⁡y∗ one has (A−λI)S′z=z=(A−λI)Sz, and the injectivity from step 1.1 gives S′z=Sz. Hence S′=S, so the reduced resolvent of The reduced resolvent, or group inverse, on the complementary invariant subspace of a simple eigenvalue is well defined and unique.

Depends on

Used by

Cited to discharge well-definedness by The reduced resolvent, or group inverse, on the complementary invariant subspace of a simple eigenvalue.

Dependency tree · two levels

4 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