Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-11
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.

A nonzero square-zero matrix is not similar to any diagonal matrix

Example

For every field FF, the matrix

N=E01=(0100)M2(F)N=E_{01}=\begin{pmatrix}0&1\\0&0\end{pmatrix}\in M_2(F)

is nonzero and satisfies N2=0N^2=0, but it is not similar to any diagonal matrix.

Facts & Assumptions

Given: A field FF and the displayed matrix NN.

[L1]

Matrix units satisfy EijEk=δjkEiE_{ij}E_{k\ell}=\delta_{jk}E_{i\ell} (EijEk=δjkEiE_{ij}E_{k\ell}=\delta_{jk}E_{i\ell}).

[L2]

Similarity has the form N=P1DPN=P^{-1}DP with PP invertible, and every nonzero scalar in a field has an inverse (Similar matrices: B=P1APB=P^{-1}AP for an invertible PP, Field).

Verification

technique · contradiction
1.1

By [L1], N2=E01E01=0N^2=E_{01}E_{01}=0, while the (0,1)(0,1)-entry of NN is 11, so N0N\ne0. Suppose, for contradiction, that N=P1DPN=P^{-1}DP as in [L2], with DD diagonal. Then 0=N2=P1D2P0=N^2=P^{-1}D^2P, so D2=0D^2=0.

assume-contraL1L2
2.1

Every diagonal entry dd of DD satisfies d2=0d^2=0. If d0d\ne0, the inverse from [L2] gives d=0d=0, a contradiction; hence D=0D=0, and then N=P10P=0N=P^{-1}0P=0, contradicting step 1.1. Thus NN is not similar to a diagonal matrix.

step 1.1L1L2discharge-contradiction

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 9 results over 5 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.