Could you give me a "working" definition of each term and an example of how they are used if possible.

Terms:
- Image
- Mapping
- Range
- Codomain
- Domain
- Surjective
- Injective
- Bijective
- One to one.

Solution Preview

1. Mapping
A mapping (also called a function) is a relation between a set of inputs X to a set of outputs Y. There is a restriction that each value of X gets mapped to only one value of Y.
We might write f: X -> Y to denote a mapping from X (the domain) to Y (the codomain).

For example, let X = {1, 2, 3} and Y={3, 6, 9}, and define a relation f(x) = 3*x. Then, f is a valid mapping. An equally valid mapping is defined by: h(1) = 6, h(2) = -1, h(3) = 10.

If instead we have a relation g: {1, 2, 3} -> {1, 4, 6, 7}, which simultaneously maps g(2) = 4 and g(2) = 6 (and keeps g(1) = 1, g(3) = 7), then g is not a valid mapping.

X and Y can also be continuous. For example, let X be the entire real line. Then let k(x) = 3*x, as before, in which case Y would also be the entire real line.

2. Image
The image of a mapping is the set of outputs Y that can be obtained from applying the mapping to the set of inputs X. In the above ...

Solution Summary

The solution describes discrete mathematical definitions.

... detailed steps on some questions about discrete math. All formula and calculations are shown and explained. 1. Note the contrapositive of the definition of one ...

Please help with the following problem regarding discrete math. ... First of all, I would like to give a definition of "equivalence relation": A given binary ...

... well-defined as a consequence of mathematical induction ... 1 and then successively applies the definition to find ... A sequence is a discrete structure used to define ...

...Discrete mathematics and functions are examined in the solution. 1. Let f be any function from R to R. Define a relation Rf by the rule: x Rf y if and only if f ...

...Discrete Math/relations. ... Solution. Let R be the relation defined on B. By the definition, we know that. ∅ R ∅ , as | ∅ |= 0 (Note: ∅ is the empty set). ...

Discrete math. SECTION 10.5. 16. ... By the definition, s G t iff the number of 0's in s is greater than the number of 0's in t. So <br> (1) It is not reflexive, ie. ...

... Although recursive procedures are simple and close to mathematical definitions, they pose real problems when implemented in computers ...Discrete Mathematics. ...

Discrete math questions on relations and functions. ... 2. What sort of relation is friendship, using the human or sociological meaning of the word? ...