Sniffnoy comments on Bizarre Illusions - Less Wrong

11 Post author: MrHen 27 January 2010 06:25PM

You are viewing a comment permalink. View the original post to see all comments and the full post content.

Comments (305)

You are viewing a single comment's thread. Show more comments above.

Comment author: Sniffnoy 28 January 2010 01:43:25AM *  14 points [-]

I think you're really failing to grasp the content of the unique factorization theorem here. Firstly we don't think about factored numbers as products of primes up to permutation, we think of them as products of distinct prime powers (up to permutation, I suppose - but it's probably better here to just take a commutative viewpoint and not regard "up to permutation" as worth specifying). But more importantly, you need to take a multiary view of multiplication here, not a binary one. 1 is the empty product, so in particular, it is the product of no primes, or the product of each prime to the 0th power. That is its unique prime factorization. To take 1 as a prime would be like having bases for vector spaces include 0. Almost exactly like it - if we take the Z-module of positive rationals under multiplication, the set of primes forms a free basis; 1 is the zero element.

Comment author: byrnema 28 January 2010 04:52:13PM *  2 points [-]

Information and expertise like this is why hanging out at Less Wrong is worth the time. I estimate that I value the information in your comment at about $35, meaning my present self would advise my former self to pay up to $35 to read it.

So, I get it. My brain is more wired for analysis than algebra; so this isn't the first time that linear algebra has been a useful bridge for me. I see that we could have a 'vector space' of infinite-dimensional vectors where each vector (a1, a2, ..., an, ...) represents a number N where N = (P1^a1)(P2^a2)...(Pn^an)... and Pi are the ordered primes. Clearly 1 is the zero element and would never be a basis element.

I should admit here that my background in algebra is weak and I have no idea how you would need to modify the notion of 'vector space' to make certain things line up. But I can already speculate on how the choice of the "scalar field" for specifying the a_i would have interesting consequences:

  • non-negative integer 'scalar field' --> the positive integers,
  • all integers 'scalar field' --> positive rational numbers,
  • complex integers --> finally include the negative rationals.

I'd like to read more. What sub-field of mathematics is this?

Comment author: Zack_M_Davis 08 February 2010 10:05:35AM 0 points [-]

I see that we could have a 'vector space' of infinite-dimensional vectors where each vector (a1, a2, ..., an, ...) represents a number N where N = (P1^a1)(P2^a2)...(Pn^an)... and Pi are the ordered primes.

Oh! And orthogonal vectors are relatively prime!

Comment author: ciphergoth 08 February 2010 11:15:17AM 1 point [-]

I'm not sure that the idea of orthogonality is defined for modules, is it? Is there a standard definition of an inner product for a Z-module?

Comment author: komponisto 08 February 2010 06:49:48PM 1 point [-]

I'm not sure that the idea of orthogonality is defined for modules, is it? Is there a standard definition of an inner product for a Z-module?

Yes; the same definition works. See here.

Comment author: Zack_M_Davis 09 February 2010 12:05:14AM 0 points [-]

Yay! I actually got something right!

Comment author: thomblake 28 January 2010 05:07:58PM 0 points [-]

What sub-field of mathematics is this?

Number theory, ne? Or is that too general?

Comment author: Blueberry 28 January 2010 05:57:34PM 2 points [-]

It looks like it's more abstract algebra (possibly applied to number theory) that byrnema is interested in. Check out Wikipedia on module.

Comment author: byrnema 28 January 2010 06:32:53PM 1 point [-]

Precisely! Thanks also.

Comment author: byrnema 28 January 2010 05:33:24PM *  1 point [-]

A second comment...

You've certainly convinced me that '1' should not be included in the set of things that are used to uniquely factor numbers. However, how I can I know if this set is the set of "primes"?

I guess I was thinking that the essence of primes was about their irreducibility/atomic-ness. The number 5 would be considered prime because you can't describe it multiplicatively in any way except by using the number 5. Using my preferred notion, the number 0 and the number -1 would also be "prime" (as Mr Hen guessed). Is there a different word for this concept?

Comment author: GuySrinivasan 28 January 2010 05:47:59PM *  1 point [-]

See wikipedia on natural generalizations of prime numbers. In particular note that most of the definitions say "units" instead of "1", like "Irreducible elements are ones which cannot be written as a product of two ring elements that are not units." which rules out 0 for the integers, +, x and includes the possibility of multiple units (-1 and 1).

I don't know offhand of any nice, commonly referenced property P(S,O) that is: A,x,y in a structure S with operation O: A is P just when if x O y = A then either x = A or y = A. Which I believe is the general property you're thinking about?

Edit: with O commutative I do believe

Comment author: byrnema 28 January 2010 05:56:55PM 0 points [-]

Thank you. And yes, that is the property.

Comment author: MrHen 28 January 2010 04:58:05AM *  0 points [-]

For some reason, I never imagined factors this way.

18 = 3^2 * 2^1
97,020 = 2^2 * 3^2 * 5 * 7^2 * 11

I suppose I have seen them printed out that way, but the deeper structure there never clicked. Cool.

Comment author: ciphergoth 28 January 2010 08:27:20AM *  1 point [-]

As it happens I'm partway through "An Introduction to the Theory of Numbers" by Niven, Zuckerman, and Montgomery at the moment. Lots of problems are incredibly easy to solve given this structure. The example that springs to mind is the very straightforward proof why the combinatorial formula n! / (r! (n-r)!) always gives you an integer.

Update: Well having been scored up I feel like I should give a hint on the actual proof: for any prime p and any n, the greatest power of p that divides n is

\sigma_{i=1}^{\infty} floor( \over{n}{p^i} )

and for any real numbers a, b, floor(a + b) >= floor(a) + floor(b).

Oh for real TeX markup!

Comment author: MrHen 28 January 2010 05:12:39PM 0 points [-]

Do you recommend the book? If I were interested in the subject, is this good to pick up or can you think of a better option?

Comment author: ciphergoth 28 January 2010 06:10:59PM 0 points [-]

I'm enjoying it, but it touches on abstract algebra as an alternative approach rather than leaning on it for everything; I'd kind of prefer the latter.

Comment author: MrHen 28 January 2010 06:40:17PM *  1 point [-]

You may be a good person to ask this question:

I was wondering if there was a function f(x, y, z) so that x and z represent the left and right sides of common mathematic operators and y represents the level of operation. So f(1, 2, 4) would be 1 + 4 and f(2, 2, 4) would be 2 * 4. Better versions of f(x, y, z) would have fewer end cases hardcoded into it.

The reason behind this is to handle operator levels greater than addition, multiplication, and exponents. The casual analysis from my grade school and undergrad level math shows the pattern that multiplication is repeated addition and exponents are repeated multiplication.

My quick attempts at coming up with such a function are spiraling into greater and greater complexities. I figured someone else has to have thought about this. Do you know of a place I can start reading up on ideas similar to this? Is what I am doing even plausible?

Quick thoughts based on me playing around:

  • Addition may be level 0, not level 1
  • The sequences never really look exactly like multiplication tables, but the patterns are similar enough to appease me
  • Ideally, everything can be reduced to the simple concept of X + 1 so as to walk along the number line
  • In practical terms, I have no idea how to express "negative" levels. Division and roots are unapproachable at this point in my playing around.
Comment author: Blueberry 28 January 2010 06:49:26PM *  4 points [-]
Comment author: MrHen 28 January 2010 06:59:25PM *  0 points [-]

Cool, thanks. It seems like one of my first tries was producing numbers similar to the Ackermann function. Knuth's arrow notation essentially takes over after multiplication. But those two articles will give me enough to read to keep moving on. :)

Do you know of any that go the other way into smaller and smaller numbers?

EDIT: I found the right subject name through links on your links. It is called hyperoperation.

Comment author: Blueberry 28 January 2010 07:00:22PM *  1 point [-]

1 / Ackermann function.

Comment author: MrHen 28 January 2010 07:06:42PM 0 points [-]

Sure, that works, but it isn't exactly what I am looking for. Is it possible to express the division operator in a manner similar to how multiplication can be expressed using addition? My instinct is telling me probably not.

Comment author: pdf23ds 28 January 2010 06:55:50PM *  1 point [-]

Hyper operators. You can represent even bigger numbers with Conway chained arrow notation. Eliezer's 3^^^^3 is a form of hyper operator notation, where ^ is exponentiation, ^^ is tetration, ^^^ is pentation, etc.

If you've ever looked into really big numbers, you'll find info about Ackermann's function, which is trivially convertable to hyper notation. There's also Busy Beaver numbers, which grow faster than any computable function.

Comment author: MrHen 28 January 2010 07:07:33PM 0 points [-]

Yes, this is exactly what I was looking for. Thank you.