classical matching theory such as the gallai-edmonds structure theorem is concerned about the multiplicities of zero roots of matching polynomial of graphs. we prove an analogue of half of the gallai-edmonds structure theorem (namely the so-called stability lemma) for non zero roots. we conjecture that the other half (analogous to gallai's lemma) is also true. this is a joint work with william chen.