is_positive_linear_map_id
The identity linear map on d × d complex matrices is positive.
Statement
theorem is_positive_linear_map_id (d : ℕ) : is_positive_linear_map d LinearMap.id- Source
- folklore
- Verified
- 01 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- is_positive_linear_mapA linear map Φ on d × d complex matrices is positive if it maps every positive semidefinite matrix to a positive semidefinite matrix.
Read back from the Lean
For every natural number d, the identity linear map on d × d complex matrices is a positive linear map: for every d × d complex matrix X, if X is positive semidefinite, then (LinearMap.id) X is positive semidefinite.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
By definition, a linear map $\Phi$ on $d \times d$ complex matrices is positive if it sends every positive semidefinite matrix to a positive semidefinite matrix. For the identity map $\Phi = \mathrm{LinearMap.id}$, the output on any matrix $X$ is definitionally $X$ itself. Therefore, the implication $X \ge 0 \implies \mathrm{LinearMap.id}(X) \ge 0$ is the trivial implication $X \ge 0 \implies X \ge 0$, which holds by identity.
The identity linear map on $d \times d$ complex matrices is positive, meaning that it maps positive semidefinite matrices to positive semidefinite matrices.
By definition of `is_positive_linear_map`, we must show that for any matrix $X$, if $X$ is positive semidefinite, then $\mathrm{LinearMap.id}(X)$ is positive semidefinite. We introduce $X$ and the hypothesis $h$ that $X$ is positive semidefinite. Because $\mathrm{LinearMap.id}(X)$ reduces definitionally to $X$, the hypothesis $h$ already has type $(\mathrm{LinearMap.id}(X))\text{.PosSemidef}$, so returning $h$ completes the proof.
uses
LinearMap.idtheorem is_positive_linear_map_id (d : ℕ) : is_positive_linear_map d LinearMap.id := fun _ h => h
LinearMap.id- The identity linear map on a module, sending every element to itself.
- The proof relies on the definitional equality $\mathrm{LinearMap.id}(X) = X$, so any proof of $X\text{.PosSemidef}$ is definitionally also a proof of $(\mathrm{LinearMap.id}(X))\text{.PosSemidef}$ without requiring an explicit rewrite.
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
/-- The identity map on d × d complex matrices is a positive linear map. -/theorem is_positive_linear_map_id (d : ℕ) : is_positive_linear_map d LinearMap.id := fun _ h => h