Control
plain-language theorem explainer
The Control structure supplies the minimal boolean pulse datum per tick for the flight scheduling model. Researchers on 8-tick control disciplines cite it as the base type for drive schedules that feed gravity falsifiers and Riemann attachments. The declaration is a direct structure definition with one field and Repr derivation.
Claim. A control datum consists of a single boolean pulse indicator at each tick: $C := (p : B)$ where $B$ denotes the booleans.
background
The Flight.Schedule module sets up an 8-tick control discipline that reuses 8-window neutrality predicates from SpiralField. The tick is the fundamental RS time quantum, defined as 1 in Constants and re-exported in RSNativeUnits. Upstream, IntegrationGap supplies the active edge count A per tick, while OptionAEmpiricalProgram and SimplicialLedger supply collision-free and edge-length predicates.
proof idea
This is a structure definition that introduces the Control type with a single boolean field and derives Repr.
why it matters
Control supplies the type for the DriveSchedule abbreviation, which is used in the global_only_policy theorem of SPARCFalsifier and in the attachmentWithMargin result for the Riemann hypothesis. It supports the eight-tick octave (T7) in the T0-T8 forcing chain.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.