Linear Algebra Fall 2013 mathx.kaist.ac.kr/~schoi/teaching.html.

Slides:



Advertisements
Similar presentations
Brief Introduction to Logic. Outline Historical View Propositional Logic : Syntax Propositional Logic : Semantics Satisfiability Natural Deduction : Proofs.
Advertisements

Introduction to Proofs
– Alfred North Whitehead,
Logic and Set Theory.
Logic and Proof. Argument An argument is a sequence of statements. All statements but the first one are called assumptions or hypothesis. The final statement.
Brief Introduction to Logic. Outline Historical View Propositional Logic : Syntax Propositional Logic : Semantics Satisfiability Natural Deduction : Proofs.
Linear Algebra Textbook: J. Hefferon, “Linear Algebra”
So far we have learned about:
First Order Logic (chapter 2 of the book) Lecture 3: Sep 14.
MATH 330: Ordinary Differential Equations Fall 2014.
TR1413: Discrete Mathematics For Computer Science Lecture 1: Mathematical System.
Computability Thank you for staying close to me!! Learning and thinking More algorithms... computability.
THE TRANSITION FROM ARITHMETIC TO ALGEBRA: WHAT WE KNOW AND WHAT WE DO NOT KNOW (Some ways of asking questions about this transition)‏
Linear Systems The definition of a linear equation given in Chapter 1 can be extended to more variables; any equation of the form for real numbers.
2012: J Paul GibsonTSP: Mathematical FoundationsMAT7003/L5- CountingAndEnumeration.1 MAT 7003 : Mathematical Foundations (for Software Engineering) J Paul.
Linear Algebra Fall 2007 Teaching, grading policies, homeworks, and so on are to be found at: mathx.kaist.ac.kr/~schoi/teaching.html. Check for updates.
Introduction Information in science, business, and mathematics is often organized into rows and columns to form rectangular arrays called “matrices” (plural.
Scientific Method Lab.
First Order Logic. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about first order.
Section 11.2 Systems of Linear Equations
To construct a logical argument using algebraic properties
Mathematical Explanations and Arguments Number Theory for Elementary School Teachers: Chapter 1 by Christina Dionne Number Theory for Elementary School.
C OURSE : D ISCRETE STRUCTURE CODE : ICS 252 Lecturer: Shamiel Hashim 1 lecturer:Shamiel Hashim second semester Prepared by: amani Omer.
WARM UP EXERCSE Consider the right triangle below with M the midpoint of the hypotenuse. Is MA = MC? Why or why not? MC B A 1.
AOK. D6 Journal (5 th entry) TWE can imagination be objective if it is derived in the mind? If it is always subjective can it lead to knowledge?
Definitions of Reality (ref . Wiki Discussions)
Chapter 4: Elementary Number Theory and Methods of Proof 4.2 Direct Proof and Counter Example II: Rational Numbers 1 Such, then, is the whole art of convincing.
MGF 1107 Mathematics of Social Choice Part 1a – Introduction, Deductive and Inductive Reasoning.
Introduction to the Theory of Computation
As you know generally it is assumed that the Euler equation and the Navier-Stokes equation Are the equations written as some analogues of Newton equation.
Introduction to Proofs
Discrete Mathematics, Part II CSE 2353 Fall 2007 Margaret H. Dunham Department of Computer Science and Engineering Southern Methodist University Some slides.
Math 3121 Abstract Algebra I Section 0: Sets. The axiomatic approach to Mathematics The notion of definition - from the text: "It is impossible to define.
Teaching Students to Prove Theorems Session for Project NExT Fellows Presenter: Carol S. Schumacher Kenyon College and.
MAT 333 Fall  As we discovered with the Pythagorean Theorem examples, we need a system of geometry to convince ourselves why theorems are true.
Mathematics. We tend to think of math as an island of certainty in a vast sea of subjectivity, interpretability and chaos. What is it?
First Order Logic Lecture 2: Sep 9. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about.
Systems of Equations and Inequalities Systems of Linear Equations: Substitution and Elimination Matrices Determinants Systems of Non-linear Equations Systems.
Math 021.  An equation is defined as two algebraic expressions separated by an = sign.  The solution to an equation is a number that when substituted.
Solving Systems Using Elimination
Automated Reasoning Early AI explored how to automated several reasoning tasks – these were solved by what we might call weak problem solving methods as.
1 Introduction to Abstract Mathematics Chapter 2: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 2.3.
Great Theoretical Ideas in Computer Science.
Definitions of Reality (ref. Wiki Discussions). Reality Two Ontologic Approaches What exists: REALISM, independent of the mind What appears: PHENOMENOLOGY,
Artificial Intelligence “Introduction to Formal Logic” Jennifer J. Burg Department of Mathematics and Computer Science.
{ What is a Number? Philosophy of Mathematics.  In philosophy and maths we like our definitions to give necessary and sufficient conditions.  This means.
Logic UNIT 1.
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
Ch : Solving Systems of Equations Algebraically.
Advanced Engineering Mathematics, 7 th Edition Peter V. O’Neil © 2012 Cengage Learning Engineering. All Rights Reserved. CHAPTER 4 Series Solutions.
1 CS 381 Introduction to Discrete Structures Lecture #1 Syllabus Week 1.
MTH 070 Elementary Algebra Chapter 2 Equations and Inequalities in One Variable with Applications 2.4 – Linear Inequalities Copyright © 2010 by Ron Wallace,
CSE 311 Foundations of Computing I Lecture 25 Pattern Matching, Cardinality, Computability Spring
CS104:Discrete Structures Chapter 2: Proof Techniques.
Solve 7n – 2 = 5n + 6. Example 1: Solving Equations with Variables on Both Sides To collect the variable terms on one side, subtract 5n from both sides.
Chapter 4: System of Equations and Inequalities Section 4.4: Solving Linear Systems Using the Addition Method.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
5 Lecture in math Predicates Induction Combinatorics.
Notions & Notations - 1ICOM 4075 (Fall 2010) UPRM Department of Electrical and Computer Engineering University of Puerto Rico at Mayagüez Fall 2010 ICOM.
The History Of Calculus
TOK: Mathematics Unit 1 Day 1. 2 – B 2 = AB – B 2 Factorize both sides: (A+B)(A-B) = B(A-B) Divide both sides by (A-B): A = B = B Since A = B, B+B=B Add.
Chapter 1 Logic and proofs
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
Math Linear Algebra Introduction
Direct Proof and Counterexample I: Introduction
Math Linear Algebra Introduction
First Order Logic Rosen Lecture 3: Sept 11, 12.
Elementary Number Theory & Proofs
Philosophy of Mathematics: a sneak peek
Solving Systems of Linear Equations in Three Variables
Presentation transcript:

Linear Algebra Fall 2013 mathx.kaist.ac.kr/~schoi/teaching.html.

Course HPs klms.kaist.ac.kr: some announcements, can ask questions here, also link to my page. Also, grades for quizzes and exames. math.kaist.ac.kr/~schoi: homework, schedules, sample exams, class assistants, how to survive…

Purpose of mathematics Mathematics originates with Pythagoras. Babylonians and Egyptians had many computations but no proofs. Proofs are ways to justify your reasoning systematically so that the truth is democratically verified. That is most people agree with the statements. (Science starts with Ionians in the same way. )

We now grow out of high school mathematics Mathematics are taught as means to compute numbers. This is useful and very relevant to society and is what politicians and company presidents want. What is wrong with this? The real purpose of mathematics is to verify results and organize them into an understandable system of theorems and proofs. In this course, we begin. This is an opportunity for you to be more than just an engineer computing out numbers without understanding. A system of knowledge will aid you in finding right computations to do and verify your results often.

What is a proof? Proofs can be given only in a system with given axioms and logical operations as in Euclidean geometry. In the system, we have a way of organizing ideas so that experts agree and are not confused about the validity Rigorous proof is a certification of validity which we can rely on. Experimental scientists claim to use experiments to verify their results but science always involves models and assumptions which are not verifiable by experiments only.

Rigorous proof mathematics is very different In other fields, such as engineering, biology, statistics, chemisty, physics, a lot of reasoning that occur are often not acceptable to mathematics in pure point of view. What Science does is to set up some loose system which can be verified or falsified. This uses a lot of tradition and logic and imaginations. Often precise logical steps are missing. In pure mathematical proofs, we strive to eliminate any gaps in logic however plausible the reasoning might be. In applying mathematics to other fields, one needs to be careful about this distinction. Often, this is not followed completely. The other fields rely on authority more.

Learning rigorous mathematics The type of theorem and proof presentation of mathematics are formal and maybe is not the best way to learn. Communications with other people help. Abstract notions can be understood by specifying. That is find examples. Proofs can be more easily understood by using specific examples. Doing exercises.

Greek mathematics Pythagoras: first introduced formal methods of proofs. Proved Pythagoras theorem. Existence of Icohahedrons. Tried to show that universe is made of numbers. Plato: Tried to develop geometry to understand everything Euclide: A system of geometry Archimedes: integration, series, mechanics, physics Greek mathematics became a lost subject in the dark ages. Maybe people lost interest in thinking…

Beginning of abstract mathematics In 17th century, Newton discovered calculus and invented Newtonian mechanics. There were many applications. A golden age of mathematics in Europe 17-20th century follows. By 19th century, so much mathematics were developed and confusions began to arise. Existence questions were unanswerable in many cases.

Sets and logic Frege started logic and set theory. Everything should be put in logical fom. Russell, Whitehead tried to give foundations of mathematics using logic and set theory. Hilbert thought that this was possible. Godel found some problems with it. Brouwer began intuitionism. However, today most mathematicians are not following intuitionism.

What is an abstract mathematics? We pretend that only sets exists and logic is the only means to study sets. From set theory, we build objects such as numbers, vectors, functions so on and introduce definitions about them and study their relationships to one another. We prove theorems, lemmas, corollaries using logic and definitions. These mathematical objects and results are applied in many general situations by making concrete things abstract and conversely.

Why use abstract notions? An abstract notion stands for many things at the same time. (Like Object oriented programming in computer science) Sometimes abstract objects can be viewed as an another type of abstract objects. This gives us much freedom. Many problems can be viewed completely elementary if interpreted differently in abstract manner. If abstract ideas do work, it brings significant improveme nts.

Logic: the methods of proofs (more at logics notes at the course HP) To prove P  Q: Assume P is true and then prove Q. – Given Goal -, -, P  Q – Given Goal -,-, P Q (Direct proof)

–Convert to ~Q  ~P: Assume Q is false and prove P is false. Given Goal -,- P  Q Given Goal -,-, ~Q ~P Example: –Given: Goal –Given: Goal:

To prove ~P: 1. Re-express in positive form. 2. Assume P and reach a contradiction. – Given: -,- Goal: ~P – Given:-,-. P Goal: contradiction To use P  Q: –modus ponens: P, P  Q : Q – modus tollens: P  Q, ~Q; ~P To prove a goal of form P ^ Q: Prove P and Q separately. To use P ^ Q: Given as separate P and Q. To prove : Prove P  Q and Q  P. To use : Given as separate P  Q and Q  P

To use a given of form : Divide into cases: 1. Assume P and case 2. Assume Q. –Given Goal: --- –Case 1: Given P, Goal: -- –Case 2: Given Q, Goal:--- To prove a goal of form (1) Either prove P or prove Q (2) Assume P is false and show Q is true

–Example: Given: Goal: (divide by x here.) To prove a goal of form Given -,- Goal Given -,-, x arbitrary Goal P(x) To prove a goal of from Given -,- Goal Given -,-, x guessed Goal P(x)

–Example: Given x>0, Goal: Guess work Given Goal y(y+1)=x To use a given of form – x o introduced new variable P(x o ) existential instantiation To use a given of form We can plug in any value a for x.

Course outline Abstract vector spaces and linear transformations –Review matrices: solving equations by row operations. Reduced forms. –Vector spaces: abstract device –Linear transformations Classifications of linear transformations: invariants. –Polynomials: Ideals, generators –Determinants: invariant of linear maps –Elementary canonical forms –Rational form, Jordan forms Inner product spaces

Purpose of the course How to prove things: introductions to pure mathematics (and applied). Understand abstract notions. Using and finding examples Understand vector spaces, linear transformations Classify linear transformations independent of coordinate expressions.

Purpose of linear algebra People can add, subtract, multiply. Nonliear mathematics are hard Linearizations are good approximations (1st step) Linearizations are good design principles. Mathematical analysis, Quantum physics are linear (but infinite dimensional). Most of mathematics consist of linear objects or linear maps.

Linear algebra and higher level courses In algebra, field theory, rings, modules are generalizations of vector spaces or uses linear algebra. Number theory also uses linear alg. Linear maps are generalized to Lie groups, useful in many areas. Infinite dimensional generalization gives us mathematical analysis and quantum theory Geometries are analysized locally by linear algebra

Chapter 1. Linear equations Fields System of linear equations: Row equivalences, Row reduced echelon form, elementary marices Invertible matrice