qgChannels_length
plain-language theorem explainer
The typed QG observation-channel list has exactly five entries. Anyone citing the D5 falsifier surface or the one-statement packaging of PTA, EHT, S-star, Cassini, and ringdown models needs this count. The proof is reflexivity on the list definition.
Claim. The finite list of typed quantum-gravity observation-channel signal models has length $5$.
background
This module builds typed signal models for the D5 quantum-gravity falsifier surface. Each channel packages an observable, an RS prediction (or band), a GR/inflation/ΛCDM null baseline, current sensitivity, a named 2026–2035 falsifier threshold, and a separation theorem showing the RS value and null baseline differ by more than that threshold.
The five channels named in the module are: PTA stochastic gravitational-wave background, EHT shadow/ring, S-star orbits near Sgr A*, Cassini/Shapiro delay, and black-hole ringdown echoes. The list collecting those five models is the object whose cardinality is fixed here.
List length is ordinary finite-list cardinality (the same notion as length of a finite trace in the primitive recognition calculus). No dynamical or geometric input enters the count.
proof idea
One-line term proof by reflexivity. The channel list is defined as an explicit five-element list literal, so length = 5 holds definitionally and rfl closes the goal. No lemmas are applied.
why it matters
The certificate structure for the whole module records this equality as its channel_count field, and the one-statement theorem opens with the conjunction that the channel list has length 5, every channel has positive RS–null separation, and the PTA and strong-field master-theorem witnesses are inhabited.
Without a locked count of five, the D5 surface would not match the module’s stated roster (PTA, EHT, S-star, Cassini, ringdown). The result is pure bookkeeping, but it is the first conjunct of the public one-statement claim that packages the typed observation-channel models for gravity.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.