@KasmirKhaan I flagged this. I mean... he's a doctor. I talk with guys that aren't even undergraduates and they're absurdly intelligent, makes me feel I'll never reach such "intellectual nirvana". Don't be disrespectful; know your place, please.
@Lucas: There's a problem that too much flagging goes on in here. It makes people in the rest of Stack Exchange upset. There's no need to flag. I can handle this fine.
In elementary algebra, the binomial theorem (or binomial expansion) describes the algebraic expansion of powers of a binomial. According to the theorem, it is possible to expand the polynomial (x + y)n into a sum involving terms of the form a xb yc, where the exponents b and c are nonnegative integers with b + c = n, and the coefficient a of each term is a specific positive integer depending on n and b. For example (for n = 4),
(
x
+
y
)
4
=
x
...
Oh, if you haven't done that linear algebra exercise, here it is.
The real derivative of a complex-differentiable function is a scalar times a rotation matrix. That's why holomorphic maps (with nonzero derivative) are conformal.
its also cool that u can see a quadratic form in 2-order curve, do diagonalization on quadratic form and in eigen vector base u can see much clearly wherer curve is hyperbola or smth else
@Jacksoja: That's the standard way of writing the points on the line (segment) ... If you limit $0\le \lambda\le 1$, then you get the segment. Otherwise, you get the entire line. And you can generalize to more points.
Hmm, @Eric's back. I wonder if those 11 1/2 rolling eyes Demonark rolled hit him.
The only thing that's different is that it's special to say that in $\Bbb R^n$ compact sets are closed and bounded. In a general metric space you need to say totally bounded.
@TedShifrin I can't come up with a more elementary proof than the fact that if you wedge the columns two by two then you get positive things, and then since they are 2-forms they commute (supercommutativity), so the overall 2n-form is positive
I would have said it in more old-fashioned language: the determinant of a block matrix can be computed as the determinant of what you get by taking the "determinant" of the block matrix to get a matrix out, and then taking the determinant of that - so long as all of the blocks commute.
Is anybody here a fan of highly non-linear DE's? I have a DE given by $y'' + (1+C_1e^8y) y = C_2 e^8y + C_3 e^2y$ for some constants $C_1,C_2,C_3$. The only progress I've made is solving numerically! Any suggestions?
@MikeMiller @TedShifrin Using the JNF (for complex matrices) we can WLOG assume that the complex matrix is upper triangular (this doesn't change the determinant of the corresponding double-sized matrix because everything can be done on the level of real numbers); then this becomes a block matrix that is upper triangular, hence the determinant is just the product of the determinants of the 2x2 blocks, each of which is positive, qed
and bonus fact is that if $p(z) \in \Bbb C[z]$ is the char poly of $A$ then the char poly of the corresponding double-sized real matrix is $p(z) \overline{p(\overline z)}$
Off topic: By the Spectral theorem (linear algebra), I normal operator can be diagonalizable. Does this imply that a normal operator always has real eigenvalues?
In other words, when one ask if a normal operator $T$ can be diagonalized, are they asking if there exists a field $F$ for which the matrix of $T$ is diagonal, or are they assuming that it holds for any field $F$?
The solution manual to this problem says that f<g for $x>\sqrt3/2$, but i checked on desmos, this is not the case. It is true for f',g' that f'<g' for $x>\sqrt3/2$>
There is a $\psi$ at the end, let me write it in the way they have written - $$-\frac{1}{2m}\big(\hbar^2\frac{d^2}{dx^2}+(m\omega x)^2\big)=\frac{1}{\sqrt{2m}}\big(\frac{\hbar}{i}\frac{d}{dx}+ im\omega x\big)\frac{1}{\sqrt{2m}}\big(\frac{\hbar}{i}\frac{d}{dx}-im\omega x\big)$$
Is there a way to find the minimum number of surface patches required to cover up a smooth manifold. For instance a sphere requires atleast two surface patches (stereographic projections) to cover it completely.
@Albas When you say surface patches, do you mean charts?
The answer will be different depending on whether or not a chart is required to be diffeomorphic to $\Bbb R^n$ or to an open subset thereof.
I'm reasonably certain that in either case, for any $n$-manifold, you should need at most $(n+1)$ charts, and this bound is optimal on $\Bbb{RP}^n$. But I would need to look for references tomorrow, too sleepy now.
This should be closely related to the minimum number of critical points of an arbitrary smooth function, the "cup-length", and the "Lusternik-Schnirrelman category".
The "inscribed angle theorem" is a common 2-dimensional plane geometry fact. It states that for a circle the angle formed between any two points on the circumference with the center is twice the angle formed by those two points with any other point on the circumference. I will not elaborate on a ...
@Silent That's true even if $f$ is not even. Let $x=a+b-u$. Then $dx=-du$, and $\int_a^bf(x)dx=\int_b^af(a+b-u)(-du)$.
Notice that the bounds of integration have changed, from $\int_a^b$ to $\int_b^a$.
Switching them back around gives us another minus sign, so we get${}=-\int_a^bf(a+b-u)(-du)$.
${}=\int_a^bf(a+b-u)du=\int_a^bf(a+b-x)dx$.
Compare this with addition: $\sum_{i=a}^bf(i)=\sum_{i=a}^bf(a+b-i)$, because the former is $f(a)+f(a+1)+\dotsb+f(b)$ and the latter is $f(b)+f(b-1)+\dotsb+f(a)$.
I hate working on my CV for the private sector. Was so much easier in academia where I could just point to my publications. Now I have to find some way to explain why I am great at programming even though I have nothing concrete to show for it.
@TobiasKildetoft I worry about that sometimes. I feel like I should be trying to find coding projects to work on to boost my CV if I move into the private sector
But then I'll end up spending too much time on that
I'll write it up in case anyone would like to have a go. Let $\alpha\geq 0$ and $\delta<1$ be fixed real numbers. Let $f$ be an arithmetic function with $f(n)=O(n^\alpha)$ and $A_f(x)=\sum_{n\leq x}f(n)=O(x^\delta)$. Let $g=f\ast 1$ where $1(n)=1$ for all $n\geq 1$ and $\ast$ is the Dirichlet convolution.
That's the setup.
Prove now that $\sum_{n\leq x}g(n)=cx+O(x^\frac{(1-\delta)(1+\alpha)}{2-\delta})$.
@LeakyNun What do the edges of the square correspond to on the real projective plane? Shouldn't they correspond to two loops on the space, representing the two homotopy classes?
Awesome, Jango just decided to play Kaizers Orchestra (even though they really don't fit into the station I had chosen). Been forever since I listened to them.
I've got a question. Is there a description of the ideals of $\hat{Z} = \prod_{p} \mathbb{Z}_p$? I'm asking because I want a neighborhood basis of the finite adele ring of $\mathbb{Q}$.