A relation is a set of ordered pairs of elements, where each ordered pair indicates that there is some kind of relationship between the two elements.
A function is a special kind of relation where each element in the domain (the set of input values) corresponds to exactly one element in the range (the set of output values).
Notation:
A relation is typically denoted by a capital letter, such as R, and a specific ordered pair is written as (a, b) ∈ R, meaning "a" and "b" are related by R.
A function is typically denoted by a lowercase letter, such as f, and a specific input-output pair is written as f(x) = y, meaning that y is the output of the function f when the input is x.
The domain of a function is the set of all input values, and the range is the set of all output values.
One-to-one function (injective) is a function where no two distinct inputs have the same output.
Onto function (surjective) is a function where for every element in the range there is at least one element in the domain that maps to it.
A function that is both one-to-one and onto is called a bijective function
A function can be represented by a graph, where the domain is on the x-axis and the range is on the y-axis, and each input-output pair corresponds to a point on the graph.
The inverse of a function is a new function that "undoes" the original function, taking the outputs of the original function as inputs and the inputs of the original function as outputs.
The composition of functions is combining two or more functions to form a new function. Notation (f ∘ g)(x) = f(g(x)), which means the output of function g is passed as input to function f.
Function and relations are fundamental concepts in many areas of mathematics, including algebra, analysis, and topology.
Relations and functions have many properties that are important to understand when working with them in mathematics and other fields. Some important properties of relations and functions include:
Reflexivity: A relation R is reflexive if (a, a) ∈ R for all a in the set the relation is defined on.
Symmetry: A relation R is symmetric if (a, b) ∈ R implies (b, a) ∈ R for all a and b in the set the relation is defined on.
Transitivity: A relation R is transitive if (a, b) ∈ R and (b, c) ∈ R implies (a, c) ∈ R for all a, b, and c in the set the relation is defined on.
Injectivity: A function is injective (or one-to-one) if no two distinct inputs have the same output.
Surjectivity: A function is surjective (or onto) if for every element in the range there is at least one element in the domain that maps to it.
Bijectivity: A function is bijective if it is both injective and surjective.
Inverse: The inverse of a function is a new function that "undoes" the original function, taking the outputs of the original function as inputs and the inputs of the original function as outputs.
Composition: The composition of functions is combining two or more functions to form a new function. Notation (f ∘ g)(x) = f(g(x)), which means the output of function g is passed as input to function f.
Domain and Range: The domain of a function is the set of all input values, and the range is the set of all output values.
Graphs: A function can be represented by a graph, where the domain is on the x-axis and the range is on the y-axis, and each input-output pair corresponds to a point on the graph.
Comments
Post a Comment