Information No Cloning No Cloning Theorem Remark

The remark's scope

The no-cloning theorem is a core result of quantum information theory: it states that an unknown quantum state cannot be copied exactly. This is not a practical limitation but a mathematical one, following from the linearity of quantum mechanics. The declaration no_cloning_theorem_remark in the framework's machine-checked library of formal theorems is a note about the limits of a particular formal model, not a new proof of the theorem itself.

The remark states that the CloningMachine structure, a formal object that would take a state |ψ⟩ and produce a copy |ψ⟩⊗|ψ⟩, does not capture the tensor product constraint. The real no-cloning proof requires a unitary operator U such that U(|ψ⟩⊗|0⟩) = |ψ⟩⊗|ψ⟩ for all states |ψ⟩. Taking inner products with the corresponding equation for another state |φ⟩ gives ⟨ψ|φ⟩ = ⟨ψ|φ⟩². The remark notes that this fails for a concrete witness, the real number z = 1/2, since (1/2)² ≠ 1/2.

What the remark does not claim is as important as what it states. It does not prove the no-cloning theorem from scratch; it is a comment on the limitations of the CloningMachine structure as defined. The library does contain other declarations, such as no_cloning_algebraic_constraint, which proves that if z² = z then z = 0 or z = 1, and no_universal_cloning_witness_real, which provides the explicit counterexample. But the remark itself is a True := trivial statement, meaning it is a placeholder that records an observation rather than a substantive proof.

In plain terms, the remark says: the formal model of a cloning machine as defined is too weak to prove the theorem; the real proof needs the tensor product structure and the inner product argument. This is a useful clarification for anyone reading the library's code, but it does not add a new mathematical result. The no-cloning theorem itself remains a theorem of quantum mechanics, and the framework's library contains related statements about approximate cloning bounds and the impossibility of deleting states, but those are separate declarations with their own proofs.

/-- The original CloningMachine structure is too weak to derive a contradiction
    (it lacks tensor product structure and unitarity). The algebraic constraints above
    show why no-cloning holds: z² = z only for z ∈ {0, 1}, but inner products can take
    other values like 1/√2 for superposition states. -/
theorem no_cloning_theorem_remark {n : ℕ} (_hn : n ≥ 2) :
    -- The CloningMachine structure as defined doesn't capture the tensor product constraint.
    -- The real no-cloning proof requires: U(|ψ⟩⊗|0⟩) = |ψ⟩⊗|ψ⟩ for all |ψ⟩
    -- Taking inner products with U(|φ⟩⊗|0⟩) = |φ⟩⊗|φ⟩ gives ⟨ψ|φ⟩ = ⟨ψ|φ⟩²
    -- The witness theorem shows this fails for z = 1/2
    True := trivial

/-- The original CloningMachine structure is too weak to derive a contradiction
    (it lacks tensor product structure and unitarity). The algebraic constraints above
    show why no-cloning holds: z² = z only for z ∈ {0, 1}, but inner products can take
    other values like 1/√2 for superposition states. -/
theorem no_cloning_theorem_remark {n : ℕ} (_hn : n ≥ 2) :
    -- The CloningMachine structure as defined doesn't capture the tensor product constraint.
    -- The real no-cloning proof requires: U(|ψ⟩⊗|0⟩) = |ψ⟩⊗|ψ⟩ for all |ψ⟩
    -- Taking inner products with U(|φ⟩⊗|0⟩) = |φ⟩⊗|φ⟩ gives ⟨ψ|φ⟩ = ⟨ψ|φ⟩²
    -- The witness theorem shows this fails for z = 1/2
    True := trivial

/-- The original CloningMachine structure is too weak to derive a contradiction
    (it lacks tensor product structure and unitarity). The algebraic constraints above
    show why no-cloning holds: z² = z only for z ∈ {0, 1}, but inner products can take
    other values like 1/√2 for superposition states. -/
theorem no_cloning_theorem_remark {n : ℕ} (_hn : n ≥ 2) :
    -- The CloningMachine structure as defined doesn't capture the tensor product constraint.
    -- The real no-cloning proof requires: U(|ψ⟩⊗|0⟩) = |ψ⟩⊗|ψ⟩ for all |ψ⟩
    -- Taking inner products with U(|φ⟩⊗|0⟩) = |φ⟩⊗|φ⟩ gives ⟨ψ|φ⟩ = ⟨ψ|φ⟩²
    -- The witness theorem shows this fails for z = 1/2
    True := trivial

/-- **THEOREM (No-Cloning Constraint)**: Universal cloning requires all inner products
    to satisfy z² = z, forcing z ∈ {0, 1}. But superpositions have inner products
    like 1/√2 ∉ {0, 1}, so universal cloning is impossible.

    This is the algebraic core of the no-cloning theorem. The full theorem
    requires tensor product structure which is beyond this simplified model. -/
theorem no_cloning_algebraic_constraint :
    ∀ z : ℂ, z^2 = z → z = 0 ∨ z = 1 := cloning_constraint

What this page does not claim

The remark does not prove the no-cloning theorem from the ledger structure. The remark does not establish that the CloningMachine structure is the only possible formal model of cloning. The remark does not claim that the no-cloning theorem is false or incomplete in standard quantum mechanics.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Information/NoCloning.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red: