text stringlengths 1 2.12k | source dict |
|---|---|
My reply was that, in fact, I prefer the method used by Wikipedia here, which I imagine is less often used in current textbooks (at least at an introductory level). There are a couple reasons to prefer it. One is that only this way is appropriate to applications in which the variables, unlike the typical generic x and y, have specific meanings, so that they can’t be interchanged (see below for an example); another is that this method forces us to get out of the rut of assuming that x is always the independent variable, and y is always dependent.
What they're doing is correct, and in fact is what I prefer. The confusion is probably because you are used to always thinking of y as a function of x.
(It troubles me that texts often ask questions like "Does the equation x + y^2 = 1 represent a function?" when they really mean to ask if it represents y as a function of x. In that example, x is a function of y, though y is not a function of x. A function is about the relationship between two variables, not what they are called.)
What Wikipedia has done is not to exchange the NAMES of the variables in the function, as usual, but just to change their ROLES. By solving for x, they are determining how x (the "input" of f) can be found given y (the "output" of f). That is exactly what it means to find an inverse. | {
"domain": "themathdoctors.org",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9902915212263165,
"lm_q1q2_score": 0.8568240626122143,
"lm_q2_score": 0.865224072151174,
"openwebmath_perplexity": 423.6984284395517,
"openwebmath_score": 0.7663712501525879,
"tags": null,
"url": "https://www.themathdoctors.org/how-to-find-an-inverse-function-conflicting-approaches/"
} |
If you recognize that x and y are just dummy variables, you see that Wikipedia’s form, $$f^{-1}(y) = \frac{y \, – \, 7}{3}$$, and Maureen’s form, $$f^{-1}(x) = \frac{x \, – \, 7}{3}$$, are really the same function, just with different names for the variable. By not changing the variable names at the start, Wikipedia ends up with y as the independent variable – not what most students are used to, but perfectly legal. And in fact, the main idea of an inverse function is precisely that we are changing the roles of the variables: what was the input of the original function becomes the output of the inverse function, and vice versa. What they are called is far less important that what they mean.
But Maureen needed more help:
Maybe my difficulty is from a graphing point of view.
If you graph ...
y = 3x + 1
... and you create a table of values for x and y, and then you graph ...
x = (y - 1)/3
... you get the same graph, since the tables are the same. When graphing an inverse from a table of values, you specifically interchange the x's and y's, because if you do not, you have the same table.
I feel students (or possibly just me) confuse a different way of writing a function with the inverse function. Specifically y = ln x is the same function as e^y = x. One is NOT the inverse of the other. The inverse of y = ln x is x = ln y, or e^x = y.
The two equations she graphed are actually different functions (y as a function of x, and x as a function of y); but they are equivalent equations (relating the same pairs of x and y), which is why they are represented by the same graph. Maureen has confused functions with equations. In reality, the second function, $$f^{-1}(y) = \frac{y \, – \, 1}{3}$$, is the inverse of the first, $$f(x) = 3x + 1$$, where x and y have kept the same name but changed roles.
Now consider the logarithm. This is written explicitly as a function the name of which is "ln" rather than "f" or "g," but it is the same idea. If I write ...
y = ln(x) | {
"domain": "themathdoctors.org",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9902915212263165,
"lm_q1q2_score": 0.8568240626122143,
"lm_q2_score": 0.865224072151174,
"openwebmath_perplexity": 423.6984284395517,
"openwebmath_score": 0.7663712501525879,
"tags": null,
"url": "https://www.themathdoctors.org/how-to-find-an-inverse-function-conflicting-approaches/"
} |
y = ln(x)
... I am using the ln function to express y as a function of x. This equation also expresses (implicitly) x as a function of y, since ln is one-to-one. When you solve for x to make the latter function explicit, you have
x = e^y
This explicitly states a different function than ...
y = ln(x)
... although the relation between the variables is the same.
If we were to name the new function, calling it exp, so that ...
x = exp(y)
= e^y
... the named function exp clearly is not the same function as ln. But nothing has changed except for giving it a name. The equation expresses x as a function of y, named or not.
So when we interchange the variables and change y = ln(x) to x = ln(y), we are, as you say, inverting the function -- in the sense of what function y is of x. We have changed the relationship between x and y. But in another sense, it is still the same function (as explicitly written), just expressed with different placeholders.
So there are two perspectives on what constitutes an inverse. In one sense, just swapping the variables implicitly inverts the relationship, by swapping implied roles (x becomes y); but the inverse is shown explicitly by solving for the other variable, regardless of what you call it (input becomes output).
My answer to another of the four questions I referred to above includes an example of the situation where swapping of variables is meaningless, and you must use the other approach:
Inverting, Subverted
Both approaches are valid. The first is best when the variable names mean something, so that changing their names would not make sense. For example, you wouldn't say that the inverse of C = f(r) = 2 pi r is f^-1(r) = r/(2 pi), where r has now become the circumference. Rather, you would say that r = f^-1(C) = C/(2 pi). | {
"domain": "themathdoctors.org",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9902915212263165,
"lm_q1q2_score": 0.8568240626122143,
"lm_q2_score": 0.865224072151174,
"openwebmath_perplexity": 423.6984284395517,
"openwebmath_score": 0.7663712501525879,
"tags": null,
"url": "https://www.themathdoctors.org/how-to-find-an-inverse-function-conflicting-approaches/"
} |
Your trouble, I believe, is that you are thinking of the variable names as if they had a fixed meaning somewhat like that, but using the method of inverting that requires you to swap names. You ask about "the inverse ofy" rather than of the FUNCTION, making y a name for the function itself. You can't invert a variable, only a function. And if you do think of y as the same thing as f(x), you can't swap variable names and still say that.
In fact, in my circumference example above, I was initially going to call the function C(r), which is done commonly, naming the function for its output; but it would make no sense to call the inverse C^-1. If anything, we would call the inverse r(C), since it gives the value of r that yields a given circumference C. I didn't do that because it would not fit the inverse notation you are using, and would just add confusion. (If it does, ignore this paragraph!)
I prefer the first method of inverting I showed, because it helps to free students from fixating on x as the independent variable, and avoids the change of meaning that is confusing to you and others. Unfortunately, I have to teach the second in algebra classes, because it is what most students seem to see elsewhere.
For the record, the other two questions I referred to are
Graphs of Inverse Functions
Inverting Functions
The final thanks in the latter, a long, rambling discussion, are worth ending with:
The terminology and explanation has solidified my understanding. I believe my confusion was, as you pointed out, that "An equation does not define a function!" This is very important and I have never thought of it that way. It could be because I never read that somewhere or was never taught that or most importantly never had to think of them that way until now.
### 1 thought on “How to Find an Inverse Function: Conflicting Approaches”
This site uses Akismet to reduce spam. Learn how your comment data is processed. | {
"domain": "themathdoctors.org",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9902915212263165,
"lm_q1q2_score": 0.8568240626122143,
"lm_q2_score": 0.865224072151174,
"openwebmath_perplexity": 423.6984284395517,
"openwebmath_score": 0.7663712501525879,
"tags": null,
"url": "https://www.themathdoctors.org/how-to-find-an-inverse-function-conflicting-approaches/"
} |
# CO-Pipelining-Q1
A pipeline of 2 stages with a delay of x units each is split to n stages. In the new design, each stage has a delay of x/n units. To get the throughput increase of 1700% what would be the n value?
reshown Jun 13
1700/100=17
17+1=18
n=18
answered Jun 13 by (19,690 points)
answered Jun 13 by (160 points)
+1 vote
let initial throughput be 100. required throughput is 1800.
speedup = 1800/100 = 18
In the first pipeline, each instruction will get completed after x units, and in the second pipeline, each instruction will get completed after x/n units
speedup = x / (x/n)
= n
therefore n = 18
answered Jun 14 by (4,100 points)
Comment if you find any issues.
Pipeline 1
One instruction <----- x units
? <-------------------------1 unit
$= \frac{1}{x} units$
Pipeline 2
One instruction ----> x/n units
? -----------------------> 1 units
$= \frac{n}{x} units$
$percentage \ of \ gain\ in \ throughput = \frac{old value- new value}{old value} * 100$
1700 = (n-1)* 100
17 = n-1
18=n
answered Jun 14 by (31,090 points)
edited Jun 15
In pipeline 1, stage delay= x units. If we consider the CPI(cycles per instruction as 1), which is considered until no stalls are given.
Thus each instruction takes x time units.
Throughput in Pipeline 1 = 1/x
Similarly, every instruction in pipeline 2 takes x/n time units.
Thus, throughput in pipeline 2 = 1/(x/n) = n/x
% increase in throughput = ((new-old)/old)*100
1700 =(((n/x)-(1/x))/(1/x)*100
17 =n-1
18 = n
Yes you are correct. corrected the answer.
In this question (http://thegatebook.in/qa/4507) the throughput is (no. of stages / max stage time) so why in the above question. its only 1/x? | {
"domain": "thegatebook.in",
"id": null,
"lm_label": "1. Yes\n2. Yes",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9591542887603538,
"lm_q1q2_score": 0.8568215473258997,
"lm_q2_score": 0.893309405344251,
"openwebmath_perplexity": 12445.317134561208,
"openwebmath_score": 0.31003907322883606,
"tags": null,
"url": "http://thegatebook.in/qa/4499/co-pipelining-q1?show=4563"
} |
# Open subset containing all terms of a sequence but a finite number
Does an open subset containing all points of a concergent sequence but a finite number of them necessarily contain the sequence's limit ?
Ideally, I would like an answer for each of the following :
-general topology
-Haussdorf (T2)
-metric
My intuition is that it doesn't, because even in a metric space, the radius of a ball centered at each point of the sequence and contained in the open subset may be forced to vary over the sequence.
No. Take, in $\mathbb R$ with the usual topology, the sequence $\left(\frac1n\right)_{n\in\mathbb N}$ and the open set $(0,+\infty)$.
The answer is no for all three. Consider the sequence $\frac{1}{n} \in \mathbb{R}$, and consider the open set $(0, 2)$. This open set contains all but finitely many of the sequences points (in fact, it contains all the sequences points), but it does not contain the sets limit, 0. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9861513914124558,
"lm_q1q2_score": 0.8567947342836838,
"lm_q2_score": 0.8688267762381843,
"openwebmath_perplexity": 149.2808415289387,
"openwebmath_score": 0.940449059009552,
"tags": null,
"url": "https://math.stackexchange.com/questions/2555710/open-subset-containing-all-terms-of-a-sequence-but-a-finite-number/2555718"
} |
# Thread: Equations with the exponential function.
1. ## Equations with the exponential function.
Hello
I know this is elementary, but I don't know how solve this:
The question is, find the exact value(s) of x which satisfy the equation.
$e^{2x} = e^x +12$
I am not confident working with logarithms, although I do know the laws for the sum and difference of logarithms. I can do the other questions in this exercise, but not this one.
I know if the question was:
$e^{2x} = 12$
$x = \dfrac{1}{2}\ln12$
Some help would be very much appreciated. Thank you.
2. ## Re: Equations with the exponential function.
Originally Posted by Furyan
Hello
I know this is elementary, but I don't know how solve this:
The question is, find the exact value(s) of x which satisfy the equation.
$e^{2x} = e^x +12$
I am not confident working with logarithms, although I do know the laws for the sum and difference of logarithms. I can do the other questions in this exercise, but not this one.
I know if the question was:
$e^{2x} = 12$
$x = \dfrac{1}{2}\ln12$
Some help would be very much appreciated. Thank you.
$e^{2x} - e^x - 12 = 0$
$(e^x - 4)(e^x + 3) = 0$
finish it
3. ## Re: Equations with the exponential function.
Dear Skeeter
Originally Posted by skeeter
$e^{2x} - e^x - 12 = 0$
$(e^x - 4)(e^x + 3) = 0$
finish it
A quadratic in $e$, that was left field and I wasn't looking for it. Should have seen it though.
$x = \ln4 = 2\ln2$
$e^x = -3$ has no solutions.
Thank you very much indeed.
4. ## Re: Equations with the exponential function.
Hopefully, you know that $e^{2x}= (e^x)^2$. If you let $y= e^x$, the equation becomes $y^2= y+ 12$ which is the same as $y^2- y- 12= 0$, a quadratic equation in y. If you did not notice that this could be factored as $(y- 4)(y+ 3)$, you could solve it by completing the square or using the quadratic formula.
5. ## Re: Equations with the exponential function.
Hello HallsofIvy | {
"domain": "mathhelpforum.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9861513895809328,
"lm_q1q2_score": 0.8567947310176881,
"lm_q2_score": 0.8688267745399465,
"openwebmath_perplexity": 433.27276693135957,
"openwebmath_score": 0.8681946396827698,
"tags": null,
"url": "http://mathhelpforum.com/pre-calculus/194793-equations-exponential-function.html"
} |
5. ## Re: Equations with the exponential function.
Hello HallsofIvy
Originally Posted by HallsofIvy
Hopefully, you know that $e^{2x}= (e^x)^2$. If you let $y= e^x$, the equation becomes $y^2= y+ 12$ which is the same as $y^2- y- 12= 0$, a quadratic equation in y. If you did not notice that this could be factored as $(y- 4)(y+ 3)$, you could solve it by completing the square or using the quadratic formula.
Thank you. I do find letting $y= e^x$ and solving the quadratic in $y$ easier to get my head round. I was able to factor that one.
6. ## Re: Equations with the exponential function.
Hello, Furyan!
Find the exact value(s) of $x$ which satisfy the equation."
. . $e^{2x} - e^x -12\:=\:0$
As skeeter pointed out, this is a quadratic equation.
There is a way to recognize this phenomenon.
There are usually three terms, written in standard order.
If the first term has twice the exponent of the second term,
. . we may have a quadratic.
In your problem: . $e^{2(x)} - e^x - 12 \:=\:0$
Another example: . $x^6 - 7x^3 - 8 \:=\:0$
Note that we have: . $\left(x^3\right)^2 - 7(x^3) - 8 \:=\:0$
Let $u \,=\,x^3$
Then we have: . $u^2 - 7u - 8 \:=\:0$
. . $(u-8)(u+1) \:=\:0 \quad\Rightarrow\quad u \:=\:8,\text{-}1$
Back-substitute: . $\begin{Bmatrix}x^3 \:=\:8 & \Rightarrow & x \:=\:2 \\ x^3 \:=\:\text{-}1 & \Rightarrow & x \:=\:\text{-}1 \end{Bmatrix}$
And there are four complex roots as well.
7. ## Re: Equations with the exponential function.
Hello Soroban
Originally Posted by Soroban
Hello, Furyan!
As skeeter pointed out, this is a quadratic equation.
There is a way to recognize this phenomenon.
There are usually three terms, written in standard order.
If the first term has twice the exponent of the second term,
. . we may have a quadratic.
In your problem: . $e^{2(x)} - e^x - 12 \:=\:0$
Another example: . $x^6 - 7x^3 - 8 \:=\:0$
Note that we have: . $\left(x^3\right)^2 - 7(x^3) - 8 \:=\:0$
Let $u \,=\,x^3$ | {
"domain": "mathhelpforum.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9861513895809328,
"lm_q1q2_score": 0.8567947310176881,
"lm_q2_score": 0.8688267745399465,
"openwebmath_perplexity": 433.27276693135957,
"openwebmath_score": 0.8681946396827698,
"tags": null,
"url": "http://mathhelpforum.com/pre-calculus/194793-equations-exponential-function.html"
} |
Note that we have: . $\left(x^3\right)^2 - 7(x^3) - 8 \:=\:0$
Let $u \,=\,x^3$
Then we have: . $u^2 - 7u - 8 \:=\:0$
. . $(u-8)(u+1) \:=\:0 \quad\Rightarrow\quad u \:=\:8,\text{-}1$
Back-substitute: . $\begin{Bmatrix}x^3 \:=\:8 & \Rightarrow & x \:=\:2 \\ x^3 \:=\:\text{-}1 & \Rightarrow & x \:=\:\text{-}1 \end{Bmatrix}$
And there are four complex roots as well.
Thank you for that. I will be sure to look out for this sort of equation in the future. | {
"domain": "mathhelpforum.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9861513895809328,
"lm_q1q2_score": 0.8567947310176881,
"lm_q2_score": 0.8688267745399465,
"openwebmath_perplexity": 433.27276693135957,
"openwebmath_score": 0.8681946396827698,
"tags": null,
"url": "http://mathhelpforum.com/pre-calculus/194793-equations-exponential-function.html"
} |
If $ab=3$ and $\frac1{a^2}+\frac1{b^2}=4,$ then $(a-b)^2=\;$?
If $ab=3$ and $\frac1{a^2}+\frac1{b^2}=4$, what is the value of $(a-b)^2$? I think $a^2+b^2=36$, please confirm and is it possible to to figure out one of the variables?
-
You are right and going well, and yes we can figure the values of each variable. But it is not necessary to do so :) – chubakueno Jun 3 '14 at 18:03
What happens if you expand $(a - b)^2$? – David K Jun 3 '14 at 18:05
$$\frac1{a^2}+\frac1{b^2}=4$$ $$a^2b^2\left(\frac1{a^2}+\frac1{b^2} \right)=4a^2b^2$$ $$b^2+a^2=(2ab)^2$$ $$a^2-2ab+b^2=(2ab)^2-2ab$$ $$(a-b)^2=(2ab)^2-2ab=(2\cdot3)^2-2\cdot3=30$$
-
Your answer is good but try to add some words for the explanation. – Tunk-Fey Jun 3 '14 at 18:24
@Tunk-Fey - Why? each step flows well from the prior one. – JoeTaxpayer Jun 3 '14 at 19:17
@JoeTaxpayer Just in case the OP doesn't understand. You may take a look Andre Nicolas' answer. – Tunk-Fey Jun 3 '14 at 19:27
He states 'you know that $(a-b)^2=30$ ' - but it's not clear that we do. That's the question OP is asking. – JoeTaxpayer Jun 3 '14 at 19:39
Hints:
$\frac{1}{a^2}+\frac{1}{b^2} = 4 \rightarrow b^2 + a^2 = 4(ab)^2$
$(a-b)^2 = (a^2+b^2) -2(ab)$
edit:
To solve for a particular variable, you can use $ab=3 \rightarrow a = \frac{3}{b}$ to eliminate a variable. For example $a^2+b^2 = \frac{9}{b^2}+b^2$
-
I already know that (a-b)² =30 so how would you figure out one of the variables – user154989 Jun 3 '14 at 18:10
You know that $(a-b)^2=30$. The same strategy tells you that $(a+b)^2=42$. Thus $$a+b=\pm \sqrt{42}\quad\text{and}\quad a-b=\pm\sqrt{30}.$$ Now by adding and subtracting, we can find $2a$ and $2b$. and hence $a$ and $b$. Note that there are $4$ combinations, though if we have found one solution $a=p$, $b=q$, the other three are $a=-p$, $b=-q$, and $a=q$, $b=p$, and $a=-q$, $b=-p$.
One of the solutions is $a=\frac{\sqrt{42}+\sqrt{30}}{2}$, $b=\frac{\sqrt{42}-\sqrt{30}}{2}$. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9861513897844354,
"lm_q1q2_score": 0.8567947244956182,
"lm_q2_score": 0.8688267677469952,
"openwebmath_perplexity": 414.3301348425411,
"openwebmath_score": 0.7680529356002808,
"tags": null,
"url": "http://math.stackexchange.com/questions/819547/if-ab-3-and-frac1a2-frac1b2-4-then-a-b2"
} |
One of the solutions is $a=\frac{\sqrt{42}+\sqrt{30}}{2}$, $b=\frac{\sqrt{42}-\sqrt{30}}{2}$.
-
This is right, of course, but it misses the point: this question is all about the symmetry in the equations, and avoiding having to solve for the values of $a$ and $b$ separately. I wish any of my high school teachers would have explained the idea that you sometimes don't care about the values of each part of an expression. – symplectomorphic Jun 3 '14 at 19:30
I was answering the question that OP had, in a comment, about solving for $a$ and $b$, given that OP already knew the value of $(a-b)^2$. The point about the solution is that it "breaks symmetry" very late in the game. Completely agree about the importance of exposure to symmetric functions. – André Nicolas Jun 3 '14 at 19:34
In fact, since I trust your judgment, Andre, do you know of a textbook that looks closely at these kinds of algebraic tricks? I think heavily symmetric equations often arise in geometry (and math competitions). But I can't think of a reference that systematically discusses problems like "if $a+b=5$ and $a^2+b^2=10$, what's the value of $ab$?" where the point isn't to find $a$ and $b$ separately. – symplectomorphic Jun 3 '14 at 19:35
I cannot think of a good source. Problem collections aimed below the Olympiad level often have symmetric examples. Algebra books used to cover this kind of material. Alas, no more. – André Nicolas Jun 3 '14 at 19:39
Alas indeed. I've written my own notes on this material and was always surprised I could never ever find a thorough, exhaustive discussion of this sort of technique. The competition books are always terse: they present a few examples but leave out the really interesting discussion of what's going on. Thanks though. – symplectomorphic Jun 3 '14 at 19:42 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9861513897844354,
"lm_q1q2_score": 0.8567947244956182,
"lm_q2_score": 0.8688267677469952,
"openwebmath_perplexity": 414.3301348425411,
"openwebmath_score": 0.7680529356002808,
"tags": null,
"url": "http://math.stackexchange.com/questions/819547/if-ab-3-and-frac1a2-frac1b2-4-then-a-b2"
} |
GMAT Question of the Day: Daily via email | Daily via Instagram New to GMAT Club? Watch this Video
It is currently 03 Apr 2020, 19:38
### GMAT Club Daily Prep
#### Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized
for You
we will pick new questions that match your level based on your Timer History
Track
every week, we’ll send you an estimated GMAT score based on your performance
Practice
Pays
we will pick new questions that match your level based on your Timer History
### Show Tags
19 Jun 2011, 06:55
10
00:00
Difficulty:
65% (hard)
Question Stats:
54% (01:30) correct 46% (01:50) wrong based on 186 sessions
### HideShow timer Statistics
Jerry purchased a 1-year $5,000 bond that paid an annual interest rate of 4% compounded every six months. How much interest had this bond accrued at maturity? A.$5102
B. $408 C.$216
D. $202 E.$200
GMAT Club Legend
Joined: 11 Sep 2015
Posts: 4579
GMAT 1: 770 Q49 V46
Re: Jerry purchased a 1-year $5,000 bond that paid an annual [#permalink] ### Show Tags 13 Sep 2017, 11:37 2 Top Contributor 1 guygmat wrote: Jerry purchased a 1-year$5,000 bond that paid an annual interest rate of 4% compounded every six months. How much interest had this bond accrued at maturity?
A. $5102 B.$408
C. $216 D.$202
E. $200 The ANNUAL interest rate = 4% So, every 6 MONTHS, we get 2% interest. Since there are only 2 "compoundings," we can forgo the formula and do some quick mental calculations... INITIAL VALUE:$5000
AFTER 6 MONTHS: 2% of $5000 =$100 in interest
So, the value after 6 months = $5000 +$100 = $5100 AFTER 12 MONTHS: 2% of$5100 = $102 in interest So, the value after 12 months =$5100 + $102 =$5202
How much interest had this bond accrued at maturity?
### Show Tags
12 Sep 2017, 03:09
Here P = 5000
r=4%
time = 1 year
As the amount is compounded annually n = 2 | {
"domain": "gmatclub.com",
"id": null,
"lm_label": "1. Yes\n2. Yes",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.967410262750752,
"lm_q1q2_score": 0.8567689753266625,
"lm_q2_score": 0.8856314723088733,
"openwebmath_perplexity": 10184.755527266267,
"openwebmath_score": 0.5554371476173401,
"tags": null,
"url": "https://gmatclub.com/forum/jerry-purchased-a-1-year-5-000-bond-that-paid-an-annual-115643.html?kudos=1"
} |
12 Sep 2017, 03:09
Here P = 5000
r=4%
time = 1 year
As the amount is compounded annually n = 2
Compound interest formula = $$A = p* (1+\frac{r}{n*100}) ^n^t$$
$$A = 5000* (1+\frac{4}{2*100}) ^(2*1)$$
A= 5202
So Interest earned = 5202 - 5000 = 202
Senior SC Moderator
Joined: 22 May 2016
Posts: 3666
Jerry purchased a 1-year $5,000 bond that paid an annual [#permalink] ### Show Tags 13 Sep 2017, 10:14 guygmat wrote: Jerry purchased a 1-year$5,000 bond that paid an annual interest rate of 4% compounded every six months. How much interest had this bond accrued at maturity?
A. $5102 B.$408
C. $216 D.$202
E. $200 Estimate Without the compound interest formula (I use it, but with short periods and low interest rate, often you can estimate): Simple interest would yield .04 * 5,000 =$200 in one year
Compound interest at this low rate (halved and paid twice), after only one year, will be barely above that.
Answer D, $202 is barely above$200.
Stages
If unsure about Answer C ($216), run a quick "in stages" calculation. If interest is paid every 6 months, the 4 percent is split in half (two periods of six months in one year). After first six months, interest payment is$5,000 * 02 = $100 (add$100 to principal for next stage)
After next six months,
.02 * $5,100 =$102
Total interest paid: $202 ANSWER D _________________ Visit SC Butler, here! Get two SC questions to practice, whose links you can find by date. Never doubt that a small group of thoughtful, committed citizens can change the world; indeed, it's the only thing that ever has. -- Margaret Mead Director Joined: 02 Sep 2016 Posts: 629 Re: Jerry purchased a 1-year$5,000 bond that paid an annual [#permalink]
### Show Tags
14 Sep 2017, 04:57
Simple interest= 5000*4*1/100= 200 | {
"domain": "gmatclub.com",
"id": null,
"lm_label": "1. Yes\n2. Yes",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.967410262750752,
"lm_q1q2_score": 0.8567689753266625,
"lm_q2_score": 0.8856314723088733,
"openwebmath_perplexity": 10184.755527266267,
"openwebmath_score": 0.5554371476173401,
"tags": null,
"url": "https://gmatclub.com/forum/jerry-purchased-a-1-year-5-000-bond-that-paid-an-annual-115643.html?kudos=1"
} |
### Show Tags
14 Sep 2017, 04:57
Simple interest= 5000*4*1/100= 200
So the answer would be a number that is slightly more than 200 i.e. 202.
Board of Directors
Status: QA & VA Forum Moderator
Joined: 11 Jun 2011
Posts: 4875
Location: India
GPA: 3.5
Re: Jerry purchased a 1-year $5,000 bond that paid an annual [#permalink] ### Show Tags 09 Oct 2018, 07:18 guygmat wrote: Jerry purchased a 1-year$5,000 bond that paid an annual interest rate of 4% compounded every six months. How much interest had this bond accrued at maturity?
A. $5102 B.$408
C. $216 D.$202
E. $200 $$5000( 1 + \frac{4}{200})^2 - 5000$$ $$= 5202 - 5000$$ $$= 202$$, Answer must be (D) _________________ Thanks and Regards Abhishek.... PLEASE FOLLOW THE RULES FOR POSTING IN QA AND VA FORUM AND USE SEARCH FUNCTION BEFORE POSTING NEW QUESTIONS How to use Search Function in GMAT Club | Rules for Posting in QA forum | Writing Mathematical Formulas |Rules for Posting in VA forum | Request Expert's Reply ( VA Forum Only ) Target Test Prep Representative Status: Founder & CEO Affiliations: Target Test Prep Joined: 14 Oct 2015 Posts: 9952 Location: United States (CA) Re: Jerry purchased a 1-year$5,000 bond that paid an annual [#permalink]
### Show Tags
12 Oct 2018, 06:52
guygmat wrote:
Jerry purchased a 1-year $5,000 bond that paid an annual interest rate of 4% compounded every six months. How much interest had this bond accrued at maturity? A.$5102
B. $408 C.$216
D. $202 E.$200
Since the annual interest rate is 4%, we see that the bond earns 2% every half-year, or 6 months. Thus, for the first 6 months, the amount of interest earned was 0.02 x 5,000 = 100 dollars. Thus, the new principal at the end of the first 6 months was 5,000 + 100 = 5,100 dollars.
For the next 6 months, the amount of interest earned was 0.02 x 5100 = 102 dollars.
So total interest earned is 202 dollars.
_________________
# Scott Woodbury-Stewart
Founder and CEO
Scott@TargetTestPrep.com
197 Reviews | {
"domain": "gmatclub.com",
"id": null,
"lm_label": "1. Yes\n2. Yes",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.967410262750752,
"lm_q1q2_score": 0.8567689753266625,
"lm_q2_score": 0.8856314723088733,
"openwebmath_perplexity": 10184.755527266267,
"openwebmath_score": 0.5554371476173401,
"tags": null,
"url": "https://gmatclub.com/forum/jerry-purchased-a-1-year-5-000-bond-that-paid-an-annual-115643.html?kudos=1"
} |
_________________
# Scott Woodbury-Stewart
Founder and CEO
Scott@TargetTestPrep.com
197 Reviews
5-star rated online GMAT quant
self study course
See why Target Test Prep is the top rated GMAT quant course on GMAT Club. Read Our Reviews
If you find one of my posts helpful, please take a moment to click on the "Kudos" button.
Non-Human User
Joined: 09 Sep 2013
Posts: 14463
Re: Jerry purchased a 1-year $5,000 bond that paid an annual [#permalink] ### Show Tags 06 Jan 2020, 17:49 Hello from the GMAT Club BumpBot! Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos). Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email. _________________ Re: Jerry purchased a 1-year$5,000 bond that paid an annual [#permalink] 06 Jan 2020, 17:49
Display posts from previous: Sort by | {
"domain": "gmatclub.com",
"id": null,
"lm_label": "1. Yes\n2. Yes",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.967410262750752,
"lm_q1q2_score": 0.8567689753266625,
"lm_q2_score": 0.8856314723088733,
"openwebmath_perplexity": 10184.755527266267,
"openwebmath_score": 0.5554371476173401,
"tags": null,
"url": "https://gmatclub.com/forum/jerry-purchased-a-1-year-5-000-bond-that-paid-an-annual-115643.html?kudos=1"
} |
My Math Forum One number is four more than five times another. If their sum is decreased by six....
Algebra Pre-Algebra and Basic Algebra Math Forum
February 29th, 2016, 08:36 AM #1 Senior Member Joined: Feb 2016 From: seattle Posts: 377 Thanks: 10 One number is four more than five times another. If their sum is decreased by six.... One number is four more than five times another. If their sum is decreased by six, the result is ten. Find the numbers. I tried to write the equation from reading this. Is this anywhere near close? x+4+5x-6=10 Thanks. Last edited by skipjack; February 29th, 2016 at 10:07 PM.
February 29th, 2016, 08:49 AM #2
Math Team
Joined: Oct 2011
Posts: 14,597
Thanks: 1038
Quote:
Originally Posted by GIjoefan1976 One number is four more than five times another. If their sum is decreased by six, the result is ten. Find the numbers. I tried to write the equation from reading this. Is this anywhere near close? x+4+5x-6=10
Solve the equation for x.
Then test it yourself by substituting...
February 29th, 2016, 09:13 AM #3
Senior Member
Joined: Feb 2016
From: seattle
Posts: 377
Thanks: 10
Quote:
Originally Posted by Denis Solve the equation for x. Then test it yourself by substituting...
Okay, I don't understand what you mean by "substituting"
and both this time, and last time I can get the first number being 2.
yet then I go 2 plus 4 =6 * 5 is 30 -6 =24
so not yet figuring out why it is not working for me.
February 29th, 2016, 09:18 AM #4 Math Team Joined: Dec 2013 From: Colombia Posts: 7,675 Thanks: 2655 Math Focus: Mainly analysis and algebra First of all, you have two numbers. Call them $x$ and $y$. The information gives you two equations relating $x$, $y$ and numbers you are given. See if you can build those equations from the text of the question. Thanks from GIjoefan1976
February 29th, 2016, 09:31 AM #5
Math Team
Joined: Oct 2011
Posts: 14,597
Thanks: 1038 | {
"domain": "mymathforum.com",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.96741025335478,
"lm_q1q2_score": 0.8567689743059244,
"lm_q2_score": 0.8856314798554445,
"openwebmath_perplexity": 1827.9855240438856,
"openwebmath_score": 0.7567024827003479,
"tags": null,
"url": "http://mymathforum.com/algebra/328325-one-number-four-more-than-five-times-another-if-their-sum-decreased-six.html"
} |
Joined: Oct 2011
Posts: 14,597
Thanks: 1038
Quote:
Originally Posted by GIjoefan1976 Okay, I don't understand what you mean by "substituting" and both this time, and last time I can get the first number being 2. yet then I go 2 plus 4 =6 * 5 is 30 -6 =24
OK, you got x = 2
"One number is four more than five times another."
other number= 5*2 + 4 = 14 ; OK?
"If their sum is decreased by six, the result is ten."
sum = 2 + 14 = 16
16 - 6 = 10 : Bingo! You're correct
February 29th, 2016, 09:50 AM #6
Senior Member
Joined: Jul 2014
From: भारत
Posts: 1,178
Thanks: 230
Quote:
Originally Posted by GIjoefan1976 One number is four more than five times another. If their sum is decreased by six, the result is ten. Find the numbers. I tried to write the equation from reading this. Is this anywhere near close? X+4+5x-6=10 Thanks
Let one number be x
Other number is 4+5x
Quote:
Originally Posted by GIjoefan1976 If their sum is decreased by six, the result is ten
(x + 4+5x)-6 = 10
The only difference is brackets.
Continue.
February 29th, 2016, 10:24 AM #7
Senior Member
Joined: Feb 2016
From: seattle
Posts: 377
Thanks: 10
Quote:
Originally Posted by Denis OK, you got x = 2 "One number is four more than five times another." other number= 5*2 + 4 = 14 ; OK? "If their sum is decreased by six, the result is ten." sum = 2 + 14 = 16 16 - 6 = 10 : Bingo! You're correct
Thanks i think it was the sum part that really confused me. Was not sure what they meant by that. but now I will try to remember they mean for me to add the 2 numbers I end finding after solving the problem not before solving the problem.
February 29th, 2016, 10:30 AM #8
Senior Member
Joined: Feb 2016
From: seattle
Posts: 377
Thanks: 10
Quote:
Originally Posted by Prakhar Let one number be x Other number is 4+5x (x + 4+5x)-6 = 10 The only difference is brackets. Continue.
see I was thinking this too, yet was not sure how to write it. | {
"domain": "mymathforum.com",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.96741025335478,
"lm_q1q2_score": 0.8567689743059244,
"lm_q2_score": 0.8856314798554445,
"openwebmath_perplexity": 1827.9855240438856,
"openwebmath_score": 0.7567024827003479,
"tags": null,
"url": "http://mymathforum.com/algebra/328325-one-number-four-more-than-five-times-another-if-their-sum-decreased-six.html"
} |
Yet if i did it this way it confused me too as i would have gone and got
-36x-24=10
?
February 29th, 2016, 11:02 AM #9
Math Team
Joined: Oct 2011
Posts: 14,597
Thanks: 1038
Quote:
Originally Posted by GIjoefan1976 (x + 4+5x)-6 = 10 see I was thinking this too, yet was not sure how to write it. Yet if i did it this way it confused me too as i would have gone and got -36x-24=10
C'mon GIJoe; quit running at 100 mph!
There's no multiplication there; just remove the brackets:
x + 4 + 5x - 6 = 10
6x = 10 - 4 + 6
6x = 12
x = 2
February 29th, 2016, 11:05 AM #10 Math Team Joined: Dec 2013 From: Colombia Posts: 7,675 Thanks: 2655 Math Focus: Mainly analysis and algebra If you write that you have two numbers $x$ and $y$, then you get two equations $y = 4+5x$ and $x+y - 6= 10$. If you have learned how to solve simultaneous equations, this is not too difficult to solve (indeed one approach gives you exactly the equation that Denis was working you through. The important thing is to be able to build the equations. To understand what the sentences tell you and be confident that you have written it down correctly. The rest is relatively simple algebra.
Tags decreased, number, sum, times
Thread Tools Display Modes Linear Mode
Similar Threads Thread Thread Starter Forum Replies Last Post andytx Algebra 4 March 1st, 2012 12:53 AM Hyperreal_Logic Topology 0 January 9th, 2010 05:27 PM W300 Algebra 2 October 22nd, 2009 09:11 AM steveeq1 Calculus 1 January 25th, 2009 12:56 PM
Contact - Home - Forums - Cryptocurrency Forum - Top | {
"domain": "mymathforum.com",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.96741025335478,
"lm_q1q2_score": 0.8567689743059244,
"lm_q2_score": 0.8856314798554445,
"openwebmath_perplexity": 1827.9855240438856,
"openwebmath_score": 0.7567024827003479,
"tags": null,
"url": "http://mymathforum.com/algebra/328325-one-number-four-more-than-five-times-another-if-their-sum-decreased-six.html"
} |
# Position vector
1. Nov 10, 2005
### Ratzinger
Given the typical cartesian xyz- coordinate system, is it correct to speak of a position vector? Isn't (x,y, z) just shothand for the coordinates? Distance vectors, force, velocity are real vectors with magnitude and direction in position space, but what is with a position vector in position space?
I'm confused, help needed
2. Nov 10, 2005
### whozum
The position vector points from the origin to the position of the particle. For your point it is < x , y , z >
Positions that vary with time are expressed as functions of x y and z, and you get parametric functions:
$\vec{r}_t = < x(t) , y(t), z(t) >$
3. Nov 10, 2005
### Ratzinger
yes, but isn't what you describe rather a parameterized curve, not these geometrical objects with head and tail that you can move parallel around?
I mean vectors in position coordinates without any time parameter mentioned.
4. Nov 10, 2005
### FredGarvin
Your question is a bit confusing to me. A specified position vector without any time reference just means that the function that produces the curve for the thing's position in space has been evaluated at some specific time. Ultimately the position has to be a function of time or how can you come up with velocity and acceleration?
5. Nov 10, 2005
### pmb_phy
A displacement vector is a vector which has its tail at one point and its tip at another point. If we refer to the point where the tail is as the "origin" then we refer to the displacement vector as the "position vector" of the point at the tip. We can label that point in any way we please, not only as R = (x, y, z). Quite often you'll see the position vector expressed as
$$R = (r, \theta, \phi)$$
This means that R has the value
$$R = A_r e_r + A_{\theta} e_{\theta} + A_{\phi} e_{\phi}$$ | {
"domain": "physicsforums.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9674102552339746,
"lm_q1q2_score": 0.8567689642891894,
"lm_q2_score": 0.8856314677809303,
"openwebmath_perplexity": 460.6119848821427,
"openwebmath_score": 0.754300057888031,
"tags": null,
"url": "https://www.physicsforums.com/threads/position-vector.99312/"
} |
This means that R has the value
$$R = A_r e_r + A_{\theta} e_{\theta} + A_{\phi} e_{\phi}$$
where ek is a unit vector pointing in the direction of the increasing kth coordinate. The coeficients have the value Ak = R*ek ("*" = dot product). The position vector is a bound vector, i.e. attached to the space in which it lies.
Pete
Last edited: Nov 10, 2005
6. Nov 10, 2005
### vaishakh
position vector is just a standard way of showing vectors and there is nothing like being attached. just the vector diagram has no physical meaning. the aim of physics is to solve the vector equations and while doing so we sometimes take the help of diagram.
7. Nov 11, 2005
### Ratzinger
thanks for the replies, I found this
An important difference between a position vector R and a general vector such as delta R is that the components of R are x, y and z, whereas for delta R the components are delta x, delta y and delta z. It is important to distinguish between true vectors and position vectors. A true vector does not depend on coordinate system but only on the difference between one end of the vector and the other. A position vector, in contrast, does depend on the coordinate system, because it is used to locate a position relative to a specified reference point.
8. Nov 11, 2005
### pmb_phy | {
"domain": "physicsforums.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9674102552339746,
"lm_q1q2_score": 0.8567689642891894,
"lm_q2_score": 0.8856314677809303,
"openwebmath_perplexity": 460.6119848821427,
"openwebmath_score": 0.754300057888031,
"tags": null,
"url": "https://www.physicsforums.com/threads/position-vector.99312/"
} |
8. Nov 11, 2005
### pmb_phy
Where did you get this definition from?? A vector is a geometrical object which does not depend on the coordinate system. Any vector may be expressed in terms of other vectors which are related to a particular coordinate system. But that doesn't mean that it is defined by the coordinate system. I thought I made that clear above but I guess not. I did explain that a vector is an arrow. Some vectors are called "Bound vectors" while others are called "free vectors." This is an important distinction that you should learn. The position vector does not depend on any coordinate system whatsoever. It depends on a geometric object, i.e. a "point." This point I speak of is known as the "reference point."
Wrong. You're confusing "reference point" with "coordinate system."
They are very different things.
For details on what I've been talking about see Thorne and Blanchard's online notes at
http://www.pma.caltech.edu/Courses/ph136/yr2004/0401.1.K.pdf
Pete
9. Nov 11, 2005
### Ratzinger
thanks Pete for the great notes you linked
So we have bound and free vectors. That's a nice distinction.
Free vectors can be parallel moved around or can be represented in different coordinate systems, they keep their meaning. Bound vectors do not, because they can clearly not be moved around and keep meaning and when coordinates systems are changed we talk about distance vectors. Bound vectors are bound to a coordinate system. A position vector gives only for his coordinate system information.
10. Nov 11, 2005
### pmb_phy
Bound vectors are not bound to a coordinate system. They're bound to the space that the vector is in and that is independant of the coordinate system. Give me any position vector and I can easily represent it in three different coordinate systems. I clarified this point here as I recall
http://www.geocities.com/physics_world/ma/coord_system.htm
Pete
11. Nov 11, 2005
### Ratzinger | {
"domain": "physicsforums.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9674102552339746,
"lm_q1q2_score": 0.8567689642891894,
"lm_q2_score": 0.8856314677809303,
"openwebmath_perplexity": 460.6119848821427,
"openwebmath_score": 0.754300057888031,
"tags": null,
"url": "https://www.physicsforums.com/threads/position-vector.99312/"
} |
http://www.geocities.com/physics_world/ma/coord_system.htm
Pete
11. Nov 11, 2005
### Ratzinger
Distance, velocity, force -all coordinate-independent quantities. But to ask what the position is of a point clearly needs a coordinate system. Position is only meaningful with a reference system.
Position vector in position space is a misnomer (in any position coordinates). As much as a momentum vector in momentum space.
12. Nov 11, 2005
### HallsofIvy
Staff Emeritus
Your original question is a very good one. In a Cartesian coordinate system, we can think of the "position vector" as the vector from the origin to the point, so that, at one instant, the tip of that vector is the point and the curve the point moves on is the curve sketched by the tip of the vector.
However, in non-Cartesian coordinates, especially in situations, such as are common in General Relativity, where we have curved surfaces that admit no Cartesian coordinate system, there is no such thing as a "position vector". (I used to worry about what vectors on the surface of a sphere 'looked like"!)
It is much better to think in terms of tangent vectors at every point. I like to think "a vector is a derivative".
13. Nov 12, 2005
### pmb_phy
Given a reference point the position of an arbitrary point requires only a magntitude and a direction - i.e. a vector.
HallsofIvy - I believe that you're confusing coordinate spaces with the space itself. A position vector can be defined in all spaces which have no curvature. Curvature exists independant of a coordinate system. There is no position vector in a curved space.
Pete
14. Nov 12, 2005
### robphy | {
"domain": "physicsforums.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9674102552339746,
"lm_q1q2_score": 0.8567689642891894,
"lm_q2_score": 0.8856314677809303,
"openwebmath_perplexity": 460.6119848821427,
"openwebmath_score": 0.754300057888031,
"tags": null,
"url": "https://www.physicsforums.com/threads/position-vector.99312/"
} |
Pete
14. Nov 12, 2005
### robphy
I think the issue underlying the OP's questions is the distinction between a vector space and an affine space.
http://mathworld.wolfram.com/AffineSpace.html
http://en.wikipedia.org/wiki/Affine_space
A vector space has an "origin", whereas an affine space does not.
Positions are elements of an affine space.
Displacements (the difference of two positions) are elements of a vector space.
(Only after one assigns a norm can one talk of a "magnitude" of a vector.)
15. Nov 12, 2005
### lightgrav
WHY is the distinction between free vectors and bound vectors IMPORTANT?
I can add and subtract position vectors, even tho they're "bound" to origin.
Yet, the Torque due to a Force does NOT treat the Force as a "free" vector.
16. Nov 13, 2005
### pmb_phy
The physical meaning of adding position vectors is to start with one vector whose tail is at the origin. The next position vector added to this one has its tail at the tip of the first one. So this vector is bound as well and is bound at a different place. Tourque is the cross product of a bound vector and a free vector making it a free vector.
Other physical vectors are things like the center of mass vector.
Pete
17. Nov 15, 2005
### pmb_phy
Rob - There is no requirement for a vector space to have an origin. The term "Origin" refers to a particular point that an observer uses as a reference point. The user may also use other points in order to clearly define directions. There is no unique point in any space which demands to be an origin. From your links I don't see what you mean by "affine space." Can you elaborate for me? Thanks.
Pete
18. Nov 15, 2005
### HallsofIvy | {
"domain": "physicsforums.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9674102552339746,
"lm_q1q2_score": 0.8567689642891894,
"lm_q2_score": 0.8856314677809303,
"openwebmath_perplexity": 460.6119848821427,
"openwebmath_score": 0.754300057888031,
"tags": null,
"url": "https://www.physicsforums.com/threads/position-vector.99312/"
} |
Pete
18. Nov 15, 2005
### HallsofIvy
Staff Emeritus
Yes, there is a requirement for a vector space to have an "origin". One of the requirements for a vector space is that there be a 0 vector. That is what you are referring to as an "origin". An "affine space" is a set of points such that any line through one of the points is contained in the space. You can think of it as a plane or 3d space or any Rn without a coordinate system. Once you add a coordinate system (so that you have an origin), you can make it a vector space. An affine space is what you seem to be thinking of as a "vector space". You can add vectors, you can't add points in an affine space.
19. Nov 15, 2005
### HallsofIvy
Staff Emeritus
You're right. I referred to "coordinate systems" when I really meant the space itself.
20. Nov 15, 2005
### robphy
Here's some physical motivations on this issue concerning an affine space vs. a vector space.
A space of positions in a plane (or the space of times on a line) is an affine space. With no point being physically distinguished from any other, an affine space is more natural than a vector space. In an affine space, there is no sense of addition of elements of this space. (If you attempt to add two elements, the sum depends on the choice of an "origin" [which does not exist in an affine space]. As was mentioned, one can introduce an origin by introducing a coordinate system. Then, the sum now depends on a choice of coordinate system.) There is, however, a sense of subtraction... the "difference of two positions [in an affine space]" is a vector... the displacement vector. (The difference does not depend on a choice of [or existence of] an origin.)
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook
Have something to add? | {
"domain": "physicsforums.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9674102552339746,
"lm_q1q2_score": 0.8567689642891894,
"lm_q2_score": 0.8856314677809303,
"openwebmath_perplexity": 460.6119848821427,
"openwebmath_score": 0.754300057888031,
"tags": null,
"url": "https://www.physicsforums.com/threads/position-vector.99312/"
} |
GMAT Question of the Day - Daily to your Mailbox; hard ones only
It is currently 23 Sep 2018, 02:09
### GMAT Club Daily Prep
#### Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized
for You
we will pick new questions that match your level based on your Timer History
Track
every week, we’ll send you an estimated GMAT score based on your performance
Practice
Pays
we will pick new questions that match your level based on your Timer History
# How many roots does x^6 –12x^4 + 32x^2 = 0 have?
Author Message
TAGS:
### Hide Tags
Math Expert
Joined: 02 Sep 2009
Posts: 49303
How many roots does x^6 –12x^4 + 32x^2 = 0 have? [#permalink]
### Show Tags
10 Mar 2016, 05:10
00:00
Difficulty:
45% (medium)
Question Stats:
56% (01:02) correct 44% (01:23) wrong based on 97 sessions
### HideShow timer Statistics
How many roots does x^6 –12x^4 + 32x^2 = 0 have?
(A) 1
(B) 2
(C) 3
(D) 4
(E) 5
_________________
EMPOWERgmat Instructor
Status: GMAT Assassin/Co-Founder
Affiliations: EMPOWERgmat
Joined: 19 Dec 2014
Posts: 12432
Location: United States (CA)
GMAT 1: 800 Q51 V49
GRE 1: Q170 V170
How many roots does x^6 –12x^4 + 32x^2 = 0 have? [#permalink]
### Show Tags
21 Mar 2017, 19:59
3
2
Hi mesutthefail,
The GMAT often tests you on rules/patterns that you know, but sometimes in ways that you're not used to thinking about. This prompt is really just about factoring and Classic Quadratics, but it looks a lot more complicated than it actually is.
A big part of properly dealing with a Quant question on the GMAT is in how you organize the information and 'simplify' what you've been given. This prompt starts us off with....
X^6 –12X^4 + 32X^2 = 0
This certainly looks complex, but if you think about how you can simplify it, then you'll recognize that can 'factor out' X^2 from each term. This gives us...
(X^2)(X^4 - 12X^2 + 32) = 0 | {
"domain": "gmatclub.com",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936092211993,
"lm_q1q2_score": 0.8567492212623203,
"lm_q2_score": 0.8705972818382005,
"openwebmath_perplexity": 1724.8647685423177,
"openwebmath_score": 0.6060466170310974,
"tags": null,
"url": "https://gmatclub.com/forum/how-many-roots-does-x-6-12x-4-32x-2-0-have-214685.html"
} |
(X^2)(X^4 - 12X^2 + 32) = 0
Now we have something a bit more manageable. While you're probably used to thinking of Quadratics such as X^2 + 6X + 5 as (X+1)(X+5), that same pattern exists here - it's just the exponents are slightly different (even though the math rules are exactly the SAME). We can further rewrite the above equation as...
(X^2)(X^2 -4)(X^2 - 8) = 0
At this point, you don't really need to calculate much, since each 'piece' of the product should remind you of a pattern that you already know.....
X^2 = 0 --> 1 solution
(X^2 - 4) = 0 --> 2 solutions
(X^2 - 8) = 0 --> 2 solutions
GMAT assassins aren't born, they're made,
Rich
_________________
760+: Learn What GMAT Assassins Do to Score at the Highest Levels
Contact Rich at: Rich.C@empowergmat.com
# Rich Cohen
Co-Founder & GMAT Assassin
Special Offer: Save \$75 + GMAT Club Tests Free
Official GMAT Exam Packs + 70 Pt. Improvement Guarantee
www.empowergmat.com/
***********************Select EMPOWERgmat Courses now include ALL 6 Official GMAC CATs!***********************
Manager
Joined: 09 Jul 2013
Posts: 110
How many roots does x^6 –12x^4 + 32x^2 = 0 have? [#permalink]
### Show Tags
Updated on: 29 Mar 2017, 08:58
2
4
To find the roots we can factor the polynomial down to first order expressions and count how many roots we get.
The first thing to do is to factor out $$x^2$$
Then we have $$x^2(x^4-12x^2+32)=0$$
Now to make things more familiar we can substitute $$y=x^2$$
Now it looks like this
$$y(y^2-12y+32)=0$$
And we can factor it like we are used to
$$y(y-4)(y-8)=0$$
y=0
y=4
y=8
So substituting $$x^2$$ back in for y:
$$x^2=0$$
$$x^2=4$$
$$x^2=8$$
So then the roots are
$$x=0$$
$$x=-2$$
$$x=2$$
$$x=-\sqrt{8}$$
$$x=\sqrt{8}$$ | {
"domain": "gmatclub.com",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936092211993,
"lm_q1q2_score": 0.8567492212623203,
"lm_q2_score": 0.8705972818382005,
"openwebmath_perplexity": 1724.8647685423177,
"openwebmath_score": 0.6060466170310974,
"tags": null,
"url": "https://gmatclub.com/forum/how-many-roots-does-x-6-12x-4-32x-2-0-have-214685.html"
} |
So then the roots are
$$x=0$$
$$x=-2$$
$$x=2$$
$$x=-\sqrt{8}$$
$$x=\sqrt{8}$$
Note, since we are not asked to find the actual roots, we only need to determine the number of roots. After the first step of factoring out the $$x^2$$, we have $$x^2$$ and a 4th order expression. A 4th order expression will have 4 roots (unless it's a perfect square, but our expression is not a perfect square). So the total number of roots will be 4 from the 4th order expression, and one from the $$x^2$$. Total roots = 5.
_________________
Dave de Koos
Originally posted by davedekoos on 10 Mar 2016, 14:28.
Last edited by davedekoos on 29 Mar 2017, 08:58, edited 1 time in total.
##### General Discussion
Intern
Joined: 12 Dec 2016
Posts: 10
Re: How many roots does x^6 –12x^4 + 32x^2 = 0 have? [#permalink]
### Show Tags
21 Mar 2017, 02:27
I thought polynoms was not a subject in GMAT ? This questions contains quite the polynomial solutions.
Intern
Joined: 12 Dec 2016
Posts: 10
Re: How many roots does x^6 –12x^4 + 32x^2 = 0 have? [#permalink]
### Show Tags
21 Mar 2017, 02:31
davedekoos wrote:
To find the roots we can factor the polynomial down to first order expressions and count how many roots we get.
The first thing to do is to factor out $$x^2$$
Then we have $$x^2(x^4-12x^2+32)=0$$
Now to make things more familiar we can substitute $$y=x^2$$
Now it looks like this
$$y(y^2-12y+32)=0$$
And we can factor it like we are used to
$$y(y-4)(y-8)=0$$
y=0
y=4
y=8
So putting it back to x^2
$$x^2=0$$
$$x^2=4$$
$$x^2=8$$
So then the roots are
$$x=0$$
$$x=-2$$
$$x=2$$
$$x=-\sqrt{8}$$
$$x=\sqrt{8}$$ | {
"domain": "gmatclub.com",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936092211993,
"lm_q1q2_score": 0.8567492212623203,
"lm_q2_score": 0.8705972818382005,
"openwebmath_perplexity": 1724.8647685423177,
"openwebmath_score": 0.6060466170310974,
"tags": null,
"url": "https://gmatclub.com/forum/how-many-roots-does-x-6-12x-4-32x-2-0-have-214685.html"
} |
So then the roots are
$$x=0$$
$$x=-2$$
$$x=2$$
$$x=-\sqrt{8}$$
$$x=\sqrt{8}$$
Note, since we are not asked to find the actual roots, we only need to determine the number of roots. After the first step of factoring out the $$x^2$$, we have $$x^2$$ and a 4th order expression. A 4th order expression will have 4 roots (unless it's a perfect square, but our expression is not a perfect square). So the total number of roots will be 4 from the 4th order expression, and one from the $$x^2$$. Total roots = 5.
A question. When you first factored out by x^2, the x expression in 32x^2 disappeared completely, however when you second factored out the "y" expression, 12y^2 became 12y instead of 12. Can you please clarify?
Re: How many roots does x^6 –12x^4 + 32x^2 = 0 have? &nbs [#permalink] 21 Mar 2017, 02:31
Display posts from previous: Sort by
# How many roots does x^6 –12x^4 + 32x^2 = 0 have?
## Events & Promotions
Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®. | {
"domain": "gmatclub.com",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936092211993,
"lm_q1q2_score": 0.8567492212623203,
"lm_q2_score": 0.8705972818382005,
"openwebmath_perplexity": 1724.8647685423177,
"openwebmath_score": 0.6060466170310974,
"tags": null,
"url": "https://gmatclub.com/forum/how-many-roots-does-x-6-12x-4-32x-2-0-have-214685.html"
} |
# Hull, Instructional video , ch4 -Duration
#### Branislav
##### Member
Subscriber
Dear David,
Thanks a lot for video lectures they are much inspiring Still I was little bit confused with all these different names duration, modified duration, Macauly duration,.. etc...I will shortly examine mine view of this and kindly ask you to comment ( but without laughing)
According to mine understanding we are methodologically speaking about one risk measure all the time, called duration - how long on average shall i wait as bond holder to receive cash payments, or in terms on formula as you explained ( formula 1):
From this formula we see that that when we say on average, we are referring to time weighted average, so as a result for 3 year maturity bond I will obtain let's say 2.63 - so this is time based measure ( for zero coupon bond it is equal to 3- no cash flows till the very same end, if you can wait that much
If you agree with me on this definition than this is the same thing as Macaulay duration, there is nothing new coming with this new name introduced beside of course great honor and memory on Frederick Macauly who introduced this concept.
So we are still on duration and keep playing further. What if we do the first derivative by yield, just to check what is bond's sensitivity on yield change..
Delta (B)=dB/dY*Delta(y) ( formula 2 ) and dB/dY is "similar" to the right side of the formula 1, just with the minus in front , and we need to "remove" B from the denominator, or put it another way: dB/dY=-B*D and using formula 2 we obtain ( let us call it " yield/price sensy formula"):
Delta (B)=-B*D*Delta(y) | {
"domain": "bionicturtle.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936101542134,
"lm_q1q2_score": 0.8567492138144629,
"lm_q2_score": 0.8705972734445508,
"openwebmath_perplexity": 2123.34152772634,
"openwebmath_score": 0.6814907193183899,
"tags": null,
"url": "https://forum.bionicturtle.com/threads/hull-instructional-video-ch4-duration.22262/#post-74751"
} |
Delta (B)=-B*D*Delta(y)
For me this was kind of "magic"..somehow mine year based measure D becomes interest ( yiedl) sensitivity measure!
But basically we are still talking about duration from the beginning of the text, just with this simple "math" transformation we saw that it is also connected to the bonds price sensitivity to yield change
We play further...we assumed above continuous compounding, if we go to the annual compounding, then, bond price is little bit different summation:
( note just the yield y is replaced with i) and duration and its first derivative are little bit different, so their relationship from " yield/price sensy formula"is now transforme to :
Delta (B)=-B*D*Delta(y)/(1+y)
and we introduce new "name" again, "Modified duration" as:
D*=D/(1+y), which transforms previous equation to:
Delta (B)=-B*(D*)*Delta(y)
so again D* is duration from the beginning of the text, just for yearly compounding case, "used" in this formula to express sensitivity of bonds price on yield change.
#### David Harper CFA FRM | {
"domain": "bionicturtle.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936101542134,
"lm_q1q2_score": 0.8567492138144629,
"lm_q2_score": 0.8705972734445508,
"openwebmath_perplexity": 2123.34152772634,
"openwebmath_score": 0.6814907193183899,
"tags": null,
"url": "https://forum.bionicturtle.com/threads/hull-instructional-video-ch4-duration.22262/#post-74751"
} |
#### David Harper CFA FRM
##### David Harper CFA FRM
Staff member
Subscriber
Hi @Branislav Super glad you found some inspiration in the videos: that's what we are here for In regard to your summary: yes, rIght!! All of that looks solid to me, very well done. I agree with virtually all of your statements and I definitely agree with the substantial point that, to paraphrase, that there is really only one duration. I've posted dozens of times on these concepts but here is how I would summarize, and I believe this summary maps pretty well to your math, and further you can see that I'm agreeing that Mac/mod/Effective duration are three faces of the same single concept. Effective duration simply estimates modified duration, and modified duration is a sort of "adjusted" Macaulay duration which adjusts for the effects of discrete discounting on the price and doesn't matter if discounting is continuous (we tend to refer to Macaulay duration as a maturity and modified duration as a sensitivity, but the mathematical units of both, in fact, are years such that is it a minor mathematical adjustment from one to the other, as you do imply!). | {
"domain": "bionicturtle.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936101542134,
"lm_q1q2_score": 0.8567492138144629,
"lm_q2_score": 0.8705972734445508,
"openwebmath_perplexity": 2123.34152772634,
"openwebmath_score": 0.6814907193183899,
"tags": null,
"url": "https://forum.bionicturtle.com/threads/hull-instructional-video-ch4-duration.22262/#post-74751"
} |
Here is how I would summarize:
• Macaulay duration, I'll denote D_Mac, is the bond's weighted average maturity (as illustrated by your first formula above, where the weights assigned to the maturities are the PV of the cash flows; i.e., the weights, t(i), are weighted by c(i)*exp[-y*t(i)]/B.
• modified duration, I'll denote D_mod, is the linear sensitivity of the bond's price with respect to a small yield change; i.e., if the modified duration is 3.5 years, then we (linearly) approximate a yield change of +Δy will associate with a 3.5*Δy percentage drop in the bond price (knowing that curvature/convexity has been ignored). When the yield is continuously compounded, Mac duration = modified duration. When the yield is discretely rendered, we need to adjust the Mac to retrieve the accurate D_mod = D_mac/(1 + yield/k) where k = number of periods per year; i.e., when discrete, D_mod is always a bit less than D_Mac
• In this way, modified duration is a measure of sensitivity: %ΔP = ΔP/P = -(D_mod)*Δy, solving for D_mod:
• D_mod = -1/P * ΔP/Δy or continuously D_mod = -1/P * ∂P/∂y; i.e., modified duration is the first partial derivative (of bond price) with respect to the yield multiplied by -1/P. If we multiply each side by price, P, then:
• P *D_mod = -ΔP/Δy = "dollar duration;" i.e., dollar duration is the (negative) of the pure first derivative (i.e., the slope of the tangent line, itself negative). Importantly, dollar duration divided by 10,000 is the DV01 because P *D_mod/10,000 = DV01. | {
"domain": "bionicturtle.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936101542134,
"lm_q1q2_score": 0.8567492138144629,
"lm_q2_score": 0.8705972734445508,
"openwebmath_perplexity": 2123.34152772634,
"openwebmath_score": 0.6814907193183899,
"tags": null,
"url": "https://forum.bionicturtle.com/threads/hull-instructional-video-ch4-duration.22262/#post-74751"
} |
• However, if you start with the bond price function (either continuous or discrete) and if you take the first derivative, then you can see that you should end up with (the negative of) the dollar duration: ∂P/∂y = -D_mod*P (this forum has dozens of such actual derivations if you search). Therefore, by definition, if you take the first derivative, you should also (as I think you do imply), equivalently end up with ∂P/∂y = -D_mac*P/(1+y/k). There is an old saying: duration is "infected by price" to acknowledge that 1/P "infects" the pure derivative.
• Effective duration approximates modified duration by shocking the yield and re-pricing in order to retrieve the slope of the nearby tangent. Effective duration is sort of mini-simulation used to estimate the (inherently due to it being Taylor Series) analytical modified duration when it is not analytically available (e.g., MBS with negative convexity throws off the analytics). You will really understand when you can see that the effective duration approximates the modified duration which itself is an exact linear approximation. In this way, effective duration and modified duration, although they differ in approach, are both sensitivities and not conceptually different. | {
"domain": "bionicturtle.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936101542134,
"lm_q1q2_score": 0.8567492138144629,
"lm_q2_score": 0.8705972734445508,
"openwebmath_perplexity": 2123.34152772634,
"openwebmath_score": 0.6814907193183899,
"tags": null,
"url": "https://forum.bionicturtle.com/threads/hull-instructional-video-ch4-duration.22262/#post-74751"
} |
Last edited:
#### Matthew Graves
##### Active Member
Subscriber
I think I would add a few further points with respect to the practical use of Effective Duration and differences between Effective Duration and Modified Duration.
Modified Duration is sensitivity of the price with respect to the Yield to Maturity. These two measures are precisely defined mathematically and not open to interpretation.
Effective Duration, however, is a more practical (and complicated) measure derived through re-valuation of the instrument. It is the price sensitivity of the instrument to a parallel shift in a valuation curve and is therefore model dependent. Depending on the instrument, this can be a deterministic valuation but could equally be based on monte carlo simulation if the instrument has optionality. If the underlying curve is flat at the yield to maturity and the instrument does not have optionality you would expect the Effective Duration to be very close to the Modified Duration. However, in all practical, real-world valuation cases the Effective Duration would not be equal to the Modified Duration due to the shape of the underlying curve and any optionality in the instrument (e.g. callable bonds). Separately (and rather technically), the shift applied for Effective Duration is conventionally applied to the observed market yields comprising the underlying curve before obtaining the zero rate curve. The shift is not applied to the zero curve directly. This has subtle but observable affects on the effective duration also.
#### enjofaes
##### Member
Subscriber
Hi @David Harper CFA FRM . Thanks again for all the material! Was wondering if what you said was correct in the instructional video of duration : around 24'14" Modified duration = dollar duration / 10.000. I thought from the beginning of the video that this is the formula for the DV01.
Kind regards
#### David Harper CFA FRM | {
"domain": "bionicturtle.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936101542134,
"lm_q1q2_score": 0.8567492138144629,
"lm_q2_score": 0.8705972734445508,
"openwebmath_perplexity": 2123.34152772634,
"openwebmath_score": 0.6814907193183899,
"tags": null,
"url": "https://forum.bionicturtle.com/threads/hull-instructional-video-ch4-duration.22262/#post-74751"
} |
Kind regards
#### David Harper CFA FRM
##### David Harper CFA FRM
Staff member
Subscriber
Hi @enjofaes If I said that (sorry I'll have to locate the specific video location later), then I misspoke. You are correct: DV01 = (P*D)/10,000 = dollar duration/10,000. I'm actually very happy with my summary note at see https://forum.bionicturtle.com/threads/week-in-financial-education-2021-05-24.23840/post-88846 i.e.,
Note: Durations in CFA and FRM compared
I'd like to clarify duration terminology as it pertains to differences between the CFA and FRM. This forum has hundreds of threads over 12+ years on duration concepts (it's hard to say which links are the best at this point, but I'll maybe come back and curate some best links). Our YouTube channel has a FRM P2.T4 that includes videos on DV01, hedging the DV01, effective duration, modified versus Macaulay duration, and an illustration of all three durations. There are many nuances and further explorations, but here my goal is only to clarify the top-level definitions. | {
"domain": "bionicturtle.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936101542134,
"lm_q1q2_score": 0.8567492138144629,
"lm_q2_score": 0.8705972734445508,
"openwebmath_perplexity": 2123.34152772634,
"openwebmath_score": 0.6814907193183899,
"tags": null,
"url": "https://forum.bionicturtle.com/threads/hull-instructional-video-ch4-duration.22262/#post-74751"
} |
I'll use the simple example of a $100.00 face 20-year zero-coupon bond that currently yields (yield to maturity of) 6.0% per annum. If the yield is 6.0% per annum with continuous compounding, the price is$100.00*exp(-0.060*20) = $30.12. If the yield is 6.0% per annum with annual compounding, the price is$100.00/(1+0.060)^20 = $31.18. Unless otherwise specified, I will assume a continuous compound frequency. Special note: we so often price a bond given the yield (where CPT PV is the final calculator step) that it is easy to forget yield is not actually an input. Yield is the internal rate of return (IRR) assuming the current price. Yield does not determine price; price determines yield. Technical (non-fundamental) factors cause price to fluctuate, therefore yield fluctuates. • ∂P/∂y (or Δp/Δy) is the slope of the tangent line at the selected yield. At 6.0% yield, the slope is -$602.39. How do I know that? Because dollar duration is the negated slope, so in this case dollar duration (DD) = P*D = $30.12 price * 20 years =$602.39. Importantly, the "y" in ∂P/∂y is yield and yield is just one of several interest rate factors. | {
"domain": "bionicturtle.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936101542134,
"lm_q1q2_score": 0.8567492138144629,
"lm_q2_score": 0.8705972734445508,
"openwebmath_perplexity": 2123.34152772634,
"openwebmath_score": 0.6814907193183899,
"tags": null,
"url": "https://forum.bionicturtle.com/threads/hull-instructional-video-ch4-duration.22262/#post-74751"
} |
• Dollar duration (DD; aka, money duration in the CFA) is analytically the product of price and modified duration. Dollar duration (DD) = P*D = $30.12 * 20 =$602.39. Why is it so large? Because it's the (negated) tangent line's slope, so it has the typical first derivative interpretation: DD is the dollar change implied by one unit change in the yield, -∂P/∂y. One unit is 1.0 = 100.0% = 100 * 100 basis points (bps) per 1.0% = 10,000 basis points. So, DD is the dollar change implied by a 100.0% change in yield if we use the straight tangent line which would be a silly thing to do! Recall the constant references to limitations of duration as linear approximation. The linear approximation induces bias at only 5 or 10 or 20 basis points, so 10,000 basis points is literally "off the charts" and not directly meaningful. What is meaningful? The PVBP (aka, DV01) comes to our rescue with a meaningful re-scaling of the DD ...
• Price value of basis point (aka, dollar value of '01, DV01) is the dollar duration ÷ 10,000. It's the tangent line's slope re-scaled from Δy=100.0% to Δy= 0.010% (one basis point). PVBP = P*D/10,000; in this example, PVBP = $30.12 * 20 / 10,000 =$0.06024. It is the dollar change implied by a one basis point decline in the yield. It is still a linear approximation, but much better because we zoomed in to a small change. In this way, the difference between the highly useful PVBP and the dollar duration is merely scale. | {
"domain": "bionicturtle.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936101542134,
"lm_q1q2_score": 0.8567492138144629,
"lm_q2_score": 0.8705972734445508,
"openwebmath_perplexity": 2123.34152772634,
"openwebmath_score": 0.6814907193183899,
"tags": null,
"url": "https://forum.bionicturtle.com/threads/hull-instructional-video-ch4-duration.22262/#post-74751"
} |
• Macaulay duration is the bond's weighted average maturity where the weights are each of the bond's cash flow's present value as a percentage of the bond's price. Macaulay duration is tedious however it is reliable and it is analytical. When we can compute the Macaulay duration, it is accurate; we don't approximate by re-pricing the bond. A zero-coupon bond has a Macaulay duration equal to its maturity because it only has one cash flow (hence the popularity of the zero-coupon bond in exam questions, never mind the zero-coupon bond is a reliable primitive). Our 20-year zero-coupon bond has a Macaulay duration of 20.0 years.
• Modified duration is the measure of interest rate risk. Modified duration is the approximate percentage change in bond price implied by a 1.0% (100 basis point) change in the yield. Just as ∂P/∂y refers to the tangent line's slope which is "infected with price," we divide by price to express the modified duration, D(mod) = -1/P*∂P/∂y. The key relationship between analytical modified and Macaulay duration is the following: modified duration = Macaulay duration / (1 + y/k) where k is the number of compound periods in the year; e.g., k = 1 for annual compounding, k = 2 for semiannual compounding and k = ∞ for continuous compounding. Importantly, if the the compound frequency is continuous then a bond's modified duration equals its Macaulay duration. Notice that T / (1 + y/∞) = T / (1 + 0) = T.
• If the 6.0% yield is annual compounded, our 20-year bond's Macaulay duration is given by 20.0 / (1 + 6.0%) = 18.868 years.
• If the 6.0% yield is continuously compounded, our 20-year bond's modified duration is 20.0 years. | {
"domain": "bionicturtle.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936101542134,
"lm_q1q2_score": 0.8567492138144629,
"lm_q2_score": 0.8705972734445508,
"openwebmath_perplexity": 2123.34152772634,
"openwebmath_score": 0.6814907193183899,
"tags": null,
"url": "https://forum.bionicturtle.com/threads/hull-instructional-video-ch4-duration.22262/#post-74751"
} |
• If the 6.0% yield is continuously compounded, our 20-year bond's modified duration is 20.0 years.
• Effective duration is an approximation of modified duration. Recall the modified duration is a linear approximation, but that's because it is a function of the first derivative; otherwise, modified duration is an exact (analytical or functional) measure of the price sensitivity with respect to the interest rate factor that happens to most often be the yield. We can retrieve it easily whenever we can compute the Macaulay duration, which is the case for any vanilla bond. Otherwise (e.g., bond has an embedded option) we approximate the modified duration by calculating its effective duration. The effective duration approximates the modified duration which itself is a linear approximation. The effective duration is given by [P(-Δy) - P(+Δy)] / (2*Δy) * 1/P. I wrote it this way so you can see that it is essentially similar to ∂P/∂y*1/P where ∂P/∂y ≅ [P(-Δy) - P(+Δy)] / (2*Δy). I've observed that many candidates do not realize that the formula for effective duration is simply slope*1/P. Geometrically, it is the slope of the secant line that is near to the tangent line! Secant's slope approximates the tangent's slope. If you grok the calculus here, I think you'll agree that this is all just one thing! Now we can see how it's not so different. But as you can visualize, there are an almost infinite variety of secants next to the tangent. We arbitrarily choose a nearby secant, but we'd prefer a small delta if the bond is vanilla (i.e., if the bond's cash flows are invariant to rate changes). Although we do not need the effective duration for our example bond, we can compute it:
• If our arbitrary yield shock is10 basis points such that Δy= 0.10%, then P(-Δy)= $100.00*exp(-5.90%*20)=$30.728, and P(+Δy)= $100.00*exp(-6.10%*20)=$29.523. Effective duration= ($30.728 -$29.523)/0.0020 *1/\$30.12= 20.0013 years. Fine approximation!
• On the terminology (CFA versus FRM) | {
"domain": "bionicturtle.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936101542134,
"lm_q1q2_score": 0.8567492138144629,
"lm_q2_score": 0.8705972734445508,
"openwebmath_perplexity": 2123.34152772634,
"openwebmath_score": 0.6814907193183899,
"tags": null,
"url": "https://forum.bionicturtle.com/threads/hull-instructional-video-ch4-duration.22262/#post-74751"
} |
• On the terminology (CFA versus FRM)
• Interest rate factor: The FRM (informed by Tuckman) starts with a general interest rate factor. This is typically the spot rate, forward rate, par rate, or yield. Importantly, the spot, forward and par rates are term structures, or vectors; the par yield curve is a vector of par rates at various maturities, often at six-month or one-month intervals. Only the yield is a single (aka, scalar) value.
• My above definition of the effective duration is according to the FRM (and to me). The CFA sub-divides this effective duration into either approximate modified duration (if the interest rate factor is the yield) versus effective duration (if the non-vanilla nature of the bond requires a non-yield interest rate factor; i.e., a benchmark yield curve). Personally, I am not keen on this semantic approach because (i) both of these CFA formulas are approximating the modified duration and (ii) I prefer to reserve "effective" for its traditional connotation (e.g., effective convexity is analogous to effective duration), and (iii) we wouldn't anyhow use an inappropriate factor (yield) for certain non-vanilla situations, so we don't really need label-switches to guide us thusly! (the CFA's formula for its approximate modified duration is essentially the same as its effective duration formula). To me, the CFA's approach muddies the terms "approximate" and "effective" where the math gives us natural distinctions. Follow the math, I'd say! | {
"domain": "bionicturtle.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936101542134,
"lm_q1q2_score": 0.8567492138144629,
"lm_q2_score": 0.8705972734445508,
"openwebmath_perplexity": 2123.34152772634,
"openwebmath_score": 0.6814907193183899,
"tags": null,
"url": "https://forum.bionicturtle.com/threads/hull-instructional-video-ch4-duration.22262/#post-74751"
} |
# Definition:Supremum of Set
## Definition
Let $\struct {S, \preceq}$ be an ordered set.
Let $T \subseteq S$.
An element $c \in S$ is the supremum of $T$ in $S$ if and only if:
$(1): \quad c$ is an upper bound of $T$ in $S$
$(2): \quad c \preceq d$ for all upper bounds $d$ of $T$ in $S$.
If there exists a supremum of $T$ (in $S$), we say that:
$T$ admits a supremum (in $S$) or
$T$ has a supremum (in $S$).
### Finite Supremum
If $T$ is finite, $\sup T$ is called a finite supremum.
### Subset of Real Numbers
The concept is usually encountered where $\struct {S, \preceq}$ is the set of real numbers under the usual ordering $\struct {\R, \le}$:
Let $T \subseteq \R$ be a subset of the real numbers.
A real number $c \in \R$ is the supremum of $T$ in $\R$ if and only if:
$(1): \quad c$ is an upper bound of $T$ in $\R$
$(2): \quad c \le d$ for all upper bounds $d$ of $T$ in $\R$.
The supremum of $T$ is denoted $\sup T$ or $\map \sup T$.
## Also known as
Particularly in the field of analysis, the supremum of a set $T$ is often referred to as the least upper bound of $T$ and denoted $\map {\operatorname {lub} } T$ or $\map {\operatorname {l.u.b.} } T$.
Some sources refer to the supremum of a set as the supremum on a set.
## Also defined as
Some sources refer to the supremum as being the upper bound.
Using this convention, any element greater than this is not considered to be an upper bound.
## Also see
• Results about suprema can be found here.
## Linguistic Note
The plural of supremum is suprema, although the (incorrect) form supremums can occasionally be found if you look hard enough. | {
"domain": "proofwiki.org",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936096877063,
"lm_q1q2_score": 0.8567492134083232,
"lm_q2_score": 0.870597273444551,
"openwebmath_perplexity": 172.22908619831068,
"openwebmath_score": 0.9775962829589844,
"tags": null,
"url": "https://proofwiki.org/wiki/Definition:Supremum_of_Set"
} |
Largest $n$-vertex polyhedron that fits into a unit sphere
In two dimensions, it is not hard to see that the $n$-vertex polygon of maximum area that fits into a unit circle is the regular $n$-gon whose vertices lie on the circle: For any other vertex configuration, it is always possible to shift a point in a way that increases the area.
In three dimensions, things are much less clear. What is the polyhedron with $n$ vertices of maximum volume that fits into a unit sphere? All vertices of such a polyhedron must lie on the surface of the sphere (if one of them does not, translate it outwards along the vector connecting it to the sphere's midpoint to get a polyhedron of larger volume), but now what? Not even that the polyhedron must be convex for every $n$ is immediately obvious to me.
• If the vertices are on the surface of the sphere the polyhedron will necessarily be convex - it will be the convex hull of the vertices. Because the sphere itself is convex the convex hull will lie entirely within it. Oct 18 '14 at 16:41
• @MarkBennet: Good point, that settles this part at least.
– user139000
Oct 18 '14 at 16:46
• I believe this is an open problem for $n > 8$. Oct 21 '14 at 6:57
• @achille hui: do you know solutions for n = 7, 8? One can check directly that cube is not even a local maximum, having in fact surprisingly poor performance. Oct 23 '14 at 19:50
• A stickler point about your proof for polygons: given that the space of such polygons is compact...
– Max
Oct 23 '14 at 20:42
This is supposed to be a comment but I would like to post a picture.
For any $m \ge 3$, we can put $m+2$ vertices on the unit sphere
$$( 0, 0, \pm 1) \quad\text{ and }\quad \left( \cos\frac{2\pi k}{m}, \sin\frac{2\pi k}{m}, 0 \right) \quad\text{ for }\quad 0 \le k < m$$
Their convex hull will be a $m$-gonal bipyramid which appear below.
Up to my knowledge, the largest $n$-vertex polyhedron inside a sphere is known only up to $n = 8$. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936082881853,
"lm_q1q2_score": 0.8567492039297666,
"lm_q2_score": 0.8705972650509008,
"openwebmath_perplexity": 428.21900263279866,
"openwebmath_score": 0.7174676656723022,
"tags": null,
"url": "https://math.stackexchange.com/questions/979660/largest-n-vertex-polyhedron-that-fits-into-a-unit-sphere?noredirect=1"
} |
Up to my knowledge, the largest $n$-vertex polyhedron inside a sphere is known only up to $n = 8$.
• $n = 4$, a tetrahedron.
• $n = 5$, a triangular bipyramid.
• $n = 6$, a octahedron = a square bipyramid
• $n = 7$, a pentagonal bipyramid.
• $n = 8$, it is neither the cube ( volume: $\frac{8}{3\sqrt{3}} \approx 1.53960$ ) nor the hexagonal bipyramid ( volume: $\sqrt{3} \approx 1.73205$ ). Instead, it has volume $\sqrt{\frac{475+29\sqrt{145}}{250}} \approx 1.815716104224$.
Let $\phi = \cos^{-1}\sqrt{\frac{15+\sqrt{145}}{40}}$, one possible set of vertices are given below: $$( \pm \sin3\phi, 0, +\cos3\phi ),\;\; ( \pm\sin\phi, 0,+\cos\phi ),\\ (0, \pm\sin3\phi, -\cos3\phi),\;\; ( 0, \pm\sin\phi, -\cos\phi).$$ For this set of vertices, the polyhedron is the convex hull of two polylines. One in $xz$-plane and the other in $yz$-plane. Following is a figure of this polyhedron, the red/green/blue arrows are the $x/y/z$-axes respectively.
$\hspace0.75in$
For $n \le 8$, above configurations are known to be optimal. A proof can be found in the paper
Joel D. Berman, Kit Hanes, Volumes of polyhedra inscribed in the unit sphere in $E^3$
Mathematische Annalen 1970, Volume 188, Issue 1, pp 78-84
An online copy of the paper is viewable at here (you need to scroll to image 84/page 78 at first visit).
For $n \le 130$, a good source of close to optimal configurations can be found under N.J.A. Sloane's web page on Maximal Volume Spherical Codes. It contains the best known configuration at least up to year 1994. For example, you can find an alternate set of coordinates for the $n = 8$ case from the maxvol3.8 files under the link to library of 3-d arrangements there. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936082881853,
"lm_q1q2_score": 0.8567492039297666,
"lm_q2_score": 0.8705972650509008,
"openwebmath_perplexity": 428.21900263279866,
"openwebmath_score": 0.7174676656723022,
"tags": null,
"url": "https://math.stackexchange.com/questions/979660/largest-n-vertex-polyhedron-that-fits-into-a-unit-sphere?noredirect=1"
} |
• That's plenty of information, and I'm willing to give you the bounty since you have answered my question ("Open problem for $n\ge 9$") but I'd like some more information for the $n=8$ case if possible. The cube not being optimal is already surprising since one might expect the 2D argument to somehow transfer to regular polyhedra, but where do the coordinates come from? You say that $n=8$ is known exactly but the coords just look like the result of a numerical optimization run. I'd expect there to be exact polar or cartesian coordinates or at least some formal description of the polyhedron.
– user139000
Oct 25 '14 at 7:44
• That the $n=7$ solution is a pentagonal bipyramid also mildly surprised me. In my mental picture of it, the concentration of vertices in the plane spanned by the pyramids' shared base seems a little too high for the configuration to be optimal. But 3D is hard to imagine accurately, of course...
– user139000
Oct 25 '14 at 7:48
• @pew look at Berman and Hanes paper (linked in updated answer) for a proof. Oct 25 '14 at 9:16 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936082881853,
"lm_q1q2_score": 0.8567492039297666,
"lm_q2_score": 0.8705972650509008,
"openwebmath_perplexity": 428.21900263279866,
"openwebmath_score": 0.7174676656723022,
"tags": null,
"url": "https://math.stackexchange.com/questions/979660/largest-n-vertex-polyhedron-that-fits-into-a-unit-sphere?noredirect=1"
} |
# Find the integral $\int\frac{dx}{\sqrt{x^2-a^2}}$
Evaluate the integral of $\frac{1}{\sqrt{x^2-a^2}}$
Put $x=a\sec\theta\implies dx=a\sec\theta\tan\theta d\theta$ \begin{align} \int\frac{dx}{\sqrt{x^2-a^2}}&=\int\frac{a\sec\theta\tan\theta d\theta}{\sqrt{a^2\sec^2\theta-a^2}}=\int\frac{a\sec\theta\tan\theta d\theta}{a\sqrt{\tan^2\theta}}=\int\frac{a\sec\theta\tan\theta d\theta}{a\color{red}{\tan\theta}}\\&=\int\sec\theta d\theta=\log|\sec\theta+\tan\theta|+C=\log|\frac{x}{a}+\sqrt{\frac{x^2}{a^2}-1}|\\&=\log|\frac{x+\sqrt{x^2-a^2}}{a}|+C=\log|{x+\sqrt{x^2-a^2}}|-\log|a|+C\\&=\log|{x+\sqrt{x^2-a^2}}|+C \end{align} This is how it is solve in my reference. But, $\sqrt{\tan^2\theta}=|\tan\theta|$ right ? Then, does that imply $$\int\frac{dx}{\sqrt{x^2-a^2}}=\int\frac{a\sec\theta\tan\theta d\theta}{a\color{red}{|\tan\theta|}}=\color{red}{\pm}\int\sec\theta d\theta$$ Why am I getting this confusion and is the first solution complete ?
• @TrostAft how can i say $\tan\theta$ is $+$ve from $x^2-a^2>0$ ? – ss1729 May 2 '18 at 7:20
• No first solution is not complete, they silently slipped in the || inside. You know, $\int \sec t = \ln(\sec t + \tan t)$ is valid for $\sec t > 0$ and for $\sec t \lt 0$ the integrand is $\ln(-\sec t - \tan t)$ so the solution $\ln |\sec t + \tan t|$ combines both. – jonsno May 2 '18 at 7:35
• Check by differentiating your solution(s). – Yves Daoust May 2 '18 at 7:35
• Agree with @samjoe. My comment is untrue. – TrostAft May 2 '18 at 7:35
• @samjoe i'm srry dont understand how ur point help me with the doubt in OP ?. Could u pls explain bit more ? – ss1729 May 2 '18 at 7:57
Suppose that $a>0$.
The work is just for the case when $x>a$. The case for $x<-a$ is different, but the finals result is the same.
Let $x=a\sec\theta$, where $\theta\in[0,\frac{\pi}{2})\cup(\frac{\pi}{2},\pi]$. This is the domain of $\textrm{arcsec}$.
For $x< -a$, $\theta\in(\frac{\pi}{2},\pi]$ and so $\tan\theta\le0$. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936120202411,
"lm_q1q2_score": 0.856749200570774,
"lm_q2_score": 0.8705972583359805,
"openwebmath_perplexity": 829.7075101035706,
"openwebmath_score": 0.9310566186904907,
"tags": null,
"url": "https://math.stackexchange.com/questions/2762958/find-the-integral-int-fracdx-sqrtx2-a2"
} |
For $x< -a$, $\theta\in(\frac{\pi}{2},\pi]$ and so $\tan\theta\le0$.
$$\sqrt{x^2-a^2}=\sqrt{a^2\tan^2\theta}=-a\tan\theta$$
\begin{align*} \int\frac{dx}{\sqrt{x^2-a^2}}&=\int\frac{a\sec\theta\tan\theta}{-a\tan\theta}d \theta\\ &=-\int\sec\theta d\theta\\ &=-\ln|\sec\theta+\tan\theta|+C\\ &=\ln|\sec\theta-\tan\theta|+C\\ &=\ln\left|\frac{x}{a}-\frac{-\sqrt{x^2-a^2}}{a}\right|+C\\ &=\ln\left|x+\sqrt{x^2-a^2}\right|-\ln|a|+C \end{align*}
There are two minus signs and they cancel each other to reach the final result.
• I don't uunderstand how you conclude $\theta \in (\pi/2, \pi]$ because that is the key to the question. – jonsno May 2 '18 at 8:17
• I mean why it can't be $\theta \in (\pi, 3\pi/2)$ where sec is negative but tan is positive – jonsno May 2 '18 at 8:18
• Yes thats what we have to show that tan cannot be positive. – jonsno May 2 '18 at 8:20
• If we take $\theta\in(\pi,3\pi/2)$, then $\tan\theta>0$. The integral is $\int\sec\theta d\theta$. The final answer will be still $\ln|x+\sqrt{x^2-a^2}|-\ln|a|+C$. My point is that we can have $-\int\sec\theta d\theta$ in the work. But then we will have one more minus sign and obtain the same final answer. – CY Aries May 2 '18 at 8:26
• We either take a range so that the work holds for both $x>a$ and $x<-a$, or take a range so that in one case we will have two minus signs to cancel each other. – CY Aries May 2 '18 at 8:29 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936120202411,
"lm_q1q2_score": 0.856749200570774,
"lm_q2_score": 0.8705972583359805,
"openwebmath_perplexity": 829.7075101035706,
"openwebmath_score": 0.9310566186904907,
"tags": null,
"url": "https://math.stackexchange.com/questions/2762958/find-the-integral-int-fracdx-sqrtx2-a2"
} |
# Prove that the square root of a positive integer is either an integer or irrational
Is my proof that the square root of a positive integer is either an integer or an irrational number correct?
The proof goes like this:
Suppose an arbitrary number n, where n is non-negative. If $\sqrt{n}$ is an integer, then $\sqrt{n}$ must be rational. Since $\sqrt{n}$ is an integer, we can conclude that n is a square number, that is for some integer a. Therefore, if n is a square number, then $\sqrt{n}$ is rational.
Suppose now that n is not a square number, we want to show that the square root of any non-square number is irrational.
We prove by contradiction. That is, we suppose that the square root of any non-square number is rational. So $\sqrt{n} = \frac{a}{b}$, where $a,b \in Z^+, b \neq 0$. We also suppose that $a \neq 0$, otherwise $\frac ab = 0$ , and n will be a square number, which is rational.
Hence $n = \frac {a^2}{b^2}$, so $nb^2 = a^2$.
Suppose $b=1$. Then $\sqrt n = a$ , which shows that n is a square number. So $b \neq 1$. Since $\sqrt n > 1$, then $a>b>1$.
By the unique factorization of integers theorem, every positive integer greater than $1$ can be expressed as the product of its primes. Therefore, we can write $a$ as a product of primes and for every prime number that exists in $a$, there will be an even number of primes in $a^2$. Similarly, we can express $b$ as a product of primes and for every prime number that exists in $b$, there will be an even number of primes in $b^2$.
However, we can also express $n$ as a product of primes. Since $n$ is not a square number, then there exist at least one prime number that has an odd number of primes. Therefore, there exists at least one prime in the product of $nb^2$ that has an odd number of primes. Since $nb^2=a^2$ , then this contradicts the fact that there is an even number of primes in $a^2$ since a number can neither be even and odd. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936087546923,
"lm_q1q2_score": 0.856749194423741,
"lm_q2_score": 0.8705972549785203,
"openwebmath_perplexity": 102.9936556342472,
"openwebmath_score": 0.897523045539856,
"tags": null,
"url": "https://math.stackexchange.com/questions/2120928/prove-that-the-square-root-of-a-positive-integer-is-either-an-integer-or-irratio"
} |
Therefore, this contradicts the fact that $\sqrt n$ is rational. Therefore, $\sqrt n$ must be irrational.
Is this sufficient? Or is there any parts I did not explain well?
• I think its correct and very well explained. – Shobhit Jan 30 '17 at 14:25
• It's a bit wordy, but logically you've got a solid proof, the even-ness of the powers of each prime is exactly what you're going for. – Adam Hughes Jan 30 '17 at 14:26
• The conclusion is not precise enough. Instead of "contradicts there is an even number of primes in $a^2$" we want to say that it contradicts the fact that the prime $p$ occurs to odd power in the unique factorization of $nb^2,\,$ but even power in $a^2,\,$ i.e. we are comparing the parity of the count of single prime, not the total of all primes – Bill Dubuque Jan 30 '17 at 14:28
• For example the argument shows that $\,\sqrt{3\cdot 5}\,$ is irrational because $\,3\,$ occurs to odd power in $\,3\cdot 5,\,$ but the total number of primes in $\,3\cdot 5\,$ is even. – Bill Dubuque Jan 30 '17 at 14:37
• On a side note, this result is known as Theaetetus' Theorem, and it's proven in Euclid's Elements here: aleph0.clarku.edu/~djoyce/elements/bookX/propX9.html "[S]quares which do not have to one another the ratio which a square number has to a square number also do not have their sides commensurable in length either." – Keshav Srinivasan Jan 30 '17 at 14:41
Your proof is very good and stated well. I think it can be made shorter and tighter with a little less exposition of the obvious. However, I would prefer students to err on the side of more rather than less so I can't chide you for being thorough. But if you want a critique:
"Suppose an arbitrary number n, where n is non-negative. If $\sqrt{n}$ is an integer, then $\sqrt{n}$ must be rational. Since $\sqrt{n}$ is an integer, we can conclude that n is a square number, that is for some integer a. Therefore, if n is a square number, then $\sqrt{n}$ is rational." | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936087546923,
"lm_q1q2_score": 0.856749194423741,
"lm_q2_score": 0.8705972549785203,
"openwebmath_perplexity": 102.9936556342472,
"openwebmath_score": 0.897523045539856,
"tags": null,
"url": "https://math.stackexchange.com/questions/2120928/prove-that-the-square-root-of-a-positive-integer-is-either-an-integer-or-irratio"
} |
Suppose now that n is not a square number, we want to show that the square root of any non-square number is irrational.
This can all be said more simply and to argue that if $\sqrt{n}$ is an integer we can conclude $\sqrt{n}$ is rational or that $n$ is therefore a perfect square, is a little heavy handed. Those are definitions and go without saying. However, it shows good insight and understanding to be aware one can assume things and all claims need justification so I can't really call this "wrong".
But it'd be enough to say. "If $n$ is a perfect square then $\sqrt{n}$ is a an integer and therefore rational, so it suffices to prove that if $n$ is not a perfect square, then $\sqrt{n}$ is irrational.
We prove by contradiction. That is, we suppose that the square root of any non-square number is rational. So $\sqrt{n}$=ab , where a,b∈Z+,b≠0. We also suppose that a≠0, otherwise ab=0, and n will be a square number, which is rational.
Terminologistically, to say "$n$ is a square number" is to mean $n$ is the square of an integer. If $n = (\frac ab)^2$ we don't usually refer to $n$ as a square (although it is "a square of a rational") We'd never call $13$ a square because $13 = (\sqrt{13})^2$.
Also you don't make the usual specification that $a$ and $b$ have no common factors. As it turns out you didn't need to but it is a standard.
Suppose b=1 . Then $\sqrt{n}$=a , which shows that n is a square number. So b≠1. Since $\sqrt{n}$>1, then a>b>1
This was redundant as $b=1 \implies$ $a/b$ is an integer and we are assuming that $n$ is not a perfect square.
.
By the unique factorization of integers theorem, every positive integer greater than 1 can be expressed as the product of its primes. Therefore, we can write a as a product of primes and for every prime number that exists in a, there will be an even number of primes in a2. Similarly, we can express b as a product of primes and for every prime number that exists in b, there will be an even number of primes in b2 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936087546923,
"lm_q1q2_score": 0.856749194423741,
"lm_q2_score": 0.8705972549785203,
"openwebmath_perplexity": 102.9936556342472,
"openwebmath_score": 0.897523045539856,
"tags": null,
"url": "https://math.stackexchange.com/questions/2120928/prove-that-the-square-root-of-a-positive-integer-is-either-an-integer-or-irratio"
} |
Bill Dubuque in the comments noted what you meant to say was "each prime factor will be raised to any even power".
.
However, we can also express n as a product of primes. Since n is not a square number, then there exist at least one prime number that has an odd number of primes. Therefore, there exists at least one prime in the product of nb2 that has an odd number of primes. Since nb2=a2 , then this contradicts the fact that there is an even number of primes in a2 since a number can neither be even and odd.
Ditto:
Overall I think your proof is very good.
But I should point out there is a simpler one:
Assume $n = \frac {a^2}{b^2}$ where $a,b$ are positive integers with no common factors (other than 1). If $p$ is a prime factor of $b$ and $n$ is an integer, it follows that $p$ is a prime factor of $a^2$ and therefore of $a$. But that contradicts $a$ and $b$ having no common factors. So $b$ can not have any prime factors. But the only positive integer without prime factors is $1$ so $b = 1$ and $n= a^2$ so $\sqrt{n} = a$. So either for any integer either $n$ is a perfect square with an integer square root, or $n$ does not have a rational square root.
And a slight caveat: I'm assuming that your class or text is assuming that all real numbers have square roots (and therefore if there is not rational square root the square root must be irrational). It's worth pointing out, that it is a result of real analysis that speaking of a square root actually makes any sense and that we can claim every positive real number actually does have same square root value. But that's probably beyond the range of this exercise. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936087546923,
"lm_q1q2_score": 0.856749194423741,
"lm_q2_score": 0.8705972549785203,
"openwebmath_perplexity": 102.9936556342472,
"openwebmath_score": 0.897523045539856,
"tags": null,
"url": "https://math.stackexchange.com/questions/2120928/prove-that-the-square-root-of-a-positive-integer-is-either-an-integer-or-irratio"
} |
But if I want to be completely accurate, you (and I) have actually only proven that positive integer $n$ either has an integer square root or it has no rational square root at all. Which is the same thing as saying if positive integer $n$ has a square root, the root is either integer or irrational. But we have not actually proven that positive integer $n$ actually has any square root at all. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936087546923,
"lm_q1q2_score": 0.856749194423741,
"lm_q2_score": 0.8705972549785203,
"openwebmath_perplexity": 102.9936556342472,
"openwebmath_score": 0.897523045539856,
"tags": null,
"url": "https://math.stackexchange.com/questions/2120928/prove-that-the-square-root-of-a-positive-integer-is-either-an-integer-or-irratio"
} |
• Thank you for the critique! It definitely helped me a lot! – Icycarus Jan 31 '17 at 11:00
• Can you explain or state a case where we cannot find the square root of a positive integer $n$ (as you state in the last line)? – Hungry Blue Dev Apr 15 '17 at 12:56
• I didn't say there are positive integers without square roots. (There aren't.) I said we haven''t proven that the square root of any integer exists. And we haven't. To prove that we have to prove that $K = \{q \in \mathbb Q| q^2 < n\}$ is not empty, and bounded above and that if $z = \sup K$ then $z^2 - n$. All we have proven so far is that either there is an integer so that $m^2 = n$ or there is no rational $q$ so that $q^2 = n$. We have not proven that there is an irrational $z$ so that $z^2 = n$. – fleablood Apr 15 '17 at 15:54
• If $n$ can not be written as $\frac {a^2}{b^2}$ then, by definition, $n$ does not have a rational square root. If $n$ has a rational square root then that rational square root can be written as $\frac ab$. That is what rational means. And if the square root is $\frac ab$ then $n = (\frac ab)^2 =\frac {a^2}{b^2}$. That is what square root means. So if $n$ can't be written that way then it does not have a rational square root. For example: $3$ can not be written that way and does not have a rational square root. Neither does ANY other non-square. – fleablood Jan 21 at 22:31
• This is a prove that IF a square root is rational then it must be an integer. We are not concerned about irrational square root (not even to the extent of questioning whether they exist). And IF a square root is rational it can be written as $\frac ab$. Which means $n$ can be written as $\frac {a^2}{b^2}$. If it can't be, then it does not have a rational square root. – fleablood Jan 21 at 22:35 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936087546923,
"lm_q1q2_score": 0.856749194423741,
"lm_q2_score": 0.8705972549785203,
"openwebmath_perplexity": 102.9936556342472,
"openwebmath_score": 0.897523045539856,
"tags": null,
"url": "https://math.stackexchange.com/questions/2120928/prove-that-the-square-root-of-a-positive-integer-is-either-an-integer-or-irratio"
} |
We know that $\sqrt{4} = 2$ and $\sqrt{2} = 1.414...$ are rational and irrational respectively, so all we have to do is to show that if $n\in \mathbb{Z+}$ such that $\sqrt{n} = \dfrac{a}{b}$ where $a$ and $b$ are positive integers and the expression $\dfrac{a}{b}$ is in its simplest form then $\sqrt{n}$ is integral. Squaring both sides of the expression we get that $n = \dfrac{a^2}{b^2}$ since $a$ and $b$ have no common factors other than $1$ then $a^2 = n$ and $b^2 = 1$ therefore $b = 1$ hence $\sqrt{n}$ if rational it's an integer.
• How is that a critique of the OP's proof? – fleablood Jan 30 '17 at 18:51
• The op shows (correctly) that the square root of a non square is irrational. There is no need to show that rational roots are integers. Assuming n is not square makes perfect sense and the case for square n's has been covered. Your objections are not valid. Meanwhile you post is just ... weird. What do $\sqrt 4$ and $\sqrt 2$ have to do with anything. And your statement $n = a^2/b^2$ implies $a^2 = n$ and $b^2 =1$ is said without justification when the justification is the entire point. And you are merely pointing out an easier proof. Which is not a valid critique. – fleablood Jan 30 '17 at 22:57 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9840936087546923,
"lm_q1q2_score": 0.856749194423741,
"lm_q2_score": 0.8705972549785203,
"openwebmath_perplexity": 102.9936556342472,
"openwebmath_score": 0.897523045539856,
"tags": null,
"url": "https://math.stackexchange.com/questions/2120928/prove-that-the-square-root-of-a-positive-integer-is-either-an-integer-or-irratio"
} |
Bertrand's box paradox is a classic paradox of elementary probability theory. It was first posed by Joseph Bertrand in his Calcul des probabilités, published in 1889.
There are three boxes:
1. a box containing two gold coins,
2. a box containing two silver coins,
3. a box containing one gold coin and one silver coin.
After choosing a box at random and withdrawing one coin at random, if that happens to be a gold coin, it may seem that the probability that the remaining coin is gold is 12; in fact, the probability is actually 23. Two problems that are very similar are the Monty Hall problem and the Three Prisoners problem.
These simple but slightly counterintuitive puzzles are used as a standard example in teaching probability theory. Their solution illustrates some basic principles, including the Kolmogorov axioms.
Box version
There are three boxes, each with one drawer on each of two sides. Each drawer contains a coin. One box has a gold coin on each side (GG), one a silver coin on each side (SS), and the other a gold coin on one side and a silver coin on the other (GS). A box is chosen at random, a random drawer is opened, and a gold coin is found inside it. What is the chance of the coin on the other side being gold?
The following reasoning appears to give a probability of 12:
• Originally, all three boxes were equally likely to be chosen.
• The chosen box cannot be box SS.
• So it must be box GG or GS.
• The two remaining possibilities are equally likely. So the probability that the box is GG, and the other coin is also gold, is 12.
The flaw is in the last step. While those two cases were originally equally likely, the fact that you are certain to find a gold coin if you had chosen the GG box, but are only 50% sure of finding a gold coin if you had chosen the GS box, means they are no longer equally likely given that you have found a gold coin. Specifically: | {
"domain": "wikipedia.org",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9923043537319405,
"lm_q1q2_score": 0.856747248320567,
"lm_q2_score": 0.8633916047011594,
"openwebmath_perplexity": 286.4903982179206,
"openwebmath_score": 0.7928835153579712,
"tags": null,
"url": "http://en.wikipedia.org/wiki/Bertrand's_box_paradox"
} |
• The probability that GG would produce a gold coin is 1.
• The probability that SS would produce a gold coin is 0.
• The probability that GS would produce a gold coin is 12.
Initially GG, SS and GS are equally likely. Therefore by Bayes rule the conditional probability that the chosen box is GG, given we have observed a gold coin, is:
$\frac { \mathrm{P}(see\ gold \mid GG)} { \mathrm{P}(see\ gold \mid GG)+\mathrm{P}(see\ gold \mid SS)+\mathrm{P}(see\ gold \mid GS) } =\frac{1}{1+0+1/2}= \frac{2}{3}$
The correct answer of 23 can also be obtained as follows:
• Originally, all six coins were equally likely to be chosen.
• The chosen coin cannot be from drawer S of box GS, or from either drawer of box SS.
• So it must come from the G drawer of box GS, or either drawer of box GG.
• The three remaining possibilities are equally likely, so the probability that the drawer is from box GG is 23.
Alternatively, one can simply note that the chosen box has two coins of the same type 23 of the time. So, regardless of what kind of coin is in the chosen drawer, the box has two coins of that type 23 of the time. In other words, the problem is equivalent to asking the question "What is the probability that I will pick a box with two coins of the same color?".
Bertrand's point in constructing this example was to show that merely counting cases is not always proper. Instead, one should sum the probabilities that the cases would produce the observed result; and the two methods are equivalent only if this probability is either 1 or 0 in every case. This condition is correctly applied in the second solution method, but not in the first.
The paradox as stated by Bertrand | {
"domain": "wikipedia.org",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9923043537319405,
"lm_q1q2_score": 0.856747248320567,
"lm_q2_score": 0.8633916047011594,
"openwebmath_perplexity": 286.4903982179206,
"openwebmath_score": 0.7928835153579712,
"tags": null,
"url": "http://en.wikipedia.org/wiki/Bertrand's_box_paradox"
} |
The paradox as stated by Bertrand
It can be easier to understand the correct answer if you consider the paradox as Bertrand originally described it. After a box has been chosen, but before a box is opened to let you observe a coin, the probability is 2/3 that the box has two of the same kind of coin. If the probability of "observing a gold coin" in combination with "the box has two of the same kind of coin" is 1/2, then the probability of "observing a silver coin" in combination with "the box has two of the same kind of coin" must also be 1/2. And if the probability that the box has two like coins changes to 1/2 no matter what kind of coin is shown, the probability would have to be 1/2 even if you hadn't observed a coin this way. Since we know his probability is 2/3, not 1/2, we have an apparent paradox. It can be resolved only by recognizing how the combination of "observing a gold coin" with each possible box can only affect the probability that the box was GS or SS, but not GG.
Card version
Suppose there are three cards:
• A black card that is black on both sides,
• A white card that is white on both sides, and
• A mixed card that is black on one side and white on the other.
All the cards are placed into a hat and one is pulled at random and placed on a table. The side facing up is black. What are the odds that the other side is also black?
The answer is that the other side is black with probability 23. However, common intuition suggests a probability of 12 either because there are two cards with black on them that this card could be, or because there are 3 white and 3 black sides and many people forget to eliminate the possibility of the "white card" in this situation (i.e. the card they flipped CANNOT be the "white card" because a black side was turned over).
In a survey of 53 Psychology freshmen taking an introductory probability course, 35 incorrectly responded 12; only 3 students correctly responded 23.[1] | {
"domain": "wikipedia.org",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9923043537319405,
"lm_q1q2_score": 0.856747248320567,
"lm_q2_score": 0.8633916047011594,
"openwebmath_perplexity": 286.4903982179206,
"openwebmath_score": 0.7928835153579712,
"tags": null,
"url": "http://en.wikipedia.org/wiki/Bertrand's_box_paradox"
} |
Another presentation of the problem is to say : pick a random card out of the three, what are the odds that it has the same color on the other side? Since only one card is mixed and two have the same color on their sides, it is easier to understand that the probability is 23. Also note that saying that the color is black (or the coin is gold) instead of white doesn't matter since it is symmetric: the answer is the same for white. So is the answer for the generic question 'same color on both sides'.
Preliminaries
To solve the problem, either formally or informally, one must assign probabilities to the events of drawing each of the six faces of the three cards. These probabilities could conceivably be very different; perhaps the white card is larger than the black card, or the black side of the mixed card is heavier than the white side. The statement of the question does not explicitly address these concerns. The only constraints implied by the Kolmogorov axioms are that the probabilities are all non-negative, and they sum to 1.
The custom in problems when one literally pulls objects from a hat is to assume that all the drawing probabilities are equal. This forces the probability of drawing each side to be 16, and so the probability of drawing a given card is 13. In particular, the probability of drawing the double-white card is 13, and the probability of drawing a different card is 23.
In question, however, one has already selected a card from the hat and it shows a black face. At first glance it appears that there is a 50/50 chance (i.e. probability 12) that the other side of the card is black, since there are two cards it might be: the black and the mixed. However, this reasoning fails to exploit all of the information; one knows not only that the card on the table has at least one black face, but also that in the population it was selected from, only 1 of the 3 black faces was on the mixed card. | {
"domain": "wikipedia.org",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9923043537319405,
"lm_q1q2_score": 0.856747248320567,
"lm_q2_score": 0.8633916047011594,
"openwebmath_perplexity": 286.4903982179206,
"openwebmath_score": 0.7928835153579712,
"tags": null,
"url": "http://en.wikipedia.org/wiki/Bertrand's_box_paradox"
} |
An easy explanation is that to name the black sides as x, y and z where x and y are on the same card while z is on the mixed card, then the probability is divided on the 3 black sides with 13 each. thus the probability that we chose either x or y is the sum of their probabilities thus 23.
Solutions
Intuition
Intuition tells one that one is choosing a card at random. However, one is actually choosing a face at random. There are 6 faces, of which 3 faces are white and 3 faces are black. Two of the 3 black faces belong to the same card. The chance of choosing one of those 2 faces is 23. Therefore, the chance of flipping the card over and finding another black face is also 23. Another way of thinking about it is that the problem is not about the chance that the other side is black, it's about the chance that you drew the all black card. If you drew a black face, then it's twice as likely that that face belongs to the black card than the mixed card.
Alternately, it can be seen as a bet not on a particular color, but a bet that the sides match. Betting on a particular color regardless of the face shown, will always have a chance of 12. However, betting that the sides match is 23, because 2 cards match and 1 does not.
Labels | {
"domain": "wikipedia.org",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9923043537319405,
"lm_q1q2_score": 0.856747248320567,
"lm_q2_score": 0.8633916047011594,
"openwebmath_perplexity": 286.4903982179206,
"openwebmath_score": 0.7928835153579712,
"tags": null,
"url": "http://en.wikipedia.org/wiki/Bertrand's_box_paradox"
} |
Labels
One solution method is to label the card faces, for example numbers 1 through 6.[2] Label the faces of the black card 1 and 2; label the faces of the mixed card 3 (black) and 4 (white); and label the faces of the white card 5 and 6. The observed black face could be 1, 2, or 3, all equally likely; if it is 1 or 2, the other side is black, and if it is 3, the other side is white. The probability that the other side is black is 23. This probability can be derived in the following manner: Let random variable B equal the a black face (i.e. the probability of a success since the black face is what we are looking for). Using Kolmogrov's Axiom of all probabilities having to equal 1, we can conclude that the probability of drawing a white face is 1-P(B). Since P(B)=P(1)+P(2) therefore P(B)=13+13=23. Likewise we can do this P(white face)=1-23=13.
Bayes' theorem
Given that the shown face is black, the other face is black if and only if the card is the black card. If the black card is drawn, a black face is shown with probability 1. The total probability of seeing a black face is 12; the total probability of drawing the black card is 13. By Bayes' theorem, the conditional probability of having drawn the black card, given that a black face is showing, is
$\frac{1\cdot1/3}{1/2}=2/3.$ | {
"domain": "wikipedia.org",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9923043537319405,
"lm_q1q2_score": 0.856747248320567,
"lm_q2_score": 0.8633916047011594,
"openwebmath_perplexity": 286.4903982179206,
"openwebmath_score": 0.7928835153579712,
"tags": null,
"url": "http://en.wikipedia.org/wiki/Bertrand's_box_paradox"
} |
$\frac{1\cdot1/3}{1/2}=2/3.$
It can be more intuitive to present this argument using Bayes' rule rather than Bayes' theorem[3]. Having seen a black face we can rule out the white card. We are interested in the probability that the card is black given a black face is showing. Initially it is equally likely that the card is black and that it is mixed: the prior odds are 1:1. Given that it is black we are certain to see a black face, but given that it is mixed we are only 50% certain to see a black face. The ratio of these probabilities, called the likelihood ratio or Bayes factor, is 2:1. Bayes' rule says "posterior odds equals prior odds times likelihood ratio". Since the prior odds are 1:1 the posterior odds equals the likelihood ratio, 2:1. It is now twice as likely that the card is black than that it is mixed.
Eliminating the white card
Although the incorrect solution reasons that the white card is eliminated, one can also use that information in a correct solution. Modifying the previous method, given that the white card is not drawn, the probability of seeing a black face is 34, and the probability of drawing the black card is 12. The conditional probability of having drawn the black card, given that a black face is showing, is
$\frac{1/2}{3/4}=2/3.$
Symmetry
The probability (without considering the individual colors) that the hidden color is the same as the displayed color is clearly 23, as this holds if and only if the chosen card is black or white, which chooses 2 of the 3 cards. Symmetry suggests that the probability is independent of the color chosen, so that the information about which color is shown does not affect the odds that both sides have the same color. | {
"domain": "wikipedia.org",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9923043537319405,
"lm_q1q2_score": 0.856747248320567,
"lm_q2_score": 0.8633916047011594,
"openwebmath_perplexity": 286.4903982179206,
"openwebmath_score": 0.7928835153579712,
"tags": null,
"url": "http://en.wikipedia.org/wiki/Bertrand's_box_paradox"
} |
This argument is correct and can be formalized as follows. By the law of total probability, the probability that the hidden color is the same as the displayed color equals the weighted average of the probabilities that the hidden color is the same as the displayed color, given that the displayed color is black or white respectively (the weights are the probabilities of seeing black and white respectively). By symmetry, the two conditional probabilities that the colours are the same given we see black and given we see white are the same. Since they moreover average out to 2/3 they must both be equal to 2/3.
Experiment
Using specially constructed cards, the choice can be tested a number of times. Let "B" denote the colour Black. By constructing a fraction with the denominator being the number of times "B" is on top, and the numerator being the number of times both sides are "B", the experimenter will probably find the ratio to be near 23.
Note the logical fact that the B/B card contributes significantly more (in fact twice) to the number of times "B" is on top. With the card B/W there is always a 50% chance W being on top, thus in 50% of the cases card B/W is drawn, the draw affects neither numerator nor denominator and effectively does not count (this is also true for all times W/W is drawn, so that card might as well be removed from the set altogether). Conclusively, the cards B/B and B/W are not of equal chances, because in the 50% of the cases B/W is drawn, this card is simply "disqualified".
Notes and references
1. ^ Bar-Hillel and Falk (page 119)
2. ^ Nickerson (page 158) advocates this solution as "less confusing" than other methods.
3. ^ Bar-Hillel and Falk (page 120) advocate using Bayes' Rule. | {
"domain": "wikipedia.org",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9923043537319405,
"lm_q1q2_score": 0.856747248320567,
"lm_q2_score": 0.8633916047011594,
"openwebmath_perplexity": 286.4903982179206,
"openwebmath_score": 0.7928835153579712,
"tags": null,
"url": "http://en.wikipedia.org/wiki/Bertrand's_box_paradox"
} |
# Are “most” sets in $\mathbb R$ neither open nor closed?
It seems intuitive to believe that most subsets of $\mathbb R$ are neither open nor closed.
For instance, if we consider the collection of all (open, closed, half-closed/open) intervals, then one can probably make precise the notion that "half" of all intervals in this collection are neither open nor closed. (Whether this will amount to a reasonable definition of what it means for most subsets to be neither open nor closed might be up for debate.)
If this intuition is correct, is there a way to formalise it? If not, how would we formalise its being wrong?
To be clear, I am happy for a fairly broad interpretation of the term "most". Natural interpretations include but are not limited to:
1. Measure-theoretic (e.g. is there a natural measure on (a $\sigma$-algebra on) the power set of $\mathbb R$ that assigns negligible measure to $\tau$?)
2. Topological (e.g. is there a natural topology on the power set of $\mathbb R$ where $\tau$ is meagre, or even nowhere dense?)
3. Set-theoretic (e.g. does the power set of $\mathbb R$ have larger cardinality than $\tau$?)
Here, $\tau$ is (obviously) the Euclidean topology.
Actually, that last version of the question in parentheses might have the easiest answer: Let $\mathcal B$ be the Borel sets on $\mathbb R$. We have that $|\tau| \le | \mathcal B | = | \mathbb R | < \left| 2^{\mathbb R} \right|$. (For details on the equality, see here. For a much simpler proof, see this answer.)
Are there alternative ways to make this precise? | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9881308786041316,
"lm_q1q2_score": 0.8567448139044676,
"lm_q2_score": 0.8670357666736772,
"openwebmath_perplexity": 161.26587218202604,
"openwebmath_score": 0.9278112053871155,
"tags": null,
"url": "https://math.stackexchange.com/questions/2918063/are-most-sets-in-mathbb-r-neither-open-nor-closed"
} |
Are there alternative ways to make this precise?
• A trivial answer to 1. and 2. would be to define a topology on $P(\Bbb R),$ the power-set of $\Bbb R$, as $\{\emptyset, P(\Bbb R)\setminus \tau, P(\Bbb R)\}$ and a measure $m$ with $m(P(\Bbb R))=1$ and $m(\tau)=0.$ But I don't think this is quite what you're hoping for. – DanielWainfleet Sep 16 '18 at 1:12
• @DanielWainfleet Indeed. I was hoping the word "natural" would be enough to rule out such answers. Unless there are other reasons I'm not seeing that would make such a definition natural? – Theoretical Economist Sep 17 '18 at 22:43
Since each open non-empty subset of $\mathbb R$ can be written has a countable union of open intervals and since the set of all open intervals has the same cardinal as $\mathbb R$, the set of all open subsets of $\mathbb R$ has the same cardinal as $\mathbb R$. And since there is a bijection between the open subsets of $\mathbb R$ and the closed ones, the set of all closed subsets of $\mathbb R$ also has the same cardinal as $\mathbb R$. So, in the set-theoretical sense, most subsets of $\mathbb R$ are neither closed nor open.
• To the proposer: The set of bounded open real intervals with rational end-points is a countable base (basis) for $\tau.$ For any topology $T$ with a countable base $B$ we have $|T|=|\{\cup C: C\in P(B)\}|\leq |P(B)|\leq 2^{\aleph_0}=|\Bbb R|.$.... So $|\tau|\leq |\Bbb R|.$ And we also have $|\tau|\geq |\{(r,r+1):r\in \Bbb R\}|=|\Bbb R|.$ – DanielWainfleet Sep 16 '18 at 1:27 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9881308786041316,
"lm_q1q2_score": 0.8567448139044676,
"lm_q2_score": 0.8670357666736772,
"openwebmath_perplexity": 161.26587218202604,
"openwebmath_score": 0.9278112053871155,
"tags": null,
"url": "https://math.stackexchange.com/questions/2918063/are-most-sets-in-mathbb-r-neither-open-nor-closed"
} |
# Is the Trace of the Transposed Matrix the Same as the Trace of the Matrix?
## Problem 633
Let $A$ be an $n \times n$ matrix.
Is it true that $\tr ( A^\trans ) = \tr(A)$? If it is true, prove it. If not, give a counterexample.
## Solution.
The answer is true. Recall that the transpose of a matrix is the sum of its diagonal entries. Also, note that the diagonal entries of the transposed matrix are the same as the original matrix.
Putting together these observations yields the equality $\tr ( A^\trans ) = \tr(A)$.
Here is the more formal proof.
For $A = (a_{i j})_{1 \leq i, j \leq n}$, the transpose $A^{\trans}= (b_{i j})_{1 \leq i, j \leq n}$ is defined by $b_{i j} = a_{j i}$.
In particular, notice that $b_{i i} = a_{i i}$ for $1 \leq i \leq n$. And so,
$\tr(A^{\trans}) = \sum_{i=1}^n b_{i i} = \sum_{i=1}^n a_{i i} = \tr(A) .$
### More from my site | {
"domain": "yutsumura.com",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9901401455693091,
"lm_q1q2_score": 0.8566931111164882,
"lm_q2_score": 0.8652240947405564,
"openwebmath_perplexity": 141.6648508326761,
"openwebmath_score": 0.9988897442817688,
"tags": null,
"url": "https://yutsumura.com/is-the-trace-of-the-transposed-matrix-the-same-as-the-trace-of-the-matrix/"
} |
• A Relation between the Dot Product and the Trace Let $\mathbf{v}$ and $\mathbf{w}$ be two $n \times 1$ column vectors. Prove that $\tr ( \mathbf{v} \mathbf{w}^\trans ) = \mathbf{v}^\trans \mathbf{w}$. Solution. Suppose the vectors have components $\mathbf{v} = \begin{bmatrix} v_1 \\ v_2 \\ \vdots \\ v_n […] • Does the Trace Commute with Matrix Multiplication? Is \tr (A B) = \tr (A) \tr (B) ? Let A and B be n \times n matrices. Is it always true that \tr (A B) = \tr (A) \tr (B) ? If it is true, prove it. If not, give a counterexample. Solution. There are many counterexamples. For one, take \[A = \begin{bmatrix} 1 & 0 \\ 0 & 0 […] • Matrix XY-YX Never Be the Identity Matrix Let I be the n\times n identity matrix, where n is a positive integer. Prove that there are no n\times n matrices X and Y such that \[XY-YX=I.$ Hint. Suppose that such matrices exist and consider the trace of the matrix $XY-YX$. Recall that the trace of […] | {
"domain": "yutsumura.com",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9901401455693091,
"lm_q1q2_score": 0.8566931111164882,
"lm_q2_score": 0.8652240947405564,
"openwebmath_perplexity": 141.6648508326761,
"openwebmath_score": 0.9988897442817688,
"tags": null,
"url": "https://yutsumura.com/is-the-trace-of-the-transposed-matrix-the-same-as-the-trace-of-the-matrix/"
} |
• Prove that the Dot Product is Commutative: $\mathbf{v}\cdot \mathbf{w}= \mathbf{w} \cdot \mathbf{v}$ Let $\mathbf{v}$ and $\mathbf{w}$ be two $n \times 1$ column vectors. (a) Prove that $\mathbf{v}^\trans \mathbf{w} = \mathbf{w}^\trans \mathbf{v}$. (b) Provide an example to show that $\mathbf{v} \mathbf{w}^\trans$ is not always equal to $\mathbf{w} […] • If 2 by 2 Matrices Satisfy$A=AB-BA$, then$A^2$is Zero Matrix Let$A, B$be complex$2\times 2$matrices satisfying the relation $A=AB-BA.$ Prove that$A^2=O$, where$O$is the$2\times 2$zero matrix. Hint. Find the trace of$A$. Use the Cayley-Hamilton theorem Proof. We first calculate the […] • Determine Whether Given Matrices are Similar (a) Is the matrix$A=\begin{bmatrix} 1 & 2\\ 0& 3 \end{bmatrix}$similar to the matrix$B=\begin{bmatrix} 3 & 0\\ 1& 2 \end{bmatrix}$? (b) Is the matrix$A=\begin{bmatrix} 0 & 1\\ 5& 3 \end{bmatrix}$similar to the matrix […] • If Two Matrices are Similar, then their Determinants are the Same Prove that if$A$and$B$are similar matrices, then their determinants are the same. Proof. Suppose that$A$and$B$are similar. Then there exists a nonsingular matrix$S$such that $S^{-1}AS=B$ by definition. Then we […] • Matrix Operations with Transpose Calculate the following expressions, using the following matrices: $A = \begin{bmatrix} 2 & 3 \\ -5 & 1 \end{bmatrix}, \qquad B = \begin{bmatrix} 0 & -1 \\ 1 & -1 \end{bmatrix}, \qquad \mathbf{v} = \begin{bmatrix} 2 \\ -4 \end{bmatrix}$ (a)$A B^\trans + \mathbf{v} […] | {
"domain": "yutsumura.com",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9901401455693091,
"lm_q1q2_score": 0.8566931111164882,
"lm_q2_score": 0.8652240947405564,
"openwebmath_perplexity": 141.6648508326761,
"openwebmath_score": 0.9988897442817688,
"tags": null,
"url": "https://yutsumura.com/is-the-trace-of-the-transposed-matrix-the-same-as-the-trace-of-the-matrix/"
} |
#### You may also like...
##### The Vector $S^{-1}\mathbf{v}$ is the Coordinate Vector of $\mathbf{v}$
Suppose that $B=\{\mathbf{v}_1, \mathbf{v}_2\}$ is a basis for $\R^2$. Let $S:=[\mathbf{v}_1, \mathbf{v}_2]$. Note that as the column vectors of $S$...
Close | {
"domain": "yutsumura.com",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9901401455693091,
"lm_q1q2_score": 0.8566931111164882,
"lm_q2_score": 0.8652240947405564,
"openwebmath_perplexity": 141.6648508326761,
"openwebmath_score": 0.9988897442817688,
"tags": null,
"url": "https://yutsumura.com/is-the-trace-of-the-transposed-matrix-the-same-as-the-trace-of-the-matrix/"
} |
# This note has been used to help create the Componendo and Dividendo wiki
See the complete wiki page here.
The method of Componendo et Dividendo allows a quick way to do some calculations, and can simplify the amount of expansion needed.
If $a, b, c$ and $d$ are numbers such that $b, d$ are non-zero and $\frac{a}{b} = \frac{c}{d}$, then
$\begin{array} {l r l } \text{1. Componendo:} & \frac{ a+b}{b} & = \frac{ c+d}{d}. \\ \text{2. Dividendo: } & \frac{ a-b}{b} & = \frac{ c-d} {d}. \\ \text{ Componendo et Dividendo: } & \\ \text{3. For } k \neq \frac{a}{b},& \frac{ a+kb}{a-kb} & = \frac{ c+kd}{c-kd} .\\ \text{4. For } k \neq \frac{-b}{d}, & \frac{ a}{b} & = \frac{ a + kc } { b + kd }. \\ \end{array}$
This can be proven directly by observing that
$\begin{array} {l r l } \text{ 1.} \frac{ a+b}{b} = \frac{ \frac{a}{b} + 1} {1} = \frac{ \frac{c}{d} + 1} {1} = \frac{ c+d}{d} . \\ \text{ 2.} \frac{ a-b}{b} = \frac{ \frac{a}{b} - 1} {1} = \frac{ \frac{c}{d} - 1} {1} = \frac{ c-d}{d} . \\ \text{ 3.} \frac{ a+kb}{a-kb} = \frac{ \frac{a}{b} + k } { \frac{a}{b} - k} = \frac{ \frac{c}{d} + k } { \frac{ c}{d} -k} = \frac{ c+kd} { c-kd} . \\ \text{ 4.} \frac{ a + kc} { b+ kd} = \frac{ a}{b} \times \frac{ 1 + k \frac{c}{a} } { 1 + k \frac{d}{b} } = \frac{ a}{b} . \end{array}$
## Worked examples
### 1. Show the converse, namely that if $a, b, c$ and $d$ are numbers such that $b, d, a-b, c-d$ are non-zero and $\frac{ a+b}{a-b} = \frac{c+d} { c-d}$, then $\frac{ a}{b} = \frac{c}{d}$.
Solution: We apply Componendo et Dividendo with $k=1$ (which is valid since $\frac{a+b}{a-b} \neq 1$ ), and get that $\frac{ 2a } { 2b} = \frac{ (a+b) + (a-b) } { (a+b) - (a-b) } = \frac{ (c+d) + (c-d) } { (c+d) - (c-d) } = \frac{ 2c} { 2d}.$
Note: The converse of Componendo and Dividendo also holds, and we can prove it by applying Dividendo and Componendo respectively.
### 2. Solve for $x$: $\frac{ x^3+1} { x+ 1} = \frac{ x^3-1} { x-1}$. | {
"domain": "brilliant.org",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9901401446964613,
"lm_q1q2_score": 0.8566931103612793,
"lm_q2_score": 0.8652240947405564,
"openwebmath_perplexity": 1087.8622986071887,
"openwebmath_score": 0.9854892492294312,
"tags": null,
"url": "https://brilliant.org/discussions/thread/componendo-et-dividendo-2/"
} |
### 2. Solve for $x$: $\frac{ x^3+1} { x+ 1} = \frac{ x^3-1} { x-1}$.
Solution: For the fractions to make sense, we must have $x \neq 1, -1$.
Cross multiplying, we get $\frac{ x^3+1}{x^3-1} = \frac{ x+1}{x-1}.$
Apply Componendo et Dividendo with $k=1$ (which is valid since $\frac{x+1}{x-1} \neq 1$ ), we get that $\frac{ 2x^3}{2} = \frac{ 2x}{2} \Rightarrow x(x^2-1) = 0$. However since $x \neq 1, -1$, we have $x=0$ as the only solution.
Note: We also need to check the condition that the denominators are non-zero, but this is obvious.
Note by Calvin Lin
5 years, 5 months ago
MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2
paragraph 1
paragraph 2
[example link](https://brilliant.org)example link
> This is a quote
This is a quote
# I indented these lines
# 4 spaces, and now they show
# up as a code block.
print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.
print "hello world"
MathAppears as
Remember to wrap math in $ ... $ or $ ... $ to ensure proper formatting.
2 \times 3 $2 \times 3$
2^{34} $2^{34}$
a_{i-1} $a_{i-1}$
\frac{2}{3} $\frac{2}{3}$
\sqrt{2} $\sqrt{2}$
\sum_{i=1}^3 $\sum_{i=1}^3$
\sin \theta $\sin \theta$
\boxed{123} $\boxed{123}$
Sort by:
if a/b =c/d what will be the result by componendo dividendo
- 5 years, 2 months ago
See the statements contained in the first box.
Staff - 5 years, 2 months ago
Sorry I'm slightly confused, could you clarify what Componendo and Dividendo integrate to?
- 3 years, 5 months ago
Check out the examples on the componendo and dividendo wiki page.
Staff - 3 years, 5 months ago
I found out (somewhat accidentally) that
$\frac{a+mb}{b+na} = \frac{c+md}{d+nc}$ | {
"domain": "brilliant.org",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9901401446964613,
"lm_q1q2_score": 0.8566931103612793,
"lm_q2_score": 0.8652240947405564,
"openwebmath_perplexity": 1087.8622986071887,
"openwebmath_score": 0.9854892492294312,
"tags": null,
"url": "https://brilliant.org/discussions/thread/componendo-et-dividendo-2/"
} |
I found out (somewhat accidentally) that
$\frac{a+mb}{b+na} = \frac{c+md}{d+nc}$
is also true. It's quite easy to prove; it can also be derived from the 4th case stated above. It seems different enough, though, to be worth a mention, yet I never see it anywhere. Or is it perhaps that there are many other such corollaries and only the most basic ones are usually listed?
- 1 year, 7 months ago
Ohhh, that's a really nice identity. It is a generalization of Worked Example 1. Can you add it to the Componendo and Dividendo wiki under Problem Solving?
Like you said, it is essentially / can be derived from the 4th case, where we have $\frac{ a + mb } { c + md} = \frac{a}{c} = \frac{b}{d} = \frac{ b+na}{d + nc }$ (as long as the denominators are non-zero).
Staff - 1 year, 7 months ago
Have finally had a chance to add the identity to the Wiki; please take a look when you can and let me know if I need to make any changes. (I accidentally first added it to the Theorem section before I remembered that you said Problem Solving, I did move it to the correct section after that, hope it didn't cause any problems.) I also added an example applying it a little further down, in the section that introduced using C&D with non-linear terms. The Wiki mentioned the terms could be polynomial or exponential; my example uses trig functions, I believe it's still valid but please take a look and let me know if there are any issues. Thanks.
- 1 year, 7 months ago
That's a great writeup. I like how you highlighted Method 1, which "by right" should be how people understand this identity, and "by left" it is placed in this wiki because of the form it took.
Yes, your example with a trigo substitution is valid. Good one. Thanks!
Staff - 1 year, 7 months ago | {
"domain": "brilliant.org",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9901401446964613,
"lm_q1q2_score": 0.8566931103612793,
"lm_q2_score": 0.8652240947405564,
"openwebmath_perplexity": 1087.8622986071887,
"openwebmath_score": 0.9854892492294312,
"tags": null,
"url": "https://brilliant.org/discussions/thread/componendo-et-dividendo-2/"
} |
# Thread: Parametric equations of plane problem
1. ## Parametric equations of plane problem
This problem was confusing me so any help would be appreciated!
Write both the parametric and symmetric equations of the line of intersection of the planes with the equations 2x - y + z = 5 and x + y - z = 1.
2. Originally Posted by clockingly
This problem was confusing me so any help would be appreciated!
Write both the parametric and symmetric equations of the line of intersection of the planes with the equations 2x - y + z = 5 and x + y - z = 1.
If $z=0$ then:
$2x-y=5$
$x+y=1$
Thus, $x=2$ and $y=-1$
If $z=1$ then:
$2x-y=4$
$x+y=2$
Thus, $x=2$ and $y=0$
Thus, we have that this line must contains the points $(2,-1,0)\mbox{ and }(2,0,1)$
Thus, the Symettric Equation is:
$\frac{x-2}{0} = \frac{y+1}{-1} = \frac{z-0}{-1}$
Note, this is a zero in the denominator of the first fraction, it is a useful notation I saw in a Russian Textbook* which simply means $x=2$ constantly, so it is just a shorthand notation.
*)If you are interested the Textbook was written by Perelman! Not Perelman you think it is but his grandfather!
3. Originally Posted by ThePerfectHacker
Thus, the Symettric Equation is:
$\frac{x-2}{0} = \frac{y+1}{-1} = \frac{z-0}{-1}$
Note, this is a zero in the denominator of the first fraction, it is a useful notation I saw in a Russian Textbook* which simply means $x=2$ constantly, so it is just a shorthand notation.
*)If you are interested the Textbook was written by Perelman! Not Perelman you think it is but his grandfather!
Thanks for that TPH. i did this question the same as you did, but i had no idea what to do with that 0 in the denominator, it kind of freaked me out, so i decided not to post | {
"domain": "mathhelpforum.com",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9763105335255603,
"lm_q1q2_score": 0.8566898399272382,
"lm_q2_score": 0.8774767970940975,
"openwebmath_perplexity": 407.96947903877344,
"openwebmath_score": 0.8964012861251831,
"tags": null,
"url": "http://mathhelpforum.com/calculus/16873-parametric-equations-plane-problem.html"
} |
4. Originally Posted by Jhevon
Thanks for that TPH. i did this question the same as you did, but i had no idea what to do with that 0 in the denominator, it kind of freaked me out, so i decided not to post
The way it is taught in American schools is if that every happens then the fuction does not have a "symettric form" to it. It only has parametric. But Grandpa's Perelman notation is really useful like I said.
5. Hello, clockingly!
Write both the parametric and symmetric equations of the line of intersection
of the planes with the equations: . $\begin{array}{ccc}2x - y + z &= &5 \\ x + y - z &= &1\end{array}$
This is how I was taught to find the intersection of two planes.
We have: . $\begin{array}{cccc}2x - y + z & = & 5 & {\color{blue}[1]}\\ x + y -z & = & 1 & {\color{blue}[2]}\end{array}$
Add [1] and [2]: . $3x \,=\,6\quad\Rightarrow\quad x\,=\,2$
Substitute into [2]: . $2 + y - z \:=\:1\quad\Rightarrow\quad y \:=\:z-1$
We have $x,\,y,\,z$ as a function of $z\!:\;\;\begin{Bmatrix}x & = & 2 \\ y & = & z-1 \\ z & = & z\end{Bmatrix}$
On the right side, replace $z$ with a parameter $t$.
. . . . $\begin{Bmatrix}x & = & 2 \\ y & = & t - 1 \\ z & = & t\end{Bmatrix}$ . . . . There!
6. Originally Posted by Soroban
Hello, clockingly!
This is how I was taught to find the intersection of two planes.
We have: . $\begin{array}{cccc}2x - y + z & = & 5 & {\color{blue}[1]}\\ x + y -z & = & 1 & {\color{blue}[2]}\end{array}$
Add [1] and [2]: . $3x \,=\,6\quad\Rightarrow\quad x\,=\,2$
Substitute into [2]: . $2 + y - z \:=\:1\quad\Rightarrow\quad y \:=\:z-1$
We have $x,\,y,\,z$ as a function of $z\!:\;\;\begin{Bmatrix}x & = & 2 \\ y & = & z-1 \\ z & = & z\end{Bmatrix}$
On the right side, replace $z$ with a parameter $t$.
. . . . $\begin{Bmatrix}x & = & 2 \\ y & = & t - 1 \\ z & = & t\end{Bmatrix}$ . . . . There!
nice method | {
"domain": "mathhelpforum.com",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9763105335255603,
"lm_q1q2_score": 0.8566898399272382,
"lm_q2_score": 0.8774767970940975,
"openwebmath_perplexity": 407.96947903877344,
"openwebmath_score": 0.8964012861251831,
"tags": null,
"url": "http://mathhelpforum.com/calculus/16873-parametric-equations-plane-problem.html"
} |
nice method
7. The customary notation used in textbooks in North America for the symmetric form in which one direction number is zero is to use a semicolon: $\frac{{y + 1}}{{ - 1}} = \frac{z}{{ - 1}}\, ;\,x = 2$. | {
"domain": "mathhelpforum.com",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9763105335255603,
"lm_q1q2_score": 0.8566898399272382,
"lm_q2_score": 0.8774767970940975,
"openwebmath_perplexity": 407.96947903877344,
"openwebmath_score": 0.8964012861251831,
"tags": null,
"url": "http://mathhelpforum.com/calculus/16873-parametric-equations-plane-problem.html"
} |
# Proving $\frac{n^n}{e^{n-1}}<n!<\frac{(n+1)^{n+1}}{e^{n}}$ by induction for all $n> 2$.
I am trying to prove
$$\frac{n^n}{e^{n-1}}<n!<\frac{(n+1)^{n+1}}{e^{n}} \text{ for all }n > 2.$$
Here is the original source (Problem 1B, on page 12 of PDF)
Can this be proved by induction?
The base step $n=3$ is proved: $\frac {27}{e^2} < 6 < \frac{256}{e^3}$ (since $e^2 > 5$ and $e^3 < 27$, respectively).
I can assume the case for $n=k$ is true: $\frac{k^k}{e^{k-1}}<k!<\frac{(k+1)^{k+1}}{e^{k}}$.
For $n=k+1$, I am having trouble:
\begin{align} (k+1)!&=(k+1)k!\\&>(k+1)\frac{k^k}{e^{k-1}}\\&=e(k+1)\frac{k^k}{e^{k}} \end{align} Now, by graphing on a calculator, I found it true that $ek^k >(k+1)^k$ (which would complete the proof for the left inequality), but is there some way to prove this relation?
And for the other side of the inequality, I am also having some trouble: \begin{align} (k+1)!&=(k+1)k!\\&<(k+1)\frac{(k+1)^{k+1}}{e^{k}}\\&=\frac{(k+1)^{k+2}}{e^k}\\&<\frac{(k+2)^{k+2}}{e^k}. \end{align} I can't seem to obtain the $e^{k+1}$ in the denominator, needed to complete the induction proof. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9763105314577313,
"lm_q1q2_score": 0.8566898334204925,
"lm_q2_score": 0.8774767922879693,
"openwebmath_perplexity": 309.60411274479463,
"openwebmath_score": 0.9996531009674072,
"tags": null,
"url": "https://math.stackexchange.com/questions/1148442/proving-fracnnen-1n-fracn1n1en-by-induction-for-all"
} |
• just curious, what level this exam is -to enter PhD program or some qual? – Alex Feb 15 '15 at 13:47
• @Alex According to the link provided in my question, it's UC Berkeley's "preliminary exam", which apparently their students must pass before they can continue their Ph.D program and eventually take their oral qualifying exam. – Cookie Feb 15 '15 at 17:52
• Also, there is a solution here math.berkeley.edu/sites/default/files/pages/… (page 12 of PDF), but the solution uses integration. I understand that method works, but I wanted to also prove this by induction. Induction must be possible to use here... – Cookie Feb 15 '15 at 17:55
• so it's a prelim to qual exam? – Alex Feb 16 '15 at 0:05
• It's a prelim required to stay in the Ph.D program. The student has two chances (or maybe three based on appeal) to pass the exam, or else the student is dismissed. – Cookie Feb 16 '15 at 0:27
Let's try an inductive proof from the original inquality for $n$, let's prove for $n+1$
$$\frac{n^n}{e^{n-1}}<n!<\frac{(n+1)^{n+1}}{e^{n}}$$
Okay, multiply both sides by $n+1$. At least the middle is correct
$$(n+1)\frac{n^n}{e^{n-1}}<(n+1)!<\frac{(n+1)^{n+2}}{e^{n}}$$
and we have to make the left and right sides look more appropriate
$$\left(\color{red}{\frac{n}{n+1}} \right)^\color{red}{n}\frac{(n+1)^{n+1}}{e^{n-1}}<(n+1)!<\frac{(n+2)^{n+2}}{e^{n}} \left(\color{blue}{\frac{n+1}{n+2}}\right)^{\color{blue}{n+2}}$$
Our induction is complete if we can prove two more inequalities:
$$\frac{1}{e} < \left(\frac{n}{n+1} \right)^n \text{ and } \left(\frac{n+1}{n+2}\right)^{n+2}< \frac{1}{e}$$
These two inequalities can be combined into one and we can take reciprocals. At least it is well-known.
$$\bigg(1 + \frac{1}{m}\bigg)^{m+1}> \mathbf{e} > \bigg(1 + \frac{1}{n} \bigg)^n$$
This is true for any $m, n \in \mathbb{N}$.
You shave off a little bit too much when you said $(k+1)^{k+2} < (k+2)^{k+2}$. Instead, you needed the more delicate:
$$(k+1)^{k+2} < \frac{1}{e} (k+2)^{k+2}$$ | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9763105314577313,
"lm_q1q2_score": 0.8566898334204925,
"lm_q2_score": 0.8774767922879693,
"openwebmath_perplexity": 309.60411274479463,
"openwebmath_score": 0.9996531009674072,
"tags": null,
"url": "https://math.stackexchange.com/questions/1148442/proving-fracnnen-1n-fracn1n1en-by-induction-for-all"
} |
$$(k+1)^{k+2} < \frac{1}{e} (k+2)^{k+2}$$
If you know1 that: $$a_n=\left(1+\frac{1}{n}\right)^n,\qquad b_n = \left(1+\frac{1}{n}\right)^{n+1}$$ give to sequences converging towards $e$, where $\{a_n\}$ is increasing while $\{b_n\}$ is decreasing, consider that:
$$n = \prod_{k=1}^{n-1}\left(1+\frac{1}{k}\right),\tag{1}$$ so: $$n! = \prod_{m=2}^{n} m = \prod_{m=2}^{n}\prod_{k=1}^{m-1}\left(1+\frac{1}{k}\right) = \prod_{k=1}^{n-1}\left(1+\frac{1}{k}\right)^{n-k}=\frac{n^n}{\prod_{k=1}^{n-1}\left(1+\frac{1}{k}\right)^k}\tag{2}$$ and your inequality trivially follows.
1) If you are not aware of such a classical result, then prove it by induction. It is rather easy.
• I think that it is not as easy as you think. – marty cohen Feb 15 '15 at 4:09
• @martycohen: it is also possible to use AM-GM in order to prove that $\{a_n\}$ is increasing and $\{b_n\}$ is decreasing. I think there are many questions/answers on MSE devoted to such well-known fact. – Jack D'Aurizio Feb 15 '15 at 4:12
• Here, for example: math.stackexchange.com/questions/389793/… – marty cohen Feb 15 '15 at 4:18
Proof: We will prove the inequality by induction. Since $e^2 > 5$ and $e^3 < 27$, we have $$\frac {27}{e^2} < 6 < \frac{256}{e^3}.$$ Thus, the statement for $n=3$ is true. The base step is complete.
For the induction step, we assume the statement is true for $n=k$. That is, assume $$\frac{k^k}{e^{k-1}}<k!<\frac{(k+1)^{k+1}}{e^{k}}.$$ | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9763105314577313,
"lm_q1q2_score": 0.8566898334204925,
"lm_q2_score": 0.8774767922879693,
"openwebmath_perplexity": 309.60411274479463,
"openwebmath_score": 0.9996531009674072,
"tags": null,
"url": "https://math.stackexchange.com/questions/1148442/proving-fracnnen-1n-fracn1n1en-by-induction-for-all"
} |
We want to prove that the statement is true for $n=k+1$. It is straightforward to see for all $k > 2$ that $\left(1+\frac 1k \right)^k < e < \left(1+\frac 1k \right)^{k+1}$; this algebraically implies $$\left(\frac k{k+1} \right)^{k+1} < \frac 1e < \left(\frac k{k+1} \right)^k. \tag{*}$$ A separate induction proof for the left inequality of $(*)$ establishes $\left(\frac{k+1}{k+2} \right)^{k+2}<\frac 1e$. We now have \begin{align} (k+1)! &= (k+1)k! \\ &< (k+1) \frac{(k+1)^{k+1}}{e^k} \\ &= \frac{(k+1)^{k+2}}{e^k} \\ &= \frac{(k+1)^{k+2}}{e^k} \left( \frac{k+2}{k+2} \right)^{k+2} \\ &= \frac{(k+2)^{k+2}}{e^k} \left( \frac{k+1}{k+2} \right)^{k+2} \\ &< \frac{(k+2)^{k+2}}{e^k} \frac 1e \\ &= \frac{(k+2)^{k+2}}{e^{k+1}} \end{align} and \begin{align} (k+1)! &= (k+1)k! \\ &> (k+1) \frac{k^k}{e^{k-1}} \\ &= (k+1) \frac{k^k}{e^{k-1}} \left(\frac{k+1}{k+1} \right)^k \\ &= \frac{(k+1)^{k+1}}{e^{k-1}} \left( \frac k{k+1} \right)^k \\ &> \frac{(k+1)^{k+1}}{e^{k-1}} \frac 1e \\ &= \frac{(k+1)^{k+1}}{e^k}. \end{align} We have established that the statement $$\frac{(k+1)^{k+1}}{e^k}<(k+1)!<\frac{(k+2)^{k+2}}{e^{k+1}}$$ for $n=k+1$ is true. This completes the proof.
Some times it is easier for such an induction if we shift the sequence by one step, so the basis of the expressions is nicer for algebraic manipulations.
Let's rewrite your sequence of inequalities as
$$\displaystyle {n! \over e}<{(n+1)^{n+1} \over e^{n+1}} < {(n+1)! \over e} <{(n+2)^{n+2} \over e^{n+2}}< {(n+2)! \over e} \tag 1$$
and for simpler references below as $$a_0 \quad < \quad b_0 \quad <\quad a_1 \quad <\quad b_1 \quad < \quad a_2 \tag 2$$
Then we ask: does from $a_0<b_0<a_1$ follow that $a_1<b_1<a_2$ ? | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9763105314577313,
"lm_q1q2_score": 0.8566898334204925,
"lm_q2_score": 0.8774767922879693,
"openwebmath_perplexity": 309.60411274479463,
"openwebmath_score": 0.9996531009674072,
"tags": null,
"url": "https://math.stackexchange.com/questions/1148442/proving-fracnnen-1n-fracn1n1en-by-induction-for-all"
} |
Then we ask: does from $a_0<b_0<a_1$ follow that $a_1<b_1<a_2$ ?
Of course $a_1 = (n+1) \cdot a_0$ and so it might be useful to define $b_0$ as a fraction in the interval of $a_0$ and $a_1$: $$b_0 = (n+1)q_1 \cdot a_0 \text{ where } q_1<1 \tag {3.1 }$$. Consequently, define $$b_1 = (n+2)q_2 \cdot a_1 \text{ where also } q_2<1 \tag {3.2 }$$ Here the inequality $q_2 < 1$ is not known but expected and if this can be shown by induction from $q_1$ this would solve the problem .
So we start with $$q_1 = {b_0 \over a_0 (n+1)} = {(n+1)^{n} \over e^n n! } \tag {4.1 }$$ and by the beginning of the induction we know, that this is indeed smaller than 1 so $$q_1 < 1 \tag {4.2 }$$
Now we have simply $$q_2 = {b_1 \over a_1 (n+2)} = {(n+2)^{n+1} \over e^{n+1} (n+1)! } \tag {4.3 }$$ Next we consider the systematic progression in the sequence of $q_1,q_2,q_3,...$. To begin we determine the ratio $r_2={q_2 \over q_1}$ . We find $$\begin{eqnarray} r_2&=&{q_2 \over q_1}& =&{ {(n+2)^{n+1} \over e^{n+1} (n+1)! } \over {(n+1)^{n} \over e^{n} (n)! } } \\ &&&=& {(n+2)^{n+1} e^{n} (n)! \over e^{n+1} (n+1)! (n+1)^{n}} \\ &&&=& {(n+2)^{n+1} \over e (n+1)^{n+1}} \\ &&&=& \left({n+2 \over n+1}\right)^{n+1} \cdot \frac 1e \\ r_2&=&{q_2 \over q_1}& =& \left( 1 + {1 \over n+1} \right)^{n+1} \cdot \frac 1e \end{eqnarray} \tag {5.1 }$$
It is now needed to recognize/remember from the definition of $e$, that the last expression is smaller than 1 and that for $n \to \infty$ approximates monotonically 1.
Also we see by the expansion of the binomial-series $(1+1/x)^x=1+1+1/2+...$ in the general case that for $x>2$ this is greater than $2$ so $${2 \over e} \approx 0.73 < r_2 < 1 \tag{5.2}$$
From this we know now, that $q_2$ is not only smaller than $1$ but also smaller than $q_1$ but$q_{n+1} \to q_n$ for increasing $n$.
So we have $$\begin{eqnarray} &q_2 &=& q_1 \cdot r_2 < q_1 < 1 \\ \to& b_1 &<& (n+2) a_1 = a_2 \\ \to &a_1 &<& b_1 <a_2 \end{eqnarray} \tag {6 }$$ which we wanted to show. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9763105314577313,
"lm_q1q2_score": 0.8566898334204925,
"lm_q2_score": 0.8774767922879693,
"openwebmath_perplexity": 309.60411274479463,
"openwebmath_score": 0.9996531009674072,
"tags": null,
"url": "https://math.stackexchange.com/questions/1148442/proving-fracnnen-1n-fracn1n1en-by-induction-for-all"
} |
Since several answers have already proven the result via induction, I see no harm in recording an additional proof that does not use induction.
We claim for all $n\ge 1$, $$\int_{0}^{1} (x\log(x))^n \, dx = \frac{(-1)^n n!}{(n+1)^{n+1}}$$ This can be shown using differentiation under the integral sign; set $k=n$ below: $$f(n) = \int_{0}^{1} x^n \, dx = \frac{1}{n+1} \implies \frac{d^k}{dn^k} f(n) = \int_{0}^{1} x^n (\log(x))^k \, dx = \frac{(-1)^{k} k!}{(n+1)^{k+1}}$$
Since $x \log(x)$ does not change sign, we have $$\int_{0}^{1} |x\log(x)|^n \, dx = \frac{n!}{(n+1)^{n+1}}$$ From this expression, we see that the given inequality is equivalent to $$\frac{1}{(n+1)e^n} < \int_{0}^{1} |x\log(x)|^n \, dx < \frac{1}{e^n}$$
A simple computation shows $|x\log(x)|^n$ attains a maximum of $e^{-n}$ at $x=e^{-1}$, so the upper bound is evident. To see the lower bound, note $|x\log(x)|^n$ is a concave function, so its graph encloses the triangle with vertices $(0,0)$, $(1,0)$, and $(e^{-n}, e^{-1})$. This triangle has area $e^{-n}/2 > e^{-n}/(n+1)$ since $n>2$. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9763105314577313,
"lm_q1q2_score": 0.8566898334204925,
"lm_q2_score": 0.8774767922879693,
"openwebmath_perplexity": 309.60411274479463,
"openwebmath_score": 0.9996531009674072,
"tags": null,
"url": "https://math.stackexchange.com/questions/1148442/proving-fracnnen-1n-fracn1n1en-by-induction-for-all"
} |
# Formula of nth term of a pattern
1. Aug 27, 2014
### songoku
1. The problem statement, all variables and given/known data
Find the formula for nth term of:
.... , -450 , -270 , -180 , -90 , 90 , 180 , 270 , 450 , ...
2. Relevant equations
Arithmetic and geometric series
Recursive
3. The attempt at a solution
Usually when finding the formula of Un, n starts from 1. But since the pattern goes infinite in both ways, how can we set which one is the first term?
As for recursive, it usually involves the preceding term, Un-1. Again, how can we determine the preceding term for the above case?
Please give me idea how to start solving this. Thank you very much
2. Aug 27, 2014
### jackarms
For the general formula (in terms of n), you're right that the sequence going both ways complicates things. The answer is that you have to arbitrarily designate a term to be $a_{1}$, or perhaps $a_{0}$. You would write the whole formula based around that starting term, in a form like this:
$a_{n} = ....$, where $a_{0} = 3$
For the recursive definition, you'll just use a term and the preceding term. Since it's recursive, you don't need to know the particular values for either of those terms -- the recursive form just means you describe a term in terms of its preceding term. So it works with any two (adjacent) terms in the sequence, and so it isn't necessary to designate a starting term. The form for that would look like:
$a_{n} = a_{n-1}....$
So $a_{n}$ can refer to any term in the sequence, because this rule works for any pair of terms in the sequence, no matter how long it is and whether it goes infinitely in just one direction or two.
Last edited: Aug 27, 2014
3. Aug 27, 2014
### Ray Vickson | {
"domain": "physicsforums.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.97631052387569,
"lm_q1q2_score": 0.8566898314597009,
"lm_q2_score": 0.8774767970940975,
"openwebmath_perplexity": 339.44778732873704,
"openwebmath_score": 0.7913281917572021,
"tags": null,
"url": "https://www.physicsforums.com/threads/formula-of-nth-term-of-a-pattern.767884/"
} |
Last edited: Aug 27, 2014
3. Aug 27, 2014
### Ray Vickson
Just fix $n = 0$ anywhere you want; for example, you can take $U_0 = -450.$ All the $U_n$ for $n < 0$ are the ones you do not see to the left of what you have written and all the $U_n$ for $n > 7$ are the ones you don't see to the right of what you have written. Now just start taking differences and see what you get---there is a nice pattern.
4. Aug 28, 2014
### songoku
I still can't find the pattern. Do we have to make separate formula for n < 0 and n > 0?
I tried to set U0 = 0, at the middle of the positive and negative terms. What I got is 270 = 180 + 90 ; 450 = 270 + 180. Maybe it is related to Un = Un-1 + Un-2, but I don't know about 90 and 180.
Thanks
5. Aug 30, 2014
### SammyS
Staff Emeritus
The pattern is evident in the sequence as it's given, before you assign any starting point.
Hint: Make a difference table with 1st & 2nd differences.
6. Aug 31, 2014
### Ray Vickson
For the sequence
$$U = \{U_i,i=0,1,2, \ldots \} = \{-450 , -270 , -180 , -90 , 90 , 180 , 270 , 450 , \ldots\}$$
the sequence of first differences is
$$dU = \{U_{i+1}-U_{i}, i = 0,1,2,\ldots \} = \{ -270-(-450),-180-(-270), \ldots \} = \{ 180,90,90,180,90,90,\ldots \} \\ = 90 + 90 \{1,0,0,1,0,0,1,0,0,\ldots \}$$
If you can find a nice formula for the sequence $\{1,0,0,1,0,0,1,0,0,\ldots \}$ you are almost finished. If you know about complex variables and the three (complex) roots of unity, you can finish up with a finite sum of some geometric series, to get a fairly nice formula for the nth term of your original sequence.
7. Aug 31, 2014
### PeroK
Alternatively, you should be able to do something with n (mod3) to formulate the sequence of 1, 0, 0, 1, 0, 0 ...
8. Sep 2, 2014
### andrewkirk | {
"domain": "physicsforums.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.97631052387569,
"lm_q1q2_score": 0.8566898314597009,
"lm_q2_score": 0.8774767970940975,
"openwebmath_perplexity": 339.44778732873704,
"openwebmath_score": 0.7913281917572021,
"tags": null,
"url": "https://www.physicsforums.com/threads/formula-of-nth-term-of-a-pattern.767884/"
} |
8. Sep 2, 2014
### andrewkirk
If we are to be rigorous, we need to take care with our definitions in defining the pattern. Recursive definitions mostly use the Recursion Theorem, which is only defined on the positive integers $Z_+$. For more general well-ordered sets we can use the Theorem of Transfinite Recursive Definition, but that's not needed here.
We can't just use the Recursion Theorem here in a single step, because the base set is the full set of integers, which is not well-ordered. The following trick gets around this problem.
Define $a_1=90, b_1=-90$
Define rules to give $a_{n+1}$ and $b_{n+1}$ in terms of $a_n$ and $b_n$ as follows, for $n\in Z_+$:
$a_{n+1}=a_n+180$ if $n+1$ is divisible by 3, else $a_{n+1}=a_n+90$
$b_{n+1}=b_n-180$ if $n+1$ is divisible by 3, else $b_{n+1}=b_n-90$
Then the recursion theorem tells us that these definitions prescribe unique sequences $a_n$ and $b_n$.
Now we can just define $c:Z\to Z$ by $c(n)=a_{n+1}$ if $n\geq 0$, otherwise $c(n)=b_{-n}$.
Last edited: Sep 2, 2014
9. Sep 14, 2014
### songoku
I think I get the idea. I'll try it first. Thanks a lot for the help
10. Sep 25, 2014
### Simon Bridge
I'm always puzzled by these things - i.e. notice how the sequence is symmetrical about the -90,90 terms?
Why not exploit that? Put $a_1=90$, then $a_n = (n/|n|)a_{|n|}$ ... the sequence for $a_{|n|}$ should be easy ... though there are only four terms so you are spoiled for choice. {90, 180, 270, 450...} the differences than go {1, 1, 2, ...} in units of $a_1$, which is suggestive.
What approach you choose seems to depend on what assumptions you make about the pattern in question. | {
"domain": "physicsforums.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.97631052387569,
"lm_q1q2_score": 0.8566898314597009,
"lm_q2_score": 0.8774767970940975,
"openwebmath_perplexity": 339.44778732873704,
"openwebmath_score": 0.7913281917572021,
"tags": null,
"url": "https://www.physicsforums.com/threads/formula-of-nth-term-of-a-pattern.767884/"
} |
# Prove upper bound for recurrence
I am working on problem set 8 problem 3 from MIT's Fall 2010 OCW class 6.042J. This is covered in chapter 10 which is about recurrences.
Here is the problem:
$$A_0 = 2$$ $$A_{n+1} = A_n/2 + 1/A_n, \forall n \ge 1$$
Prove
$$A_n \le \sqrt2 + 1/2^n, \forall n \ge 0$$
I have graphed the recurrence and the upper bound and they seem to both converge on $\sqrt2$.
Also, if you ignore the boundary condition $A_0 = 2$ then you find that $\sqrt2$ is a solution to the main part of the recurrence. i.e. $\sqrt2 = \sqrt2/2 + 1/\sqrt2$.
The chapter and videos on recurrences have a lot to say about a kind of cookbook solution to divide and conquer recurrences which they call the Akra-Bazzi Theorem. But this recurrence does not seem to be in the right form for that theorem. If it were in the form $A_{n+1} = A_n/2 + g(n)$ then the theorem would give you an asymptotic bound. But $1/A_n$ is not a simple function of $n$ like a polynomial. Instead it is part of the recurrence.
Also, the chapter has a variety of things to say about how to guess the right solution and plug it into an inductive proof, but I haven't had much success. I have tried possible solutions of various forms like $a_n = \sqrt2+a/b^n$ and tried solving for the constants $a$ and $b$ but to no avail.
So, if someone can point me in the right direction that would be great. I always assume that the problem sets are based on something taught in the videos and in the text of the book but I am having trouble tracking this one down.
Bobby
We show by induction that $$\sqrt{2}\lt A_n\le \sqrt{2}+\frac{1}{2^n}.\tag{1}$$ Suppose the result holds at $n=k$. We show the result holds at $n=k+1$. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9763105259435195,
"lm_q1q2_score": 0.8566898254537173,
"lm_q2_score": 0.8774767890838837,
"openwebmath_perplexity": 119.9180937019314,
"openwebmath_score": 0.9323938488960266,
"tags": null,
"url": "https://math.stackexchange.com/questions/1802813/prove-upper-bound-for-recurrence"
} |
For the inequality on the right of (1), we need to show that $$\frac{A_k}{2}+\frac{1}{A_k}\le \sqrt{2}+\frac{1}{2^{k+1}}.$$ By the induction hypothesis, we have $$\frac{A_k}{2}+\frac{1}{A_k}\le \frac{\sqrt{2}}{2}+\frac{1}{2^{k+1}}+\frac{1}{\sqrt{2}}=\sqrt{2}+\frac{1}{2^{k+1}},$$ which takes care of the induction step for the inequality on the right of (1).
We still need to show that $\sqrt{2}\lt A_{k+1}$. Let $A_k=\sqrt{2}+\epsilon$, where $\epsilon$ is positive. Then $$A_{k+1}=\frac{\sqrt{2}+\epsilon}{2}+\frac{1}{\sqrt{2}+\epsilon}=\frac{4+2\sqrt{2}\epsilon+\epsilon^2}{2(\sqrt{2}+\epsilon)}\gt \frac{4+2\sqrt{2}\epsilon}{2(\sqrt{2}+\epsilon)}=\sqrt{2}.$$ This completes the induction step for the inequality on the left of (1).
Remark: The inequality (1) and squeezing show that $A_n$ indeed has limit $\sqrt{2}$.
• It didn't occur to me to prove that $A_n \ge \sqrt2$ and then substitute $\sqrt2$ in the $1/A_n$ term. Much easier that way. Thanks. – Bobby Durrett May 28 '16 at 2:36
• @BobbyDurrett: You are welcome. The inequality $A_n\gt \sqrt{2}$ is not mentioned explicitly in what you are asked to show, but when one tries to push the induction through, it becomes clear that it is necessary for the proof. – André Nicolas May 28 '16 at 2:40
• Nice induction for the $>\sqrt{2}$ part. I didn't manage it immediately, that's why I showed it studying the map $x\mapsto \frac{x}2+\frac{1}{x}$. – Daniel Robert-Nicoud May 28 '16 at 11:09
Let $$B_k = \frac{A_k}{\sqrt{2}}$$ Then $B_0 = \sqrt{2}$ and $$B_{n+1} = \frac12\left(B_n+\frac{1}{B_n} \right)$$ Thus $b_n$ is the $n$-th guess if you perform Newton's algorithm to try to find $\sqrt{1}$ starting with a guess of $\sqrt{2}$. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9763105259435195,
"lm_q1q2_score": 0.8566898254537173,
"lm_q2_score": 0.8774767890838837,
"openwebmath_perplexity": 119.9180937019314,
"openwebmath_score": 0.9323938488960266,
"tags": null,
"url": "https://math.stackexchange.com/questions/1802813/prove-upper-bound-for-recurrence"
} |
This recursion can be solved in closed form using the formula for the hyperbolic tangent of $2x$ in terms of $\tanh x$: $$\tanh(2x) = \frac{2 \tanh x}{1+\tanh^2{x}}$$ . The result looks something like $$B_n = \tanh\left( 2^n \theta\right)$$ where $\theta = \tanh^{-1} B_0$; the answer I have given is off in that every other term needs to be the reciprocal of what I wrote, but the general idea will work.
Once you have that, you can know exactly what $B_n$ is and prove the relation; or better yet, use the error analysis for Newton's method to get an estimate of how close to 1 you would be.
We want to apply induction, but we need also a lower bound on $A_n$ for the $\frac{1}{n}$ term. We can show that $A_n\ge\sqrt{2}$ as follows:
Let $f(x) = \frac{x}{2} + \frac{1}{x}$. Then $f'(x) = \frac{1}{2} - \frac{1}{x^2}$ which has a zero at $x = \sqrt{2}$ where $f(\sqrt{2}) = \sqrt{2}$, and is positive for $x>\sqrt{2}$. This shows that $f(x)\ge\sqrt{2}$ whenever $x\ge\sqrt{2}$, and as $A_{n+1} = f(A_n)$, we have that $A_n\ge\sqrt{2}$ for all $n\ge0$.
Then to conclude:
The case $n=0$ is trivially true.
For $n\ge0$ we have that $$A_{n+1} = \frac{A_n}{2} + \frac{1}{A_n}.$$ By induction hypothesis and what we have shown above, this has as upper bound $$A_{n+1}\le \frac{\sqrt{2} + 2^{-n-1}}{2} + \frac{1}{\sqrt{2}} = \sqrt{2} + 2^{-n-1}.$$
Three steps: Use the definition of $A_n$ and algebra to establish that $$A_{n+1}-\sqrt 2 = {(A_n-\sqrt 2)^2\over 2A_n}.\tag1$$ Next, use (1) to prove by induction that $$A_n\ge\sqrt 2\ \text{for every n.}\tag2$$ Finally, use (1) and (2) to prove by induction that $$A_n-\sqrt2 \le \frac1{2^{n}}\ \text{for every n.}\tag2$$
Your sequence is $$A_{n+1} = \frac{1}{2} A_n + \frac{1}{A_n}$$ where the last term features a division which reminds of the Newton-Raphson iteration. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9763105259435195,
"lm_q1q2_score": 0.8566898254537173,
"lm_q2_score": 0.8774767890838837,
"openwebmath_perplexity": 119.9180937019314,
"openwebmath_score": 0.9323938488960266,
"tags": null,
"url": "https://math.stackexchange.com/questions/1802813/prove-upper-bound-for-recurrence"
} |
Newton Raphson iteration takes the root of the tangent as next step for estimating a root of $f$: $$0 = T'(x_{n+1}) = f(x_n) + f'(x_n) (x_{n+1} - x_n) \iff \\ x_{n+1} = x_n - \frac{f(x_n)}{f'(x_n)}$$ by comparison we have $$-\frac{1}{2}A_n + \frac{1}{A_n} = - \frac{A_n^2-2}{2A_n} = - \frac{f(A_n)}{f'(A_n)}$$ and see $f(x) = x^2 - 2$, the function used to iterate against the root $\sqrt{2}$. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9763105259435195,
"lm_q1q2_score": 0.8566898254537173,
"lm_q2_score": 0.8774767890838837,
"openwebmath_perplexity": 119.9180937019314,
"openwebmath_score": 0.9323938488960266,
"tags": null,
"url": "https://math.stackexchange.com/questions/1802813/prove-upper-bound-for-recurrence"
} |
# Finding the domain and range of a composite function
So I have two functions. $$f(x) = e^{-x^2+1}$$ and $$g(x)=\sqrt{x^2-4x+3}$$. I am then asked to determine the domain and range of
$$a)f∘g,$$
$$b)g∘f$$
I already did part $$a)$$ and the domain for part $$b)$$.
For part $$a)$$, the domain was $$(-\infty,1)\cup(3,\infty)$$ and the range was $$(0,e^2)$$.
For part $$b$$, I figured out that the domain was $$(-\infty,-1]\cup[1,\infty)$$. I am not sure how to find the range though. Normally, I would take the inverse of g∘f and find the domain of that, and although I can do it, I don't think I did it correctly.
Currently, I did figure out that $$g∘f$$ is $$\sqrt{e^{-2x^2+2}-4e^{-x^2+1}+3}$$. How do I find the range of this mess though? I attempted to take the inverse which I believe is:
$$y=\pm\sqrt{1-\ln(2\pm\sqrt{1+y^2})}$$
Although I know that Wolfram Alpha is not the arbitrator of what correct is, it's generally been right and my answer disagrees with what Wolfram alpha has obtained (As seen here). In addition, the range is something that I am not sure how Wolfram obtained (As seen here). This also looks REALLY messy.
Can anyone guide me as to how this was obtained? That would be much appreciated! | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9763105266327962,
"lm_q1q2_score": 0.8566898166739935,
"lm_q2_score": 0.8774767794716264,
"openwebmath_perplexity": 92.38849530302848,
"openwebmath_score": 0.9344687461853027,
"tags": null,
"url": "https://math.stackexchange.com/questions/3352629/finding-the-domain-and-range-of-a-composite-function"
} |
Can anyone guide me as to how this was obtained? That would be much appreciated!
• I see how you got $(-\infty,1)\cup(3,\infty)$ (except maybe the choice of open/closed) but not how you got $e^2.$ When you were computing the range, did you forget the gap in the domain? I think that part is easier to solve if you do not work out the formula for $f\circ g.$ – David K Sep 11 '19 at 11:58
• I took the inverse of the function and found the domain of that to get the range. – Future Math person Sep 11 '19 at 18:23
• That seems like an unnecessarily difficult way to do it. Also error-prone, since (I think) it gives the wrong answer. What value of $x$ satisfies $f(g(x))=e^{3/2},$ for example? – David K Sep 11 '19 at 18:42
• Really? I didn't think it was too bad. I ended up getting $f(g(x))=-2 \pm \sqrt{2-\ln(x)}$. This would mean $2-\ln(x) \geq 0$ and thus $e^2 \geq x$ – Future Math person Sep 11 '19 at 18:44
• Also I get $g(1)=g(3)=0,$ and $0$ is in the domain of $f,$ so I would not exclude $1$ and $3$ from the domain in part a). I think you may need to be a lot more careful about checking what happens at your boundaries. (This is relevant to the range as well.) – David K Sep 11 '19 at 18:47
To find the range you want, namely of $$g(f(x))=F(x),$$ note that $$F(x)$$ is never negative. Also, it is defined and continuous at all real $$x.$$ Then it is an even function of $$x.$$ Thus, it suffices to consider only the range for positive $$x,$$ say. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9763105266327962,
"lm_q1q2_score": 0.8566898166739935,
"lm_q2_score": 0.8774767794716264,
"openwebmath_perplexity": 92.38849530302848,
"openwebmath_score": 0.9344687461853027,
"tags": null,
"url": "https://math.stackexchange.com/questions/3352629/finding-the-domain-and-range-of-a-composite-function"
} |
Note that $$F(0)>0.$$ Also, as $$x\to +\infty,$$ we have $$F(x)\to \sqrt 3.$$ Thus, the range is at least $$[F(0),\sqrt 3),$$ by IVT. It only remains to see if the function attains $$\sqrt 3$$ at any point, or if it ever falls below $$F(0).$$ The first is easily answered in the negative (set $$F(x)=\sqrt 3$$ to deduce a contradiction), so the range is half-open. So does the function ever go below $$e^2-4e+3$$? In particular we may ask whether the function ever attains the minimum possible here, namely $$0.$$ Thus, setting $$F(x)=0,$$ we see that we want to see if there are real solutions to the quadratic equation $$p^2-4p+3=0,$$ where $$p=e^{-x^2+1}.$$ This has solutions. In particular, we get that $$e^{-x^2+1}=1,$$ or in other words that $$-x^2+1=0.$$ Thus $$F(x)$$ vanishes in at least two points.
It therefore is the case that the range is $$[0,\sqrt 3).$$
Note that the range of $$f$$ on $$(-\infty,-1]\cup[1,\infty)$$ is $$(0,1]$$. The range of $$g$$ on $$(0,1]$$ is $$[0,\sqrt{3})$$.
Let $$f,g$$ be given by $$\begin{cases} f(x)=e^{1-x^2}\\[4pt] g(x)=\sqrt{x^2-4x+3}\\ \end{cases}$$ $$\bullet\;\,$$Part $$(\mathbf{a}){\,:}\;\,$$Find the domain and range of $$f\circ g$$.
Since the domain of $$f$$ is $$\mathbb{R}$$, the domain of $$f\circ g$$ is the same as the domain of $$g$$.
Hence the domain of $$f\circ g$$ is $$(-\infty,1]\cup [3,\infty)$$.
Since $$f$$ is an even function, the range of $$f$$ is the same as the range of $$f$$ on the restricted domain $$[0,\infty)$$.
On the interval $$[0,\infty)$$, $$f$$ is strictly decreasing, and $$f$$ approaches zero from above as $$x$$ approaches infinity.
Since $$f$$ is continuous, it follows that the range of $$f$$ is $$(0,e]$$.
For $$x\ge 3$$, $$g$$ realizes all values in $$[0,\infty)$$, so the range of $$f\circ g$$ is the same as the range of $$f$$.
Hence the range of $$f\circ g$$ is $$(0,e]$$.
$$\bullet\;\,$$Part $$(\mathbf{b}){\,:}\;\,$$Find the domain and range of $$g\circ f$$. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9763105266327962,
"lm_q1q2_score": 0.8566898166739935,
"lm_q2_score": 0.8774767794716264,
"openwebmath_perplexity": 92.38849530302848,
"openwebmath_score": 0.9344687461853027,
"tags": null,
"url": "https://math.stackexchange.com/questions/3352629/finding-the-domain-and-range-of-a-composite-function"
} |
$$\bullet\;\,$$Part $$(\mathbf{b}){\,:}\;\,$$Find the domain and range of $$g\circ f$$.
The domain of $$g\circ f$$ is the set of all real $$x$$ such that $$f(x)$$ is in the domain of $$g$$, which is the set of all real $$x$$ such that $$f(x)\le 1$$ or $$f(x)\ge 3$$.
But we can't have $$f(x)\ge 3$$, since the maximum value of $$f$$ is $$e$$.
For the condition $$f(x)\le 1$$, we get $$f(x)\le1\iff e^{1-x^2}\le 1\iff 1-x^2\le 0\iff |x| \ge 1$$ hence the domain of $$g\circ f$$ is $$(-\infty,-1]\cup [1,\infty)$$.
Restricted to the domain $$(-\infty,-1]\cup [1,\infty)$$, the range of $$f$$ is $$(0,1]$$, hence the range of $$g\circ f$$ is the range of $$g$$ on the restricted domain $$(0,1]$$.
It follows that the range of $$g\circ f$$ is $$[0,\sqrt{3})$$.
$$\bullet\;\,$$To summarize the results:
• The domain of $$f\circ g$$ is:$$\;\,(-\infty,1]\cup [3,\infty)$$.
• The range of $$f\circ g$$ is:$$\;\,(0,e]$$.$$\\[6pt]$$
• The domain of $$g\circ f$$ is:$$\;\,(-\infty,-1]\cup [1,\infty)$$.
• The range of $$g\circ f$$ is:$$\;\,[0,\sqrt{3})$$. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9763105266327962,
"lm_q1q2_score": 0.8566898166739935,
"lm_q2_score": 0.8774767794716264,
"openwebmath_perplexity": 92.38849530302848,
"openwebmath_score": 0.9344687461853027,
"tags": null,
"url": "https://math.stackexchange.com/questions/3352629/finding-the-domain-and-range-of-a-composite-function"
} |
Eigenvalue Inequalities for Hermitian Matrices
The eigenvalues of Hermitian matrices satisfy a wide variety of inequalities. We present some of the most useful and explain their implications. Proofs are omitted, but as Parlett (1998) notes, the proofs of the Courant–Fischer, Weyl, and Cauchy results are all consequences of the elementary fact that if the sum of the dimensions of two subspaces of $\mathbb{C}^n$ exceeds $n$ then the subspaces have a nontrivial intersection.
The eigenvalues of a Hermitian matrix $A\in\mathbb{C}^{n\times n}$ are real and we order them $\lambda_n\le \lambda_{n-1} \le \cdots \le \lambda_1$. Note that in some references, such as Horn and Johnson (2013), the reverse ordering is used, with $\lambda_n$ the largest eigenvalue. When it is necessary to specify what matrix $\lambda_k$ is an eigenvalue of we write $\lambda_k(A)$: the $k$th largest eigenvalue of $A$. All the following results also hold for symmetric matrices over $\mathbb{R}^{n\times n}$.
The function $f(x) = x^*Ax/x^*x$ is the quadratic form $x^*Ax$ for $A$ evaluated on the unit sphere, since $f(x) = f(x/\|x\|_2)$. As $A$ is Hermitian it has a spectral decomposition $A = Q\Lambda Q^*$, where $Q$ is unitary and $\Lambda = \mathrm{diag}(\lambda_i)$. Then
$f(x) = \displaystyle\frac{x^*Q\Lambda Q^*x}{x^*x} = \displaystyle\frac{y^*\Lambda y}{y^*y} = \displaystyle\frac{\sum_{i=1}^{n}\lambda_i y_i^2} {\sum_{i=1}^{n}y_i^2} \quad (y = Q^*x),$
from which is it clear that
$\notag \lambda_n = \displaystyle\min_{x\ne0} \displaystyle\frac{x^*Ax}{x^*x}, \quad \lambda_1 = \displaystyle\max_{x\ne0} \displaystyle\frac{x^*Ax}{x^*x}, \qquad(*)$
with equality when $x$ is an eigenvector corresponding to $\lambda_n$ and $\lambda_1$, respectively, This characterization of the extremal eigenvalues of $A$ as the extrema of $f$ is due to Lord Rayleigh (John William Strutt), and $f(x)$ is called a Rayleigh quotient. The intermediate eigenvalues correspond to saddle points of $f$. | {
"domain": "nhigham.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9943580928375232,
"lm_q1q2_score": 0.8566774873014341,
"lm_q2_score": 0.8615382058759129,
"openwebmath_perplexity": 324.5997061624111,
"openwebmath_score": 0.9866310358047485,
"tags": null,
"url": "https://nhigham.com/2021/03/09/eigenvalue-inequalities-for-hermitian-matrices/?replytocom=25185"
} |
Courant–Fischer Theorem
The Courant–Fischer theorem (1905) states that every eigenvalue of a Hermitian matrix $A\in\mathbb{C}^{n\times n}$ is the solution of both a min-max problem and a max-min problem over suitable subspaces of $\mathbb{C}^n$.
Theorem (Courant–Fischer).
For a Hermitian $A\in\mathbb{C}^{n\times n}$,
\notag \begin{aligned} \lambda_k &= \min_{\dim(S)=n-k+1} \, \max_{0\ne x\in S} \frac{x^*Ax}{x^*x}\\ &= \max_{\dim(S)= k} \, \min_{0\ne x\in S} \frac{x^*Ax}{x^*x}, \quad k=1\colon n. \end{aligned}
Note that the equalities $(*)$ are special cases of these characterizations.
In general there is no useful formula for the eigenvalues of a sum $A+B$ of Hermitian matrices. However, the Courant–Fischer theorem yields the upper and lower bounds
$\notag \lambda_k(A) + \lambda_n(B) \le \lambda_k(A+B) \le \lambda_k(A) + \lambda_1(B), \qquad (1)$
from which it follows that
$\notag \max_k|\lambda_k(A+B)-\lambda_k(A)| \le \max(|\lambda_n(B)|,|\lambda_1(B)|) = \|B\|_2.$
This inequality shows that the eigenvalues of a Hermitian matrix are well conditioned under perturbation. We can rewrite the inequality in the symmetric form
$\notag \max_k |\lambda_k(A)-\lambda_k(B)| \le \|A-B\|_2.$
If $B$ is positive semidefinite then (1) gives
$\notag \lambda_k(A) \le \lambda_k(A + B), \quad k = 1\colon n, \qquad (2)$
while if $B$ is positive definite then strict inequality holds for all $i$. These bounds are known as the Weyl monotonicity theorem.
Weyl’s Inequalities
Weyl’s inequalities (1912) bound the eigenvalues of $A+B$ in terms of those of $A$ and $B$.
Theorem (Weyl).
For Hermitian $A,B\in\mathbb{C}^{n\times n}$ and $i,j = 1\colon n$,
\notag \begin{aligned} \lambda_{i+j-1}(A+B) &\le \lambda_i(A) + \lambda_j(B), \quad i+j \le n+1, \qquad (3)\\ \lambda_i(A) + \lambda_j(B) &\le \lambda_{i+j-n}(A+B). \quad i+j \ge n+1, \qquad (4) \end{aligned} | {
"domain": "nhigham.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9943580928375232,
"lm_q1q2_score": 0.8566774873014341,
"lm_q2_score": 0.8615382058759129,
"openwebmath_perplexity": 324.5997061624111,
"openwebmath_score": 0.9866310358047485,
"tags": null,
"url": "https://nhigham.com/2021/03/09/eigenvalue-inequalities-for-hermitian-matrices/?replytocom=25185"
} |
The Weyl inequalities yield much information about the effect of low rank perturbations. Consider a positive semidefinite rank-$1$ perturbation $B = zz^*$. Inequality (3) with $j = 1$ gives
$\notag \lambda_i(A+B) \le \lambda_i(A) + z^*z, \quad i = 1\colon n$
(which also follows from (1)). Inequality (3) with $j = 2$, combined with (2), gives
$\notag \lambda_{i+1}(A) \le \lambda_{i+1}(A + zz^*) \le \lambda_i(A), \quad i = 1\colon n-1. \qquad (5)$
These inequalities confine each eigenvalue of $A + zz^*$ to the interval between two adjacent eigenvalues of $A$; the eigenvalues of $A + zz^*$ are said to interlace those of $A$. The following figure illustrates the case $n = 4$, showing a possible configuration of the eigenvalues $\lambda_i$ of $A$ and $\mu_i$ of $A + zz^*$.
A specific example, in MATLAB, is
>> n = 4; eig_orig = 5:5+n-1
>> D = diag(eig_orig); eig_pert = eig(D + ones(n))'
eig_orig =
5 6 7 8
eig_pert =
5.2961e+00 6.3923e+00 7.5077e+00 1.0804e+01
Since $\mathrm{trace}(A + zz^*) = \mathrm{trace}(A) + z^*z$ and the trace is the sum of the eigenvalues, we can write
$\notag \lambda_i(A + zz^*) = \lambda_i(A) + \theta_i z^*z,$
where the $\theta_i$ are nonnegative and sum to $1$. If we greatly increase $z^*z$, the norm of the perturbation, then most of the increase in the eigenvalues is concentrated in the largest, since (5) bounds how much the smaller eigenvalues can change:
>> eig_pert = eig(D + 100*ones(n))'
eig_pert =
5.3810e+00 6.4989e+00 7.6170e+00 4.0650e+02
More generally, if $B$ has $p$ positive eigenvalues and $q$ negative eigenvalues then (3) with $j = p+1$ gives
$\notag \lambda_{i+p}(A+B) \le \lambda_i(A), \quad i = 1\colon n-p,$
while (4) with $j = n-q$ gives
$\notag \lambda_i(A) \le \lambda_{i-q}(A + B), \quad i = q+1\colon n.$
So the inertia of $B$ (the number of negative, zero, and positive eigenvalues) determines how far the eigenvalues can move as measured relative to the indexes of the eigenvalues of $A$. | {
"domain": "nhigham.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9943580928375232,
"lm_q1q2_score": 0.8566774873014341,
"lm_q2_score": 0.8615382058759129,
"openwebmath_perplexity": 324.5997061624111,
"openwebmath_score": 0.9866310358047485,
"tags": null,
"url": "https://nhigham.com/2021/03/09/eigenvalue-inequalities-for-hermitian-matrices/?replytocom=25185"
} |
An important implication of the last two inequalities is for the case $A = I$, for which we have
\notag \begin{aligned} \lambda_{i+p}(I+B) &\le 1, \quad i = 1 \colon n-p, \\ \lambda_{i-q}(I+B) &\ge 1, \quad i = q+1 \colon n. \end{aligned}
Exactly $p+q$ eigenvalues appear in one of these inequalities and $n-(p+q)$ appear in both. Therefore $n - (p+q)$ of the eigenvalues are equal to $1$ and so only $\mathrm{rank}(B) = p+q$ eigenvalues can differ from $1$. So perturbing the identity matrix by a Hermitian matrix of rank $r$ changes at most $r$ of the eigenvalues. (In fact, it changes exactly $r$ eigenvalues, as can be seen from a spectral decomposition.)
Finally, if $B$ has rank $r$ then $\lambda_{r+1}(B) \le 0$ and $\lambda_{n-r}(B) \ge 0$ and so taking $j = r+1$ in (3) and $j = n-r$ in (4) gives
\notag \begin{aligned} \lambda_{i+r}(A+B) &\le \lambda_i(A), ~~\qquad\qquad i = 1\colon n-r, \\ \lambda_i(A) &\le \lambda_{i-r}(A + B), ~~\quad i = r+1\colon n. \end{aligned}
Cauchy Interlace Theorem
The Cauchy interlace theorem relates the eigenvalues of successive leading principal submatrices of a Hermitian matrix. We denote the leading principal submatrix of $A$ of order $k$ by $A_k = A(1\colon k, 1\colon k)$.
Theorem (Cauchy).
For a Hermitian $A\in\mathbb{C}^{n\times n}$,
$\notag \lambda_{i+1}(A_{k+1}) \le \lambda_i(A_k) \le \lambda_i(A_{k+1}), \quad i = 1\colon k, \quad k=1\colon n-1.$
The theorem says that the eigenvalues of $A_k$ interlace those of $A_{k+1}$ for all $k$. Two immediate implications are that (a) if $A$ is Hermitian positive definite then so are all its leading principal submatrices and (b) appending a row and a column to a Hermitian matrix does not decrease the largest eigenvalue or increase the smallest eigenvalue. | {
"domain": "nhigham.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9943580928375232,
"lm_q1q2_score": 0.8566774873014341,
"lm_q2_score": 0.8615382058759129,
"openwebmath_perplexity": 324.5997061624111,
"openwebmath_score": 0.9866310358047485,
"tags": null,
"url": "https://nhigham.com/2021/03/09/eigenvalue-inequalities-for-hermitian-matrices/?replytocom=25185"
} |
Since eigenvalues are unchanged under symmetric permutations of the matrix, the theorem can be reformulated to say that the eigenvalues of any principal submatrix of order $n-1$ interlace those of $A$. A generalization to principal submatrices of order $n-\ell$ is given in the next result.
Theorem.
If $B$ is a principal submatrix of order $n-\ell$ of a Hermitian $A\in\mathbb{C}^{n\times n}$ then
$\notag \lambda_{i+\ell}(A) \le \lambda_i(B) \le \lambda_i(A), \quad i=1\colon n-\ell.$
Majorization Results
It follows by taking $x$ to be a unit vector $e_i$ in the formula $\lambda_1 = \max_{x\ne0} x^*Ax/(x^*x)$ that $\lambda_1 \ge a_{ii}$ for all $i$. And of course the trace of $A$ is the sum of the eigenvalues: $\sum_{i=1}^n a_{ii} = \sum_{i=1}^n \lambda_i$. These relations are the first and last in a sequence of inequalities relating sums of eigenvalues to sums of diagonal elements obtained by Schur in 1923.
Theorem (Schur).
For a Hermitian $A\in\mathbb{C}^{n\times n}$,
$\notag \displaystyle\sum_{i=1}^k \lambda_i \ge \displaystyle\sum_{i=1}^k \widetilde{a}_{ii}, \quad k=1\colon n,$
where $\{\widetilde{a}_{ii}\}$ is the set of diagonal elements of $A$ arranged in decreasing order: $\widetilde{a}_{11} \ge \cdots \ge \widetilde{a}_{nn}$.
These inequalities say that the vector $[\lambda_1,\dots,\lambda_n]$ of eigenvalues majorizes the ordered vector $[\widetilde{a}_{11},\dots,\widetilde{a}_{nn}]$ of diagonal elements.
An interesting special case is a correlation matrix, a symmetric positive semidefinite matrix with unit diagonal, for which the inequalities are
$\notag \lambda_1 \ge 1, \quad \lambda_1+ \lambda_2\ge 2, \quad \dots, \quad \lambda_1+ \lambda_2 + \cdots + \lambda_{n-1} \ge n-1,$
and $\lambda_1+ \lambda_2 + \cdots + \lambda_n = n$. Here is an illustration in MATLAB. | {
"domain": "nhigham.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9943580928375232,
"lm_q1q2_score": 0.8566774873014341,
"lm_q2_score": 0.8615382058759129,
"openwebmath_perplexity": 324.5997061624111,
"openwebmath_score": 0.9866310358047485,
"tags": null,
"url": "https://nhigham.com/2021/03/09/eigenvalue-inequalities-for-hermitian-matrices/?replytocom=25185"
} |
and $\lambda_1+ \lambda_2 + \cdots + \lambda_n = n$. Here is an illustration in MATLAB.
>> n = 5; rng(1); A = gallery('randcorr',n);
>> e = sort(eig(A)','descend'), partial_sums = cumsum(e)
e =
2.2701e+00 1.3142e+00 9.5280e-01 4.6250e-01 3.6045e-04
partial_sums =
2.2701e+00 3.5843e+00 4.5371e+00 4.9996e+00 5.0000e+00
Ky Fan (1949) proved a majorization relation between the eigenvalues of $A$, $B$, and $A+B$:
$\notag \displaystyle\sum_{i=1}^k \lambda_i(A+B) \le \displaystyle\sum_{i=1}^k \lambda_i(A) + \displaystyle\sum_{i=1}^k \lambda_i(B), \quad k = 1\colon n.$
For $k = 1$, the inequality is the same as the upper bound of (1), and for $k = n$ it is an equality: $\mathrm{trace}(A+B) = \mathrm{trace}(A) + \mathrm{trace}(B)$.
Ostrowski’s Theorem
For a Hermitian $A$ and a nonsingular $X$, the transformation $A\to X^*AX$ is a congruence transformation. Sylvester’s law of inertia says that congruence transformations preserve the inertia. A result of Ostrowski (1959) goes further by providing bounds on the ratios of the eigenvalues of the original and transformed matrices.
Theorem (Ostrowski).
For a Hermitian $A\in \mathbb{C}^{n\times n}$ and $X\in\mathbb{C}^{n\times n}$,
$\lambda_k(X^*AX) = \theta_k \lambda_k(A), \quad k=1\colon n,$
where $\lambda_n(X^*X) \le \theta_k \le \lambda_1(X^*X)$.
If $X$ is unitary then $X^*X = I$ and so Ostrowski’s theorem reduces to the fact that a congruence with a unitary matrix is a similarity transformation and so preserves eigenvalues. The theorem shows that the further $X$ is from being unitary the greater the potential change in the eigenvalues.
Ostrowski’s theorem can be generalized to the situation where $X$ is rectangular (Higham and Cheng, 1998).
Interrelations
The results we have described are strongly interrelated. For example, the Courant–Fischer theorem and the Cauchy interlacing theorem can be derived from each other, and Ostrowski’s theorem can be proved using the Courant–Fischer Theorem. | {
"domain": "nhigham.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9943580928375232,
"lm_q1q2_score": 0.8566774873014341,
"lm_q2_score": 0.8615382058759129,
"openwebmath_perplexity": 324.5997061624111,
"openwebmath_score": 0.9866310358047485,
"tags": null,
"url": "https://nhigham.com/2021/03/09/eigenvalue-inequalities-for-hermitian-matrices/?replytocom=25185"
} |
2 thoughts on “Eigenvalue Inequalities for Hermitian Matrices”
1. Daniel Kressner says:
This is a very nice overview; thanks! Tangential to what Parlett is stating, most if not even all of these results can be concluded from the Eckart–Young–Mirsky theorem in the spectral norm. | {
"domain": "nhigham.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9943580928375232,
"lm_q1q2_score": 0.8566774873014341,
"lm_q2_score": 0.8615382058759129,
"openwebmath_perplexity": 324.5997061624111,
"openwebmath_score": 0.9866310358047485,
"tags": null,
"url": "https://nhigham.com/2021/03/09/eigenvalue-inequalities-for-hermitian-matrices/?replytocom=25185"
} |
# The Comparison Test for Series
I'm doing a homework problem - it asks us to show whether the series: $$\sum_{n=1}^{\infty}\frac{n^n}{n!}$$ converges or diverges. I looked at a graph of the sequence component $\big(\frac{n^n}{n!} \big)$ and saw it continued to increase. I then considered the sequence: $$\sum_{n=1}^{\infty}\frac{1}{n}$$ which diverges by the P test.
But, $$\frac{1}{n}\leq \frac{n^n}{n!},~ \forall~n\geq1$$ which would then mean that the first series I showed diverges by the comparison test.
My problem is that this seems too simple? Can I compare one series to any series or does the comparison series have to meet some certain requirements (besides those I've addressed).
Cheers.
• Looks fine to me. – Jacky Chong Oct 12 '16 at 6:15
• You could also do comparison test with the divergent series $\sum_{n=1}^\infty 1$. – angryavian Oct 12 '16 at 6:16
• That seems so simple, so I do not need to compare a series with changing exponents and factorials to a similar one? – Wharf Rat Oct 12 '16 at 6:17
• Is the necessary condition for convergence ($n^n/n!\to 0$) satisfied here? – A.Γ. Oct 12 '16 at 6:20
Your reasoning is fine. In fact, this can be shown to diverge with the simplest / most intuitive test there is: If $\ \displaystyle \sum_{n=1}^\infty a_n$ is a convergent series, it is a necessary condition that $\displaystyle \lim_{n \rightarrow \infty} a_n = 0$. In this scenario, $n^n \geq n!$ for all $n \geq 1$, implying $\displaystyle \frac{n^n}{n!} \geq 1$ for all such $n$, so this necessary condition does not hold. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9744347853343059,
"lm_q1q2_score": 0.8566711993891934,
"lm_q2_score": 0.8791467754256017,
"openwebmath_perplexity": 237.42679524359943,
"openwebmath_score": 0.915158212184906,
"tags": null,
"url": "https://math.stackexchange.com/questions/1964876/the-comparison-test-for-series"
} |
I looked at a graph of the sequence component $\big(\frac{n^n}{n!} \big)$ and saw it continued to increase.
If there series converges then $n^n/n! \to 0$, but if you use Stirling's approximation: $n! \approx \sqrt{2\pi n} \cdot \left(\frac{n}{e}\right)^n$
$$\lim_{n} \frac{n^n}{n!} = \lim_n \frac{n^n}{\sqrt{2 \pi n} \cdot\dfrac{n^n}{e^n}} = \lim_n \frac{e^n}{\sqrt{2 \pi n}} = \frac{1}{\sqrt{2\pi}} \lim_n \frac{e^n}{\sqrt{n}} = \frac{1}{\sqrt{2\pi }} \lim_n \left(\frac{e^{2n}}{n}\right)^{\frac{1}{2}} \to \infty$$
• No need for Stirling here, we have $$\frac{n^n}{n!}=\frac{n\cdot n\cdots n}{1\cdot2\cdots(n-1)\cdot n}>\frac{n\cdot 2\cdots n}{1\cdot2\cdots(n-1)\cdot n}=n$$ – AD. Oct 12 '16 at 8:04 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9744347853343059,
"lm_q1q2_score": 0.8566711993891934,
"lm_q2_score": 0.8791467754256017,
"openwebmath_perplexity": 237.42679524359943,
"openwebmath_score": 0.915158212184906,
"tags": null,
"url": "https://math.stackexchange.com/questions/1964876/the-comparison-test-for-series"
} |
# Integrating two equations that equal, what happens to the constant on one of the sides?
In class, we were talking about Newton's 3rd law and how to integrate.
$\int(g)dt = \int(y''(t))dt \implies g(t) + C = y'(t)$
I am confused about why the right hand side of the equation doesn't get a constant. After asking the professor, he said that it was because the two constants would cancel each other out. But I still don't understand why that should prevent us from writing a constant on the right side.
• Recall, you can add constants together into a single constant (as was done with $C$). Also, you can define a $C_1$ and $C_2$ - one to each side. You can also show as being on the RHS of the equation. All will produce the same result. The choice is typically one of convenience to make solving easiest. – Amzoti Jan 16 '14 at 18:13
• As an example, take $y' = x y$. Solve it with a constant on one side after separation and integration. Then, have a constant on each side. What do you notice when you solve for $y$ in both approaches? $y = c e^{x^2/2}$. – Amzoti Jan 16 '14 at 18:21
• I think I understand, thank you! – user121860 Jan 16 '14 at 18:29
• I haven't taken calculus any calculus courses for about two years now and I've forgotten some of the rules, such as combining the constants. The professor told me that when we integrated both constants would be C1, ie. the same, and as such would end up canceling each other out by way of subtraction if we wanted to integrate more. So he wrote C1 on the left hand side, but it seems to make sense if he actually wanted to write C (the inclusion of both constants). – user121860 Jan 16 '14 at 18:33
• Though if you don't mind, examples are always helpful. Thank you for your time and help! – user121860 Jan 16 '14 at 18:33
Recall, you can add constants together into a single constant (as was done with C). | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.974434788304004,
"lm_q1q2_score": 0.8566711912008189,
"lm_q2_score": 0.8791467643431002,
"openwebmath_perplexity": 151.61560638950004,
"openwebmath_score": 0.9255096912384033,
"tags": null,
"url": "https://math.stackexchange.com/questions/640773/integrating-two-equations-that-equal-what-happens-to-the-constant-on-one-of-the"
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.