Define the set F- (XI X is a finite set of counting numbers) and the relation is a finiice sei of...
6. Given a finite set A, denote IA] as a nurnber of elements in A. Let f : X → Y be a function with |XI, Yl< oo, i.e. X, Y are finite sets. Prove the following statements a) IXIS IYİ if f is injective. b) IY1S 1X1 if f is surjective. 6. Given a finite set A, denote IA] as a nurnber of elements in A. Let f : X → Y be a function with |XI, Yl
where Problem 36. Assume f : X → [0, oo]. Prove that if Σ f(x) < 00, then {x E X (z) > 0} is a countable set. (HINT: Show that for every k E N the set {x E X | f(x) > k-1} is finite.) f(x)-sup f(x) | F is any finite subset of X TEF Problem 36. Assume f : X → [0, oo]. Prove that if Σ f(x) 0} is a countable set. (HINT: Show that...
Let X be a finite set and F a family of subsets of X such that every element of X appears in at least one subset in F. We say that a subset C of F is a set cover for X if X =U SEC S (that is, the union of the sets in C is X). The cardinality of a set cover C is the number of elements in C. (Note that an element of C is a...
Let X, be the set {x € Z|3 SXS 9} and relation M on Xz defined by: xMy – 31(x - y). (Note: Unless you are explaining “Why not,” explanations are not required.) a. Draw the directed graph of M. b. Is M reflexive? If not, why not? C. Is M symmetric? If not, why not? d. Is M antisymmetric? If not, why not? e. Is M transitive? If not, why not? f. Is M an equivalence relation, partial order...
a. A function f: A B is called injective or one-to-one if whenever f (x) f(u) for some z, y A then y. Which of the following functions are injective? In r-y. That is Vr,y E A f()-f(u) each case explain why or why not i. f:Z Z given by f(z) 3 7 ii. f which maps a QUT student number to the last name of the student with that student number. b. Suppose that we have some finite set...
For Topology!!! Match the terms and phrases below with their definitions. X and Y represents topological spaces. Note: there are more terms than definitions! Terms: compact, connected, Hausdorff, homeomorphis, quotient topology, discrete topology, indiscrete topology, open set continuous, closed set, open set, topological property, separation, open cover, finite refinement, B(1,8) 20. A collection of open subsets of X whose union equals X 20. 21. The complement of an open set 21. 22. Distinct points r and y can be separated...
specifically on finite i pmu r the number of objøcts or ways. Leave your answers in fornsiala form, such as C(3, 2) nporkan?(2) Are repeats poasib Two points each imal digits will have at least one xpeated digin? I. This is the oounting problem Al ancmher so ask yourelr (1) ls onder ipo n How many strings of four bexadeci ) A Compuir Science indtructor has a stack of blue can this i For parts c, d. and e, suppose...