Introduction to Beamer

Size: px

Start display at page:

Download "Introduction to Beamer"

Julius Parks
6 years ago
Views:

1 Introduction to Beamer John Lindsay Orr July 13, 2009 John Lindsay Orr () Introduction to Beamer July 13, / 25

2 1 Welcome 2 Introduction to Beamer An example from Analysis Getting started John Lindsay Orr () Introduction to Beamer July 13, / 25

3 Welcome to Mathematical Literature! 1 Course organization 2 Does everyone have something to read? 3 Presentation schedule: 4 This week... John Lindsay Orr () Introduction to Beamer July 13, / 25

4 Welcome to Mathematical Literature! 1 Course organization 2 Does everyone have something to read? 3 Presentation schedule: 4 This week... John Lindsay Orr () Introduction to Beamer July 13, / 25

5 Welcome to Mathematical Literature! 1 Course organization 2 Does everyone have something to read? 3 Presentation schedule: 4 This week... John Lindsay Orr () Introduction to Beamer July 13, / 25

6 Welcome to Mathematical Literature! 1 Course organization 2 Does everyone have something to read? 3 Presentation schedule: 4 This week... John Lindsay Orr () Introduction to Beamer July 13, / 25

7 Plan for this week Monday Introduction, and Beamer Tuesday Panel discussion (I) Wednesday Panel discussion (II) Thursday Molly Williams Friday Molly Williams John Lindsay Orr () Introduction to Beamer July 13, / 25

8 Discussion on reading papers What issues have you encountered so far? Features of mathematical papers arxiv.org MathSciNet John Lindsay Orr () Introduction to Beamer July 13, / 25

9 Introduction to Beamer What is it? What can it do? Beamer sample Another Beamer sample PowerPoint sample Prosper sample John Lindsay Orr () Introduction to Beamer July 13, / 25

10 First example Theorem If f is continuous on [a, b] then it is Riemann integrable on [a, b]. Proof. Let ɛ > 0. Since f is continuous on the closed, bounded interval [a, b], therefore it is uniformly continuous. Find δ > 0 such that x y < δ implies f (x) f (y) < ɛ. Let P be a partition of [a, b] with mesh less than δ. For any x, y [x i 1, x i ], f (x) < f (y) + ɛ and so, M i (f ) m i (f ) + ɛ. Thus U(F ) = M i (f )(x i 1 x i ) (m i (f )+ɛ)(x i 1 x i ) = m i (f )(x i 1 x i ) The result follows, by Riemann s Condition. John Lindsay Orr () Introduction to Beamer July 13, / 25

11 First example Theorem If f is continuous on [a, b] then it is Riemann integrable on [a, b]. Proof. Let ɛ > 0. Since f is continuous on the closed, bounded interval [a, b], therefore it is uniformly continuous. Find δ > 0 such that x y < δ implies f (x) f (y) < ɛ. Let P be a partition of [a, b] with mesh less than δ. For any x, y [x i 1, x i ], f (x) < f (y) + ɛ and so, M i (f ) m i (f ) + ɛ. Thus U(F ) = M i (f )(x i 1 x i ) (m i (f ) + ɛ)(x i 1 x i ) = mi (f )(x i 1 x i ) + ɛ xi 1 x i John Lindsay Orr () Introduction to Beamer July 13, / 25

12 First example Theorem If f is continuous on [a, b] then it is Riemann integrable on [a, b]. John Lindsay Orr () Introduction to Beamer July 13, / 25

13 First example Theorem If f is continuous on [a, b] then it is Riemann integrable on [a, b]. Proof. Let ɛ > 0. Since f is continuous on the closed, bounded interval [a, b], therefore it is uniformly continuous. Find δ > 0 such that x y < δ implies f (x) f (y) < ɛ. Let P be a partition of [a, b] with mesh less than δ. John Lindsay Orr () Introduction to Beamer July 13, / 25

14 First example Theorem If f is continuous on [a, b] then it is Riemann integrable on [a, b]. Proof. Let ɛ > 0. Since f is continuous on the closed, bounded interval [a, b], therefore it is uniformly continuous. Find δ > 0 such that x y < δ implies f (x) f (y) < ɛ. Let P be a partition of [a, b] with mesh less than δ. For any x, y [x i 1, x i ], f (x) < f (y) + ɛ and so, M i (f ) m i (f ) + ɛ. John Lindsay Orr () Introduction to Beamer July 13, / 25

15 First example Theorem If f is continuous on [a, b] then it is Riemann integrable on [a, b]. Proof. For any x, y [x i 1, x i ], f (x) < f (y) + ɛ and so, M i (f ) m i (f ) + ɛ. Thus U(F ) = = M i (f )(x i 1 x i ) (m i (f ) + ɛ)(x i 1 x i ) m i (f )(x i 1 x i ) + ɛ = L(f ) + ɛ(b a) x i 1 x i John Lindsay Orr () Introduction to Beamer July 13, / 25

16 First example Theorem If f is continuous on [a, b] then it is Riemann integrable on [a, b]. Proof. For any x, y [x i 1, x i ], f (x) < f (y) + ɛ and so, M i (f ) m i (f ) + ɛ. Thus U(F ) = = M i (f )(x i 1 x i ) (m i (f ) + ɛ)(x i 1 x i ) m i (f )(x i 1 x i ) + ɛ = L(f ) + ɛ(b a) x i 1 x i John Lindsay Orr () Introduction to Beamer July 13, / 25

17 First example Theorem If f is continuous on [a, b] then it is Riemann integrable on [a, b]. John Lindsay Orr () Introduction to Beamer July 13, / 25

18 First example Theorem If f is continuous on [a, b] then it is Riemann integrable on [a, b]. Proof. Let ɛ > 0. Since f is continuous on the closed, bounded interval [a, b], therefore it is uniformly continuous. Find δ > 0 such that x y < δ implies f (x) f (y) < ɛ. Let P be a partition of [a, b] with mesh less than δ. John Lindsay Orr () Introduction to Beamer July 13, / 25

19 First example Theorem If f is continuous on [a, b] then it is Riemann integrable on [a, b]. Proof. Let ɛ > 0. Since f is continuous on the closed, bounded interval [a, b], therefore it is uniformly continuous. Find δ > 0 such that x y < δ implies f (x) f (y) < ɛ. Let P be a partition of [a, b] with mesh less than δ. For any x, y [x i 1, x i ], f (x) < f (y) + ɛ and so, M i (f ) m i (f ) + ɛ. John Lindsay Orr () Introduction to Beamer July 13, / 25

20 First example Theorem If f is continuous on [a, b] then it is Riemann integrable on [a, b]. Proof. Let ɛ > 0. Since f is continuous on the closed, bounded interval [a, b], therefore it is uniformly continuous. Find δ > 0 such that x y < δ implies f (x) f (y) < ɛ. Let P be a partition of [a, b] with mesh less than δ. For any x, y [x i 1, x i ], f (x) < f (y) + ɛ and so, M i (f ) m i (f ) + ɛ. John Lindsay Orr () Introduction to Beamer July 13, / 25

21 First example Theorem If f is continuous on [a, b] then it is Riemann integrable on [a, b]. Proof. For any x, y [x i 1, x i ], f (x) < f (y) + ɛ and so, M i (f ) m i (f ) + ɛ. Thus U(F ) = = M i (f )(x i 1 x i ) (m i (f ) + ɛ)(x i 1 x i ) m i (f )(x i 1 x i ) + ɛ = L(f ) + ɛ(b a) x i 1 x i John Lindsay Orr () Introduction to Beamer July 13, / 25

22 First example Theorem If f is continuous on [a, b] then it is Riemann integrable on [a, b]. Proof. For any x, y [x i 1, x i ], f (x) < f (y) + ɛ and so, M i (f ) m i (f ) + ɛ. Thus U(F ) = = M i (f )(x i 1 x i ) (m i (f ) + ɛ)(x i 1 x i ) m i (f )(x i 1 x i ) + ɛ = L(f ) + ɛ(b a) x i 1 x i John Lindsay Orr () Introduction to Beamer July 13, / 25

23 First example Theorem If f is continuous on [a, b] then it is Riemann integrable on [a, b]. Proof. The result follows, by Riemann s Condition. John Lindsay Orr () Introduction to Beamer July 13, / 25

24 Basic concepts Frame A frame consists of one or more layered slides. Overlay An overlay is a pattern which selects certain slides of a frame for an action. John Lindsay Orr () Introduction to Beamer July 13, / 25

25 A simple frame \begin{frame} \frametitle{put your title here}... \end{frame} John Lindsay Orr () Introduction to Beamer July 13, / 25

26 A simple frame \begin{frame} \frametitle{put your title here} \begin{enumerate} \item<1> One \item<2> Two \item<3> Three \end{enumerate} \end{frame} John Lindsay Orr () Introduction to Beamer July 13, / 25

27 A simple frame 1 One John Lindsay Orr () Introduction to Beamer July 13, / 25

28 A simple frame 2 Two John Lindsay Orr () Introduction to Beamer July 13, / 25

29 A simple frame 3 Three John Lindsay Orr () Introduction to Beamer July 13, / 25

30 A simple frame \begin{frame} \frametitle{put your title here} \begin{enumerate} \item<1-> One \item<2-> Two \item<3-> Three \end{enumerate} \end{frame} John Lindsay Orr () Introduction to Beamer July 13, / 25

31 A simple frame 1 One John Lindsay Orr () Introduction to Beamer July 13, / 25

32 A simple frame 1 One 2 Two John Lindsay Orr () Introduction to Beamer July 13, / 25

33 A simple frame 1 One 2 Two 3 Three John Lindsay Orr () Introduction to Beamer July 13, / 25

34 Overlays <2-4,6,7,10-> <-3> <4-> <1,9> John Lindsay Orr () Introduction to Beamer July 13, / 25

35 Using overlays Attach overlays to: Items \item<3-> Environments \begin{theorem}<2-5>...\end{theorem} and lemmas, proofs, etc. Specials Custom beamer commands; \alert<2>{foobar}, \only<2>{foobar}, \visible<2>{foobar}, \invisible<2>{foobar} John Lindsay Orr () Introduction to Beamer July 13, / 25

36 What else...? Customization Links and buttons Graphics Advanced overlays \alt{...} and \temporal{...} Document structure (appendix) John Lindsay Orr () Introduction to Beamer July 13, / 25

Introduction to Beamer

Introduction to Beamer T.Dultuya Department of Applied Mathematics School of Engineering and Applied Sciences National University of Mongolia April 1, 2015 Contents 1 2 Section, subsection Table of contents Frames 3 Contents