Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Every regular real or complex pencil has a generalized Schur form

Statement

Let (A,B) be a regular n×n pencil over C. Then there are unitary Q,Z such that Q∗AZ and Q∗BZ are upper triangular. If A,B∈Rn×n, there are orthogonal Q,Z such that QTAZ is block upper triangular with one-by-one real blocks and two-by-two blocks whose generalized determinant polynomial has a nonreal conjugate root pair, while QTBZ is upper triangular. In either form, the homogeneous roots of the diagonal block determinant polynomials are exactly the homogeneous generalized eigenvalues of (A,B).

Facts & Assumptions

Given: A regular finite square pencil (A,B) of order n≥1 over C or R.

[F1]

Every regular complex pencil has a homogeneous eigenvalue pair: a regular pencil has a nonzero homogeneous pair [α:β] with det⁡(βA−αB)=0.

[F2]

A regular pencil has no nonzero vector in both kernels: regularity excludes a nonzero vector in both ker⁡A and ker⁡B.

[F3]

The homogeneous determinant factors across a block upper triangular pencil: the homogeneous determinant of a block upper triangular pair is the product of the determinants of its diagonal block pairs.

[F4]

Householder reflectors and Givens transformations are unitary and can annihilate prescribed entries: Householder transformations are unitary and can align a nonzero vector with the first coordinate; Givens transformations can annihilate a prescribed coordinate.

[F5]

Gram–Schmidt turns every finite independent list into an orthonormal list with the same successive spans: Gram–Schmidt converts finite independent lists to orthonormal lists with the same successive spans.

[F6]

Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional real or complex inner product space has an orthonormal basis.

[F7]

A finite-dimensional linear operator over a field is invertible if and only if its determinant is nonzero: a finite-dimensional operator over a field is invertible exactly when its determinant is nonzero.

[F8]

A nonzero polynomial of degree n over an integral domain has at most n distinct roots: a nonzero polynomial of degree at most n has at most n distinct roots.

[F9]

Complex and real generalized Schur forms: the required complex and real block structures and homogeneous diagonal roots are as defined there.

[F10]

A square matrix with zero determinant has a nonzero kernel vector: over either R or C, zero determinant gives a nonzero kernel vector.

Proof

Proof technique: induction on the pencil order, splitting one real eigenvalue or one nonreal conjugate pair at each step.

1.1givenF9inductionbaseih

We prove the statement by induction on n, with the empty trailing pencil allowed after a final block is removed. For n=1, regularity says the scalar pair (A,B) is not (0,0), and Q=Z=[1] gives the required form. Now let n>1 and assume the result for smaller regular pencils.

1.2givenF1F2F10algebracases

Choose a homogeneous eigenvalue pair [α:β] by [F1]. Its homogeneous determinant is zero, so [F10] gives a nonzero vector v in the kernel over C. For real input and a real projective root, rescale [α:β] to real coordinates and apply [F10] over R. If β≠0, put λ=α/β; then Av=λBv. If Bv=0, this also gives Av=0, contrary to [F2], so Bv≠0. If β=0, then Bv=0 and [F2] gives Av≠0.

2.1step 1.2F4constructcases

If the input field is complex, or if the selected root for real input is real, use a one-dimensional block. Set q=Bv in the finite case and q=Av in the infinite case. Both vectors are nonzero by step 1.2. By [F4], choose unitary/orthogonal alignments Lq=γe1 and Rv=ηe1 and set Q=L∗, Z=R∗. Then Q∗q=γe1 and Z∗v=ηe1, so Q∗AZ and Q∗BZ have zeros below their first entries in the first column. The leading diagonal pair is nonzero: in the finite case its B entry is nonzero, and in the infinite case its A entry is nonzero.

2.2givenF2F7F8step 1.2algebracontradiction

If the input is real and the selected root is nonreal, then β≠0; write λ=α/β=a+ib with b≠0 and write the vector from step 1.2 as v=x+iy in ker⁡(A−λB). The real vectors x,y are linearly independent. If they were dependent, v would be a nonzero complex multiple of a nonzero real vector w, so (A−λB)w=0. If Bw=0, then Aw=0, contradicting [F2]. If Bw≠0, a coordinate with (Bw)i≠0 gives λ=(Aw)i/(Bw)i∈R, contradicting b≠0. Put X=span⁡R{x,y} and Y=span⁡R{Bx,By}. Separating real and imaginary parts gives Ax=aBx−bBy and Ay=bBx+aBy, so A(X)⊆Y. If dim⁡Y<2, then for each μ∈C the map (A−μB):XC→YC has a nonzero kernel because its domain has dimension two and its range has dimension at most one. Hence A−μB is not invertible, so [F7] gives det⁡(A−μB)=0 for every μ, contradicting regularity and [F8]. Thus dim⁡Y=2.

3.1step 2.2F5F6F7F11algebraconstruct

Apply [F5] to obtain orthonormal bases z1,z2 of X and q1,q2 of Y, choosing q1,q2 by Gram–Schmidt on Bz1,Bz2. The restriction B∣X:X→Y sends a basis to the independent pair Bz1,Bz2 and is therefore an isomorphism. Its matrix in these bases is B11=Q1TBZ1, so B11 is invertible and [F7] gives det⁡(B11)≠0; the Gram–Schmidt choice makes this matrix upper triangular. Extend these bases by orthonormal bases of Y⊥ and X⊥ using [F6]. In these full bases, the first two columns of both transformed matrices are supported in the first two rows. Let P be the invertible change-of-basis matrix from (x,y) to (z1,z2). The equations in step 2.2 give A[z1 z2]=B[z1 z2]C, where C=P−1(ab−ba)P. Thus the leading blocks satisfy A11=B11C, and C is similar to (ab−ba). Consequently det⁡(A11−μB11)=det⁡(B11)det⁡(C−μI)=det⁡(B11)((a−μ)2+b2) is a nonzero polynomial with roots a±ib.

4.1step 2.1step 3.1F3F7F8algebra

In either the one-dimensional case of step 2.1 or the two-dimensional case of step 3.1, the transformed pair has a nonzero leading block determinant polynomial g. The transformed full pencil is regular: by [F8] choose μ with det⁡(A−μB)≠0; the unitary or orthogonal changes of basis preserve invertibility. By [F7], the transformed determinant at this μ is also nonzero, so the transformed full determinant polynomial is nonzero. If there is no trailing block, the transformed pencil is just its leading block and this already proves regularity. If the trailing block is nonempty, both block sizes are positive, so [F3] factors the full determinant polynomial as g times the trailing determinant. A product of two nonzero complex polynomials is nonzero because their leading nonzero coefficients have nonzero product. Since g and the full determinant are nonzero, the trailing determinant is nonzero, so the trailing pencil is regular.

5.1step 1.1step 4.1inductionconstructih

If the trailing block is nonempty, apply the induction hypothesis to it and extend its left and right transformations by identity matrices on the leading block. If it is empty, no further transformation is needed. This produces the stated upper triangular complex form or real block upper triangular form with upper triangular second factor.

6.1step 4.1step 5.1F3F7F9algebradischarge-induction∎

The left and right basis changes are invertible, so [F7] shows that they preserve singularity of every homogeneous pencil matrix. If there is one diagonal block, its determinant is the full determinant. With at least two blocks, split off the first diagonal block and apply [F3] repeatedly; every split has positive block sizes. The resulting product is the nonzero determinant polynomial of the regular transformed pencil, so each factor is nonzero by the leading-coefficient argument in step 4.1. Thus a homogeneous pair is a root of the full determinant exactly when it is a root of at least one diagonal block determinant. The basis changes preserve this root set, which proves the claim.

Depends on

Used by

Nothing in the library uses this result yet.

Cited to discharge well-definedness by Complex and real generalized Schur forms.

Dependency tree · two levels

49 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