A reflection-return-gap-period scan varies the return gap across rows, showing how the map period closes only when the reflected iterate lands back on the expected cycle. The verdict is exact only for the stated parameters, return gaps, periods, iterates, and rows in the ideal discrete reflection-map model. Real systems add continuous-time dynamics, noise, parameter drift, finite precision, model mismatch, sampling choices, and measurement uncertainty.

Reflection rows separate fixed return from period-two return. Exact arithmetic here means exact results for the stated model inputs; measured inputs still carry uncertainty and significant-figure limits.

highlighted = computed this step

The midpoint returns but is not period two

One half maps to itself. The return bit is not enough without a non-fixed first step.

x=y=r=12x=y=r=\frac{1}{2}
Reflection fixed rowThe non-fixed bit blocks the period-two claim.mapId=reflectionparameter=1xValue=1/2yValue=1/2returnValue=1/2returnedBit=1 bitnonfixedBit=0 bitperiodTwoBit=0 bit

One third gives a true two-step return

The first update moves to two thirds, then returns to one third.

x=13,y=23,r=xx=\frac{1}{3},\quad y=\frac{2}{3},\quad r=x
Reflection period rowThe period bit needs both return and non-fixed rows.mapId=reflectionparameter=1xValue=1/3yValue=2/3returnValue=1/3returnedBit=1 bitnonfixedBit=1 bitperiodTwoBit=1 bit

A larger first-step gap is still period two

Changing the starting point changes the gap but not the exact two-step return contract.

x∣f(x)−x∣period12001313114121\begin{array}{c|c|c}x&|f(x)-x|&\text{period}\\\frac{1}{2}&0&0\\\frac{1}{3}&\frac{1}{3}&1\\\frac{1}{4}&\frac{1}{2}&1\\\end{array}
Reflection wider period rowThe table separates fixed return from period-two return.mapId=reflectionparameter=1xValue=1/4yValue=3/4returnValue=1/4returnedBit=1 bitnonfixedBit=1 bitperiodTwoBit=1 bit