balancedSchedule
plain-language theorem explainer
An explicit 8-tick schedule is defined by assigning unit positive contribution to the first four indices and unit negative contribution to the last four. Researchers modeling Nautilus-class access paths cite this construction when instantiating the neutrality constraint on signed tick contributions. The definition proceeds by direct conditional assignment on the finite index set of length eight.
Claim. Define the map $s$ from the set of eight consecutive ticks to the integers by $s(k)=1$ when $k<4$ and $s(k)=-1$ otherwise.
background
Within the Nautilus technological access module an 8-tick schedule is a function assigning a signed integer to each position in a cycle of length eight. The neutrality constraint, imported from the atomicity foundation, requires that the sum of any aligned window of eight contributions equals zero. The module itself encodes structural definitions for Class C power tiers and engineering parameters under the Recognition Science framework.
proof idea
The definition is supplied directly by a piecewise conditional on the tick index: positive unit value on the initial half-cycle and negative unit value on the final half-cycle.
why it matters
This schedule supplies the concrete witness for the downstream neutrality theorem in the same module. It instantiates the eight-tick octave (T7) from the foundational forcing chain inside the technological access path for superhuman-scale systems.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.