`BookProof.ReducedEsa.isReducingProjection_asymProj` (hU2 : ∀ x, U (U x) = x) (hUi : ∀ x y : F, (inner ℂ (U x) (U y) : ℂ) = inner ℂ x y) : IsReducingProjection (asymProj U) where i

Proved

BookProof.ReducedEsa.isReducingProjection_asymProj

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterReducingSubspaceEsa.

BookProof.ReducedEsa.isReducingProjection_asymProj (hU2 : ∀ x, U (U x) = x) (hUi : ∀ x y : F, (inner ℂ (U x) (U y) : ℂ) = inner ℂ x y) : IsReducingProjection (asymProj U) where idem x

Formalization note: Lean 4 identifier BookProof.ReducedEsa.isReducingProjection_asymProj.

Preamble

-- Generated from ChapterReducingSubspaceEsa.lean — theorem BookProof.ReducedEsa.isReducingProjection_asymProj
import Definitions.Def_ChapterFarisLavine
import Definitions.Def_ChapterGraphCoreTransfer
import Mathlib
import Definitions.Def_ChapterReducingSubspaceEsa
open BookProof.ReducedEsa



open BookProof.FarisLavine BookProof.GraphCore

noncomputable section

variable {F : Type*} [NormedAddCommGroup F] [InnerProductSpace ℂ F]

variable {P : F →ₗ[ℂ] F}
variable {D : Submodule ℂ F}
variable (T : D →ₗ[ℂ] F)
variable {T}
variable (U : F →ₗ[ℂ] F)
variable {U}

Formal statement

theorem BookProof.ReducedEsa.isReducingProjection_asymProj (hU2 : ∀ x, U (U x) = x)
    (hUi : ∀ x y : F, (inner ℂ (U x) (U y) : ℂ) = inner ℂ x y) :
    IsReducingProjection (asymProj U) := by sorry

View graph