explain what is set in maths
Answers
Answered by
8
hey dear ☺☺
========================================
In mathematics, a set is a collection of distinct objects, considered as an object in its own right. ... The concept of a set is one of the most fundamental in mathematics.
What is a defined set?
Sets. Definition: A set is a well-definedcollection of distinct objects. The objects of a set are called its elements. If a set has no elements, it is called the empty set and is denoted by ∅.
hope it's help uuu
========================================
In mathematics, a set is a collection of distinct objects, considered as an object in its own right. ... The concept of a set is one of the most fundamental in mathematics.
What is a defined set?
Sets. Definition: A set is a well-definedcollection of distinct objects. The objects of a set are called its elements. If a set has no elements, it is called the empty set and is denoted by ∅.
hope it's help uuu
Answered by
10
One-one functions* This can be made to be understood or explained by going through these basics.
> Elements
> Sets
> Types of sets
> Relations
> Types of relations
> Domain
> Function
> One one function.
Set* :- A collection of well defined objects. A set may have infinite or finite objects .Every object is called element of the set.
Subset :- It is the set of few or all elements of a set.
Power set :- It is the set of all subsets of the set including itself and the empty set.
Union on sets :- Let A, B two sets . Then A union B represented by A∪B is the set of all elements of both A and B.
Intersection of sets :- Intersection would contain the common elements of Sets .
Relation :- A connection between 2 sets with some kinda rule is known as Relation .
A × B defines a relationship with all the possible ordered pairs formed between A, B.
Let every ordered be in the form of ( a, b) then a = xb .x can be sum ,difference or some kinda arithmetical variable or literals.
Relationships exhibit in three types, qualifying the three gives the fourth one.
Reflexive :-Consider a relation A × A, For every a ∈ A, there must exist (a, a) ∈ R. Then R is reflexive.
Symmetric :- For a relationship A × B, for every ( a, b) ∈ R there must exist ( b, a) ∈ R then Relation R is symmetric.
Antisymmetric :- For a relationship A × B, if (a, b) ∈ R and ( b, a) ∈ R it implies that a = b.
Transitive :- if (a, b) ∈ R and also ( b, c) ∈ R then if ( a, c) is also present in R. Then R is transitive.
Equivalence :- A relationship obeying transitive, reflexive and symmetric is known as equivalence.
In relation, a element may be connected with one element or multiple elements .
In a relationship, the first set is called domain. The second set is co-domain .
Read more on Brainly.in - https://brainly.in/question/2462738#readmore
> Elements
> Sets
> Types of sets
> Relations
> Types of relations
> Domain
> Function
> One one function.
Set* :- A collection of well defined objects. A set may have infinite or finite objects .Every object is called element of the set.
Subset :- It is the set of few or all elements of a set.
Power set :- It is the set of all subsets of the set including itself and the empty set.
Union on sets :- Let A, B two sets . Then A union B represented by A∪B is the set of all elements of both A and B.
Intersection of sets :- Intersection would contain the common elements of Sets .
Relation :- A connection between 2 sets with some kinda rule is known as Relation .
A × B defines a relationship with all the possible ordered pairs formed between A, B.
Let every ordered be in the form of ( a, b) then a = xb .x can be sum ,difference or some kinda arithmetical variable or literals.
Relationships exhibit in three types, qualifying the three gives the fourth one.
Reflexive :-Consider a relation A × A, For every a ∈ A, there must exist (a, a) ∈ R. Then R is reflexive.
Symmetric :- For a relationship A × B, for every ( a, b) ∈ R there must exist ( b, a) ∈ R then Relation R is symmetric.
Antisymmetric :- For a relationship A × B, if (a, b) ∈ R and ( b, a) ∈ R it implies that a = b.
Transitive :- if (a, b) ∈ R and also ( b, c) ∈ R then if ( a, c) is also present in R. Then R is transitive.
Equivalence :- A relationship obeying transitive, reflexive and symmetric is known as equivalence.
In relation, a element may be connected with one element or multiple elements .
In a relationship, the first set is called domain. The second set is co-domain .
Read more on Brainly.in - https://brainly.in/question/2462738#readmore
Similar questions