Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Qutrit APPT attaining states

Abstract

Explicit rank-one and projector perturbations attain the two candidate qutrit APPT purities.

APPT is definitionally equal to Bipartite.APPT over the same finite local types and their Fintype and DecidableEq instances. Both predicates require partial-transpose positivity after every global unitary, including on empty systems.

Definition 1.1 (Rank-one perturbation).

Formalization. D5/S3/Quantum/Entanglement/AbsolutePPT/QutritPerturbationAttainment.rhoPure (✓ std3).

Source. Repository-derived.

Commentary.

The scalar coefficient is Complex.ofReal of a real quotient. The numeral one is the identity Matrix. The vector is indexed by Fin 3 × Fin n and star acts pointwise.

Definition 1.2 (Projector perturbation).

Formalization. D5/S3/Quantum/Entanglement/AbsolutePPT/QutritPerturbationAttainment.rhoProjector (✓ std3).

Source. Repository-derived.

Commentary.

The scalar is Complex.ofReal of the real quotient 1/(4n). This definition does not itself assume that P is an orthogonal projector.

Theorem 1.3 (Conjugating a rank-one outer product).

Proof. Machine-checked in Lean as D5/S3/Quantum/Entanglement/AbsolutePPT/QutritPerturbationAttainment.conjugate_outer (✓ std3). ∎

Source. Repository-derived.

Commentary.

This dimension-independent identity is extracted from the original attainment proof. It identifies conjugation by an arbitrary square matrix with applying that matrix to the vector. The original qutrit attainment and the quadbit maximum proof reuse this same declaration.

Theorem 1.4 (A unitary preserves vector normalization).

Proof. Machine-checked in Lean as D5/S3/Quantum/Entanglement/AbsolutePPT/QutritPerturbationAttainment.unitary_vector_norm (✓ std3). ∎

Source. Repository-derived.

Commentary.

The complex dot product of the pointwise conjugate vector with the vector equals one. Coercion from unitaryGroup gives its matrix. This previously local helper is shared by the qutrit and quadbit attainment proofs.

Theorem 1.5 (A normalized outer product is idempotent).

Proof. Machine-checked in Lean as D5/S3/Quantum/Entanglement/AbsolutePPT/QutritPerturbationAttainment.pure_outer_square (✓ std3). ∎

Source. Repository-derived.

Commentary.

A normalized complex vector determines an idempotent rank-one outer product on any finite index type. This is the original local proof exposed for reuse in the quadbit purity computation.

Theorem 1.6 (Normalized-vector attainment).

Proof. Machine-checked in Lean as D5/S3/Quantum/Entanglement/AbsolutePPT/QutritPerturbationAttainment.pure_attainment (✓ std3). ∎

Source. Repository-derived.

Commentary.

The normalization hypothesis is a complex equality. An explicit antisymmetric Gram complement makes the partial transpose positive under every global unitary; the normalized perturbation is positive, has trace one, and has the displayed complex trace-square.

Theorem 1.7 (Rank-n projector attainment).

Proof. Machine-checked in Lean as D5/S3/Quantum/Entanglement/AbsolutePPT/QutritPerturbationAttainment.projector_attainment (✓ std3). ∎

Source. Repository-derived.

Commentary.

For positive n, a Hermitian idempotent of rank n produces a density matrix of purity 3/(8n). The proof constructs a positive qutrit Kraus decomposition after conjugation and takes the full transpose to obtain the second-factor convention.

References