The nondegenerate-stress conjecture of Jordán and Tanigawa (2019) states that every generic realization of a generically
globally rigid finite simple graph in 
, for a positive integer 
, admits a nondegenerate equilibrium
stress. For a realization 
with stress coefficients 
, nondegeneracy means that, at every graph
vertex 
, the partial force vectors
 |
for 
, are linearly
independent for every collection of 
pairwise disjoint nonempty subsets 
, 
,
..., 
of the neighborhood 
whose union is a proper subset. The requirement is vacuous
when no such collection exists.
Cruickshank (2026) reports the stronger statement that the stress can also have maximum matrix rank, namely
 |
where 
is the number of vertices and 
is the stress matrix.
Cruickshank attributes discovery of the new proofs to ChatGPT 6.1 Sol and reports
checking the arguments. Independent specialist verification or formal certification
of the complete proof has not been reported.
