2020•Mathematica EternaRequires access

Extended Abstract on Properties Of Relations

Shayda Khalid Hussein

Open publisher page 0 citations

Abstract

In math, the relation is between the x-values and y-values of ordered pairs. The set of all x-values is known as the domain, and so therefore the set of all y-values is known as the range. Different kinds of Relation: Empty Relation: A relation R on a group A is termed Empty if the set A is empty set. Full Relation: A binary relation R on a collection A and B is termed full if AXB. Reflexive Relation: A relation R on a set A is termed reflexive if (a,a) € R holds for every element a € A . The identity relation consists of ordered pairs of the form (a,a), where a∈A. In other words, aRb if and on condition that a=b. Then “membership” could also be a relation R from X to Y: i.e., we’ve got xRy if x ∈ y. After all the above way of intelligent about relations is definitely formalized, as was suggested at school by Adam Osborne: namely, we will think about a relation R as a function from X ×Y to the two-element set {TRUE, FALSE}.

About this research paper

What this paper is about

In math, the relation is between the x-values and y-values of ordered pairs. The set of all x-values is known as the domain, and so therefore the set of all y-values is known as the range. Different kinds of Relation: Empty Relation: A relation R on a group A is termed Empty if the set A is empty set. Full Relation: A binary relation R on a collection A and B is termed full if AXB. Reflexive Relation: A relation R on a set A is termed reflexive if (a,a) € R holds for every element a € A . The identity relation consists of ordered pairs of the form (a,a), where a∈A. In other words, aRb if and on condition that a=b. Then “membership” could also be a relation R from X to Y: i.e., we’ve got xRy if x ∈ y. After all the above way of intelligent about relations is definitely formalized, as was suggested at school by Adam Osborne: namely, we will think about a relation R as a function from X ×Y to the two-element set {TRUE, FALSE}.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In math, the relation is between the x-values and y-values of ordered pairs. The set of all x-values is known as the domain, and so therefore the set of all y-values is known as the range. Different kinds of Relation: Empty Relation: A relation R on a group A is termed Empty if the set A is empty set. Full Relation: A binary relation R on a collection A and B is termed full if AXB. Reflexive Relation: A relation R on a set A is termed reflexive if (a,a) € R holds for every element a € A . The identity relation consists of ordered pairs of the form (a,a), where a∈A. In other words, aRb if and on condition that a=b. Then “membership” could also be a relation R from X to Y: i.e., we’ve got xRy if x ∈ y. After all the above way of intelligent about relations is definitely formalized, as was suggested at school by Adam Osborne: namely, we will think about a relation R as a function from X ×Y to the two-element set {TRUE, FALSE}.

Key concepts: Relation (database), Binary relation, Mathematics, Identity function, Element (criminal law), Set (abstract data type), Function (biology), Identity (music)

Related papers

Back to paper searchBrowse research topicsOriginal source
Extended Abstract on Properties Of Relations — Research Paper | ScholarLens