ank exists for each ]c (in which case

Size: px
Start display at page:

Download "ank exists for each ]c (in which case"

Transcription

1 BANACH ALGEBRA AND SUMMABILITY BY ALBERT WILANSKY AND KARL ZELLER 1 Several Banach algebras arise naturally in summability theory These are algebras of infinite matrices A (ak), n, ] 1, 2, The study of these algebras may have two products: the generation of examples of Banach algebras with certain properties; and, on the other hand, applications to the theory of summability which has, since 1929, benefited greatly from the theory of Banach space and linear topological space in general An example of such an application of Banach algebra is the observation that an element near the identity element has an inverse, which was applied to summability by Agnew and, for instance, was used extensively in [7] 2 Let AII supk ak I Then if A <, A is an endomorphism (= continuous linear transformation) of m, the Banach space of all bounded complex sequences, and A is its norm However, much significance is attached to the way in which A transforms sequences not in m Let, be the set of all matrices A with AII < Then is a Banach algebra;it is a closed proper subalgebra of the algebra of all endomorphisms of m Let c, Co be the spaces of convergent and null sequences For each n, ]c, [ak --< A and so the entries are continuous linear functionals on Let T be the subset of consisting of the triangular matrices, ie the matrices A such that auk 0 if ]C > n Since the entries are continuous, T is closed in It is clearly a subalgebra and has its inverses, ie A e T, A-le together imply A-le T Let F be the subset, clearly a subalgebra, of I, consisting of the conservative matrices, ie matrices A such that Ax e c whenever x e c A matrix A e belongs to F if and only if ak lim ank exists for each ]c (in which case [ ak < oo) and lim k ak exists Since auk and k ak are all linear functionals of unit norm, this shows that F is closed in We have also, [8], that F contains its inverses, ie A e P, A -1 e imply A- F It is in the proof of this result that we are forced (as far as we know) to consider the action of A on unbounded sequences For A P, let x(a) lim k ank ak Then x is a multiplicative linear functional, [8] If x(a) 0, A is called co-null, otherwise co-regular These terms were introduced in [6] Let A P n T, the set of conservative triangular matrices Many of the classical summability methods are defined by matrices in A, for example the Cesro, Nhrlund and Hausdorff methods We shall see, below, several fundamental structural differences between A and P, and individual differences e Received June 17, 1957 The second author holds a National Science Foundation research grant 378

2 BANACH ALG]BRA AND SUMMABILITY 379 between their members For example, if A e A and A-le A, then A must be a triangle (ie triangular and a 0 for each n) In this case A sums no divergent sequences, ie Ax c if x e c For bounded x this is trivial since A and A -1 preserve c as operators on re;for unbounded x it is also true since A-I(Ax) x The situation is quite different for F If A e F and A-le F, A sums no bounded divergent sequences, but may sum unbounded ones Indeed A need not be 1-1 for sequences outside m; see [8], Theorem 7, for a regular matrix which is its own inverse but is not 1-1; also we may consider a "principal diagonal matrix"; see [7] The crucial point is contained in this remark" Remark For A, B e T and any sequence x, Bx exists and A(Bx) AB(x), This remains true with instead of T if x is assumed bounded, but not if x is not assumed bounded Indeed there exists A F with A -1 e and sequence x 0 such that Ax 0, as was pointed out just preceding the remark 3 Let us consider an algebra with identity I Following [5] we define the radical to be the set of points A such that I BA has an inverse for every B (In our case, I BA will occasionally have an inverse matrix which does not lie in the space considered, ie no inverse "exists") We note the facts, given in [5]:I BA has an inverse if and only if I AB does The radical is a two-sided ideal If the algebra is a Banach algebra, the radical is closed The algebra is called semisimple if the radical contains only 0 The spectrum of A is the set of scalars z such that A zi has no inverse If A is in the radical, its spectrum contains only 0 It is clear that if f is a linear and multiplicative functional, f O, then for each A, f(a) is in the spectrum of A (since f(a IfA) 0 and fz is an ideal) Hence every element A in the radical has f(a) 0 This, applied to A with f x, proves that every matrix in the radical of A is co-null Theorem 2, below, proves much more than this We can also apply this remark to A or T with f(a) an, for a fixed n This proves that every matrix in the radical of z or T has all its diagonal elements zero THEOREM 1 and r are semisimple T and n are not semisimple Given A e, A 0, let x c, Ax O For example, if, for a certain n, k, we have ak 0, we may take x ti, a sequence of zeros save for a one in the ]ct place Define B e F as follows: B consists entirely of zeros except for a single column, and BAx x Then I BA carries x into 0, hence is not 1-1 and has no inverse This proves that A is not in the radical of or F, and hence that these spces are semisimple To prove the second part of the theorem is relatively easy For example, a triangular matrix with a single nonzero element, and that one occurring below the main diagonal, is easily seen to be in the radical of T and A However, we can give an exact description of these radicals

3 380 ALBERT WILANSKY AND KARL ZELLER THEOREM 2 For both T and A, a matrix A is in the radical if and only if its diagonal elements are zero and kl ankl is uniformly convergent For A this last condition is equivalent to "A is coercive," ie x is bounded Ax is convergent whenever The proof of the "if" part of this theorem was suggested by J A Schatz The details of the proof were worked out by E K Dorff We proved just before the statement of Theorem 1, that a matrix in the radical of A or T has zero diagonal Next, we shall show that a radical matrix A must have the uniform convergence property mentioned Consider first the case in which A is conservative, ie A e A Suppose that k ak is not uniformly convergent We first observe that A is not coercive since a coercive matrix must have, along with other properties, uniform convergence of the series mentioned Thus there exists a bounded sequence x such that y Ax is divergent; y must be bounded since A has finite norm, hence y has two distinct limit points, say yp(,) --+ a, yq(n) --+ We may assume p(n) T o q(n) each n Let B be defined as follows" for n < q(1) and all ], let b 0; for q(r) <= n < q(r q- 1) let b, 0 for ] p(r), ]c q(r), while Xn Yq(r) bn,q(r) yp(r) yq(r) y,(r) yq(r) The matrix B belongs to where M is an upper bound for all x I, [Y [; b 1 for each n >_- q(1), and each column of B terminates in a string of zeros (Thus, in fact, B is regular) Also By is a sequence whose n th term, for n >- q(1) is x Hence (I BA)x x By is a sequence terminating in zeros, a convergent sequence; call it z Thus the matrix I BA is a conservative triangular matrix which transforms a divergent sequence, x, into a convergent one, z Thus I BA cannot have an inverse, D, in A, since Dz would have to be convergent, while Dz x Hence A is not in the radical of A (The above construction is inspired by [1]) In the second case where A is not necessarily conservative, let us assume that A is in the radical and that 7 an is not uniformly convergent We -m(+i) can find fori 1, 2, LetBbea diagonal matrix withbnn lforn n(1), n(2), b 0 otherwise Then BA, a row submatrix of A, has no row submatrix with the uniform convergence property Similarly, form C such that CBA is a row submatrix of BA with the sequence of row sums convergent Then form DCBA with convergent first column, EDCBA with convergent second column, and so on Each of B, C, D, E, is diagonal with zeros and ones on the diagonal Let F be the matrix whose first row is the first row of A, whose second row is the second row of BA, whose third row is the third row of CBA, and so on; F is a submatrix of A, thus F GA with G Yp(r) Xn

4 BANACtt ALGEBRA AND SUMMABILITY 381 diagonal with zeros and ones on the diagonal; F is conservative but not coercive As above we can find H e A such that I HF has no inverse in A Then it has no inverse in T for F contains its inverses in (I, and so A contains its inverses in T Thus F is not in the radical of T But F GA, and this contradicts the assumption that A is in the radical and the fact that the radical is an ideal We now turn to the proof that if k a is uniformly convergent nd 0 for each n, then A belongs to the rdicm of T or A, whichever is if a appropriate First let us notice that A is u limit point of right-finite matrices, ie matrices B with b 0 for/c > m, m being some number depending only on B (This is not to be confused with row-finite, in which m depends on n) This is true since given e > 0 we choose K such that k>k ank < e for all n Let bk a for ]c < K, b 0 otherwise Then B is right-finite and lib- d]] < Since the rdiem is closed, we have only to prove tha any right-finite mtrix with zero diagonal is in the radical Since the radicm is closed under addition, it is sufficient to prove that matrix with only one nonzero column and zero diagonal is in the radical This we now do Let m be positive integer, and let a 0 for M1 n, k excep when k m; leta 0 for n _-< m Let B be an arbitrrymatrix in T (If A A, tak B A) Let D I BA exists Our next step is to see that D- < Let x be an rbitrary bounded sequence, and y D-x Thenx Dy y-- BAy; hence Yn Xn + Ym bnrarm aiid [yn txn[ + [Ym[" I!ali ][A r-----m+l Thus y is bounded, and D -1 is a matrix which preserves boundedness, ie ]]D-1]I < HenceD -l e w and so A is in the radical of w In caseaea, Clearly d 1 and D is triangular; heno D- then D e A and D -1 e T; as mentioned in 2 then D -1 e A Hence A is in the radical of A It is perhaps of interest to observe that the matrices in the radical are totally continuous operators on m since they are limits of operators of finite rank 4 Contained in the proof of Theorem 2 is the following result: LEMMA 41 In T, if A has an inverse (in T), then so does A + B for any right-finite B e T such that A + B is a triangle Related to this is e LEMMA 42 Let A e A and] ann l for all n, and let 1 ak > [[ A ]] 2 A- Then A, and A sums no divergent sequences The result is best possible in that the condition a 1 cannot be dropped and the 2 cannot be increased m--1 Proof Let _k=, [ak > > A 2; then for lrgen, ak > t, and so 2 a -_ ]a 1 :t a < A 1 < 1, -

5 382 ALBERT WILANSKY AND KARL ZELLER and A differs by a right-finite matrix from a matrix in the unit neighborhood of I By Lemma 41, the result follows To see that it cannot be improved in the way mentioned, consider first the Cesro matrix It satisfies ]akl > I]AII 2 but not a 1 Consider also the matrixa with ann an,n-1 1, ak 0 otherwise This matrix has a 1 and The result can be improved by replacing a 1 by a condition of the type lim a 1 with appropriate modifications An application of Lemma 42 is the known result that x is convergent if lx + -1 a xk is convergent, l ak < for the corresponding matrix A has lal ]IAI] 1 5 The set of co-null matrices is a two-sided ideal in, and a maximal linear subspace of 1 (since x is linear and multiplicative) but is not, clearly, an ideal in Indeed there exists co-null A with right inverse in (it could not have a left inverse in ); see [8] This shows that x cannot be extended to (I, so as to be linear and multiplicative We examine other subsets of P for the property of being an ideal For any sequence x, let (x) be the set of conservative matrices which sum x, ie transform x into a convergent sequence Clearly (x) F if and only if x is convergent, or equivalently I (x) if and only if (x) P LEMMA 51 (X) C (y) if and only if (x) (y) or (y) F This result is essentially due to Brudno, and t Erd6s and Rosenbloom, who prove it for bounded x; see [4] If x is unbounded, choose A e r such that A transforms into convergent sequences only sequences of the form ax -t- u, where a is a scalar, and u is convergent See [7] for existence of A Since A e (y), it follows that y a x + u THEOREM 3 In F, (x) is a right ideal if and only if x is convergent, a left ideal if and only if x is bounded (x) n A is, in A, a right ideal if and only if x is convergent, but is always a left ideal If x is bounded, we simply consider it as a point of m, and since we are dealing with endomorphisms of m, the result is trivial since A(Bx) (AB)x for any A, B e The same is true for A, B e A, whether x is bounded or not since A is row-finite See the earlier remark Next we assume that x is unbounded and show that (x) is not a left ideal in F There exists, [7], A (x) such that A has a two-sided inverse, iu fact IIA Ill < 1 Next we assume that x is divergent and show that (x) is not a right ideal Buck [2, 3] has shown that if A is any regular matrix and x is divergent, there exists a subsequence of x not summable by A Let B be the matrix such that Bx is the subsequence of x; then AB (x) and the result follows

6 BANACH ALGEBRA AND SUMMABILITY 383 LEMMA 52 Let x be such that (x) is a closed subset of F (x) n A is a closed subset of /), then f(a) lim Ax for A (x) defines a continuous function f o (x) (o (x) a) Here lim Ax means the limit of the convergent sequence Ax The result follows from the Banach-Steinhaus closure theorem and the facts f(a) lim limm ak xk, 7 a x <_- max k=l k=l l_k_m THEOREM 4 (X) is closed in F if and only if x is bounded (x) A is closed in A if and only if x is bounded Let x be bounded Let un(a) =1 ark xk Then lug(a)] <= (sup x I)ll A Thus/u is a uniformly bounded sequence of functionals, and so (x) is closed, being the set of all A such that lim u(a) exists For x unbounded, let r be any number, and n a subscript such that x > r Let A A be a matrix with only one nonzero column, the nh, which has n zeros and then ones Then A 1, lira Ax ]x > r By Lemma 52, (x) is not closed This completes the proof We could have shown that (x) is not closed in F for unbounded x by noting that I e (x); but this is false for A since I AII < 1, A e A, implies that A sums no divergent sequences Since we can, in fact, find a regular matrix A e (x) with III A as small as we wish, this yields a similar result for the subset of F consisting of multiplicative matrices, ie such that ak 0 for all It (They are called multiplierrive since for x c, Ax converges to a constant multiple, viz lim a, of lim x) But this is not so for the subset of consisting of multiplicative matrices; call this subset M THEOREM 4 (X) M is closed in M if and only if x is bounded Let x be unbounded As for the previous result we need merely show that given any positive integer s, there exists A e (x) i with AI] 1, lim Ax s (This cannot be found in [1], although it contains many examples of this type) Let {Xpn be a subsequence of x with xp > max (s, n) For n < p let auk n (the Kronecker delta), for p =< n < p+, let a 0 for lc p, ak S/Xpr if / p 5 Agnew, [1], has given several results of this type: if x and y are sequences, x divergent, then there exists a regular matrix A with y Ax He remarks that A cannot be expected to be triangular In fact, as we shall now see, the situation is worse with respect to triangular matrices, in that we cannot even expect to come close to y with Ax This is clearly related to the semi-

7 384 ALBERT WILANSKY AND KARL ZELLER simplicity of q) and lack thereof of T; for if, given arbitrary x, y, we could find A e T with Ax y, then, given B e T, let x By, choose A with Ax y, and so (I AB)y O, and B is not in the radical of T; hence T would be semisimple THEOREM 5 Let x be a bounded divergent sequence, y a bounded sequence; then there exists A e A such that y Ax has a finite number of nonzero terms, and hence is convergent There exist unbounded sequences x, y such that y Ax is divergent for every A e A The matrix mentioned in the first part of the theorem is the one called B, constructed in the proof of Theorem 2 so that By has x for its n h term for n sufficiently large For our present purpose we have interchanged x, y For the second part of the theorem, let B be the matrix given by bn-1 e, n 1, 2,- ;bn 0for]c n 1;where lenl < Letybea sequence such that x By is unbounded By Theorem 2, B is in the radical of A; hence, for any A A, I AB has an inverse and so does not transform any divergent sequence into c In particular (I AB)y c, and the theorem is proved Let s be the set of all sequences Agnew s results, mentioned above, state that the map from I to s given by A --- Ax is onto, x being a fixed unbounded sequence Indeed it is onto from the subset of I consisting of the regular matrices Theorem 5 says that it is onto sic as a map of A if x is bounded and divergent, but need not be onto sic if x is unbounded 7 The maximal group G of a Banach algebra is the set of elements with inverses The elements which are in the closure of the maximal group are of some general interest Mercer s theorem states that the Cesro matrix is such an element The following example is instructive Let A be the multiplicative matrix given by ann 1, a s, a 0 otherwise Then for0 =< s < 1, IlI- A[[ s < 1;henceAA, andaeg Fors > 1, let B be the matrix gotten from A by omitting the first row Then B e F, I s-lb 1Is < 1; hence B -1 e F, and, [7], Bx convergent implies that x u -t- av, where u e c, a is a scalar, and v is a fixed unbounded sequence (Here we also have used the fact that the set of sequences v such that By 0 is one-dimensional) But Bx is convergent if and only if Ax is Hence for 0 =< s < 1 and s > 1, A sums no bounded divergent sequences; and in the first case, 0 =< s < 1, A belongs to the maximal group The dividing line s 1 yields the matrix A1 which sums the bounded divergent sequence {(-1)} We conjecture that this behaviour is general" ie, let A be a matrix in A with ann 0 and with A not in the maximal group (ie A sums divergent sequences); then (we conjecture) A sums bounded divergent sequences if and only if it is in the closure of the maximal group Some writers have classed as pathological those matrices not summing any bounded divergent sequences The conjecture would relegate the nonpathological

8 BANACH ALGEBRA AND SUMMABILITY 385 matrices to a thin veneer on the maximal group As an indication of the possible difficulty of the problem we note the proof of Mercer s theorem REFERENCES 1 R P AGNEW, On ranges of inconsistency of regular Sransformations, and allied topics, Ann of Math (2), vol 32 (1931), pp R C BUCK, A note on subsequences, Bull/kmer Math Soc, vol 49 (1943), pp , An addendum to "A note on subsequences", Proc Amer Math Soc, vol 7 (1956), pp ) EIDSS AND P C ROSENBLOOM, Toeplitz methods which sum a given sequence, Bull Amer Math Soc, vol 52 (1946), pp E HILLE, Functional analysis and semi-groups, Amer Math Soc Colloquium Publications, vol 31 (1948) 6 A WlLANSXY, An applicalion of Banach linear functionals to summability, Trans Amer Math Soc, vol 67 (1949), pp A WILANSKY AND K ZELLER, Summalion of bounded divergent sequences, topological methods, Trans Amer Math Soc, vol 78 (1955), pp The inverse matrix in summabilily: reversible matrices, J London Math Soc, vol 32 (1957), pp LEHIGH UNIVERSITY BETHLEHEM PENNSYLVANIA WAYNE STATE UNIVERSITY DETROIT MICHIGAN

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1. MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

More information

NOTES ON LINEAR TRANSFORMATIONS

NOTES ON LINEAR TRANSFORMATIONS NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all

More information

Metric Spaces. Chapter 7. 7.1. Metrics

Metric Spaces. Chapter 7. 7.1. Metrics Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some

More information

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

More information

Systems of Linear Equations

Systems of Linear Equations Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and

More information

1 if 1 x 0 1 if 0 x 1

1 if 1 x 0 1 if 0 x 1 Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

More information

Solving Linear Systems, Continued and The Inverse of a Matrix

Solving Linear Systems, Continued and The Inverse of a Matrix , Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing

More information

RINGS WITH A POLYNOMIAL IDENTITY

RINGS WITH A POLYNOMIAL IDENTITY RINGS WITH A POLYNOMIAL IDENTITY IRVING KAPLANSKY 1. Introduction. In connection with his investigation of projective planes, M. Hall [2, Theorem 6.2]* proved the following theorem: a division ring D in

More information

BANACH AND HILBERT SPACE REVIEW

BANACH AND HILBERT SPACE REVIEW BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but

More information

( ) which must be a vector

( ) which must be a vector MATH 37 Linear Transformations from Rn to Rm Dr. Neal, WKU Let T : R n R m be a function which maps vectors from R n to R m. Then T is called a linear transformation if the following two properties are

More information

1 Norms and Vector Spaces

1 Norms and Vector Spaces 008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)

More information

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

More information

n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...

n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +... 6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence

More information

Solving Systems of Linear Equations

Solving Systems of Linear Equations LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how

More information

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces

More information

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2. Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

More information

Matrix Representations of Linear Transformations and Changes of Coordinates

Matrix Representations of Linear Transformations and Changes of Coordinates Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under

More information

Solutions to Math 51 First Exam January 29, 2015

Solutions to Math 51 First Exam January 29, 2015 Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not

More information

by the matrix A results in a vector which is a reflection of the given

by the matrix A results in a vector which is a reflection of the given Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that

More information

SOLUTIONS TO ASSIGNMENT 1 MATH 576

SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts

More information

Bipan Hazarika ON ACCELERATION CONVERGENCE OF MULTIPLE SEQUENCES. 1. Introduction

Bipan Hazarika ON ACCELERATION CONVERGENCE OF MULTIPLE SEQUENCES. 1. Introduction F A S C I C U L I M A T H E M A T I C I Nr 51 2013 Bipan Hazarika ON ACCELERATION CONVERGENCE OF MULTIPLE SEQUENCES Abstract. In this article the notion of acceleration convergence of double sequences

More information

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers

More information

THE DIMENSION OF A VECTOR SPACE

THE DIMENSION OF A VECTOR SPACE THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field

More information

MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

More information

Row Echelon Form and Reduced Row Echelon Form

Row Echelon Form and Reduced Row Echelon Form These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation

More information

T ( a i x i ) = a i T (x i ).

T ( a i x i ) = a i T (x i ). Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)

More information

16.3 Fredholm Operators

16.3 Fredholm Operators Lectures 16 and 17 16.3 Fredholm Operators A nice way to think about compact operators is to show that set of compact operators is the closure of the set of finite rank operator in operator norm. In this

More information

Vector and Matrix Norms

Vector and Matrix Norms Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty

More information

Continuity of the Perron Root

Continuity of the Perron Root Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North

More information

A note on companion matrices

A note on companion matrices Linear Algebra and its Applications 372 (2003) 325 33 www.elsevier.com/locate/laa A note on companion matrices Miroslav Fiedler Academy of Sciences of the Czech Republic Institute of Computer Science Pod

More information

SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH 31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

More information

Let H and J be as in the above lemma. The result of the lemma shows that the integral

Let H and J be as in the above lemma. The result of the lemma shows that the integral Let and be as in the above lemma. The result of the lemma shows that the integral ( f(x, y)dy) dx is well defined; we denote it by f(x, y)dydx. By symmetry, also the integral ( f(x, y)dx) dy is well defined;

More information

Math 312 Homework 1 Solutions

Math 312 Homework 1 Solutions Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please

More information

THE BANACH CONTRACTION PRINCIPLE. Contents

THE BANACH CONTRACTION PRINCIPLE. Contents THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,

More information

Duality of linear conic problems

Duality of linear conic problems Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least

More information

1 VECTOR SPACES AND SUBSPACES

1 VECTOR SPACES AND SUBSPACES 1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such

More information

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear

More information

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar

More information

Similarity and Diagonalization. Similar Matrices

Similarity and Diagonalization. Similar Matrices MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that

More information

Notes on metric spaces

Notes on metric spaces Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.

More information

1 Sets and Set Notation.

1 Sets and Set Notation. LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most

More information

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied

More information

Subspaces of R n LECTURE 7. 1. Subspaces

Subspaces of R n LECTURE 7. 1. Subspaces LECTURE 7 Subspaces of R n Subspaces Definition 7 A subset W of R n is said to be closed under vector addition if for all u, v W, u + v is also in W If rv is in W for all vectors v W and all scalars r

More information

Solving Systems of Linear Equations

Solving Systems of Linear Equations LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how

More information

Follow links for Class Use and other Permissions. For more information send email to: permissions@pupress.princeton.edu

Follow links for Class Use and other Permissions. For more information send email to: permissions@pupress.princeton.edu COPYRIGHT NOTICE: Ariel Rubinstein: Lecture Notes in Microeconomic Theory is published by Princeton University Press and copyrighted, c 2006, by Princeton University Press. All rights reserved. No part

More information

F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)

F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein) Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p

More information

Orthogonal Diagonalization of Symmetric Matrices

Orthogonal Diagonalization of Symmetric Matrices MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding

More information

Name: Section Registered In:

Name: Section Registered In: Name: Section Registered In: Math 125 Exam 3 Version 1 April 24, 2006 60 total points possible 1. (5pts) Use Cramer s Rule to solve 3x + 4y = 30 x 2y = 8. Be sure to show enough detail that shows you are

More information

10.2 ITERATIVE METHODS FOR SOLVING LINEAR SYSTEMS. The Jacobi Method

10.2 ITERATIVE METHODS FOR SOLVING LINEAR SYSTEMS. The Jacobi Method 578 CHAPTER 1 NUMERICAL METHODS 1. ITERATIVE METHODS FOR SOLVING LINEAR SYSTEMS As a numerical technique, Gaussian elimination is rather unusual because it is direct. That is, a solution is obtained after

More information

1. Let P be the space of all polynomials (of one real variable and with real coefficients) with the norm

1. Let P be the space of all polynomials (of one real variable and with real coefficients) with the norm Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 005-06-15 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok

More information

Suk-Geun Hwang and Jin-Woo Park

Suk-Geun Hwang and Jin-Woo Park Bull. Korean Math. Soc. 43 (2006), No. 3, pp. 471 478 A NOTE ON PARTIAL SIGN-SOLVABILITY Suk-Geun Hwang and Jin-Woo Park Abstract. In this paper we prove that if Ax = b is a partial signsolvable linear

More information

Metric Spaces. Chapter 1

Metric Spaces. Chapter 1 Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence

More information

Methods for Finding Bases

Methods for Finding Bases Methods for Finding Bases Bases for the subspaces of a matrix Row-reduction methods can be used to find bases. Let us now look at an example illustrating how to obtain bases for the row space, null space,

More information

Matrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.

Matrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that

More information

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

More information

Mathematical Methods of Engineering Analysis

Mathematical Methods of Engineering Analysis Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................

More information

These axioms must hold for all vectors ū, v, and w in V and all scalars c and d.

These axioms must hold for all vectors ū, v, and w in V and all scalars c and d. DEFINITION: A vector space is a nonempty set V of objects, called vectors, on which are defined two operations, called addition and multiplication by scalars (real numbers), subject to the following axioms

More information

LINEAR ALGEBRA W W L CHEN

LINEAR ALGEBRA W W L CHEN LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,

More information

0 <β 1 let u(x) u(y) kuk u := sup u(x) and [u] β := sup

0 <β 1 let u(x) u(y) kuk u := sup u(x) and [u] β := sup 456 BRUCE K. DRIVER 24. Hölder Spaces Notation 24.1. Let Ω be an open subset of R d,bc(ω) and BC( Ω) be the bounded continuous functions on Ω and Ω respectively. By identifying f BC( Ω) with f Ω BC(Ω),

More information

7 Gaussian Elimination and LU Factorization

7 Gaussian Elimination and LU Factorization 7 Gaussian Elimination and LU Factorization In this final section on matrix factorization methods for solving Ax = b we want to take a closer look at Gaussian elimination (probably the best known method

More information

MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.

MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all n-dimensional column

More information

ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction

ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING Abstract. In [1] there was proved a theorem concerning the continuity of the composition mapping, and there was announced a theorem on sequential continuity

More information

Metric Spaces Joseph Muscat 2003 (Last revised May 2009)

Metric Spaces Joseph Muscat 2003 (Last revised May 2009) 1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of

More information

Using row reduction to calculate the inverse and the determinant of a square matrix

Using row reduction to calculate the inverse and the determinant of a square matrix Using row reduction to calculate the inverse and the determinant of a square matrix Notes for MATH 0290 Honors by Prof. Anna Vainchtein 1 Inverse of a square matrix An n n square matrix A is called invertible

More information

Mathematical Induction

Mathematical Induction Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

More information

SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison

SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89 by Joseph Collison Copyright 2000 by Joseph Collison All rights reserved Reproduction or translation of any part of this work beyond that permitted by Sections

More information

CURVES WHOSE SECANT DEGREE IS ONE IN POSITIVE CHARACTERISTIC. 1. Introduction

CURVES WHOSE SECANT DEGREE IS ONE IN POSITIVE CHARACTERISTIC. 1. Introduction Acta Math. Univ. Comenianae Vol. LXXXI, 1 (2012), pp. 71 77 71 CURVES WHOSE SECANT DEGREE IS ONE IN POSITIVE CHARACTERISTIC E. BALLICO Abstract. Here we study (in positive characteristic) integral curves

More information

13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.

13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions. 3 MATH FACTS 0 3 MATH FACTS 3. Vectors 3.. Definition We use the overhead arrow to denote a column vector, i.e., a linear segment with a direction. For example, in three-space, we write a vector in terms

More information

1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. 1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

More information

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights

More information

1 Introduction to Matrices

1 Introduction to Matrices 1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns

More information

MATH PROBLEMS, WITH SOLUTIONS

MATH PROBLEMS, WITH SOLUTIONS MATH PROBLEMS, WITH SOLUTIONS OVIDIU MUNTEANU These are free online notes that I wrote to assist students that wish to test their math skills with some problems that go beyond the usual curriculum. These

More information

1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ]

1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ] 1 Homework 1 (1) Prove the ideal (3,x) is a maximal ideal in Z[x]. SOLUTION: Suppose we expand this ideal by including another generator polynomial, P / (3, x). Write P = n + x Q with n an integer not

More information

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

More information

Notes on Determinant

Notes on Determinant ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

More information

4.5 Linear Dependence and Linear Independence

4.5 Linear Dependence and Linear Independence 4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then

More information

Inner Product Spaces

Inner Product Spaces Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and

More information

Introduction to Topology

Introduction to Topology Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................

More information

Lecture 1: Schur s Unitary Triangularization Theorem

Lecture 1: Schur s Unitary Triangularization Theorem Lecture 1: Schur s Unitary Triangularization Theorem This lecture introduces the notion of unitary equivalence and presents Schur s theorem and some of its consequences It roughly corresponds to Sections

More information

Killer Te categors of Subspace in CpNN

Killer Te categors of Subspace in CpNN Three observations regarding Schatten p classes Gideon Schechtman Abstract The paper contains three results, the common feature of which is that they deal with the Schatten p class. The first is a presentation

More information

No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results

More information

The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors. The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

More information

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)! Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

More information

Row Ideals and Fibers of Morphisms

Row Ideals and Fibers of Morphisms Michigan Math. J. 57 (2008) Row Ideals and Fibers of Morphisms David Eisenbud & Bernd Ulrich Affectionately dedicated to Mel Hochster, who has been an inspiration to us for many years, on the occasion

More information

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

More information

GROUPS ACTING ON A SET

GROUPS ACTING ON A SET GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for

More information

Linear Algebra Review. Vectors

Linear Algebra Review. Vectors Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka kosecka@cs.gmu.edu http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa Cogsci 8F Linear Algebra review UCSD Vectors The length

More information

Notes on Symmetric Matrices

Notes on Symmetric Matrices CPSC 536N: Randomized Algorithms 2011-12 Term 2 Notes on Symmetric Matrices Prof. Nick Harvey University of British Columbia 1 Symmetric Matrices We review some basic results concerning symmetric matrices.

More information

LINEAR DIFFERENTIAL EQUATIONS IN DISTRIBUTIONS

LINEAR DIFFERENTIAL EQUATIONS IN DISTRIBUTIONS LINEAR DIFFERENTIAL EQUATIONS IN DISTRIBUTIONS LESLIE D. GATES, JR.1 1. Introduction. The main result of this paper is an extension of the analysis of Laurent Schwartz [l ] concerning the primitive of

More information

DIVISIBILITY AND GREATEST COMMON DIVISORS

DIVISIBILITY AND GREATEST COMMON DIVISORS DIVISIBILITY AND GREATEST COMMON DIVISORS KEITH CONRAD 1 Introduction We will begin with a review of divisibility among integers, mostly to set some notation and to indicate its properties Then we will

More information

Lecture 3: Finding integer solutions to systems of linear equations

Lecture 3: Finding integer solutions to systems of linear equations Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture

More information

Linear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:

Linear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold: Linear Algebra A vector space (over R) is an ordered quadruple (V, 0, α, µ) such that V is a set; 0 V ; and the following eight axioms hold: α : V V V and µ : R V V ; (i) α(α(u, v), w) = α(u, α(v, w)),

More information

10.2 Series and Convergence

10.2 Series and Convergence 10.2 Series and Convergence Write sums using sigma notation Find the partial sums of series and determine convergence or divergence of infinite series Find the N th partial sums of geometric series and

More information

Finite dimensional topological vector spaces

Finite dimensional topological vector spaces Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the

More information

4. CLASSES OF RINGS 4.1. Classes of Rings class operator A-closed Example 1: product Example 2:

4. CLASSES OF RINGS 4.1. Classes of Rings class operator A-closed Example 1: product Example 2: 4. CLASSES OF RINGS 4.1. Classes of Rings Normally we associate, with any property, a set of objects that satisfy that property. But problems can arise when we allow sets to be elements of larger sets

More information

Practice with Proofs

Practice with Proofs Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using

More information

x a x 2 (1 + x 2 ) n.

x a x 2 (1 + x 2 ) n. Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number

More information

Linear Codes. Chapter 3. 3.1 Basics

Linear Codes. Chapter 3. 3.1 Basics Chapter 3 Linear Codes In order to define codes that we can encode and decode efficiently, we add more structure to the codespace. We shall be mainly interested in linear codes. A linear code of length

More information