A one-dimensional fixed point attracts when the derivative magnitude is below one and repels when it exceeds one. I want the notation, the mechanism, and the failure mode visible at the same time.
Set-up
A discrete dynamical system iterates \(x_{n+1}=F(x_n)\), while a flow solves \(\dot x=V(x)\). Fixed points, periodic orbits, and invariant sets organize long-term behavior.
A reliable calculation names domain and codomain. The notation \(\mathsf{data}\mapsto\mathsf{claim}\) is harmless only after both \(\operatorname{dom}\) and \(\operatorname{cod}\) have been fixed.
The calculation
Now evaluate one representative case. The result should agree with the structural law above, but it is obtained without assuming the conclusion.
What survives abstraction
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.
The boundary
Sensitive dependence is not the same as randomness. A deterministic system may be chaotic while remaining exactly specified by its initial condition.
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.