For example, show that any diagram of a link can be changed into a diagram of the unlink by suitable crossing changes.
I am reading some Knot Theory book, but I usually have no idea how to start a proof. For example, to prove the above question. How can I represent any diagram of a link? The statement is understandable, but what a rigorous proof looks like?
Very, very frequently, by induction. In this case, on the number of not-yet-unlinked link components. Can you show the result for a one component link? For the inductive step, can you pick an arbitrary component of a link and make it lie in front of the rest of the link, by switching a subset of its crossings?