Commutative Monoid and some properties

  • Thread starter Kindayr
  • Start date
  • Tags
    Properties
In summary: I am sorry for not responding or replying to questions. My purpose is to provide a summary of the conversation and nothing more. In summary, the conversation discussed the set of all \infty-tuples of the form (n_{1}, n_{2}, \dots) with n_{i}\in \mathbb N ,\,\forall i, and its subset \mathbb N^{*}=\{1,2,3,\dots\}. The conversation also introduced a function \phi that maps elements from \mathbb N^{*} to \mathbb N^{\infty}, and a binary operation \oplus that is both commutative and associative on \mathbb N^{\in
  • #36
micromass said:
Hmm, I'm not sure how you would generalize all of this to algebraic numbers. But it does make sense what you're saying...

I guess I would I would have to prove a sort of analogous Fundamental Theorem of Arithmetic to the non-zero algebraics? If I can do that then I hope it all works, and I would just have to prove it to be a vector space, correct?

I never expected myself to get into doing this much for such a trivial idea I began with lol! Considering how little algebraic background I have outside of linear algebra.
 
Mathematics news on Phys.org
  • #37
Kindayr said:
I guess I would I would have to prove a sort of analogous Fundamental Theorem of Arithmetic to the non-zero algebraics? If I can do that then I hope it all works, and I would just have to prove it to be a vector space, correct?

I think such a thing would be very hard, if not impossible :frown:

I never expected myself to get into doing this much for such a trivial idea I began with lol! Considering how little algebraic background I have outside of linear algebra.

Hey, this is the perfect way to learn something more about algebra! You're doing great!
 
  • #38
As a last attempt, what if we just generalize to the set

[tex]\mathbb{A}^{*}=\{a^{b}:a,b\in\mathbb{Q}^{*}\}[/tex]

I would have to show this to be a field obviously.
 
  • #39
Kindayr said:
As a last attempt, what if we just generalize to the set

[tex]\mathbb{A}^{*}=\{a^{b}:a,b\in\mathbb{Q}^{*}\}[/tex]

I would have to show this to be a field obviously.

That seems plausible. Don't know if it'll be a field, though...
 
  • #40
micromass said:
That seems plausible. Don't know if it'll be a field, though...

I agree, I don't think its closed under addition.

I guess I never really tried [itex]\mathbb{Z}_{p}[/itex]. Or even the set [itex]\mathbb{Q}[\mathbb{Z}_{p}]=\{a^{b}|a,b\in\mathbb{Z}_{p}\}[/itex]. Which would be closed under addition (I'd hav to prove it) I guess since every [itex]a^{b}\equiv c<p[/itex], so we would have [itex]a^{b}+c^{d}\equiv e+f\equiv g[/itex] with [itex]e,f,g\leq p[/itex], or something like that.
 
  • #41
So working I've got some weird results, that i'll type later when you fix a [itex]p>0[/itex] prime, and define [itex]\phi_{p}:\mathbb{Z}_{p}^{*}\to\mathbb{Z}_{p}^{n}[/itex] where [itex]1<p_{1}<p_{2}<\cdots <p_{n}<p[/itex] are all primes less than [itex]p[/itex].

I can show this to be a vector space, which is good. But you get weird equivalences when you work in [itex]\mathbb{Z}_{p}^{n}[/itex], that are just blowing my mind a little as I write them down on paper. Which get even weirder when you move to [itex]\mathbb{P}_{n} [\mathbb{Z}_{p}[/itex].

I'll type it all up when I get home.
 
  • #42
Hmm, "weird equivalences", I'm wondering about what you will type up :smile:
 
  • #43
Well its trivial to show that, from the same [itex]p[/itex] and [itex]n[/itex] defined before that [itex]\phi_{p}:\mathbb{Z}_{p}^{*}\to\mathbb{Z}^{n}_{p}[/itex] is an isomorphism. This is seen since if [itex]a\in\mathbb{Z}_{p}^{*}[/itex] then [itex]a[/itex] has a prime factorization such that [tex]a=\prod^{n}_{k=1}p_{k}^{e_{k}}=p_{1}^{e_{1}}p_{2}^{e_{2}}\cdots p_{n}^{e_{n}}.[/tex] So let [itex]\phi_{p}(a)=(e_{1},\dots,e_{n})[/itex]. Its really easy to show its a vector space over field [itex]\mathbb{Z}_{p}[/itex]

Whats interesting is when you partition the set such that for any [itex]u,v\in\mathbb{Z}_{p}^{n}[/itex], we have [tex]u\simeq v \;\; iff \;\; \phi_{p}^{-1}(u)\equiv\phi_{p}^{-1}(v).[/tex]

If you use the definition of the isomorphism I've used before into the polynomials, with the same partition, you'll get weird things. For example, take p=7. Then n=3. So we have [tex]0\simeq3\simeq x+x^{2}\simeq2+2x\simeq\cdots[/tex]

I've worked with quotient spaces in linear algebra, and I though how that collapsed a vector space was weird, but this weirds me out even more.

Its probably not weird for someone who has taken abstract"er" algebra than I have, but still weird lol

I'll be typing this all up sometime tonight or tomorrow when I have time in a paper and more rigourously, but i have other plans tongiht so I won't be able to type everything up i worked out today (like my proof that its a vector space).

I feel even that [itex]\mathbb{Z}_{p}^{n}[/itex] collapses [itex]\mathbb{Q}^{n}[/itex]. Since any n-tuple's entries can be seen as a quotient a/b, but then since [itex]\mathbb{Z}_{p}[/itex] is a field, so this quotient exists as one of the p members of Z_p.

Maybe that's wrong.
 
  • #44
I don't quite see why [itex]\phi_p[/itex] is an isomorphism. That is, I see no reason why it should be surjective. Certainly something like (p-1,p-1,...,p-1) isn't reached?
 
  • #45
micromass said:
I don't quite see why [itex]\phi_p[/itex] is an isomorphism. That is, I see no reason why it should be surjective. Certainly something like (p-1,p-1,...,p-1) isn't reached?

Sure it does, it corresponds to [itex]p_{1}^{p-1}p_{2}^{p-1}\cdots p_{n}^{p-1}\equiv a[/itex] with [itex]0\leq a\leq p-1[/itex].

Wait crap, that makes it non-injective. URGH.

I need to sit down with someone else and work all of this out. I need to get back to university asap. BLARGH.
 
  • #46
Kindayr said:
Sure it does, it corresponds to [itex]p_{1}^{p-1}p_{2}^{p-1}\cdots p_{n}^{p-1}\equiv a[/itex] with [itex]0\leq a\leq p-1[/itex].

Wait crap, that makes it non-injective. URGH.

I need to sit down with someone else and work all of this out. I need to get back to university asap. BLARGH.

The problem is that you don't have a well-defined function, really.

[itex]\mathbb{Z}_p^*[/itex] has p-1 elements, and [itex]\mathbb{Z}_p^n[/itex] has [itex]p^n[/itex]elements. So there can never be a surjection. :frown:

Do you see a way to solve this??
 
  • #47
Okay, I'm meeting with my prof tomorrow, and I want to really see if this works:

Define [itex]\mathbb{A}^{*} =\{a^{b}:a,b\in\mathbb{Q}^{*}\}[/itex] and let [itex]\phi :\mathbb{A}^{*}\to\mathbb{Q}^{\infty}[/itex], where [itex]\mathbb{Q}^{\infty}[/itex] is the set of all [itex]\infty[/itex]-tuples with a finite amount of non-zero entries. Note that for any [itex]a^{b}\in\mathbb{A}^{*}[/itex] we have a prime factorization such that [tex]a^{b}=\prod_{k=1}^{\infty}p_{k}^{be_{k}}.[/tex] So define [itex]\phi(a^{b})=(be_{1},be_{2},\dots)=(be_{k})^{\infty}_{k=1}[/itex]. Also define, from before, [itex]\oplus:\mathbb{Q}^{\infty}\times\mathbb{Q}^{\infty}\to \mathbb{Q}^{\infty}[/itex] such that [tex](e_{1},e_{2},\dots)\oplus (f_{1}, f_{2},\dots)=(e_{k})^{\infty}_{k=1}\oplus (f_{k})^{\infty}_{k=1}=(e_{k}+f_{k})^{\infty}_{k=1}=(e_{1}+f_{1},e_{2}+f_{2},\dots).[/tex] Further, [itex]\phi[/itex] can be shown to be an isomorphism.

We can also show [itex]\mathbb{Q}^ {\infty}[/itex] to be a rational vector space. Note that the scalar multiplication of any vector in [itex]\mathbb{Q}^{\infty}[/itex] is analogous to raising the original element of [itex]\mathbb{A}^{*}[/itex] by a rational exponent (the rational exponent being the scalar). That is: [tex]\alpha(be_{k})^{\infty}_{k=1}\overset{\phi^{-1}}{=}a^{b^{\alpha}}=a^{b\alpha}.[/tex] Also note that [itex]\alpha(be_{k})^{\infty}_{k=1}=\alpha b(e_{k})_{k=1}^{\infty}=(\alpha be_{k})^{\infty}_{k=1}[/itex].

I didn't want to type everything out, but it seems to have worked.
 
Last edited:
  • #48
So I've met with my professor, and by the end we just were laughing at how simple and familiar it ended up working out to be.

No matter how hard I tried, I could not create a vector space, which is fine. The suddenly it came to us.

So here:

Let [itex](\mathbb{R}^{>0},\cdot)[/itex] be the abelian group of positive reals and multiplication, and let [itex](\mathbb{R},+)[/itex] be the abelian group of the reals over addition. Suppose there exists a function [itex]\log:(\mathbb{R}^{>0},\cdot)\to(\mathbb{R},+)[/itex] such that [itex]\log(ab)=\log(a)+\log(b)[/itex] and [itex]\log(a^{b})=b\log(a)[/itex]. Its clear that [itex]\log[/itex] was just the extension of what I was trying to do before. I guess you could say its the 'analytic jump' from what I was trying to do algebraically. This has given me some new intuition into how [itex]\log[/itex] works. That its 'sort of' rooted in prime factorization, but more general than that.

I thought this was really interesting. And I'm glad this is all over of me attempting to find something that wasn't there, but had some sort of 'transcendental' version that explains everything.

He gave me some homework to do, the first question being one that I could probably do my self with my current skill sets, and another I'll have to wait after I take Measure Theory in the Winter Semester.

The first is that:

  • If [itex]f:(\mathbb{R}^{>0},\cdot)\to(\mathbb{R},+)[/itex] continuously with the properties that [itex]f(ab)=f(a)+f(b)[/itex] and [itex]f(a^{b})=b\cdot f(a)[/itex] and [itex]f(1)=0[/itex], then [itex]f(x)=\log(x)[/itex]

  • There exist many non-measurable [itex]f:(\mathbb{R}^{>0},\cdot)\to(\mathbb{R},+)[/itex] with the properties [itex]f(ab)=f(a)+f(b)[/itex], [itex]f(a^{b})=b\cdot f(a)[/itex], and [itex]f(1)=0[/itex].

I hope to be able to do these sometime in the future, but we'll see what happens.

Thank you to everyone that has helped me! Especially micromass for putting up with my lack of education in abstract algebra and metric space topology. I swear I'll get better after this year when I finally get a formal introduction to everything! haha
 
  • #49
I'm very glad you have found an answer to your (very intriguing) question. I'm also happy that you learned a bit of new mathematics this way!

I hope you enjoyed thinking about this. These are the things that math research is all about :smile:
 

Similar threads

Replies
8
Views
3K
Replies
10
Views
2K
Replies
5
Views
2K
Replies
1
Views
1K
Replies
1
Views
937
Replies
5
Views
2K
Replies
5
Views
2K
Back
Top