teach me indexed sets @ikram002p
im not able to appreciate indexed sets on a set
you at least need to first understand partial orders.
Ohk, i can catchup i guess... i know about metric spaces and related stuff
indexed set is just an expression of sets that have something common related to another countable set . ok so far ?
need not me countable
be*
the indexed set need not to be countable BUT it need to be defined with respect to countable sets , i'll give examples
okay so you're ordering the set based on index ?
as the most trivial example: \(\cup_{x\in \mathbb{R}}x=\mathbb{R}\)
x is the index here ?
this is not indexed :O , this is like union of countable infinite indexed sets
i thought you could only use natural numbers as index
u can use rational , natural or what ever it is hmm
http://math.stackexchange.com/questions/106102/use-of-sum-for-uncountable-indexing-set
any set with a total partial order can be an indexed set
what is partial order ?
its basically what you think of as \(\le\)
ok @zzr0ck3r teach him :)
google it.... read the one paragraph on wiki.
that looks like a bijection ?
looks you're pointing elements of one set from another set, based on that definition the index need not be a natural number i see
what does?
Its not function
tje link u gave has this an index set is a set whose members label (or index) members of another set.[1] For instance, if the elements of a set A may be indexed or labeled by means of a set J, then J is an index set. The indexing consists of a surjective function from J onto A and the indexed collection is typically called an (indexed) family,
a partially ordered set, is a set A with a relation < where three properties need to occur 1) a<a (reflexive) 2)a<b and b<a implies a=b (anti symmetric) 3) a<b and b< c implies a<c (transitive) one example would be the naturals with "divides"
ahh I thought you were talking about < a surjection is an onto map, a bijection is a one to one and onto map
got it, and also got the definition of partially ordered set
think of a sequence, we use N to be the index. but a subsequence of some sequence would have a subset of N as the domain, so we need not have our map be onto
Oh so a sequence definition also uses indexed sets is it ?
but the indexed set need not be countable. This shows up more in set theory/topology.
\[\{a_n\}\] is \(n\) an index set of natural numbers ?
well its using an indexed set N to "index" the elements of the sequence
thanks i have an example if u have time.. the one you, me, chris and eliassaab have worked sometime back... one sec
the sequence itself could be thought of as an indexed set.
eliassaab is very strong in this topic. I would listen to what he said. I was not trying to cut you off @ikram002p I just saw someone telling this same user the same thing yesterday, so I wanted to make sure it was clear. I was just knocked off points for assuming my index set I was countable.
like 3 days ago, so its fresh:P
:D well i rather to learn instead of teaching :P i made a mistake i guess by saying countable pardon me .
same here. On a damn test.
what does it mean by taking "union of an infinite indexed family in T" ? \[\rm A \subset X , T=2^A \cup \{X\}\]
it means if all sets ( that follows some rule of indexed ) are in T then show there union is also in T
family is just another word for sets, and it usually indicates that the elements of the set are themselves sets. They may use the word collection in the same manner. Infinite means there are infinite of these elements (sets) in the family(set), and they are indexed by some set (T not sure without more). So if you pick an element in T, then it points to a set inside this infinite family.
Are they saying that T is the indexed set, or that T is a collection, and there is a subset of T of which we are to take the union of.
what do u mean by ? . So if you pick an element in T, then it points to a set inside this infinite family.
If T is the indexed set
But I think I was reading it wrong
nope its not
I would need more context, but I would bet @ikram002p is right.
sorry let me rephrase it again : i have a set defined as below \[\rm T=2^A \cup \{X\}\] where \(A \subset X \) and \(X\ne \varnothing\)
the point is , if there is a family of indexed set that all of its elements belong to T then the union is also in T
and the question goes like this `Show that union of an infinite indexed family in T is also in T.`
yep , its the third condition to define a topology
oh yeah what ^^ said
so should i first pick some set for indexing elements in T ?
so 2^A is the continuum cardinality after A?
2^A is powerset of A
\(\mathcal{P(A)}\)
that is not how we denote the power set of A
but it is how we denote the cardinality of the power set of A
well it only makes sense if its a set, so I guess I just have never seen this notation used to mean power set
ohk.. \[\mathcal{ T=P(A) \cup \{X\}}\]
dot pick up , just use the definition , \(\left \{ V_\alpha : \forall \alpha \in \Delta \right \}\in T \) and using P(A) for power set is much better
so by this i picked any indexed set , which all of its elements belong to T , ok so far ?
I see \(\Delta \) is a set, what does it contain ?
I am not sure here, it screams Zorns lemma to me so I may be blinded. Ill watch and learn:)
im only looking for understanding indexed sets from analysis point of view i don't think im ready for topology yet :O
This question actually seems quite trivial. Take an infinite union of elements in T, these elements are either subsets of A or they are all of X. If we take the union we will have two cases 1) X was one of our elements, then the union is X, and X is for sure an element in T 2) X was not one of our elements, then the union is a subset of A, so for sure its in T
(because the union of subsets of A, is a subset of A)
\[\large \mathcal {\bigcup_{i=1}^{\infty}U_i}\] ?
right, then either U_i = X for some i, or not. if it does....
Show that union of an infinite `"indexed family in T"` is also in T. i don't get that phrase yet but ur solution makes sense!
well, I would say \(i\in I\) \(U_{i\in I}u_i\) saying it like you did is assuming its countable, because we use that notation to mean indexed by the reals
err indexed by the naturals i mean
can i read it as Show that `"infinite union of elements in T"` is also in T.
yes
-.- its not topology view lol ok how u define a set that there elements are sets , and these sets (X_n) are intervals such that X_n =(0,1/n ) and n \in N just make a neat notation thats all
who said anything about intervals?
yes you can read it like that @rsadhvika T is a "family" or "collection" because its elements are themselves sets
its just an example xD sorry if i mixed things up
idk what were talking about anymore , explaining the indexed or solving the question
ok so what I am I missing that the following does not work Let \(\large \cup_{i\in I}x_i\) be a family of indexed sets, where \(I \) is an infinite indexed set. case 1) \(X=x_i\) for some \(i\in I\) then \(\large \cup_{i\in I}x_i=X\in T\) case 2) \(X\ne x_i \forall i\in I\) then \(\large \cup_{i\in I}x_i\subseteq A\) so \(\large \cup_{i\in I}x_i\in T\)
xD why T involved
ok lets forget the T example for a second , @rsadhvika u got what indexed family means ?
are u refering to \[\large \cup_{i\in I}x_i\] ?
Why T involved????? The question defines T.
ok im completly ignored nvm guys
lol I was just trying to solve the question that he posted from the other day. Not but in any more about indexed sets.
i think i get it, you're indexing the elements, \(x\)'s, using the elements from infinite set \(I\)
I will not but in any more*
yes, and remember the x's are sets.
they are either subsets of A or all of X
okay so there is a surjective mapping from I to T
why arent you using natural numbers as index set ? natural numbers are also infinite so they can index infinite sets right ?
\(\large \cup_{i\in I}x_i\) is a family of indexed sets because each \(x\) is a subset. got it thanks :)
\(\large \cup_{i\in I}x_i\) is a family of oranges if each \(x\) is an orange
explicit definition of indexing set seems unnecessary but i get the general idea thanks to both of you!
here is an easy example where our indexed set is \(\mathbb{R}\) Consider \[D:=\{\{x\} | \ x\in \mathbb{R}\}\] This is a set of singletons (some call it a family or collection), for each \(x\in \mathbb{R}\) we have a set \(\{x\}\) \(D\) is indexed by \(\mathbb{R}\).
Join our real-time social learning platform and learn together with your friends!