Component counts

• 2026-08-28 [Refuted] The boundary state of a Kronecker word grows with level, so the component count is not a finite-state function of the code sequence - one failed trial state (the four-corner partition of the running product, exact at length 2 and wrong on 20 of 216 words at length 3) bounds nothing; a linear representation of rank 4 exists and is exact on all 54240 words of length at most 4; what is unbounded is the naive geometric state kappa, which reaches 2^(level-1). Witness: order-sensitivity-of-kronecker-words.