2572 — Discrete Label Bits Do Not Reconstruct Arbitrary Theta Amplitudes
For basis labels, classical bits suffice to identify which single label was presented. But a linear discrete observation
is faithful on arbitrary coefficient packets only if . Uniform observability has the same rank requirement.
The smallest hostile code has three distinct two-bit columns,
but misses the nonzero superposition . Pairwise label separation is therefore weaker than joint linear faithfulness.
No fixed finite-dimensional discrete port can observe arbitrary theta coefficient packets as the cutoff grows. The viable repair is a growing one-hot/Fock port retaining the full labelled basis, or a source-derived lower-dimensional admissible state manifold.
Scope
This is an exact finite-dimensional rank theorem and resource lower bound. It does not assert that arbitrary labelled superpositions are physically admitted or that the full discrete port has a source-derived physical instrument.
Durable verification
- Packet:
research/kitaev/theta-discrete-port-rank-law.md - Checker:
uv run --with sympy python research/kitaev/checkers/check_theta_discrete_port_rank.py - Result:
research/kitaev/results/theta-discrete-port-rank.json - SymPy preflight:
1.14.0. - First run: all mathematical assertions passed; JSON serialization rejected exact SymPy integers. Encoding was repaired without changing an assertion.
- Final exact checker: exit code
0; three-label code rank2, hidden output zero, and five-label one-hot Gram equal to identity. - Checker SHA-256:
acb092013971255d6f0ef496c663552487187c23b00aa316a9f096edf4c0086c. - Ledger allocation:
seqclaim-b6768b93434ae248148c3026. - Epistemic graph results:
ev-000000003687-a7458f4e-f94e-4337-8c4a-ca03bcde95cetomarici.Nimaandev-000000003688-a598fdd4-07c6-4648-9016-f995a4e8774etomarici.Grothendieck. - No Git command, site build, or KaTeX checker was run.
- Committed: no. Pushed: no.