#Explanation of Relations, Ordered Pairs, and Sets
41 messages · Page 1 of 1 (latest)
More like clarification lol
So from my understanding:
Ordered pairs are pairs of elements that must follow a certain order; i.e (a, b) != (b, a)
Sets are collections of Ordered Pairs
Relations are collections of Sets?
ohhh
ordered pairs are just.. pairs of things, with fixed order
namely given two sets $A$ and $B$, I define the following set $A\times B:={(a,b)|a\in A\text{and}b\in B}$
Omegabet_
aka the set of all ordered pairs where the 1st thing is from A and the 2nd thing is from B
common example you're use to, the xy plane is $\mathbb{R}\times\mathbb{R}=:\mathbb{R}^2$
And sets are just lists of things
Omegabet_
hold on man im not too caught up with this math syntax lol
you really need to read what I say lol
could you put it into layman's terms please
you'd need to explain what you're confused on
basically every symbol you included in your explanation that isn't part of the alphabet lol
{} means set, $\in$ means "in" $|$ means "such that"
Omegabet_
$\mathbb{R}$ is the real numbers
Omegabet_
hmm okay
but anyway, a relation is then just a subset of this AxB set
namely all pairs of elements that satisfy the relation
sorry im having a really hard time understanding your explanation of sets. i understand that they are just structures to hold elements within, but could you give me another example that might be easier to understand?
well what would you consider the most common usage of a set
hmm alright
could you elaborate on what you meant by relations being a "subset" of sets? the resource im using right now contains the following example as the relation T:
T = {(3, 0), (7, -5),(-5, 5), (3, 6)}
to me, this looks alot like your explanation of what a set is
i'm not sure if this needs clarification but to my observation, i believe the elements of T are ordered pairs of plotted points.
If we're talking set theory, we need to talk about the axioms of set theory. This in particular refers to the axiom of subsets; given any set A, it is possible to construct the set B containing some, but not necessarily all, of the elements of A.
More precisely, the axiom schema of subsets states that for any set A, it is possible to construct the set B containing all elements x such that x is in B if and only if x is in A and some predicate p holds for x.
It's an axiom schema because there is a specific form of the axiom for every predicate p.
We call this the axiom of subsets because B is a subset of A; that is, all of the elements of B are elements of A.