« first day (613 days earlier)      last day (4415 days later) » 

12:00 AM
parsing.....
 
what specifically are you trying to parse?
 
i'm reading the link that arturo linked to in his answer that you linked to (which was also written by arturo)
i'm having a bit of difficulty in that he produces a subset A' of H, and presumably the cardinality of A = f(G) and A' are the same, but he doesn't explicitly say so.
i was never aware of how involved the statement epi= surjective actually was in the category of groups....
it looks like a proof by contradiction, even though it's not phrased that way, which is throwing me off
perhaps i am missing something, but it looks as if the whole argument rests on a regular action of a group on itself.
well, actually a coset space, but same thing, we get an induced action on a (left or right) coset space from the (left or right) regular action
 
12:28 AM
yes I think that is one of the main points.
 
i mean, he appears to be assuming we can pick some element of h NOT in A = f(G), otherwise H/A is trivial.
and so we could take A' = (A - {a}) U {h}, for example, for some element a of A, which can't be a coset of A in H.
 
But A' can be anything. It should just be of the same cardinality as A
(there need not be any relation of A' with H, if I read it correctly. A' is just any set that can be put into bijection with A)
 
i get, that, too...he just wants to pick some subset of H that doesn't "line up" with the slicing of H by A, but has the same size as a coset.
what is troubling me, is i don't see how an element of H defines a unique element of Sym(S) = K
 
@JasperLoy It was my wireless router, I believe. :-)
 
hi tb, David and robjohn.
 
12:41 AM
I have to go for a walk. I will be back later. Sorry I have been so absent, but I have been fixing up an answer.
@Srivatsan: I am sorry, but I have to leave for a couple of hours.
 
Hey Srivatsan!
 
@robjohn It's fine. Take care.
 
@Srivatsan salutations
 
@tb I need to complete my recent answer by typesetting a small commutative diagram. It's perhaps the simplest possible diagram: a square with two paths from top left to bottom right. How can I make this in MSE?
 
@DavidWheeler I don't think so. H/A is a collection of sets, all of the same size as A. Now add another set A' of the same size as A. An element h acts on H/A and as the identity on A'. The permutation s is a fixed bijection of A and A' which leaves everything else fixed.
 
12:45 AM
he writes: "if A' is sent to itself....." well, sure, in that case we do have an element of Sym(S), but how can we ensure that is the case for any h in f(G)?
 
@Srivatsan see here. Zev's answer seems better suited than the accepted one.
 
is he just DEFINING an action of H on S?
 
I think so, yes.
 
so (A').h = A' by definition, then
 
exactly.
 
12:48 AM
@tb I'll try it, thanks. Have you happened to have drawn diagrams in any of your posts?
 
so it's almost like he's sneaking in a direct product action, without saying so
 
anyone know chinese remainder theorem
 
defining an action (by a group G) on a set C x D, where we already have an action on C by G by letting G act on D trivially.
 
@WhatsInAName I suggest that you just post your question. Most basic questions in this chat will get some response from one or another.
 
i am trying to find n choose k mod p*b where p and b are prime
i can find n choose k mod p and n choose k mod b, but need to combine the results
 
12:52 AM
@Srivatsan here. But I prefer typesetting them on my computer and uploading screen shots, as I did here for example.
@DavidWheeler yes.
 
@WhatsInAName: equation here is the formula you wnat
or rather second to last
 
@tb Ah, ok. Thanks.
 
the first poster is one of my favorite users here...
 
so then $k(h) = sg(h)s^{-1}$, and for all a in A, $k(a) = g(a)$
 
I don't understand
 
12:56 AM
yes.
 
but if i understand what's going on, to prove f is surjective, we can use ANY other group K
 
equation makes no sense to me
i just want to combine two results
 
@Whats: $[a^{-1}]_b$ stands for the multiplicative inverse of $a$ modulo $b$.
 
so i could use the A' i proposed, instead of the A' Arturo came up with, all i need is to get "some other group K" to which i can apply the epic property of f to.
 
@WhatsInAName Do you know what a "multiplicative inverse of something modulo something else" is, and how to compute it?
 
12:59 AM
So I do a1*n2*[inverse n2 mod n1] + a2*n1*[inverse of n1 mod n2]?
 
yes
 
in my case what is a1, a2, n1, n2?
n choose k mod p and n choose k mod b
 
n1 = p and n2 = b.
And your n choose k mod p is n1. n2 is n choose k mod b.
 
and $a_1 = a_2$ = n choose k.
 
i thought n1 was p?
 
1:01 AM
@David: But to do that, you'd need to assume a few things (and make the proof indirect). Doing it the way I said, this always works and you don't have to assume anything and you show that A = H.
 
ah ok
 
@tb...assume "what things"?
 
(n choose k)*b*[inverse b mod p] + (n choose k)*p*[inverse of p mod b]
 
@DavidWheeler In your approach you need to assume that you have a subset of H that isn't an A-coset.
 
is a1 n choose k or can it be n choose k mod p / b etc
 
1:02 AM
oh, you mean that my way explicitly makes it a proof by contradiction, whereas Arturo is allowing for the fact that A might be H from the outset.
 
exactly.
 
@WhatsInAName More generally, your are given two moduli, p and b, and the residues of a hidden number modulo these two moduli. E.g., you know n choose k mod p and n choose k mod b, but not n choose k itself.
 
right
 
@WhatsInAName Well, the formula is slightly wrong: you do not know n choose k. How are you going to apply the formula?
 
well, there is one assumption in Arturo's argument, namely that H is non-trivial.
 
1:04 AM
@WhatsInAName a1 is n choose k mod p.
 
i have absolutely no idea :(
 
@WhatsInAName The formula is: n choose k mod (pb) = (n choose k mod p) * b * (inverse of b modulo p) + (n choose k mod b) * p * (inverse of p modulo b) .
 
@DavidWheeler why?
(not that it would matter much :))
 
i just tried that
and for some reason it's not giving me the right value
 
because otherwise there is NO such A', because the only subgroup of a trivial subgroup is trivial. the only non-empty subset of H is H itself.
 
1:07 AM
@zevchonoles We (well, devs, but whatever :)) can disassociate posts from accounts. Just let us know which one needs to be anonymized.
 
@WhatsInAName Give us your values.
 
@DavidWheeler But A' can be any set
 
uint64_t p = 1000003;
uint64_t b = 1000033;
uint64_t x = modBinomial(543, 12, p);
uint64_t y = modBinomial(543, 12, b);
cout << x*b*modInverse(b,p) + y*p*modInverse(p,b);
 
@AnnaLear I've never seen Zev entering this room. Are you sure this comment is supposed to be here?
 
oh, you mean A' could be the null set, in which case S = H/A
 
1:08 AM
@WhatsInAName What answer do you get? Maybe there are overflow issues?
 
@tb Super-ping will notify him of the message, anyway. But thanks for the heads up. I'll try to find a more reliable way to get hold of him. :)
 
i'm using uint64's though
I get 174371283783502760
 
so any group acts on the null set trivially, just because there's nothing to act on, so it doesn't really mater HOW we define the action: we could say it turns all members blue.
 
@WhatsInAName Well, you need to be able to store the intermediate results without overflow, not just the final answer.
 
everything uses uint64's
 
1:10 AM
@DavidWheeler No, if H = A = {e} then A' is just some one-point set.
(as I said, A' is just some set in bijection with A and A is always non-empty)
 
oh! you mean A' could be ANY set, not even having anything to do with H?
 
@WhatsInAName Maybe that is not the issue. What is pb? You should mod out the answer by pb at the end; did you do that?
 
so A' might be {a*Fred}, where a is an element of A?
 
@DavidWheeler yes... That's what I was trying to say right at the beginning:
 
ah that's what it was!
thank you so much
 
1:13 AM
@DavidWheeler yep.
 
@WhatsInAName Because the formula will not recover the hidden number (n choose k) exactly; it will recover it only modulo pb.
 
ok, so we're just "padding" A/H by adding some set with |A| elements, and letting h always send A' to A'.
 
as identity.
 
g(h)(a') = a' for all a' in A'.
actually, that's not right, g(h)(A') = A', who knows if g(h) interacts with elements or not...
 
No, you really take the coset action and declare g(h)(a') = a'
Then we fix a bijection s between A and A' and fix everything in A/H \cup A' that isn't either in A or A'
 
1:18 AM
Ok, see you all. Got to go.
 
that should have been H/A \cup A'
 
lol, i get it...i just was struggling as to how in the hell he produced A'. and you're saying it doesn't matter, pick any set with |A| elements except a coset.
 
exactly. I've been trying to get this point through right from the beginning, but I was sorta distracted...
bad teaching, I guess.
 
now i'm looking into the schreier refinement theorem...
@tb it's ok, i'm just dense sometimes
it appears that this implies jordan-holder, which in turn implies the structure theorem for f.g. abelian groups
honestly though i got bored reading the proof after "division algorithm" blah,blah, blah "second isomorphism theorem" blah blah blah
 
1:34 AM
where are you getting that from now?
 
oh, that's the kind of stuff I should read now, because I should actually be sleeping :)
 
what i mean is i looked at it, and i was like" oh, right" freaking integers, they're EVERYWHERE....
 
that's basically the way I took it...
 
in a vague sort of general way i look at life like this: we have stuff. and things happen. some things that get done to stuff can be un-done, and this is useful for when things aren't going so good. unfortunately, sometimes you have to remember how you got where you were, so you can go back. in a perfect world (read: abelian), it doesn't matter...all roads lead to rome. the end.
 
1:50 AM
I wonder what exactly triggered this, but for some reason it made me laugh. I hope that's okay...
 
@tb of course it's OK. i aim to please :)
 
very good then, thanks :)
 
So two (sub)normal series are equivalent if they have the same factor groups, counted with multiplicity? I think the pdf is missing an apostrophe or something in its definition.
 
I keep hearing and reading the words operator systems and completely positive maps, but I never actually found out why I should care in the first place.
this "survey" is an example that might indicate why I am lost
 
it looks like the things quantum physicists care about
 
2:05 AM
It does look like it, yes.
oh no! Victor discovered Wildberger...
 
2:20 AM
what?
 
that is a cool video...i've seen it before
 
Well, Wildberger has his own style... Not bad. Don't like the way he pronounces taaaaangent :) But I shudder at the thought of 5 * (how many lectures?) questions on this stuff by V.
 
3:08 AM
quick question: how many elements of order 10 in Z12 x Z4 x Z15...i count 12?
 
The grocery store was almost out of peeps. An outrage, I say.
 
3:43 AM
peeps r 3bil
 
@DavidWheeler 3bil?
 
eeeeeeeeevillllllll
candies shaped like baby whatever are inherently so
 
l3375p34k
 
I can still read that fluently. Not sure how to feel about that.
 
3:55 AM
the reference to "airplane" is too funny
 
4:12 AM
what's a cool argument that if S is a subspace of R^n of dimension k there exist $1\leq i_1<\dots<i_{n-k}\leq n$ such that $S\cap\langle e_{i_1},\dots,e_{i_{n-k}}\rangle=0$ ?
 
4:22 AM
Don't know if that's cool enough: pass to the quotient which has dimension $n-k$. The images $f_1,\ldots,f_n$ of $e_1,\ldots,e_n$ span $\mathbb{R}^n/S$. Take a linearly independent subset $f_{i_1},\ldots,f_{i_{n-k}}$ and look at their preimages. The intersection $S \cap \langle e_{i_1}, \ldots, e_{i_{n-k}} \rangle$ is zero because $f_{i_1},\ldots,f_{i_{n-k}}$ are linearly independent.
 
cool enough :)
thanks
 
 
1 hour later…
5:27 AM
@tb What a gentleman you are.
 
I wrote $\int_{n}^x |f(t)|\,dt \leq \int_{n}^{n+1}|f(t)|\,dt$, the right hand side of which is independent of $x$. Now integrate this over $[n,n+1]$ to get the desired inequality.
where $f$ should have been $f'$ of course... :)
The question comes from here btw.
 
user19161
5:47 AM
@DavidWheeler Oh I would not dare to eat them.
 
hello
 
Am I missing something or is this a non-issue about a far too generic concept?
 
$(1)$ here is the trivial group?
 
6:08 AM
yes.
got involved in null-o-logy again. bleeeh
 
Snoooow!!!
Must be my birthday today. : )
 
6:23 AM
can everyone see the history of removed comments or does that come with modhood?
 
modhood
 
Modhood privilege.
 
it certainly wouldn't be everyone.
 
also on the main site. You can see all deleted answers with 10k, but comments are gone.
 
6:25 AM
yup
 
It's... unicorns!
 
oh boy, it's the musical topology dude
 
: D
I think it's unicorns.
 
"Don't you get it? Music is semi-algebraic sets."
 
I really fail to understand the point of this. I would insist that a property is closed under isomorphisms anyway. But I wouldn't call a property of modules over a ring a module property provided the zero module satisfies it. I wouldn't call a property a pointed space property provided the one-point space has it.
 
 
1 hour later…
7:43 AM
@tb Hey are you around?
I am trying to understand why if $k \otimes_A (M \otimes_A N) = 0$, where $k = A/a$
$M,N,k$ are $A$ - modules
Then $M_k \otimes_k N_k = 0$ where $M_k = k \otimes_A M$, $N_k = k \otimes_A N$
I can see that $a \subset \operatorname{Ann}(M_k)$ so that is how $M_k$ and $N_k$ become $k$ - modules
The confusion that is coming is that because the "base ring" has changed from $A$ to $k=A/a$
Any kind of universal property of tensor product or whatever that I want to use is rendered useless
Sorry I forgot to say that $A$ is a local ring with maximal ideal $a$
If I write out the definition of $M_k \otimes_k N_k$
It is $(M \otimes_A k) \otimes_k (k \otimes_A N)$
Can I say that this is isomorphic to $M \otimes_A \bigg( k \otimes_k (k \otimes_A N) \bigg)$ ?
 
8:40 AM
Morning folks.
 
@KannappanSampath Want to try to answer the above?
 
@BenjaminLim Hey, I have not learnt or come to tensor products as yet.
 
@KannappanSampath It is really confusing!!
 
Yes, I have been told it is, by you and others but I am keeping my head cool for now, ;)
 
@KannappanSampath Brace yourself
 
8:46 AM
:)
 
9:20 AM
Good morning.
 
10:36 AM
Hi guys
aw, this is quite good: automata.rwth-aachen.de/teaching/videos.en it's a shame it's not open to public
 
10:47 AM
@tb No worries I got it now it comes from extension of scalars :D :D :D
@KannappanSampath Wait till you have to deal with tensor products over different base rings, a lot of fun :D
 
user19161
11:04 AM
@BenjaminLim Wow, three consecutive smiles. You must be very happy this Easter!
 
No I'm not. Too many people getting drunk, this pisses me badly
 
user19161
Why do drunk people piss you badly? Is it because they piss on you?
 
@JasperLoy No pun intended before.
 
user19161
@BenjaminLim Wait do you mean pun?
 
user19161
11:08 AM
I asked because t and n are quite far apart. It was a weird typo.
 
i'm really tired got really maggot yesterday :D
 
user19161
@BenjaminLim Congrats! Do you have a girlfriend?
 
no never had one in my life
@JasperLoy do you know what getting maggot means?
 
user19161
Same, haha.
 
user19161
@BenjaminLim I read the transcript. It is some kind of stupid drunk dance or something.
 
11:12 AM
no it means getting drunk
@JasperLoy where are you now in the world?
 
user19161
@BenjaminLim Singapore.
 
are you singaporean?
 
user19161
Yes.
 
user19161
@Daniil Looks deep.
 
11:15 AM
infinite words & automata is probably the only "research-level" area I've been studying :(
@JasperLoy nice userpic you've got
 
user19161
@Daniil So you are into logic?
 
hahahaha
 
user19161
@Daniil Oh I am a Belieber.
 
user19161
@BenjaminLim I guess that was for the JB pic.
 
@JasperLoy I am into intersection of logic and CS, really.
belieber, lol
 
user19161
11:17 AM
Perhaps he represents the childhood I missed...
 
How is it going ? =)
 
user19161
@N3buchadnezzar Hey! Did you get drunk over the weekend?
 
@JasperLoy Totally yesterday, I am taking it slow today.
 
@JasperLoy Cody Simpson 143 :D :D youtube.com/watch?v=MYRNGeIJMiQ&ob=av2e
 
My friend cam back from Russia with Energy Drinks with 8% alcohol...
 
user19161
11:19 AM
@N3buchadnezzar Good. Just remember: if you drink, don't drive. If you drive, don't drink.
 
Don't drink and drive, think and derive =)
 
user19161
I just had some tequila with my friend the past few days. We mixed it with fruit juice.
 
Hello
 
We had 1l litre of Vodka, but it was plenty with all the energy drinks and cider.
 
user19161
11:21 AM
@BenjaminLim Ah, I think I only heard about him once.
 
143 = I love you
 
user19161
@N3buchadnezzar That deserves a star but I don't do stars.
 
It is impossible for me to get drunk on beer, haha.
Energy drinks with 8% ftw
 
you russian?
 
Norwegian
 
user19161
11:23 AM
Someone said with reference to vodka in the other room: bucketwise is not wise.
 
@N3buchadnezzar ah ok
 
@JasperLoy A bucket of Vodka is always wise.
 
user19161
So is that you in the pic @ben?
 
@JasperLoy yes at royal national park, sydney
 
user19161
11:25 AM
@N3buchadnezzar That's for vomiting after drinking.
 
@JasperLoy Then you need to empty it for vodka first =)
 
user19161
@BenjaminLim I had a prof from Australia. He drinks apple juice during lectures. He has a whole carton in his office.
 
I love apple juice, and orange juice.
Btw, is there anyone here good at using maple ?
 
user19161
I remember the three m's are not free: maple mathematica matlab
 
user19161
Good thing the two l's are free: linux latex
 
11:30 AM
At university they are free. We need to learn to use maple and matlab.
 
user19161
@N3buchadnezzar Of course, because the university has paid for it!
 
@JasperLoy ^^
 
user19161
TV and dinner time!
 
If you visit a shady pub in a pirate bay, I think you can find a free version too,
 
@JasperLoy Your surname does not sound singaporean
 

« first day (613 days earlier)      last day (4415 days later) »