Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Chapter AbelianDiagonal

Definition
ChapterAbelianDiagonal

by leonardopedro · Oct 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

definitionsformalizationtimepiece

Formal definitions for the timepiece Lean 4 formalization (source chapter BookProof/ChapterAbelianDiagonal.lean): generated def bundle for ChapterAbelianDiagonal. See BookProof/ChapterAbelianDiagonal.lean for full context.

Definition code
import Mathlib


/-!
# The finite (type `I_n`) case of the abelian von Neumann classification

`BookProof/ChapterSelectingEvents.lean` (book Chapter 13, `book.tex` ~8789–8800)
records von Neumann's classification of abelian von Neumann algebras: every one
of them is `*`-isomorphic to one of

`ℓ∞({1,…,n})`, `ℓ∞(ℕ)`, `L∞([0,1])`, `L∞([0,1] ∪ {1,…,n})`, `L∞([0,1] ∪ ℕ)`.

The full five-way classification is a deep theorem and is *not* claimed here.
What **is** proved in this file is its first case, in the concrete
finite-dimensional model `Mat(n, ℂ)`:

* `diagonalStarAlgHom` — the `*`-algebra embedding `ℓ∞({1,…,n}) = (n → ℂ) →
  Mat(n, ℂ)` given by `d ↦ diag(d)`, and `diagonalStarAlgHom_injective`;
* `diagonal_commute` — its image is abelian;
* `commutant_diagonal_eq_diagonal` — its image is **maximal** abelian: anything
  commuting with all diagonal matrices is itself diagonal;
* `vonNeumann_abelian_typeI_case` — the headline packaging: `ℓ∞({1,…,n})` is
  realized inside `Mat(n, ℂ)` as a maximal abelian self-adjoint subalgebra.

All results are `sorry`-free and `axiom`-free (only `propext`,
`Classical.choice`, `Quot.sound`).
-/

namespace BookProof.AbelianDiagonal

open Matrix

variable {n : Type*} [Fintype n] [DecidableEq n]

/-- The `*`-algebra embedding of `ℓ∞({1,…,n}) = (n → ℂ)` into `Mat(n, ℂ)`,
`d ↦ diag(d)`. -/
noncomputable def diagonalStarAlgHom : (n → ℂ) →⋆ₐ[ℂ] Matrix n n ℂ where
  toFun d := Matrix.diagonal d
  map_one' := Matrix.diagonal_one
  map_mul' d e := (Matrix.diagonal_mul_diagonal d e).symm
  map_zero' := Matrix.diagonal_zero
  map_add' d e := (Matrix.diagonal_add d e).symm
  commutes' r := by
    ext i j
    by_cases h : i = j <;> simp [h, Algebra.algebraMap_eq_smul_one]
  map_star' d := by
    simp [Matrix.star_eq_conjTranspose]













end BookProof.AbelianDiagonal
Source
https://github.com/leonardopedro/timepiece/blob/61595bc/BookProof/ChapterAbelianDiagonal.lean

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me