« first day (2540 days earlier)      last day (2776 days later) » 

22:00
I see that @Alessandro's amoeba is here, too
Hi @TedShifrin
:D
heya @Maks
I would like to know what the group operation for the dihedral group is
What do you mean, @isaac9A?
Composition of functions, if I think of it as geometric symmetries.
@TedShifrin What is the binary operation or function that takes two elements of D2n and returns an element also in D2n?
22:04
I just answered that.
You tell me how you're defining the group. I told you how I am.
hi Semiclassic
5
Q: I would like help identifying the rigorous classification of this 'surface' geometry based on my interpretation of 3D models.

TyphonI want to try and identify a geometric structure I thought up while doing some weird stuff with making things walk on the surface of a 3D model and trying to incorporate backface culling into the surface geometry itself. See, in computer graphics each side of a polygon or triangle are considered ...

looking for advice on who to award the bounty
@TedShifrin so if r is the element gotten by rotating clockwise 2pi/n degrees in D2n and s is the element gotten by reflecting then rs is just "do r" then "do s"?
i.e. function composition
Precisely ... if you're thinking of actual geometric symmetries of a regular $n$-gon. Yes.
22:08
the set of elements in D2n are geometric symmetries of a regular nn-gon
It could be the reverse order theoretically
Some books will have rs as "do s" and then "do r"
It really doesn't matter all that much, though
oh, that would be what I meant.
I didn't read carefully what isaac said.
@AkivaWeinberger awesome thanks! also sr = rs^-1 correct?
22:10
@isaac: your way, if you try to do it with matrices, for example, you'll have to operate on vectors on the right. I should have read more carefully. You ordinarily want $rs$ to mean $r\circ s$, so you start with $s$ and then do $r$.
@isaac9A That sounds about right
Did you learn what an isomorphism is yet?
Yeah
It doesn't matter which direction you interpret "rs" to mean, because the resulting groups are isomorphic
i.e. every group of order four is isomorphic to either the cyclic group of order 4 or the klein 4 group under some function
@AkivaWeinberger I proved that the rational coefficient polynomials have a division theorem
*monic
I believe I can prove my statement now
Division theorem meaning they're a Euclidean domain, yeah?
it is as simple as follows
@AkivaWeinberger yeah
DogAteMy: True, but it drove me nuts when Herstein (for example) wrote his functions acting on the right: $(x)f$, etc.
22:15
1. all quadratic rationals are solutions to some rational second order polynomial 2. the multiplication of non-monic integer coefficient polynomials is a non-monic integer coefficient polynomial. 3. Need to relate the "1" to "2" in such a way as to cause a contradiction if I suppose not.
Am I on the right track @AkivaWeinberger
(That's actually a chess notation; it means "??!!")
4
@AkivaWeinberger eeerrr.... that's the same thing.
@Typhon Yeah, I think so. Though note that there actually is an exception to 2; if you multiply two things with leading coefficient -1, you get something monic.
Pretty certain I make a move like that every time I try and play chess.
Like $(-x+2)(-x^2+x)$ or something
22:17
@AkivaWeinberger true, but those are monic if we consider algebra to be a thing.
I'm 80% sure I know what you mean.
-x + 2 = 0
therefore
x - 2 = 0
therefore x - 2 = -x + 2
in the sense of polynomial equivalency
I don't quite think it works like that
how so?
polynomials are uniquely defined by their solution sets
Up to multiplication by constants.
22:19
@AkivaWeinberger those are all equivalent
Oh, OK, sure I guess
I didn't know what "equivalent" meant
1/2 x^2 + 1/2 x + 1/2 is still a monic polynomials
it is equivalent to x^2 + x + 1
I don't think so
Pretty sure "monic" is not a property preserved by that equivalence
they both have the same solutions
Doesn't matter
22:20
I would argue that it is a sort of monicity
or perhaps monicity simply means that the leading coefficient divides all other coefficients?
@Typhon Perhaps. But then the notion of monic-ness becomes a useless concept in Q[x]
@AkivaWeinberger but indeed it is.
it is only a minor shortcut in some cases
Fair
In any case, you do seem to be on the right track
I would argue that monicity is primarily useful for Z[x]
okay thanks
and I'd post a Q & A on here regarding this stuff...
but I'm currently showing off the stuff to some other people and transcribing proofs from that place is.... tedious.
I'm pretty sure it is called "quadratic irrational" and not "quadratic rational," by the way
22:23
@AkivaWeinberger quadratic rational is my name for things of the form a + bx where x is a solution to a quadratic monic integer coefficient equation and a and b are rationals.
it is a made up term
I literally thought it up
i finnally figure out wth a binary function was
and irrational makes little sense. They are fields and they are done by appending to the rationals
@Faust7 it is another name for multivariate, right?
@AkivaWeinberger the proofs are being written on these
@TedShifrin Lol, I remember when Herstein first introduced permutations and was like
@Typhon That's equivalent to saying "it satisfies a quadratic with rational coefficients"
well mostly but the context of the guys question i finnaly understand what he was saying =P
22:26
Yeah we're not even gonna be consistent about mappings in general, but permutations are on the right, "as algebraists do"
Proof: Let $\bar\alpha$ be its conjugate. Then $(x-\alpha)(x-\bar\alpha)$ is a quadratic with rational coefficients @Typhon
that $\alpha$ is a root of
For the converse,
@AkivaWeinberger I know, but I prefer to phrase it in the same form as the quadratic integers and quadratic rings. XD
and let the solutions to polynomials thing be a proof
I am well aware of that, in fact.
(Cont'd) we'd need to show that if something is the root of a (possibly non-monic, possibly non-integer) quadratic, then it can be written as $ax+b$ where $x$ is the root of a yes monic yes integer quadratic
which is not too hard I think
@AkivaWeinberger oh yeah, the reason I need to show the quadratic rational solutions to integer coefficient monic polynomials is because I seek to prove that all rings Z[\sqrt{b}] are integrally closed when b = 1 (mod 3)
I was able to prove for quadratic equations
but.... higher order is beyond me so I assumed that maybe all solutions are solutions to quadratic polynhomials
if that makes sense
"Quadratic irrational" seems to be a generally accepted term, though it looks like it excludes rationals
22:31
that is completely different than my thing
that's like the idea of algebraic integers
and algebraic rationals
Yeah, the naming does seem a bit inconsistent
but it's the things that are roots of quadratics with rational coefficients, and as we just discussed, it's equivalent
if x satisfies the polynomial p, then a + bx satisfies the polynomial p((x-a)/b) which has rational coefficients
^^all you need to state to prove your claim
Oh, whoops
fixed
Well the converse is still a thing I guess
22:33
i mean, there's a little algebra missing there
but it is good enough
i mean, you can expand p I suppose.
regardless
for each x, there is a separate quadratic field and ring
the article you linked lumps them all as the same set
along with your statement of "they are just solutions to rationally coefficient polynomials"
those are insufficient to capture the idea of them being separate fields
it lumps them all together
:p
By "the quadratic ring," you mean Z[x]?
Or Q[x]
Z[x]
Oh, OK, good
22:36
cause Z[x] is a ring and not a field
oops
whereas Q[x] is both
anyways
@AkivaWeinberger I seek to prove that Q[\sqrt{b}] only has Z[\sqrt{b}] solutions in monic integer coefficient polynomials when b = 1 (mod 4).
any suggestions?
aside from using the polynomial stuff and proving for the quadratic equations?
@AkivaWeinberger hello?
@Typhon I'm confused
@AkivaWeinberger ok
let me be more rigorous
$x^2-x-1$ has a root of $\dfrac{1+\sqrt5}2$, but it's not in $\Bbb Z[\sqrt5]$
and it's in $\Bbb Q[\sqrt5]$
22:46
im sorry
and $5\equiv1\pmod4$
b = 3 (mod 4)
Ohh
So you just want to show that stuff like the above can't happen when $b\equiv3\pmod4$
Hm. The fact that the root of $ax^2+bx+c$ is in $\Bbb Z[\sqrt{b^2-4ac}]/2$, and that $b^2-4ac\not\equiv3\pmod4$, seems relevant
a is 1
22:49
and there are no b's in z/4 such that b^2 equivalent to 3 mod 4
Therefore, you wont find any quadratic counterexamples.
That's what I said
I desire to go further.
I know but i was already saying it and I got distracted.
Z/2 is modular arithmetic 2.
did you mean Z[1/2]?
I meant all the stuff in that set divided by two
oh
well Set/n is modular arithmetic notation
as in set element = _ (mod n)
I've usually seen $\Bbb Z/n\Bbb Z$ or $\Bbb Z_n$
22:51
oooh
maybe it was subscript
darnit
yer right
The stuff in $\Bbb Q[\sqrt b]$ are all quadratic stuff (roots of possibly non-monic quadratics with integer coefficients)
anyways, my problem is that i can prove it (and have) for quadratic polynomials. What now?
so the same logic applies, no?
Just with $a$ not necessarily equal to $1$.
We still have that $b^2-4ac$ is never $3$ mod $4$.
uuuh
wat
I wish to prove it for non-quadratic polynomials that are monic
22:54
not non-monic quadratic polynomials
Whoops
Got it
slaps @AkivaWeinberger in the back of the head
brains dude
:-)
You have no right to do that!
You're not Ted!
22:54
I watched NCIS
that gives me the right
—So that's why you want to show that "root of quadratic (in $\Bbb Q[x]$)" and "root of monic (in $\Bbb Z[x]$)" imply "root of monic quadratic (in $\Bbb Z[x]$)"
um what
Hey friends! I'm back. With another proof problem if you guys are available to help or want to take a break from your current math problem :) math.stackexchange.com/questions/2363237/…
22:56
that's not what I seek to prove
@JohnLocke He was replying to me
also no @JohnLocke
ahh sorry for interjecting!
@AkivaWeinberger is both an option?
22:57
Maybe later
yeah maybe later
Okay, thanks!
@Typhon But wouldn't that imply what you're trying to prove now?
And isn't that what you were trying to prove earlier today?
@AkivaWeinberger no I wish to show that root of quadratic with rational coefficients and root of monic with integer coefficients (irregardless of being in Z[x]) implies being root in monic with integer coefficients as that completes the proof.
you were slightly off.
I think
@AkivaWeinberger It is. I'm still stuck. You said to start with a division theorem.
for polynomials.
I got that covered. Now what?
@Typhon What? "Integer coefficients" and "in $\Bbb Z[x]$" are the same
Here $x$ is just the variable of the polynomial
23:00
@AkivaWeinberger In Z[x] means it is a quadratic integer which is what we are trying to prove.
XD
unless you meant a different Z[x]?
Z[x] is the set of polynomials with *integer coefficients
lmao
that makes more sense now
In any case
We need names
yeah,proving that would serve as using Mjolnir to pound in plastic toy nails.
Call our quadratic polynomial $q(x)$ and our Monica polynomial $m(x)$
23:02
"Monica"
(Leaving it in)
mimic polynomial*
Monic
not mimic
$m$ clearly has degree $\ge2$
@AkivaWeinberger of course.
23:03
>thinks I'm serious
@Typhon Clearly you missed the conversation about this from earlier
Let us define $f(x)$ to be the Dirichlet function:
$$f(x)=\begin{cases}1,&x\in\mathbb Q\\0,&x\notin\mathbb Q\end{cases}$$
How do we prove that:
$$\forall x\in\mathbb Q\implies \lim_{h\to0}\frac{f(x+h)-f(x-h)}h\text{ exists}$$
$$\forall x\notin\mathbb Q\implies \lim_{h\to0}\frac{f(x+h)-f(x-h)}h\text{ doesn't exist}$$
ooooh
are we about to use the division theorem?
@SimplyBeautifulArt Two cases. $h$ is rational or it isn't
@SimplyBeautifulArt sup maam?
23:04
For the first one at least
I think I see how to do the second one
@AkivaWeinberger I don't know. Taken from Wikipedia
The idea is that irrational+irrational might be rational and might be irrational
@SimplyBeautifulArt Don't know what?
I was saying how to do the first one
@AkivaWeinberger Oh, nvm
@Typhon Yeah divide $m$ over $p$, remember that they have a common root
Ah yes, the first one is easy, I do see it now
23:05
Let's call it $\alpha$, actually, why not
The irrational we're thinking about
@AkivaWeinberger I'm not sure how dividing is helpful?
What does it get you?
Remember the formula for the division algorithm
It's like $m(x)=A(x)p(x)+R(x)$ or something, right? @Typhon
let n be the difference of the orders of m and q. Then q = x^nm + q-x^nm?
@AkivaWeinberger yeah....
And the degree of $R$ is less than the degree of $p$
yeah....
23:07
which means it's either linear or constant
First I want to say that $R$ has to be zero
hold on
let me think for a moment here
If $x$ is irrational and $h$ is rational, then
$$\frac{f(x+h)-f(x-h)}h=0$$
@Typhon You do that. I'll walk home and catch you in 10-15 minutes
i'll be gine then
i think I screwed up in my division theorem proof
I proved there is an r with order lesser than q for one of my cases
f********
If $h$ is irrational and $x+h$ is rational, then $x-h=(x+h)-2h$ is irrational, so
$$\frac{f(x+h)-f(x-h)}h= \frac1h$$
So as $h\to0$ here, the limit fails to exist
23:11
@SimplyBeautifulArt examining funky derivative operators I see.
@SimplyBeautifulArt That's my forte, not yours.
don't steal my thunder.
overuse of emojis is my thing as well
stop stealing mah thunder
Hi. I'd like to find such $f$ that $f(x)f(y)=g(|x-y|)$ for some nonconstant $g$ and all natural $x$ and $y$, including zero. Any suggestions? Perhaps there isn't one
@Julius If it holds for all $x,y$, just set $y=0$.
To find $f(0)$, set $x=y=0$

« first day (2540 days earlier)      last day (2776 days later) »