Let $f : \Bbb{C} \to \Bbb{C}$ be an entire function such that $|f(z_1+z_2)| \le |f(z_1)| + |f(z_2)|$ for every $z_1,z_2 \in \Bbb{C}$. Is it possible to prove that $|f(az)| \le a |f(z)|$ for all $a > 0$ and $z \in \Bbb{C}$?
In calculus, Taylor's theorem gives an approximation of a k-times differentiable function around a given point by a polynomial of degree k, called the kth-order Taylor polynomial. For a smooth function, the Taylor polynomial is the truncation at the order k of the Taylor series of the function. The first-order Taylor polynomial is the linear approximation of the function, and the second-order Taylor polynomial is often referred to as the quadratic approximation. There are several versions of Taylor's theorem, some giving explicit estimates of the approximation error of the function by its Taylor...
Is there a way to show that the structure group G for some vector bundle is not further reducible? Many references I've seen just ascribe the inability to further reduce G to the existence of some topological obstruction, but don't elaborate any further.
For instance, what stops me from assigning an $\{e\}$-structure to the sphere $S^2$?
@robjohn its not exactly that. I want to know that if a function is represented by its taylor series at some neigboorhood B of 0, i can also represent it by its taylor series at different points of B (in some smaller neighboorhood). Or is it the same thing and I'm missing something?
I understand the same series converges, but if say, $F(x) = \sum_{m=0}^\infty \frac{1}{m!} \sum_{|\alpha|=m} \partial^\alpha F(0)x^\alpha$ around $\overline{B}(0,R)$, then $F(x) = \sum_{m=0}^\infty \frac{1}{m!} \sum_{|\alpha|=m} \partial^\alpha F(a)(x-a)^\alpha$ on some $B(a,R_a)$ ($R_a$ taken small enough) ? its that simple?
@gian "not further reducible" sounds like a very intangible statement, I do not know by which methods one could access such a thing (not to say it's impossible). But if often is possible to say that it cannot be reduced to a specific group, because of the presence of certain obstructions.
a vector bundle with trivial structure group is just a trivial vector bundle
though I'm not sure what "putting an $\{e\}$-structure on $S^2$" means, you wanna talk about the bundle, not the base
@SmokenSieEinBitteChebaHitBits confirmation that her ballot in the california gubernatorial recall election had been received and counted by the county.
smoken, very little other than a disgruntled and well funded minority didn't like that a democrat won the last election. california has a somewhat byzantine and nonosensical recall procedure which allows recall for essentially any reason ("wanting a do-over" is good enough) and for a small but highly motivated minority to overturn a majority vote.
it's possible that the governor will be replaced by a guy who receives only a tiny fraction of the votes that the current governor received.
during the last recall one of my dad's friends ran on a lark. there were like a hundred candidates. on the plus side, we did get arnold schwarzenegger.
i wasn't with him on policy (his post-office career has been OK) but i do think it's funny that my phd diploma bears a facsimile of the signature of hercules in new york
it's an interesting conceptual exercise. in general i do wonder if the people most likely to be able to use it profitably (i.e., not get lost in it, understand what was going on) would not need software. if limited to a very specific universe (probably narrower than Z-modules) it might work.
if it's too general you just pull the flywheel on your mouse back and you're staring at categories or something. seems like anticlimax to me.
@Thorgott Let's talk about about a specific case then: the tangent bundle $TS^2$ with base space $S^2$. In several references I've seen that it can be given an $SO(2)$-structure. Why can't we reduce this to $\{e\} \leq SO(2)$?
I will make it and it should be interesting. IDC if people don't "profit" from it. It's for mathematicians to view "how everything is connected" and also to record the structure of this connectedness
i constructed something kind of like this when studying for the bar exam but just in tree form, basically a list of expanadable nested lists of bullet points. it helped that the bar exam was very limited in scope.
That's the github repo of the Quiver Database concept. Videos at the bottom of the page
to see it working. I'm quite certain we will be surfing abstract space waves in the near future. Outer space is too expensive for now, but computer-based abstract space travel is within everyone's reach
you meet $\lim \limits_{\vec x \to \vec 0} \frac{x^2}{\sqrt{x^2 + y^2}}$ in the wild, with $\vec x = \langle x,y \rangle$. as a general guideline, informally, can you treat the expression as if $x$ and $y$ have similar values?
in order to guess more or less what the limit will be before doing the formal proof
treating $x,y$ as having similar values leads you to think of the numerator being smaller than the denominator, suggesting the limit is 0
That list of python files on the right will quadruple in size
I should put them in folders organizationally
@robjohn I have nodes in nodes now. You drag them (copy) with right click and drop them to place, and you simply drag with left button to move items around
It has collision detection too
So those nodes don't ever overlap - they push each other out of the way
for some domain (open+connected) subset $D \subset \mathbb{C}$ is it always possible to find an increasing sequence of compact subsets of $D$, $C_k \uparrow D$, such that each $C_k$ is path-connected and every compact subset of $D$ is contained in some $C_k$?
Thorgott i see, so could the procedure be something like : for $k=1$ consider all points in the closed unit disk that are $ \geq 1$ away from the boundary, take a finite subcover of this , and add more balls to make this subcover path-connected (only finitely many more balls need to be added here), now for $k=2$ consider all points in the closed disk of radius $2$ that are $\geq \frac{1}{2}$ away from the boundary, and repeat
yeah, i mean start with the countable cover, then take the points that are $\geq 1$ from the boundary and within some bounded disk, this is compact, so there is a finite subcover (from the countable cover) , of balls, if the union of these closed balls is disconnected, draw a path in $D$ joining all the centers, and add more balls (from this cover we started with) to cover this path
but yes, i did not use that the cover i started with is countable anywhere
because the first finite union of closed disks covers the set $E_1 = \{|z| \leq 1 \} \cap [d(.,\partial D)^{-1}(0,1) ]$, the second finite union of closed disks (which includes the first finite union of closed disks as a subset) covers $E_2$, and is compact, the $E_k$ is increasing and any compact subset of $D$ is contained in an $E_k$, so I can be sure the increasing sequence of compact sets I am building has the same property (exhausts all compact subsets of $D$)
the closed disks are contained in the domain to begin with already
here $E_k = \{ |z| \leq k \} \cap [d(.,\partial D)^{-1}(0, \frac{1}{k})]$
sorry, and of course by $d(.,\partial D) $ it is a function $D \rightarrow \mathbb{R}_{> 0}$
Suppose that $n,m \in \mathbb{Z}$. Show that $p(n, m) \le e^{-\frac{n(n1)}{2m}}$. It's also given that $p(n,m)= \frac{m-1}{m} \times \cdots \times \frac{m-n+1}{m}$.
So we will try to find an upper bound:
$$(m-1) \times \cdots \times ( m-n+1) = \prod_{k=1}^{n-1}(m-k)$$
This can be bounded as,
\beg...
Sigma-compact+locally compact implies hemicompact, and you can always make the sets witnessing hemicompactness path connected by enlarging them if needed
$\prod_{k=1}^{n-1}(m-k) = \prod_{j=1}^{\frac{n-1}{2}}(m-j) \times (m-n+j) $ For $m, k$ being integers and $(n-1)/2 \in \mathbb{N}$, can you please show how we get RHS above?
I tried using b = [2 3] and b = [3 3], the former was inconsistent and the latter consistent. All I did was change b, but not A. The rank was 1 for both, but one was inconsistent and the other was consistent.
I know that something like [0 0 ... 0 | 1] is always an inconsistent system
But how exactly did you make that jump from b is contributing a leading variable to there must be a row of 0s in A where the corresponding b-component ≠ 0?
And, without inconsistency, i.e., with consistency, any time there's a row of 0's in the echelon form of $A$, it's also got a 0 in the echelon form of the augmented matrix. So there is no additional pivot coming from the augmented column.
Wow, I finally understand why if the ranks are same, the system's good (# 0-rows same after RREF) and the ranks are different, the system's bad (# 0-rows different after RREF b/c b contributes a leading variable)
@TedShifrin and @anakhro Thank you a lot for helping me understand.
@TedShifrin If the transition maps between local trivializations are all the identity, then all of the trivialization maps are the same. But I still don't get why we can conclude that this is equivalent to having a single (global) trivialization, thus rendering the bundle trivial.
@TedShifrin Well, on Math.SE it's quite likely for the accepted answer to also be the top scoring answer. But on other sites, it's not unusual to see a mediocre accepted answer and one or more superior answers with higher scores. That shouldn't be surprising, since the OP is often the least competent contributor to a page, and may not be a good judge of answer quality. People have been saying stuff like that for years...
This answer of mine stackoverflow.com/a/40683466/4014959 (on finding the nearest Fibonacci number to a given number) has 4× the score of the accepted answer, but since that answer only has 2 points I'm unlikely to ever earn Populist on that question. ;)
I was rather annoyed at the time, especially because the author of the accepted answer boldly proclaims how good his algorithm is. It's ok for small numbers, but it's glacially slow with big ones. (Python has arbitrary precision integer arithmetic built-in).
I started wondering if we could define some kind of distance whose range is not necessarily the set of the positive real numbers but any ordered set. If it's the case, is this used? Are there any examples please?
In algebra (in particular in algebraic geometry or algebraic number theory), a valuation is a function on a field that provides a measure of size or multiplicity of elements of the field. It generalizes to commutative algebra the notion of size inherent in consideration of the degree of a pole or multiplicity of a zero in complex analysis, the degree of divisibility of a number by a prime number in number theory, and the geometrical concept of contact between two algebraic or analytic varieties in algebraic geometry. A field with a valuation on it is called a valued field.
== Definition ==
One...
"Size" is not quite "Distance", but I imagine you could use a valuation to define some kind of metric-like structure.
@PM2Ring. $max_{1 \le i \le n}$ simple means the maximum element of a random variable $X_i$, which is again representing the number of probes at $i$th insertion
@Avra It is not saying that you can just replace $\max$ by $\cup$. It is that the two sets $\{ \omega | \max_i X_i(\omega) > 2 \log n \}$, $ \cup_i \{ \omega | X_i(\omega)> 2 \log n\}$ are the same.
It is not hard to show equivalence in the usual way, pick some $\omega$ in the left and show it is in the right and vice versa.
@Avra You're mis-reading the notation. The union is just collecting all of the $X_i$ that satisfy that condition into a single set. It's equivalent to the Python {xi for xi in X if xi > 2 * lg(n)}. I think. ;)
@copper.hat. Thanks. Assume we have 5 elements, since it's given that $Pr[X_i > 2 \log{n}] < 1/n^2$, then let us say that all 5 elements are replaced by $1/n^2$, so max in the set will give $\{ω|max_i X_i(ω)>2logn\} = \{ 1/n^2,1/n^2,1/n^2,1/n^2,1/n^2\}$ and $∪i\{ω|X_i(ω)>2logn\} = \{ 1/n^2,1/n^2,1/n^2,1/n^2,1/n^2\}$
@copper.hat. @PM2Ring.
I understood as @copper.hat said earlier its from the definition of max.
max will give one element that >k, so it's either $X_1$ or $X_2$ etc.
@Avra I know it is cumbersome, but I have often found that in regards to probabilities, including the hidden '$\omega$' is worthwhile when you get stuck.
The video looks jittery, but that's because the framerate of the video capture. That is, the mouse action in reality is actually quite smooth in the app
I have a follow-up question based on my question here please Question.
Let the random variable $X_i$ denote the number of probes required by the ith insertion (insert an item $i$ into a hash table of size $m$ and $n$ elements total. Given that $Pr\{X_i> 2 \log{n}\} \le \frac{1}{n^2}$ . Let the r...