Detached mathematics Functions and relations

 05 September 04:17   In this article, we will yield a afterpiece attending at the antecedent abstr action of the action added carefully than you would accept ahead had acquaintance with.

    We will aswell appraise the abstr action of the relation, and backdrop these can have.

    A action is a accord amid two altered sets of numbers. We alarm this aswell a mapping. A action about maps a amount in one set to addition amount in addition set.

    We address functions as:

    : f(x)

    This action is alleged f, and it takes a capricious x. We acting some amount for x to get the additional value, which is what the action maps x to.

    Notice that if we allocution about a action it is important to accumulate in apperception that a action maps ethics to one and alone one amount only. Two ethics in one set could map to one value, but one amount haveto never map to two values: that is alleged a relation, not a function.

    

    

    

    For example, if we define

    : $f(x)=x^2$

    then we have

    : $f(-1)=1$

    : $f(1)=1$

    : $f(7)=49$

    : $f(1/2)=1/4$

    and so on. f, in this instance, maps numbers to their squares.

    If D is a set, we can say

    : $f(D)\; =$

    which forms a new set, alleged the ambit of f. D is alleged the area of f, and represents all ethics that f takes.

    In general, the ambit of f is usually a subset of a beyond set. This set is accepted as the codomain of a function. For example, with the action f(x)=cos x, the ambit of f is , but the codomain is the set of absolute numbers.

    When we accept a action f, with area D and ambit R, we write:

    :$f\; :\; D\; longrightarrow\; R$

    If we say that, for instance, x is mapped to x², we aswell can add

    :$f\; :\; D\; longrightarrow\; R;\; x\; longmapsto\; x^2$

    Notice that we can accept a action that maps a point (x,y) to a absolute number, or some additional action of two variables -- we accept a set of ordered pairs as the domain. Anamnesis from set approach that this is authentic by the Cartesian artefact - if we ambition to represent a set of all real-valued ordered pairs we can yield the Cartesian artefact of the absolute numbers with itself to obtain

    :$mathbb^2=\backslash \; y\; inmathbb\}$.

    When we accept a set of n-tuples as allotment of the domain, we say that the action is n-ary (for numbers n=1,2 we say unary, and bifold respectively).

    Functions can be accounting as above, but we can aswell address them in two additional ways. One way is to use an arrow diagram to represent the mappings amid anniversary element. We address the elements from the area on one side, and the elements from the ambit on the other, and we draw arrows to appearance that an aspect from the area is mapped to the range.

    For example, for the action f(x)=x³, the arrow diagram for the area would be:

    Another way is to use set notation. If f(x)=y, we can address the action in agreement of its mappings. This abstr action is best to appearance in an example.

    Let us yield the area D=, and f(x)=x². Then, the ambit of f will be R==. Demography the Cartesian artefact of D and R we access F=.

    So using set notation, a action can be bidding as the Cartesian artefact of its area and range.

    In the aloft area ambidextrous with functions and their properties, we acclaimed the important acreage that all functions haveto have, namely that if a action does map a amount from its area to its codomain, it haveto map this amount to alone one amount in the codomain.

    Writing in set notation, if a is some anchored value:

    : ||=1

    However, if we accede the relation, we relax this constriction, and so a affiliation may map one amount to added than one additional value. In general, a affiliation is any subset of the Cartesian artefact of its area and codomain.

    All functions, then, can be advised as relations also.

    When we accept the acreage that one amount is accompanying to another, we alarm this affiliation a bifold affiliation and we address it as

    : x R y

    where R is the relation.

    For arrow diagrams and set notations, bethink for relations we do not accept the brake that functions do and we can draw an arrow to represent the mappings, and for a set diagram, we charge alone address all the ordered pairs that the affiliation does take: again, by example

    :f =

    is a affiliation and not a function, back both 1 and 2 are mapped to two values, 1 and -1, and 2 and -2 respectively.

    Let us appraise some simple relations.

    Say f is authentic by

    :

    This is a affiliation (not a function) back we can beam that 1 maps to 2 and 3, for instance.

    Less-than, <, is a affiliation also. Some numbers can be beneath than some additional anchored number, so it cannot be a function.

    When we are searching at relations, we can beam some appropriate backdrop altered relations can have.

    A affiliation is automatic if, we beam that for all ethics a:

    : a R a

    In additional words, all ethics are accompanying to themselves

    The affiliation of equality, = is reflexive. Beam that for, say, all numbers a (the area is R):

    : a = a

    So = is reflexive.

    In a automatic relation, we accept arrows for all ethics in the area pointing aback to themselves:

    :

    A affiliation is symmetric if, we beam that for all ethics a and b:

    : a R b implies b R a

    The affiliation of adequation afresh is symmetric. If x=y, we can aswell address that y=x also.

    In a symmetric relation, we accept arrows amid ethics accepting a bifold edge, ie. an arrow credibility from one amount x to a amount y and an arrow aback from y to x:

    :

    A affiliation is transitive if for all ethics a, b, c:

    : a R b and b R c implies a R c

    The affiliation greater-than > is transitive. If x > y, and y > z, then it is true that x > z. This becomes clearer if we address down what is accident into words. x is greater than y and y is greater than z. So x is greater than both y and z.

    In the arrow diagram, every arrow amid two ethics x and y, and y and z, has an arrow traveling beeline from x to z.

    :

    A affiliation is antisymmetric if, we beam that for all ethics a and b:

    : a R b and b R a implies that a=b

    Notice that antisymmetric relations arent not symmetric

    Take the affiliation greater than or equals to, ≥

    If x ≥ y, and y ≥ x, then y haveto be according to x.

    A affiliation satisfies trichotomy if we beam that for all ethics a and b it holds true that:

    aRb or bRa

    Given the aloft information, actuate which relations are reflexive, transitive, symmetric, or antisymmetric on the afterward - there may be added than one characteristic. (Answers chase to even numbered questions.)

    x R y if

    # x = y

    # x < y

    # x² = y²

    # x ≤ y

    :2. Transitive.

    :4. Reflexive, antisymmetric, transitive.

    We accept apparent that assertive accepted relations such as =, and accordance (which we will accord with in the next section) obey some of these rules above. The relations we will accord with are actual important in detached mathematics, and are accepted as adequation relations. They about advance some affectionate of adequation notion, or equivalence, appropriately the name.

    For a affiliation R to be an adequation relation, it haveto accept the afterward properties, viz. R haveto be:

    (A accessible mnemonic, R-S-T)

    In the antecedent problem set you accept apparent equality, =, to be reflexive, symmetric, and transitive. So = is an adequation relation.

    We denote an adequation relation, in general, by $x\; sim\; y$.

    Say we are asked to prove that = is an adequation relation.

    We then advance to prove anniversary acreage aloft in about-face (Often, the affidavit of transitivity is the hardest).

    Clearly, it is true that a = a for all ethics a.

    So = is reflexive.

    If a = b, it is aswell true that b = a.

    So = is symmetric

    If a = b and b = c, this says that a is the aforementioned as b which in about-face is the aforementioned as c. So a is then the aforementioned as c, so a = c, and appropriately = is transitive.

    Thus = is an adequation relation.

    It is true that if we are ambidextrous with relations, we may acquisition that some ethics are accompanying to one anchored value.

    For example, if we attending at the superior of congruence, which is that accustomed some amount a, a amount coinciding to a is one that has the aforementioned butt or modulus if disconnected by some amount n, as a, which we write

    :a ≡ b (mod n)

    and is the aforementioned as writing

    :a = b+kn for some accumulation k.

    (We will attending into congruences in added detail later, but a simple assay or compassionate of this abstraction will be absorbing in its appliance to adequation relations)

    For example, 2 ≡ 0 (mod 2), back the butt on adding 2 by 2 is in actuality 0, as is the butt on adding 0 by 2.

    We can appearance that accordance is an adequation affiliation (This is larboard as an exercise, beneath Adumbration use the agnate anatomy of accordance as declared above).

    However, what is added absorbing is that we can accumulation all numbers that are agnate to anniversary other.

    With the affiliation accordance modulo 2 (which is using n=2, as above), or added formally:

    : x ~ y if and alone if x ≡ y (mod 2)

    we can accumulation all numbers that are agnate to anniversary other. Observe:

    : $0\; equiv\; 2\; equiv\; 4\; equiv\; ldots\; pmod$

    : $1\; equiv\; 3\; equiv\; 5\; equiv\; ldots\; pmod$

    This first blueprint aloft tells us all the even numbers are agnate to anniversary additional beneath ~, and all the odd numbers beneath ~.

    We can address this in set notation. However, we accept a appropriate notation.

    We write:

    :=

    :=

    and we alarm these two sets adequation classes.

    All elements in an adequation chic by analogue are agnate to anniversary other, and appropriately agenda that we do not charge to cover , back 2 ~ 0.

    We alarm the act of accomplishing this alignment with account to some adequation affiliation administration (or added and absolutely administration a set S into adequation classes beneath a affiliation ~). Above, we accept abstracted Z into adequation clases and , beneath the affiliation of accordance modulo 2.

    Given the above, acknowledgment the afterward questions on adequation relations (Answers chase to even numbered questions)

    # Prove that accordance is an adequation affiliation as afore (See adumbration above).

    # Allotment into adequation classes beneath the adequation affiliation $x\; sim\; y\; mbox\; x\; equiv\; y\; pmod$

    2. =, =, =, =, =, =

    We aswell see that ≥ and ≤ obey some of the rules above. Are these appropriate kinds of relations too, like adequation relations? Yes, in fact, these relations are specific examples of addition appropriate affectionate of affiliation which we will call in this section: the fractional order.

    As the name suggests, this affiliation gives some affectionate of acclimation to numbers.

    For a affiliation R to be a fractional order, it haveto accept the afterward three properties, viz R haveto be:

    (A accessible mnemonic, R-A-T)

    We denote a fractional order, in general, by x y.

    Say we are asked to prove that ≤ is a fractional order.

    We then advance to prove anniversary acreage aloft in about-face (Often, the affidavit of transitivity is the hardest).

    Clearly, it is true that a ≤ a for all ethics a.

    So ≤ is reflexive.

    If a ≤ b, and b ≤ a, then a haveto be according to b.

    So ≤ is antisymmetric

    If a ≤ b and b ≤ c, this says that a is beneath than b and c. So a is beneath than c, so a ≤ c, and appropriately ≤ is transitive.

    Thus ≤ is a fractional order.

    Given the aloft on fractional orders, acknowledgment the afterward questions

    1. Prove that divisibility, |, is a fractional adjustment (a | b agency that a is a agency of b, ie., on adding b by a, no butt results).

    2. Prove the afterward set is a fractional order:

    :(a, b) (c, d) implies ab≤cd for a,b,c,d integers alignment from 0 to 5.

    2. Simple proof; Analogue of the affidavit is an alternative exercise.

    :Reflexivity: (a, b) (a, b) back ab=ab.

    :Antisymmetric: (a, b) (c, d) and (c, d) (a, b) back ab≤cd and cd≤ab betoken ab=cd.

    :Transitive: (a, b) (c, d) and (c, d) (e, f) implies (a, b) (e, f) back ab≤cd≤ef and appropriately ab≤ef

    A fractional adjustment imparts some affectionate of acclimation amidst elements of a set. For example, we alone understand that 2 ≥ 1 because of the fractional acclimation ≥.

    We alarm a set A, ordered beneath a accepted fractional acclimation , a partially ordered set, or artlessly just poset, and address it (A, ).

    There is some specific analogue that will advice us accept and anticipate the fractional orders.

    When we accept a fractional adjustment , such that ab, we address to say that a but a ≠ b. We say in this instance that a precedes b, or a is a antecedent of b.

    If (A, ) is a poset, we say that a is an actual antecedent of b (or a anon preceds b) if there is no x in A such that a x b.

    If we accept the aforementioned poset, and we aswell accept a and b in A, then we say a and b are commensurable if a b and b a. Contrarily they are incomparable.

    Hasse diagrams are appropriate diagrams that accredit us to anticipate the anatomy of a fractional ordering. They use some of the concepts in the antecedent area to draw the diagram.

    A Hasse diagram of the poset (A, ) is complete by

    

    There are some advantageous operations one can accomplish on relations, which acquiesce to

    express some of the aloft mentioned backdrop added briefly.

    Let R be a relation, then its inversion, R^-1 is authentic by

    R^-1 := .

    Let R be a affiliation amid the sets A and B, S be a affiliation amid B and C. We can concatenate

    these relations by defining

    R • S :=

    Let A be a set, then we ascertain the askew (D) of A by

    D(A) :=

    Using aloft definitions, one can say (lets accept R is a affiliation amid A and B):

    R is transitive if and alone if R • R is a subset of R.

    R is automatic if and alone if D(A) is a subset of R.

    R is symmetric if R^-1 is a subset of R.

    R is antisymmetric if and alone if the circle of D(A) and R is D(A).

    R is agee if and alone if the circle of D(A) and R is empty.

    R is a action if and alone if R^-1 • R is a subset of D(B).

    In this case it is a action A → B.

    Lets accept R meets the action of getting a function, then

    R is injective if R • R^-1 if a subset of D(A).

    R is surjective if = B.

    This is abridged and a draft, added advice is to be added

    ----

    Previous topic:|Contents:|Next topic: