no-deleting theorem (from no-cloning)
Theorem.no-deleting theorem (from no-cloning) — the same linearity argument as no-cloning (noCloningWitness): deleting an unknown state to a fixed blank forces ⟨ψ|φ⟩ = ⟨ψ|φ⟩² (∈ {0,1}), impossible for distinct non-orthogonal states.
Proof.the same linearity argument as no-cloning (noCloningWitness): deleting an unknown state to a fixed blank forces ⟨ψ|φ⟩ = ⟨ψ|φ⟩² (∈ {0,1}), impossible for distinct non-orthogonal states — information moves, never destroyed: COMPOUNDING.
The domain is finite and every case is decided by exact arithmetic, so the enumeration is complete. ∎
src/thunder/verify/index.ts#discoveredTheoremsWaveFortySix
1 · Classification
finite-complete — self-contained computation, no external lean
2 · Provenance
Documented theorem re-derived by exhaustive computation (humanityNovel=false); first-in-this-registry is the only sense of discovered.
Acknowledgment
"no-deleting theorem (from no-cloning)" is a re-derivation, acknowledged to documented mathematics — the original proof is the prior art this re-derivation acknowledges; not new to humanity — the contribution is the reproducible computation discoveredTheoremsWaveFortySix.
- Prior art
- documented mathematics — the original proof is the prior art this re-derivation acknowledges
- Novelty
- not new to humanity — a re-derivation (humanityNovel = false)
- Contribution
- a reproducible computation (discoveredTheoremsWaveFortySix @ src/thunder/verify) that re-derives the result at zero tokens — the contribution is the verifiable recomputation, NOT the theorem
3 · Reproducibility
Recompute from source: npm run theorems:verify recomputes discoveredTheoremsWaveFortySix (src/thunder/verify/index.ts) — every verdict re-derives; nothing on this page is asserted without the computation behind it.