Yea. I was just unsure if that new letter was going to have some other significance. But that is me overthinking things
I've been working on this question off and on usually waiting for your help, so with this part done. I was fiddling with how to express the area of a triangle with my angle measurements, but the ideas I came up with would include introducing new angles.
Writing it out.....actually no, I won't be introducing any new angle variables.
dropping the vertical down from an included angle would give me $\frac{\theta}{2}, \frac{\pi}{2}$ and $\frac{\pi}{2} - \theta$
ahhhhh victory.
So I can write "base" and "height" in terms of $\theta$ and $\gamma$
Wait. You’re fooling yourself again. If the triangle isn’t isosceles, the height doesn’t bisect the included angle. This is very standard. Don’t mess with the angle. Use one of your known sides as the base.
@SineoftheTime in the same boat. I never perform well in language exams, I can just barely manage to pass by studying all night. Mathematics is much easier to get a nice grade for
@TedShifrin which parts wasn't intuitive? I'll edit it and explain more. If you couldn't follow it chances are a large number of readers won't be able to either
First I had to work to see why the original triangle is isosceles. The cyclic quadrilateral stuff was a total leap. I know about them, but I don’t see it and your diagram is cluttered and hard to deal with.
@TedShifrin so you mean the first part where I talk about why $DK$ is equal to $BD$ and $DC$ using the properties of cyclic quadrilaterals. That's unclear right?
Being great at math aside, dealing with extremely inexperienced (for the lack of a better term) students daily must takes an entirely different set of skills
@D.C.theIII I'm sorry if that was a little standoffish or rude. To be fair I'm not great at drawing either, just look at my conversation above with Ted
@ペガサスSeiya I mean I get it, you know what to do, but before you knew how to do it there was a time when you had to be frustrated. Maybe not here, but elsewhere. So keep that in mind when things seem "easy" to you and may cause difficulty for another.
entonation and emotion tend to get lost through text and misinterpretation can happen as a result. So do be mindful. It is all good, I know you didn't mean harm.
i am having trouble understanding why rudin says $B_n$ is the union of a countable set of countable sets... My expectation is that $B_n$ is the union of an at most countable set of countable sets since I am seeing $B_n \sim \bigcup_i A_i$ - something like that
I mean $B_1$ is equivalent A so it is surely a finite union (namely no union?) of countable sets.
That is, I am identifying $B_n$ as the union of sets $A_i$ equivalent to $A$ (that is, countable) where the index $i$ denotes with what $b_i \in B_{n-1}$ the sets $A_i$ are associated with
e.g. $B_2 = A_1 \cup A_2$ where $A_1$ is the set of all 2-tuples $b_1, a \in A \sim A$, making $B_2$ a union of a finite (and therefore not countable) set of countable sets
So I'm not going to be all high and mighty, but I knew this is what you were intimating at, I didn't just jump to it immediately and what is still troubling me now is that I can't see how I would write $a$ in terms of $\theta$. I see how how the height will be written in terms of $\theta$, but not my base
It comes in also with the area of the parallelogram that appears in the magnitude of the cross-product, although I purposely did not do that in the book.
But if you ask most any calc III or physics student, they'll tell you $\|\vec a\times\vec b\| = \|\vec a\| \|\vec b\|\sin\theta$.
I enjoy your geometry questions even though this probably should not have taken as long as it did. My faulty (albeit gradually improving) geometry is what is hindering me
It's irksome, but at least I am at ease having a picture in mind instead of just symbol pushing with no meaning......
@TedShifrin 😭
ok, time to write out an "outline" of the procedure to do it tomorrow, then a late lunch, then finish off a question establishing QR decomposition in linear algebra
QR is good numerically, too. There's an amazing algorithm based on it to numerically find the eigenvalues/eigenvectors of a matrix. You do $QR$, switch to $RQ$ and repeat and repeat ....
Yeah I'm interested in it because I had seen it years ago when I did a linear algebra course, but it wasn't touched upon. Then in my linear regression course one of the graduate texts which was recommended as an accompanying text had the derivation of the least squares estimators. They had one derivation using multivariable calc and then they had the QR Decompostion and mentioned that in practice the QR decomposition is what is used in software.
By the way, you should learn some perspective on geometry. Get Pedoe's wonderful book, Geometry: A Comprehensive Course. Published by Dover and cheap. @Seiya
I always touch on QR because it's the Gram-Schmidt algorithm, which is actually important (as a theoretical tool) in geometry.
I have been meaning to get an accompanying geometry text. Even if I don't read it all the time, something to just constantly read to cement things over time