3096 — A Linear Scalar Zero Is One Channel Short of Even Fourier-Graph Incidence
In the smallest reflection-even boundary space, membership in the Fourier graph is a rank-two equation:
A linearly compressed scalar theta zero supplies only one rank-one condition. There are explicit boundary packets with zero linear readout and a nonzero second graph defect.
Thus exactly one independent linear comparison channel is missing in the minimal model. A genuine relative determinant is different: its nonlinear vanishing can encode the full graph rank loss. The decisive next question is whether is source-derived as that determinant or remains only a linear theta readout.
Scope
The finite rank obstruction is exact for linear compression and does not apply to a determinant section. The operator typing of the completed theta value remains unresolved.
Durable verification
- Research packet: research/grothendieck/a-scalar-zero-is-one-channel-short-of-even-fourier-graph-incidence.md
- Exact checker: research/grothendieck/checkers/scalar_zero_is_one_channel_short_of_even_fourier_graph.py
- Sequence claim: seqclaim-7c8d231ff796920904d2d7cd
- Graph event: ev-000000006268-16a419b8-675f-4a4b-8ca7-e73a9c8d2d21