Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equations 2.1.27–2.1.28 — Hermitian dilation identities

Proved
TroppMatrixConcentration.dilation_identities

by tc · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

matrix-concentrationrandom-matrices

Let AAA be a complex m×nm\times nm×n matrix, with m,n≥1m,n\ge1m,n≥1, and set H(A)=(0AA∗0)H(A)=\begin{pmatrix}0&A\\A^*&0\end{pmatrix}H(A)=(0A∗​A0​). Then H(A)H(A)H(A) is Hermitian and

H(A)2=(AA∗00A∗A),λmax⁡(H(A))=∥H(A)∥=∥A∥.H(A)^2=\begin{pmatrix}AA^*&0\\0&A^*A\end{pmatrix},\qquad \lambda_{\max}(H(A))=\|H(A)\|=\|A\|.H(A)2=(AA∗0​0A∗A​),λmax​(H(A))=∥H(A)∥=∥A∥.

Here all norms are spectral norms. The identities relate rectangular matrices to a Hermitian matrix of dimension m+nm+nm+n.

Preamble
import Definitions.Def_TroppMatrixConcentration_probability
import Definitions.Def_TroppMatrixConcentration_dilation
import Mathlib.Analysis.Convex.Function

open MeasureTheory ProbabilityTheory
open scoped Matrix.Norms.L2Operator

Formal statement
namespace TroppMatrixConcentration

theorem dilation_identities {m n : ℕ} [NeZero m] [NeZero n]
    (A : Matrix (Fin m) (Fin n) ℂ) :
    (dilation A).IsHermitian ∧
    (dilation A) ^ 2 = Matrix.fromBlocks (A * A.conjTranspose) 0 0
      (A.conjTranspose * A) ∧
    lambdaMax (dilation A) = spectralNorm (dilation A) ∧
    spectralNorm (dilation A) = spectralNorm A := by sorry

end TroppMatrixConcentration
Source
Joel A. Tropp, An Introduction to Matrix Concentration Inequalities, arXiv:1501.01571v1 (7 January 2015); https://arxiv.org/abs/1501.01571v1; Definition 2.1.5 and equations (2.1.27–28), printed pp. 24–25.
Read-back

What the Lean code literally says, in plain math · gpt-6

For every pair of positive natural numbers m,nm,nm,n and every complex m×nm\times nm×n matrix AAA, let A∗A^*A∗ denote its conjugate transpose and let D(A)=(0AA∗0)D(A)=\begin{pmatrix}0&A\\A^*&0\end{pmatrix}D(A)=(0A∗​A0​), a square matrix whose rows and columns are indexed by the disjoint union of the mmm row indices and the nnn column indices. Let ∥B∥2\|B\|_2∥B∥2​ denote the operator norm of a complex matrix BBB between the corresponding Euclidean spaces, and define λmax⁡(B)=sup⁡σR(B)\lambda_{\max}(B)=\sup\sigma_{\mathbb R}(B)λmax​(B)=supσR​(B), where σR(B)={r∈R:rI−B is not invertible}\sigma_{\mathbb R}(B)=\{r\in\mathbb R:rI-B\text{ is not invertible}\}σR​(B)={r∈R:rI−B is not invertible} is the spectrum with real scalars and the supremum is taken in R\mathbb RR. Then all four assertions hold simultaneously: D(A)∗=D(A)D(A)^*=D(A)D(A)∗=D(A); D(A)2=(AA∗00A∗A)D(A)^2=\begin{pmatrix}AA^*&0\\0&A^*A\end{pmatrix}D(A)2=(AA∗0​0A∗A​); λmax⁡(D(A))=∥D(A)∥2\lambda_{\max}(D(A))=\|D(A)\|_2λmax​(D(A))=∥D(A)∥2​; and ∥D(A)∥2=∥A∥2\|D(A)\|_2=\|A\|_2∥D(A)∥2​=∥A∥2​. No nonzero or rank hypothesis is imposed on AAA, so the assertions include the zero matrix and rank-deficient matrices; dimensions m=0m=0m=0 or n=0n=0n=0 are excluded.

Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by tc · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me