Wikipedia:Reference desk/Archives/Mathematics/2015 March 8

From Wikipedia, the free encyclopedia
Mathematics desk
< March 7 << Feb | March | Apr >> March 9 >
Welcome to the Wikipedia Mathematics Reference Desk Archives
The page you are currently viewing is a transcluded 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 8[edit]

Solving equations[edit]

Honored wikipedians. I want to find a function p(r), for 0 ≤ r ≤ 1, and a constant B, such that

where c=0.49, and such that

I computed the following numerical solution iteratively

  r,.p,.B
  0 0.0865575 18.0525
0.1 0.0856919 18.0525
0.2 0.0830952 18.0525
0.3 0.0787673 18.0525
0.4 0.0727083 18.0525
0.5 0.0649181 18.0525
0.6 0.0553968 18.0525
0.7 0.0441443 18.0525
0.8 0.0311607 18.0525
0.9 0.0164459 18.0525
  1         0 18.0525

To my surprise it seems to satisfy

  (r^2)+(%{.)p
1 1 1 1 1 1 1 1 1 1 1

Is this exact? Thank you. Bo Jacoby (talk) 03:59, 8 March 2015 (UTC).[reply]

Did you perhaps write the second equation incorrectly? I think that is a solution to:
But not a solution to the equation you wrote where the exponentials have the same sign. Dragons flight (talk) 19:55, 8 March 2015 (UTC)[reply]

Thanks, Dragon flight! No, the exponentials should not have different signs. How did you manage to find that result? I tried WolframAlpha and got

integral_0^s e^(A^2 (1-t^2)) t^2 dt
= (e^(A^2) (sqrt(pi) erf(A s)-2 A s e^(-A^2 s^2)))/(4 A^3)

where and erf(A s) = , such that the result is

but I cannot do the second integration. Bo Jacoby (talk) 00:08, 9 March 2015 (UTC).[reply]

Upon taking a second look, I probably convinced myself of something that wasn't true. Anyway let's examine the second equation. Which for simplicity I'll rewrite as:
Where I've absorbed B into p(0) and condensed the prefactor terms.
Now we can find the equivalent differential form via by taking two derivatives with respect to r.
Substituting from the first derivative equation, this becomes:
Which could be solved numerically, or by series expansion, etc. However, assuming I've done the math correctly, it definitely doesn't have a solution . Dragons flight (talk) 03:16, 9 March 2015 (UTC)[reply]

Thanks again. Your initial simplification is brilliant. I'll return after further study. Bo Jacoby (talk) 17:38, 9 March 2015 (UTC). I made a huge error in the numerical calculation. The formula is not at all valid. Thanks. Bo Jacoby (talk) 09:18, 13 March 2015 (UTC).[reply]

Solving for f(n) ≡ 0 mod p[edit]

For odd prime and polynomial what are the more efficient ways to solve the following?

Assume I have

and their modular multiplicative inverses available. (I am looking for the general case so I can apply this in case the function may become different). Currently I am doing linear searches which is Θ(p) which encounters problems when is large. Thieh (talk) 04:38, 8 March 2015 (UTC)[reply]

Is p so large as to make Berlekamp's algorithm inefficient? --catslash (talk) 15:21, 8 March 2015 (UTC). Apparently the Cantor–Zassenhaus algorithm is better (but I am not familiar with it). In either case, you will first need to split f(n) into square-free factors. --catslash (talk) 15:33, 8 March 2015 (UTC)[reply]
What about terms irreducible over integers? like or similar? Also the article seems to be talking about finding f(n) given p(n) instead of finding n given f and p. Thieh (talk) 19:07, 8 March 2015 (UTC)[reply]
I had assumed that n was restricted to being an integer mod p - but in that case you could just test each possible n from 0 to p-1 unless p was too large for this to be practical, and so perhaps p is also too large for these algorithms. The algorithms mentioned factor f(n) mod p into irreducible factors (over the integers mod p). If any of these factors is linear, then you have a solution (but perhaps you might as well just each possible n for this). Non-linear factors are the minimal polynomial (field theory)s for the non-integer-mod-p roots of f. --catslash (talk) 19:53, 8 March 2015 (UTC)[reply]
Factorization of polynomials over finite fields was what I was looking for. I was quite a bit noob in terminology and as such the way to apply the algorithm. Thanks. Thieh (talk) 22:07, 8 March 2015 (UTC)[reply]

Proofs[edit]

Are there proofs on this

(-1)(-1)=1

0/x=0

0/0=?

x/0=? — Preceding unsigned comment added by 151.236.166.33 (talk) 18:02, 8 March 2015 (UTC)[reply]

0/0 and x/0 are usually undefined in ordinary arithmetic. Also you can transform 0/x = 0 into 0 ⋅ 1/x which is covered by field axioms. Thieh (talk) 19:11, 8 March 2015 (UTC)[reply]
Proving (-1)2=1. Let m=-1. Then by definition m satifies the equation m+1=0. Multiply both sides of this equation by m to get m2+m=0. Add one to get (m2+m)+1=1. Then m2+(m+1)=1. Substitute m+1=0 and m2+0 =m2 to get m2=1. Qvod Erat Demonstrandvm. Bo Jacoby (talk) 08:12, 9 March 2015 (UTC).[reply]

Expression[edit]

What is more correct expression in mathematic?

or

With the reason — Preceding unsigned comment added by 151.236.166.33 (talk) 18:15, 8 March 2015 (UTC)[reply]

Addition is commutative for most places (some exceptions exist) so I would see problems in neither. I would think it would be more appropriate to arrange it the same way as the line before. Thieh (talk) 19:17, 8 March 2015 (UTC)[reply]
Even if addition is not commutative, it usually supports inverses. Whatever, both expressions are perfectly correct. Maproom (talk) 21:37, 10 March 2015 (UTC)[reply]

Gamma matrices[edit]

Per YohanN7's suggestion, I am raising this question here. I would appreciate YohanN7 holding back for a while, as this is a request for additional input from others.

The article Gamma matrices claims that (with suitable choice of the matrices) {γ0,γ1,γ2,γ3,5} is the Clifford algebra of signature (1,4) and that {γ0,γ1,γ2,γ3,γ5} is the Clifford algebra of signature (4,1). Can M4(C) be used to represent both Cl4,1(R) and Cl1,4(R)? Classification of Clifford algebras suggests that it is isomorphic for the signatures (4,1), (2,3) and (0,5) cases only. —Quondum 20:51, 8 March 2015 (UTC)[reply]

I think you're right. {γ0, γ1, γ2, γ3, 5} clearly isn't the basis for a Clifford algebra since the product of the five elements is 1. {γ0, γ1, γ2, γ3, γ5} clearly isn't the Clifford algebra of signature (4,1) since the elements square to +−−−+. I think {0, 1, 2, 3, γ5} is a basis for the real Clifford algebra of signature (4,1), but don't quote me on that. -- BenRG (talk) 01:44, 9 March 2015 (UTC)[reply]
I can add a simple argument for the specific case in the article (though my intent with the question was to answer the more general matter of whether M4(C) can be used at all to represent Cl1,4(R)): the basis elements that generate any real Clifford algebra, and all their products (without duplication within a product) form an R-linearly independent set. This condition can be shown to be violated by the first basis given above, if one uses the knowledge that γ5 = 0γ1γ2γ3, as defined in that article: the product of all five elements is γ0γ1γ2γ35 = −55 = (γ5)2, which is a scalar, i.e. R-linearly dependent on first (empty) product. —Quondum 02:42, 9 March 2015 (UTC)[reply]
The algebra generated by is Cl(2,3). This is isomorphic to . For the other one, I think there's an ambiguity in the notation . Does this mean i times in the complex Clifford algebra generated by ? If so, the product would be equal to one, so they would naturally not be independent generators of a Clifford algebra, per BenRG. Or does instead mean in the complexification of the Clifford algebra on the five generators (so is the real tensor product)? If we assume the latter, then we do get the algebra Cl(1,4). This is . The algebras and are non-isomorphic (for instance, one is simple and the other is not). I hope this clears things up. Sławomir Biały (talk) 14:23, 9 March 2015 (UTC)[reply]
It's neither of those. It's the real algebra generated by . That the matrix has a name while doesn't has no effect on their use as generators. -- BenRG (talk) 19:18, 9 March 2015 (UTC)[reply]
You seem to believe that is not (isomorphic to) the complex Clifford algebra generated by . That belief is wrong. Otherwise you misread my post. Sławomir Biały (talk) 21:42, 9 March 2015 (UTC)[reply]

Perhaps the recursive construction of Higher-dimensional gamma matrices, Section 3.3, might shed the light you are seeking, if you simply restricted to d=2 and d=3. This is incontrovertibly standard stuff in physics practice in the trenches, and you simply "fail the course" if you don't stick to it, as you should.Cuzkatzimhut (talk) 14:32, 9 March 2015 (UTC)[reply]

@Sławomir: In the set {γ0,γ1,γ2,γ3,γ5} the first gammas are of course those appropriate to metric signature (3, 1), not (1, 3) (which was not communicated by Q), so your (2, 3) conclusion is wrong. Everything relates to matrices, so multiplication by i has just that meaning, multiplication entry-wise by i. Whether this takes you out of an algebraic structure is not an issue. The issue of concern is that one has a set of matrices satisfying
where the signature and dimension can be anything. This is the defining relation in mathematical physics (from what I can gather) and it is the definition in gamma matrices. It may be (seems more than likely) that the mathematical definition sometimes allows for "freer" (larger) algebras that satisfy the same relations. See section "Possibility" below. The definition of mathematical physics is naturally the appropriate one to use when discussing gamma matrices because this is what one is likely to find in the relevant literature. YohanN7 (talk) 17:43, 9 March 2015 (UTC)[reply]
Oops, I'm using the "wrong" signature convention, apparently. In your conventions gamma 0 through 5 would generate Cl(4,1), which is . Also, the set generate Cl(3,2), which is . This is not simple as an algebra, and has a quotient (replacing the by ordinary entrywise multiplication by i) that satisfies the same anticommutation relations. So this gives a way to get the representations of Cl(3,2) from those of Cl(3,1). Do I understand this correctly? (Or are my signatures still wacko?) Sławomir Biały (talk) 18:25, 9 March 2015 (UTC)[reply]
In the second example, the (original) gammas are supposed to be the ones appropriate to the (1,3) signature (sorry about the confusion, but I didn't write the OP). In this case, 5 squares to I so, if anything, {γ0,γ1,γ2,γ3,5} → {Γ0,Γ1,Γ2,Γ3,Γ4} generates an algebra in which
holds for metric signature (1, 4). Whether this is a Clifford algebra or not seems to depend on the definition of what constitutes a Clifford algebra. YohanN7 (talk) 18:41, 9 March 2015 (UTC)[reply]
The algebra is "degenerate" as per the Weinberg quote in the next section. YohanN7 (talk) 18:56, 9 March 2015 (UTC)[reply]
Ok, so it's more or less the same story in both cases. In your conventions, you only get half of what I would call the Clifford algebra. Also, this algebra lacks what might be called a proper Z2 grading, and so it is just the even part of the full Clifford algebra. These are the isomorphisms at Clifford algebra between the even algebras in one dimension higher. Recovering the odd parts too then requires introducing some operator that anticommutes with all of the gammas, and commutes with . (Something like "charge conjugation" I guess.) Sławomir Biały (talk) 19:09, 9 March 2015 (UTC)[reply]
Oh, it is not my conventions. (I have as many conventions as I have moral principles.) It just seemed like a nice day to wear a physicist hat. I'll change tomorrow Yes, it seems like the mystery is resolved. Thank you. If I understand the reference below correctly, the set {γ0,γ1,γ2,γ3,−5} generates a different algebra from {γ0,γ1,γ2,γ3,5} in the sense that they cannot be related by a similarity transformation. One follow up question would also be what the representation theory of SO(D − 1, 1) ≈ SO(1, D − 1) looks like. What are the dimensions of the spin (projective) representations? But this is a separate issue. YohanN7 (talk) 19:52, 9 March 2015 (UTC)[reply]
You seem to be making this much more complicated than it really is. (modulo sign convention) and therefore the set is the same as the set whether you use it as a set of generators or anything else. Giving a name to doesn't change its properties.
The generators are effectively independent if you build a real algebra from them, since a factor of i distinguishes the fifth element from the product of the first four. The generators are not independent. You get the same algebra from them as from . And you get the same algebra from -- BenRG (talk) 20:11, 9 March 2015 (UTC)[reply]
The naming conventions aren't mine. The gammas (0,1,2,3) in one case (1,3) aren't the same as in the other case (3,1) (see above). The generators are not effectively independent according to Weinberg p. 216. YohanN7 (talk) 21:25, 9 March 2015 (UTC)[reply]
Well, that's not exactly what he says (I am tired), but I would be surprised if you get more real independent matrices out of than (where the basic gammas differ in the two sets) because i2 = − 1.YohanN7 (talk) 21:50, 9 March 2015 (UTC)[reply]
Suppose the full (mathematical) Clifford algebra is generated by one set but not by the other. This would have implications for the dimensionality of the representations of SO(1,4) and SO(4,1). I don't think either of the isomorphic groups has a 4-dimensional representation (they have the same representation theory). (This is why I brought up the representation theory to begin with). YohanN7 (talk) 22:06, 9 March 2015 (UTC)[reply]
Let A = and let B = iA. The real algebra generated by {A,B} is larger than that generated by {A,iB}.
The differences between Weinberg and Wikipedia are not relevant here, but if that's not clear to you, we could also let A' = and B' = −iA', for example. The definition of γ5 has a factor of i in it in both conventions.
If you want an example with anticommuting matrices, let A = , B = , and C = iAB (or −iAB). Then A² = −1, B² = C² = 1, they pairwise anticommute, and {A,B,C} generates M2(C) while {A,B,iC}, {A,B,−iC}, and {A,B} all generate M2(R).
I don't really know representation theory, but Spin(p,q) and SO(p,q) are associated with the even subalgebra of Cℓp,q(R), which is always isomorphic to the even subalgebra of Cℓq,p(R). It's only when dealing with the full Clifford algebra or the Pin group that there's a difference between p+q and q+p dimensions. -- BenRG (talk) 07:50, 10 March 2015 (UTC)[reply]
If you say that generate the full 32 = 25 elements required by the mathematical version of Clifford algebra, then I take your word for it. Thank you. It makes sense since some set should according to the classification. If this is something that is agreed upon in full now, I'll sharpen the wording in the affected articles distinguishing clearly between the physicists definition and the mathematicians more restrictive definition of a Clifford algebra (in a couple of days time and if nobody gets there before me). YohanN7 (talk) 10:21, 10 March 2015 (UTC)[reply]

One way to see this is that Cl(4,1) is which is a simple algebra. So any non-trivial algebra of matrices that satisfies the anticommutation relations for Cl(4,1) must be isomorphic to it. Sławomir Biały (talk) 11:03, 10 March 2015 (UTC)[reply]

Reply[edit]

For an explicit statement of the disputed sentences in the article gamma matrices, please see Tong (2007, p. 93) and Weinberg (2002, p. 218). I consider David Tong and Steven Weinberg being reliable references.

About dependencies in odd spacetime dimension:
In spaces or spacetimes with with odd dimensionality, the totally antisymmetric tensors of rank n can be linearly related by the conditions

where ε is the totally antisymmetric symbol and the left hand side is taken as the identity matrix for r = 0. Under these conditions there are only 2d−1 independent tensors, requiring γ-matrices of dimensionality at least 2(d−1)/2.[Note 1]

So, yes, we can have dependencies. There is nothing in the definition of a Clifford algebra ruling it out.

About the representations in general:
D even

  • γa = γa (a=1, ...,D) are 2D/2×2D/2 matrices, which are unique modulo a similarity transformation.
  • All Γa are linearly independent.
  • All 2D/2×2D/2 matrices can be decomposed into γa1a1...an (0 ≤ nD).[Note 2]

D odd

  • γa = γa (a=1, ...,D) are 2(D−1)/2×2(D−1)/2 matrices, which are not unique; there are two representations.
  • Not all Γa are linearly independent.
  • All 2(D−1)/2×2(D−1)/2 matrices can be decomposed into γa1a1...an (0 ≤ n ≤ (D−1)/2).[Note 3]

This wraps it up. Note the dependencies again. I don't know personally about the authors reliability, the reference is new to me, but someone I trust ensures me that it is good enough. You may also want to see Higher-dimensional gamma matrices that tells exactly the same story.

  • Tong, David (2007). "Quantum Field Theory". David Tong at University of Cambridge. Retrieved 2015-03-07. {{cite web}}: Invalid |ref=harv (help)
  • de Wit, B.; Smith, J. (1986). Field Theory in Particle Physics. North-Holland Personal Library. Vol. 1. North-Holland. ISBN 978-0444869999. {{cite book}}: Invalid |ref=harv (help)Appendix E
  • Weinberg, S. (2002), The Quantum Theory of Fields, vol. I, Cambridge University Press, ISBN 0-521-55001-7

Possibility[edit]

There is the possibility that the definition of a Clifford algebra differs between physics and mathematics. Physicists tend to define it as a set of matrices satisfying a set of anticommutation relations. This is also the definition used in the disputed article. The difference (if any) is that this may not be the "freest" algebra satisfying the anticommutation relations. YohanN7 (talk) 14:09, 9 March 2015 (UTC)[reply]

The fact that there are two non-equivalent representations in odd spacetime dimension (physics convention) is incompatible with any of them being the Clifford algebra (mathematics convention). Could we have someone more chip in here? YohanN7 (talk) 14:53, 9 March 2015 (UTC)[reply]

That you can't answer these questions yourself suggests that you barely understand gamma matrices, which would ordinarily be fine for someone asking questions on the ref desk but is pretty disturbing for someone who's been editing the gamma-matrix article for years and who wrote this and this yesterday. -- BenRG (talk) 19:18, 9 March 2015 (UTC)[reply]
Oh, that's how I learn - by writing Wikipedia articles about things I do not know. I'll never write about something I know completely, it would bore me to death. You might disapprove of the practice, but I can usually (as I did this time) back up my writings with references. I have never claimed to be an expert, whereas you immediately and incorrectly conclude "Weinberg is making mistakes". I believe there is a Nobel prize between you and him. He is known to make shockingly few mistakes in his publications.
Quondum and I have a long history of disagreement. This time none of us was wrong, just following different conventions, and I was following the convention of the article and of mathematical physics. This has not usually been the case before. I have had plenty of reason to have my alarm turned on whenever Q starts debating or reverting using words such as "surely" and "clearly" or "obviously". It often means he is about to say something wrong, see for instance the last thread on the same talk page. But, yes, I do regret posting at his page. YohanN7 (talk) 21:06, 9 March 2015 (UTC)[reply]