Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
28 views

Lecture 1: August 28: 1.1.1 A Few Items of Note

This lecture introduces some LaTeX macros and templates. It includes two lemmas with proofs that contain a figure. Various list styles and mathematical definitions are demonstrated. Pseudo-code for an algorithm is also presented. The lecture concludes with a citation example.

Uploaded by

Arv1nd
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
28 views

Lecture 1: August 28: 1.1.1 A Few Items of Note

This lecture introduces some LaTeX macros and templates. It includes two lemmas with proofs that contain a figure. Various list styles and mathematical definitions are demonstrated. Pseudo-code for an algorithm is also presented. The lecture concludes with a citation example.

Uploaded by

Arv1nd
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

10-725: Optimization Fall 2012

Lecture 1: August 28
Lecturer: Geoff Gordon/Ryan Tibshirani Scribes: scribe-name1,2,3

Note: LaTeX template courtesy of UC Berkeley EECS dept.


Disclaimer: These notes have not been subjected to the usual scrutiny reserved for formal publications.
They may be distributed outside this class only with the permission of the Instructor.

This lecture’s notes illustrate some uses of various LATEX macros. Take a look at this and imitate.

1.1 Some theorems and stuff

We now delve right into the proof.

Lemma 1.1 This is the first lemma of the lecture.

Proof: The proof is by induction on . . .. For fun, we throw in a figure.

Figure 1.1: A Fun Figure

This is the end of the proof, which is marked with a little box.

1.1.1 A few items of note

Here is an itemized list:

• this is the first item;

• this is the second item.

Here is an enumerated list:

1. this is the first item;

2. this is the second item.

1-1
1-2 Lecture 1: August 28

Here is an exercise:
Exercise: Show that P 6= NP.
Here is how to define things in the proper mathematical style. Let fk be the AN D − OR function, defined
by


 x1 if k = 0;
fk (x1 , x2 , . . . , x2k ) = AN D(fk−1 (x1 , . . . , x2k−1 ), fk−1 (x2k−1 +1 , . . . , x2k )) if k is even;
OR(fk−1 (x1 , . . . , x2k−1 ), fk−1 (x2k−1 +1 , . . . , x2k )) otherwise.

Theorem 1.2 This is the first theorem.

Proof: This is the proof of the first theorem. We show how to write pseudo-code now.
Consider a comparison between x and y:

if x or y or both are in S then


answer accordingly
else
Make the element with the larger score (say x) win the comparison
n
if F (x) + F (y) < t−1 then
F (x) ← F (x) + F (y)
F (y) ← 0
else
S ← S ∪ {x}
r ←r+1
endif
endif

This concludes the proof.

1.2 Next topic

Here is a citation, just for fun [CW87].

References
[CW87] D. Coppersmith and S. Winograd, “Matrix multiplication via arithmetic progressions,”
Proceedings of the 19th ACM Symposium on Theory of Computing, 1987, pp. 1–6.

You might also like