LemmaStatement: Literature-sourcedProof: 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.

Independent initial vectors make a family of nilpotent Jordan strings independent

Statement

Let $N : V \to V$ be an endomorphism and let $(v_{i, 1}, \dots, v_{i, m_{i}})$ be finitely many Jordan strings for $N$ at $0$ . If their initial vectors $v_{i, 1}$ are linearly independent, then the union of all vectors in the strings is linearly independent. The empty family is allowed.

Facts & Assumptions

Given: A finite family of nilpotent Jordan strings whose initial vectors are linearly independent.

[L1]

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

[L2]

A finite family is linearly independent when its only vanishing finite linear combination has every coefficient zero (Linear independence: a finite list $v : n \to V$ is independent when $\sum_{i < n} λ_{i} v_{i} = 0_{V}$ forces every $λ_{i} = 0_{F}$ , and a subset $S \subseteq V$ is independent when every injective finite list into $S$ is independent).

Proof

technique · induction

1.1baseL2

Induct on a natural number $r$ bounding all the string lengths, taking $r = 0$ for the empty family, which has no strings and no maximum length. At $r = 0$ the family is empty and the assertion is immediate, the empty union being independent by [L2].

1.2L1ihalgebra

Assume the result for families whose lengths are bounded by $r - 1$ , and let the present family have lengths bounded by $r \geq 1$ with some string of length exactly $r$ . In a relation $\sum_{i, j} a_{i, j} v_{i, j} = 0$ , applying $N^{r - 1}$ and using [L1] gives $\sum_{i : m_{i} = r} a_{i, r} v_{i, 1} = 0$ .

2.1step 1.2ihL2discharge-induction∎

Independence of the initial vectors forces every coefficient $a_{i, r}$ to vanish. Removing the terminal vectors at position $r$ leaves a relation among truncated strings of maximum length at most $r - 1$ , so the induction hypothesis makes all remaining coefficients zero; [L2] gives independence of the whole union.

Depends on

Used by

Every finite-dimensional nilpotent endomorphism has a basis of Jordan strings Theorem

Dependency tree · two levels

12 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

S. Treil, Linear Algebra Done Wrong, Chapter 9, Theorem 4.1 (standard reference, not scraped)