Repeatedly deleting all leaves exposes the vertices of minimum eccentricity. Keeping the exact identity in view prevents the geometric or probabilistic intuition from drifting.
Definitions first
A finite graph \(T=(V,E)\) is a tree when it is connected and acyclic. The unique simple path \(P_{uv}\) between two vertices makes distance and recursive decomposition especially rigid.
The formulas should not be merged too early. The datum \(\mathsf D\), the conclusion \(\mathsf C\), and the bridge \(\Longrightarrow\) have three different logical jobs.
A small case in full
This is the algebraic core of the note. Once this line is correct, the surrounding interpretation has something solid to refer to.
The reusable statement
The compact alignment is a local map of the argument: assumptions on the first row, consequence on the second. Any generalisation must preserve that dependency.
A nearby false statement
A rooted tree adds a parent relation that an unrooted tree does not possess. Statements about ancestors depend on the chosen root.
With the dependency made explicit, the same pattern can be recognised safely in nearby problems. A changed hypothesis should now be easy to spot.