AFTD Auto-Formalizing Theoretical Domains

RCLike.normSq_eq_conj_mul_self

theoremverifiedformalizationimported Lean

RCLike.normSq_eq_conj_mul_self

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Matrix Matrix.PosSemidef in
open BigOperators in
variable {n π•œ : Type*} in
variable [RCLike π•œ] [DecidableEq n] in
open scoped ComplexOrder MatrixOrder in
open Kronecker in
open scoped ComplexOrder in
variable {m n π•œ : Type*} in
variable [Fintype m] [Fintype n] in
variable [RCLike π•œ] [dn : DecidableEq n] in
variable {A : Matrix m m π•œ} {B : Matrix m m π•œ} in
variable (hA : A.PosSemidef) (hB : B.PosSemidef) in
open ComplexConjugate in
theorem RCLike.normSq_eq_conj_mul_self {z : π•œ} : RCLike.normSq z = conj z * z
Formalizes
QuantumInfo, `RCLike.normSq_eq_conj_mul_self`
Lean proof
By Alex Meiburg, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2025 Alex Meiburg. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.
Verified
17 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 3

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Matrix Matrix.PosSemidef in
open BigOperators in
variable {n π•œ : Type*} in
variable [RCLike π•œ] [DecidableEq n] in
open scoped ComplexOrder MatrixOrder in
open Kronecker in
open scoped ComplexOrder in
variable {m n π•œ : Type*} in
variable [Fintype m] [Fintype n] in
variable [RCLike π•œ] [dn : DecidableEq n] in
variable {A : Matrix m m π•œ} {B : Matrix m m π•œ} in
variable (hA : A.PosSemidef) (hB : B.PosSemidef) in
open ComplexConjugate in
theorem RCLike.normSq_eq_conj_mul_self {z : π•œ} : RCLike.normSq z = conj z * z := by
  rw [RCLike.ext_iff]
  simp [RCLike.normSq]
  ring_nf

--PR
See it in the graphDiscuss this resultChallenge it