Alphabeta Math
Session-authored (Fable 5 assisted)
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.

19 results · all verified · 12 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 7 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

The Spectral Theorem and SVD: Examples and Counterexamples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

An explicit real symmetric 3x3 matrix is orthogonally diagonalised

Example

For

A=(210120003),

an orthogonal matrix

Q=(1212012120001)

satisfies

QTAQ=diag(1,3,3).

Facts & Assumptions

Given: The real symmetric matrix A above, acting on R3 with the standard inner product.

[L1]

A self-adjoint operator on a finite-dimensional real inner product space has an orthonormal eigenbasis (Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis).

Verification

technique · direct
1.1

Direct multiplication gives A(1,1,0)T=(1,1,0)T, A(1,1,0)T=3(1,1,0)T, and A(0,0,1)T=3(0,0,1)T. After normalising the first two vectors, the three displayed columns of Q form an orthonormal eigenbasis, exactly as [L1] predicts.

L1algebra
2.1

Because the columns of Q are orthonormal eigenvectors with eigenvalues 1,3,3, the conjugated matrix QTAQ is diagonal with those eigenvalues on the diagonal.

step 1.1algebra
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

An explicit Hermitian 2x2 matrix is unitarily diagonalised

Example

For

H=(2ii2),

the unitary matrix

U=12(ii11)

satisfies

UHU=diag(3,1).

Facts & Assumptions

Given: The Hermitian matrix H above, acting on C2 with the standard Hermitian inner product.

[L1]

A normal operator on a finite-dimensional complex inner product space has an orthonormal eigenbasis (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).

Verification

technique · direct
1.1

One checks that H(i,1)T=3(i,1)T and H(i,1)T=(i,1)T. After dividing by 2, these eigenvectors are orthonormal, so the columns of U form the orthonormal eigenbasis guaranteed by [L1].

L1algebra
2.1

Because the columns of U are orthonormal eigenvectors with eigenvalues 3 and 1, the conjugated matrix UHU is diag(3,1).

step 1.1algebra
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

The real quarter-turn is normal and appears as a single 2x2 block in the real normal classification

Example

The quarter-turn

A=(0110)

is normal on R2, has complex eigenvalues ±i, and in the standard orthonormal basis already appears as the 2×2 block from the real normal classification.

Facts & Assumptions

Given: The quarter-turn matrix A acting on R2 with the standard inner product.

[L1]
[L2]

Real normal operators are orthogonally block-diagonalisable with 1×1 and 2×2 rotation-scaling blocks (A real normal endomorphism is orthogonally block-diagonalisable with 1x1 real blocks and 2x2 rotation-scaling blocks).

Verification

technique · direct
1.1

Direct multiplication gives ATA=AAT=I2, so A is normal by [L1]. Its characteristic polynomial is x2+1, so over C its eigenvalues are i and i.

L1algebra
2.1

The matrix A itself has the form (abba) with a=0 and b=10, so it is exactly one of the 2×2 blocks allowed by [L2].

L2step 1.1
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-28Open item page →

A complex symmetric matrix can be nonzero, square to zero, and fail to be normal

Example

The complex matrix

A=(1ii1)

is symmetric, nonzero, nilpotent of index 2, and not normal.

Facts & Assumptions

Given: The complex matrix A above.

[L1]

In an orthonormal basis, normality is equivalent to commuting with the conjugate transpose (In an orthonormal basis, self-adjoint means conjugate-transpose symmetry and normal means commuting with the conjugate transpose).

Verification

technique · direct
1.1

The matrix is symmetric because AT=A, and direct multiplication gives A2=0 while A0, so A is a nonzero nilpotent matrix of index 2.

algebra
2.1

Its conjugate transpose is A=(1ii1), and direct multiplication gives AA=(22i2i2) but AA=(22i2i2). Hence AAAA, so A is not normal by [L1].

L1algebra
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-28Open item page →

The non-negative square root of an explicit matrix is exhibited as a polynomial in the matrix

Example

For

A=(52323252),

the non-negative square root is

R=(32121232)=13A+23I.

Facts & Assumptions

Given: The real symmetric matrix A above.

[L2]

The non-negative square root of a non-negative operator is a polynomial in the operator (The non-negative square root of a non-negative operator is a polynomial in the operator).

Verification

technique · direct
1.1

One has A(1,1)T=4(1,1)T and A(1,1)T=(1,1)T, so after normalising these vectors, [L1] gives an orthonormal eigenbasis with eigenvalues 4 and 1. Therefore A is non-negative.

L1algebra
2.1

In the same eigenbasis, the non-negative square root has eigenvalues 2 and 1, which corresponds in the standard basis to R=(3/21/21/23/2). Direct multiplication gives R2=A, and direct algebra gives R=13A+23I, exactly as [L2] predicts.

L2step 1.1algebra
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

A worked polar decomposition of an invertible matrix

Example

For

T=(0210),

the polar decomposition is

T=SU,S=(0110),U=(1002).

Facts & Assumptions

Given: The matrix T above on R2 with the standard inner product.

Verification

technique · direct
1.1

Direct multiplication gives TT=(1004), so its non-negative square root is U=(1002).

L1algebra
2.1

The matrix S=(0110) satisfies STS=I, so it is orthogonal, and SU=(0210)=T. Hence this is the polar decomposition predicted by [L1].

L1step 1.1algebra
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

A singular matrix has a polar decomposition with visibly nonunique isometric factors

Example

For

T=(1000),

one has the polar factor U=(1000) and two distinct orthogonal choices

S1=(1001),S2=(1001),

with

T=S1U=S2U.

Facts & Assumptions

Given: The singular matrix T above on R2 with the standard inner product.

[L1]

The polar decomposition exists, and uniqueness of the isometric factor fails in general when the operator is singular (Every endomorphism has a polar decomposition T = SU with U non-negative and S an isometry on the orthogonal complement of ker T, and S is unique exactly when T is invertible).

Verification

technique · direct
1.1

Because TT=T, the non-negative square root is U=T. Also S1 and S2 are both orthogonal because S1TS1=S2TS2=I.

L1algebra
2.1

Direct multiplication gives S1U=U=S2U=T, while S1S2. Hence this singular operator has more than one polar isometric factor, exactly as [L1] allows.

L1step 1.1algebra
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

The singular value decomposition of an explicit 2x3 matrix

Example

For the linear map R3R2 with matrix

A=(200010),

an SVD is

A=UΣVT,U=I2,Σ=(200010),V=I3.

Facts & Assumptions

Given: The matrix A above with the standard inner products on R3 and R2.

[L1]

Every linear map between finite-dimensional inner product spaces admits a singular value decomposition (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).

Verification

technique · direct
1.1

Direct multiplication gives ATA=diag(4,1,0), so the singular values are 2,1,0, with standard basis vectors as right-singular vectors.

L1algebra
2.1

The images of the first two standard basis vectors are 2e1 and e2, so the standard basis of R2 gives the left-singular vectors. Therefore U=I2, V=I3, and the displayed diagonal matrix Σ give an SVD of A, exactly as [L1] guarantees.

L1step 1.1algebra
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-28Open item page →

The rank-one truncation of an SVD realises the Eckart-Young minimiser

Example

For the matrix

A=(200010),

the rank-one truncation

A1=(200000)

is a best rank-at-most-one approximation in operator norm, and the error is 1.

Facts & Assumptions

Given: The matrix A above and its rank-one truncation A1.

[L1]

The matrix A has singular values 2,1,0 (The singular value decomposition of an explicit 2x3 matrix).

[L2]

The rank-1 truncation of an SVD is a best rank-at-most-1 approximation, with error equal to the next singular value (The best rank-at-most-k approximation in operator norm is the rank-k truncation of a singular value decomposition).

Verification

technique · direct
1.1

By [L1], deleting the second singular direction replaces A by A1=(200000), which has rank 1, and AA1=(000010) has operator norm 1.

L1algebra
2.1

The next singular value after the retained one is 1, so [L2] says exactly that no rank-at-most-one matrix lies closer to A in operator norm than A1. Therefore A1 is the Eckart-Young minimiser.

L2step 1.1
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

Courant-Fischer is checked on an explicit 3x3 symmetric matrix

Example

For the symmetric matrix

D=diag(4,2,1),

the Rayleigh quotient is

RD(x,y,z)=4x2+2y2+z2x2+y2+z2,

so the Courant-Fischer formulas recover the ordered eigenvalues 4,2,1.

Facts & Assumptions

Given: The diagonal matrix D=diag(4,2,1) on R3 with the standard inner product.

[L1]

Courant-Fischer characterises the ordered eigenvalues of a real self-adjoint operator by min-max formulas (Courant-Fischer min-max principle for self-adjoint endomorphisms on finite-dimensional real inner product spaces).

Verification

technique · direct
1.1

For every nonzero (x,y,z), the displayed formula shows 1RD(x,y,z)4, with the value 4 at e1, the value 2 at e2, and the value 1 at e3. On span(e2,e3) the quotient is at most 2, and on span(e1,e2) it is at least 2.

algebra
2.1

Therefore maxv0RD(v)=4, minv0RD(v)=1, and the k=2 Courant-Fischer min-max and max-min values are both 2. This matches the ordered eigenvalues 4,2,1, exactly as [L1] predicts.

L1step 1.1
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-28Open item page →

The eigenvalues of a principal 2x2 submatrix interlace those of a 3x3 symmetric matrix

Example

For

A=(210120003),B=(2112),

the eigenvalues of A are 3,3,1 and the eigenvalues of the principal submatrix B are 3,1, so they interlace.

Facts & Assumptions

Given: The matrices A and B above, where B is the compression of A to the coordinate hyperplane span(e1,e2).

[L1]

Orthogonal compression to a hyperplane gives interlacing eigenvalues for a self-adjoint operator (The eigenvalues of the orthogonal compression of a self-adjoint endomorphism to a hyperplane interlace those of the original endomorphism).

Verification

technique · direct
1.1

The characteristic polynomial of A is (x3)2(x1), so its ordered eigenvalues are 3,3,1. The characteristic polynomial of B is (x3)(x1), so its ordered eigenvalues are 3,1.

algebra
2.1

These satisfy 3=λ1(A)μ1(B)=3λ2(A)=3 and 3=λ2(A)μ2(B)=1λ3(A)=1, exactly the pattern asserted by [L1].

L1step 1.1
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

Gershgorin disks for an explicit 3x3 matrix contain the true spectrum

Example

For

A=(210031004),

the Gershgorin disks are

D1={z:z21},D2={z:z31},D3={4},

and they contain the whole spectrum {2,3,4}.

Facts & Assumptions

Given: The upper-triangular matrix A above.

[L1]

Every eigenvalue lies in some Gershgorin disk (Every eigenvalue lies in some Gershgorin disk).

Verification

technique · direct
1.1

The row sums off the diagonal are 1,1,0, so the displayed three Gershgorin disks are exactly the ones attached to A.

algebra
2.1

Because A is upper triangular, its eigenvalues are the diagonal entries 2,3,4, and each of these lies in the displayed union of disks. This is the concrete containment asserted abstractly by [L1].

L1step 1.1
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

FALSE: Every normal operator is diagonalisable over its base field

Statement

Every normal operator is diagonalisable over its base field.

Facts & Assumptions

Given: The quarter-turn matrix A=(0110) on R2.

[L1]

The real quarter-turn is normal and has complex eigenvalues ±i (The real quarter-turn is normal and appears as a single 2x2 block in the real normal classification).

Refutation

technique · direct
1.1

By [L1], the quarter-turn A is a normal real operator.

L1
2.1

The same example [L1] shows that A has no real eigenvalue, so it cannot have a real eigenbasis and is not diagonalisable over R. This refutes the field-free claim.

L1
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

FALSE: Every complex symmetric matrix is unitarily diagonalisable

Statement

Every complex symmetric matrix is unitarily diagonalisable.

Facts & Assumptions

Given: The complex symmetric matrix A=(1ii1).

[L2]

A complex matrix is unitarily diagonalisable exactly when the corresponding operator is normal (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).

Refutation

technique · direct
1.1

By [L1], the matrix A is indeed complex symmetric.

L1
2.1

If A were unitarily diagonalisable, [L2] would make it normal. That contradicts [L1]. Therefore the claim is false.

L1L2
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-28Open item page →

FALSE: If <Tv,v> is nonnegative for every v, then T is automatically self-adjoint

Statement

If Tv,v is nonnegative for every vector v, then T is automatically self-adjoint.

Facts & Assumptions

Given: The quarter-turn matrix A=(0110) on R2.

[L1]

The quarter-turn is not self-adjoint, because it is normal of the 2×2 rotation type rather than diagonal over R (The real quarter-turn is normal and appears as a single 2x2 block in the real normal classification).

Refutation

technique · direct
1.1

For every v=(x,y)T, one has Av=(y,x)T and therefore Av,v=xy+xy=00. Thus the hypothesis of the claim holds for A.

algebra
2.1

By [L1], the same operator A is not self-adjoint. Hence the displayed inequality alone does not force self-adjointness, and the claim is false.

L1step 1.1
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

FALSE: A non-negative operator has a unique square root among all operators

Statement

A non-negative operator has a unique square root among all operators.

Facts & Assumptions

Given: The identity operator I on R2.

[L1]

A non-negative operator has a unique non-negative square root (A non-negative operator has a unique non-negative square root).

Refutation

technique · direct
1.1

The operator I is non-negative, and [L1] says its non-negative square root is uniquely I itself.

L1
2.1

Nevertheless (I)2=I2=I and II. So I has at least two square roots, and uniqueness fails once the non-negative condition on the square root is dropped.

step 1.1algebra
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

FALSE: The isometry in the polar decomposition is unique even for singular operators

Statement

The isometry in the polar decomposition is unique even for singular operators.

Facts & Assumptions

Given: The singular matrix T=(1000).

[L1]

This matrix has two distinct polar isometric factors S1 and S2 with the same non-negative factor U (A singular matrix has a polar decomposition with visibly nonunique isometric factors).

Refutation

technique · direct
1.1

By [L1], the singular matrix T admits both decompositions T=S1U and T=S2U, with S1S2.

L1
2.1

Therefore the isometry in a polar decomposition need not be unique for a singular operator. This refutes the claim.

L1
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-28Open item page →

FALSE: The singular values of an operator are the absolute values of its eigenvalues

Statement

The singular values of an operator are the absolute values of its eigenvalues.

Facts & Assumptions

Given: The nilpotent matrix N=(0200) on R2.

Refutation

technique · direct
1.1

The characteristic polynomial of N is x2, so both eigenvalues are 0 and their absolute values are 0,0.

algebra
2.1

Direct multiplication gives NTN=diag(0,4), so the singular values are 2 and 0. Because 20, the singular values are not the absolute values of the eigenvalues.

L1step 1.1algebra
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-28Open item page →

FALSE: The operator norm is always the largest modulus of an eigenvalue

Statement

The operator norm is always the largest modulus of an eigenvalue.

Facts & Assumptions

Given: The nilpotent matrix N=(0200) on R2.

Refutation

technique · direct
1.1

The characteristic polynomial of N is x2, so every eigenvalue of N has modulus 0.

algebra
2.1

For a unit vector (x,y)T, one has N(x,y)T=2y2, with equality at (0,1)T. Thus N=2, which by [L1] is also its largest singular value. Because 20, the operator norm is not the largest eigenvalue modulus.

L1step 1.1algebra

Sources