Oddly enough, it seems that after all the discussion at this post, no-one actually wrote down a criterion for a nilpotent matrix to have a square root.

The answer is very nice, in fact:

**Proposition.** *A nilpotent matrix has a square root if and only if the -th Jordan block (from largest to smallest) is the same size, or one larger than -th.*

Who feels like giving a proof in comments?

**EDIT: **I originally bollixed the condition, by transposing the partition given by the Jordan blocks (the above condition is the same as the partition given by the Jordan blocks having transpose where each odd row length appears at most once).

### Like this:

Like Loading...

*Related*

I think you’re wrong… Isn’t the square of a nilpotent 6-block, two 3-blocks? Also (1,1,1)^2 = (1,1,1).

Wrong is such an ugly word. I just got my partitions transposed. Now your counterexample has been itself countered.

Still wrong! Simplest counterexample is (2,3,4).

If I’m not mistaken, the square of a nilpotent 2n-block is two n-blocks, while the square of a (2n+1)-block is an n-block and an (n+1)-block. You can then order the blocks by decreasing size, separate into pairs, and note that admissible pairs have size off by at most one. We can eliminate the boundary case of an odd number of blocks by allowing blocks of size zero.

I agree with Scott!

Not a counterexample. The 4th part is 0 and 3rd part is 2.

Good proof, Scott.

Ah, ok, I misunderstood your new statement. Good thing I thought better of my plan to scratch out this posts title and replace it with “Epic Fail.”

Ex-squeeze me? They make lolposts now?

I did give the condition in comment #17: “The nilpotent term has a square root iff Jordan blocks can be paired so that the two blocks in each pair are either the same size or adjacent sizes.”

The proof follows directly from the Jordan canonical form of the square root.

im in ur matrix

~~killing~~squaring ur bl0x