« first day (2809 days earlier)      last day (2509 days later) » 

00:05
Damn
00:19
@EricSilva QM was the reason functional analysis became good
cool
i like functional a lot
@0celo7 could you say that without it, the subject would've ended up becoming... dysfunctional?
dysfunctional analysis lol
@Daminark I cannot process puns.
i should read up on the symplectic formulation of classical mech
01:03
Strange. I woke up after 5 hours of sleep.
:thonk:
In finding sumation of [ i^3x] the result must be n^2 (n+1)^2/4 . nx am I right?
ranging from 1 to n
in my workout exercise nx wasn't mentioned it was just 'x'. Doesn't the summation apply to x?
01:23
Anyone good with highest weight theory? In particular, can you have a module with multiple distinct highest weights?
01:40
@0celo7 do you know what a maximal $\delta$-separated set is?
How does Rouche's Theorem work? I'm confused. I'm supposed to satisfy
$\mid f(z) -g(z) \mid < f(z)$
for the polynomial $z^3-3z+1$
on the annulus $\{ z : 1< \mid z \mid < 2 \}$
0
Q: What is the definition of maximal ε-separated set

白云飘飘Nowadays, I am just studying the book wrote by Joram Lindenstrauss and Yoav Benyamini,i.e. Geometric Nonlinear Functional Analysis. The putfroward "maximal ε-separated set".I really can not understand this generalization.But I can not find this word in any other books. If you know this definition...

I should just print screen my attempt. I know I screwed up somewhere. http://prntscr.com/j4kfso
http://prntscr.com/j4kfvi
I know it doesn't sound right at allllllllllllllllllllllllllll
I even tried a few examples very carefully
@BalarkaSen ayy, I got an answer. it was really easy and I was being stupid
 
1 hour later…
03:12
@AkivaWeinberger Catalan numbers are dope.
@BalarkaSen yeah, they're pretty cool
@Semiclassical I still don't know a unifying combinatorial model for many of the times they pop up though. The most compelling one is the number of Dyck words (binary words such that at each truncation, the number of 1's is more than the number of 0's) of length n, but I don't know how that connects with the fact that the n-th Catalan number also counts the number of triangulations of a convex (n+2)-gon with numbered vertices.
Yeah
I mean, to some extent it comes down to "hurr durr recurrence relations"
The recurrence relation $C_{n+1} = \sum_{i + j = n} C_i C_j$ is mostly what's useful in proving Catalan numbers pop up.
ahhh sniped
lol
problem is that that usually feels more like a validation of them being counted by Catalan numbers, not an explanation
03:18
recurrence relations are BS
some sort of bijective argument is what you'd want I guess?
the generating function is a bit goofy looking too
yeah it satisfies a quadratic
$\displaystyle \sum_{n=0}^\infty C_n x^n = \frac{1-\sqrt{1-4x}}{2x}$
there is, naturally, a wealth of info on the wiki page: en.wikipedia.org/wiki/Catalan_number
03:20
@0celo7 :rolling_eyes:
We need Discord emojis here tbh
@Daminark why are you rolling your eyes at me
you might look at the various proofs they give in that article @BalarkaSen
"recurrence relations are BS"
03:21
might be able to piece together a bijective argument
they are
why do they work
you can't explain it
I'm pretty sure my combo prof can explain it so that's a start
I don't know what combinatorics is
@Semiclassical I went through them a while ago. There's a lot of info, but not much counting done.
I did some in high school but it was crap
03:25
Well, we've been jumping around a decent bit
We started off talking about hypergraphs, especially Steiner triple systems, and gave some examples where they arose
Oh speaking of your combinatorics prof, I need to pull out that Babai pset
Also I have to download his linear algebraic methods in combinatorics text
And in doing so we did some stuff like affine spaces, which related to the card game SET. Also projective planes (both as incidence structures and the specific case of Galois planes) have been a thing
Graphs, a bit of groups came up as well in the context of automorphism groups of graphs, and today he very quickly reviewed linear algebra and discrete probability
I imagine soon we're gonna be talking about spectral graph theory and some of the ways in which you use probability to talk about combinatorics
Dope course
I wish I knew more concrete stuff like that
Yeah I'm having a lot of fun in this class
@BalarkaSen next week
GR lecture to engineers and physicists
I'm debating trolling them or not
03:31
Very concrete
what is
GR for engineers
@Daminark Can you link me that Babai set again I can't find it
I might be able to state this theorem
His puzzle problems?
03:32
it's a good theorem
sadly quite long
Hey @Ted!
@Ted!!
Hi Demonark. Hi @Balarka. You saw my page earlier?
03:34
Yeah, but I didn't look at the question carefully. Let me go back.
$R = \Bbb Q^\Bbb N$ is a ring. The Cauchy sequences form a subring $R'$. Those that converge to zero form an ideal $I$ of $R'$. Then, $\Bbb R:=R'/I$ is a subquotient of $R$
($I$ is not an ideal of $R$ though)
@TedShifrin hi
Hi Leaky
$\Bbb R$ is a subquotient of $\Bbb Q^\Bbb N$
Hi @EricSilva. LOL at Mike's admonition about the "be nice" policy :P
03:44
Meanwhile $\Bbb{R} = \text{cauchy}(\Bbb{R}^{\Bbb{N}}) / I$ does not give anything new
@TedShifrin Had a look. So you simply proved that ambient isomorphism doesn't preserve the ring structure associated to the algebraic variety in the differentiable category, which is quite expected.
Without regular map there's no hope of having that.
Sure. But my question is: What does this strange notion of algebraic embeddingness really mean?
I don't think I've ever encountered it before.
I don't know what restriction a polynomial embedding poses on the differential geometry of the embedded submanifold, but Nash's theorem says it poses no restriction on the topology
No, no, no, no. He has a very rigid notion of embedding. The polynomial ring generated by the coordinate functions has to be the whole ring.
WTF does that mean?
03:48
It's obviously way stronger than what you and I think of as an embedding.
Ok, that makes it tenfold more interesting. I didn't catch that from a cursory reading of the question.
That was the point of my proof ... to show that you could by a global diffeo turn "embedded" into "non-embedded" (or vice versa).
Right right right
Because (t^2, t^3) eg is not an embedded curve by their definition
And neither is (t^2, t + t^3)
Well, $(t^2,t^3)$ isn't by ours either.
But the latter is.
True, that's got a singularity at 0.
03:55
(Unrelated) I wonder if it is possible to have some kind of notion of "remainder group" G' or "remainder ring" R' such that $G = G/N (some operator) N \cup G' and R=R/I (some operator) I \cup R'$ analogous to polynomial division. But then one obvious issue is that each equivalence class in the quotient objects may not necessary have the same number of members thus to recover the details before they are being quotiented, something more than I and R has to be "multiplied"
I can't follow what you typed, Secret.
ok let me try again. Recall in the ring of polynomials, we have this notion of division where given polynomial p and q where deg(p) > deg(q) then we can express p=qd+r where d and r are also polynomials
Yes, we have that in any Euclidean domain.
What I am thinking about is whether there exists some kind of generalisation such that given some abstract algebraic structure $A$, and something that is a sub algebra $B \subset A$, we can write $A=C * B + D$ where $C$ is obtained by taking some equivalence class on $A$ with the equivalence relation determined by B and then there is some "leftovers" $D$ (and * is some operator between two algebraic structures such that it "undoes the equivalence class").
Thus for the case of quotient groups, rings etc., C will become a trivial object so that A=C * B
No, I don't see that.
With quotients, the $C\cdot B$ stuff is the stuff that goes to $0$ in the quotient, and the $D$ stuff is what gives you the representatives of the elements of the quotient.
04:04
Ugh this paper uses # for cardinality
I used to do that, too, Demonark. Absolute value bars get way too much use.
Yeah that's fair
I guess I'm just used to absolute value bars
I think you're smart enough to adapt.
:O
But yeah in general I never find two people who use the same notation for anything so with time I'll probably just be juggling this anyway
I guess that question arises because I am wondering why in quotient groups Q=G/N, n must be a normal subgroup and then in quotient rings R/I, I must be an ideal. I knew that normal subgroups have the property that the left and right cosets are equal, but I don't really know what will happen if we have some Q'=G/H where H is a subgroup but not normal.
04:09
@TedShifrin Doesn't $\Bbb R[f(t), g(t)] = \Bbb R[t]$ imply $af(t) + bg(t) + ct = 0$ for some real constants $a, b, c$?
Using the analogy of division, I will expect there is some "leftovers" because quotient objects A/B sounds really like A can be "divided" by B in some general sense since every element is being binned into equivalence class and we only take one representative from it
A priori, I don't see why they're all constants, Balarka.
so for e.g. Q'=G/H it seems some elements of G get binned into more than one equivalence class but I don't know whether we can get some notion of "leftovers" from this somehow
@Ted I feel like a degree argument should do it. We know $t = F(f(t), g(t))$ for some bivariate polynomial $F(x, y)$... hmm.
The higher degrees might cancel, who knows
@Secret one can prove that "(gN)(hN)=(gh)N for all g and h" iff "N is normal"
04:14
Regardless, WTF does it mean?
@LeakyNun Yes I know, but what I am more interested and trying to understand is if we try to run the definition of quotient groups over something that is not normal. How does it gone wrong
Hello, guys. Please, take a look at this question if you can. It's pretty "basic" topology and doesn't require much prerequisites (just the definition of topology and nets convergence) math.stackexchange.com/questions/2734644/…
well then you would need to choose between taking left cosets and taking right cosets
You don't get a group, Secret.
but nothing goes wrong, provided that you don't try to define multiplication
04:16
Sorry, @Anderson, I don't do nets.
@TedShifrin Just think about it like sequences then. It's a pretty interesting question
Ah I see, so unlike in the case of polynomials, integers and more generally euclidian domains, trying to do A/B = {x,y in A, ~ in B | (x,y) in ~} when B is e.g. not a normal subgroup, not an ideal, not "divisible" will in general change the nature of the object thus there is no way to define something such that the formal expression "C = A/B * B + D" makes sense
@Anderson: I haven't thought about it much, but it seems like the usual argument that a basis for a topology gives you the topology you think it will.
@TedShifrin But I don't want "the topology", I want the "original convergence notion" :D
But that in essence is what's defining the topology.
Think in terms of closed sets, if you like, rather than open sets.
I guess I haven't fully understood why all 4 conditions are needed.
Maybe they're needed to make the argument I'm thinking of.
04:27
The question is, briefly speaking: I have a "good" convergence notion: a rule $\scr C$ on a set $X$ that says which nets converge to which points. This gives me a topology $T(\scr C)$. Then I can consider the convergence notion $C(T(\scr C))$ induced by this topology. The claim is: $C(T(\scr C))=\scr C$.
We could think in the question about topologies: i.e. $T(C(\tau))=\tau$, for any topology $\tau.$
One thing I don't really get is why we need the diagonal net
@TedShifrin The four conditions are needed in order to $T(\scr C)$ be indeed a topology. In fact, this is motivated because every convergence notion from a topology have these four as properties
I figured as much. Cool.
Note for instance that these four conditions does not guarantee uniqueness of the limit, so the topology $T(\scr C)$ might not be even Hausdorff.
Fair enough. Sorry, on the phone right now. I'll think about it more later.
04:33
Thank you, @TedShifrin. Don't need to say sorry!
hmm...
Zee
Zee
@BalarkaSen your answer was completely incorrect, you need to review your basic calculus
(a) If $x_i=x$ for each $i\in I$, then the net $(x_i)$ converges to $x$.
(b) If $(x_i)$ converges to $x$, then every subnet of $(x_i)$ converges to $x$.
(c) If every subnet of $(x_i)$ has a subnet converging to $x$, then $(x_i)$ converges to $x$.
(d) (Diagonal principle) If $(x_i)$ converges to $x$ and, for each $i\in I$, a net $(x^i_j)_{j\in J_i}$ converges to $x_i$, then there is a diagonal net converging to $x$; i.e., the net $(x^i_j)_{i\in I,\,j\in J_i}$, ordered lexicographically by $I$, then by $J_i$, has a subnet which converges to $x$.
(a) is basically constant nets analogous to constant sequences
(b) Reminds of Cauchy sequences
@Zee which answer
(c) Analogous to the sequence case
Zee
Zee
04:38
@BalarkaSen Lim Cos does not converge , you should know that
? I don't understand, where did I say it converges?
@Secret What I did up to now: suppose $(x_i)$ does not $\scr C$-converge to $x$ and let's try to show that $(x_i)$ does not $C(T(\scr C))$-converge to $x$. Note that for this we just need to find a sub-net of $(x_i)$ that does not $C(T(\scr C))$-converge to $x$.
Zee
Zee
@BalarkaSen as X goes to infinity
If $(x_i)$ does not converge, then by (c) there is a subnet of $(x_i)$ that does admit any $\scr C$-convergent subnet to $x$.
We can suppose this subnet to be the net itself (since we just want to find a subnet not $C(T(\scr C))$ convergent)
By $\mathscr{C}$ convergent, do you mean the convergence as defined by (a),(b),(c),(d) and by $C$ convergent, you mean the convergence as defined by that closure $\bar{E}$?
04:43
Then, this implies that there is some $i_0\in I$ s.t. $i_0\prec i\implies x_i\neq x$ (otherwise, we could construct a subnet constant to $x$, which by axiom (a) is $\scr C$-convergent to $x$. But $x_i$ does not have any $\scr C$-convergent subnet to $x$!)
@Zee If you can point me out to where the fact that $\lim_{x \to \infty} \cos(x)$ doesn't exist poses a counterexample to what I said (which is entirely possible), I'd appreciate if you point it out. If you're trolling, shove off.
@BalarkaSen How does that limit exists if the cos is the real function cos, since cos (x) will oscillate forever in [-1,1]?
@Secret $\scr C$ convergent is the given original convergence notion. $T(\scr C)$ the induced topology by $\scr C$ and then $C(T(\scr C))$ the usual convergence notion induced by a topology, in the case, $T(\scr C)$.
@Secret I wrote "doesn't exist".
Balarka: oops sorry misread
04:45
Np
= p
qed
So, in the end, if we suppose $(x_i)$ does not $\scr C$-converge to $x$, we can also suppose, possibly passing to a subnet, that $(x_i)$ does not admit any $\scr C$-convergent subnet to $x$ and that $x_i\neq x$, for all $i\in I$. But then...?
i see daminark's memes are influenced by dadaism these days
@BalarkaSen hint: ignore
I think if someone points out I have made a flawed argument I have a responsibility to be vigilant about it than ignoring the person who caught the error.
Now it's entirely possible that the opponent is trolling, which gets apparent quite soon.
04:50
Well, in this case $\{x_i\,:\, i \in I\}$ is not closed in the topology $T(\scr C)$ but I simply don't see how to get a subnet of it that does not $C(T(\scr C))$-converge to $x$... :'(
hi
can anyone tell me what is a degree function?
in a simpler way?
@BalarkaSen "I think if someone points out I have made a flawed argument I have a responsibility to"... right, except when the name of that "someone" starts with "Z" and ends with "ee"
LOL
I must say I can't argue with that
@TraLaLa context?
@LeakyNun It is in a solution,
04:52
@TraLaLa It depends on the context. It can be a function that measures the angle of the tangent vector of a curve with a fixed direction, for example
algebra
@TraLaLa where?
could you provide a text?
wait, i type it out
@TedShifrin See my messages above after, still about that convergence notion question.
R[F(x)] < R[G(x)] hence G(x) is not a factor of F(X)
@LeakyNun
04:55
ah, the degree of a polynomial
The 'R' was some weird symbol i can't type it out
Oh.......
So how do you prove it? @LeakyNUn
prove what?
*Prove
R[F(x)] < R[G(x)] hence G(x) is not a factor of F(X)
let G(x) be a factor of F(x)
so G(x) = F(x) Q(x) for some polynomial Q
I was thinking, perhaps if you put some numbers it will still be a factor of it
04:56
no, factor in the sense that the polynomial itself is a factor
not when you substitute numbers
one must distinguish between the polynomial $x^2+1$ and the function $x \mapsto x^2+1$
polynomials themselves can be added, subtracted, multiplied
when we say "3 is a factor of 6", we mean there is an integer n such that 3n=6
when we say "(x^2+1) is a factor of (x^4-1)", we mean there is a polynomial Q such that (x^2+1)Q = x^4-1
ok,thanks
@LeakyNun I think you mean $F(x)=G(x)Q(x)$, right?
@AndersonFelipeViveiros right
I think it's easier for me to think of a $(x_i)$ such that it diverges yet it contains at least one subnet $(y_i)$ that converges. For example, take the graph of the function $x \sin x$ as $(x_i)$ and pick the values which form the harmonic sequence in descending order to make $(y_i)$. Then (c) is still violeted and there are some neighbourhoods in the induced topology that it fails to converge
what if the question is like, find all integer values for \frac{F(x)}{G(x)}
and you know R[F(x)] < R[G(x)]
05:00
well that's a different question
and that is solved using GCD
@LeakyNun Can you help me with this problem? Wait, I type it out
$F(x)=(x^2+4x)^{p-2}(x+2)(x^2+4x+8)$, and $G(x)=(x+4)^{p-2}(x)^{p+2}-1$
Prove that there are no integer values for \frac{F(X)}{G(X)}
@Secret But we don't know if "$x \sin x$ diverges". It depends on the given convergence notion, no?
ah right, I am thinking too much about real numbers
This is the main difficulty: we don't have any idea of what convergence notion it is. It just satisfies (a), ..., (d).
:D
Remind me how the induced topology convergence notion is defined, is it just in terms of neighbourhoods?
05:06
@TraLaLa what have you tried?
I don't know how
It was part of a bigger problem
@Secret Yes, given any topology $\tau$, you can define the usual convergence notion $C(\tau)$: $\forall U\in \tau, x\in U, \exists i_0\in I\,:\, i_0\prec i\implies x_i\in U$.
I've solved the other parts and this is the part that i cannot solve
@TraLaLa maybe you could give us the full context once-and-for-all?
it's like the fourth time I've asked you for more context
Every notion defined like this has (a),...,(d) as properties.
05:10
hmm so that means (a),(b),(c),(d) should give us all the neighbourhoods and open sets of $T(\mathscr{C})$, which should since we are dealing with nets here not just sequences. Let me think...
@LeakyNun
$F(x) = (x+4)^{p-2} x^{p-2} (x+2) (x^2+4x+8)$, $G(x) = (x+4)^{p-2} x^{p-2} x^4 - 1$
one can prove that $0 < F(x) < G(x)$ for large enough $x$
so F(x)/G(x) is not an integer
@Secret Yes, they do. We don't work only with sequences because this restricts the possible topologies. In fact, it works if the topology obtained is metrizable.
@LeakyNun Ok thanks
(a) is the trivial case since any constant net (x) will always converge for any topology since x will be contained in at least one neighbourhood U
05:14
Not at least but any, no?
I mean, any neighborhood $U$ of $x$ contains $x$, by definition.
Ah right, I mixed up open sets with neighbourhoods, because I like to work with open sets in the past
(b) is like the generalisation of Cauchy sequences, thus it makes sense that for these nets, all their subnets converge to the same point(s)
(c) is kinda like the reverse of (b), in fact, it feels like the subnets form closed sets thus their union will also be closed for these nets with the same limit points
So that leaves (d), which kinda reads like each element in the net has some nets $(x_j^i)_{j \in J_i}$ that converge to them and induced by a family $\{J\}_i\in I$, and thus we can just take one representative from each of these and form a net which is then guarantee to have a subset that converges to the same point
But why is this necessary, what kind of neighbourhood it defines, and isn't such diagonal nets already included in (b)?
Maybe it is not necessary. It is there just because convergence notions induced by topologies have this as properties, not axioms.
Since what you try to prove is $C(T(\mathscr{C})) = \mathscr{C}$, it means if some $(x_i)$ is not $\mathscr{C}$ convergent, then $(x_i)$ will not be $C$ convergent as well (likewise, if $(x_i)$ I $\mathscr{C}$ convergent, then $(x_i)$ will be $C$ convergent). Thus your counterexample should be set up as some $(y_i)$ such that it is $C$ convergent but not $\mathscr{C}$ convergent (and vise versa)
For example, suppose I say: a net $(x_i)\subset \Bbb R$ converges to $x\in \Bbb R$ if $x_i$ is even, for all $i \in I$. This is not what we would like to call a convergence notion, since the constant net $x_i=1$ does not converge to $1$.
So (a),...,(d) are reasonable conditions for a definition of convergence notion.
Ah right, so (d) kinda ensures all constant nets will converge
05:28
(a), right?
yup
so dropping (d) will probably mean there are constant sequence (i.e. points) that the only neighbourhood is the whole set
which is indeed very strange but still sound, but I digress
But anyway, I think your counterexample need to begin with a sequence such that (x) is C convergent but not $\mathscr{C}$ (and the reverse), instead of starting with (x) that is not $\mathscr{C}$ or $C$ convergent
Well, I have to go now. Thank you for the discussion, @Secret. If you have some idea, please, answer in the question link! (am thinking about starting a bounty, maybe)
because the proof means the convergence properties are preserved by the two topologies, so picking some (x) that is not convergent and then trying to prove whether it converge in another topology won't work since it can converge (if the counterexample exists) or not converge
05:53
Hmm... the definition of $\bar{E}$ pick out the nets in $E$ such that these nets converge in the sense that for all neighbourhood of x, $(x_i)$ will $C$ converges. Then (a) satisfies trivially, (b), (c) also satisfies by the definition of $C$ convergence in a net (thus BSc forms an iff condition). finally since every $x \in \bar{E}$ has some net $(x_{ij})$ $C$ converge to them, then we can by axiom of choice, pick one representative from each of these $(x_{ij})$ in descending preorder
to form the net $(x_j^i)_{j \in J^I}$. Then it must have a subset that converges to x. Thus (d) is satisfie
1
Q: Two topologies coincide if they have the same convergent nets

KikoThere are many similar questions to mine in the site, but I'm still not sure. Let $X$ be a vector space with $T_1$ and $T_2$ two topologies that make $X$ a TVS (Hausdorff). If I want to show that $T_1=T_2$, does it suffice to show that every converegent net $(x_{\lambda})_{\lambda}$ in $X$ to som...

autocorrect error BSc -> b, c
06:09
@MatheinBoulomenos bist du hier?
how hard is it to prove that if A^m -> A^n is injective then m<=n?
I mean, just hints please
I mean, no hints please
I heard it needs homological algebra
I wonder if I know enough homological algebra to do it
A is a ring
is A infinite?
there are rings A such that A^2 is isomorphic to A
as modules, I mean
06:12
I also meant as modules
I don't believe you
Is A isomorphic to A^n possible if A is finite?
0
A: A ring without the Invariant Basis Number property

genepeerThe way the question is posed, it seems implied that we can use the first part to prove the second. But that is impossible as far I can tell: the induced composition $R \cong R^4$ is not $R$-linear. However, the first isomorphism can be made $R$-linear by using the following structure: $\alpha...

you need some assumptions on A
okay maybe the linked question is not the best explanation
could you spell the ingredients out?
I don't see how A^m -> A^n can be injective for m>n if A is finite, but if A is infinite then by cardinality alone I can see how. However, if you want it to be an injective homomorphism, then I am not sure yet
06:19
@LeakyNun well you can do it for vector spaces so...
@AlessandroCodenotti so...?
evne if A is infinite?
@MatheinBoulomenos because I suspect they're defining a new structure on R^4
so that it isn't really R^4 anymore
haven't read the whole thing though
I don't want to write everything out right now
In mathematics, more specifically in the field of ring theory, a ring has the invariant basis number (IBN) property if all finitely generated free left modules over R have a well-defined rank. In the case of fields, the IBN property becomes the statement that finite-dimensional vector spaces have a unique dimension. == Definition == A ring R has invariant basis number (IBN) if for all positive integers m and n, Rm isomorphic to Rn (as left R-modules) implies that m = n. Equivalently, this means there do not exist distinct positive integers m and n such that Rm is isomorphic to Rn. Rephrasing the...
@MatheinBoulomenos but
06:27
@LeakyNun I wanted to quotient by a maximal ideal of $A$, but I don't think that works now
AM says, if R^m surjects to R^n, then m >= n
by quotienting by a maximal ideal of R
since tensoring preserves surjectivity
@LeakyNun you should have said that your rings are commutative ...
@MatheinBoulomenos OH!
sorry :P
06:28
@MatheinBoulomenos All rings are commutative!
@MatheinBoulomenos and then?
In mathematics, more specifically abstract algebra and ring theory, a noncommutative ring is a ring whose multiplication is not commutative; that is, there exists a and b in R with a·b ≠ b·a. Many authors use the term noncommutative ring to refer to rings which are not necessarily commutative, and hence include commutative rings in their definition. Noncommutative algebra is the study of results applying to rings that are not required to be commutative. Many important results in the field of noncommutative algebra area apply to commutative rings as special cases. Although some authors do not assume...
¯_(ツ)_/¯
@LeakyNun this is not an easy result and I don't know any simple proof
@MatheinBoulomenos my prof said one needs homological algebra
there's a proof that uses exterior algebras and there's a proof that reduces it to the Noetherian case via Hilbert's basis thereom
06:37
:o
none of these two proofs uses homological algebra
these are the proofs I know
maths vs leaky nun
2
1 - 0
2
I learned this results with the proofs I mentioned from "Lectures on Modules and Rings" by Lam, in the chapter on free modules
$\Bbb{R}^n \to \Bbb{R}$ can be bijective, e.g. preimage of Hilbert space filling curves
no clue how to use homological algebra
@Secret we're talking about linear maps here
06:41
ah I see
ok nvm
what do we know if R^m continuously bijects to R^n?
@MatheinBoulomenos
I'm quite sure that this implies that m=n and the proof is algebraic topology, but I don't know how to prove it
Hey guys!
@LeakyNun if you learn the homological algebra proof from your prof, I'd be interested to hear it
Hey @Daminark
What's up?
06:57
I'm enjoying the last few days of slacking off before the semester starts
How's it going for you?
Nice, have fun while you can :P
It's quite busy but it's nice
Right now I'm trying to get through a bit more of GMT, after that I'll read up on splitting fields a bit
Yo, how's it going?
Pretty well
You?
Doing well, thanks!
07:45
If $f$ is periodic, $g$ is polynomial function, $f(g(x))$ is periodic, $g(2)=3$ and $g(4)=7$, then $g(6)$ is?
(Could you give me any hint about it @LeakyNun ?)
no idea
Okay
If anyone has any idea about it, please let me know.
I suspect you can prove that if $f(g(x))$ is periodic, then $g$ must be of the form $g(x)=ax+b$, which would give you $g(6)=11$.
So focus on proving the first part.
@DawoodibnKareem Why should g be of the form $ax+b$?
Well, think about what it means for $f(x)$ to be periodic.
Use the definition of periodic.
Think about what the period of $f$ might be, compared to the period of $f\circ g$.
08:27
Hi people
Somone knows for sure if parition unitary implies second countable?
partition*
08:50
@user17629 What does partition unitary mean?
0
Q: Does partition of unity implies second countable?

user17629Reading the definition of partition of unity: Let $A\subset \Bbb R^n$ and let $\mathcal{O}$ be an open cover of $A$. Then there is a collection $\Phi$ of $C^\infty$ functions $\varphi$ defined in an open set containing $A$, with the following properties: For each $x \in A$ we have $0 ...

Ohhhh, I see.
Well, partitions of unity are defined here for subsets of $\Bbb R^n$, and any subspace of a second-countable space is second-countable.
Unless what you mean is, if an arbitrary space (or arbitrary Hausdorff space, or something) has partitions of unity, is it second-countable? That I'm not sure of.
Right, but partition of unity allow us to extend local properties to global ones, this help us to contrust topological spaces, but no every topological spaces need to be second countable.
@Fargle Yeah, I meant exactly that, sorry if I did not put it on a fully context.
It's no problem. I'll have to do some serious thinking on this one.
Ah--it seems the implication doesn't always hold.
The real line under the lower limit topology (Sorgenfrey line) is paracompact Hausdorff, and therefore has partitions of unity, but it fails to be second countable.
@Fargle I see. Then, if we suppose that a Hausdorff space has paritions of unity, how should I proceed in order to build second countable for that space?
09:07
You could assume compactness and metrizability, that would guarantee second-countable.
@Fargle I know, but I do not want to assume anything, actually I am trying to build piece by piece a hausdorff, second-countable mtrizability manifold.
In this comment says that if we assume paracompactness we should not ask for second countable math.stackexchange.com/questions/1530035/…
@user17629 I think what that comment means is that you can still do partitions of unity without demanding that your space be second-countable, as long as you assume Hausdorff, paracompact, and locally Euclidean. However, you don't get metrizability unless you have second-countability, as the Sorgenfrey line is an example of a Hausdorff, paracompact, locally Euclidean space which fails second-countability.
And isn't metrizable as a result.
Or, no, wait, I may have some details wrong here. Ignore me for a sec.
Alright..
What definition of manifold are you using? Just a locally Euclidean Hausdorff space?
Locally compact space implies locally Euclidean, and I am not assuming compactness.
09:22
The implication goes the other way. In fact, there are second-countable locally compact Hausdorff spaces which fail to be locally Euclidean.
4
Q: Is there a locally compact, locally connected, Hausdorff and second countable space that is "nowhere locally Euclidean"?

Ti WenWhen I study topological manifold, I think some property of manifolds are so important that they can "almost characterize" manifolds. But I know a topological manifold is not easily to be characterized because of its locally Euclidean property. I want to find a "weird" example of a locally compa...

you totally right
As for how to answer your question, I'm not entirely sure. I admit I'm a bit out of my element here.
Thanks for the link, by the way, this at least will help me to avoid some mistakes.
@DawoodibnKareem I didn't get you... Sorry.
No problem.
09:28
Function is "inverse of itself" means $f(f(x))= x$, Please verify.
Yes, that's right, but not relevant to your problem, as far as I can see.
@DawoodibnKareem I am solving different problems right now.
10:15
natural things tend to have a normal distribution. Is it the same if we asked people to choose a number from a given range of numbers.
I'm thinking most probably uniform....?

« first day (2809 days earlier)      last day (2509 days later) »