A two-cycle is a pair of states that swap under the map and return after two steps, f(f(x)) = x with f(x) != x, so neither state alone is the resting point. This verdict is exact for the stated map, parameters, and iteration count over a finite snapshot. Real systems add transient behavior, noise, parameter uncertainty, sampling limits, and model error that can mimic or hide a true cycle.
A period-two witness needs both a return and a non-fixed step. Exact arithmetic here means exact results for the stated model inputs; measured inputs still carry uncertainty and significant-figure limits.
highlighted = computed this step
A two-cycle must return
The reflection map sends one quarter to three quarters and then back to one quarter.
41→43→41
It must also not stop after one step
Because three quarters is not one quarter, the period-two bit is 1.