Wikipedia:Reference desk/Archives/Mathematics/2010 March 4

Mathematics desk
< March 3 << Feb | March | Apr >> March 5 >
Welcome to the Wikipedia Mathematics Reference Desk Archives
The page you are currently viewing is an archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.


March 4

edit

Simplifying an expression involving radicals

edit

Hello Math Reference Desk. I'm continuing to wrangle with algebraic numbers of small degree. I've got this horrible function:

 ,

and I know that  . I just can't figure out how to carry out the simplification. I can equivalently get the same result with:

 ,

but I don't know if that helps. It still doesn't look square under that radical, even with even powers. Maple simplifies it to 1, but doesn't say how. This feels like a dumb question, but oh well. Thanks in advance for any insights. -GTBacchus(talk) 04:30, 4 March 2010 (UTC)[reply]

If what you want is to prove that  , you can write   and solve for a (by moving to one side and squaring). You'll get an equation for a for which one solution is 1 and the other you need to show is invalid (more detail: You get to   which is true iff   and  . The latter turns out to be  .   satisfies both conditions).
A technique that might generalize a bit better is to let  , where  , and solve for a, b and c. You get   which should be solvable with some work. -- Meni Rosenfeld (talk) 08:40, 4 March 2010 (UTC)[reply]
I equivalenced the sides so I got the radical should equal  . Squaring that and substituting for x3 gave something near to what was under the radical sign except I got  . Dmcq (talk) 09:40, 4 March 2010 (UTC)[reply]
I had to rush off and did my sums wrong. It does come out to the original expression under the radical. I somehow missed out a factor of two in the product for the 6 and 2x when I should have got 24x. Rushing is not good idea for doing things right. Dmcq (talk) 14:06, 4 March 2010 (UTC)[reply]
That is the right approach. Starting from
 
when   we have
 
so
 
and, taking the positive valued root, we have
 
Gandalf61 (talk) 11:05, 4 March 2010 (UTC)[reply]

Awesome. Proving that   is a solution, I could already do. This technique for getting there makes perfect sense, and I can generalize it to similar questions. Thank you all very much! -GTBacchus(talk) 15:39, 4 March 2010 (UTC)[reply]

Vectors

edit

I originally asked this question in the science reference desk, but they suggested that I repost it here.

To my current understanding, a "quantity with direction" isn't necessarily a vector. It must also satisfy certain criteria, such as commutativity under addition and rotational invariance (are these the only ones?). With this in mind, how would one prove that angular velocity is a vector? I was already able to show that infinitesimal rotations commute under addition, implying that ω = dθ_x/dt i + dθ_y/dt j + dθ_z/dt k should likewise commute under addition. My problem is showing that it's invariant under rotation. Secondly, how could one prove that the cross product is a vector? Thanks. —Preceding unsigned comment added by 173.179.59.66 (talk) 15:40, 4 March 2010 (UTC)[reply]

If you're trying to prove that angular velocity is a vector, you need to start by stating your definition of what angular velocity is. If the angular velocity of an object is defined so that it is an element of a vector space, then angular velocity is a vector. If it is defined in some other way, it is not a vector. Everything will come down to the definition. If you are asking about the physics definition of a "vector" (which is an entirely different concept), you may want to look at Pseudovector#Details. — Carl (CBM · talk) 16:34, 4 March 2010 (UTC)[reply]
I'm asking about the physics definition of a vector. The article discusses the issues I'm talking about (covariance and such), but I don't know how to apply that to the problem at hand... —Preceding unsigned comment added by 173.179.59.66 (talk) 20:21, 4 March 2010 (UTC)[reply]
Start with the formula in terms of the cross product
 
Applying a proper rotation is the same as multiplying the velocity and position vectors by some matrix R of determinant 1. It seems to me that
 
However, I have only thought about this for 30 seconds, and I am not very knowledgeable about physics. Try asking your professor. — Carl (CBM · talk) 13:43, 5 March 2010 (UTC)[reply]
I'm not too sure that would work, because that equation isn't a definition; it's derived from the assumption that ω is a vector. —Preceding unsigned comment added by 173.179.59.66 (talk) 20:54, 5 March 2010 (UTC)[reply]
That takes you back to my original comment: If you're trying to prove that angular velocity is a vector, you need to start by stating your definition of what angular velocity is. — Carl (CBM · talk) 21:17, 5 March 2010 (UTC)[reply]
Well, it's clear that a scalar is inadequate to describe angular velocity. We could have rotation in any combination of three independent planes (call them x = 0, y = 0, z = 0 in a Cartesian coordinate system if you wish). That implies that we need three numbers to describe angular velocity; that is, a vector. Alternatively, the more intuitive view of it is nicer—we define it such that the vector points out of the plane of rotation. Of course, there's an ambiguity in this (you could pick the vector pointing in the opposite direction), so by convention we pick one of them. This is why angular velocity is a pseudovector, and can pick up obnoxious sign changes upon reflections. — Zazou 00:05, 6 March 2010 (UTC)[reply]

Small lie brackets and commutators

edit

Is there an easy way to prove that if the Lie bracket of two vector fields   is small then also the commutator of the correspondig flows   is small for fixed s and t?--Pokipsy76 (talk) 18:36, 4 March 2010 (UTC)[reply]

Random walk

edit

Given a simple random walk, s0 = 0, and with probability of 1/2 either sn+1 = sn + 1 or sn+1 = sn - 1, is there a simple expression, or an asymptotic expression (for large n) for the probability that no negative number occurred after n steps? I don't really know how to count the paths in an efficient way. Thanks in advance. Icek (talk) 18:57, 4 March 2010 (UTC)[reply]

The combinatorial argument escapes me as well, so I went with a more analytical approach: Denote  . Then  . Numerically it can be observed that for   we have  . With Stirling you get  . -- Meni Rosenfeld (talk) 19:21, 4 March 2010 (UTC)[reply]
Check Bertrand's ballot theorem.--Pokipsy76 (talk) 19:25, 4 March 2010 (UTC)[reply]