Join our FREE webinar on May 1st to learn about managing anxiety.

G
Topic
First Poster
Last Poster
k a April Highlights and 2025 AoPS Online Class Information
jlacosta   0
Apr 2, 2025
Spring is in full swing and summer is right around the corner, what are your plans? At AoPS Online our schedule has new classes starting now through July, so be sure to keep your skills sharp and be prepared for the Fall school year! Check out the schedule of upcoming classes below.

WOOT early bird pricing is in effect, don’t miss out! If you took MathWOOT Level 2 last year, no worries, it is all new problems this year! Our Worldwide Online Olympiad Training program is for high school level competitors. AoPS designed these courses to help our top students get the deep focus they need to succeed in their specific competition goals. Check out the details at this link for all our WOOT programs in math, computer science, chemistry, and physics.

Looking for summer camps in math and language arts? Be sure to check out the video-based summer camps offered at the Virtual Campus that are 2- to 4-weeks in duration. There are middle and high school competition math camps as well as Math Beasts camps that review key topics coupled with fun explorations covering areas such as graph theory (Math Beasts Camp 6), cryptography (Math Beasts Camp 7-8), and topology (Math Beasts Camp 8-9)!

Be sure to mark your calendars for the following events:
[list][*]April 3rd (Webinar), 4pm PT/7:00pm ET, Learning with AoPS: Perspectives from a Parent, Math Camp Instructor, and University Professor
[*]April 8th (Math Jam), 4:30pm PT/7:30pm ET, 2025 MATHCOUNTS State Discussion
April 9th (Webinar), 4:00pm PT/7:00pm ET, Learn about Video-based Summer Camps at the Virtual Campus
[*]April 10th (Math Jam), 4:30pm PT/7:30pm ET, 2025 MathILy and MathILy-Er Math Jam: Multibackwards Numbers
[*]April 22nd (Webinar), 4:00pm PT/7:00pm ET, Competitive Programming at AoPS (USACO).[/list]
Our full course list for upcoming classes is below:
All classes run 7:30pm-8:45pm ET/4:30pm - 5:45pm PT unless otherwise noted.

Introductory: Grades 5-10

Prealgebra 1 Self-Paced

Prealgebra 1
Sunday, Apr 13 - Aug 10
Tuesday, May 13 - Aug 26
Thursday, May 29 - Sep 11
Sunday, Jun 15 - Oct 12
Monday, Jun 30 - Oct 20
Wednesday, Jul 16 - Oct 29

Prealgebra 2 Self-Paced

Prealgebra 2
Sunday, Apr 13 - Aug 10
Wednesday, May 7 - Aug 20
Monday, Jun 2 - Sep 22
Sunday, Jun 29 - Oct 26
Friday, Jul 25 - Nov 21

Introduction to Algebra A Self-Paced

Introduction to Algebra A
Monday, Apr 7 - Jul 28
Sunday, May 11 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Wednesday, May 14 - Aug 27
Friday, May 30 - Sep 26
Monday, Jun 2 - Sep 22
Sunday, Jun 15 - Oct 12
Thursday, Jun 26 - Oct 9
Tuesday, Jul 15 - Oct 28

Introduction to Counting & Probability Self-Paced

Introduction to Counting & Probability
Wednesday, Apr 16 - Jul 2
Thursday, May 15 - Jul 31
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Wednesday, Jul 9 - Sep 24
Sunday, Jul 27 - Oct 19

Introduction to Number Theory
Thursday, Apr 17 - Jul 3
Friday, May 9 - Aug 1
Wednesday, May 21 - Aug 6
Monday, Jun 9 - Aug 25
Sunday, Jun 15 - Sep 14
Tuesday, Jul 15 - Sep 30

Introduction to Algebra B Self-Paced

Introduction to Algebra B
Wednesday, Apr 16 - Jul 30
Tuesday, May 6 - Aug 19
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14

Introduction to Geometry
Wednesday, Apr 23 - Oct 1
Sunday, May 11 - Nov 9
Tuesday, May 20 - Oct 28
Monday, Jun 16 - Dec 8
Friday, Jun 20 - Jan 9
Sunday, Jun 29 - Jan 11
Monday, Jul 14 - Jan 19

Intermediate: Grades 8-12

Intermediate Algebra
Monday, Apr 21 - Oct 13
Sunday, Jun 1 - Nov 23
Tuesday, Jun 10 - Nov 18
Wednesday, Jun 25 - Dec 10
Sunday, Jul 13 - Jan 18
Thursday, Jul 24 - Jan 22

Intermediate Counting & Probability
Wednesday, May 21 - Sep 17
Sunday, Jun 22 - Nov 2

Intermediate Number Theory
Friday, Apr 11 - Jun 27
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3

Precalculus
Wednesday, Apr 9 - Sep 3
Friday, May 16 - Oct 24
Sunday, Jun 1 - Nov 9
Monday, Jun 30 - Dec 8

Advanced: Grades 9-12

Olympiad Geometry
Tuesday, Jun 10 - Aug 26

Calculus
Tuesday, May 27 - Nov 11
Wednesday, Jun 25 - Dec 17

Group Theory
Thursday, Jun 12 - Sep 11

Contest Preparation: Grades 6-12

MATHCOUNTS/AMC 8 Basics
Wednesday, Apr 16 - Jul 2
Friday, May 23 - Aug 15
Monday, Jun 2 - Aug 18
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

MATHCOUNTS/AMC 8 Advanced
Friday, Apr 11 - Jun 27
Sunday, May 11 - Aug 10
Tuesday, May 27 - Aug 12
Wednesday, Jun 11 - Aug 27
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Problem Series
Friday, May 9 - Aug 1
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Tuesday, Jun 17 - Sep 2
Sunday, Jun 22 - Sep 21 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Monday, Jun 23 - Sep 15
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Final Fives
Sunday, May 11 - Jun 8
Tuesday, May 27 - Jun 17
Monday, Jun 30 - Jul 21

AMC 12 Problem Series
Tuesday, May 27 - Aug 12
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Wednesday, Aug 6 - Oct 22

AMC 12 Final Fives
Sunday, May 18 - Jun 15

F=ma Problem Series
Wednesday, Jun 11 - Aug 27

WOOT Programs
Visit the pages linked for full schedule details for each of these programs!


MathWOOT Level 1
MathWOOT Level 2
ChemWOOT
CodeWOOT
PhysicsWOOT

Programming

Introduction to Programming with Python
Thursday, May 22 - Aug 7
Sunday, Jun 15 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Tuesday, Jun 17 - Sep 2
Monday, Jun 30 - Sep 22

Intermediate Programming with Python
Sunday, Jun 1 - Aug 24
Monday, Jun 30 - Sep 22

USACO Bronze Problem Series
Tuesday, May 13 - Jul 29
Sunday, Jun 22 - Sep 1

Physics

Introduction to Physics
Wednesday, May 21 - Aug 6
Sunday, Jun 15 - Sep 14
Monday, Jun 23 - Sep 15

Physics 1: Mechanics
Thursday, May 22 - Oct 30
Monday, Jun 23 - Dec 15

Relativity
Sat & Sun, Apr 26 - Apr 27 (4:00 - 7:00 pm ET/1:00 - 4:00pm PT)
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
Apr 2, 2025
0 replies
k i Adding contests to the Contest Collections
dcouchman   1
N Apr 5, 2023 by v_Enhance
Want to help AoPS remain a valuable Olympiad resource? Help us add contests to AoPS's Contest Collections.

Find instructions and a list of contests to add here: https://artofproblemsolving.com/community/c40244h1064480_contests_to_add
1 reply
dcouchman
Sep 9, 2019
v_Enhance
Apr 5, 2023
k i Zero tolerance
ZetaX   49
N May 4, 2019 by NoDealsHere
Source: Use your common sense! (enough is enough)
Some users don't want to learn, some other simply ignore advises.
But please follow the following guideline:


To make it short: ALWAYS USE YOUR COMMON SENSE IF POSTING!
If you don't have common sense, don't post.


More specifically:

For new threads:


a) Good, meaningful title:
The title has to say what the problem is about in best way possible.
If that title occured already, it's definitely bad. And contest names aren't good either.
That's in fact a requirement for being able to search old problems.

Examples:
Bad titles:
- "Hard"/"Medium"/"Easy" (if you find it so cool how hard/easy it is, tell it in the post and use a title that tells us the problem)
- "Number Theory" (hey guy, guess why this forum's named that way¿ and is it the only such problem on earth¿)
- "Fibonacci" (there are millions of Fibonacci problems out there, all posted and named the same...)
- "Chinese TST 2003" (does this say anything about the problem¿)
Good titles:
- "On divisors of a³+2b³+4c³-6abc"
- "Number of solutions to x²+y²=6z²"
- "Fibonacci numbers are never squares"


b) Use search function:
Before posting a "new" problem spend at least two, better five, minutes to look if this problem was posted before. If it was, don't repost it. If you have anything important to say on topic, post it in one of the older threads.
If the thread is locked cause of this, use search function.

Update (by Amir Hossein). The best way to search for two keywords in AoPS is to input
[code]+"first keyword" +"second keyword"[/code]
so that any post containing both strings "first word" and "second form".


c) Good problem statement:
Some recent really bad post was:
[quote]$lim_{n\to 1}^{+\infty}\frac{1}{n}-lnn$[/quote]
It contains no question and no answer.
If you do this, too, you are on the best way to get your thread deleted. Write everything clearly, define where your variables come from (and define the "natural" numbers if used). Additionally read your post at least twice before submitting. After you sent it, read it again and use the Edit-Button if necessary to correct errors.


For answers to already existing threads:


d) Of any interest and with content:
Don't post things that are more trivial than completely obvious. For example, if the question is to solve $x^{3}+y^{3}=z^{3}$, do not answer with "$x=y=z=0$ is a solution" only. Either you post any kind of proof or at least something unexpected (like "$x=1337, y=481, z=42$ is the smallest solution). Someone that does not see that $x=y=z=0$ is a solution of the above without your post is completely wrong here, this is an IMO-level forum.
Similar, posting "I have solved this problem" but not posting anything else is not welcome; it even looks that you just want to show off what a genius you are.

e) Well written and checked answers:
Like c) for new threads, check your solutions at least twice for mistakes. And after sending, read it again and use the Edit-Button if necessary to correct errors.



To repeat it: ALWAYS USE YOUR COMMON SENSE IF POSTING!


Everything definitely out of range of common sense will be locked or deleted (exept for new users having less than about 42 posts, they are newbies and need/get some time to learn).

The above rules will be applied from next monday (5. march of 2007).
Feel free to discuss on this here.
49 replies
ZetaX
Feb 27, 2007
NoDealsHere
May 4, 2019
Weighted Blocks
ilovemath04   51
N 37 minutes ago by Maximilian113
Source: ISL 2019 C2
You are given a set of $n$ blocks, each weighing at least $1$; their total weight is $2n$. Prove that for every real number $r$ with $0 \leq r \leq 2n-2$ you can choose a subset of the blocks whose total weight is at least $r$ but at most $r + 2$.
51 replies
ilovemath04
Sep 22, 2020
Maximilian113
37 minutes ago
Very easy NT
GreekIdiot   7
N 39 minutes ago by Primeniyazidayi
Prove that there exists no natural number $n>1$ such that $n \mid 2^n-1$.
7 replies
GreekIdiot
4 hours ago
Primeniyazidayi
39 minutes ago
Evaluate: $\lim_{h\to 0^{-}} \frac{-1}{h}.$
Vulch   4
N an hour ago by Vulch
Respected users,
I am asking for better solution of the following problem with excellent explanation.
Thank you!

Evaluate: $\lim_{h\to 0^{-}} \frac{-1}{h}.$
4 replies
Vulch
Today at 2:33 AM
Vulch
an hour ago
Azer and Babek playing a game on a chessboard
Nuran2010   1
N an hour ago by Diamond-jumper76
Source: Azerbaijan Al-Khwarizmi IJMO TST
Azer and Babek have a $8 \times 8$ chessboard. Initially, Azer colors all cells of this chessboard with some colors. Then, Babek takes $2$ rows and $2$ columns and looks at the $4$ cells in the intersection. Babek wants to have all these $4$ cells in a same color, but Azer doesn't. With at least how many colors, Azer can reach his goal?
1 reply
Nuran2010
Yesterday at 5:03 PM
Diamond-jumper76
an hour ago
Something nice
KhuongTrang   27
N an hour ago by arqady
Source: own
Problem. Given $a,b,c$ be non-negative real numbers such that $ab+bc+ca=1.$ Prove that

$$\sqrt{a+1}+\sqrt{b+1}+\sqrt{c+1}\le 1+2\sqrt{a+b+c+abc}.$$
27 replies
1 viewing
KhuongTrang
Nov 1, 2023
arqady
an hour ago
Hard inequality
JK1603JK   4
N an hour ago by JK1603JK
Source: unknown?
Let $a,b,c>0$ and $a^2+b^2+c^2=2(a+b+c).$ Find the minimum $$P=(a+b+c)\left(\frac{1}{a}+\frac{1}{b}+\frac{1}{c}\right)$$
4 replies
JK1603JK
Yesterday at 4:24 AM
JK1603JK
an hour ago
Pairwise distance-one products
y-is-the-best-_   28
N an hour ago by john0512
Source: IMO 2019 SL A4
Let $n\geqslant 2$ be a positive integer and $a_1,a_2, \ldots ,a_n$ be real numbers such that \[a_1+a_2+\dots+a_n=0.\]Define the set $A$ by
\[A=\left\{(i, j)\,|\,1 \leqslant i<j \leqslant n,\left|a_{i}-a_{j}\right| \geqslant 1\right\}\]Prove that, if $A$ is not empty, then
\[\sum_{(i, j) \in A} a_{i} a_{j}<0.\]
28 replies
y-is-the-best-_
Sep 22, 2020
john0512
an hour ago
2^x+3^x = yx^2
truongphatt2668   8
N an hour ago by Tamam
Prove that the following equation has infinite integer solutions:
$$2^x+3^x = yx^2$$
8 replies
truongphatt2668
Apr 22, 2025
Tamam
an hour ago
Fibonacci...?
Jackson0423   1
N 2 hours ago by KAME06
The sequence \( F \) is defined by \( F_0 = F_1 = 2025 \) and for all positive integers \( n \geq 2 \), \( F_n = F_{n-1} + F_{n-2} \). Show that for every positive integer \( k \), there exists a suitable positive integer \( j \) such that \( F_j \) is a multiple of \( k \).
1 reply
Jackson0423
2 hours ago
KAME06
2 hours ago
power of matrix
teomihai   3
N 2 hours ago by teomihai
Find $A^{n}$ ,where $A=\begin{pmatrix}1&-\frac{1}{5}-\frac{2}{5}i\\2+i&-i&\end{pmatrix}$
we now $i^2=-1$,and $n$ it is positiv integer number.
3 replies
teomihai
Today at 12:15 PM
teomihai
2 hours ago
Putnam 1952 B1
centslordm   3
N 2 hours ago by Ianis
A mathematical moron is given two sides and the included angle of a triangle and attempts to use the Law of Cosines: $a^2 = b^2 + c^2 - 2bc \cos A,$ to find the third side $a.$ He uses logarithms as follows. He finds $\log b$ and doubles it; adds to that the double of $\log c;$ subtracts the sum of the logarithms of $2, b, c,$ and $\cos A;$ divides the result by $2;$ and takes the anti-logarithm. Although his method may be open to suspicion his computation is accurate. What are the necessary and sufficient conditions on the triangle that this method should yield the correct result?
3 replies
centslordm
May 30, 2022
Ianis
2 hours ago
4 concyclic points
buzzychaoz   18
N 2 hours ago by bjump
Source: Japan Mathematical Olympiad Finals 2015 Q4
Scalene triangle $ABC$ has circumcircle $\Gamma$ and incenter $I$. The incircle of triangle $ABC$ touches side $AB,AC$ at $D,E$ respectively. Circumcircle of triangle $BEI$ intersects $\Gamma$ again at $P$ distinct from $B$, circumcircle of triangle $CDI$ intersects $\Gamma$ again at $Q$ distinct from $C$. Prove that the $4$ points $D,E,P,Q$ are concyclic.
18 replies
buzzychaoz
Apr 1, 2016
bjump
2 hours ago
angles in triangle
AndrewTom   33
N 2 hours ago by zuat.e
Source: BrMO 2012/13 Round 2
The point $P$ lies inside triangle $ABC$ so that $\angle ABP = \angle PCA$. The point $Q$ is such that $PBQC$ is a parallelogram. Prove that $\angle QAB = \angle CAP$.
33 replies
AndrewTom
Feb 1, 2013
zuat.e
2 hours ago
Putnam 1952 A1
centslordm   4
N 3 hours ago by centslordm
Let \[ f(x) = \sum_{i=0}^{i=n} a_i x^{n - i}\]be a polynomial of degree $n$ with integral coefficients. If $a_0, a_n,$ and $f(1)$ are odd, prove that $f(x) = 0$ has no rational roots.
4 replies
centslordm
May 29, 2022
centslordm
3 hours ago
find ker of map from poly ring to poly ring,related to segre
fredbel6   9
N Sep 28, 2011 by darij grinberg
Hello,

Let $k$ be a field
let $R=k[Z_{i, j};i=0\cdots m,j=0\cdots n ]$
Let $S= k[x_{0},\cdots,x_{m},y_{0},\cdots,y_{n}]$

Let $\phi$ be the unique ring morphism from $R$ to $S$, mapping $Z_{i,j}$ onto $x_{i}y_{j}$.

Show that the kernel of $\phi$ is the ideal $W$ generated by all elements of type $Z_{a, b}Z_{c,d}-Z_{a,c}Z_{b,d}$.
[ Moderator edit: Typo! This should be $Z_{a, b}Z_{c,d}-Z_{a,d}Z_{c,b}$.]

Now the ideal I described is obviously a subset of the kernel, but how do I see all of the kernel is generated? :huh:

Thanks,
fredbel6
9 replies
fredbel6
Mar 4, 2007
darij grinberg
Sep 28, 2011
find ker of map from poly ring to poly ring,related to segre
G H J
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
fredbel6
1545 posts
#1 • 4 Y
Y by dantx5, Adventure10, Mango247, and 1 other user
Hello,

Let $k$ be a field
let $R=k[Z_{i, j};i=0\cdots m,j=0\cdots n ]$
Let $S= k[x_{0},\cdots,x_{m},y_{0},\cdots,y_{n}]$

Let $\phi$ be the unique ring morphism from $R$ to $S$, mapping $Z_{i,j}$ onto $x_{i}y_{j}$.

Show that the kernel of $\phi$ is the ideal $W$ generated by all elements of type $Z_{a, b}Z_{c,d}-Z_{a,c}Z_{b,d}$.
[ Moderator edit: Typo! This should be $Z_{a, b}Z_{c,d}-Z_{a,d}Z_{c,b}$.]

Now the ideal I described is obviously a subset of the kernel, but how do I see all of the kernel is generated? :huh:

Thanks,
fredbel6
This post has been edited 3 times. Last edited by levans, Apr 6, 2015, 4:19 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
fredbel6
1545 posts
#2 • 2 Y
Y by Adventure10, Mango247
Maybe I should add that the point is that I need to prove that the generated ideal is a prime ideal (hence implying that the image of the Segre embedding is irreducible)
This should work because the quotient would then be isomorpic with a subring of S and thus be a domain.

But I'm still stuck. :( (My book says it's just straightforward :| )
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
fredbel6
1545 posts
#3 • 1 Y
Y by Adventure10
Please let me know if you guys think this question is too easy, because I'm really trying hard to solve it.

I have come up with an alternative problem : since the ultimate goal is proving that the Segre variety is irreducible, it might be enough just to prove that $W$ is a prime ideal. :o
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
-oo-
1231 posts
#4 • 1 Y
Y by Adventure10
keep cool. ;-) it doesn't seem to be easy.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
fredbel6
1545 posts
#5 • 1 Y
Y by Adventure10
-oo- wrote:
keep cool. ;-) it doesn't seem to be easy.
:maybe: Is that good or bad news? :D

Maybe I should just say what the original problem was : consider the sets of projective points over an algebraically close field $k$ in $\mathcal{P}^{n m+n+m}$ of form $(a_{0}b_{0},\cdots,a_{0}b_{n},\cdots a_{m}b_{n})$ (not all zero of course)

Well prove that this set of points is not only a projective variety, but also an irreducible one.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
lofar
35 posts
#6 • 2 Y
Y by Adventure10, Mango247
Polynomial set $\{Z_{a,b}Z_{c,d}-Z_{a,c}Z_{b,d}\}$ is a standard (Groebner) basis of the kernel. In particular it generates kernel.

You may refer to "An Introduction to Gröbner Bases" by Adams and Loustanau. It is a good easy-to-read book devoted to standard bases.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
-oo-
1231 posts
#7 • 2 Y
Y by Adventure10, Mango247
ok fredbel, I've also worked hard on it *g*. somewhat disappointing that lofar indicates that there's a more abstract and elegant approarch, which is unknown to me, but the following works with elementary means:

first, we may assume $m \leq n$ by symmetry. in the case $m=0$, one easily sees that $\phi$ has trivial kernel, and that $W_{m,n}=0$ by definition, which says

$W_{m,n}= < Z_{ab}Z_{cd}-Z_{ac}Z_{bd}: 0 \leq a,c \leq m , 0 \leq b,d \leq \min(m,n) >$

now the key idea is the canonical isomorphism

$k[Z_{ij}; i=0...m, j=0...n] \cong k[Z_{ij}; i=0...m-1, j=0...n] [Z_{m0},...,Z_{mn}]$

and then induction by $m$. let $f$ be an element of $\ker(\phi)$, and write

$f = \sum_{\nu \in \mathbb{N}^{\{0,...,n\}}}a_{\nu}Z_{m0}^{\nu_{0}}... Z_{mn}^{\nu_{n}}\text{~~where~~}a_{\nu}\in k[Z_{ij}; i=0...m-1, j=0...n]$

now we apply $\phi$. remark that $\phi(a_{\nu}) \in k[x_{0},... , x_{m-1}, y_{0},...y_{n}]$, so that

$0 = \phi(f) = \sum_{\nu \in \mathbb{N}^{\{0,...,n\}}}\phi(a_{\nu}) x_{m}^{\nu_{0}+..+\nu_{n}}y_{0}^{\nu_{0}}... y_{n}^{\nu_{n}}\in k[x_{m}][x_{0},... , x_{m-1}, y_{0},...y_{n}]$

clearly implies $\phi(a_{\nu}) y_{0}^{\nu_{0}}... y_{n}^{\nu_{n}}=0$ oh, I just see that this is not clear :-(
and thus $\phi(a_{\nu})=0$ for all $\nu$. by the induction hypothesis, it follows $a_{\nu}\subseteq W_{m-1,n}\subseteq W_{m,n}$ and hence $f \in W_{m,n}$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
buddha
10 posts
#8 • 2 Y
Y by Adventure10, Mango247
Assume $f \in ker(\phi)$ and $f$ is an irreducible element in $\mathbb{k}[Z_{i}j]$.now write $f = Z_{ij}Z_{mn}h+g;{(i,j)}\neq{(m,n)};g$not divisible by $Z_{ij},Z_{mn}$ .Now as $\phi(f)=0$,and polynomial ring is a U.F.D we get $x_{i}x_{m}y_{j}y_{n}$ divides $-\phi(g)$ ,so $f = (Z_{ij}Z_{mn}-Z_{in}Z_{mj})l+q$ wid $q \in ker(\phi)$. now proceeding wid a similar argument on $q$ u can arrive at the rquired result.
what do u think fred?. :maybe:
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
fredbel6
1545 posts
#9 • 2 Y
Y by Adventure10, Mango247
buddha wrote:
we get $x_{i}x_{m}y_{j}y_{n}$ divides $-\phi(g)$ ,so $f = (Z_{ij}Z_{mn}-Z_{in}Z_{mj})l+q$ wid $q \in ker(\phi)$.
Can you explain the "so"? How do you proceed? to obtain that?
Quote:
now proceeding wid a similar argument on $q$ u can arrive at the rquired result.
what do u think fred?. :maybe:
Hmm, can you explain how you proceed with a similar argument? I mean, we cannot afford to keep going in circles, what makes $q$ any different from $f$?

I'm sorry, I still don't get it. :( Mean book. :mad:
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
darij grinberg
6555 posts
#10 • 2 Y
Y by Adventure10, Mango247
[EDIT: The content of the post below has been reposted with more detail and better notations at https://math.stackexchange.com/questions/353846/hartshorne-problem-1-2-14-on-segre-embedding .]

Notice a typo in the problem statement: The ideal $W$ should be generated by all elements of the type $Z_{a,b}Z_{c,d}-Z_{a,d}Z_{c,b}$, not $Z_{a, b}Z_{c,d}-Z_{a,c}Z_{b,d}$.

Also note that $k$ needs not be a field, but can be any commutative ring with $1$.

A week ago I asked Bjorn Poonen for a solution of this problem (in response to him giving Hartshorne Chapter I Exercise 2.14 as homework). He came up with a very nice proof, which I am going to sketch:

Let $M=\left\{0,1,...,m\right\}$ and $N=\left\{0,1,...,n\right\}$. We order the set $M\times N$ lexicographically.

We must show that $\mathrm{Ker}\phi = W$.

We notice that $\mathrm{Ker}\phi\supseteq W$ is very easy to prove (in fact, a trivial computation shows that $\mathrm{Ker}\phi$ contains $Z_{a,b}Z_{c,d}-Z_{a,d}Z_{c,b}$ for all $a$, $b$, $c$, $d$).

Every $k$-tuple $\left(\left(a_1,b_1\right),\left(a_2,b_2\right),...,\left(a_k,b_k\right)\right)\in \left(M\times N\right)^k$ and every permutation $\sigma\in S_k$ satisfy

(1) $Z_{a_1,b_1}Z_{a_2,b_2}...Z_{a_k,b_k} \equiv Z_{a_1,b_{\sigma 1}}Z_{a_2,b_{\sigma 2}}...Z_{a_k,b_{\sigma k}} \mod W$.

(In fact, this is obvious from the definition of $W$ when $\sigma$ is a transposition, and hence, by induction, it also holds for every permutation $\sigma$ because every permutation is a composition of transpositions.)

Now, let $T$ be the $k$-submodule of $k\left[Z_{i,j}\mid \left(i,j\right)\in M\times N\right]$ generated by all products of the form $Z_{a_1,c_1}Z_{a_2,c_2}...Z_{a_k,c_k}$ with $k$ being a positive integer and $\left(\left(a_1,c_1\right),\left(a_2,c_2\right),...,\left(a_k,c_k\right)\right)\in \left(M\times N\right)^k$ being a $k$-tuple satisfying $a_1\leq a_2\leq ...\leq a_k$ and $c_1\leq c_2\leq ...\leq c_k$. It is easy to see that the map $\phi\mid_T:T\to k\left[x_0,x_1,...,x_m,y_0,y_1,...,y_n\right]$ is injective. (In fact,

$\left(\phi\mid_T\right)\left(Z_{a_1,c_1}Z_{a_2,c_2}...Z_{a_k,c_k}\right) = \phi\left(Z_{a_1,c_1}Z_{a_2,c_2}...Z_{a_k,c_k}\right) = x_{a_1}y_{c_1}x_{a_2}y_{c_2}...x_{a_k}y_{c_k}$
$=x_{a_1}x_{a_2}...x_{a_k}y_{c_1}y_{c_2}...y_{c_k}$

is a monomial from which we can recover the $k$-tuple $\left(a_1,a_2,...,a_k\right)$ up to order and the $k$-tuple $\left(c_1,c_2,...,c_k\right)$ up to order; but since the order of each of these two $k$-tuples is predetermined by the condition that $a_1\leq a_2\leq ...\leq a_k$ and $c_1\leq c_2\leq ...\leq c_k$, we can therefore recover these two $k$-tuples completely; hence, the map $\phi\mid_T$ sends distinct monomials to distinct monomials, and thus is injective.)

Next we are going to show that:

(2) every monomial in $k\left[Z_{i,j}\mid \left(i,j\right)\in M\times N\right]$ lies in $T+W$.

Proof of (2). Let $\mu$ be any monomial in $k\left[Z_{i,j}\mid \left(i,j\right)\in M\times N\right]$. Then, $\mu=Z_{a_1,b_1}Z_{a_2,b_2}...Z_{a_k,b_k}$ for some $k$ and some $k$-tuple $\left(\left(a_1,b_1\right),\left(a_2,b_2\right),...,\left(a_k,b_k\right)\right)\in \left(M\times N\right)^k$ such that $\left(a_1,b_1\right)\leq\left(a_2,b_2\right)\leq ...\leq \left(a_k,b_k\right)$. Consider such a $k$ and such a $k$-tuple $\left(\left(a_1,b_1\right),\left(a_2,b_2\right),...,\left(a_k,b_k\right)\right)$. Since $\left(a_1,b_1\right)\leq\left(a_2,b_2\right)\leq ...\leq \left(a_k,b_k\right)$, we have $a_1\leq a_2\leq ...\leq a_k$ (since our order is lexicographic). Clearly there exists a permutation $\sigma\in S_k$ such that $b_{\sigma 1}\leq b_{\sigma 2}\leq ... \leq b_{\sigma k}$. Consider such a $\sigma$. Let $c_i=b_{\sigma i}$ for every $i\in\left\{1,2,...,k\right\}$. Then,

$\mu=Z_{a_1,b_1}Z_{a_2,b_2}...Z_{a_k,b_k} \equiv Z_{a_1,b_{\sigma 1}}Z_{a_2,b_{\sigma 2}}...Z_{a_k,b_{\sigma k}} $ (by (1))
$= Z_{a_1,c_1} Z_{a_2,c_2} ... Z_{a_k,c_k} \mod W$ (since $b_{\sigma i}=c_i$ for every $i\in\left\{1,2,...,k\right\}$).

But since $a_1\leq a_2\leq ...\leq a_k$ and $c_1\leq c_2\leq ...\leq c_k$ (the latter is a rewriting of $b_{\sigma 1}\leq b_{\sigma 2}\leq ... \leq b_{\sigma k}$), we have $Z_{a_1,c_1} Z_{a_2,c_2} ... Z_{a_k,c_k}\in T$ (by the definition of $T$), so this rewrites as follows:

$\mu\equiv \left(\text{an element of }T\right)\mod W$.

In other words, $\mu\in T+W$. Since this holds for every monomial $\mu$ in $k\left[Z_{i,j}\mid \left(i,j\right)\in M\times N\right]$, this proves (2).

Since the monomials in $k\left[Z_{i,j}\mid \left(i,j\right)\in M\times N\right]$ generate the $k$-module $k\left[Z_{i,j}\mid \left(i,j\right)\in M\times N\right]$, and since $T+W$ is a submodule of this $k$-module, we obtain $k\left[Z_{i,j}\mid \left(i,j\right)\in M\times N\right]=T+W$ from (2).

Now there is a very easy algebraic lemma: If $A$ and $B$ are two submodules of a $k$-module $C$ such that $C=A+B$, and if $\psi$ is a $k$-module map from $C$ to another $k$-module $D$ such that $\psi\mid_A$ is injective and $\mathrm{Ker}\psi \supseteq B$, then $\mathrm{Ker}\psi = B$.

Applying this to $C=k\left[Z_{i,j}\mid \left(i,j\right)\in M\times N\right]$, $A=T$, $B=W$ and $\psi=\phi$, we conclude that $\mathrm{Ker}\phi = W$, qed.
This post has been edited 1 time. Last edited by darij grinberg, Nov 19, 2018, 7:46 AM
Z K Y
N Quick Reply
G
H
=
a