# Definition:Invertible Bounded Linear Transformation/Normed Vector Space

Jump to navigation Jump to search

## Definition

Let $\struct {V, \norm \cdot_V}$ and $\struct {U, \norm \cdot_U}$ be normed vector spaces.

Let $A : V \to U$ be a bounded linear transformation.

We say that $A$ is invertible as a bounded linear transformation if and only if:

$A$ has an inverse mapping that is a bounded linear transformation.

That is:

there exists a bounded linear transformation $B : U \to V$ such that:
$A \circ B = I_U$
$B \circ A = I_V$

where $I_U$ and $I_V$ are the identity mappings on $U$ and $V$ respectively.

We say that $B$ is the inverse of $A$ and write $B = A^{-1}$.

The process of finding an $A^{-1}$ given $A$ is called inverting.

## Notes

Note that a mapping is usually called invertible if it has an inverse mapping.

However, in the context of a bounded linear transformation, it often makes sense to insist that this inverse mapping be bounded.

Some sources therefore call a bounded linear transformation $A$ with bounded inverse invertible, while simply saying that $A$ has an inverse otherwise.

To avoid confusion, on $\mathsf{Pr} \infty \mathsf{fWiki}$ we emphasise that $A$ is invertible in the sense of a bounded linear transformation or invertible as a bounded linear transformation, if a bounded inverse is insisted.

Where boundedness of the inverse is not required, we can simply call $A$ invertible, invertible as a mapping or invertible in the sense of a mapping.
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}