Skip to content

抽象代数代考| THE INTEGERS作业代写

这是一些抽象代数考试中 THE INTEGERS内容的常见题型

Problem 1.

Prove: $1 \leq n$, for every $n \in \mathbb{N}$.

Proof .

When $n=1$ the equality holds; otherwise, by Problem $3.6, n=m^{*}=m+1$, for some $m \in \mathbb{N}$, and the inequality holds.

Problem 2.

Prove the Trichotomy Law: For any $m, n \in \mathbb{N}$, one and only one of the following is true:
(a) $m=n$
(b) $mn$

Proof .

Let $m$ be any element of $\mathbb{N}$ and construct the subsets $N_{1}={m}, N_{2}={x: x \in \mathbb{N}, xm} .$ We are to show that $\left{N_{1}, N_{2}, N_{3}\right}$ is a partition of $\mathbb{N}$ relative to ${=,<,>}$.
(1) Suppose $m=1$; then $N_{1}={1}, N_{2}=\emptyset$ (Problem 3.9) and $N_{3}={x: x \in \mathbb{N}, x>1}$. Clearly $N_{1} \cup N_{2} \cup N_{3}=\mathbb{N}$. Thus, to complete the proof for this case, there remains only to check that $N_{1} \cap N_{2}=N_{1} \cap N_{3}=N_{2} \cap N_{3}=\emptyset .$
(2) Suppose $m \neq 1$. Since $1 \in N_{2}$, it follows that $1 \in N_{1} \cup N_{2} \cup N_{3}$. Now select any $n \neq 1 \in N_{1} \cup N_{2} \cup N_{3}$. There are three cases to be considered:
(i) $n \in N_{1}$. Here, $n=m$ and so $n^{} \in N_{3}$. (ii) $n \in N_{2}$ so that $n+p=m$ for some $p \in \mathbb{N}$. If $p=1$, then $n^{}=m \in N_{1}$; if $p \neq 1$ so that $p=1+q$ for some $q \in \mathbb{N}$, then $n^{}+q=m$ and so $n^{} \in N_{2}$.
(iii) $n \in N_{3}$. Here $n^{}>n>m$ and so $n^{} \in N_{3}$.
Thus, for every $n \in \mathbb{N}, n \in N_{1} \cup N_{2} \cup N_{3}$ implies $n^{*} \in N_{1} \cup N_{2} \cup N_{3}$. Since $1 \in N_{1} \cup N_{2} \cup N_{3}$ we conclude that $\mathbb{N}=N_{1} \cup N_{2} \cup N_{3}$.

Now $m \notin N_{2}$, since $m \nless m$; hence $N_{1} \cap N_{2}=\emptyset$. Similarly, $m \ngtr m$ and so $N_{1} \cap N_{3}=\emptyset$. Suppose $p \in N_{2} \cap N_{3}$ for some $p \in \mathbb{N}$. Then $pm$, or, what is the same, $p<m$ and $m<p$. Since $<$ is transitive, we have $p<p$, a contradiction. Thus, we must conclude that $N_{2} \cap N_{3}=\emptyset$ and the proof is now complete for this case.

Problem 3.

Prove: If $m, n \in \mathbb{N}$ and $m<n$, then for each $p \in \mathbb{N}, m+p<n+p$ and conversely.

Proof .

Since $mn$. If $m=n$, then $m+p=n+p$; if $m>n$, then $m+p>n+p$ (Theorem II’). Since these contradict the hypothesis, we conclude that $m<n$.

抽象代数代考| RELATIONS AND OPERATIONS

急需抽象代数的高水平写手

Responsibilities:

  • 群论group theory作业代写兼职写手
  • 环论ring theory代写兼职写手
  • 域论field theory代写兼职写手
  • 表示论代写兼职写手
  • 代数拓扑代写兼职写手
  • 同调代数,交换代数,代数几何代写兼职
  • 负责以上之一方向即可

Courses

01:640:351 – Introduction to Abstract Algebra I

General Information

Math 351 is one of two courses most mathematics majors may take to satisfy the algebra requirement. The other is Math 350.

Catalog Description:

01:640:351-352 Introduction to Abstract Algebra I, II (4,3)
Abstract algrebraic systems, including groups, rings, fields, polynomials, and some Galois theory.
Prerequisites: CALC3; 01:640:250; and a C or better in 300 or permission of department.

Textbook

Textbook:  For current textbook please refer to our Master Textbook List page

Course Webpage

Previous Semesters

!–  –>

SpringFallSpringFall
S2016 Borisov, CherlinF2016 Weibel  
S2014 Wilson, LuoF2014 Lynd, PontesS2016 Borisov, LyndF2015 Sahi
S2012 WeibelF2012 LyndS2013 Wilson, Sargsyan
F2013 Tunnell
S2010 O’NanF2010 WilsonS2011 CherlinF2011 Mejia-Ramos
S2008 O’NanF2008 O’NanF2009 BumbyF2009 O’Nan
F2004 SimsF2005 LyonsF2006 CookF2007 Wilson
F1999 Bumby
F1998 Weibel
F2001 SimsF2002 SimsF2003 Cherlin
S2003 A. Taylor

Schedule of Sections:

https://iw3.math.rutgers.edu/schedule/courses/01-640-351-table.html

发表回复

您的电子邮箱地址不会被公开。