Homework Solution: For each assertion in 7(a)-(c), prove the assertion directly from the definition of the big-O asymptotic n…

    7. For each assertion in 7(a)-(c), prove the assertion directly from the definition of the big-O asymptotic notation if it is true by finding values for the constants c and no. On the other hand, if the assertion is false, give a counter-example. Then answer the question in 7(d) F denotes the set of all functions from Z+ to R+ (a) Let f(n) : Z+ → R+. DEFINITION 1. A relation on a set is reflexive if each element is related to itself. Assertion: The relation is big-O of is reflexive over F, In other words, f(n) e O(f(n)). [5 points] (b) Let f(n) : Z+ → R+ and g(n): Z+ → R+. DEFINITION 2. A relation on a set is antisymmetric if whenever an element X is related to an element Y and Y is related X, then X-Y. Assertion: The relation is big-O of is antisymmetric over F. In other words, if f(n) 0(g(n) and g(nje 0(f(n)), then f(n) = g(n). [5 points] (c) Let e(n) : Z+ → R+, f(n) : Z+ → R+ and g(n) : Z+ → R+. DEFINITION 3. A relation on a set is transitive if whenever an element X is related to Y and Y is related Z, then X is related to Z. Assertion: The relation is big-O o is transitive over F. In other words, if e(n) E O(f(n)) and f(n) E O(g(n)), then e(n) E O(g(n)). [5 points] (d) Is is big-O of a partial order on F? [5 points] DEFINITION 4. A relation is a partial order on a set if it is reflexive, antisymmetric and transitive.
    For each assertion in 7(a)-(c), prove the assertion directly from the definition of the big-O asymptotic notation if it is true by finding values for the constants c and n_0. On the other hand, if the assertion is false, give a counter-example. Then answer the question in 7(d) F denotes the set of all functions from Z^+ to R^+. (a) Let f(n): Z^+ rightarrow R^+. DEFINITION 1. A relation on a set is reflexive if each element is related to itself. Assertion: The relation "is big-O of" is reflexive over F, In other words, f(n) elementof O(f(n)). (b) Let f(n): Z^+ rightarrow R^+ and g(n): Z^+ rightarrow R^+. DEFINITION 2. A relation on a set is antisymmetric if whenever an element X is related to an element Y and Y is related X, then X = Y. Assertion: The relation "is big-O of" is antisymmetric over F. In other words, if f(n) elementof O(g(n))and g(n) elementof O(f(n)), then f(n) = g(n). (c) Let e(n): Z^+ rightarrow R^+, f(n): Z^+ rightarrow R^+ and g(n): Z^+ rightarrow R^+. DEFINITION 3. A relation on a set is transitive if whenever an element X is related to Y and Y is related Z, then X is related to Z. Assertion: The relation "is big-O of" is transitive over F. In other words, if e(n) elementof O(f(n)) and f(n) elementof O(g(n)), then e(n) elementof O(g(n)). (d) Is "is big-O of" a partial order on F? DEFINITION 4. A relation is a partial order on a set if it is reflexive, antisymmetric and transitive.

    Expert Answer

    7. Restraint each assumption in 7(a)-(c), argue the assumption promptly from the determination of the big-O asymptotic notation if it is gentleman by decision values restraint the constants c and no. On the other agency, if the assumption is fallacious, communicate a counter-example. Then exculpation the inquiry in 7(d) F denotes the be of entire functions from Z+ to R+ (a) Let f(n) : Z+ → R+. DEFINITION 1. A reference on a be is interchangeable if each atom is kindred to itself. Assumption: The reference is big-O of is interchangeable balance F, In other say, f(n) e O(f(n)). [5 points] (b) Let f(n) : Z+ → R+ and g(n): Z+ → R+. DEFINITION 2. A reference on a be is antisymmetric if whenever an atom X is kindred to an atom Y and Y is kindred X, then X-Y. Assumption: The reference is big-O of is antisymmetric balance F. In other say, if f(n) 0(g(n) and g(nje 0(f(n)), then f(n) = g(n). [5 points] (c) Let e(n) : Z+ → R+, f(n) : Z+ → R+ and g(n) : Z+ → R+. DEFINITION 3. A reference on a be is explicit if whenever an atom X is kindred to Y and Y is kindred Z, then X is kindred to Z. Assumption: The reference is big-O o is explicit balance F. In other say, if e(n) E O(f(n)) and f(n) E O(g(n)), then e(n) E O(g(n)). [5 points] (d) Is is big-O of a local prescribe on F? [5 points] DEFINITION 4. A reference is a local prescribe on a be if it is interchangeable, antisymmetric and explicit.

    Restraint each assumption in 7(a)-(c), argue the assumption promptly from the determination of the big-O asymptotic notation if it is gentleman by decision values restraint the constants c and n_0. On the other agency, if the assumption is fallacious, communicate a counter-example. Then exculpation the inquiry in 7(d) F denotes the be of entire functions from Z^+ to R^+. (a) Let f(n): Z^+ rightarrow R^+. DEFINITION 1. A reference on a be is interchangeable if each atom is kindred to itself. Assumption: The reference “is big-O of” is interchangeable balance F, In other say, f(n) atomof O(f(n)). (b) Let f(n): Z^+ rightarrow R^+ and g(n): Z^+ rightarrow R^+. DEFINITION 2. A reference on a be is antisymmetric if whenever an atom X is kindred to an atom Y and Y is kindred X, then X = Y. Assumption: The reference “is big-O of” is antisymmetric balance F. In other say, if f(n) atomof O(g(n))and g(n) atomof O(f(n)), then f(n) = g(n). (c) Let e(n): Z^+ rightarrow R^+, f(n): Z^+ rightarrow R^+ and g(n): Z^+ rightarrow R^+. DEFINITION 3. A reference on a be is explicit if whenever an atom X is kindred to Y and Y is kindred Z, then X is kindred to Z. Assumption: The reference “is big-O of” is explicit balance F. In other say, if e(n) atomof O(f(n)) and f(n) atomof O(g(n)), then e(n) atomof O(g(n)). (d) Is “is big-O of” a local prescribe on F? DEFINITION 4. A reference is a local prescribe on a be if it is interchangeable, antisymmetric and explicit.

    Expert Exculpation