« first day (2950 days earlier)      last day (2367 days later) » 
01:00 - 22:0022:00 - 00:00

01:20
@Li357 insofar as what you're proving is the negation of a proposition, yes. (the negation of a proposition is itself another proposition.)
@Rudi_Birnbaum shudder degenerate perturbation theory
(first-order degenerate perturbation theory isn't so bad. but anything higher order than that is all kinds of miserable)
01:56
@Semiclassical Okay thanks. I'm new to formal proofs and all. Can I use a theorem (like in latex) to describe a statement I later disprove?
02:17
No, you’d reserve that for a proposition that you prove to be true (or cite a source for). Depending on the context I’d suggest calling it a conjecture which you subsequently disprove. Alternatively, you could pose the negation as the proposition of interest; once proven, this negation would be a theorem. @Li357
For example:
Conjecture: For any nonnegative integer $n$, the integer $2^{2^n}+1$ is prime.
Proposition: The integer 2^{2^5}+1=4294967297=641*6700417 is not prime.
Theorem: There exists a nonnegative integer $n$ such that $2^{2^n}+1$ is not prime.
Listen to me
if you want to know maths
02:36
@Semiclassical Okay, thanks again. I'll go with conjecture.
If I have a positive definite matrix A and I add a semi-positive definite matrix B = xx' to it. So C=A+B. Is it C horizontal translation of A?
 
3 hours later…
05:17
@Semiclassical Hm, maybe. For the one it simply depends upon the convergence radius and behaviour of the perturbation series in general. But moreover the form of the equations simply differ for the degenerate and the non-degenerate case of the eigenfunction space.
05:45
@Daminark did you see my message?
Yeah I did, and I'm checking it out now, thanks! @Leaky
Milne is easier to read than Neukirch for sure...
I would agree with that
 
1 hour later…
06:50
hello
is it right to prove the linearity of $ u: \mathbb{R}^2\to \mathbb{R}$ defined by $ u(x,y)= \sqrt{2} x+y$
by
let $x_1,x_2,y_1,y_2\in\mathbb{R}^2, u(x_1+x_2,y_1+y_2)= u(x_1,y_2)+ u(x_2,y_2)$
the definition of bilinearity do not work how to do?
@LeakyNun good morning, have you an idea please?
4 mins ago, by Poline Sandra
let $x_1,x_2,y_1,y_2\in\mathbb{R}^2, u(x_1+x_2,y_1+y_2)= u(x_1,y_2)+ u(x_2,y_2)$
yes
1 min ago, by Poline Sandra
the definition of bilinearity do not work how to do?
no idea what you mean
Linearity dies not exists
> Universe implodes as all linear algebra fails
07:05
what I know that when $u: \mathbb{R}\times \mathbb{R}\to \mathbb{R}$ we speak about bilinearity which is linearity on each component
but the conditions of bilinearity do not work here
@LeakyNun
@PolineSandra bilinearity is completely irrelevant here
can you explain me more
please
18 mins ago, by Poline Sandra
is it right to prove the linearity of $ u: \mathbb{R}^2\to \mathbb{R}$ defined by $ u(x,y)= \sqrt{2} x+y$
you asked about linearity, so stick with linearity
here's the deal
if $U, V, W$ are vector spaces
you can talk about a map $U \to W$ being linear
or a map $U \times V \to W$ being bilinear
in the latter case, we do not put a vector space structure on $U \times V$
but in your question we are treating $\Bbb R^2$ as a single vector space
here's the deal
if $U$ and $V$ are vector spaces
then $U \oplus V$ is also a vector space
and you can talk about maps $U \oplus V \to W$ being linear
but when we talk about a map $U \times V \to W$ being bilinear, we are not thinking about the vector space $U \oplus V$
all that $U \times V$ and $U \oplus V$ have in common is the underlying set
"A map $U \oplus V \to W$ being linear" belongs in one category
"A map $U \times V \to W$ being bilinear" belongs in another category
just don't cross the borders of the categories
and you'll be fine
then here $\mathbb{R}^2 =\mathbb{R}\oplus\mathbb{R}$
correct
07:18
where I can find all this explication?
by asking me
I say in internet there is no course or something like this?
we don't need in the definition the $\lambsa$??
is there anything you don't understand?
no I understand but I want to see more about this
about what?
also, what $\lambda$?
07:27
in the standard linearity $f:E\to R$ we say that it is linear off for all $\lambda,\mu\in \mathbb{R},\forall x,y\in E, f(\lambda x+\mu y)= \lambda f(x)+ \mu f(y)$
ok, then what do you mean by we don't need it
$x_1,x_2,y_1,y_2\in\mathbb{R}^2, u(x_1+x_2,y_1+y_2)= u(x_1,y_2)+ u(x_2,y_2)$
we just write this
who just write this
then it's wrong
btw what is your native language?
07:31
French
alors parlez moi en francais
ol
ok
eat ce qu'on n'a pas besoins des scalaires $\lambda$ et $\mu$
comme dans la linéarité standard
@LeakyNun
oui
Une application $U \to W$ est linear si $f(x+\lambda y) = f(x) + \lambda f(y)$ pour tous $x, y \in U$ et $\lambda \in \Bbb R$
$U \times V \to W$ est bilinear si $f(u_1 + \lambda u_2, v) = f(u_1, v) + \lambda f(u_2, v)$ et $f(u, v_1 + \lambda v_2) = f(u, v_1) + \lambda f(u, v_2)$ pour tous $u_1, u_2, u \in U$ et $v_1, v_2, v \in V$ et $\lambda \in \Bbb R$
d'accord?
@PolineSandra
mais moi j'ai lineaires avex deux composantes
07:47
ils sont equivalents
$f:U \times V \to W$ est bilinear si
1. $U \to W : u \mapsto f(u,v)$ est linear pour tous $v \in V$, et
2. $V \to W : v \mapsto f(u,v)$ est linear pour tous $u \in U$
d'accord? @PolineSandra
ok pour ca et comment introduire le scala
introduire le scalaire dans la definition que j'ai ecrite
$x_1,x_2,y_1,y_2\in\mathbb{R}^2, u(x_1+x_2,y_1+y_2)= u(x_1,y_2)+ u(x_2,y_2)$
cette definition est mauvaise
ou bien incomplete
ok alors comment montrer que u est lineaire
58 mins ago, by Poline Sandra
is it right to prove the linearity of $ u: \mathbb{R}^2\to \mathbb{R}$ defined by $ u(x,y)= \sqrt{2} x+y$
1 min ago, by Poline Sandra
$x_1,x_2,y_1,y_2\in\mathbb{R}^2, u(x_1+x_2,y_1+y_2)= u(x_1,y_2)+ u(x_2,y_2)$
07:52
c'est une moitie de la preuve
l'autre moitie est montre que $u(\lambda x, \lambda y) = \lambda u(x, y)$
ah ok merci beaucoup
hi @loch
08:06
[Random]
$M_D \equiv (M,\cdot) = \langle M,0,1,q,\cdot,[,],(,,)\rangle$
Let $\cdot$ be adding term and $*$ be removing term

 Mathworks (Not the main chat!)

Maths department of SecretLabs SE Branch (chat.stackexchange.c...
Mathworks does sound like the main chat, lol.
@JasperLoy hai-lam-oe ga min-nam-oe u hun-biet bo?
it gets even more confusing when you realise Mathworks is the company name that makes Matlab
@LeakyNun They are very different. They are not mutually intelligible. In fact, most Chinese dialects are not mutually intelligible.
08:10
but all Matlab questions are concentrated in Stack Overflow since there isn't a MAtlab stack exchange
Hi @LeakyNun
@JasperLoy li ji e-hiao gong jit-jung, ia-si lng jung lung e-hiao gong?
how goes @loch
also, that's an interesting way to prove the uniqueness of projections in U perp that does not require too much "let x be an element in a set, show that stuff lies in the intersection"
@Secret what is it?
your proof in the mathworks chat
on vector space stuff
08:12
oh, i misread "that's" as "there's"
@LeakyNun I only know a little Hokkien, but I don't know any of the other dialects. Of course I know Mandarin.
> in particular, the room focuses on new ways and thinking to approach old and new problems.
2
that's why I set up Rambles to not pollute that room
@loch this paper's tendency to treat empty or zero objects as a special case is beginning to be annoying
in particular, they talk about "the zero vector space and free modules", "maximally linearly independent set exists because the torsion module is zero", ...
well, you have to deal with zero objects carefully, since they always behave differently from nonzero objects
@LeakyNun I am very particular about the empty set and zero and stuff like that. When I write theorems and proofs, I make sure that they take care of the empty set and zero appropriately.
08:15
but in this case they don't have to treat it differently
Paul Halmos and Bourbaki are also very particular in this area.
well to a constructivist like me, it's extremely annoying
when a theory applies uniformly regardless of whether it is zero, don't divide it unnecessarily into two cases
is what I think
I had some fun on the Interpersonal Skills SE. The site is still in beta.
also, Bourbaki isn't the bible
that's totally irrelevant
dies
08:18
I don't read Bourbaki cover to cover. The level of generality is not compatible with other books, and they only cover a small fraction of math branches.
I think the most readable Bourbaki book though would be General Topology I and II.
a borderline example would be proving $a_n \to a$ implies $ca_n \to ca$
by "borderline" I mean, I don't know if I should divide it into two cases
But the strange this is that they define compact spaces to require them to be Hausdorff as well.
proof 1: if $c = 0$ then it's trivial, otherwise take $\varepsilon' = \frac1c\varepsilon$
cookies to whoever can prove this without excluded middle
I think the French versions of Bourbaki are the most up to date, and there have been books added in recent years.
@LeakyNun completely stuck on some things, but otherwise not too bad
i think it's a good practice to mention that if it's empty/zero then it's obvious etc. so may assume that it's non-zero blablabla
08:21
but it's not good practice if the excluded middle turns up complicating the proof
it's not good practice to pretend that linearly dependency for {} is undefined
3
i didnt read your link
lol
but eg i think :46535436 is fine
the context is modules
sure, since I explicilty said it's a borderline example...
{} is linearly independent, right? cause there is no element u to have au=0?
yes
I mean, it's annoying because to me it seems like the author is not comfortable with zero objects
@LeakyNun i understand that feeling
08:25
but im not sure whenever i encounter this feeling is due to "tendency to treat empty or zero objects as a special case"
How I would write it:
We assume that $M_{tors} = \{0\}$, and find an [injecitve] linear map from $M$ to a free module, so that Prop 2(1) will imply that $M$ is free.
We let $(x_1, \cdots, x_n)$ be a generating set of $M$. We let $(y_1, \cdots, y_m)$ with $m \le n$ be a family of elements taken from $\{x_1, \cdots, x_n\}$ with $m$ maximal such that $(y_1, \cdots, y_m)$ is $A$-linearly independent. That such a family exists is because $\{\}$ is linearly independent.
@loch to be rude, it's annoying because it feels like the author is incompetent
@Enigsis hi
hello
08:30
sure i think your proof reads more nicely

i think the point is that in that proof the author adds unnecessary details which distracts the reader from following the logic of the proof
I think the author doesn't understand the importance of proofs / doesn't know much about proofs
Have you studied two careers at the same time?
i think that's an overstatement
@loch I sometimes feel that with Spivak's Calculus Book. But, many hours later I understand it
@loch well I think the author added the details because he can't deal with zero objects
I think in his head, "the zero-module is free" is undefined
08:33
zero is an element
@Enigsis you mean, you understand the proof, or you understand why Spivak puts those unnecessary details?
I mean, When I see the problem for the first time, I think that some details are unnecessary, but, then I realize why he added that
I don't see any point in my case
Well, I really don't know about that, but, probably for rigor
and clarity
08:38
some people avoid zero objects and infinite objects like the plague, while others embraced them like the finite objects
13 mins ago, by Leaky Nun
user image
11 mins ago, by Leaky Nun
How I would write it:
We assume that $M_{tors} = \{0\}$, and find an [injecitve] linear map from $M$ to a free module, so that Prop 2(1) will imply that $M$ is free.
We let $(x_1, \cdots, x_n)$ be a generating set of $M$. We let $(y_1, \cdots, y_m)$ with $m \le n$ be a family of elements taken from $\{x_1, \cdots, x_n\}$ with $m$ maximal such that $(y_1, \cdots, y_m)$ is $A$-linearly independent. That such a family exists is because $\{\}$ is linearly independent.
let's focus on this case
what is the context upto that point?
proving that finitely generated torsion-free modules over PID is free
@loch also the author tries very hard to avoid the splitting lemma lol
I mean, I understand why the author would do that, but it's so unsatisfying
hi @Mr.Xcoder
hi @Leaky
@Mr.Xcoder my productivity has been very low this month
primarily since it's holiday
08:52
My productivity has been quite high, on the opposite side of the coin.
You'll never guess what my parents bought me for my birthday :)
you mean bought
and what?
A whiteboard... 🤣
cool
I would like a blackboard at home, not a whiteboard.
08:54
blackboard too dirty
buy one
We had both whiteboards and a blackboard in my flatshare this year, the former is much better to use at home
I love chalk and hate markers.
chalk too dusty
Markers smell and dirty your hands too.
08:56
Yeah I prefer whiteboards too... I'm happy that we were actually able to make it fit in the house :)
I guess there is also cheap chalk and expensive chalk.
@LeakyNun Are you enjoying your studies?
i'm still in holiday
so I don't really know if I should be studying
I'm studying with very low producitivtiy
Oh OK.
I found a very nice, simple word processor recently. It doesn't have too many features but will suffice for most people. It is called Able Word, downloadable from ableword.net.
If you don't need the full features of Microsoft Word and think that LibreOffice Writer is too ugly and not polished, then try Able Word.
> It is called Able Word, downloadable from ableword.net
Hmm, to me LibreOffice is beatiful. Google Docs is good too (But it doesn't have so many features like desktop versons)
09:05
downloadable
Oh I see what you mean, lol.
Lol, AbleWord doesn't have Linux version
@Enigsis I see. I would prefer WPS Office to LibreOffice. It is more polished and looks almost like Microsoft Office.
disables linux
@Enigsis Yeah, sorry, Able Word is only for Windows, and WPS Office for Linux is only in beta.
09:08
WPS Office Free have all the features?
Able Word can't type equations or draw geometrical figures, but WPS has all that and more.
@Enigsis Yes, full of features. But the Linux version might have slightly less features.
WPS used to be called Kingsoft, and now it is downloadable from wps.com.
I think it is very popular in China, and got some sponsorship from the government there.
Hmm, I'll give it a try
Now I have tried a few more free suites, but none work as well as WPS.
09:37
hello @LeakyNun please help me on this integral
$\int_{-1}^{1}|x^n| dx$
how to delete the absolut value
Consider $x^n$ for different sub intervals of $[-1, 1]$.
i must write (-1)^n x^n on -1 to 0
or - x^n
please
yesterday, by mercio
chat has been taken over
Nov 17 '11 at 9:11, by t.b.
"if on closer inspection the conversation is all towards the shallow end of the pool, with moderately difficult questions going unanswered, then a Help Vampire infestation is likely."
not to mention very boring
t.b. was a master teacher
(not to mention the inventor of the "mean square" :)
who exactly are you before you get the user1732 designation?
You seemed to speak like skullpatrol except you are not him
09:50
i am both
ah right
Oct 23 '11 at 13:51, by t.b.
@robjohn: you're mean squared :p
almost 7 years ago
@anon shows up less and less :(
10:18
he does
and other maths mods are not very active either
10:30
someone has been going through my questions (some of them a week old or more) and downvoting all of them
is that allowed?
im guessing it was one person because each question has been downvoted once and all the downvotes ocurred within 2 or 3 minutes
@Pablo that is not allowed and will be reversed tomorrow
@PolineSandra I also took a look at your question. Did you get the explanation in the answers?
11:32
[Random]
$M_D \equiv (M,\cdot) = \langle M,0,1,q,\cdot,[,],(,,)\rangle$
Let $\cdot$ be adding term and $*$ be removing term
$[x,0]=x \cdot \lor * x$
$[x,1]=\cdot 1 \lor 1 *$
$[0,q] = *1\cdot 0 \lor * 0 \cdot 1$
$(1,x,y) = * 1 \lor \text{id}$
$(x,1,y) = * 1 * \lor \cdot 1 \cdot$
$(x,y,1)=* 1 \lor \text{id}$
$(0,x,y) = \text{id} \lor *x*$
$(x,0,y) = \cdot x \lor * y$
$(x,y,0)=*y* \lor \text{id}$
$(0,q,x)=1*(0q)\cdot \lor \text{id}$
$(q,0,x)=*x \lor \text{id}$
$(x,0,q)=x \cdot \lor \text{id}$
$(x,q,0)=*(q0)\cdot 1 \lor \text{id}$
Are you using here as a notebook @Secret? :)
nope
those are copypasta from the notebook
there's no one here and I am so bored, as well the calculations in chemistry are not workin
What do you study in chem?
I am a PhD in chemistry, doing research on catalysts
You're also interested in math, I suppose.
11:38
I am, mostly in general topology, infinite sets and some abstract algebra
If you're bored, can we talk about De Morgan's duality laws?
$\neg (A \land B) = \neg A \lor \neg B$?
I think yes but in a different notation. Let me write it.
$S-\bigcup\limits_i A_i = \bigcap\limits_i (S-A_i)$
what about it?
I'm not sure but with a family of (possibly infinitely many) sets, it gets convoluted.
I'll be back in 10min.
11:48
22
Q: De Morgan's law on infinite unions and intersections

JasonMondWhile going through Probability: Theory and Examples by Rick Durrett (4th edition, p.9), I came across the familiar definition of $\sigma$-algebras where, if $A_i \in \mathcal{F}$ is a countable sequence of sets for some $\sigma$-algebra $\mathcal{F}$ and $\cup_i A_i \in \mathcal{F}$ by definitio...

my logic still sucks
12:18
Actually no, that $M_D$ is all wrong. The brackets and what x,y are matters, so we still need to run through all 27 associator base cases to completely characterise the magma
12:58
Commutators and associators sure are useful to keep track of nonassociativity and noncommutativity
My guess is that one way to set the parameters will give us an idempotent nonassociative magma
As we can see here, the main reason associativity in division by zero magma is broken is because there are associators that maps one element to another directly, instead of simply appending elements
i.e. entries like 1->0, 1->q
actually typo: Not flexible
13:19
So yes, you can divide by zero, and one possibility is a unital magma with a unique identity
typo: replace $*q$ with id
It actually surprised me that the nonassociativity is quite localised at q
This seemed to give us some hopes that division by zero ringnoids will be more interesting
All division by zero magma has this period 2 orbit formed by the commutator [0,q] which is the reason of the nonassociativity. Likewise, 3 associators (0,0,q), (0,q,q),(q,0,q) cycles between the 3 elements in this particular unital magma example
13:59
@Secret I think I completely got it. Not sure how the answer in the question explain it though.
The De Morgan's law, I mean.
I think basically, it's how negation interacts with universal quantifier, thus the negation of "there exists x such that P(x) is true" becomes "for all x, P(x) is false"
thus cardinality does not matter
x is in the union of something if it is in at least one member of the union
$S=\{a_1,a_2,\dots,a_n,b_1,b_2,\dots,b_n\}$, $\bigcup\limits_i A_i=\{b_1,b_2,\dots,b_n,
c_1,c_2,\dots,c_n\}$ olsun. $S-\bigcup\limits_i A_i=\{a_1,a_2,\dots,a_n\}$'dir. Biliyoruz
ki, $A_i\subseteq\bigcup\limits_i A_i$. Yani $S-A_i\supseteq S-\bigcup\limits_i A_i$.
Ve ayrıca $(\forall k\in\{1,2,\dots,n\})\, (\exists i)\, b_k\in A_i$. Bu demektir ki,
$\bigcap\limits_i (S-A_i)=\{a_1,a_2,\dots,a_n\}$.
What you've said finishes proof in the second last line. @Secret
14:16
i cannot read that non english, but sure
The connectors are important but not deadly.
What is your native language by the way?
cantonese
maybe \cdot?
How do I show that the sequence $f_n(x)=x^n$ does not converge to any other polynomial in the space of polynomials defined on $[0,1]$ with the norm given by $\sup\|\cdot\|$ (supremum of the absolute value)?
@AbdullahUYU I guess yani means "meaning" or "therefore"?
14:30
Thank you, @AbdullahUYU
that's what it means in Hindi at least :)
@AndersonFelipeViveiros you're welcome. @Soham Yes, exactly.
Or simply, "so".
happy mathematical saturday, all.
1 hour ago, I have successfully divided by zero
 
1 hour later…
16:07
hi @loch
ugh, this structure is boring
meanwhile none of the chemistry calculations are working
it has been a long day
hi @LeakyNun
17:01
Ok I have a kind of silly doubt.
Given a person can answer 9 out of 10 questions correctly. If we give him 10 questions what is the probability that he will answer all 10 of them correct?
I think it should be (9/10)^10
But I was reading a question today and it solved it something like this.
9/10*8/9*7/8...... which will eventually be 0. So what will be the correct method?
 
3 hours later…
19:45
3 hours ago, by prog_SAHIL
Given a person can answer 9 out of 10 questions correctly. If we give him 10 questions what is the probability that he will answer all 10 of them correct?
if he answers 9 out of 10 questions correctly and you give him 10 questions, then he obviously answers 9 correctly :P
20:39
Why the upper cone is not a smooth surface?
i know it has a problem at the peak but how do i write it rigorously
1
Q: What is a smooth surface?

sagarWhat is a smooth surface in terms of tangents and normals? I read in a book that surfaces are smooth if its surface normals depend continuously on the points of that surface. I did not understand this definition, could somebody simplify it for me?

Ways to prove it : 1)To be a smooth surface there must exist at tangent plane for every point.Why is does not exist a tangent plane in the peak ( taking arbitrary curves)
Can we talk it . I read the answers from 3 different posts
there are ways to approach the proof.
One is that tangent plane cannot be defined
I'm not the right person to ask.
ooh ok
with what do you work leaky nun?
if you approach the tip of the cone from different directions, then the surface normal will depend on which direction you approach from
20:46
@Semiclassical I have an E&M question for you :P
but that means that the limit of the surface normal as you approach the tip doesn't exist and therefore the surface normal doesn't vary continuously a the tip
hence, not a smooth surface
@Lozansky ooo
Although really, it boils down to a diff geo problem
Say we have a surface like this imgur.com/a/MWcu5pZ
The charge density $\sigma$ is constant on the surface
@ManolisLyviakis abstract algebra / number theory
thats what i wanna do. but im stuck with geometry the past 6 months :P
I'm interested in finding the $z$-component of the electrical field in the point $\mathbf{r}$
20:50
so the surface is some finite flat area?
Yeah
So Mr. Coloumb tells us we should compute $\hat{z} \cdot \vec{E} = \dfrac{\sigma}{4\pi \epsilon_0} \int \dfrac{\hat{z} \cdot \hat{R}}{R^2} da'$
right. probably best to pass to $\vec{R}=\vec{r}-\vec{r}'$, since $\hat{z}\cdot \vec{R} = z$
Or you could rewrite it as $\dfrac{\hat{R}}{R^2} \cdot d\mathbf{a'}$
Since the surface normal is $\hat{z}$
hmm
I'm not sure to what extent you can simplify further in any case.
Well, it's reminiscent of a projection
20:58
multivariable calculus is... interesting
you'll have (along my approach) $$\displaystyle E_z = \frac{\sigma z}{4\pi \epsilon_0}\int_A \frac{dx'dy'}{((x-x')^2+(y-y')^2+z^2)^{3/2}}$$
the theory is so neat
but also intimidating
I'm not sure how to connect this with the solid angle tho
@Semiclassical Not sure that approach is going to prove fruitful
I guess what I might do from here is pick spherical coordinates centered at $r$
21:01
Yes
if only to get the solid angle in play
so that'd be $x'=x+\rho \sin\theta\cos\phi$, $y'=y+\rho\sin\theta\sin\phi$
with $\phi\in[0,2\pi)$ and $0\leq \theta\leq \Theta(\phi)$ parametrizing the boundary
hmm, but $\rho$ would be a function of $\theta$ as well...yay.
($z=-\rho\cos\theta$ if I pick $\theta=0$ to point straight down instead of up, so $x'=x-z\tan\theta\cos\phi$, $y'=y-z\tan\theta\sin\phi$)
@Semiclassical The sneaky way out of this mess is noting that $\dfrac{\hat{R}}{R^2} \cdot d\mathbf{a'}$ is the projection and normalization of the vectorial surface element $d\mathbf{a'}$ to the unit sphere, i.e. the differential solid angle $d\mathbf{a'}$ occupies seen from $\mathbf{r}$. So the integrand reduces to $d\Omega$ which gives us $E_z = \dfrac{\sigma \Omega}{4 \pi \epsilon_0}$
oh, cute
i haven't done solid angle stuff in a while, so I can't say I'm surprised I didn't see it
can i bother u semi?
It's definitely a very geometric approach :P
21:11
just ask, don't ask to ask
@Semiclassical Suppose $C:(x,y,z): z=\sqrt{x^2+y^2}$ suppose it is a smooth manifold meaning there exists a smooth parametrization $φ(u,v): U\subset R^2 \rightarrow C$ such that $φ(u,v)=(φ_1(u,v),φ_2(u,v),φ_3(u,v))$ such that $φ_3= \sqrt{ φ_2^2+φ_3^2} $ being continuously differentiable at every point but it fails at the peak since the limit at the peak of the derivative fails to be unique. (So which is the the derivative and what limiti to take to continue my proof.?
I can't help you on this.
oh ok
its the same question with before
just wanted to rigorously write it down
is it ok so far?
As I said, I can't help you on this.
(its the cone question )
ok
21:14
My ability to prove that is limited to "If you approach the vertex of a cone from some direction direction, the surface normals are constant along the way but depend on the direction of approach"
I'm not going to write down a more rigorous proof than that
If you project the cone on a plane parallell to the surface normal of the bottom you get a $y=k|x|$ situation at the peak :P
@Lozansky going alone the lines I proposed above, I get $E_z=\frac{\sigma}{4\pi \epsilon_0}\int_0^{2\pi}\int_0^{\Theta(\phi)}\sin\theta\,d\theta\,d\phi$
and then $\int_0^{2\pi}\int_0^{\Theta(\phi)}\sin\theta\,d\theta\,d\phi = \Omega$ from identifying this with a surface integral in spherical coordinates
that's a bit more grindy than your solution tho
Well, it's kinda the same, no?
yeah, just a bit more laborious in my way of presenting it
It's a cute result regardless
i can argue alot of things as to why the cone is not smooth except mathematical sentences arguments with variables.
21:32
I have a problem... by convex set L I mean if points A and B are elements of L, then the line from A to B is its subset. now, if f is an isometric transform, I have to prove that f(L) is also convex. my intuition tells me that starting from the assumption that f(L) is not convex, i.e. that there exists a point f(C) on the line f(A) to f(B) which is not an element of f(L), I should prove that f is not isometric or something. any ideas?
21:48
figured it out. I had to think about L as an actual set of points and f as a bijection between L and f(L). then, every A has an f(A) in f(L), and if f(L) is not convex there would be an f(C) on the line between f(A) and f(B) which was not in f(L) which is a contradiction
01:00 - 22:0022:00 - 00:00

« first day (2950 days earlier)      last day (2367 days later) »