Professional Documents
Culture Documents
5.1. Definition
A function f : A → ℝm , where A ⊆ ℝ is called vector function of a real variable.
Examples:
n
A function f : A → ℝ , where A ⊆ ℝ is called a real valued function of several variables.
Examples:
Examples:
Let A ⊆ ℝn , f : A → ℝm .
We define the functions f 1 , ..., f m : A → ℝ as follows:
given x ∈ A such that f (x) = ( y 1 , … , y m ) ∈ ℝm we put f 1 (x) := y m , ..., f m (x) := y m
The functions f 1 , ..., f m defined as above are called the scalar components of the vector
function f .
It can be easily seen that f can have at most one limit at a . If this limit exists,then we write
lim f (x) = b .
x→a
5.4 Theorem
n n
Let A ⊆ ℝ , let a ∊ A , f = (f 1 , ..., f m ) : A → ℝ and let b = ( b1 , …, bn ) ∈, then:
lim f (x) = b ⇔ ∀ i ε{1, ...m} : lim f i (x) = bi
x→a x→a
6.1.Definition
Let A ⊆ ℝn ,let a ∊ A , let f : A → ℝm .
The function f is said to be continuous at a if:
∀ 𝜀 >0, ∃ δ >0 such that ∀ x ∊ A with || f ( x )- f ( a ) || < δ we have || f ( x )- f ( a ) || < 𝜀
Remark!
If a is an isolated point of A ⇒ f is continuous at a
6.3 Theorem
Let A ⊆ ℝn , let f : A → ℝm a function and let a ∊ A ⋂ A ’. Then:
f is continuous at a ⇔ lim f (x) = f (a) .
x→a
6.4 Theorem
Let A ⊆ ℝn , let a ∊ A and let f = (f 1 , ..., f m ) : A → ℝm .Then:
f is continuous at a ⇔ ∀ i ε{1, ...m} , the function f i : A → ℝ is continuous at a .
6.5 Theorem
n m m
If A ⊆ ℝ is a compact set and f : A → ℝ is continuous on A , then f (A) is compact in ℝ .
6.6 Theorem (K. Weierstrass)
A continuous real valued function defined on a compact set is bounded and attains its bounds on
that set.
.
n
CHAPTER 2. Differential calculus in ℝ
1.1. Definition
n m
A function φ: ℝ → ℝ is called a linear mapping if:
n
∀ α, β ∈ ℝ, ∀ x , y ∈ ℝ : φ(α x +β y ) = αφ( x )+βφ( y )
n m n m
L( ℝ , ℝ ):={φ: ℝ → ℝ | φ is a linear mapping}
n m
If φ ∈ L( ℝ , ℝ ) then:
, φ ( 0n ) = 0m ;
, φ (- x ) = -φ( x );
n
, ∀ k ∈ ℕ, ∀ x1 ,…, xk ∈ ℝ , ∀ α1 ,..., αk ∈ ℝ :
φ( α1 x1 + … + αk xk ) = α1 φ( x1 )+ … + αk φ( xk )
1.2. Theorem
A function φ: ℝn → ℝm is a linear mapping
⇔ ∃ b1 , …, bn ∈ ℝm s.t. ∀ x1 ,…, xn ∈ ℝn : φ(x) = x1 b1 + xn bn
1.3. Corollary
A function φ: ℝn → ℝm is a linear mapping
⇔ ∃ b ∈ ℝn s.t. φ( x ) = < x , b >, ∀ x ∈ ℝn