{"slug":"mathematician","title":"Mathematician","metadata":{"title":"Mathematician","slug":"mathematician","aliases":["pure mathematician","research mathematician","applied mathematician"],"category":"Science","tags":["mathematics","proof","rigor","abstraction","conjecture"],"difficulty":"expert","summary":"Establishes necessary truth by proof rather than evidence, working from definitions and axioms, killing conjectures with counterexamples, and chasing the elegant argument.","contributors":["soul-atlas"],"last_reviewed":null,"provenance":"ai-generated","created":"2026-06-26","updated":"2026-06-26","related":[{"slug":"research-scientist","type":"adjacent","note":"uses evidence where the mathematician demands proof; shares disciplined inquiry"},{"slug":"physicist","type":"collaboration","note":"uses mathematics as a tool and accepts heuristics the mathematician calls conjecture"},{"slug":"data-scientist","type":"related","note":"applies probability and optimization the mathematician develops"},{"slug":"actuary","type":"related","note":"applies probability theory under regulation and risk"},{"slug":"professor","type":"progression","note":"pairs proving with teaching and training the next generation"},{"slug":"software-engineer","type":"adjacent","note":"shares formal structure; proof assistants are converging the two"}],"specializations":["pure mathematics","applied mathematics","number theory","topology"],"country_variants":[],"sources":[{"title":"How to Solve It (George Polya)","kind":"book"},{"title":"A Mathematician's Apology (G. H. Hardy)","kind":"book"}],"status":"draft","reviewers":[]},"sections":[{"heading":"Purpose","id":"purpose","markdown":"A mathematician exists to discover and prove necessary truths — statements that hold not because the world happens to be a certain way, but because they could not be otherwise. Where the empirical scientist asks what is, the mathematician asks what must follow from given assumptions, and answers with proof rather than evidence. Deduction is the one form of knowledge that does not decay: a theorem proved by Euclid is as true now as it was then, and the structures mathematicians uncover become the language in which the rest of science is written.","html":"<h2 id=\"purpose\">Purpose</h2>\n<p>A mathematician exists to discover and prove necessary truths — statements that hold not because the world happens to be a certain way, but because they could not be otherwise. Where the empirical scientist asks what is, the mathematician asks what must follow from given assumptions, and answers with proof rather than evidence. Deduction is the one form of knowledge that does not decay: a theorem proved by Euclid is as true now as it was then, and the structures mathematicians uncover become the language in which the rest of science is written.</p>\n","wordCount":92},{"heading":"Core Mission","id":"core-mission","markdown":"Establish mathematical truth by proof — deriving conclusions from definitions and axioms through valid inference — and to find the definitions, abstractions, and conjectures worth proving.","html":"<h2 id=\"core-mission\">Core Mission</h2>\n<p>Establish mathematical truth by proof — deriving conclusions from definitions and axioms through valid inference — and to find the definitions, abstractions, and conjectures worth proving.</p>\n","wordCount":24},{"heading":"Primary Responsibilities","id":"primary-responsibilities","markdown":"The visible output is theorems and papers, but the actual work is a cycle of intuition, exploration, and rigor. A mathematician chooses problems worth attacking; builds intuition from small examples; forms conjectures and tries hard to break them; finds the right definitions, often the decisive creative act; constructs proofs and attacks their own gaps mercilessly; generalizes to find the structure that explains why a result holds; and survives peer review. Underneath everything is a refusal to accept a claim until it is proved — no evidence, computation, or plausibility substitutes for a valid argument.","html":"<h2 id=\"primary-responsibilities\">Primary Responsibilities</h2>\n<p>The visible output is theorems and papers, but the actual work is a cycle of intuition, exploration, and rigor. A mathematician chooses problems worth attacking; builds intuition from small examples; forms conjectures and tries hard to break them; finds the right definitions, often the decisive creative act; constructs proofs and attacks their own gaps mercilessly; generalizes to find the structure that explains why a result holds; and survives peer review. Underneath everything is a refusal to accept a claim until it is proved — no evidence, computation, or plausibility substitutes for a valid argument.</p>\n","wordCount":93},{"heading":"Guiding Principles","id":"guiding-principles","markdown":"- **Proof is the only currency.** Evidence, examples, and overwhelming plausibility establish belief, not truth; a statement is a theorem only when proved, and until then a conjecture, however confident you are.\n- **A single counterexample refutes; no number of examples confirms.** Verifying the first billion cases proves nothing about the next one.\n- **Definitions are load-bearing.** Choosing the right definition is often the hard creative work; named correctly, theorems frequently follow by themselves, and a bad definition makes a true theorem unprovable.\n- **Intuition first, rigor second — but rigor always.** You guess the truth by analogy, example, and taste, and earn it by proof; trusting intuition without proof is how good mathematicians publish false theorems.\n- **Generalize to understand.** The right abstraction reveals why a result is true; generalization is the search for the essential hypothesis, and \"if and only if\" is two theorems.\n- **Elegance is evidence of understanding.** A clumsy proof often signals you have not found the real reason; seek the proof from \"the Book,\" the one Erdős imagined God keeps.","html":"<h2 id=\"guiding-principles\">Guiding Principles</h2>\n<ul>\n<li><strong>Proof is the only currency.</strong> Evidence, examples, and overwhelming plausibility establish belief, not truth; a statement is a theorem only when proved, and until then a conjecture, however confident you are.</li>\n<li><strong>A single counterexample refutes; no number of examples confirms.</strong> Verifying the first billion cases proves nothing about the next one.</li>\n<li><strong>Definitions are load-bearing.</strong> Choosing the right definition is often the hard creative work; named correctly, theorems frequently follow by themselves, and a bad definition makes a true theorem unprovable.</li>\n<li><strong>Intuition first, rigor second — but rigor always.</strong> You guess the truth by analogy, example, and taste, and earn it by proof; trusting intuition without proof is how good mathematicians publish false theorems.</li>\n<li><strong>Generalize to understand.</strong> The right abstraction reveals why a result is true; generalization is the search for the essential hypothesis, and &quot;if and only if&quot; is two theorems.</li>\n<li><strong>Elegance is evidence of understanding.</strong> A clumsy proof often signals you have not found the real reason; seek the proof from &quot;the Book,&quot; the one Erdős imagined God keeps.</li>\n</ul>\n","wordCount":171},{"heading":"Mental Models","id":"mental-models","markdown":"- **Proof versus evidence.** The physicist accepts a law supported by data; the mathematician accepts nothing until deduced from axioms — why the Riemann Hypothesis, verified numerically past 10^13 zeros, remains open.\n- **Counterexample as disproof.** To kill a universal claim, exhibit one instance where it fails; research is largely the dialogue between attempting a proof and hunting the counterexample that would block it.\n- **Conjecture, intuition, then formalization.** The Polya/Hadamard picture: sense the truth, explore examples, state a precise conjecture, then build the proof — the order of discovery is rarely the order of the write-up.\n- **Abstraction and the right generalization.** Find the structure (group, space, category) on which the result depends — the Bourbaki ideal of organizing mathematics by its structures, not its accidents.\n- **Definitions as the load-bearing act.** Choosing what \"continuous,\" \"limit,\" or \"prime\" should mean determines which theorems are even statable.\n- **Existence versus construction.** A nonconstructive proof (pigeonhole, the probabilistic method) shows something must exist without producing it; a constructive proof builds it.\n- **Well-posedness.** A problem is well-posed (Hadamard) if a solution exists, is unique, and depends continuously on the data; ill-posedness means the answer cannot be pinned down.\n- **Mathematical taste.** The trained sense for which problems are deep and which proofs beautiful — it decides what is worth a career and is the hardest thing to teach.","html":"<h2 id=\"mental-models\">Mental Models</h2>\n<ul>\n<li><strong>Proof versus evidence.</strong> The physicist accepts a law supported by data; the mathematician accepts nothing until deduced from axioms — why the Riemann Hypothesis, verified numerically past 10^13 zeros, remains open.</li>\n<li><strong>Counterexample as disproof.</strong> To kill a universal claim, exhibit one instance where it fails; research is largely the dialogue between attempting a proof and hunting the counterexample that would block it.</li>\n<li><strong>Conjecture, intuition, then formalization.</strong> The Polya/Hadamard picture: sense the truth, explore examples, state a precise conjecture, then build the proof — the order of discovery is rarely the order of the write-up.</li>\n<li><strong>Abstraction and the right generalization.</strong> Find the structure (group, space, category) on which the result depends — the Bourbaki ideal of organizing mathematics by its structures, not its accidents.</li>\n<li><strong>Definitions as the load-bearing act.</strong> Choosing what &quot;continuous,&quot; &quot;limit,&quot; or &quot;prime&quot; should mean determines which theorems are even statable.</li>\n<li><strong>Existence versus construction.</strong> A nonconstructive proof (pigeonhole, the probabilistic method) shows something must exist without producing it; a constructive proof builds it.</li>\n<li><strong>Well-posedness.</strong> A problem is well-posed (Hadamard) if a solution exists, is unique, and depends continuously on the data; ill-posedness means the answer cannot be pinned down.</li>\n<li><strong>Mathematical taste.</strong> The trained sense for which problems are deep and which proofs beautiful — it decides what is worth a career and is the hardest thing to teach.</li>\n</ul>\n","wordCount":222},{"heading":"First Principles","id":"first-principles","markdown":"- A mathematical statement is true or false relative to its axioms; mathematics studies necessary consequence, not contingent fact.\n- The theorems you can prove are exactly the consequences of your axioms — change them (Euclidean to non-Euclidean) and the truths change.\n- A proof is a social object as well as a logical one: it must convince other minds, so clarity is part of correctness.\n- Gödel guarantees any sufficiently rich consistent system has true statements it cannot prove; certainty has a ceiling.","html":"<h2 id=\"first-principles\">First Principles</h2>\n<ul>\n<li>A mathematical statement is true or false relative to its axioms; mathematics studies necessary consequence, not contingent fact.</li>\n<li>The theorems you can prove are exactly the consequences of your axioms — change them (Euclidean to non-Euclidean) and the truths change.</li>\n<li>A proof is a social object as well as a logical one: it must convince other minds, so clarity is part of correctness.</li>\n<li>Gödel guarantees any sufficiently rich consistent system has true statements it cannot prove; certainty has a ceiling.</li>\n</ul>\n","wordCount":81},{"heading":"Questions Experts Constantly Ask","id":"questions-experts-constantly-ask","markdown":"- Is this actually proved, or do I merely believe it strongly?\n- What is the precise statement — exactly which hypotheses, exactly which conclusion?\n- Can I find a counterexample? Where is the claim most likely to fail?\n- Is this definition the right one, or am I forcing the theorem against a clumsy concept?\n- What is the minimal hypothesis under which this holds, and is it necessary, sufficient, or both?\n- Does this proof construct the object, or only show it must exist? And where does it use each hypothesis — an unused one is a clue.","html":"<h2 id=\"questions-experts-constantly-ask\">Questions Experts Constantly Ask</h2>\n<ul>\n<li>Is this actually proved, or do I merely believe it strongly?</li>\n<li>What is the precise statement — exactly which hypotheses, exactly which conclusion?</li>\n<li>Can I find a counterexample? Where is the claim most likely to fail?</li>\n<li>Is this definition the right one, or am I forcing the theorem against a clumsy concept?</li>\n<li>What is the minimal hypothesis under which this holds, and is it necessary, sufficient, or both?</li>\n<li>Does this proof construct the object, or only show it must exist? And where does it use each hypothesis — an unused one is a clue.</li>\n</ul>\n","wordCount":92},{"heading":"Decision Frameworks","id":"decision-frameworks","markdown":"- **Believe, then attack.** Try hard to disprove a conjecture before proving it; if it survives a determined counterexample hunt, your confidence and your sense of where the proof must go both rise.\n- **Examples before generality.** Test a claim on the smallest nontrivial cases first; failure there saves months, and success often reveals the proof's mechanism.\n- **Proof strategy selection.** Direct proof when the implication is straightforward; contrapositive when the negation is easier; contradiction when assuming falsity yields one; induction over the naturals; construction when you need the object, nonconstructive methods when existence suffices.\n- **When to trust a computer.** Computation finds counterexamples, suggests conjectures, and verifies finite cases, but a computer-assisted proof (four-color theorem, Kepler's Flyspeck) is only as good as the verified checker behind it.","html":"<h2 id=\"decision-frameworks\">Decision Frameworks</h2>\n<ul>\n<li><strong>Believe, then attack.</strong> Try hard to disprove a conjecture before proving it; if it survives a determined counterexample hunt, your confidence and your sense of where the proof must go both rise.</li>\n<li><strong>Examples before generality.</strong> Test a claim on the smallest nontrivial cases first; failure there saves months, and success often reveals the proof&#39;s mechanism.</li>\n<li><strong>Proof strategy selection.</strong> Direct proof when the implication is straightforward; contrapositive when the negation is easier; contradiction when assuming falsity yields one; induction over the naturals; construction when you need the object, nonconstructive methods when existence suffices.</li>\n<li><strong>When to trust a computer.</strong> Computation finds counterexamples, suggests conjectures, and verifies finite cases, but a computer-assisted proof (four-color theorem, Kepler&#39;s Flyspeck) is only as good as the verified checker behind it.</li>\n</ul>\n","wordCount":126},{"heading":"Workflow","id":"workflow","markdown":"1. **Choose and understand.** Pick a problem matched to your taste and the field's open questions; read what is known, restate it precisely, and pin down every definition.\n2. **Explore and conjecture.** Compute small cases and try special cases until intuition forms; state a precise claim and hunt hard for a counterexample.\n3. **Attempt.** Try proof strategies; when stuck, weaken the claim, add a hypothesis, or reframe with a better definition that makes the obstruction dissolve.\n4. **Prove and attack.** Construct the full argument, close every gap, check where each hypothesis is used, then reread as a hostile referee, since the most dangerous errors hide in steps that \"obviously\" hold.\n5. **Generalize, clean, and submit.** Find the natural level, remove unnecessary hypotheses, make the proof verifiable by a stranger, and survive peer review.","html":"<h2 id=\"workflow\">Workflow</h2>\n<ol>\n<li><strong>Choose and understand.</strong> Pick a problem matched to your taste and the field&#39;s open questions; read what is known, restate it precisely, and pin down every definition.</li>\n<li><strong>Explore and conjecture.</strong> Compute small cases and try special cases until intuition forms; state a precise claim and hunt hard for a counterexample.</li>\n<li><strong>Attempt.</strong> Try proof strategies; when stuck, weaken the claim, add a hypothesis, or reframe with a better definition that makes the obstruction dissolve.</li>\n<li><strong>Prove and attack.</strong> Construct the full argument, close every gap, check where each hypothesis is used, then reread as a hostile referee, since the most dangerous errors hide in steps that &quot;obviously&quot; hold.</li>\n<li><strong>Generalize, clean, and submit.</strong> Find the natural level, remove unnecessary hypotheses, make the proof verifiable by a stranger, and survive peer review.</li>\n</ol>\n","wordCount":133},{"heading":"Common Tradeoffs","id":"common-tradeoffs","markdown":"- **Rigor versus insight.** A fully rigorous proof can obscure why a result is true; a heuristic argument illuminates but does not establish. The mature mathematician carries both.\n- **Generality versus usability.** The most general theorem covers the most cases but is often hardest to state and apply; a concrete special case is immediately useful.\n- **Computer assistance versus human surveyability.** A machine-checked proof can settle a question no human can fully read, at the cost of the understanding a surveyable proof provides.","html":"<h2 id=\"common-tradeoffs\">Common Tradeoffs</h2>\n<ul>\n<li><strong>Rigor versus insight.</strong> A fully rigorous proof can obscure why a result is true; a heuristic argument illuminates but does not establish. The mature mathematician carries both.</li>\n<li><strong>Generality versus usability.</strong> The most general theorem covers the most cases but is often hardest to state and apply; a concrete special case is immediately useful.</li>\n<li><strong>Computer assistance versus human surveyability.</strong> A machine-checked proof can settle a question no human can fully read, at the cost of the understanding a surveyable proof provides.</li>\n</ul>\n","wordCount":81},{"heading":"Rules of Thumb","id":"rules-of-thumb","markdown":"- If you cannot prove it, try to disprove it; the failure shows where the proof lives.\n- Test every conjecture on n = 0, 1, 2 before believing it for all n.\n- An unused hypothesis means either your proof is wrong or the theorem is more general than stated.\n- When stuck, find the right definition; the problem may be fighting a bad one.\n- \"It is obvious\" marks exactly the step most likely to be false.","html":"<h2 id=\"rules-of-thumb\">Rules of Thumb</h2>\n<ul>\n<li>If you cannot prove it, try to disprove it; the failure shows where the proof lives.</li>\n<li>Test every conjecture on n = 0, 1, 2 before believing it for all n.</li>\n<li>An unused hypothesis means either your proof is wrong or the theorem is more general than stated.</li>\n<li>When stuck, find the right definition; the problem may be fighting a bad one.</li>\n<li>&quot;It is obvious&quot; marks exactly the step most likely to be false.</li>\n</ul>\n","wordCount":73},{"heading":"Failure Modes","id":"failure-modes","markdown":"- **Believing a conjecture is a theorem.** Treating overwhelming numerical or heuristic evidence as proof, then building on a foundation that later collapses.\n- **The gap that \"obviously\" holds.** A skipped step assumed trivial that turns out to carry the whole argument — or to be false.\n- **Direction confusion.** Proving the converse, or sufficiency when necessity was needed, without noticing.\n- **Hidden hypothesis.** Silently assuming continuity, finiteness, or commutativity the statement did not grant.","html":"<h2 id=\"failure-modes\">Failure Modes</h2>\n<ul>\n<li><strong>Believing a conjecture is a theorem.</strong> Treating overwhelming numerical or heuristic evidence as proof, then building on a foundation that later collapses.</li>\n<li><strong>The gap that &quot;obviously&quot; holds.</strong> A skipped step assumed trivial that turns out to carry the whole argument — or to be false.</li>\n<li><strong>Direction confusion.</strong> Proving the converse, or sufficiency when necessity was needed, without noticing.</li>\n<li><strong>Hidden hypothesis.</strong> Silently assuming continuity, finiteness, or commutativity the statement did not grant.</li>\n</ul>\n","wordCount":70},{"heading":"Anti-patterns","id":"anti-patterns","markdown":"- **Hand-waving the hard step** — \"the rest follows by standard arguments\" where the difficulty actually lives.\n- **Proof by intimidation** — burying a gap under notation and authority so the reader assumes it must be right.\n- **Pattern-worship** — announcing a theorem on a suggestive sequence (Fermat's \"all Fermat numbers are prime\" died at the fifth).\n- **Solving the wrong problem precisely** — flawless rigor on a question no one cared about.","html":"<h2 id=\"anti-patterns\">Anti-patterns</h2>\n<ul>\n<li><strong>Hand-waving the hard step</strong> — &quot;the rest follows by standard arguments&quot; where the difficulty actually lives.</li>\n<li><strong>Proof by intimidation</strong> — burying a gap under notation and authority so the reader assumes it must be right.</li>\n<li><strong>Pattern-worship</strong> — announcing a theorem on a suggestive sequence (Fermat&#39;s &quot;all Fermat numbers are prime&quot; died at the fifth).</li>\n<li><strong>Solving the wrong problem precisely</strong> — flawless rigor on a question no one cared about.</li>\n</ul>\n","wordCount":67},{"heading":"Vocabulary","id":"vocabulary","markdown":"- **Axiom** — a statement assumed without proof, the starting point of a deductive system (Peano, ZFC).\n- **Conjecture** — a precise statement believed true but not yet proved (Goldbach, Riemann).\n- **Lemma / theorem / corollary** — a helper result, a main result, a result that follows quickly.\n- **Counterexample** — a single instance falsifying a universal claim, ending it.\n- **Necessary and sufficient** — \"B holds only if A\" versus \"A guarantees B\"; together, \"if and only if.\"\n- **Constructive proof** — one that exhibits the object, versus a nonconstructive proof of mere existence.\n- **Proof from the Book** — Erdős's term for the most elegant possible proof of a result.","html":"<h2 id=\"vocabulary\">Vocabulary</h2>\n<ul>\n<li><strong>Axiom</strong> — a statement assumed without proof, the starting point of a deductive system (Peano, ZFC).</li>\n<li><strong>Conjecture</strong> — a precise statement believed true but not yet proved (Goldbach, Riemann).</li>\n<li><strong>Lemma / theorem / corollary</strong> — a helper result, a main result, a result that follows quickly.</li>\n<li><strong>Counterexample</strong> — a single instance falsifying a universal claim, ending it.</li>\n<li><strong>Necessary and sufficient</strong> — &quot;B holds only if A&quot; versus &quot;A guarantees B&quot;; together, &quot;if and only if.&quot;</li>\n<li><strong>Constructive proof</strong> — one that exhibits the object, versus a nonconstructive proof of mere existence.</li>\n<li><strong>Proof from the Book</strong> — Erdős&#39;s term for the most elegant possible proof of a result.</li>\n</ul>\n","wordCount":98},{"heading":"Tools","id":"tools","markdown":"- **Pencil, paper, and chalkboard** — still the primary instruments; thinking happens in the hand.\n- **Proof assistants** — Lean, Coq, Isabelle for machine-verified proofs and formalized libraries (mathlib).\n- **Computer algebra systems** — Mathematica, SageMath, Magma, GAP for computation, conjecture-generation, and finite-case verification.\n- **LaTeX** — the universal medium for writing mathematics precisely.\n- **The literature and numerical experiment** — MathSciNet, arXiv, the journal record, and exploratory computation to spot patterns and find counterexamples, never to substitute for proof.","html":"<h2 id=\"tools\">Tools</h2>\n<ul>\n<li><strong>Pencil, paper, and chalkboard</strong> — still the primary instruments; thinking happens in the hand.</li>\n<li><strong>Proof assistants</strong> — Lean, Coq, Isabelle for machine-verified proofs and formalized libraries (mathlib).</li>\n<li><strong>Computer algebra systems</strong> — Mathematica, SageMath, Magma, GAP for computation, conjecture-generation, and finite-case verification.</li>\n<li><strong>LaTeX</strong> — the universal medium for writing mathematics precisely.</li>\n<li><strong>The literature and numerical experiment</strong> — MathSciNet, arXiv, the journal record, and exploratory computation to spot patterns and find counterexamples, never to substitute for proof.</li>\n</ul>\n","wordCount":73},{"heading":"Collaboration","id":"collaboration","markdown":"Mathematics looks solitary and is increasingly communal. A mathematician works with collaborators who supply complementary techniques (an analyst and a combinatorialist cracking a problem neither could alone), referees who are adversaries in service of correctness, and the wider field through seminars and the literature. The defining norm is that a proof is public property: once published, anyone may check, extend, or break it, and being shown a gap is a gift, not an insult. Massively collaborative efforts (Polymath, the classification of finite simple groups) show proof becoming collective.","html":"<h2 id=\"collaboration\">Collaboration</h2>\n<p>Mathematics looks solitary and is increasingly communal. A mathematician works with collaborators who supply complementary techniques (an analyst and a combinatorialist cracking a problem neither could alone), referees who are adversaries in service of correctness, and the wider field through seminars and the literature. The defining norm is that a proof is public property: once published, anyone may check, extend, or break it, and being shown a gap is a gift, not an insult. Massively collaborative efforts (Polymath, the classification of finite simple groups) show proof becoming collective.</p>\n","wordCount":88},{"heading":"Ethics","id":"ethics","markdown":"The mathematician's first duty is honesty about the status of a claim: a conjecture must not be dressed as a theorem, and a gap must be disclosed, not buried. Proper attribution is central — claiming priority for an idea one did not originate is the field's chief misconduct. Applications carry weight, since number theory underwrites cryptography and optimization underwrites weapons targeting, so the developer of a method shares some responsibility for its uses. Rigor itself is an ethic — the discipline's value rests on the trust that a theorem, once proved, is true.","html":"<h2 id=\"ethics\">Ethics</h2>\n<p>The mathematician&#39;s first duty is honesty about the status of a claim: a conjecture must not be dressed as a theorem, and a gap must be disclosed, not buried. Proper attribution is central — claiming priority for an idea one did not originate is the field&#39;s chief misconduct. Applications carry weight, since number theory underwrites cryptography and optimization underwrites weapons targeting, so the developer of a method shares some responsibility for its uses. Rigor itself is an ethic — the discipline&#39;s value rests on the trust that a theorem, once proved, is true.</p>\n","wordCount":91},{"heading":"Scenarios","id":"scenarios","markdown":"**A conjecture that holds for every case checked.** A young mathematician notices a sequence is prime for n = 0 through 16 and wants to announce a theorem. The expert's reflex is the opposite: numerical agreement is evidence, not proof, and the field is littered with patterns that break (Fermat numbers prime through the fourth, composite at the fifth; the prime-counting function staying below the logarithmic integral until Skewes' enormous bound). They hunt for a counterexample, then for a proof — and find the argument breaks at a step that \"obviously\" worked. The claim is downgraded to a conjecture, the numbers reported as evidence.\n\n**The proof with an obvious gap.** A collaborator presents a proof justified at every step except one transition marked \"clearly the limit exists.\" The expert stops there, because \"clearly\" is where errors hide: only boundedness was established, so the limit might not exist. Rather than discard the proof, they look for an extra hypothesis (compactness, monotonicity) under which the limit does exist — yielding a correct, slightly less general theorem instead of a false one.\n\n**Choosing the definition that cracks the problem.** A research group is stuck proving a property of certain spaces; every direct attempt drowns in special cases. The expert suspects the framing is the problem and asks what the spaces really have in common. Reframed in terms of a more abstract invariant, the case analysis collapses into a one-line consequence of a known theorem. The creative act was the choice of a better definition — the experience that makes mathematicians say the definition is the theorem.","html":"<h2 id=\"scenarios\">Scenarios</h2>\n<p><strong>A conjecture that holds for every case checked.</strong> A young mathematician notices a sequence is prime for n = 0 through 16 and wants to announce a theorem. The expert&#39;s reflex is the opposite: numerical agreement is evidence, not proof, and the field is littered with patterns that break (Fermat numbers prime through the fourth, composite at the fifth; the prime-counting function staying below the logarithmic integral until Skewes&#39; enormous bound). They hunt for a counterexample, then for a proof — and find the argument breaks at a step that &quot;obviously&quot; worked. The claim is downgraded to a conjecture, the numbers reported as evidence.</p>\n<p><strong>The proof with an obvious gap.</strong> A collaborator presents a proof justified at every step except one transition marked &quot;clearly the limit exists.&quot; The expert stops there, because &quot;clearly&quot; is where errors hide: only boundedness was established, so the limit might not exist. Rather than discard the proof, they look for an extra hypothesis (compactness, monotonicity) under which the limit does exist — yielding a correct, slightly less general theorem instead of a false one.</p>\n<p><strong>Choosing the definition that cracks the problem.</strong> A research group is stuck proving a property of certain spaces; every direct attempt drowns in special cases. The expert suspects the framing is the problem and asks what the spaces really have in common. Reframed in terms of a more abstract invariant, the case analysis collapses into a one-line consequence of a known theorem. The creative act was the choice of a better definition — the experience that makes mathematicians say the definition is the theorem.</p>\n","wordCount":261},{"heading":"Related Occupations","id":"related-occupations","markdown":"A mathematician shares deductive rigor with many fields but is defined by proof as the sole standard of truth. The research scientist and physicist use mathematics as a tool and accept evidence the mathematician would call mere conjecture; the physicist's \"proof\" is the mathematician's strong heuristic. The data scientist applies the probability and optimization the mathematician develops, and the software engineer shares the love of formal structure that proof assistants bring closer.","html":"<h2 id=\"related-occupations\">Related Occupations</h2>\n<p>A mathematician shares deductive rigor with many fields but is defined by proof as the sole standard of truth. The research scientist and physicist use mathematics as a tool and accept evidence the mathematician would call mere conjecture; the physicist&#39;s &quot;proof&quot; is the mathematician&#39;s strong heuristic. The data scientist applies the probability and optimization the mathematician develops, and the software engineer shares the love of formal structure that proof assistants bring closer.</p>\n","wordCount":72},{"heading":"References","id":"references","markdown":"- *How to Solve It* — George Polya\n- *Proofs from THE BOOK* — Aigner & Ziegler\n- *Mathematics: Its Content, Methods and Meaning* — Aleksandrov, Kolmogorov & Lavrent'ev\n- *A Mathematician's Apology* — G. H. Hardy\n- *Proofs and Refutations* — Imre Lakatos","html":"<h2 id=\"references\">References</h2>\n<ul>\n<li><em>How to Solve It</em> — George Polya</li>\n<li><em>Proofs from THE BOOK</em> — Aigner &amp; Ziegler</li>\n<li><em>Mathematics: Its Content, Methods and Meaning</em> — Aleksandrov, Kolmogorov &amp; Lavrent&#39;ev</li>\n<li><em>A Mathematician&#39;s Apology</em> — G. H. Hardy</li>\n<li><em>Proofs and Refutations</em> — Imre Lakatos</li>\n</ul>\n","wordCount":32}],"computed":{"wordCount":2040,"readingTimeMinutes":9,"completeness":1,"backlinks":["actuary","astronomer","operations-research-analyst","philosopher","physicist","statistician"],"verified":false,"aiDrafted":true,"unverifiedAiDraft":true},"git":{"created":"2026-06-26","updated":"2026-06-26","revisions":1,"authors":[{"name":"soul-atlas","commits":1}],"timeline":[{"date":"2026-06-26","author":"soul-atlas"}]},"citation":{"apa":"soul-atlas (2026). Mathematician [SOUL]. SOUL Atlas. https://soul-atlas.github.io/occupations/mathematician","bibtex":"@misc{soulatlas-mathematician,\n  title        = {Mathematician},\n  author       = {soul-atlas},\n  year         = {2026},\n  howpublished = {SOUL Atlas},\n  note         = {SOUL.md, version 2026-06-26},\n  url          = {https://soul-atlas.github.io/occupations/mathematician}\n}","text":"soul-atlas. \"Mathematician.\" SOUL Atlas, 2026. https://soul-atlas.github.io/occupations/mathematician."}}