Wilde: Quantum Information Theory Lean Blueprint
Lean 4.33.1 Mathlib 4.33.0 0 sorrys 3 Classical Axioms

Wilde: Quantum Information Theory (Whole Book)

A machine-checked formalization of all 28 chapters of Mark M. Wilde's Quantum Information Theory (Cambridge University Press). Featuring client-side Graphviz WebAssembly and the Axiomatic-DRE 360° phylogenetic tree framework to explore proof lineage from classical Shannon foundations to the quantum capacity theorems.

✨ Book Evolution & Index → Launch Whole-Book Radial Tree → ⚑ Axiomatic Lineage & Quantum Axioms → Browse All 28 Chapters → Graphviz (WASM) Explorer →

Book-Scale Formalization Metrics

28
Chapters Formalized
2,181
Formal Definitions & Items
784
Lean Source Modules
0
Sorrys in Core Theory

The 6 Parts of the Treatise

Part I: Concepts & Classical Shannon Theory (Ch. 1–2)

Classical entropy, asymptotic equipartition property (AEP), Shannon source coding theorem, channel capacity, and Fano's inequality.

Explore Ch. 2 in Radial Tree →

Part II: The Postulates of Quantum Mechanics (Ch. 3–5)

State space, density matrices, composite systems, observables, completely positive trace-preserving (CPTP) maps, Kraus operators, and Uhlmann's theorem.

Explore Ch. 4 in Radial Tree →

Part III: Protocols & Distance Measures (Ch. 6–9)

Teleportation, super-dense coding, coherent protocols, unit resource capacity region, trace distance contractivity, and fidelity.

Explore Ch. 9 in Radial Tree →

Part IV: Quantum Entropies & Information (Ch. 10–13)

von Neumann entropy, Strong Subadditivity (Lieb-Ruskai), Lieb concavity theorem, quantum data processing, and Theorem 13.4.2 (Mutual Info Concavity).

Explore Ch. 11 in Radial Tree →

Part V: Typicality & Data Compression (Ch. 14–18)

Classical and quantum typicality, the non-commutative operator packing lemma, quantum covering lemma, and Schumacher compression.

Explore Ch. 15 in Radial Tree →

Part VI: Channel Capacities & Coding Theorems (Ch. 19–28)

The grand capacity theorems: Holevo-Schumacher-Westmoreland (HSW), BSST entanglement-assisted capacity, private capacity, and the Lloyd-Shor-Devetak (LSD) theorem.

Explore Ch. 24 in Radial Tree →

Axiomatic Foundations & Quantum Postulate Tracing

● 4 Physical Quantum Postulates

State space (\( ho \ge 0, \operatorname{Tr} ho=1\)), observables (POVM Born rule), composite systems (\mathcal{H}_A \otimes \mathcal{H}_B), and unitary/CPTP channel evolution.

Inspect Postulates →

● Mathlib Operator Bedrock

The continuous Spectral Theorem for Hermitian operators, cyclic trace invariance, Jensen's inequality, and logarithm calculus at zero (0 \log 0 = 0).

Inspect Mathlib Pillars →

● 3 Lean 4 Kernel Axioms

Classical.choice, propext, and Quot.sound. No unproved hypotheses, zero circularity, and verified 0 sorrys.

View Full Lineage Matrix →

Landmark Capacity Theorem: LSD Quantum Capacity (Theorem 24.3)

Lloyd-Shor-Devetak (LSD) Quantum Capacity:

Q(\mathcal{N}) = \lim_{n \to \infty} \frac{1}{n} \max_{\rho} I(A \rangle B)_{\mathcal{N}^{\otimes n}(\rho)}

The quantum channel capacity $Q(\mathcal{N})$ for transmitting uncorrupted qubits without error equals the regularized coherent information $I(A \rangle B) = H(B) - H(E)$ of the channel.

Inspect in Graphviz WASM → Inspect in Radial Tree →