Alphabeta Math
False statementConstruction: AI-adaptedVerification: 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: Every endomorphism has a commuting diagonal-plus-nilpotent decomposition over its base field

Statement

False claim. Every endomorphism T over its base field can be written T=D+N with D diagonalisable, N nilpotent, and DN=ND.

Facts & Assumptions

Given: The real quarter-turn R=(0−110).

[L1]

A commuting family whose characteristic polynomials split is simultaneously triangularisable (A commuting split family is simultaneously triangularisable).

[L3]

A nilpotent endomorphism has characteristic polynomial xn (Characterisations of a nilpotent endomorphism).

[L4]

An endomorphism is triangularisable exactly when its characteristic polynomial splits (T is triangularisable iff its minimal polynomial splits iff its characteristic polynomial splits).

Refutation

technique · counterexample
1.1assume-contraL1L2L3

Suppose R=D+N as claimed. By [L2], χD splits, while [L3] makes χN=x2 split; commutation and [L1] give one real basis in which both D and N are upper triangular.

2.1step 1.1L4algebra

Their sum R is upper triangular in that basis, so [L4] would make χR split over R.

3.1step 2.1discharge-contradictionalgebra∎

But direct computation gives χR=x2+1, which has no real root. This contradiction refutes the claimed decomposition over the base field.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

19 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