2011年11月27日星期日

WHAT IS THE DIFFERENCE BETWEEN A THEOREM, A LEMMA, AND A COROLLARY?


WHAT IS THE DIFFERENCE BETWEEN A THEOREM, A LEMMA,
AND A COROLLARY?
PROF. DAVE RICHESON

(1) Defi nition -- a precise and unambiguous description of the meaning of a mathematical term. It characterizes the meaning of a word by giving all the properties and only those properties that must be true.

(2) Theorem -- a mathematical statement that is proved using rigorous mathematical reasoning. In a mathematical paper, the term theorem is often reserved for the most important results.

(3) Lemma -- a minor result whose sole purpose is to help in proving a theorem. It is a stepping stone on the path to proving a theorem. Very occasionally lemmas can take on a life of their own (Zorn's lemma, Urysohn's lemma, Burnside's lemma, Sperner's lemma).

(4) Corollary -- a result in which the (usually short) proof relies heavily on a given theorem (we often say that "this is a corollary of Theorem A").

(5) Proposition -- a proved and often interesting result, but generally less important than a theorem.

(6) Conjecture -- a statement that is unproved, but is believed to be true (Collatz conjecture, Goldbach conjecture, twin prime conjecture).

(7) Claim -- an assertion that is then proved. It is often used like an informal lemma.

(8) Axiom/Postulate -- a statement that is assumed to be true without proof. These are the basic building blocks from which all theorems are proved (Euclid's ve postulates, Zermelo-Frankel axioms, Peano axioms).

(9) Identity -- a mathematical expression giving the equality of two (often variable) quantities (trigonometric identities, Euler's identity).

(10) Paradox -- a statement that can be shown, using a given set of axioms and defi nitions, to be both true and false. Paradoxes are often used to show the inconsistencies in a awed theory (Russell's paradox). The term paradox is often used informally to describe a surprising or counterintuitive result that follows from a given set of rules (Banach-Tarski paradox, Alabama paradox, Gabriel's horn).


2011年11月26日星期六

Depth-first search (DFS) for undirected graphs

http://www.algolist.net/Algorithms/Graph/Undirected/Depth-first_search

Algorithms and Data Structures

Here you find articles on the subjects of data structures, algorithms and programming concepts. Each and every article is supplemented with code snippets in both C++ and Java, so you can turn to the practice right after reading a tutorial. For the very beginners we developed articles about how to install a development environment and to write simple applications


http://www.algolist.net/

2011年11月21日星期一

Maximum likelihood (ML) & Expectation Maximization


  • Tutorial on Machine Learning Methods Part 3: Maximum likelihood (ML) & Expectation Maximization
  • [REFERENCE] Andrew Moore's tutorial on ML
  • [REFERENCE] Baum Welch's algorithm
  • [REFERENCE] A good starting point

2011年11月17日星期四

Computational geometry in C second edition

a very useful book for geometric algorithms with step-by-step code instructions

2011年11月9日星期三