ExampleConstruction: AI-generatedVerification: AI-generatedprecheck 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.

Building a Jordan-string basis for a nilpotent operator on $F^{6}$

Example

Let $(e_{1}, \dots, e_{6})$ be the standard basis of $F^{6}$ and define $N e_{1} = 0, N e_{2} = e_{1}, N e_{3} = e_{2}, N e_{4} = 0, N e_{5} = e_{4}, N e_{6} = 0.$ Then $(e_{1}, e_{2}, e_{3})$ , $(e_{4}, e_{5})$ , and $(e_{6})$ are Jordan strings whose concatenation is a basis. Thus $[N] = J_{3} (0) \oplus J_{2} (0) \oplus J_{1} (0)$ and $N^{3} = 0 \neq N^{2}$ .

Facts & Assumptions

Given: The displayed endomorphism on the standard basis of $F^{6}$ .

[L1]

A nilpotent Jordan string satisfies $N v_{1} = 0$ and $N v_{j} = v_{j - 1}$ for $j \geq 2$ (Jordan blocks, Jordan strings, and their endpoints).

[L2]

Every finite-dimensional nilpotent endomorphism admits a basis of Jordan strings (Every finite-dimensional nilpotent endomorphism has a basis of Jordan strings).

Verification

technique · computation

1.1L1algebra

The six displayed images verify [L1] separately for the three listed strings, and their concatenation is the standard basis.

2.1step 1.1L2algebra∎

In that order the matrix has blocks $J_{3} (0)$ , $J_{2} (0)$ , and $J_{1} (0)$ ; direct iteration gives $N^{3} = 0$ and $N^{2} e_{3} = e_{1} \neq 0$ , consistently with [L2].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

8 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.

Building a Jordan-string basis for a nilpotent operator on F6F6