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

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.

FALSE: Equal characteristic and minimal polynomials imply similarity

Statement

False claim. Two matrices with the same characteristic polynomial and the same minimal polynomial must be similar.

Facts & Assumptions

Given: For any $λ \in F$ , $A = J_{2} (λ) \oplus J_{2} (λ), B = J_{2} (λ) \oplus J_{1} (λ) \oplus J_{1} (λ) .$

[L1]

Jordan block sizes give the characteristic polynomial by total size and the minimal polynomial by largest size (For split operators, Jordan blocks read off eigenspace multiplicities and both canonical polynomials).

[L2]

Split matrices are similar exactly when their Jordan block multisets agree (Split matrices are similar exactly when their Jordan block multisets agree).

Refutation

technique · counterexample

1.1L1algebra

Both matrices have total size four and largest block size two, so [L1] gives $χ_{A} = χ_{B} = (x - λ)^{4}$ and $μ_{A} = μ_{B} = (x - λ)^{2}$ .

1.2algebra

Nevertheless $rank (A - λ I) = 2$ while $rank (B - λ I) = 1$ , and their block multisets are respectively ${2, 2}$ and ${2, 1, 1}$ .

2.1step 1.2L2∎

Fact [L2] therefore says that $A$ and $B$ are not similar, refuting the claim.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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

K. Hoffman and R. Kunze, Linear Algebra, 2nd ed., Section 6.8, Exercise 9 (standard reference, not scraped)