« first day (4053 days earlier)      last day (1264 days later) » 
00:00 - 22:0022:00 - 00:00

00:32
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}$?
Obviously it works for $a \in \Bbb{N}_0$
do you guys know a similar result for functions of several variables?
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...
That link is for multivariable
@user193319 Then don’t the usual methods prove it for $a\in\Bbb Q$?
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$?
00:48
@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?
If your neighborhood of the new point is inside the neighborhood of the point for which you know convergence, then it converges.
if you know that the radius of convergence about $(0,0,0)$ is $14$, then the radius of convergence about $(3,4,12)$ will be at least $1$.
@TedShifrin yeah, i think so; and then just use a density argument. thanks!
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?
$a\inB(0,R)$
01:07
yeah, the series at a will converge if a is inside (0,R).
01:17
ballot received and counted. blegh.
how would i go about to prove that? i tried to replicate the 1 dimensional case and it didnt workout nicely?
If you’re doing a disk within the original disk of convergence, it’s the identity principle.
that would be for 1 complex variable right? i want for $\mathbb{R^n}$
01:32
mm, may need some hypotheses on F. i was assuming F was complex analytic or perhaps at least solved a nice enough PDE.
if F is just real analytic, i dunno.
I wouldn't mind adding hypothesis, but i thought it would end up working with the same ones given on the 1 dimensional case.
01:57
@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
02:27
Can anyone recommend a homological algebra book that is strongly from the category theory perspective?
maybe Gelfand-Manin
02:53
@leslietownes I got a text about that this morning.
@leslietownes Real analytic suffices for an identity principle, of course.
03:11
oh yeah, duh.
my wife hasn't gotten her confirmation, although i dropped them off to the same box at the same time.
03:31
@geocalc33 here
@JamalS I would ask on MSE. Be sure to post a link here and ping me
@leslietownes confirmation for what?
That the Earth is not flat ?
@SmokenSieEinBitteChebaHitBits But it is! (Locally, at least.)
Not even locally
Just perceptually
Except in the city, then it's a square wave
@SmokenSieEinBitteChebaHitBits confirmation that her ballot in the california gubernatorial recall election had been received and counted by the county.
those gubers got counting
i sometimes forget that not all of us are in california or care about the recall election if they are.
03:37
I am pretty sure that they are still trying to dispute the last presidential election in my state. :\
@leslietownes I'm in CA but don't pay attention. What's the recall about?
Yes, I live under a rock. I read news from a mathbook, so it gets to me kind of late
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.
So Newsom is a crat or a lican?
newsom is a democrat.
03:39
The whole California election system is a mess. Ballot initiatives make a mess of law. :\
I just picked one and sent it off
xander, we agree on that.
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 would say that I am happy to be away from all that nonsense, but I think that it is even worse, here.
no hope of that this time.
@leslietownes Ugh... the Gubenator...
03:40
Isn't a lark a type of bird? You shouldn't run on them. :|
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
Heh. Okay...
Good enough.
I haven't actually looked at the signatures on my diploma. I should do that at some point, I guess.
it may all have been worth it just to have a diploma 'signed' by arnold schwarzenegger
this time around, i don't see any upside
They probably printed it on, who has time to sign 1000's of diplomas
Newsome's siggy is on mine. I can't really complain... I voted for the guy.
03:43
i'm sure he, and the president of the regents, and of the university, made an exception just for me.
The president of the whole hegemony
Okay, I'm back on crack, time to do some math :)
*track
This discussion gave me an idea
for a math app for math crackpots like me
You can "Zoom in" along the axis of "generality"
So $\Bbb{Z}/a\Bbb{Z}$ might zoom out to be just $M$ a $\Bbb{Z}$-module.
But the diagram attached to $\Bbb{Z}/a\Bbb{Z}$ say the obvious SES could also zoom along with it
But zooming in is the problem
Which example do you zoom into?
It's a UX design problem
room?
You could also zoom in / out along $\in$
So $\Bbb{Z} \in \textbf{CRing} \in \textbf{Cat} \in \textbf{Universe}$
Moving up and down in $\textbf{Cat}$ would give you other categories based upon how they relate to the one you were just viewing
So there would be functor arrows in the diagram
*Moving or "panning" on that layer
@leslietownes @gian, what do you think of that software idea?
It's called "Abstract Spacecraft"
The purpose of it is to explore spaces abstractly
04:05
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.
Yes, it's kind of like a mind map but the arrows will usually mean some structure morphism
I will make it not rigorously to start out as proof assistant-type software is hard to code for me
04:08
@SmokenSieEinBitteChebaHitBits That sounds pretty interesting, hard for me to visualize though.
I will just manually construct some scenes so that you can get an idea of the idea
@gian that's the point of the app, to help us visualize, so you would be a good alpha version user
I will work on it some and post back here to the room when I have something uploaded
Python / PyQt5 of course
Ah, sounds good
I tried a Django Site once (the code is on github) for a database of CD's using q.uiver.app as the editor
It's just that graph databases cost too much to host your data (for me) and I don't feel as free as a coder when working on a Django site.
In PyQt5 (that's Operating system applications), I can code it however I want and am not constrained by any web browser tech.
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
04:59
@gian Do you understand what it means for a bundle to have an $\’{e\}$ structure? Say it.
@TedShifrin I can choose local trivializations of the bundle whose transition functions are all the identity.
05:17
So what does this tell you about the bundle? @gian
05:35
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
05:53
Angelyn for governor.
06:14
@shintuku thinking of them as having similar values would be misleading because it would suggest $\vec x$ approaches $\vec 0$ only on a diagonal
 
2 hours later…
08:22
@leslietownes progress so far
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
 
1 hour later…
09:34
@leslietownes his post-office career Now you've got me imagining Arnie delivering mail.
 
3 hours later…
12:25
@gian Reducing the structure group to $\{e\}$ is the same thing as trivializing the bundle. Prove this if it's not clear to you.
And $TS^2\rightarrow S^2$ is not a trivial bundle. This, of course, is not obvious, but the hairy ball theorem.
Whenever asked to insert 3 rational numbers between 3 & 5 .
There is a method that is a+b/2 & continue doing it.
3+5/2.
Then , 3+4/2 and 4+5/2.
This is the formula used but in reality , I don’t need this formula right. I can just put 3.1 , 3.2 , 3.3 also as the rational between between 3&5
or you can 31/10 , 32/10 , 33/10
13:02
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$?
if $n,m$ are integers, then how please $1-\frac{n}{2m} \le e^{-\frac{n}{2m}}$
the point is that you can cover $D$ by countably many closed balls, then take increasing finite unions
you have to do it in the right order to stay path-connected at every point, but this is possible
13:19
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
"take a finite subcover of this", of what? you've only described one set
a construction like this probably works though, but I don't quite see how to make the path-connectedness
what I was suggesting was just to start with a cover by countably many closed balls to begin with
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
why is there a need to take things away from the boundary in a certain way then
just take the cover so that the closed disks are contained in the domain to begin with
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}$
@robjohn. Hello, can you see my question please if you have time:
0
Q: Show that $p(n, m) \le e^{-\frac{n(n1)}{2m}}$

AvraSuppose 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...

13:36
Sigma-compact+locally compact implies hemicompact, and you can always make the sets witnessing hemicompactness path connected by enlarging them if needed
exhaustion is trivial if you start with a cover by closed disks and take increasing unions
cause every compact subspace is covered by finitely many of them already, by compactness
oh yeah, thats true
14:32
$\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?
the terms are just rearranged
try some small examples by hand to see the pattern
15:20
beloved thorgott
15:36
@Thorgott. Yes! Thanks. But how they do it algebrically please?
How we got RHS above from LHS please?
max will simply give the maximum $X_i$, so how that translates to having union of ${X_i > 2\log{n}}$ on LHS please
Any conditions on the X_i?
No conditions at all. It's just a random variable that is bounded by 2log(n)
I am just trying to understand notations please and nothing else
$$
\underset{1\le i\le n}{\max}\ \equiv \bigcup_{i=1}^n{}
$$
?
$Pr\{X_i > 2\log{n}\} \le \frac{1}{n^2}$
I don't understand the notation, especially on the right with the braces around the inequality...
I am not sure if that helps answering my question, but again I am trying to understand notation please
braces will simply give a number that is 1/n^2 you can say
It's a random variable that gives a value based on $i$
Hi all, I have some questions about Linear Algebra
15:47
it is not claiming that the $\max$ equals the union!!!!!
Usually you want $P(Y\square Z)$ where Y and Z are something (often random variables) and $\square$ is equality or an inequality.
My book states the following theorem:
@copper.hat. Sure. Haha. I am just trying to understand notation
@copper.hat. Can you please translate it for me?
It is saying that $P \{ \omega | \max_i X_i(\omega) > 2 \log n \} = P \cup_i \{ \omega | X_i(\omega)> 2 \log n\} $.
@copper.hat. I don't get please
15:49
That's the theorem stated from the book.
My questions are:
1. Why isn't Rank(A) = Rank(A|b)? Does the constant vector really make a difference?
2. How can a system have rank (A) > r? Isn't the rank(A) ≤ n, where n = # variables / # columns?
@Refath Take a simple matrix like the matrix of all 1's.
Say, 2x2, all 1s.
3. Why is a system consistent if rank (A|b) = r? Why is it inconsistent if rank(A|b) = r+1?
Then pick different b's and try determining the rank.
@copper.hat. Great! Thanks. So how we got union above ?
@anakhro OK, let me try
15:51
@Avra note that $\{ \omega | \max_i X_i(\omega) > 2 \log n \} = \cup_i \{ \omega | X_i(\omega)> 2 \log n\}$
how $max_i$ and $U_i$ are related. Can you say it in your own words please?
$\max_i X_i(\omega) > 2 \log n$ iff $X_i(\omega) > 2 \log n$ for all $i$.
It is union.
@Refath Let me know how it goes!
OK
@anakhro It seems to be an underdetermined system, with one free variable
@copper.hat. So it's not because max from 1 to n is equivalent to a union? Is it like max of X_i from i=1, ...,n taking sum of all maxes?
15:55
But doesn't that mean if a system has the maximum possible rank it should be consistent ... ?
@Avra just read my equivalence above.
@Refath Yup! So r=rank(A)=1. Now pick a favourite 2x1 vector b and augment A with this vector so it is [A|b]. Do the same thing.
@anakhro OK, let me see.
@Refath Indeed, if r=n (and A is nxn), then the system Ax=b will always be consistent!
But then to see why you get inconsistent systems when r<=n, doing a few examples like this with your matrix of 1s might illuminate it.
OK I get
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.
16:01
Correct row-reduction, but incorrect conclusion about the ranks.
Indeed for [3 3] your rank is 1 (there is only one leading entry).
But for [2 3], the rank is not 1.
Wait, does the 1 in the constant vector b also count as a leading variable? No, right?
Indeed it does count!
Just mentally erase the line in your head and it is for sure a leading entry.
Wait, but that's not a variable ... it's a constant?
Because the columns represent variables, and I always thought only the 1s in A count as leading variables.
I wouldn't call it "leading variable", because the entries in a matrix are technically non-specific.
@anakhro OK, then I have:
rank(A|b) = r+1 = 2 => Inconsistent for b = [2 3]
rank(A|b) = r = 1 => Consistent for b = [3 3]
16:05
Opposite ranks.
There you go :)
Which definitely agrees with your theorem now, right?
Whoops, corrected. OK, so now I see empirically why if rank(A|b) = r+1, we have an inconsistent system.
Thank you
Is there a geometric intuition for why this theorem is true?
Maybe something to do with under and over determined systems?
Well A and [A | b] will row reduce similarly if you do the algorithm, right?
Right, A will row-reduce exactly the same.
But if you have a different rank for A and [A | b], then that means what?
Well then that means b is contributing a leading variable?
16:09
Indeed. So there must be a row of zeros in A where the corresponding component of b is non-zero.
That leads to the +1 to the rank.
Wait, let me digest that --
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?
I should be clearer: the corresponding component of b (possibly changed after the row reduction algorithm).
Well let's be a bit more formal with the row reduction.
A row reduces to R, and [A | b] row reduces to [R | s]
You agree that this makes sense why we have R in the row-reduced version of both?
Right, right
Because A will row-reduce exactly the same, as we said before
Yup!
So if rank(A) = rank([A | b]), then they have the same number of zero rows.
Agreed
Consistent Solution
16:14
Now if the rank does not agree for the two, then one must at least 1 fewer rows of zeros than the other in the row reduced version.
i.e. R and [R | s] do not have the same number of zero rows.
Is that an okay conclusion?
Yes, I think I get it
Let me see if I can explain it myself:
Sure!
Say you've got a matrix A.
rank A = r
Now you augment A with some constant vector b => [A | b]
if rank A = rank [A | b]
then [A|b] is a consistent system
Why?
Well it's because if rank A = rank [A | b], then r ≤ n, where n = # variables = # columns
Would that be a valid justification?
What is your definition of "inconsistent"?
16:19
No solutions
So if I hand you the matrix [A | b], how do you determine the solutions?
Find RREF(A|b)
And then I can translate it back to the equation form.
So how does rank A = rank [A | b] help with that?
Well, b doesn't contribute any leading 1s ..., so RREF(A) = RREF(A|b)
Oh, right
Except you can't have two matrices of different shapes equal to one another.
16:27
rank A = rank [A | b] = r. So that means both have the same # leading variables.
wait, so if rank A = rank [A | b], I don't have to row-reduce [A | b] all over again
I can just plug in the row-reduced version of A into [A | b]
maybe I have to re-write my notation.
If rank A = rank [A | b]
No, you have to keep track of the row operations and do them to $b$ as well.
^ That's true
Well if RREF(A) = [r], then RREF(A|b) = [r|s], as @anakhro previously wrote
Maybe you should focus on inconsistency. How do you tell that the system is inconsistent?
If you have [0 0 ... 0 | 1]
It's inconsistent
In other words, if the system gives you 0 = 1
Right.
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.
16:31
Right, [A] & [A|b] have the same # 0-rows
So they have the same rank.
Oh, I see you're going backwards -- if a system is consistent, it's got to have the same rank as its augmented form. Is that it?
Thus, the converse is if they have the same rank, the system is consistent.
Right, but the converse is obvious, as there is no row $[0\dots 0|1]$ appearing in the RREF of the augmented matrix.
Right
So that's it -- that's why if rank [A] = rank [A|b], we have a consistent system, because they essentially have the same # 0-rows
Sometimes obvious things are harder to say than non-obvious ones :)
if and only if
16:36
Right, iff
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.
You're welcome :)
@copper.hat. Does $max_{1\le i \le n} X_i = sum_{1\le i \le n} X_i$ please
I thought max will give only one number from $1 \le i \le n$
16:55
@BR56 what is $[A\mid b]$?
@BR56 Never mind, I see
17:14
@leslie This was sorta interesting. Serves me right for not including a complete proof (but it wasn't central to the course).
17:39
@Avra of course not. a simple example $X_1=X_2 = 1$ will show that. Why would you expect such a thing?
@Avra Why do you have sum there? There is no sum in your original equation chat.stackexchange.com/transcript/message/59094399#59094399 There is just a union of sets.
In other news, the experiment on SO of unpinning the accepted answer has concluded successfully. And now that option is being offered to the rest of the network. Please see Unpinning the accepted answer from the top of the list of answers for details.
I hadn’t ever even noticed :)
@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.
You get a global basis for sections !
What do you mean by that?
17:54
You take a frame on one trivialization and it glues to all the other trivializations so you get a global frame.
18:04
@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...
It’s common enough that there’s a badge for it
Makes sense to me.
A badge for what ?
Give an answer which is way more reputable than the accepted answer, basically
It’s not a common badge owing to the high vote threshold tho
Actually I guess the issue is more than that the accepted answer has to be be highly upvoted as well
I have no idea if I got that badge or not. Too lazy to look.
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).
18:42
or, if you don't like the language of frames, the trivializations glue together all the same
how would you reason that $\lim \limits_{\langle x,y \rangle \to \vec 0} \frac{x}{\sqrt{x^2 + y^4}}$ does not converge?
not formally, just, how would you get the idea that it's divergent
Good evening!
shin, that doesn't even converge as one-variable when you set $y=0$
oh! right, so since it diverges when $\vec x$ approaches $\vec 0$ through the x-axis, the limit does not exist
thanks!
@PM2Ring my best candidate is probably this one: math.stackexchange.com/questions/872942/…
18:51
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?
But 58/39 is closer to 1.5 than the needed 2
And if we both pull votes at about the same rate then that ratio will just get worse
So, doubtful
19:12
@Semiclassical Nice. Only 19 more points to go...
@Axel Sure. Eg, the Hamming distance en.wikipedia.org/wiki/Hamming_distance
@PM2Ring The codomain is still a subset of the real numbers.
@Axel You might look into valuations, which are a way of assigning a (potentially) non-real "size" to a number.
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. Yes
This is the original equation
@PM2Ring. But union means sum, so we can replace it with sum, but I am not sure why max is replaced with union
Googling "group-valued metric" turned up this thesis, which might be relevant, but which I am linking only for the dedication.
@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
19:32
@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.
We can see this is a union!
OMG
This is straightforward :/
@Avra Yes. You were just a bit confused by the notation.
BTW, those sets in chat.stackexchange.com/transcript/message/59096541#59096541 are a bit weird. Each element in a set is unique.
19:52
@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.
if we don't have X_i >k, then we would have $\phi$ obviously
@copper.hat. @PM2Ring. Appreciate it
20:19
@PM2Ring Not what I was looking for, but thanks anyway for your suggestion!
@XanderHenderson Thank you a lot, I'll take a look at it.
No worries
21:11
@PM2Ring. What do you think about summation below please
@leslietownes
@copper.hat
No arrows yet in this code, but I do have an arrow class already previously written
21:28
interesting. i also like the mountain lion youtube avatar.
Thanks. It's deep in mathematical thought
*the lioness
lacks soundsystem 009 dreamscape
@shintuku what's that
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
@shintuku thx, I'll use that next time
21:38
you're free to but I meant it as a joke, all early youtube programming and how-to videos used that soundtrack
If you have time, please review my question below:
0
Q: If $ X = \underset{1\le i\le n}{\max} X_i$, then show that $ E [X] = O(\log{n})$

AvraI 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...

@SmokenSieEinBitteChebaHitBits ??
21:58
What am I looking for???
00:00 - 22:0022:00 - 00:00

« first day (4053 days earlier)      last day (1264 days later) »