Sei sulla pagina 1di 7
 
Course Syllabus
Fall 2011 Math 4301 Mathematical Analysis I
Time and Location:
MATH 4301-001: TR 4:00p - 5:15p
SOM 2.802
 – Instructor:
Wieslaw Krawcewicz
Instructor Contact Information
Instructor: Dr.
Wieslaw Krawcewicz,
Professor 
 
 
Office: FO 2.602F
 
Phone: 972-883-6620
 
Email wieslaw@utdallas.edu
 
Office hours are:
 Tuesdays and Thursdays 2:00p-3:00p, or by appointment.
Course Pre-requisites, Co-requisites, and/or Other Restrictions
 
Prerequisite:
 MATH 2451 and MATH 3310.
Course Description
MATH 4301 - Mathematical Analysis I
(3 semester hours ) Sets, real number system, metric spaces, real functions of several variables. Riemann-Stieltjes integration and other selected topics.
Required and Recommended Textbooks and Materials
 
Required Text:
 Introduction to Mathematical Analysis
 by Wieslaw Krawcewicz, Lecture Notes published on the course website. All homework will be assigned from this text.
NOTICE:
 These lecture notes are still undergoing its evolutionary development (additional topics, more problems and examples will be added to the Notes as we progress into the Fall semester). Please check regularly for the updates.
 
Solutions manual:
 The Solutions Manual for all problems in the Lecture Notes will be available for students once the related topics are covered and homework assignment is handed in.
 
Calculators:
 A scientific calculator is recommended. Graphing calculators, programmable calculators, or calculators with non-numeric displays are NOT ALLOWED.
 
Additional Recommended Textbooks:
 1.
 
Walter Rudin,
Principles of Mathematical Analysis
, 3rd ed., McGraw Hill
, 978-0-072054235-8
 
2.
 
Kenneth Ross,
 Elementary Analysis: Theory of Calculus
, 3rd ed., Springer
978-0-3-8790459-7
3.
 
Serge Lang,
Calculus with Several Variables
, 3rd ed., Springer,
978-0-3-8796405-8
 4.
 
Serge Lang,
Undergraduate Analysis
, 2nd.ed, Springer
 0-387-94841-4
 
Homework Assignments
There will be about 8 to 10 mandatory graded assignments. Assignments will contribute 15% to your final grade. The homework assignments will be published at our website and you will be given approximately 7 days to complete your solutions.
You will be required to hand your homework to your instructor in class on the due-dates. There will be NO late homework accepted.
 
 
Mandatory Attendance
Mandatory Attendance will be enforced in MATH 4301-- 5% will be added to the final grade for those students with perfect attendance record. Legitimate excuses for occasional absence will be accepted.
Grading Policy
 
Homework assignments:
 15%
 
Midterm Exam 1:
25%
 
Midterm Exam 2:
25%
 
Final Exam:
 30%
 
Attendance:
 5%
Grade Scale:
A+ [95…100] A [90…94] A- [85…89] B+ [80…84] B [76…79] B- [72…75] C+ [68…71] C [56…59] C- [52…55] D+ [48…51] D [46…47] D- [44…45] F [0…43]
 
There will be no curving of the final results in this class.
Midterm Exams:
There will be two midterm examinations
 
Midterm Exam 1 on Tuesday October 6, 2011 at 4pm in SOM 2.802 (our usual classroom)
 
Midterm Exam 2 on Thursday November 10, 2001 at 4pm in SOM 2.802 (our usual classroom)
Make-up Exams Policy:
All students in MATH 4301 will be given an opportunity to improve their performance in this class by retaking ONE midterm exam. Those students who missed an exam will  be allowed to take a make-up exam only if they have a valid excuse: e.g. illness, serious family obligations, accidents, etc. (see the current Academic Policies and Procedures for more information on excused absence from midterm and final examination). Textbooks, notes, scientific calculators or other electronic devises won't be allowed during examination. Rules governing the proper academic conduct and student's integrity will be strictly observed. Cheating and  plagiarism won't be tolerated (see the details below).
Student Learning Objectives
 
!"#
 
$%&'()%* ,-.. /( 0/.( %1 &*( %2( .0,* 13 .14-5 0)' /0*-5 *(% %2(167 %1 86(*()% 31690. 86113* 13 90%2(90%-50. *%0%(9()%*:
 
;-<() 8618(6%-(* 13 0 3&)5%-1) 16 0 *(%= *%&'()%* ,-.. /( 0/.( %1 -'()%-37 0''-%-1)0. 8618(6%-(* 0)' 86(*()% 86113* %1 >&*%-37 %2(-6 5.0-9*:
 
$%&'()%* ,-.. .(06) '-6(5% 86113*= 51)%60?81*-%-<( 86113*= 86113* /7 51)%60'-5%-1)* 0)' 86113* /7 -)'&5%-1): !@#
 
$%&'()%* ,-.. /( 0/.( %1 .(06) 31690. '(3-)-%-1)* 13 0)0.7%-50. 0)' %181.14-50. 51)5(8%* &*(' -) A0%2(90%-50. B)0.7*-* 0)' ,-.. /( 0/.( %1 861<( %2( 91*% -9816%0)% %2(16(9* -) C0.5&.&*:
 
;-<() '(3-)-%-1) 13 0 9(%6-5 *805(= *%&'()%* ,-.. /( 0/.( %1 -'()%-37 0)' 861<( 1%2(6 8618(6%-(* 13 %2-* *805(= -)5.&'-)4 *&52 51)5(8%* 0*D 5198.(%()(**= 519805%)(**= 51))(5%(')(**= 51)%-)&-%7 13 *8(5-3-5 3&)5%-1): $%&'()%* ,-.. /( 0/.( %1 861<( 0)' &*( E0)052 F-G('?H1-)% H6-)5-8.(:
 
$%&'()%* ,-.. /( 0/.( %1 861<( 0.. %2( 90-) %2(16(9* 13 *-)4.(?<06-0/.( 50.5&.&*D 520-) 6&.(= I06/1&G J(990= .KL18-%0.* 6&.(= J(-/)-%M 3169&.0= N07.16 F169&.0= F&)'09()%0. N2(16(9 13 C0.5&.&*
 
 
$%&'()%* ,-.. .(06) J1,(6 0)' O88(6 I06/1&G P)%(460.= Q-(90)) P)%(460.= 0)' ,-.. /( 0/.( %1 861<( 0.. %2( 8618(6%-(* 13 %2( Q-(90)) P)%(460.:
 
$%&'()%* ,-.. .(06) %2( 51)5(8% 13 Q-(90))?$%-(.%>(* -)%(460. !R#
 
$%&'()%* ,-.. .(06) 0''-%-1)0. %18-5* '(8()'-)4 1) %2( 0<0-.0/.( %-9(:
 
$%&'()%* ,-.. .(06) 0/1&% 4()(60. 8618(6%-(* 13 E0)052 *805(* ,-%2 %2( 3-)-%( '-9()*-1)0. *805(* 0* (G098.(* 13 E0)052 *805(*: N2( -'(0 13 51)%-)&-%7 0)' '-33(6()%-0/-.-%7 13 3&)5%-1)* /(%,(() E0)052 *805(* =0)'S16
 
$%&'()%* ,-.. .(06) 0''-%-1)0. 5198&%0%-1)0. 9(%21'* -) 0)0.7*-*= -)5.&'-)4 %2( 5198&%0%-1)* 13 5(6%0-) '-33-5&.% -)'(3-)-%( 0)' '(3-)-%( -)%(460.*:
Detailed Description of the Course:
No. Topics
 
Remarks 1.
 Introduction to Naïve Set Theory:
 sets and operations on sets.
 Introduction to Logic
: formal statements, connectives and logical statements, tautologies, quantifiers, rules and true-false tables.
 
2.
 Product of Sets, Relations and Functions:
 properties of a relation, equivalence relations, partial order relations, total order relations, function as an example of a relation. Injective, surjective and bijective  functions, images and inverse images under a function.
Cardinality and Countable Sets (including  Axiom of Choice):
 countability of rational numbers.
3.
Techniques of Proofs
: Inductive and deductive reasoning, axioms and  propositions. Theorems and the structure of a proof: direct proof, counter-positive proof,  proof by contradiction, proof by induction.
 
4.
 Real Numbers:
 axioms of a field, ordered  field and the completeness axiom—axioms of real numbers. Inductive sets, natural numbers and principle of induction.  Formal definition of powers, roots and logarithms.
5.
 Elementary Theory of Metric Spaces
: definition of a metric space and basic topological definition (open/closed sets, interiors, boundaries, closures of a set, limit  points). Complete metric spaces, completeness of real numbers (as a metric  space), limit of a function, continuity and  properties of continuous functions. Compactness in metric spaces, properties of compact sets and continuous functions on compact sets. Compactness in Euclidean

Premia la tua curiosità

Tutto ciò che desideri leggere.
Sempre. Ovunque. Su qualsiasi dispositivo.
Nessun impegno. Annulla in qualsiasi momento.
576648e32a3d8b82ca71961b7a986505