From Wikipedia, the free encyclopedia

Mathematics desk
< May 27	<< Apr | May | Jun >>	May 29 >

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.

Contents 1 May 28 1.1 Season 1.2 Mappings 1.3 Diagonalizing a matrix. 1.4 Set Notation

[edit] May 28

[edit] Season

If a sporting league consisted of n teams, which each played g games, how many games would there be in total? —Preceding unsigned comment added by 76.69.241.74 (talk) 04:12, 28 May 2008 (UTC)

• Rather than giving you the answer, let's look at it this way... Major League Baseball has 30 teams, each of which are scheduled to play 162 games. According to Major League Baseball season, that comes out to 2430 scheduled games per season. How does one get that figure? Alternatively, try to break it down into a scenario such as this: you have 6 teams, each of which has to play the other teams exactly once each. How many situations can you form based on this? I hope this leads you in the right direction. --Kinu ^t/_c 04:32, 28 May 2008 (UTC)
• Hint: You'll need to consider how many teams take part in each game. --Tango (talk) 10:13, 28 May 2008 (UTC)

I initially though n*g/2, but someone told me, and he seems quite knowledgable in sports, that there are 1335 games in an NHL season (30 teams and 82 games apiece). So is he wrong (predicted value=1230)? —Preceding unsigned comment added by 76.69.241.74 (talk) 03:04, 29 May 2008 (UTC)

The regular season does hold 1230 contests, as the formula (which you are correct on) dictates. I'm assuming the difference (105 games) your friend is including is the maximum number of playoff games (7 game series) that could be played in the postseason: 8 first round series, 4 conference semifinal series, 2 conference final series, and 1 Stanley Cup final series; 7*(8+4+2+1)=105. --Kinu ^t/_c 04:22, 29 May 2008 (UTC)

[edit] Mappings

.

What are the number of mappings from ?

My book gives the straight answer as but I was wondering how to arrive at that conclusion, I assume by induction. If there are n mappings from 1 to S, and n mappings from 2 to S, and n mappings from 3 to S, and so on then there are n * n * n e.t.c mappings from S to S, but this doesn't convince me. Any thoughts? Damien Karras (talk) 14:08, 28 May 2008 (UTC)

There's no need to use induction: your reasoning seems perfectly sound to me. To reword it only slightly, there are n choices for what 1 maps to, n choices for 2, etc, and these choices are independent, so the total number is n*n. Try doing it explicitly for n = 2 or 3 and it might become clearer. AndrewWTaylor (talk) 14:31, 28 May 2008 (UTC)

Actually, any function from S to itself can be considered as an ordered n-tuple (the i-th entry in the tuple tells you what element i gets mapped to). Count the number of such n-tuples. –King Bee ^{(τ • γ)} 16:23, 28 May 2008 (UTC)

I'm pretty sure Andrew meant , with n*n being either a typo or part of a larger description which was cut short due to lack of space. -- Meni Rosenfeld (talk) 16:46, 28 May 2008 (UTC)

Oops, you're quite right Meni, I did indeed mean . Thanks for the correction. (I've amended my previous comment.) AndrewWTaylor (talk) 19:14, 28 May 2008 (UTC)

[edit] Diagonalizing a matrix.

Regarding diagonalizing matrices, I know that a matrix P whose columns are linearly independent eigenvectors will always diagonalize a matrix by taking P^-1AP, and that a matrix is diagonalizable iff it has a full set of linearly independent eigenvectors. What I can’t figure out is if those are the only such matrices. Specifically, if at least one of the columns of P is not in an eigenspace of an eigenvalue of A, is it possible that P^-1AP is a diagonal matrix?

More generally, if one has a linear transformation of vector spaces , does the corresponding result hold for infinite dimensional vector spaces? GromXXVII (talk) 16:55, 28 May 2008 (UTC)

The columns of P must be eigenvectors of A. Let . For every i, denote P_i the ith column of P, and ε_i = AP_i − λ_iP_i. Then . Therefore P ^{− 1}ε_i = 0, ε_i = 0 and AP_i = λ_iP_i.

I don't know about the infinite dimensional case. -- Meni Rosenfeld (talk) 17:31, 28 May 2008 (UTC)

[edit] Set Notation

I have a set of classes, C, and a set of documents, D. I want to define a relation, B, that says which documents belong to which classes.

I then want to sum over all documents of a particular class, c.

I think the relation can be defined either with

or

My question is, how can I express the subset of documents belonging to class c?

My guess was something like

Thanks, 80.175.114.193 (talk) 21:59, 28 May 2008 (UTC)

I don't think you want the "there exists c" bit - that means any c, I think you mean a specific c, so you just want {d|(d,c) in B}, or, a shorter notation: {d|dBc} (using B in the same way we use =, <, > or whatever). --Tango (talk) 22:08, 28 May 2008 (UTC)

Ah yes, that makes lots of sense. It's surprising how simple it is when you see it. Proberts2003 (talk) 22:26, 28 May 2008 (UTC) [Same user as 80.175.114.193 above]

Also, the statement "" is identical to just "", so you could also simply have . It makes it less clear that you are summing over different ds, though. -- Meni Rosenfeld (talk) 22:51, 28 May 2008 (UTC)

I believe the usual notation for that would be —Ilmari Karonen (talk) 22:57, 28 May 2008 (UTC)

(ec) Or you could even define D(c) = {d|(d,c) ∈ B} and then just write your sum over d ∈ D(c). You could even use that notation exclusively, starting with a definition of D(c) as a function of c and writing d ∈ D(c) instead of (d,c) ∈ B or dBc. Of course, if you also need the sets of classes for a particular document, C(d) = {c|(d,c) ∈ B}, then going with the relational notation as suggested by Tango may be simpler. —Ilmari Karonen (talk) 22:57, 28 May 2008 (UTC)

Or, better yet, since c is supposed to be a class, why not simply define it as the set of documents it contains? Then you could simply write d ∈ c. —Ilmari Karonen (talk) 23:00, 28 May 2008 (UTC)