What this covers

Learn how to think the way mathematicians do - a powerful cognitive process developed over thousands of years. The goal of the course is to help you develop a valuable mental ability – a powerful way of thinking that our ancestors have developed over three thousand year

assignment and background reading : https://drive.google.com/drive/folders/1ItYXBOJFwPRkGRnjWZVv1c1h3zvOd3Tp?usp=sharing

#intromathematical #thinking #stanford

------------------------------------------------------------------------------------------------------------------------------------- If you realllly enjoy my content, you're welcome to support me and my channel with a small donation via PayPal

Link to PayPal donation https://www.paypal.me/nerdslesson

⌨️ This course is created in collaboration with Stanford University.

Source description (no synthesized summary yet).


The claims · ranked32 claims · weighted by value

This asset isn't compiled yet

You're seeing its claims, ranked. Compile it to build the argument threads, weight them, and check each claim against your library — the full view.

0.74

The conditional 'phi implies psi' in mathematics is defined truth-functionally (as false only when the antecedent is true and consequent is false) rather than semantically (requiring causal connection), because mathematical implications involve verifiable patterns but not necessarily causation, and this truth-functional definition allows mathematics to be mechanical and universally defined.

definitionhigh valueestablishednovelty 1/4durability 4/4· Keith Devlin

“we're going to split implication into two parts the conditional and causation the first part the conditional we're going to define entirely in terms of truth values and the second part we're going to leave to the philosophers”

0.74

A proof is a logically sound argument that establishes the truth of a statement, and the purpose of a proof is both to establish truth and to communicate understanding to others; therefore, proofs must be logically correct and also comprehensible to an intended audience.

definitionhigh valueestablishednovelty 1/4durability 4/4· Keith Devlin

“A proof of a statement must explain why that statement is true... To establish truth and to communicate to others constructing or reading a proof is how we convince ourselves that some statement is true.”

0.74

Hilbert's Hotel is a thought experiment showing that when a hotel has infinitely many rooms all occupied, a new guest can still be accommodated by moving all occupants to the next room, freeing room 1; this illustrates surprising properties of infinity.

factualhigh valueestablishednovelty 1/4durability 4/4· Keith Devlin

“The occupant of room one moves into room two the occupant of room two moves into room three and so on throughout the hotel in general the occupant of room n moves into room n plus one when you have done that room one is empty you put me in that room.”

0.74

The historical development from natural numbers (for counting) to integers (to represent negative values) to rationals (to measure physical quantities) to reals (to solve equations) reflects increasing expressive power needed for different mathematical purposes.

factualhigh valueestablishednovelty 1/4durability 4/4· Keith Devlin

“There was a historical progression from the natural numbers to the integers to the rational numbers to the real numbers that was largely a historical progression and it was done in order to have greater expressivity.”

0.73

Mathematical thinking differs fundamentally from high school mathematics because high school focuses on mastering procedures to solve various kinds of problems, giving mathematics the flavor of a cookbook, whereas university mathematics emphasizes learning to think differently—like a mathematician—by analyzing relationships rather than applying templates.

factualhigh valueestablishednovelty 2/4durability 4/4· Keith Devlin

“at high school the focus is primarily on mastering procedures to solve various kinds of problems that gives the subject very much the flavor of a cookbook full of mathematical recipes thinking inside boxes at university the focus is on learning to think a different way to think like a mathematician thinking outside the box”

0.70

In mathematics, divisibility 'a divides b' (denoted a|b) is a relation defined as: there exists an integer q such that b = qa. This is different from the fraction b/a, which is a number in the rationals or reals, not a relation between integers.

definitionhigh valueestablishednovelty 1/4durability 4/4· Keith Devlin

“hence a is divisible by b if and only if there's an integer q such that a equals b q... the notation that we use for divisibility is this b vertical line a denotes a is divisible by b... let me give you a warning at this point b divides into a or a is divisible by b is not the same as b divided by a with a slanted line”

0.70

The biconditional (φ ↔ ψ) is true when φ and ψ have the same truth value (both true or both false), because the biconditional is formally defined as the conjunction of the two conditionals (φ → ψ) ∧ (ψ → φ).

definitionhigh valueestablishednovelty 1/4durability 4/4· Keith Devlin

“Two statements φ and ψ are said to be logically equivalent or just equivalent if each implies the other... the biconditional is an abbreviation of φ conditional ψ and ψ conditional φ.”

0.70

Proof by contradiction is a method of proving a statement φ by assuming its negation (¬φ), deriving a contradiction or false statement, and concluding that the original assumption must be false, hence φ is true.

definitionhigh valueestablishednovelty 1/4durability 4/4· Keith Devlin

“To obtain a direct proof of some statement φ you have to generate an argument that culminates in φ... With proof by contradiction there is a clear starting point... you have to assume not φ... you reason until you reach a conclusion that's false.”

0.68

The ancient Greek mathematicians were the first to systematically study formal logic and the precise use of language in mathematics through their analysis of the logical connectives: and, or, not, implies, for all, and there exists.

factualhigh valueestablishednovelty 0/4durability 4/4· Keith Devlin

“the ancient greek mathematicians seem to have been the first to notice that all mathematical statements can be expressed using one of these simple forms and they made a systematic study of the key language terms involved namely and or not implies for all and their exists”

0.68

To prove that a statement of the form 'for all x, P(x)' is true, one takes an arbitrary x (without making any special assumptions about it beyond the constraints of the domain) and proves that P(x) holds; because the x is arbitrary, the proof applies to all x.

normativehigh valueestablishednovelty 0/4durability 4/4· Keith Devlin

“To prove a statement involving a universal quantifier suppose we wanted to prove a statement for all x a of x... one way is to take an arbitrary x and show that it satisfies a of x.”

0.68

To prove that a universally quantified statement is false, one must provide a counterexample—a single instance for which the property does not hold; finding many instances where the property does hold is not sufficient.

normativehigh valueestablishednovelty 0/4durability 4/4· Keith Devlin

“To show that the statement 'for every real number a the equation x squared plus a equals 0 has a real root' is false, all you need to do is find a single real number a for which the equation does not have a real root. Well why don't we just take a equals 1.”

0.68

The order of quantifiers in a logical statement matters crucially: 'for all x there exists y such that P(x,y)' is not the same as 'there exists y such that for all x P(x,y)'; switching the order changes the meaning.

factualhigh valueestablishednovelty 0/4durability 4/4· Keith Devlin

“For all m in the set of natural numbers there is an n in the set of natural numbers such that n is bigger than m... if I swap those quantifiers round and write exists an n such that for all m in n n is bigger than m... these are different.”

0.66

The Rational numbers Q are dense in the sense that between any two rationals r and s, there exists a rational t such that r < t < s, which can be proved by taking t = (r + s) / 2; however, the density of the rationals does not mean the rational line is complete, because there exist sets of rationals with upper bounds that have no least upper bound in the rationals.

factualhigh valueestablishednovelty 1/4durability 4/4· Keith Devlin

“if r and s are rationals with r less than s then there's a rational t such that r is less than t is less than s... well why don't we take t to be the mean of our and s well clearly r is less than t is less than s... the rational line is dense... density does not mean that there are no holes in the rational line”

0.66

The negation of 'all foreign cars are badly made' is 'at least one foreign car is well made', not 'all foreign cars are well made', because the latter would require that every single foreign car is well made, whereas the negation only requires that the universal claim is false, which happens if even one counterexample exists.

definitionhigh valueestablishednovelty 1/4durability 4/4· Keith Devlin

“what does the negation of this sentence... let me give you four possibilities... all phone cards are well made... all phone cards are not badly made... at least one foreign car is well made... at least one foreign car is not badly made... well i'm not giving you this as a quiz but i would like you to think for a minute as to which one of these you think is the negation of that original sentence”

0.66

Euler's polynomial p(n) = n² + n + 41 generates prime values for n = 1, 2, ..., 40, but p(41) = 41² is composite; this is a cautionary example showing that checking many cases does not constitute a proof.

factualhigh valueestablishednovelty 1/4durability 4/4· Keith Devlin

“Consider the formula p of n equals n squared plus n plus 41... all values of p of n for n equals 1 2 3 etc are prime numbers well not quite that's true until you reach n equals 41.”

0.66

Mathematics is fundamentally about proving statements—establishing their truth through rigorous logical argument rather than empirical observation or measurement as in natural sciences.

definitionhigh valueestablishednovelty 1/4durability 4/4· Keith Devlin

“Not only are mathematicians interested in statements like these, they are above all interested in knowing which statements are true and which are false. The truth or falsity in each case is demonstrated not by observation or measurements or experiments as in the natural sciences, but by a proof.”

0.64

In mathematics, the word 'or' is always interpreted as inclusive or—meaning 'at least one of the two is true'—not exclusive or, because inclusive or is more convenient and avoids ambiguity in formal proofs.

definitionhigh valueestablishednovelty 0/4durability 4/4· Keith Devlin

“in everyday english the word and is not commutative... in mathematics it's different we simply can't afford to have ambiguity floating around we have to make a choice between either the exclusive or or the inclusive or and for various reasons it turns out to be more convenient in mathematics to adopt the inclusive use”

0.64

Mathematical induction is a method for proving statements of the form 'for all natural numbers n, property P(n) holds' by (1) proving the base case P(1) is true, and (2) proving that for all n, if P(n) is true then P(n+1) is true; together these prove the statement for all n by the Principle of Mathematical Induction.

definitionhigh valueestablishednovelty 0/4durability 4/4· Keith Devlin

“suppose you want to prove a statement for all n a of n establish the following two statements one a of one that's known as the initial case or the initial step two prove the following statement for all n for all natural numbers n if a of n is true then a of n plus 1 is true that's known as the induction step”

0.64

Divisibility in the integers has the property that if a divides b and b divides c, then a divides c (transitivity); this is one of several fundamental properties of divisibility.

factualhigh valueestablishednovelty 0/4durability 4/4· Keith Devlin

“If a divides b and b divides c then a divides c... a divides b so there are integers d and e such that b equals d a... c equals e b... c equals e times d times a which again by the definition of divisibility means a divides c.”

0.64

A sequence {aₙ} of real numbers tends to a limit L (written aₙ → L as n → ∞) if and only if for all real numbers ε > 0, there exists a natural number N such that for all natural numbers n ≥ N, |aₙ - L| < ε; this definition makes precise the intuitive notion that the terms get arbitrarily close to L.

definitionhigh valueestablishednovelty 0/4durability 4/4· Keith Devlin

“a n tends to a as n tends to infinity if and only if for all real numbers epsilon greater than zero there is a natural number n such that for all m greater than or equal to n absolute value of am minus a is less than epsilon”

0.61

Working with others is crucial for mastering mathematical thinking because most of us cannot master this cognitive shift on our own; the process of discussing attempts and receiving critique on reasoning is essential, not optional.

normativehigh valueestablishednovelty 1/4durability 3/4· Keith Devlin

“few of us can master this crucial shift in thinking on our own that part's crucial a lot of what we'll be doing is not so much focused on right and wrong but on learning how to think about a problem”

0.60

Euclid's proof that there are infinitely many primes works by constructing the number N = (product of first n primes) + 1 and showing that either N is prime itself (and thus larger than all primes in the list) or N has a prime divisor not in the original list (since N leaves remainder 1 when divided by any prime in the list), so the list can always be extended, proving infinitude.

factualhigh valueestablishednovelty 0/4durability 4/4· Keith Devlin

“look at the number n defined as follows set n equal to p1 times p2 times p3 all the way up to pn multiply them all together and add one... if n is prime we found a prime number bigger than p n... if n is not prime then it's going to be divisible by a prime say p now p cannot be any of the primes p1 p2 p3 up to pn because if you divide any of those primes into n that prime will divide into this part and then there's a remainder of 1”

0.60

The square root of 2 is irrational, meaning it cannot be expressed as a ratio of two integers p and q, because if it could be, then squaring both sides gives 2 = p²/q², so 2q² = p², meaning p² is even, so p must be even; substituting p = 2r gives 2q² = 4r², so q² = 2r², meaning q is also even; but then p and q share a common factor of 2, contradicting the assumption that they have no common factors.

factualhigh valueestablishednovelty 0/4durability 4/4· Keith Devlin

“if square root of two were rational then there are natural numbers p q with no common factors such that the square root of two is p over q... squaring that equation gives me 2 equals p squared over q squared... 2q squared equals p squared... p squared is even... hence p is even... p equals 2r... 2q squared equals 4r squared... q squared equals 2r squared... q is even... p and q are both even... they can't be because we assumed p and q had no common factors”

0.60

The real numbers are complete in the sense that every non-empty set of real numbers that has an upper bound has a least upper bound in the real numbers; this completeness property is what distinguishes the reals from the rationals and is fundamental to calculus and modern analysis.

factualhigh valueestablishednovelty 0/4durability 4/4· Keith Devlin

“the completeness property of the real number system says that every non-empty set of rails that has an upper bound has at least upper bound and let me stress that that least upper bound is in the set of real numbers this one simple elegant statement is the key to the real number system and to most of modern mathematics”

0.60

The fundamental theorem of arithmetic states that every natural number greater than 1 is either prime or can be expressed as a product of primes in a way that is unique except for the order in which the primes are written.

factualhigh valueestablishednovelty 0/4durability 4/4· Keith Devlin

“Every natural number greater than 1 is either prime or can be expressed as a product of primes in a way that's unique except for the order in which they are written.”

0.60

De Morgan's Laws state: not(P and Q) ≡ (not P) or (not Q), and not(P or Q) ≡ (not P) and (not Q).

factualhigh valueestablishednovelty 0/4durability 4/4· Keith Devlin

“De Morgan's laws...if you take a negation with a disjunction you end up with a conjunction of the two negations and if you take a negation of a conjunction you end up with the disjunction of the two negations.”

0.56

Mathematics is fundamentally about identifying and analyzing abstract patterns—numerical patterns, patterns of shape, patterns of motion, patterns of behavior—rather than about calculation or procedure.

definitionhigh valuespeaker onlynovelty 2/4durability 4/4· Keith Devlin

“in the 1980s i was one of a number of mathematicians who advocated a new meme to capture what mathematics is today the science of patterns according to that description the mathematician identifies and analyzes abstract patterns can be numerical patterns patterns of shape patterns of motion patterns of behavior voting patterns in a population patterns of repeating chance events”

0.56

Ambiguity in language can have severe consequences in mathematics and related fields because mathematical statements must be interpreted literally rather than contextually, unlike in everyday communication where shared knowledge allows us to disambiguate unclear expressions.

causalhigh valuespeaker onlynovelty 2/4durability 4/4· Keith Devlin

“When people use language in everyday context to talk about everyday circumstances they share a common knowledge of the world, and that common knowledge can be relied upon to determine the intended meaning. But when mathematicians use language in their work there often is no shared common understanding. Moreover in mathematics the need for precision is paramount.”

0.52

Learning to think mathematically is psychologically similar to learning to ride a bike: it feels impossibly difficult until you get the hang of it, at which point it suddenly seems straightforward; the progress comes not from polished presentation but from repeated struggling and failing until the cognitive shift happens.

normativehigh valuespeaker onlynovelty 1/4durability 4/4· Keith Devlin

“it's like learning to ride a bike someone can ride up and down in front of you for many hours telling you how they do it but you won't learn to ride from watching them or having them explain it to you you have to keep trying it for yourself and failing until it eventually clicks”

0.52

In high school, grades and success came from quickly recognizing problem types and applying memorized solutions, but at university, students who relied on this strategy find themselves stuck because novel problems don't fit memorized patterns; these students must learn to read carefully, ask 'what is this problem really asking?', and reason from first principles.

causalhigh valuespeaker onlynovelty 1/4durability 4/4· Keith Devlin

“if you did well at math in school you probably got good at recognizing different kinds of problems so you can apply different techniques you learned at university you have to learn how to approach a new problem one that doesn't quite fit any template you're familiar with”

0.51

To solve a novel mathematical problem, one should first ask 'what does the problem ask?', 'what do I know?', and 'what kind of objects are involved?' rather than immediately searching for a procedure or template that resembles the problem.

normativehigh valuespeaker onlynovelty 2/4durability 4/4· Keith Devlin

“You have to start each new problem by analyzing the statement that you want to prove what exactly does it say what kind of argument might establish that claim.”

0.47

Most of mathematics for the past 300+ years has not entered high school curricula, yet the world has changed dramatically in the last 300 years, creating a major disconnect between what schools teach and what modern mathematics and science require.

causalhigh valuespeaker onlynovelty 1/4durability 2/4· Keith Devlin

“A lot of school mathematics dates back to medieval times with pretty well all the rest coming from the 17th century at the very latest. Virtually nothing from the last 300 years has found its way into the classroom. Yet the world we live in has changed dramatically in the last 10 years let alone the last 300.”