DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for...

22
DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y) = {x A : f(x) Y}. Look at the examples and comments on pages 220, 221, and 222. Theorem 4.5.1 Let f : A B, let C and D be subsets of A, and let E and F be subsets of B. Then (a) f(C D) f(C) f(D) , (b) f(C D) = f(C) f(D) , (c) f –1 (E F) = f –1 (E) f –1 (F) , (d) f –1 (E F) = f –1 (E) f –1 (F) .

Transcript of DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for...

Page 1: DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y)

DEFINITION Let f : A B and let X A and Y B. The image (set) of X is

f(X) = {y B : y = f(x) for some x X}

and the inverse image of Y is

f –1(Y) = {x A : f(x) Y}.

Look at the examples and comments on pages 220, 221, and 222.

Theorem 4.5.1 Let f : A B, let C and D be subsets of A, and let E

and F be subsets of B. Then

(a) f(C D) f(C) f(D) ,

(b) f(C D) = f(C) f(D) ,

(c) f –1(E F) = f –1(E) f –1(F) ,

(d) f –1(E F) = f –1(E) f –1(F) .

Page 2: DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y)

Proof of (a)

Let b f(C D). Then b = f(a) for some a C D.

a C /\ a D

b f(C)

Theorem 4.5.1 Let f : A B, let C and D be subsets of A, and let E

and F be subsets of B. Then

(a) f(C D) f(C) f(D) ,

(b) f(C D) = f(C) f(D) ,

(c) f –1(E F) = f –1(E) f –1(F) ,

(d) f –1(E F) = f –1(E) f –1(F) .

___________________________

___________________________

b f(D) ___________________________

definition of C D

a C /\ b = f(a)

a D /\ b = f(a)

b f(C) f(D) ___________________________definition of f(C) f(D)

f(C D) f(C) f(D) b f(C D) b f(C) f(D)

Page 3: DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y)

Theorem 4.5.1 Let f : A B, let C and D be subsets of A, and let E

and F be subsets of B. Then

(a) f(C D) f(C) f(D) ,

(b) f(C D) = f(C) f(D) ,

(c) f –1(E F) = f –1(E) f –1(F) ,

(d) f –1(E F) = f –1(E) f –1(F) .

Proof of (b)

Let b f(C D). Then b = f(a) for some a C D.

[a C /\ b = f(a)] \/ [a D /\ b = f(a)]

[b f(C)] \/ [b f(D)]

___________________________

___________________________

b f(C) f(D) ___________________________

definition of C D

definition of image

definition of f(C) f(D)

f(C D) f(C) f(D) b f(C D) b f(C) f(D)

Page 4: DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y)

Proof of (b)

Let b f(C D). Then b = f(a) for some a C D.

[a C /\ b = f(a)] \/ [a D /\ b = f(a)]

[b f(C)] \/ [b f(D)]

___________________________

___________________________

b f(C) f(D) ___________________________

definition of C D

definition of image

definition of f(C) f(D)

f(C D) f(C) f(D) b f(C D) b f(C) f(D)

Let b f(C) f(D). Then b f(C) or b f(D).

f(C) f(D) f(C D), since b f(C) f(D) b f(C D)

If b f(C), then b = f(a) for some a C C D.

If b f(D), then b = f(a) for some a D C D.

In either case, we can say b = f(a) for some a _________ .C D

Since f(C D) f(C) f(D) and f(C) f(D) f(C D), we have f(C D) = f(C) f(D).

Page 5: DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y)

Theorem 4.5.1 Let f : A B, let C and D be subsets of A, and let E

and F be subsets of B. Then

(a) f(C D) f(C) f(D) ,

(b) f(C D) = f(C) f(D) ,

(c) f –1(E F) = f –1(E) f –1(F) ,

(d) f –1(E F) = f –1(E) f –1(F) .Proof of (c)a f –1(E F)f(a) E F

___________________________definition of inverse image

f(a) E /\ f(a) F

___________________________definition of intersection

a f –1(E) /\ a f –1(F)

___________________________definition of inverse image

a f –1(E) f –1(F)

___________________________definition of intersection

Page 6: DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y)

Theorem 4.5.1 Let f : A B, let C and D be subsets of A, and let E

and F be subsets of B. Then

(a) f(C D) f(C) f(D) ,

(b) f(C D) = f(C) f(D) ,

(c) f –1(E F) = f –1(E) f –1(F) ,

(d) f –1(E F) = f –1(E) f –1(F) .Proof of (d)a f –1(E F)f(a) E F

___________________________definition of inverse image

f(a) E \/ f(a) F

___________________________definition of union

a f –1(E) \/ a f –1(F)

___________________________definition of inverse image

a f –1(E) f –1(F)

___________________________definition of union

Page 7: DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y)

1 (b)

Exercises 4.5 (pages 223-225)

Page 8: DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y)

2 (b)

Page 9: DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y)

2 (d)

Page 10: DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y)

(e)

Page 11: DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y)

2 (f)

Page 12: DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y)

3 (a)

Page 13: DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y)

3 (b)

Page 14: DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y)

(c)

Page 15: DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y)

3 (d)

Page 16: DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y)

(e)

Page 17: DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y)

3 (f)

Page 18: DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y)

4 (a)

Page 19: DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y)

4 (d)

Page 20: DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y)

(e)

Page 21: DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y)

4 (f)

Page 22: DEFINITION Let f : A B and let X A and Y B. The image (set) of X is f(X) = {y B : y = f(x) for some x X} and the inverse image of Y is f –1 (Y)

6


Basics: Digital Logic. F(x,y) = x.y F(x,y) = x.y + x'.y'

Basics: Digital Logic. F(x,y) = x.y F(x,y) = x.y + x'.y'

Differential Equations€¦ · 9.5.2 (Homogenous differential equations) x y F 1 (x, y) = y2 + 2xy, F 2 (x, y) = 2x – 3y, F 3 (x, y) = cos y x 4, F (x, y) = sin x + cos y x y x

Differential Equations€¦ · 9.5.2 (Homogenous differential equations) x y F 1 (x, y) = y2 + 2xy, F 2 (x, y) = 2x – 3y, F 3 (x, y) = cos y x 4, F (x, y) = sin x + cos y x y x

Exercícios...f 2 f 1 f 0 y 0 x 1 1 f 3 f 2 f 1 f 0 f 1 f 2 f 3 y x 1 1 2.8 Exercícios y 0 y 0 y 0 y 0 x x xx (a) (b) (c) (d) I II III IV y 0 0 y 0 x x y 0 x x; É necessário usar

Exercícios...f 2 f 1 f 0 y 0 x 1 1 f 3 f 2 f 1 f 0 f 1 f 2 f 3 y x 1 1 2.8 Exercícios y 0 y 0 y 0 y 0 x x xx (a) (b) (c) (d) I II III IV y 0 0 y 0 x x y 0 x x; É necessário usar

ECONOMICS 1. f X S Y f Y f M X

ECONOMICS 1. f X S Y f Y f M X

matematika13hana.files.wordpress.com€¦  · Web viewDefinisi turunan : Fungsi f : x → y atau y = f (x) mempunyai turunan yang dinotasikan y’ = f’(x) atau dan di definisikan

matematika13hana.files.wordpress.com€¦  · Web viewDefinisi turunan : Fungsi f : x → y atau y = f (x) mempunyai turunan yang dinotasikan y’ = f’(x) atau dan di definisikan

(2,5) (-4,3) (-7,-7) (1,-3) x y y = mx + b y = ax 2 + bx + c f(x) = sin x g(x) = e x f(x) = ln (x+5)

(2,5) (-4,3) (-7,-7) (1,-3) x y y = mx + b y = ax 2 + bx + c f(x) = sin x g(x) = e x f(x) = ln (x+5)

(1.1) Tf(x) = PV f k(x-y)f(y)dy (xeS?) - AMS

(1.1) Tf(x) = PV f k(x-y)f(y)dy (xeS?) - AMS

xy x f x y x y f x y) is a valid joint pmf/pdf. jzflniddy

xy x f x y x y f x y) is a valid joint pmf/pdf. jzflniddy

#include void main() { float x = 1.66, y = 1.75; printf(%f%f,ceil(x), floor(y)); }

#include void main() { float x = 1.66, y = 1.75; printf(%f%f,ceil(x), floor(y)); }

POINTS DE CONTINUITÉ D'UNE FONCTION ......POINTS DE CONTINUITÉ 169 définie par x —> f(x, ). On pose f(x,y) — (f(x))(y); c'est une application continue en x pour tout y G Y.

POINTS DE CONTINUITÉ D'UNE FONCTION ......POINTS DE CONTINUITÉ 169 définie par x —> f(x, ). On pose f(x,y) — (f(x))(y); c'est une application continue en x pour tout y G Y.

Cadenas de Markov y Teoría de Colas - materias.fi.uba.armaterias.fi.uba.ar/6615/Material/markov.pdf · n m m k k m n m k n k m f x x f x x f x f x x f x x f x f x f x x x f x x x

Cadenas de Markov y Teoría de Colas - materias.fi.uba.armaterias.fi.uba.ar/6615/Material/markov.pdf · n m m k k m n m k n k m f x x f x x f x f x x f x x f x f x f x x x f x x x

4 ) ; y x dz x x zdx 4 ln ; 2 ; zdy z e t y 4 1 y dtmaimo.elit.sumdu.edu.ua/images/stories/docs/5chazt_poh.pdfx y y F M F x y x F Рівняння дотичної площини таке:

4 ) ; y x dz x x zdx 4 ln ; 2 ; zdy z e t y 4 1 y dtmaimo.elit.sumdu.edu.ua/images/stories/docs/5chazt_poh.pdfx y y F M F x y x F Рівняння дотичної площини таке:

DERIVATIVES 3. Summary f(x) ≈ f(a) + f’(a)(x – a) L(x) = f(a) + f’(a)(x – a) ∆y = f(x + ∆x) – f(x) dx = ∆x dy = f’(x)dx ∆ y≈ dy.

DERIVATIVES 3. Summary f(x) ≈ f(a) + f’(a)(x – a) L(x) = f(a) + f’(a)(x – a) ∆y = f(x + ∆x) – f(x) dx = ∆x dy = f’(x)dx ∆ y≈ dy.

Functions and graphs 2D...Functions and graphs 2D 1 a i y ∈ ii Let y = f(x) y = 2x 3+ 3 3 2 y x − = (f−1(x) = 3 2 x− iii The domain of f−1(x) is x∈ 1The range of f−(x)

Functions and graphs 2D...Functions and graphs 2D 1 a i y ∈ ii Let y = f(x) y = 2x 3+ 3 3 2 y x − = (f−1(x) = 3 2 x− iii The domain of f−1(x) is x∈ 1The range of f−(x)

Função IDÉIA INTUITIVA DE FUNÇÃO - wiki.ifsc.edu.br§ao_1.pdf · ... A → B e f: B → C. Definimos a composta de f com g e denotamos por f o g ... x x y f x y x y a f x x 6

Função IDÉIA INTUITIVA DE FUNÇÃO - wiki.ifsc.edu.br§ao_1.pdf · ... A → B e f: B → C. Definimos a composta de f com g e denotamos por f o g ... x x y f x y x y a f x x 6

f ( )y y y yn x - TAU

f ( )y y y yn x - TAU

(A) f x) = 0 (B) f x) = x3 +2 (C) f x) = 1 (D) y x) = x 5 ...

(A) f x) = 0 (B) f x) = x3 +2 (C) f x) = 1 (D) y x) = x 5 ...

MATEMÁTICA - qcon-assets-production.s3.amazonaws.com · crescente. y y 2 y 1 x 1 x 2 x . Funções Função Decrescente Seja f A B, onde x 2 > x 1 f(x 2) < f(x 1) é definida

MATEMÁTICA - qcon-assets-production.s3.amazonaws.com · crescente. y y 2 y 1 x 1 x 2 x . Funções Função Decrescente Seja f A B, onde x 2 > x 1 f(x 2) < f(x 1) é definida

F (x, y) =

F (x, y) =

((Lec 1) Advanced Boolean Algebra) Advanced Boolean Algebracourse.ece.cmu.edu/~ee760/760docs/lec01.pdf · 2001. 8. 30. · F(x=1) = y • F(x=1, y=1) + y ’ • F(x=1,y=0) F(x=0)

((Lec 1) Advanced Boolean Algebra) Advanced Boolean Algebracourse.ece.cmu.edu/~ee760/760docs/lec01.pdf · 2001. 8. 30. · F(x=1) = y • F(x=1, y=1) + y ’ • F(x=1,y=0) F(x=0)