The square model of the torus yields two generators whose boundary word forces them to commute. Keeping the exact identity in view prevents the geometric or probabilistic intuition from drifting.
Set-up
The fundamental group \(\pi_1(X,x_0)\) records based loops modulo based homotopy. A covering map \(p:\widetilde X\to X\) turns loop classes into endpoint data upstairs.
The definition determines which expressions are legal; only then does the identity become meaningful. An equality in \(\mathcal A\) may change ambient meaning, so I keep \(\mathsf D\) separate from \(\mathsf C\).
The calculation
The following line is the smallest calculation that still exercises the mechanism. It keeps nested delimiters and the order of operations explicit.
What survives abstraction
The aligned summary deliberately puts the datum and conclusion on different rows. Mathematically, this is the distinction between specifying an object and proving a property of it.
The boundary
Basepoints matter for literal homomorphisms. Changing basepoint produces an isomorphism only after choosing a path, and the choice is visible up to conjugation.
This is enough machinery for one note: an exact object, a worked case, a structural law, and a clearly marked boundary. Each layer can now be tested independently.