« first day (2545 days earlier)      last day (2476 days later) » 

9:01 PM
@Steamy what is your kind of algtop
 
Lefschetz & Nielsen fixed point theory, for example
 
Cool
 
Hmm, what's that about?
 
fixed points
 
and theory
 
9:11 PM
Lol
 
Wao
 
Regardless of the misleading name though the object of study is neither Lefschetz nor Nielsen
 
I'm like, surprised
Oh I thought it was literally fixed points of Nielsen automorphisms of Lefschetz
 
Firefox tells me that the connection is not safe because the website is bady configured if I click on your Master's thesis link @Steamy
 
o.O
doesn't do so for me
 
9:15 PM
Me neither
 
Hm, very weird
 
@AlessandroCodenotti See if it tells you that on mozilla.org
 
Well, Firefox can be weird with its certificates
 
I rebooted on the ubuntu partition of my laptop and it works perfectly from here
it was probably just firefox acting strange and not a problem with the site
 
Well, in all honesty, my university's IT crew is... pretty bad.
 
9:34 PM
Yo!
 
Can you guys help me with a proof?
Doesn't seem to advance.
"Prove that every non-constant polynomial $g: \Bbb Z \to \Bbb Z, g(x) = a_n x^n + \ldots + a_1 x + 1$ has infinite prime divisors"
 
I'm not even sure I understand the statement
@Daminark @Astyx Re: bijective holomorphic functions have holomorphic inverses, I think the idea is that,
the obvious near-counterexample is $x^3$, but that fails to be bijective in a neighborhood of the origin due to the branching
and there aren't any other obvious ways it could fail
so it seems pretty plausible
 
What exactly does holomorphic mean again ?
 
Given the polynomial, you can find infinite primes $p$ such that $\exists n$ s.t.
$p|g(n)$
 
9:40 PM
(I was scrolling up and reading what the chat was up to while I was gone)
Complex differentiable @Astyx
@LucasHenrique Ahh
 
This is the characterization of zeroes stuff.
 
Is that it ? I thought there was more
 
Nah
It's literally, you can take the derivative of this
i.e., locally it looks like a linear map (which, on the complex plane, means a rotation-scaling mix-y thing)
 
"Let's call it holomorphic. - Why ? - To confuse people. - Oh, sure !"
 
and just from that you can prove everything.
Somehow
I think the idea behind the name is that, away from spots with zero derivative, they preserve angles
(which makes sense from the "locally scalerotation" thing)
 
9:43 PM
Do you need continuously differentiable, or just differentiable ?
 
and you can somehow go from "preserves angles" to "holomorphic" if you take a detour through Greek or Latin or something
@Astyx Nah, just differentiable I think.
You don't want to think about differentiability on a point, though, you want differentiability on open sets
 
Holomorphic functions are analytic
 
Sure
 
Hi, $$(1) n,k\in \mathbb{N}, 29+2^n=3^k \\ (2) n,k\in \mathbb{N}, 1+2^n=3^k \\ (3) a,b,c\in \mathbb{N}, 2^a+3^b=5^c$$
Solve
 
$x^2\sin(1/x)$ probably takes on all values near zero (because $\sin$ has image the entire complex plane—$-1\le\sin\le1$ fails), so our prime example of differentiable-but-not-continuously-so doesn't exist @Astyx
('cause you can't continuously extend the function to zero)
 
9:46 PM
Cool
 
@Dattier For (2), that's $1+2^3=3^2$, right?
And $2^4+3^2=5^2$ for (3)
 
there are more solutions
(1) :0
 
I remember having done 2 and 3
 
(2) :2
(3):3
 
Oh, $1+2^1=3^1$
$2^1+3^1=5^1$
 
9:48 PM
yes
 
It would be nice to find some factorization to limit the numbers
 
How would you even prove $x^2+1$ has infinitely many prime divisors of things in its image? @LucasHenrique
 
why are there not more solutions ?
 
@Dattier What's the third for (3)?
And as for why there aren't more, no idea
 
$\varphi: V \to V$ is normal, $\varphi^{\ast}$ is an adjoint operator to $\varphi$, $v$ is an eigenvector. What happens here: $\Vert \varphi^{\ast}(v) \Vert^2 = \langle v, \varphi(\varphi^{\ast}(v))\rangle$ ?
 
9:51 PM
@LucasHenrique Oh, wait,
 
@Akiva That's easy isn't it ?
Just like Euler
 
that's same as asking for infinitely many primes that satisfy $x^2+1\equiv0\pmod p$
which is a very famous special case
 
@Kirill $\|\varphi^{\ast}(v)\|^2=\langle \varphi^{\ast}(v),\varphi^{\ast}(v)\rangle=\langle v,\varphi(\varphi^{\ast}(v))\rangle$
 
'cause it's true for all primes that are $1$ mod $4$
and there's infinitely many of those
 
indeed, $\langle \varphi^{\ast}(v),u\rangle=\langle v,\varphi(u)\rangle$ for any $u,v,\varphi$, by definition of adjoint
 
9:53 PM
Can't you just suppose there are finitely many, and take the image of the product of them ?
 
(3) 2^4+3^2=5^2 @Akiva
triplet de pythagore
 
@arctictern thinking
 
@Dattier I gave that one already
("Pythagorean triple" in English)
 
@Kirill do you agree $\langle \varphi^{\ast}(v),u\rangle=\langle v,\varphi(u)\rangle$ for any $u,v,\varphi$ by definition of adjoint?
 
@Astyx I'm not sure I see how…
 
9:55 PM
2^1+3^1=5^1
 
sure, I am not sure about the right argument in the product
 
3^0+2^2=5^1
 
just set $u=\varphi^{\ast}(v)$ then
 
@Dattier Ahh
Thanks, makes sense
 
[My typical abstract algebra element convention]
a,b = generic element
c = zero divisor
d = differential operator
e = additive identity
f = multiplicative identity
g, h = generic functions and maps
i,j,k = quaternions
l,m,n = generic integers or natural numbers
p = prime
q = zero inverse
r = right zero inverse or remainder
s = successor operator
t, $\lambda$, $\mu$ parameters
u,v = unit elements (in the sense of rings or vector fields) or generic vectors
w,x,y,z = unique elements (for division algorithm and others) or generic coordinates
 
9:56 PM
Yeah, I don't know how you'd show there aren't more
 
Like, take $E = \{p\in\mathcal P\mid \exists n\in\Bbb N, p|n^2+1\}$
 
I use a PC
 
Suppose that set is finite
 
computer
 
And take $\left(\prod_{p\in E}p\right)^2+1$
 
9:56 PM
Right @Dattier
Maybe ask on MSE
 
$\varphi^{\ast}(v) = \varphi(\varphi^{\ast}(v))$
 
I can't
@AkivaWeinberger
 
Why not?
 
Because when I want do that : I have a message of error
 
@arctictern gOt it, thank you!
 
9:59 PM
11
A: Why I can ask question in MathOverflow and not here (MSE)?

arjafiYou cannot ask questions on Mathematics Stack Exchange because you are currently question banned. This ban is automatic and kicks in when some algorithm decides that your question contributions are of poor quality, and are not of positive value to the community. In contrast, you are not question...

they don't like my enigma
@AkivaWeinberger
A lot that put on hold
They say there no context
even I says it's a personnal production
They don't like this answer
 
Suppose I know that both $A$ and $B$ are convex sets, each generated from their collection of extreme points. What can I say about the extreme points of $A \times B$? How are they related to the extreme points of each individual factor?
 
A = Abelian group or algebra over a set
B, C = (unassigned)
D = Division algebra
$\mathcal{D}$ = differential algebra
E = Eigenspace
F = (forgot)
$\Bbb{F}$ = Field
$\mathcal{F}$ fourier transform
G = Group
H = subgroup
I, J = interval
K, L = (forgot)
$\mathcal{L}$ = language
M = generic mathematical object
$M_{mn}(\Bbb{F})$ matrix
N = (forgot)
O = Big O notation
P, Q = (forgot)
R = Ring
S = generic set or generic algebraic structure
T,U = (forgot)
V = vector space
W,X,Y,Z = (forgot)
 
So, two eigenvectors from different eigenspaces to different eigenvalues are orthogonal, if the linear map $V \to V$ is normal, right?
 
good, I have a another solution
 
10:06 PM
@Astyx And then?
 
Is there any evidence why for the bilinear form should be $\langle u+a \cdot v,w \rangle = \langle u,w \rangle + a \cdot \langle v,w \rangle$, and for the sesquilinear form $\langle u+a \cdot v,w \rangle = \langle u,w \rangle + \overline{a} \cdot \langle v,w \rangle$ ? I do not see any difference according to the other argument of the product in the definitions.
 
Oh for fuck's sake that example
 
@Kirill I don't understand what you're asking.
With a bilinear form, <a,a> may not be real. On the other hand, with a sesquilinear form, <a,a> is always real. You can use the standard inner product to measure size, after all.
So, they are indeed different.
for example, f(z,w)=zw is bilinear on C^1, whereas $\overline{z}w$ is sesquilinear
 
10:23 PM
@arctictern A form is bilinear, if it is linear in both arguments. The difference between the definition of a bilinear form and of a sesquilinear form is that you have $\overline{a}$ instead of $a$ in the left argument. I do not understand, why only in the left one.
 
Actually, I made a mistake here, I have unknowingly assumed 1x=b chat.stackexchange.com/transcript/message/38961782#38961782
 
@Kirill If you had it in both arguments it'd be more or less the same as in no arguments and just took the conjugate of the output, since $\overline{z}\,\overline{w}=\overline{zw}$
 
@arctictern for $\mathbb{R}$ I see that $a\cdot \langle u,v\rangle = \langle u,v \rangle \cdot a = \langle a \cdot u,v \rangle = \langle u, a \cdot v \rangle.$ Is that the same for $\overline{a}$?
 
what does "large" mean?
 
$a\cdot\langle u,v\rangle=\langle u,v\rangle$ is not true unless $a=1$ or $\langle u,v\rangle$. and in any case $a=\overline{a}$ if and only if $a\in\Bbb R$
 
10:28 PM
too abstract for me
4
A: Primes dividing a polynomial

André NicolasOutline: If the constant term of the polynomial is $0$, the result is obvious. The rest of the proof imitates the standard Euclid-style proof that there are infinitely many primes. So let the constant term be $a\ne 0$. It follows that the polynomial $g(n)$ has the shape $$g(n)=nq(n)+a,$$ where...

 
This problem annoys me just a little: math.stackexchange.com/questions/2369439/…
 
@LucasHenrique big
 
@arctictern it was mistyped
 
To my mind the 'right' way to do it is to check the case of $\beta=-\alpha=1$.
 
Yeah it's just like, as your numbers go to infinity, blah is the asymptotic behavior
 
10:29 PM
The rest is just understanding how the central moments of one uniform distribution compare to another.
 
@arctictern ok. Does it play a role for $\overline{a} \in \mathbb{C}$ if I multiply it with the right or with the left argument?
 
But the intended solution is probably just to crunch things out brute-force.
 
@Kirill don't you already know $\langle au,v\rangle=\overline{a}\langle u,v\rangle$ and $\langle u,av\rangle=a\langle u,v\rangle$? (well, that's the physicist convention, the mathematician's convention is often the reverse)
 
@arctictern :(
 
@arctictern dot product is an integer for me, so I can multiply it from the left and from the right. So, according to your message I can do it with any argument from any side.
 
10:33 PM
huzzah physics :)
 
@Kirill I can't understand what you're saying.
 
In defense of the physics way, in the case of $\langle u,v\rangle = u^\dagger v$ those pop out immediately.
(with $v$ understood as a column vector)
 
What is $\langle u,v \rangle \cdot \overline{a}$ according to this convention?
 
if $a$ is a complex scalar, then there's no difference between that and $\overline{a}\langle u,v\rangle$.
 
but it is not $\langle u,v \cdot \overline{a} \rangle$?
 
10:38 PM
Sure? But that's already implied by what arctic said.
 
@AkivaWeinberger I have send my solution
 
@LucasHenrique Oh that's a clever solution
 
It's just doing $a\langle u,v\rangle = \langle u,av\rangle$ with $a$ replaced by $\overline{a}$.
 
It's simpler when $a=1$, which is what I think you had
So your polynomial is $a_nx^n+a_{n-1}x^{n-1}+\dotsb+a_1x+1$, right? @LucasHenrique
So, $p(n)$ is $1$ more than a multiple of $n$.
That means that $p(k!)$ is $1$ more than a multiple of $k!$.
 
actually I was trying to prove the general thing but used a general polynomial $p(x)$ on $x = a_0 x'$
 
10:41 PM
$\langle au,v \rangle = \langle \overline{v, au} \rangle = \langle \overline{v}, \overline{au} \rangle = \langle v,u \rangle \cdot \overline{a} = \overline{a} \cdot \langle v,u\rangle$. That way? @Semiclassical
 
then you get $p(a_0 x) = a_0(1+g(x))$ for some polynomial
 
There are only finitely many solutions to $p(n)=1$, right? @LucasHenrique
 
So, take $k$ such that $k!$ is larger than the largest such solution
If $p(k!)$ is $1$ more than a multiple of $k!$, and it doesn't equal $1$, then what could its prime factors be?
They cant be anything less than $k$
so they must all be larger
 
sure, that works.
wait.
 
10:43 PM
And then we're essentially done. If there were finitely many possible primes that were factors of a $p(n)$, then just take $k$ larger than the largest prime to obtain a contradiction.
(It doesn't matter that $p(k!)$ could be negative, right?)
 
it'd be $\langle \overline{v},\overline{au}\rangle = \langle \overline{v},\overline{u}\rangle \overline{a}$.
And then $\langle \overline{v},\overline{u}\rangle = \langle u,v\rangle$.
 
yeap, Ive twisted them up sorry
 
$\textbf{Revised version}$

$\textbf{Theorem}$: Let $A$ be a magma with the absorber $0$, and satisfying one of the following: $\forall a,b\in A,a\neq 0,\exists ! x: ax=b$ or $\forall a,b\in A,a\neq 0,\exists ! y: ya=b$. If $A$ contains a zero divisor, then the zero divisors can only have one sided inverses.

$\textbf{Proof}:$ Suppose we take the division rule to be $ax=b$. If $A$ has a zero divisor, that is $\exists c, ↄ\in A,c,ↄ \neq 0, cↄ=0$, then by definition, the division rule also holds for $c,ↄ$. Pick some $a \in A$ such that
 
my point is to understand when I have to put the line over $a$, as I see no reason why it should be done for the left, and not for the right argument
 
$\langle u,av\rangle=\langle \overline{a}u,v\rangle$
That's how scalars transfer from one argument to the other.
 
10:49 PM
@Secret /wↄ/
 
$/wↄ/$ ?
 
$\rm/wↄ{:}/$
Woah
You used IPA as a variable
 
well, it seems fitting, since zero divisors kinda acts like chopping zero into halves
 
@Semiclassical I got it. You take the $a$ out, rotate the product, put the $a$ in, rotate the product again.
 
you have two nonzero elements that when combined, they become nothing
 
10:52 PM
I don't know what you mean by 'rotate'
 
@Semiclassical using symmetrie
 
ah.
wasn't sure which scalar you meant (a is itself a scalar)
yeah, that'll work
 
@Semiclassical sorry, it is a scalar product in German and a dot product in English. I mix them up.
 
gotcha.
 
Hi
The dot product is also called the scalar product in English sometimes
 
10:58 PM
depends on the book
it actually makes a bit more sense to me but ima bit odd so...
 
Wikipedia says we also use "Punktprodukt" for that. Never heard that.
 
dunno most german technical stuff is relatively easy to read in context...
 
When it's with the angle bracket I tend to think 'inner product'
 
i always think area
 
Isn't area the cross product?
Magnitude of
 
11:02 PM
@Semiclassical inner product for me is a product of two elements of the set that gives an element of the set, again. Don't know, if it is a usual usage.
 
...
 
I have this in mind when I say that: en.wikipedia.org/wiki/Inner_product_space
 
@AkivaWeinberger not sure cross product gives u a new vector
 
Magnitude of the cross product, I mean
 
$|\vec{a}\times \vec{b}|=ab\sin \theta$
 
11:03 PM
Like, note that the dot product of perpendicular vectors is zero, which doesn't make sense with area
 
$\textbf{Corollary}$: $A$ is an associative division algebra iff it has no zero divisors.

$\textbf{Proof}$: Suppose $A$ has a pair of zero divisors $c,ↄ$. $A$ is a divison algebra if it satisfies both the left and right division rules, i.e.

$$ax=b=ya$$

Since the division rule holds for all elements except zero (NB the case where it holds also for zero is a completely alien structure which is outside of the scope of this proof), we can pick a $b \in A$ such that:

$$cx=b=yc\text{ or }ↄx=b=yↄ$$
 
so the magnitude of the cross product is the area of the parallelogram generated by the two vectors.
 
whats the dot product give you
i always though it was a scaling factor for a linear map
 
and what is the right name for inner operations I mentioned in the last post?
 
Project $x$ onto $y$ and multiply by the magnitude of $y$
 
11:05 PM
^
 
which admittedly is not all that obvious of a definition, and it doesn't help explain why it's symmetrical
 
so a dot product with a unit vector gives the component along that unit vector.
 
3Blue1Brown has a good video on it
 
to get to the symmetry, it's best to write it as $\vec{a}\cdot\vec{b}=ab\cos \theta$.
 
Typo in corollary: $A$ is an associative division algebra if it has no zero divisors.

The converse does not hold obviously, there are many nonassociative algebras with no zero divisors such as the octonions
 
11:07 PM
You can think of it as a measure of how much $a$ and $b$ point in the same direction
That's how it's used in physics
A measure of how much they point in the same direction, with the sizes factored in as well
 
gmm i almost remembered it then it flew away
 
NB: The inner product is the generalisation of the dot product to infinite number of dimensions
 
the dot product of two vectors reprsents something important though
 
@Kirill The word you want is "binary operation" I think
You could also think of dot products as a measure of how much they fail to satisfy the Pythagorean theorem
since $|x+y|^2=|x|^2+|y|^2+2x\cdot y$
 
that sounds more familiar
 
11:11 PM
Also I'm 90% sure I'm right about this but not 100%:
 
lol seems right
 
(cont'd) if you have an object with a force on it with direction and magnitude $\vec a$, and it moves with direction and magnitude $\vec b$, then $\vec a\cdot\vec b$ is the amount of work you've done on the object
@Faust7 I hadn't said it yet…
 
Yes this is correct
 
I am trying to show that $\Bbb{Q}$ does not form a locally compact set, and I am wondering whether the following is heading in the right direction: Suppose that $\Bbb{Q}$ is locally compact. Since it is also Hausdorff, there must exist a compact space $Y$ such that $\Bbb{Q} \subseteq Y$ and $Y - \Bbb{Q}$ is a singleton. Note that we cannot have $\Bbb{Q} \subseteq \Bbb{R} \subseteq Y$, since the sets would no longer differ by a singleton point.
 
thats alot more familiar
 
11:13 PM
Hence $\Bbb{Q} \subseteq Y \subseteq \Bbb{R}$ which implies $\overline{\Bbb{Q}} \subseteq \overline{Y} \subseteq \Bbb{R}$ or $\Bbb{R} \subseteq \overline{R} \subseteq \Bbb{R}$. Hence $\overline{Y} = \Bbb{R}$...
I feel like this should lead to a contradiction, but I cannot see it.
 
@Faust7 So like if the angle between the vectors is obtuse, then it's essentially going in the opposite direction of the force so it's negative
 
@AkivaWeinberger thanks for the great explanations =)
 
and if they're directly opposite, it's very negative
and if they're perpendicular, it's literally orthogonal to the force you're doing so it's 0
 
dot product is also a good example of a special ring ^^
 
@user193319 So you want to show that there's an open set in $\Bbb Q$ that's not contained in any compact set?
Well, in fact every open set in $\Bbb Q$ has that property
No compact set contains an open set
 
11:16 PM
@AkivaWeinberger of "how much they fail"? :)
 
@AkivaWeinberger Well, I was going in a slightly different direction, but I could try that. Can you see whether my ideas are leading in the right direction?
 
@user193319 Why is that true?
 
@Daminark What specifically are you referring to?
 
Oh wait a second
I think I get it, this is the one-point compactification, right?
 
@Daminark I am not sure. I haven't learned about that yet.
 
11:21 PM
OH WAIT
I have a really sneaky way of doing this
 
@Kirill Yeah exactly
 
Have you heard of the Baire Category Theorem?
 
Just use $\Bbb Q=(-\infty,a)\cup(a,b)\cup(b,\infty)$ for $a,b$ irrational
That's a decomposition into open sets
Oh wait
Wait ignore me I'm confused
 
It states that a locally compact Hausdorff space is Baire
Baire meaning, the countable intersection of open, dense sets is dense, or at least non-empty
 
I was thinking of connectedness for some reason
Say a compact set contains an open set in $\Bbb Q$. Think about any irrational number that's in the closure of that set in $\Bbb R$
 
11:24 PM
Since $\mathbb{Q}$ is Hausdorff, singletons are closed, so then $\bigcap_{q\in\mathbb{Q}} \mathbb{Q}\setminus\{q\} = \emptyset$
 
Where do I fail again? $(\lambda - \mu)\langle v,w\rangle$ should be equal to $\langle \overline{\lambda}v,w \rangle - \langle v, \mu w \rangle.$ I get: $(\lambda - \mu)\langle v,w\rangle = \langle (\lambda - \mu)v,w \rangle = \langle \lambda v - \mu v, w \rangle = \langle \lambda v,w \rangle - \langle \mu v,w \rangle \ne \langle \overline{\lambda}v,w \rangle - \langle v, \mu w \rangle.$
 
That's a countable intersection of open dense sets which is empty
So $\mathbb{Q}$ cannot be locally compact
 
Oh there's even a kind-of sneaky way to do this with the extreme value theorem EDIT: Ignore that that's unnecessarily complicated
But yeah I think the hint with the irrational number in the open set is what you need @user193319
 
I like it since it extends to all countable Hausdorff spaces :P
 
@Kirill $(\lambda-\mu)\langle v,w\rangle \neq \langle (\lambda-\mu)v,w\rangle.$
 
11:26 PM
@Daminark and @AkivaWeinberger Okay. Let me think about everything you have both said. Thanks!
 
@Semiclassical Do you need to conjugate that one
 
Alright. Do you know BCT though? If not, it'd probably count as way illegal machinery
 
@Daminark No. I don't know that yet.
 
Okay, work more with what Akiva was saying then
 
Right.
 
11:33 PM
@Semiclassical then how?
 
then keep going.
You've got the tools. Use them.
@daminark Just got 100% with the nickname "universal cover" :P
 
Nice
 
@Semiclassical not really. I have finally read in wiki that the product is linear in the second argument and semilinear in the first one. That makes difference. My notes say nothing about that.
so, $\mu \langle v,w \rangle = \langle \overline{\mu}v,w \rangle = \langle v,\mu w \rangle$, right?
 
right.
 
thank you very much
 
11:45 PM
So for $\Bbb C^1$, what's $\langle v,w\rangle$? $~\bar vw$?
 
if I knew what $\mathbb{C}^1$ means...
 
(AKA, what's $\langle v,w\rangle$? $\sum \bar{v_i}w_i$?)
@Kirill I just mean for 1D
 
$\langle v,w \rangle = f(v,w)$ which goes from $V \times V \to \mathbb{C}$.
the second question looks familiar to the product in $\mathbb{R}$. If so, it is $\langle \overline{v},w \rangle$. If not, it is something else.
@AkivaWeinberger
 
The prototypical example would be $V=\Bbb C^n$, no?
 

« first day (2545 days earlier)      last day (2476 days later) »