The concept of k-extendability is a fundamental notion in matching theory and is closely related to factor-criticality. In a seminal work, Zhang et al. established sharp conditions under which these two concepts are equivalent. In this paper, we study the equivalence between extendability and factor-criticality from the perspective of Sachs subgraphs and discuss conditions under which these notions are equivalent.