In mathematics, the Pincherle derivative T’ of a linear operator T:K[x] → K[x] on the vector space of polynomials in the variable x over a field K is the commutator of T with the multiplication by x in the algebra of endomorphisms End(K[x]). That is, T’ is another linear operator T’:K[x] → K[x]
T
′
:=
[
T
,
x
]
=
T
x
−
x
T
=
−
ad
(
x
)
T
,
{\displaystyle...
@Semiclassical Can I ask you a physics question about potential? As I understand, a potential in the mathematical sense is just a scalar function whose derivative gives a conservative field. From the physics standpoint the potential at a point $x$ gives the work done when moving from the reference point $x_0$ to $x$. I was wondering can the $x_0$ be arbitrarily chosen or does it need to be a certain point like usually one assumes it's infinity?
One is to look for a scalar potential. In that case, you’ll end up finding: if you wind around a wire, then your initial potential won’t be the same as your final potential even if you start and end at the same point
So any scalar potential would have to be a multivalued function, which isn’t fun to deal with
If $X$ is a metric space that isn't totally bounded, how can I show there is an $r > 0$ and a collection of points $\{x_n\}$ such that $ \{B(x_n,r)\}_{n=1}^\infty$ is a collection of pairwise disjoint sets?
@mercio I think if you take any differentiable scalar function you get a conservative field, since one definition of conservativity is "a field $f$ is conservative iff there exists $F$ with $f=\nabla F$". But you could take any non-differentiable scalar function which has no associated conservative field.
The situation is even worse for more general gauge theories :)
But actually, although this "gauge freedom" is a bit annoying for some reasons it gives you an extra degree of freedom to play with, which is for example useful, when trying to show existence of equations involving these "gauge fields".
Sounds really difficult. All I understood is that they need to do a looot of simulations in QCD. Basically most of what they talked about were based on numeric results.
(We know that, if $p$ is a period, then $kp$ is a period for integer $k$. So every periodic function has infinitely many periods. This is strange in that there's no smallest one.)
@AkivaWeinberger I don't know if this is the intended solution, but you can write it as $\cos(x - \frac{\pi}{3}) = \cos(2x)$, and then get solutions $-\frac{5}{9}\pi,-\frac{1}{3}\pi, \frac{1}{9}\pi, \frac{7}{9}\pi$ with a sum of $0$.
@Semiclassical Both. You get a 120+120+120 (so 360, not 300, apparently) physics/chemistry/math package of tests to do in 3 hours, I think, and most of the problems are tediously hard.
At least that's my experience from having a cursory look at the stuff
This seems to be the distribution for the chemistry paper
Here's a better problem (just because I took the trigonometric piss and now I'm spiteful): Me and @Akiva are playing a game, where we are given the polynomial $x^2 + x + 2014$, and Akiva starts the game by increasing or decreasing the coefficient of $x$ by 1, and then I'll increase or decrease the constant coefficient by 1, and we take in turns. The game ends, and Akiva wins, if the polynomial at that instant of time has a integer root.
Which means a losing position for him is if, for both choices of second sign, there is a choice of first sign in $(b\pm1)^2-4(c\pm1)$ making that a square
if $c$ is $2$ mod $4$ then you need $b = 2b'$ with $b'^2-c$ is a square, so $c$ is a difference fo squares but there is no difference of squares that is $2$ mod $4$ like $c$
hey guys, we only had to pick 6 of 9 questions on my analysis final, I didn't pick this one because I didn't know how to do it. but I'm really curious how to do it.
give an example of a function $\mathbb R \to \mathbb R$ that's $L^2$ but not $L^p$ for $p \in [1..\infty]\setminus\{2\}$
I tried to construct something like $x^{-\alpha}\chi_{\{0 < x < 1\}}$ but I couldn't nail down a power that would only work for $p = 2$
@GFauxPas My first guess is that you should think about functions $f: [0,\infty) \to \mathbb{R}$ which are a) $L^2$ but not $L^p$ for $p > 2$ or b) $L^2$ but not $L^p$ for $p < 2$
then flip one and glue them together, to give something that fails for all $p \neq 2$
@AkivaWeinberger @mercio Hmm, I wonder if the problem statement means what it's supposed to mean. What if it means that the game may not end at your move (it doesn't say it out explicitly)? Eg, I may tilt the constant coefficient, to the effect that the polynomial ends up having an integral solution.
@AkivaWeinberger Here's another one I couldn't figure out in a reasonable amount of time. Consider this Collatz-like algorithm: $T(n) = n/2$ if $n$ is even, $T(n) = n+1$ if $n$ is odd. (a) Prove that there is some $k$ such that $T^k(n) = 1$ for all $n$ (b) Denote $c_k = \#\{n \in \Bbb N : T^k(n) = 1\}$. Prove that $c_k$ is a Fibonacci sequence.
Hm, if the binary expansion of $n$ is, read from right-to-left, 0...(a_1 times)...01...(b_1 times)...10...(a_2 times)...01...(b_2 times)...1..., then after $\sum (a_k + b_k) + \ell$ moves, where $\ell$ is length of the binary expansion, I think the algorithm terminates.
Hia, I need to use "if $x \le a$ and $y \le b$ then $\mathrm{min}(x,y) \le \mathrm{min}(a,b)$ as a lemma for another proof, and even though it's quite a trivial claim, I'm not quite sure how I could prove it. Any ideas? :)
the idea was just that for $x<-1$ it fails to be $L^p$ for $p<2$ and on each of the $(n,n+1)$ intervals it fails to be $L^p$ for $p \geq 2 + \frac{1}{n}$