THE SUMMATION NOTATION Ʃ

Similar documents
THE SUMMATION NOTATION Ʃ

Section 8.3 Polar Form of Complex Numbers

Complex Numbers. x = B B 2 4AC 2A. or x = x = 2 ± 4 4 (1) (5) 2 (1)

Section 3.6 Complex Zeros

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Formulas for the Determinant

Expected Value and Variance

From Biot-Savart Law to Divergence of B (1)

Lecture 12: Discrete Laplacian

8.6 The Complex Number System

Difference Equations

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1

The Geometry of Logit and Probit

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.

Exercises. 18 Algorithms

1 GSW Iterative Techniques for y = Ax

12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

MA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials

Open Systems: Chemical Potential and Partial Molar Quantities Chemical Potential

and problem sheet 2

Foundations of Arithmetic

CHAPTER 4. Vector Spaces

9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations

x = , so that calculated

Statistical Inference. 2.3 Summary Statistics Measures of Center and Spread. parameters ( population characteristics )

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

Week 5: Neural Networks

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

COS 521: Advanced Algorithms Game Theory and Linear Programming

The KMO Method for Solving Non-homogenous, m th Order Differential Equations

Discussion of Extensions of the Gauss-Markov Theorem to the Case of Stochastic Regression Coefficients Ed Stanek

Dynamic Programming. Preview. Dynamic Programming. Dynamic Programming. Dynamic Programming (Example: Fibonacci Sequence)

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Note on EM-training of IBM-model 1

Polynomials. 1 More properties of polynomials

ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

MEM 255 Introduction to Control Systems Review: Basics of Linear Algebra

Problem Set 9 Solutions

Introduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:

Math1110 (Spring 2009) Prelim 3 - Solutions

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

Linear Regression Analysis: Terminology and Notation

Week 2. This week, we covered operations on sets and cardinality.

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 3: Large deviations bounds and applications Lecturer: Sanjeev Arora

Density matrix. c α (t)φ α (q)

Module 9. Lecture 6. Duality in Assignment Problems

PRIMES 2015 reading project: Problem set #3

Grover s Algorithm + Quantum Zeno Effect + Vaidman

CHAPTER-5 INFORMATION MEASURE OF FUZZY MATRIX AND FUZZY BINARY RELATION

The Order Relation and Trace Inequalities for. Hermitian Operators

1 Convex Optimization

8 Derivation of Network Rate Equations from Single- Cell Conductance Equations

of Nebraska - Lincoln

Unit 5: Quadratic Equations & Functions

Supplementary Notes for Chapter 9 Mixture Thermodynamics

Mathematics Intersection of Lines

Linear Feature Engineering 11

Some basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C

Workshop: Approximating energies and wave functions Quantum aspects of physical chemistry

The exponential map of GL(N)

Economics 130. Lecture 4 Simple Linear Regression Continued

Definition. Measures of Dispersion. Measures of Dispersion. Definition. The Range. Measures of Dispersion 3/24/2014

More metrics on cartesian products

A how to guide to second quantization method.

Math 261 Exercise sheet 2

11 Tail Inequalities Markov s Inequality. Lecture 11: Tail Inequalities [Fa 13]

Solutions to Homework 7, Mathematics 1. 1 x. (arccos x) (arccos x) 1

The Expectation-Maximization Algorithm

Lecture 21: Numerical methods for pricing American type derivatives

Notes on Frequency Estimation in Data Streams

Frequency dependence of the permittivity

1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations

9. Complex Numbers. 1. Numbers revisited. 2. Imaginary number i: General form of complex numbers. 3. Manipulation of complex numbers

CHAPTER 14 GENERAL PERTURBATION THEORY

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Bernoulli Numbers and Polynomials

8.1 Arc Length. What is the length of a curve? How can we approximate it? We could do it following the pattern we ve used before

Department of Electrical & Electronic Engineeing Imperial College London. E4.20 Digital IC Design. Median Filter Project Specification

1 (1 + ( )) = 1 8 ( ) = (c) Carrying out the Taylor expansion, in this case, the series truncates at second order:

E Tail Inequalities. E.1 Markov s Inequality. Non-Lecture E: Tail Inequalities

Economics 101. Lecture 4 - Equilibrium and Efficiency

Analytical Chemistry Calibration Curve Handout

Errors for Linear Systems

Integrals and Invariants of Euler-Lagrange Equations

a b a In case b 0, a being divisible by b is the same as to say that

P A = (P P + P )A = P (I P T (P P ))A = P (A P T (P P )A) Hence if we let E = P T (P P A), We have that

Edge Isoperimetric Inequalities

MMA and GCMMA two methods for nonlinear optimization

9 Characteristic classes

CSC 411 / CSC D11 / CSC C11

= z 20 z n. (k 20) + 4 z k = 4

Quantum Mechanics for Scientists and Engineers. David Miller

The Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1

arxiv: v1 [math.ho] 18 May 2008

Physics 5153 Classical Mechanics. Principle of Virtual Work-1

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

Transcription:

Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the squares of the numbers, n many statstcal formulas. We need an effcent notaton for talkng about such operatons n the abstract. Sngle Subscrpt otaton Sngle Subscrpt otaton Lst ame Subscrpt The symbol s the lst name, or the name of the varable represented by the numbers on the lst. The symbol s a subscrpt, or poston ndcator. It ndcates whch number n the lst, startng from the top, you are referrng to. 4 Sngle Subscrpt otaton Sngle Subscrpt otaton 4 Sngle subscrpt notaton extends naturally to a stuaton where there are two or more lsts. For example suppose a course has 4 students, and they take two exams. The frst exam could be gven the varable name, the second Y, as n the table below. Chow s score on the second exam s observaton Y

Sngle Subscrpt otaton Student Y Smth 87 8 Chow Benedett 8 90 Abdul 9 97 Double Subscrpt otaton Usng dfferent varable names to stand for each lst works well when there are only a few lsts, but t can be awkward for at least two reasons. In some cases the number of lsts can become large. Ths arses qute frequently n some branches of psychology. When general theoretcal results are beng developed, we often wsh to express the noton of some operaton beng performed over all of the lsts. It s dffcult to express such deas effcently when each lst s represented by a dfferent letter, and the lst of letters s n prncple unlmted n sze. 7 8 Double Subscrpt otaton j Double Subscrpt otaton The frst subscrpt refers to the row that the partcular value s n, the second subscrpt refers to the column. 9 0 Double Subscrpt otaton Test your understandng by dentfyng n the table below. 4 4 Sngle Summaton otaton Many statstcal formulas nvolve repettve summng operatons. Consequently, we need a general notaton for expressng such operatons. We shall begn wth some smple examples, and work through to some that are more complex and challengng.

Sngle Summaton otaton Many summaton expressons nvolve just a sngle summaton operator. They have the followng general form stop value summaton ndex start value Rules of Summaton Evaluaton. The summaton operator governs everythng to ts rght, up to a natural break pont n the expresson.. Begn by settng the summaton ndex equal to the start value. Then evaluate the algebrac expresson governed by the summaton sgn.. Increase the value of the ndex by. Evaluate the expresson governed by the summaton sgn agan, and add the result to the prevous value. 4. Keep repeatng step untl the expresson has been evaluated and added for the stop value. At that pont the evaluaton s complete, and you stop. 4 Evaluatng a Smple Summaton Expresson Suppose our lst has just numbers, and they are,,,,. Evaluate Answer: + + + + = 7 Evaluatng a Smple Summaton Expresson Order of evaluaton can be crucal. Suppose our lst s stll,,,,. Evaluate Answer: ( ) + + + + = 7 = 89 The Algebra of Summatons Many facts about the way lsts of numbers behave can be derved usng some basc rules of summaton algebra. These rules are smple yet powerful. The frst constant rule The second constant rule The dstrbutve rule The Frst Constant Rule The frst rule s based on a fact that you frst learned when you were around 8 years old: multplcaton s smply repeated addton. That s, to compute tmes, you compute ++. Another way of vewng ths fact s that, f you add a constant a certan number of tmes, you have multpled the constant by the number of tmes t was added. 7 8

The Frst Constant Rule Symbolcally, we can express the rule as: y x a = ( y x + ) a The Frst Constant Rule (Smplfed Verson) Symbolcally, we can express the rule as: a = a 9 0 The Frst Constant Rule (Applcaton ote) The symbol a refers to any expresson, no matter how complcated, that does not vary as a functon of, the summaton ndex! Do not be msled by the form n whch the rule s expressed. Expand and evaluate the sum: Soluton: ( ) = + + + + = ( ) Express the sum usng summaton notaton: + + + + 4 8 Soluton: + = + 4 + + 8 Express the sum usng summaton notaton: + + + +... + n 4 8 Soluton: + + + +... + 4 8 n = n 4 4

Evaluate (a) (b) Soluton (a) k 4 ( + ) = ( + ) + ( + ) + ( + ) + ( + ) (b) k = j= k = k ( + ) j j= a + + + + ( ) ( ) = + + 9 + 7 + + = a = a + a + a + a 4 j Use the summaton propertes to 40 4 evaluate (a) (b) (c) ( ) Soluton (a) 40 = 40() = 00 Soluton Exercse Evaluate the followng: (b) (c) ( + ) = = = 0 4 4 4 4 4 ( ) = = 4(4 + )( 4 + ) = 4() = 988 7 8 Exercse Smplfy the followng: ( ) j The Second Constant Rule The second rule of summaton algebra, lke the frst, derves from a prncple we learned very early n our educatonal careers. When we were frst learnng algebra, we dscovered that a common multple could be factored out of addtve expressons. For example, x + y = ( x + y) 9 0

The Second Constant Rule The rule states that Agan, the rule appears to be sayng less than t actually s. At frst glance, t appears to be a rule about multplcaton. You can move a factorable constant outsde of a summaton operator. However, the term a could also stand for a fracton, and so the rule also apples to factorable dvsors n the summaton expresson. a = a The Second Constant Rule (s) Apply the Second Constant Rule to the followng: y The Dstrbutve Rule of Summaton Algebra The thrd rule of summaton algebra relates to a another fact that we learned early n our mathematcs educaton --- when numbers are added or subtracted, the orderng of addton and/or subtracton doesn't matter. For example ( + ) + ( + 4) = ( + + + 4) The Dstrbutve Rule of Summaton Algebra So, n summaton notaton, we have ( + ) = + Y Y Snce ether term could be negatve, we also have ( ) = Y Y 4 Defnton: The Sample Mean and Devaton Scores The sample mean of scores s defned as ther arthmetc average, = The orgnal scores are called raw scores. The devaton scores correspondng to the raw scores are defned as dx =