Karl Kroningfeld

 Mathematics

Associated with Math.SE; for both general discussion & math qu...
Dec 11, 2022 05:39
woah
Dec 9, 2022 19:09
I think the method is fine. The division algorithm steps can be used to write $1$ as a linear combination of $4a^2+1$ and $2a+1$. Thus $4a^2+1$ and $2a+1$ must be relatively prime.
Dec 8, 2022 20:45
Yes, yes.
Dec 8, 2022 20:28
I started writing down an example in the margin of my textbook, but ...
Dec 8, 2022 20:10
:)
Dec 8, 2022 19:43
@Shaun I might have said a few things about transcendence degree that seem to be useful, or were useful in similar problems. Likewise for P^n (i.e. stating whether you know and understand the standard affine cover would be helpful). It's tough (for me) to answer a question in which the asker does not state what they know already.
Dec 7, 2022 07:36
Authors these days
Dec 7, 2022 07:35
Not that they had to prove it as part of the statement of Positive Definiteness :P
Dec 7, 2022 07:32
Why?
Dec 7, 2022 07:32
These particular authors start the proof of (i) with a proof of $|a|\ge 0$ :)
Dec 7, 2022 07:24
Why did they include P at all?
Dec 7, 2022 07:24
Note that Q is stronger than P. So, it would have been more efficient to simply state Q iff R
Dec 7, 2022 07:22
Wouldn't you actually want to show the inequality holds?!
Dec 7, 2022 07:21
Indeed, this disagreement would be resolved with a case in which $P$ is not true.
Dec 7, 2022 07:13
The statement $|a|\ge 0$ applies regardless of whether $a=0$. A different example of the same wording: artofproblemsolving.com/wiki/index.php/AM-GM_Inequality
Dec 7, 2022 07:02
I would normally parse P with Q if and only if R as $P\land(Q\iff R)$
Aug 11, 2022 17:46
one might want $K_n\subset K_{n+1}^{\circ}$ for exhaustions in general
Aug 11, 2022 17:26
Readability is my standard as well :)
Jul 16, 2022 20:29
hey Ted
Jul 16, 2022 20:29
doing fine thanks
Jul 16, 2022 20:28
hey how's it going?
Jun 9, 2022 01:41
"I am a Bitcoin enthusiast, with no background knowledge in computer science and cryptography." :)
Jun 9, 2022 01:35
I am connected to that person via Blockchain, somehow
Jun 8, 2022 21:57
Everything on the right of the tensor has to stay a multiple of $3$ if you're computing in $\mathbb Z/3\mathbb Z\otimes 3\mathbb Z$.
Jun 8, 2022 21:57
I'm guessing you were computing in $\mathbb Z/3\mathbb Z\otimes \mathbb Z$ and not $\mathbb Z/3\mathbb Z\otimes 3\mathbb Z$
Jun 8, 2022 21:56
Because $3\mathbb Z\cong \mathbb Z$ as $\mathbb Z$-modules.
Jun 8, 2022 21:55
$\mathbb Z/3\mathbb Z\otimes 3\mathbb Z$ is cyclic of order $3$.
Jun 8, 2022 21:50
@Wave Math is hard lol. I jumped on it mainly because I remembered making a similar mistake before.
Jun 8, 2022 21:24
I'm just saying, what's in your notes is false.
Jun 8, 2022 21:23
You have to localize at $m$ first to apply Nakayama's lemma.
Jun 8, 2022 21:20
If $N$ is finitely generated and $R$ is Noetherian, then the tensor product is $0$ if and only if $mN=0$ already, by Nakayama's lemma.
Jun 8, 2022 21:18
In general, you have $R/I\otimes_RM\cong M/IM$ for ideals $I$ and $R$-modules $M$, and this allows you to figure out what $R/m\otimes_RmN$ is. (E.g., consider the case $N=R$).
Jun 8, 2022 21:17
If you want to transfer scalars across $\otimes$ to get $0$, then you are not computing in $R/m\otimes_RmN$ but rather $R/m\otimes N$.
Jun 8, 2022 21:15
I think you're trying to prove something false @Wave, generally $R/m\otimes_RmN$ is nonzero.
Jun 7, 2022 07:14
Atiyah-Macdonald say more about the approach I suggested (Corollary 3.4) though it may be equally hard to digest.
Jun 7, 2022 07:13
@Wave The first answer here approaches it in a more direct way.
Jun 7, 2022 07:04
I doubt I can fully explain the "fun fact", maybe I can find a decent reference.
Jun 7, 2022 07:04
It's probably easier to see that $S^{-1}p$ is $pR_p$ and then identify $S^{-1}p\cong p\otimes S^{-1}R$.
Jun 7, 2022 06:58
You can localize $R$-modules, and that preserves exact sequences of $R$-modules. It is the same as tensoring with $S^{-1}R$.
Jun 7, 2022 06:53
@Wave Briefly, you can localize the exact sequence of $R$-module $0\to p\to R \to R/p\to 0$, using the multiplicative set $S=R\setminus p$. That leads to $0\to pR_p\to R_p\to S^{-1}(R/p)\to 0$. Then, one shows that $S^{-1}(R/p)$ is the field of fractions of $R/p$.
Jun 7, 2022 06:43
Also, one can take $p$ to be any prime ideal. Fun fact: the quotient $R_p/pR_p$ is the field of fractions of the integral domain $R/p$.
Jun 7, 2022 06:39
Are there any reservations about what you said @wave ?
Jun 7, 2022 06:39
Yes :)
May 30, 2022 18:40
Hold up, it is a direct application of the maximum principle. The real part of $f$ is constant, so $|e^f|$ is constant and a fortiori attains its maximum on the connected open domain. Hence, $e^f$ must be constant. This implies $f$ is discrete-valued and thus locally constant. @Wave
May 30, 2022 18:33
@BalarkaSen the usual, making false assertions, etc.
May 30, 2022 18:26
@BalarkaSen hey yo
May 30, 2022 18:24
emphasis on "more-or-less thinking"
May 30, 2022 18:23
i was more-or-less thinking to reprove liouville lol
May 30, 2022 18:19
ah, open mapping
May 30, 2022 18:17
Have you tried taking the exponential of $f$ @Wave?