logo

Expansion and Contraction of a Function 📂Functions

Expansion and Contraction of a Function

Definition1

Let’s assume that function f:XYf : X \to Y is given. Let’s also assume that UXVU \subset X \subset V holds.

Contraction Mapping

We call fUYf |_{U} \to Y a contraction mapping of ff if it satisfies the following.

fU:UYandfU(x)=f(x),xU f|_{U} : U \to Y \quad \text{and} \quad f|_{U}(x) = f (x),\quad \forall x \in U

Extension

We call f~Y\tilde{f} \to Y an extension of ff if it satisfies the following.

f~:VYandf~(x)=f(x),xX \tilde{f} : V \to Y \quad \text{and} \quad \tilde{f}(x) = f (x),\quad \forall x \in X

Explanation

Usually, instead of the translated terms contraction mapping (also known as restriction) and extension, the direct English pronunciations [restriction] and [extension] are used.

Simply put, it’s about narrowing or widening the domain of the function while keeping its shape unchanged.

According to the definition, it’s obvious that ff is a restriction of f~\tilde{f}, and an extension of fUf|_{U}.


  1. Erwin Kreyszig, Introductory Functional Analysis with Applications (1989), p99 ↩︎