Jump to content

Wikipedia:Reference desk/Mathematics

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 205.175.124.30 (talk) at 22:38, 19 February 2013 (→‎Tensors). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Welcome to the mathematics section
of the Wikipedia reference desk.
Select a section:
Want a faster answer?

Main page: Help searching Wikipedia

   

How can I get my question answered?

  • Select the section of the desk that best fits the general topic of your question (see the navigation column to the right).
  • Post your question to only one section, providing a short header that gives the topic of your question.
  • Type '~~~~' (that is, four tilde characters) at the end – this signs and dates your contribution so we know who wrote what and when.
  • Don't post personal contact information – it will be removed. Any answers will be provided here.
  • Please be as specific as possible, and include all relevant context – the usefulness of answers may depend on the context.
  • Note:
    • We don't answer (and may remove) questions that require medical diagnosis or legal advice.
    • We don't answer requests for opinions, predictions or debate.
    • We don't do your homework for you, though we'll help you past the stuck point.
    • We don't conduct original research or provide a free source of ideas, but we'll help you find information you need.



How do I answer a question?

Main page: Wikipedia:Reference desk/Guidelines

  • The best answers address the question directly, and back up facts with wikilinks and links to sources. Do not edit others' comments and do not give any medical or legal advice.
See also:


February 10

How to prove

How to prove that tan20⋅tan30=tan10⋅tan50 ? 117.227.40.234 (talk) 03:32, 10 February 2013 (UTC)[reply]

Are these in degrees ? If so, why not just multiply them out ? StuRat (talk) 03:34, 10 February 2013 (UTC)[reply]
Ya, they are in degrees. How I can I do it using tanA = cot(90-A)? 117.227.145.29 (talk) 03:47, 10 February 2013 (UTC)[reply]
Or some any other basic identities. 117.227.18.193 (talk) 06:06, 10 February 2013 (UTC)[reply]
((( My browser doesn't show the symbol used between the tans here, can someone say what it is please (* / + - ???) -- SGBailey (talk) 09:49, 10 February 2013 (UTC) )))[reply]
Hello, I think the symbol is meant to show multiplication, like latex's '\cdot' (in a hex editor it comes up as 0xB7 which is Unicode (UTF-16)'s 'MIDDLE DOT') so it's
.77.86.3.26 (talk) 10:44, 10 February 2013 (UTC)[reply]

There may be simpler ways, but here's an outline of mine. Multiply both sides by cos 20 cos 30 cos 10 cos 50 so that the entire identity deals only with sin and cos. Now using the product-to-sum formulas at Trigonometric_identity#Product-to-sum_and_sum-to-product_identities, you can get rid of the 20's and 30's entirely and only be left with angles of 10 and 50. Using the double-angle formulas, you can then replace some of the 50's with 100's. The 100's can in turn be replaced with 10's using the formulas for shifting by 90. Now it's not too hard to prove the identity. You'll still need an angle addition formula, though. 96.46.195.35 (talk) 13:01, 10 February 2013 (UTC)[reply]

The identity is mentioned at Trigonometric identities#Identities without variables (though not with a clear explanation, unfortunately) and this identity is identical to the one above by recognising that . So, the identity the IP mentions is certainly true, provided that WP page is correct. EdChem (talk) 13:03, 10 February 2013 (UTC)[reply]

Yes, I just noticed that. See also Morrie's law, which relates directly to the OP's identity in the same way. 96.46.195.35 (talk) 13:08, 10 February 2013 (UTC)[reply]
How about this: we can write , then we have:
.
Using your "tanA = cot(90-A)" we have
.
From List_of_trigonometric_identities#Double-angle.2C_triple-angle.2C_and_half-angle_formulae we have:
, so we have:
.
Using the half-angle formula:
we have
.
What do people think?77.86.3.26 (talk) 13:15, 10 February 2013 (UTC)[reply]
You dropped a factor of 2 along the way. Also, although if you restore the 2 the calculations are correct, the argument is still incomplete. It's something special about the number tan(20) that makes the last equation true - for tan(21) it would be false.96.46.195.35 (talk) 14:42, 10 February 2013 (UTC)[reply]
Thanks for spotting my mistake. One possible way to go is by expanding the above into an equation for and noting that:
, so
and comparing? 77.86.3.26 (talk) 16:28, 10 February 2013 (UTC)[reply]
Sorry that's no help, one equation is quartic and the other cubic. 77.86.3.26 (talk) 16:35, 10 February 2013 (UTC)[reply]

Complete proof

Recalling the double angle formula for the sine function and rearranging, we can state that, for any angle α:

    and similarly that         and    

On multiplying these together, we get that

Setting α = 20°, we get

and since

    . .     . .     . .     (1)

This is the so-called Morrie's law.

Now, recalling the sums-to-products formula for the sine function we can state that, for any angles α and β:

Taking α = 80° and β = 40°:

Then, nothing that   :

On multiplying by sin(20°), we get:

Now, invoking the sums-to-products formula for the product of a sine and a cosine function, for any angles α and β:

with α = 20° and β = 40°:

Now, as     and    

and it follows that:

    . .     . .     . .     (2)

Now, divind equation (2) by equation (1), we get:

Recalling that one of the properties of the tangent function is that:

    and applying it at θ = 50° and θ = 10° and recalling that         and substituting, we find:

as required. EdChem (talk) 06:22, 11 February 2013 (UTC)[reply]

Alternate proof

Here is an alternate proof, loosely modelled on the outline above. We compute cos2 50 + tan 10 sin 50 cos 50 = (1 + cos 100)/2 + tan 10 (sin 100 /2 ) = (1 - sin 10)/2 + tan 10 (cos 10 / 2) = 1/2 - (sin 10)/2 + (sin 10)/2 = 1/2 = cos 60 = cos 10 cos 50 - sin 10 sin 50.

Dividing the result by cos 50, we find cos 50 + tan 10 sin 50 = cos 10 - sin 10 tan 50.

We rearrange to obtain cos 10 - cos 50 = tan 10 sin 50 + sin 10 tan 50 = tan 10 tan 50 cos 10 + tan 10 cos 10 tan 50 = tan 10 tan 50 (cos 10 + cos 50).

Now we divide by cos 10 + cos 50 and use the identity for a product of tangents to find tan 10 tan 50 = (cos 10 - cos 50)/(cos 10 + cos 50) = tan 20 tan 30. 64.140.122.50 (talk) 08:14, 12 February 2013 (UTC)[reply]

Extension

Above, an IP noted that the result is equivalent (after re-adding a lost 2) to the statement that:

which is the same as the polynominalin t:

Solving this for t in the range 0 < t < 1 will give the exact value for tan 20°. EdChem (talk) 06:22, 11 February 2013 (UTC)[reply]

Letting t = tan 20, we have sqrt(3) = tan 60 = tan 3t = (t^3 - 3t)/(3t^2 - 1), hence t^3 -3sqrt(3)t^2 - 3t + sqrt(3) = 0.

Multiplying this equation by t^3 + 3sqrt(3)t^2 - 3t -sqrt(3), we find that t^6 - 33t^4 + 27t^2 - 3 = 0.

By Eisenstein's criterion, the polynomial on the left is irreducible over the rational numbers, so it is not possible to find a polynomial equation of lower degree with rational coefficients of which t is a root. 64.140.122.50 (talk) 08:13, 12 February 2013 (UTC)[reply]

Multiplying by a uniformly-distributed random variable

If I multiply random variable A by random variable B, and random variable B has a uniform distribution, will random variable A*B then have the same type of distribution as what random variable A had? Thorstein90 (talk) 22:29, 10 February 2013 (UTC)[reply]

No. I don't think it will ever be the same, and it can be very different, as for example if you multiply a narrow Gaussian r.v. by a broad uniform r.v. Looie496 (talk) 00:40, 11 February 2013 (UTC)[reply]
But what I mean is if you multiply a narrow Gaussian by a broad uniform, would it still be (maybe a broader) Gaussian? Thorstein90 (talk) 04:51, 11 February 2013 (UTC)[reply]
Clearly not, consider the Gaussian N(1,0). (That's the constant 1.) McKay (talk) 05:54, 11 February 2013 (UTC)[reply]
A zero-variance Gaussian? Thorstein90 (talk) 06:48, 11 February 2013 (UTC)[reply]
Yes, a zero-variance Gaussian is just a limiting case of a Gaussian as the variance goes to zero (it has all its probability mass at the mean). If something (such as preservation of the class of distributions) were true for all members of the class, it would be true in the limiting case as well. But here, with a unit-mean, zero-variance Gaussian (or any other distribution of unit mean and zero variance), the product with a uniform distribution is simply the same uniform distribution. Duoduoduo (talk) 15:20, 11 February 2013 (UTC)[reply]
See Normal distribution#Zero-variance limit. Duoduoduo (talk) 15:50, 11 February 2013 (UTC)[reply]

So how do you get the answer to be "yes, it will be random", the same as xoring by a random one time pad? You have a good source of randomness so is there some way to "xor" by it in the same way, to get an equally random result as the "OTP" what you're xoring by? 91.120.48.242 (talk) 07:42, 11 February 2013 (UTC)[reply]

My interpretation if 91.120's question is this: A one-time pad (OTP) is uniformly distributed over some fixed range of integers. Is there any random variable A, somehow distributed, that we could multiply by the OTP distribution to get another distribution that is also uniformly distributed? This is a different question from the original one, which wanted the product to be distributed like A rather than like the uniform. This question is also different because one-time pads are discretely distributed. My own answer is that I doubt it, but I'm not sure. Duoduoduo (talk) 15:32, 11 February 2013 (UTC)[reply]
What you probably want is (modular) addition, not multiplication. If A is a random variable in [0,1], and B is independent and uniformly distributed in [0,1], then is uniformly distributed in [0,1], independent of A, and using B and C you can reconstruct A. This can be extended to (bounded) ranges which are not [0,1]. -- Meni Rosenfeld (talk) 13:44, 12 February 2013 (UTC)[reply]


February 11

Variance of the product of two normals

I know that for independent random variables, .

Does this mean that the variance of the product of and is simply ?

Thorstein90 (talk) 01:22, 11 February 2013 (UTC)[reply]

With all respect, a person who has the sophistication to ask that question should have the sophistication to answer it, since the product of two zero-mean Gaussians is a zero-mean Gaussian. Looie496 (talk) 04:36, 11 February 2013 (UTC)[reply]
Oh really? Then what is this: http://mathworld.wolfram.com/NormalProductDistribution.html Thorstein90 (talk) 04:47, 11 February 2013 (UTC)[reply]
At a glance that looks okay to me. In equation 2 of your wolfram reference, the expression , looks to me like the ratio of the centered random variable to the standard deviation, so the variance would be . Duoduoduo (talk) 14:54, 11 February 2013 (UTC)[reply]
However, the product of two zero mean Gaussians is not Gaussian. That's true for sums not products. Duoduoduo (talk) 14:59, 11 February 2013 (UTC)[reply]
The answer to your (original) question is "yes". McKay (talk) 05:52, 11 February 2013 (UTC)[reply]
No: It's not Gaussian. Michael Hardy (talk) 02:07, 16 February 2013 (UTC)[reply]
The original question didn't say anything about Gaussians. -- Meni Rosenfeld (talk) 17:59, 21 February 2013 (UTC)[reply]

The number of subsets of {1,2,...,n} with a total sum k

What's the generation function of the series ? Thanks, 79.179.188.147 (talk) 11:56, 11 February 2013 (UTC)[reply]

See Restricted partition generating functions in partition (number theory). Gandalf61 (talk) 13:19, 11 February 2013 (UTC)[reply]
Still can't solve it. The function is similar but doesn't restrict the subsets to be contained in . 79.179.188.147 (talk) 14:17, 11 February 2013 (UTC)[reply]
The restriction to subsets of means that the upper bound of the product is not infinity but is ... what ? Gandalf61 (talk) 14:31, 11 February 2013 (UTC)[reply]
Oh, thanks! 79.179.188.147 (talk) 17:11, 11 February 2013 (UTC)[reply]

The number of ways to color N balls with I colors is. . Bo Jacoby (talk) 02:51, 12 February 2013 (UTC).[reply]

Wouldn't the answer be (1 + x)(1 + x2)⋅⋅⋅(1 + xn)? If you expand the product, the coefficient of xk is ak. 64.140.122.50 (talk) 04:56, 13 February 2013 (UTC)[reply]

Squared triangular number representative polychora.

Not sure if this belongs here or on WP:MATH. In the article Squared triangular number, is the following text:

These numbers can be viewed as figurate numbers, a four-dimensional hyperpyramidal generalization of the triangular numbers and square pyramidal numbers.

. Now this makes it sound like there is a single 4 dimensional figure that if sliced differently into two dimensional pieces would make it hypergeometically obvious. While the sum of cubes is obviously a cubical hyperpyramid (shape made of a cube and 6 square pyramids), it is unclear to me how the hyper pyramid would be cut to give the square of the triangular number. Can someone please help with explaining this to me here, which might help in changing the explanation in the article?Naraht (talk) 15:08, 11 February 2013 (UTC)[reply]

Don't know of any, but there is a nice proof without words at [1] Dmcq (talk) 01:04, 13 February 2013 (UTC)[reply]
Not doubting the proof (though some more information as to which proof used by each of the discoverers might be nice. Part of the problem with the concept is that the cubical hyperpyramid has a single vertex which is unique so figuring out which of the 6 it lines up with.Naraht (talk) 19:01, 13 February 2013 (UTC)[reply]
Have you tried examining the cross-sections involving planes involving the w-axis? They are hard to see. Double sharp (talk) 15:50, 18 February 2013 (UTC)[reply]
There are two types of cross section on the cubical hyperpyramid. The ones from the unique vertex to the largest cube are essentially from the point to the largest cube with a cube getting larger. In the other three cross sections, it starts with a square, builds up to a square pyramid and then back down to a square. Not sure how that helps. :(Naraht (talk) 15:43, 20 February 2013 (UTC)[reply]


February 12

Cosets and normal subgroup equality

Hello. I recently came across an exercise, and would be very grateful if someone could help.

Given a normal subgroup H in G, with g in G, if , then is ?

Neuroxic (talk) 11:31, 12 February 2013 (UTC)[reply]

Any subgroup H contains the identity. Think what happens with that. Dmcq (talk) 12:11, 12 February 2013 (UTC)[reply]
That question is a special case of the following question, which may actually be easier (intuitively) to solve: if , then is ? Basically you're just asking "Is for some subgroup ?" and it is a very well known fact that the answer is yes, and the proof is also very well known and straightforward: --AnalysisAlgebra (talk) 19:21, 12 February 2013 (UTC)[reply]
There's no need for to be normal, by the way. --AnalysisAlgebra (talk) 19:23, 12 February 2013 (UTC)[reply]

Estimating parameters of a distribution from censored data

Suppose you hypothesize that your data are drawn from, say, a lognormal distribution or a gamma distribution. Your data are right-censored at the value x*. That is, you have exact data whenever xx*, but whenever x>x* all you know is that x>x*.

(1) How do you estimate the parameters of the hypothesized distribution? I know it would be by maximum likelihood, but how do you handle the censored data?

(2) Is there a command in, say, SAS that will do this?

(3) How do you test the hypothesis that the data did in fact come from that distribution? Duoduoduo (talk) 18:37, 12 February 2013 (UTC)[reply]

(1) If your data consists of uncensored points and n censored points, and your pdf with parameters is , then the likelihood of is . There's ostensibly an inconsistency in that you use a density for the contribution to likelihood of some points and a probability for others, but since likelihood functions are only meaningful up to a constant factor it doesn't matter. -- Meni Rosenfeld (talk) 19:49, 12 February 2013 (UTC)[reply]
Thanks, Meni! Duoduoduo (talk) 14:19, 14 February 2013 (UTC)[reply]

February 13

February 14

February 15

How do you solve for n?

How do you solve for , given and ? The parameter values of interest are of the order and . Can someone give a good approximation formula that can be evaluated without overflows or gross loss of precision during computation? Thanks. --173.49.13.216 (talk) 03:56, 15 February 2013 (UTC)[reply]

I'm not a specialist of this kind of thing, but this can be rewritten (exactly) as

In approximate terms, we can write this as

In linearizing the logarithms, the error in the terms on the left is at most about times their value. Given the approximate value of n, the error on the left is, in proportion, about . In other words, in using the formula you commit an error of at most about times the vaue of n. (In fact, a more careful calculation shows that the error is about 2/3 of this, and that it results in an underestimation of the minimum possible n.) If you replace r - 1 with r, this rises to about 1/r, or 10-9. If you replace with , the error rises to about times the value of n. 64.140.122.50 (talk) 05:58, 15 February 2013 (UTC)[reply]

I forgot to mention this - I'm using natural logarithms here. 64.140.122.50 (talk) 06:08, 15 February 2013 (UTC)[reply]
Thanks. Your formula is more than good enough. --173.49.13.216 (talk) 12:15, 15 February 2013 (UTC)[reply]

February 16

Quadratic roots

Is is possible to have two equal complex roots of a quadratic equation, where a,b,c are real numbers is a quadratic equation? — Preceding unsigned comment added by 117.227.197.26 (talk) 13:06, 16 February 2013 (UTC)[reply]

No - only complex conjugate, if they are complex. Using the standard form of the quadratic equation:
where as usual a, b, c are real numbers, think about the quadratic formula solution:
so for negative discriminant,
the roots are complex conjugate. M∧Ŝc2ħεИτlk 13:25, 16 February 2013 (UTC)[reply]
Altenative method - if the roots are equal and both equal to k then
and so k is real since a and b are real. Gandalf61 (talk) 14:10, 16 February 2013 (UTC)[reply]

The notations D(Λ) = "representation of the Lorentz group" and (m, n) = "finite dimensional irreducible representations" seem clear enough, however the notation (say) "D(1/2, 0)" (i.e. including the superscript) is confusing...

My burning questions are...
  • is D(2m) = (m, 0) for half-integer m, or equivalently D(m) = (m/2, 0) for integer m? Or...
  • is D(m) = (m, 0) for integer or half-integer m?

Just alternative notations/conventions?...

D(m) = (m/2, 0) ⊕ (0, m/2),
D(m) = (m/2, m/2),
D(m, n) = (m/2, n/2) ⊕ (n/2, m/2),
what does the last expression have for equivalent notation:
D(m, n) = D(?)D(?) ?
while...
  • The WP article takes m, n to be half-integers in (m, n), so does that translate to
"D(2m, 2n) = (m, n) ⊕ (n, m)" ?
and this has what notation:
"D(m, n) = D(?)D(?) ?
  • In all... is the statement
D(m, n) = (m/2, n/2) ⊕ (n/2, m/2) = "(2m  +  1)(2n  +  1)-dimensional irreducible representations of D(Λ)"
true?
  • Are any of the differing conventions, where to put the 1/2 factor, or just the choice of what is integer and half-integer, is "the" standard?

Thanks in advance for any and all replies. Best, M∧Ŝc2ħεИτlk 13:23, 16 February 2013 (UTC)[reply]

Don't get lost in the notation. The finite dimensional real irreducible representations of the spin group of the Lorentz group all have one of the following forms (for n and m integers):
These are irreducible as real representations, which means you cannot decompose them further without breaking invariance under complex conjugation. However those of the first kind do decompose as a sum of two complex conjugate represnetations. The source you cite calls the first kind of representation and the second kind . The fact that these are irreducible implies that there is no decomposition of into a direct sum of two real representations D's. Sławomir Biały (talk) 14:40, 16 February 2013 (UTC)[reply]
It might be added that the above exhaustive list applies to O+(1;3) which includes parity inversions (the orthochronous Lorentz group). In physics SO+(1;3) (the proper orthochronous Lorentz group) is often of interest because parity is not a symmetry in every theory (see e.g. weak interactions). For SO+(1;3) the irreducible representations are of the form
for n and m integers.YohanN7 (talk) 16:18, 16 February 2013 (UTC)[reply]
Excellent explanations of the facts - if that's all there is to it (the notation and it's meaning), that's fine. Thanks (again)! M∧Ŝc2ħεИτlk 23:43, 16 February 2013 (UTC)[reply]

February 17

probability and habit.

Lets say that someone wants to break a habit , what is the best way of modeling the probabilities?

If I take avoiding Facebook as an example where I have 1/3 chance of logging in in 1 day and 2/3 chance of not logging in:

Using a binomial distribution, if I avoid Facebook for 365 days then I have (2/3)^365 which is 5 x 10^-65 which is smaller than the Planck length.

I am guessing that the binomial is not working for this case but would the modelling of breaking a simple habit cause such small numbers?

Ap-uk (talk) 12:35, 17 February 2013 (UTC)ap[reply]

Your analysis would be right if the probability were to remain constant day after day for the whole year. But in reality it would not. If you've made it for say 200 days without logging in, it's probably not by chance but rather it's that you have adjusted your behavioral tendencies -- that is, you've adjusted your log-in probability down to near zero. Duoduoduo (talk) 14:53, 17 February 2013 (UTC)[reply]
Agreed. In math-speak, the probabilities from one day to the next are not independent, which is required for the formula you used. So, you need to use P = Pday1Pday2Pday3Pday4... instead. Of course, actually determining Pday1, Pday2, Pday3, Pday4 ... is not easy. StuRat (talk) 17:14, 17 February 2013 (UTC)[reply]
You'd really need to use conditional probabilities:
The probabilities near the end are probably really close to 1; given that you have successfully avoided Facebook for the first 364 days, the probability that you'll avoid it on the 365th day is probably almost 100%.
Also, comparing a probability to the Planck length is meaningless; a probability is not a length. —Bkell (talk) 13:15, 19 February 2013 (UTC)[reply]

Analytical geometry question

I'm stuck trying to solve the following problem. Any help would be appreciated!

Which lines crossing point (2, 6) together with the x-axis and the y-axis border a triangle with an area of 25? I'm trying to solve both rising and falling lines.

I know that the equation for the line is where m is the slope of the line. And I also know that I need to find the points where y=0 or x=0. Then the area would be the product of those two points divided by two.

So when the line crosses the x-axis y=0 and . And when it crosses the y-axis x=0 and . But I think I'm doing something wrong here, any ideas? 82.181.210.44 (talk) 15:32, 17 February 2013 (UTC)[reply]

No hang on, I got right two of the lines.
and . So and we can see that m is either or . And the equations of the two lines are and .
But I still can't figure out the two remaining lines.82.181.210.44 (talk) 17:05, 17 February 2013 (UTC)[reply]
If the triangle is in the second quadrant its area is negative, so the corresponding value in your analysis is -50. This will give a second quadratic equation in m, with two positive roots.←86.186.142.172 (talk) 17:22, 17 February 2013 (UTC)[reply]
You found two triangles in the first quadrant, but there is also a triangle in the 2nd quadrant and one in the fourth quadrant. As 86.186.142.172 says, both those areas can be thought of as negative, so plug that into your above equation to find the two lines. BTW, your initial statement of the problem was quite hard to follow. Try this: "I need to find 4 lines in the XY plane, each of which pass through (2,6), and, in conjunction with the X and Y-axes, form a triangle with an area of 25". The "4" and "each" are the critical bits that were missing from your Q. StuRat (talk) 17:51, 17 February 2013 (UTC)[reply]
Yes, thanks to both of you I finally figured it out. And sorry about the unclear question. The problem was in different language and I had to translate it myself and I'm not good at that. And sorry about the math tags that were missing at first. I was too busy working with this problem so I couldn't be bothered to learn how to use them. But anyways, I think the issue was that I was thinking that area can't be negative, and didn't realise that the roots would be positive. Thanks again! 82.181.210.44 (talk) 18:13, 17 February 2013 (UTC)[reply]
You're quite welcome, and I will mark this Q resolved. StuRat (talk) 18:19, 17 February 2013 (UTC)[reply]
Resolved

February 18

February 19

Why is tensor a very tough topic? No one is explaining tensor in a simple language. I tried to read Wikipedia article about Tensor, but it is also very tough. Could someone make me understand about tensors in a simple language? 27.62.227.241 (talk) 14:11, 19 February 2013 (UTC)[reply]

Tensors are geometric objects. Triangles, rectangles, and parallelograms are also geometric objects. 140.254.226.230 (talk) 14:34, 19 February 2013 (UTC)[reply]
I don't agree that tensors are geometric objects in the way that triangles and rectangles are. That seems to suggest that tensors are "objects" in a naive sense, which is not true. Rather tensors express geometrical information. Sławomir Biały (talk) 16:37, 19 February 2013 (UTC)[reply]
As the picture of a tensor shows on the article Tensor, it looks like tensors look like the vectors used in physics to describe magnitude and direction. But they are not just vectors. Tensors would probably be the geometrical objects that may use vectors to specify some linear relationship between two objects. They may be vectors themselves. Perhaps, the force vectors in physics would count as tensors. If that is the case, then see Kinematics. 140.254.226.230 (talk) 16:55, 19 February 2013 (UTC)[reply]
Right. Vectors are a special case of tensors. The illustration there shows, more generally, that certain kinds of tensors express information that require specifying one or more directions in a space. Strain, for instance, is an example. Sławomir Biały (talk) 17:25, 19 February 2013 (UTC)[reply]
A similar question was asked recently on the Science Desk, and got some good answers. AndrewWTaylor (talk) 18:22, 19 February 2013 (UTC)[reply]
Tensors can be confusing because there are several (equivalent) ways of defining them. Here is one way of looking at a tensor: It is a function that takes a number of vectors as arguments and produces a number as output. This function is required to be linear in each of its arguments. Such a function is called multi-linear. To figure out the components of the tensor one takes combinations of basis vectors as arguments and computes the output. This description is basis dependent, because if one uses another basis for the vectors, one will, in general, get a different multi-linear function describing the same tensor! YohanN7 (talk) 21:11, 19 February 2013 (UTC)[reply]
I found the Dan Fleisch video mentioned in the previous post illuminating. It was mostly a rehash ("Tensors are N-dimensional vectors"), but the gem at the end for me was the realization that a tensor is almost always accompanied by a (potentially implicit) basis vector set, and that the basis vector set of a tensor can combine basis vectors from potentially distinct vector spaces. The prevalent use of the implicit x/y/z basis vectors for most usage of (1-dimensional) vectors can make it difficult to realize that there can be more complex sets of basis vectors that accompany a tensor. -- 205.175.124.30 (talk) 22:38, 19 February 2013 (UTC)[reply]