« first day (4906 days earlier)      last day (411 days later) » 

00:55
poop
01:21
That is definitely out of context.
I forgot that Xander said poop
01:35
Nov 15, 2011 at 16:23, by The Chaz
"Is the poop deck what I think it is" - Homer
(That is the first poop in this room.)
01:52
An(n)als of poop, now.
02:27
somehow talking to my daughter is a step up from this.
Probably two steps.
03:08
If $\omega$ is a nowhere vanishing closed 1-form on a smooth manifold $M$, then can I always find a flow $\psi$ on $M$ such that $\omega({d\psi\over dt}) = 1$?
03:20
sure, you can construct the corresponding field locally in charts and then glue with a partition of unity
03:53
Much clearer — choose a Riemannian metric and take the corresponding vector field.
I don’t know what find a flow means. There might not be a uniform time that you can flow.
@Thorgott how can I construct locally?
04:10
suppose f: [a,b] -> R be a differentiable function. let a <c<d<b.if f'(c) <0 and f'(d)> 0, then show that there exists a point p in (c, d) such that f'(p)=0.
Any ideas on how to solve this?
@robjohn and @leslietownes Can you please help me with this?
Apply the max value theorem.
for complete overkill there's always Darboux...
04:30
@copper.hat and @TedShifrin Ah, Thanks! I get it.
@copper That’s probably what he’s needing to prove.
@ThomasFinley mine was sort of a joke (it answers the question, but almost certainly not what was intended).
@copper.hat I know, but it's still valid.
Does there exist a continuous function f from (0,1) to R such that f(0,1)= set union of (1,2) and (2,3)?
I think the answer is no.
Is it? If so, then I am unable to prove it.
Continuous image of connected set is connected.
Of course you’re able to prove it.
A beginning calculus student can prove it.
04:46
@SoumikMukherjee and @TedShifrin I have not encountered the notion of connected sets but yes, I was able to conclude it because the continuous image of an interval is an interval. Thanks!
@ThomasFinley Connected set is something that you can't write as union of two disjoint proper open sets.
And use the fact that inverse image of an open set is open.
For continuous functions.
@SoumikMukherjee Oh, I get it! Thanks!
05:03
connectedness is subtle in general. the real line is about as simple as it gets as the only connected sets are the intervals (taking points, the whole line and the empty set as intervals).
05:55
in the context of the principle of inclusion and exclusion, where $p_1=\sum_{i=1}^n P(A_i), p_2=\sum_{i \leq j} P(A_i \cap A_j) ...$ and so on, we have $P(\cup_{i=1}^n A_i)=p_1-p_2+p_3 ..... +(-1)^{(n+1)}p_n$. my question is, my book says it is clear to see that $p_1 \geq p_2 \geq ....$, but im unable to even prove $p_1 \geq p_2$. could anyone help
this question is wrt probability, not cardinality, btw
06:27
@ThomasFinley Sorry, I was afk and now you are. It appears that you have this now.
06:55
nick: you maybe want that sum defining p_2 to be over i < j [and similarly for the others]? is there some assumption about the relation between the sets A_1, ..., A_n? there is no general reason why p_2 could not be larger than p_1
@nickbros123 Do they actually use that? I don't think it is necessarily true. If they require it in their presentation, look at this answer
 
1 hour later…
07:59
5 hours ago, by one potato two potato
If $\omega$ is a nowhere vanishing closed 1-form on a smooth manifold $M$, then can I always find a flow $\psi$ on $M$ such that $\omega({d\psi\over dt}) = 1$?
this a part of an argument to show that $\omega$ makes $M$ a fibered 3-manifold over $S^1$ by map $f:M\to S^1$ by $x\mapsto \int_{x_0}^x\omega$.
$\psi$ should be a global flow (periodic)
$M$ here has a finitely generated $\pi_1$ btw
@robjohn look at this screenshot
after (1.3.13), they say $p_1 \geq p_2 ...$
the book is Hogg, McKean, introduction to statistics
@leslietownes yeah, that i<j is there, sorry for writing it as $i \leq j$. and yes, it is implied for the others as well. the book doesnt speak about any conditions on the sets, but still asserts this inequality...(see above screenshot)\
nah, that can't be right. if the C_i are all equal to the same set C having nonzero probability, you get scaled binomial coefficients for these p_j's, and there is obvious trouble when k = 4, where p_1 is 4 p(C) while p_2 is 6 p(C).
@leslietownes That is just what I was trying to write up. There are $4$ intersections of $1$ and $6$ intersections of $2$
08:15
sometimes authors don't pay as close attention when "remarking" on stuff as they might when stating things that they actually intend to prove in the text.
@nickbros123 What does Theorem 1.3.7 say?
i found a copy of the book online. "as shown in theorem 1.3.7" is the beginning of an observation that is unrelated to the false statement about the order relation between the p_j. it's just an oddly typeset further remark.
mckean maintains an errata sheet for the most recent version of this text [which contains the error] and this isn't on it. maybe someone should tell him
ooh, for counting measure someone even asked this on main.
1
Q: Do the terms of an inclusion-exclusion summation decrease?

Brad GrahamIf $|A_1 \cup A_2 \cup \ldots \cup A_n| = c_1 - c_2 + \ldots + (-1)^n c_n$, where $c_i$ is the sum of the sizes of all of the intersections of $i$ sets at a time (inclusion-exclusion principle); i.e $c_1 = |A_1| + |A_2| + \ldots + |A_n|$, $c_2 = |A_1 \cap A_2| + |A_1 \cap A_3| + |A_2 \cap A_3| +...

neither answer is that great, but brad's identifies the counterexample we were talking about
But, hey, its obvious that it's decreasing ;-)
he does at least identify the largest value of k for which the case of k equal sets does not provide a counterexample :)
09:03
woah, thank you guys
i mailed mckean about this one
 
3 hours later…
12:30
@ThomasFinley use intermediate value theorem
(This is what people mean by connected in this case)
Its just that we can think of intermediate value theorem as a consequence of two theorems from topology
12:43
@onepotatotwopotato given a point $p$, you can find coordinates $x_1,\dotsc,x_n$ on a nbhd of $p$ s.t. $\omega=\sum_{i=1}^na^idx_i$ for smooth functions $a^1,\dotsc,a^n$ on that nbhd and there is an index $i$ s.t. $a^i$ is nowhere-vanishing on that nbhd. then, take the vector field $\frac{1}{a^i}\frac{\partial}{\partial x_i}$.
what Ted said works too without working locally and in coordinates: pick a Riemannian metric and then this is one of the musical isomorphisms (I always forget which is which)
@onepotatotwopotato that's true for all compact manifolds
13:21
@Thorgott oh, it seems I knew it before and forgot (I'd upvoted a post explaining why).
@Thorgott because it's nowhere vanishing, gluing gives a global flow?
@onepotatotwopotato gluing gives a global vector field
then take the flow associated with that vector field (which exists everywhere by compactness)
ah yeah compactly supported vector field generates a global flow. I forgot that too
thanks Thorgott
 
1 hour later…
14:55
@leslietownes Consider $C(X, R)$ with $X$ a topological space, $R$ a topological ring. How much can we extend Stone-Weierstrass theorem? As in, results generalizing choice of $R$, say $R = \mathbb{R}^n$.
I've noticed I only really saw results for $R = \mathbb{R}, \mathbb{C}$ or $\mathbb{H}$ (quaternions)
I don't mean generalizations to very general $R$, just all nice enough $R$, perhaps
15:35
Perhaps this will lead to a definition of rings with Stone-Weierstrass property
15:52
say that a topological ring $R$ has Stone-Weierstrass property if for any compact space $X$, any separating (unital) subalgebra $\mathcal{A}\subseteq C(X, R)$ where $C(X, R)$ is equipped with compact-open topology, is dense in $C(X, R)$
$X$ compact Hausdorff, maybe
Or maybe $X$ Hausdorff since I'm using compact-open topology
16:45
If $\mathcal{A} = \langle f\rangle \subseteq C(R, R^2)$ where $f(x) = (x, x)$ then $\mathcal{A}$ is a separating subalgebra of $C(R, R^2)$. If $g\in\mathcal{A}$, then $g(R)\subseteq \Delta_R$. Since $\{g\in C(R, R^2) : g(R)\subseteq \Delta_R\}$ is closed in $C(R, R^2)$, for $\mathcal{A}$ to be dense we need to have $R = 0$
So if $R\neq 0$ has Stone-Weierstrass property then $R^2$ doesn't
(with point-wise multiplication)
clearly I only prove trivial theorems
But this helps, because it shows that multi-variable Stone-Weierstrass theorem needs to be stated carefully, as a corollary of the one-dimensional case
17:25
something that I think might be easier to satisfy is Weierstrass approximation property, in the sense that $R[x]$ is dense in $C(R, R)$
one other property I'm thinking of is multivariable Weierstrass approximation property, that $R[x_1, ..., x_n]$ is dense in $C(R^n, R)$
Is there an alternative to a Cayley Table which can represent an operation whose image grows (with some known maximum bound) the more it is successively applied? So A operation B operation C has a larger image than D operation E?
Best I could think of so far is a Cayley Hybercube.
But that's maybe of limited utility in > 3 dimensions.
To me, the word operation usually means some mapping $S\times S\to S$.
Hmm, is there some more generic word for what I described?
I don't understand what you're talking about. If the image is larger than $S$, how do you apply the operation defined on $S$ again?
17:49
I guess maybe one should abandon the concept of applying each quasi-operation in "A quasi-operation B quasi-operation C" independently of the other?
The example I'm thinking of here is digital sum in base b (en.wikipedia.org/wiki/Digital_sum_in_base_b) operating on inputs in base < b. So if you take a digital sum in base 4 of binary numbers, digits in A quasi-operation B quasi-operation C can go up to 3, but digits in A quasi-operation B can only go up to 2.
That is a poorly written Wiki entry. Inputs in base $<b$? Bizarre. You're definitely mapping one set to another, and repetition doesn't seem to be continuing to use the same function at all.
Yeah, this actually comes up in combinatorial game theory in the optimal strategy for Moore's Nim$_k$ (math.stackexchange.com/questions/4831841/…). The answer is long but the general idea is as I just described in the above message.
I think a multidimensional Cayley table might handle it, but that's obviously not super useful in 4+ dimensions.
I think you just need to define a sequence of maps (with domains and ranges changing recursively).
@Jakobian interesting, i have not thought about this before. one thing to keep in mind for arbitrary R is that even when R = complex numbers, the "separating subalgebra" hypothesis alone is not enough for density in general (e.g. X = S^1 and 1/z not being a uniform limit of polynomials in z). i don't know what would replace "self adjointness"-like conditions for arbitrary R, but maybe people doing nonselfadjoint stuff over C is already a place to look for inspiration
Yesterday I declared all operators commutative and today they shall all be self-adjoint.
18:01
@leslietownes I've asked a question about example of a topological field with the SW property, and there I defined the subalgebra to additionally be closed under topological field automorphisms
this includes $\mathbb{C}$
So, for example, in A operation B operation C, the two operations have different Cayley tables, and the Cayley tables also vary depending on grouping even if associative?
this makes sense as for $\mathbb{F} = \mathbb{C}$ we have two such automorphisms, identity and conjugation
Cayley table is used for a group operation. You're just representing a function by an array. But in your case, the array will no longer be square, and then you have to decide how your arranging the rectangular array of outputs linearly to proceed to the next level.
the last shall be the first, and the first last, and they shall take up operators, and if they adjoint any thing, it shall not change them
Or you're making three- and more-dimensional rectangular boxes for your arrays.
@leslie It seems your wife's strange aunt has turned you into a religious fanatic :D
18:06
i'm just spreading the good news about the world to come
I wish we had some actual good news.
@Jakobian its also the reason why I think this is a more appropriate definition
I don't think I need to use arbitrary Hausdorff space $X$, just compact ones is probably enough
Okay yeah, multidimensional box is pretty much what I came up with as well
Think of this as a graph of a multivariable function (in some high dimension). The only difference is that your domains are finite and discrete instead of regions in $\Bbb R^k$.
Ohhh that's actually really interesting.
A Cayley table (with or without group axioms) is just a discrete surface with heights given by the outputs.
18:16
jakobian: have you seen ime.unicamp.br/sites/default/files/pesquisa/relatorios/… and its references? i encountered it through the paper of chernoff et al on stone-weierstrass for "valuable" topological fields [in the world to come, every field is valuable]
Hi
Is there some know ways to solve diophantine equations involving terms of the Fibonacci sequence? Eg. $13F(n-1)-8F(n)=0$.
WolframAlpha gives one solution viz n=7 but is there some way to calculate that efficiently on pen and paper? I don't think I can go around putting the value $\frac{phi^n - \psi^n}{\sqrt 5}$ for $F(n)$ and expect to be able to find $n$ from the equation.
@user10478 Right. I'm not sure what associativity (in the usual setting) says about that graph :P
18:31
after the first few terms, the sequence of fibonacci ratios c_n = f_n/f_{n-1} is strictly decreasing to phi [and it satisfies a recursion, namely c_n = 1 + 1/c_{n-1}], suggesting an approach that is slightly more enlightened than complete brute force
namely, if someone asks me you to solve a f_{n-1} + b f_n = 0 (i.e. c_n = -a/b), first look where -a/b is in relation to phi, and if it's in the realm of possibility (i.e. one of the first few values of c_n, or slightly above phi) compute values of c_n using the recursion until you either hit it, or go below it
@leslietownes not the references, but I guess I should
Reading this post gives me a headache: math.stackexchange.com/a/4841678/137524
don't worry, it's in the capable hands of that person who just answered it
from what I'm reading, all valuable fields except for $\mathbb{C}$ satisfy Stone-Weierstrass
cool result
18:45
@TedShifrin Can they be positive definite tomorrow?
semi: they had me at "free end of the taut string"
@leslietownes OH, BABY!
complex numbers kinda suck
so, like, a rod? literally anything but a string
@Jakobian Lies.
Complex numbers are great.
18:47
@XanderHenderson With proper court approval, yes.
after considering automorphisms, Stone-Weierstrass holds for all valuable fields
so maybe it holds for all fields?
at least when $X$ is compact (which I think is equivalent to the non-compact case)
what are some examples of fields that aren't valuable?
chernoff says most of the 'usual' topological fields are valuable
that means nothing to me
kaplansky offers "any non-completable division ring", such as the rationals in the 6-adic topology, as a nonexample
i wasn't directly quoting or expecting to help as much as saying "the author of a person on a paper like this suggested that most topological fields people use are valuable"
he cites kaplansky who gives that example, he also cites bourbaki who may give nonexamples
19:02
@TedShifrin So for associativity in a non-trivial sense you'd need at least three input dimensions I suppose, so the Cayley Table discrete surface wouldn't be expressive enough. To test whether Z = A operation (B operation C) = (A operation B) operation C maybe you could express Z in color and A, B, and C in spacial dimensions. The only test I could think of would be to start with the line Z(B) with A and C constant, and then extend the line into a surface in two branches
first by varying A and then varying C on that output, and second by varying C and then varying A on that output. Maybe you get the same colored surface in both branches iff the opration is associative. Or maybe you just always get the same colored surface in both branches I can't really visualize it without simulation.
anyway, i guess easy examples on a simple field structure if you do something weird with the topology
@leslietownes how does the $6$-adic topology work?
@user10478 Right. We need to "see" $f(f(x,y),z) = f(x,f(y,z))$.
jakobian: i dunno, just surfacing some comments in the references cited above
If anyone sees if the $6$-adic topology on rationals doesn't satisfy Stone-Weierstrass property, feel free to post an answer under my question
19:10
I learned today that $6$ is prime enough.
I was just going to ask if 6 was prime...
calm down, nobody said the completion was any good
$a$-adic topology where $a$ is a sequence of integers $\geq 2$ exists
no need to assume prime
in my question here I ask when are $a$-adics torsion-free, for example
I see that the question is only about the group structure, maybe I never got to the topology
but working with them as it is was painful enough
you should hear what the a-adics say about working with you
we're nearing the third anniversary of my first "you should hear" joke, for all who celebrate
19:25
Damn, it feels like ten years already.
19:54
Hmm, I guess technically my method doesn't produce arbitrary colored surfaces, but colors every unit cube in the bounded input space R^3 cube. I wonder if maybe there is some massaging that allows associativity to be expressed/generalized in terms of Rubik's Cube operations, or maybe some extension of a Rubik's Cube from a hollow into a solid cube. I don't know anything about Rubik's Cube math but it looks like group theory is indeed relevant.
Rubik’s cube is all about group theory …. Particularly conjugation.
i haven't been following the chat, but "seeing" associativity of a binary operation from its list of outputs/cayley table is informally known to be a difficult and probably unsolved problem. people sometimes publish "shortcuts" or partial results in recreational math journals.
i say "shortcut" in quotes because it'll be stuff like, "print out 8 copies of the cayley table and cut them into strips, now glue the strips in the following way..."
that's one for checking whether a commutative binary operation is associative by hand. here A is a set having n elements, and O is a cayley table.
from k. abdali in the mathematical gazette. doi.org/10.2307/3613856 (but paywalled)
20:23
Ahhh, I guess my thing likely doesn't work then.
I've only a tourist's understanding of abstract algebra. I know some of the terminology but a lot of this is news to me.
20:45
If a function is differentiable does $ \lim \limits_{\mathbf h \to \mathbf 0} \frac{1}{|h|} (f( \mathbf a+ \mathbf h)-f(\mathbf a)) = (h_1(g(x,y) + h_2(s(x,y)$ $+$ remainder) for some function $g(x,y)$ and $s(x,y)$.
oops I dropped the $\frac{1}{\mathbf h} $ before $(h_1(g(x,y) + h_2(s(x,y)$ $+$ remainder)
This makes no sense so far, @User13114.
Is the domain of $f$ in $\Bbb R^2$?
You can't write limit on the left and not on the right. If $f$ is differentiable, then, yes the partial derivatives exist, so $$f(a+h)-f(a) = (\partial f/\partial x)(a)h_1 + (\partial f/\partial y)(a)h_2 + \text{remainder},$$ where $\dfrac{\text{remainder}}{|h|} \to 0$.
 
2 hours later…
22:29
This is a vague question but consider a function $f: R^n \to R^m$ which is differentiable and its derivative is a $mxn$ matrix $[Df(x)]$. Then when you take the derivative of that $[Df(x)]$ do you think about it like some sort of 3 dimensional $mxnxn$ array kind of like a rank 3 tensor?
you can use \times instead of x
Thanks for letting me know though I can't edit the post anymore
yes, you can do that
22:57
@User13114 The derivative at a point is a linear map from $\mathbb{R}^n$ to $\mathbb{R}^m$. The $k$th derivative is a $k$-linear map from $\mathbb{R}^n$ to $\mathbb{R}^m$
so, in essence, we can think of it as a linear map from $\bigotimes_{i=1}^k \mathbb{R}^n$ to $\mathbb{R}^m$
I think you're trying to do something that physicists do, putting that $\mathbb{R}^m$ into the tensor product?
perhaps that's not exactly what a physicist would do..
at least, I doubt they'd put it the same way as me
23:15
a physicist thinks of $\mathrm{Hom}(V,W)$ as $V^{\ast}\otimes W$
23:29
I'm not sure if they know what $V^*\otimes W$ is though
I'd suspect a common physicist only knows the other definition of a tensor, so they're not aware of what tensor product of vector spaces is
"if it acts like a tensor in coordinates, it's a tensor"
23:44
@leslietownes I've looked at Cauchy-Schwartz recently, and I think $|u\cdot v| = \|u\|\cdot \|v\|$ iff $u, v$ are linearly dependent has some interpretation in terms of convexity of the unit ball?
strict convexity to be more precise

« first day (4906 days earlier)      last day (411 days later) »