ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-13

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 matrix $(\begin{array}{cc} 2 & 1 \\ 0 & 3 \end{array})$ has characteristic polynomial $(x - 2) (x - 3)$ and two explicitly computed eigenspaces

Example

Over $R$ , let

$A = (\begin{array}{cc} 2 & 1 \\ 0 & 3 \end{array}) .$

Then $χ_{A} (x) = (x - 2) (x - 3)$ , $E_{2} (A) = span {(1, 0)}$ , and $E_{3} (A) = span {(1, 1)}$ .

Facts & Assumptions

Given: The displayed real matrix $A$ .

[L1]

The characteristic polynomial is $\det (x I - A)$ (For $A \in M_{n} (F)$ , the characteristic polynomial is $χ_{A} (x) = \det (x I_{n} - A)$ when $n \geq 1$ , with $χ_{A} (x) = 1$ for the unique $0 \times 0$ matrix).

[L2]

The eigenspace is $E_{λ} (A) = \ker (A - λ I)$ (Eigenvalues, eigenvectors, eigenspaces $E_{λ} (T) = \ker (T - λ I)$ , and the spectrum $σ_{F} (T)$ of an endomorphism).

Verification

technique · direct computation

1.1

By [L1], $χ_{A} (x) = \det (\begin{array}{cc} x - 2 & - 1 \\ 0 & x - 3 \end{array}) = (x - 2) (x - 3)$ .

L1algebra

1.2

The equation $(A - 2 I) (u, v) = (v, v) = (0, 0)$ gives $v = 0$ , hence $E_{2} (A) = {(u, 0) : u \in R} = span {(1, 0)}$ .

L2algebra

1.3

The equation $(A - 3 I) (u, v) = (- u + v, 0) = (0, 0)$ gives $v = u$ , hence $E_{3} (A) = span {(1, 1)}$ .

L2algebra

2.1

The two nonzero spanning vectors also directly exhibit both roots as eigenvalues.

step 1.1step 1.2step 1.3L2∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

9 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

H. Pinkham, Linear Algebra, §12.1 (standard reference, not scraped)

The matrix (2103)(20​13​) has characteristic polynomial (x−2)(x−3)(x−2)(x−3) and two explicitly computed eigenspaces