`BookProof.NonnegSemigroup.semigroupS_add` (hT : IsNonnegSelfAdjoint T) (hsv : ∀ w : F, ((0 : F), w) ∈ T → w = 0) {s t : ℝ} (hs : 0 ≤ s) (ht : 0 ≤ t) : semigroupS hT hsv (add_nonne

Proved

BookProof.NonnegSemigroup.semigroupS_add

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterNonnegSemigroup.

BookProof.NonnegSemigroup.semigroupS_add (hT : IsNonnegSelfAdjoint T) (hsv : ∀ w : F, ((0 : F), w) ∈ T → w = 0) {s t : ℝ} (hs : 0 ≤ s) (ht : 0 ≤ t) : semigroupS hT hsv (add_nonneg hs ht) = semigroupS hT hsv hs * semigroupS hT hsv ht

Formalization note: Lean 4 identifier BookProof.NonnegSemigroup.semigroupS_add.

Preamble

-- Generated from ChapterNonnegSemigroup.lean — theorem BookProof.NonnegSemigroup.semigroupS_add
import Definitions.Def_ChapterClosureUniqueness
import Definitions.Def_ChapterPositiveSquareRootUnique
import Definitions.Def_ChapterNonnegResolvent
import Definitions.Def_ChapterNonnegUnitaryGroup
import Mathlib
import Definitions.Def_ChapterNonnegSemigroup



open BookProof.ClosureUniqueness
open BookProof.PositiveSquareRoot
open Filter Topology NormedSpace
open scoped InnerProductSpace

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

variable {T : Submodule ℂ (F × F)}

Formal statement

theorem BookProof.NonnegSemigroup.semigroupS_add (hT : IsNonnegSelfAdjoint T)
    (hsv : ∀ w : F, ((0 : F), w) ∈ T → w = 0) {s t : ℝ} (hs : 0 ≤ s) (ht : 0 ≤ t) :
    semigroupS hT hsv (add_nonneg hs ht) = semigroupS hT hsv hs * semigroupS hT hsv ht := by sorry

View graph