AFTD Auto-Formalizing Theoretical Domains

LinearPMap.regularityDomain

defimported Lean

The regular points for T. z : ℂ is a regular point for T iff there exists a constant c > 0 such that c * ‖x‖ ≤ ‖(T - z • 1) x‖ for all x ∈ T.domain.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open LinearPMap in
variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] in
open Submodule in
open Metric in
open InnerProductSpace in
open Complex in
open ComplexConjugate in
open Set in
open Pointwise in
noncomputable def LinearPMap.regularityDomain (T : H →ₗ.[ℂ] H) : Set ℂ
Defined in
Physlib, `LinearPMap.regularityDomain`
Lean proof
By Gregory J. Loges, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2026 Gregory J. Loges. 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
10 Oct 2026
Axioms
none listed
Built on 1
  • LinearPMap.IsLowerBoundIsLowerBound T z c is the property that c * ‖x‖ ≤ ‖T x - z • x‖ for all x : T.domain.
Used by 6

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open LinearPMap in
variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] in
open Submodule in
open Metric in
open InnerProductSpace in
open Complex in
open ComplexConjugate in
open Set in
open Pointwise in
/-- The regular points for `T`. `z : ℂ` is a regular point for `T` iff there exists a constant `c > 0` such that `c * ‖x‖ ≤ ‖(T - z • 1) x‖` for all `x ∈ T.domain`. -/
noncomputable def LinearPMap.regularityDomain (T : H →ₗ.[ℂ] H) : Set ℂ := {z : ℂ | ∃ c > 0, IsLowerBound T z c}
See it in the graphDiscuss this resultChallenge it