WikiLean · Articles Articles Brain Contribute About

Preliminary: these links have not yet had an independent audit.

Elementary algebra

149 passages49 formalized27 partial73 not formalized

Statement only

More ways to filter
Library
ATLAS related onlyTauCeti related only
About this page

This page

  • Wikipedia revision 1380664138, pinned: the text here is that revision, not today's article.
  • WikiProject Mathematics: B-class, Top importance
  • Annotated article on WikiLean.
  • 149 passages checked, 127 Lean locations (and 44 related declarations).

Central statements: 52 of the 149 passages state the article's subject or a named result or definition; the other 97 are supporting (examples, setup). Of these 52: 18 formalized, 19 partial, 15 not formalized.

What the colours mean

  • Formalized a Lean declaration states it, proved, or a Lean definition defines it
  • Statement only Lean states it, but the proof is not finished
  • Partial Lean states part of it, or a more general or special form
  • Not formalized searched every library and not found

Libraries searched

Searched 48 Lean libraries, pinned 2026-10-17, 3 left out (library set u1).

How these links were made

  • Accuracy, from an audit of a sample of 224 items (blind, not independent): Strong links (exact, close or broad match) on supporting passages that have exactly the right relation: 92% (95% interval 49–99%), from 36 drawn of 1029, weighted by relation and library, an effective sample of 5.1; Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation: 73% (95% interval 40–92%), from 48 drawn of 1740, weighted by relation and library, an effective sample of 8.1; Central and subject passages whose formalization status is right: 86% (95% interval 73–94%), from 44 drawn of 1905, weighted by recorded status, an effective sample of 42; 'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it): 60% (95% interval 25–87%), from 12 drawn of 1236, weighted by article, an effective sample of 6.1.
  • Audit run tierA-batch1-audit, run by jack, 2 Nov 2026, 21:10 – 3 Nov 2026, 02:10 UTC: judged by Claude Opus 5.5 (claude-opus-5-5).
  • Record set tierA-b1a (cf-locate-recordset/2, statuses by status rule 3), exported 1 Nov 2026 by formal-companion at commit d85385a.
  • Seal sha256 f1e67e43a41f537cd8e4cdcbdbaba86bd4ed58f1277aef79f9e34fb275f3edcc.
  • Inventory run inv-tierA-b1r, run by jack, 30 Oct 2026, 07:23–20:00 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). It listed the formal passages, each with its kind and prominence, that the locate run then searched.
  • Locate run loc-tierA-b1a, run by jack, 31 Oct 2026, 02:50–04:48 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5).
  • Challenge run chal-tierA-b1, run by jack, 1 Nov 2026, 03:19–14:25 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). In this article it re-checked every Lean location and absence on a central or subject passage (63 locations and 15 absences); on supporting passages, a seeded sample (seed 0; drawn at 0.5 for strong matches, 0.2 for weaker links and 0.25 for absences): 49 of 64 locations and 15 of 56 absences. In all, 112 of 127 Lean locations (88%) and 30 of 71 absences (42%) were re-checked.
  • Passage text: 149 of 149 passages shown in full, each the slice of the pinned revision's text that its record's span sha256 hashes, checked when the store was built.
  • Lean code: each declaration's type, from the declaration corpus of universe u1 (built 18 Oct 2026, sha256 a364fd6aede5), at the commit its card links.

How the text is shown

Each passage is shown in full, as revision 1380664138 states it (checked against its record's span hash when the store was built). Where a passage is only part of a sentence, it is highlighted and the rest of the sentence is shown in grey around it, from the same copy of the revision; a list item also shows the sentence that introduces it. Formulas are drawn from their TeX; hover one to see it.

Each card's Lean code is its declaration's type as Lean prints it, from the declaration corpus of library set u1 at the card's commit, laid out as a header: binders before the colon, then the hypotheses as arrows (the corpus keeps no hypothesis names) and the conclusion, in Mathlib's notation (𝓝, π, R[X], Type*). It is not the source text; Source opens that.

Passages

What “exact match”, “more general” and the other labels mean
  1. Definition · main statement · Algebraic operations

    Not formalized
    In mathematics, a basic algebraic operation is a mathematical operation similar to any one of the common operations of elementary algebra, which include addition, subtraction, multiplication, division, raising to a whole number power, and taking roots (fractional power).[5]

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 4836eb850983).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  2. Definition · main statement · Algebraic operations

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    An algebraic operation on a set ⁠ S ⁠ may be defined more formally as a function that maps to ⁠ S ⁠ the tuples of a given length of elements of ⁠ S ⁠.

    Show in article · Read it in context on Wikipedia

    Function.OfArity more general

    abbrev Function.OfArity : Type u → Type u → ℕ → Type u

    Mathlib.Logic.Function.OfArity · line 31

    Why more general: Mathlib writes the arguments one after another and keeps the equivalence that carries that form to the tuple form the passage uses.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 84e0e7e63476 · pair key 9223fc6598af.
  3. Definition · supporting · Algebraic operations

    Not formalized
    The length of the tuples is called the arity of the operation, and each member of the tuple is called an operand.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 9d1886b958c1).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  4. Definition · supporting · Algebraic operations

    Not formalized
    The length of the tuples is called the arity of the operation, and each member of the tuple is called an operand.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 788cbda15a40).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  5. Definition · main statement · Algebraic operations

    Partial

    Partial: Mathlib states part of this (a definition).

    The most common case is the case of arity two, where the operation is called a binary operation and the operands form an ordered pair.

    Show in article · Read it in context on Wikipedia

    finTwoArrowEquiv states part

    def finTwoArrowEquiv (α : Type*) : (Fin 2 → α) ≃ α × α

    Mathlib.Logic.Equiv.Fin.Basic · lines 50–51

    Why only part: Mathlib writes a two-entry tuple as a map out of a two-element index and supplies its identification with the product of S with itself, where the passage speaks of the pair of operands.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 63a63107adb7 · pair key 06fa61a6053b.
  6. Definition · main statement · Algebraic operations

    Partial

    Partial: Mathlib states a special case (a definition).

    A unary operation is an operation of arity one that has only one operand; for example, the square root.

    Show in article · Read it in context on Wikipedia

    Real.sqrt special case

    def Real.sqrt : ℝ → ℝ

    Mathlib.Analysis.Real.Sqrt · lines 111–112

    Why a special case: Mathlib's root is total on the reals and answers zero on the negatives, which leaves untouched its being a map of one input.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 0b53fcc545b9 · pair key 899708732fb0.

    Function.End states part

    def Function.End : Type u_4 → Type u_4

    Mathlib.Algebra.Group.End · line 47

    Why only part: Mathlib keeps this type for the composition monoid on it, and the data it names is the maps of one input from a set to itself.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 64f27b729d77 · pair key 11d29b44488c.
  7. Example · supporting · Algebraic operations

    Not formalized
    An example of a ternary operation (arity three) is the triple product.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 1892c24889a5).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  8. Definition · supporting · Algebraic operations

    Not formalized
    The term algebraic operation may also be used for operations that may be defined by compounding basic algebraic operations, such as the dot product.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 9a825a01494e).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  9. Definition · supporting · Algebraic operations

    Not formalized
    In calculus and mathematical analysis, algebraic operation is also used for the operations that may be defined by purely algebraic methods.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 3cf54120a4dd).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  10. Example · supporting · Algebraic operations

    Not formalized
    For example, exponentiation with an integer or rational exponent is an algebraic operation, but not the general exponentiation with a real or complex exponent.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 5eef18c4b69e).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  11. Example · supporting · Algebraic operations

    Not formalized
    Also, the derivative is an operation that is not algebraic.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 2 candidates examined (receipt de03703bc3f3).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  12. Definition · main statement · Algebraic notation

    Partial

    Partial: Mathlib states a special case (a definition).

    A coefficient is a numerical value, or letter representing a numerical constant, that multiplies a variable (the operator is omitted).

    Show in article · Read it in context on Wikipedia

    Polynomial.coeff special case

    def Polynomial.coeff {R : Type u} [Semiring R] : R[X] → ℕ →₀ R

    Mathlib.Algebra.Polynomial.Basic · lines 558–559

    Why a special case: The library fixes one indeterminate, while the article's coefficients sit in expressions with several letters, and it answers zero for a power the expression does not display.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 2b47f0d82c3b · pair key 2194744cb845.
  13. Definition · main statement · Algebraic notation

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    A term is an addend or a summand, a group of coefficients, variables, constants and exponents that may be separated from the other terms by the plus and minus operators.[9]

    Show in article · Read it in context on Wikipedia

    MvPolynomial.monomial more general

    def MvPolynomial.monomial {R : Type u} {σ : Type*} [CommSemiring R] : (σ →₀ ℕ) → R →ₗ[R] MvPolynomial σ R

    Mathlib.Algebra.MvPolynomial.Basic · lines 91–92

    Why more general: The library allows coefficients in any commutative semiring, beyond the numbers the article has in view, and packages the construction as a linear map in the coefficient; its polynomials are sums of such pieces, which is how the article's plus and minus signs separate terms.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key f487d7b9cdcf · pair key edb82a89411a.

    Polynomial.monomial special case

    def Polynomial.monomial {R : Type u} [Semiring R] : ℕ → R →ₗ[R] R[X]

    Mathlib.Algebra.Polynomial.Basic · lines 375–378

    Why a special case: It covers only expressions in one indeterminate, where the article's own example carries two letters.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 7106ec946120 · pair key 52d80bdc3992.
  14. Notation · supporting · Algebraic notation

    Not formalized
    Letters represent variables and constants.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 3 candidates examined (receipt da96fc34b1c5).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  15. Notation · supporting · Algebraic notation

    Not formalized
    By convention, letters at the beginning of the alphabet (e.g. a, b, c) are typically used to represent constants, and those toward the end of the alphabet (e.g. x, y and z) are used to represent variables.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 91229afc3f07).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  16. Notation · supporting · Algebraic notation

    Not formalized
    By convention, letters at the beginning of the alphabet (e.g. a, b, c) are typically used to represent constants, and those toward the end of the alphabet (e.g. x, y and z) are used to represent variables.[10]

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 2 candidates examined (receipt d0f6e9e9f301).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  17. Notation · supporting · Algebraic notation

    Not formalized
    Multiplication symbols are usually omitted, and implied when there is no space between two variables or terms, or when a coefficient is used.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 96ad6d68345d).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  18. Notation · supporting · Algebraic notation

    Not formalized
    For example, 3 × x2 is written as 3x2 , and 2 × x × y may be written 2xy.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 29f645c9f9de).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  19. Notation · supporting · Algebraic notation

    Not formalized
    For example, 3 × x2 is written as 3x2, and 2 × x × y may be written 2xy.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 4198972c8153).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  20. Notation · supporting · Algebraic notation

    Not formalized
    Usually terms with the highest power (exponent), are written on the left, for example, x2 is written to the left of x.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 2 candidates examined (receipt f70a72db9bee).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  21. Notation · supporting · Algebraic notation

    Not formalized
    When a coefficient is one, it is usually omitted (e.g. 1x2 is written x2).[15]

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 605e7d7c0bf9).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  22. Notation · supporting · Algebraic notation

    Not formalized
    Likewise when the exponent (power) is one, (e.g. 3x1 is written 3x).[16]

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 1 candidates examined (receipt d599e9f99c9d).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  23. Theorem · supporting · Algebraic notation

    Formalized

    Formalized: Mathlib states a more general result (proved).

    When the exponent is zero, the result is always 1 (e.g. x0 is always rewritten to 1).[17]

    Show in article · Read it in context on Wikipedia

    pow_zero more general

    theorem pow_zero {M : Type*} [Monoid M] (a : M) : a ^ 0 = 1

    Mathlib.Algebra.Group.Monoid · lines 407–408

    Why more general: Mathlib states the law for any monoid, so it reaches well past the numbers here; it also settles the zero base by a default value, a case the following sentence of the article sets aside and on which nothing in the passage depends.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 9fa88d2b4cc5 · pair key 9e7f91b81966.

    Nat.pow_zero special case

    theorem Nat.pow_zero (n : Nat) : n ^ 0 = 1

    Init.Data.Nat.Basic · line 795

    Why a special case: Lean core states the law for natural numbers alone, so it covers the whole numbers among the quantities this section allows.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 04fbaa5799c5 · pair key 5ab28b8ac8c4.
  24. Theorem · supporting · Algebraic notation

    Not formalized
    However 00, being undefined, should not appear in an expression, and care should be taken in simplifying expressions in which variables may appear in exponents.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 09e250e21470).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  25. Example · supporting · Concepts › Variables

    Not formalized

    With community edits: Not formalized. As published it is Partial.

    Variables may represent numbers whose values are not yet known. For example, if the temperature of the current day, C, is 20 degrees higher than the temperature of the previous day, P, then the problem can be described algebraically as C = P + 20.

    Show in article · Read it in context on Wikipedia

  26. Example · supporting · Concepts › Variables

    Not formalized
    Variables allow one to describe general problems,[4] without specifying the values of the quantities that are involved. For example, it can be stated specifically that 5 minutes is equivalent to 60 × 5 = 300 seconds.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 1 candidates examined (receipt d5adebef06f4).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  27. Theorem · supporting · Concepts › Variables

    Not formalized
    A more general (algebraic) description may state that the number of seconds, s = 60 × m, where m is the number of minutes.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 2 candidates examined (receipt ef4b8bc88f9f).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  28. Example · supporting · Concepts › Variables

    Not formalized
    Variables allow one to describe mathematical relationships between quantities that may vary.[28] For example, the relationship between the circumference, c, and diameter, d, of a circle is described by π = c/d.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 9d26ea2f4430).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  29. Theorem · main statement · Concepts › Variables

    Formalized

    Formalized: Mathlib states a more general result (proved).

    Variables allow one to describe some mathematical properties. For example, a basic property of addition is commutativity which states that the order of numbers being added together does not matter. Commutativity is stated algebraically as (a + b) = (b + a).

    Show in article · Read it in context on Wikipedia

    add_comm more general

    theorem add_comm {G : Type*} [AddCommMagma G] (a b : G) : a + b = b + a

    Mathlib.Algebra.Group.Semigroup · line 257

    Why more general: Mathlib proves the identity for every type with commutative addition, which is more general than the article's real and complex numbers.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e4d47f1c9c5f · pair key da2ced81268e.

    Nat.add_comm special case

    theorem Nat.add_comm (n m : Nat) : n + m = m + n

    Init.Data.Nat.Basic · lines 154–159

    Why a special case: The declaration is restricted to ℕ, where the passage speaks of arbitrary numbers.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 906fdd51930e · pair key 1a7a998c0eb7.
  30. Theorem · supporting · Concepts › Simplifying expressions

    Formalized

    Formalized: Mathlib states a more general result (proved).

    For example,
    Added terms are simplified using coefficients. For example, x + x + x can be simplified as 3x (where 3 is a numerical coefficient).

    Show in article · Read it in context on Wikipedia

    nsmul_eq_mul more general

    theorem nsmul_eq_mul {α : Type u} [NonAssocSemiring α] (n : ℕ) (a : α) : n • a = ↑n * a

    Mathlib.Algebra.Ring.Defs · lines 186–189

    Why more general: Mathlib encodes the repeated sum as the natural-number scalar action and the coefficient as a cast numeral, and states the rule for any non-associative semiring.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 68bb1d2772c1 · pair key 379cb7b3ff78.

    two_mul special case

    theorem two_mul {α : Type u} [NonAssocSemiring α] (n : α) : 2 * n = n + n

    Mathlib.Algebra.Ring.Defs · lines 180–181

    Why a special case: The declaration collects two repeated summands where the passage's display collects three.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key af9f0519fe33 · pair key 2b3638b922ac.
  31. Theorem · supporting · Concepts › Simplifying expressions

    Formalized

    Formalized: Mathlib states a more general result (proved).

    Multiplied terms are simplified using exponents. For example, x × x × x is represented as x3

    Show in article · Read it in context on Wikipedia

    pow_three' more general

    theorem pow_three' {M : Type*} [Monoid M] (a : M) : a ^ 3 = a * a * a

    Mathlib.Algebra.Group.Monoid · line 436

    Why more general: Mathlib states the identity for any monoid, which is more general than the article's numbers.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key c60ff8d6dd42 · pair key 30651aaa106a.

    pow_three more general

    theorem pow_three {M : Type*} [Monoid M] (a : M) : a ^ 3 = a * (a * a)

    Mathlib.Algebra.Group.Monoid · line 439

    Why more general: Same identity with the triple product bracketed to the right, stated for any monoid.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 894fd7ac17b9 · pair key 6c239e48af44.
  32. Theorem · supporting · Concepts › Simplifying expressions

    Not formalized
    For example, x × x × x is represented as x3
    Like terms are added together,[30] for example, 2x2 + 3ab − x2 + ab is written as x2 + 4ab, because the terms containing x2 are added together, and the terms containing ab are added together.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 5bb825dcae25).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  33. Theorem · supporting · Concepts › Simplifying expressions

    Formalized

    Formalized: Mathlib states a more general result (proved).

    Brackets can be "multiplied out", using the distributive property. For example, x(2x + 3) can be written as (x × 2x) + (x × 3) which can be written as 2x2 + 3x

    Show in article · Read it in context on Wikipedia

    mul_add more general

    theorem mul_add {R : Type v} [Mul R] [Add R] [LeftDistribClass R] (a b c : R) : a * (b + c) = a * b + a * c

    Mathlib.Algebra.Ring.Defs · line 91

    Why more general: Mathlib states left distributivity for any multiplication distributing over addition, which is more general than the article's numbers, and the passage's final display writes the same two products in the coefficient-and-exponent notation the article has just introduced.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 6315e9156dff · pair key 4db77ef1acc1.
  34. Theorem · supporting · Concepts › Simplifying expressions

    Not formalized
    For example, x(2x + 3) can be written as (x × 2x) + (x × 3) which can be written as 2x2 + 3x
    Expressions can be factored. For example, 6x5 + 3x2, by dividing both terms by the common factor, 3x2 can be written as 3x2(2x3 + 1)

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 3 candidates examined (receipt b3fa10892b28).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  35. Definition · main statement · Concepts › Equations

    Formalized

    Formalized: Lean core states a more general result (a definition).

    An equation states that two expressions are equal using the symbol for equality, = (the equals sign).[31]

    Show in article · Read it in context on Wikipedia

    Eq more general

    inductive Eq {α : Sort u_1} : α → α → Prop

    Init.Prelude · lines 73–76

    Why more general: Lean's equality is defined for any sort, not only for the numerical expressions of the article, and the notation with the equals sign is its own.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 1d0327f08a60 · pair key cd1710c1abc0.
  36. Theorem · main statement · Concepts › Equations

    Formalized

    Formalized: Mathlib states a more general result (proved).

    One of the best-known equations describes Pythagoras' law relating the length of the sides of a right angle triangle:[32] c2 = a2 + b2

    Show in article · Read it in context on Wikipedia

    EuclideanGeometry.dist_sq_eq_dist_sq_add_dist_sq_iff_angle_eq_pi_div_two more general

    theorem EuclideanGeometry.dist_sq_eq_dist_sq_add_dist_sq_iff_angle_eq_pi_div_two {V : Type*} {P : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] (p₁ p₂ p₃ : P) : Dist.dist p₁ p₃ * Dist.dist p₁ p₃ = Dist.dist p₁ p₂ * Dist.dist p₁ p₂ + Dist.dist p₃ p₂ * Dist.dist p₃ p₂ ↔ EuclideanGeometry.angle p₁ p₂ p₃ = π / 2

    Mathlib.Geometry.Euclidean.Angle.Unoriented.RightAngle · lines 327–332

    Why more general: Mathlib proves an equivalence between the length relation and the right angle, and states it in any real inner product space, both of which reach beyond the passage's plane triangle.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 4c535f0286ff · pair key 0ce2a0702c89.

    InnerProductGeometry.norm_add_sq_eq_norm_sq_add_norm_sq' more general

    theorem InnerProductGeometry.norm_add_sq_eq_norm_sq_add_norm_sq' {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] (x y : V) : InnerProductGeometry.angle x y = π / 2 → ‖x + y‖ * ‖x + y‖ = ‖x‖ * ‖x‖ + ‖y‖ * ‖y‖

    Mathlib.Geometry.Euclidean.Angle.Unoriented.RightAngle · lines 50–52

    Why more general: Mathlib states the identity for vectors in any real inner product space, which is more general than the passage's plane triangle.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key ec204f112197 · pair key 1250a449e40e.
  37. Theorem · main statement · Concepts › Equations

    Formalized

    Formalized: Mathlib states a more general result (proved).

    This equation states that c2, representing the square of the length of the side that is the hypotenuse, the side opposite the right angle, is equal to the sum (addition) of the squares of the other two sides whose lengths are represented by a and b.

    Show in article · Read it in context on Wikipedia

    EuclideanGeometry.dist_sq_eq_dist_sq_add_dist_sq_iff_angle_eq_pi_div_two more general

    theorem EuclideanGeometry.dist_sq_eq_dist_sq_add_dist_sq_iff_angle_eq_pi_div_two {V : Type*} {P : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] (p₁ p₂ p₃ : P) : Dist.dist p₁ p₃ * Dist.dist p₁ p₃ = Dist.dist p₁ p₂ * Dist.dist p₁ p₂ + Dist.dist p₃ p₂ * Dist.dist p₃ p₂ ↔ EuclideanGeometry.angle p₁ p₂ p₃ = π / 2

    Mathlib.Geometry.Euclidean.Angle.Unoriented.RightAngle · lines 327–332

    Why more general: Side lengths appear as distances between points written as products d * d, and the declaration also gives the converse direction from the equation back to the right angle.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key a249a5e6b3d6 · pair key c9af7c39e398.

    InnerProductGeometry.norm_add_sq_eq_norm_sq_add_norm_sq_iff_angle_eq_pi_div_two more general

    theorem InnerProductGeometry.norm_add_sq_eq_norm_sq_add_norm_sq_iff_angle_eq_pi_div_two {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] (x y : V) : ‖x + y‖ * ‖x + y‖ = ‖x‖ * ‖x‖ + ‖y‖ * ‖y‖ ↔ InnerProductGeometry.angle x y = π / 2

    Mathlib.Geometry.Euclidean.Angle.Unoriented.RightAngle · lines 44–47

    Why more general: The sides enter as vector norms, the hypotenuse being the sum of the two leg vectors rather than a distance between named corners.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 42d7f0a71cc6 · pair key 6f43fd6070ae.
  38. Definition · main statement · Concepts › Equations

    Formalized

    Formalized: Lean core states a more general result (a definition).

    An equation is the claim that two expressions have the same value and are equal.

    Show in article · Read it in context on Wikipedia

    Eq more general

    inductive Eq {α : Sort u_1} : α → α → Prop

    Init.Prelude · lines 73–76

    Why more general: Lean states the relation for terms of any type, where the article has expressions standing for numbers.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 5642eea3ac26 · pair key 1cb1ffdff5f6.
  39. Theorem · supporting · Concepts › Equations

    Formalized

    Formalized: Mathlib states a more general result (proved).

    Some equations are true for all values of the involved variables (such as a + b = b + a); such equations are called identities.

    Show in article · Read it in context on Wikipedia

    add_comm more general

    theorem add_comm {G : Type*} [AddCommMagma G] (a b : G) : a + b = b + a

    Mathlib.Algebra.Group.Semigroup · line 257

    Why more general: Lean states the commutativity law for any type with commutative addition, where the article speaks of numbers.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key ecbce161f466 · pair key 1b43fc2e9288.

    Nat.add_comm special case

    theorem Nat.add_comm (n m : Nat) : n + m = m + n

    Init.Data.Nat.Basic · lines 154–159

    Why a special case: It is the same commutativity equation restricted to the natural numbers.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 8be4c4859f85 · pair key 40cf4bdd53c0.
  40. Definition · main statement · Concepts › Equations

    Not formalized
    Some equations are true for all values of the involved variables (such as a + b = b + a); such equations are called identities.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 08d537fc80d5).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  41. Definition · main statement · Concepts › Equations

    Partial

    Partial: Mathlib states part of this (proved).

    Conditional equations are true for only some values of the involved variables, e.g. x2 − 1 = 8 is true only for x = 3 and x = −3.

    Show in article · Read it in context on Wikipedia

    sq_eq_sq_iff_eq_or_eq_neg states part

    theorem sq_eq_sq_iff_eq_or_eq_neg {R : Type u} [CommRing R] [NoZeroDivisors R] {a b : R} : a ^ 2 = b ^ 2 ↔ a = b ∨ a = -b

    Mathlib.Algebra.Ring.Commute · lines 216–217

    Why only part: It settles the example's solutions only; the article's naming of equations that hold for some values alone is not stated by it.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key fbbd0ed65a91 · pair key 7e03e82c5975.
  42. Definition · main statement · Concepts › Equations

    Partial

    Partial: Mathlib states a special case (a Prop-valued definition: it states the claim without proving it).

    The values of the variables which make the equation true are the solutions of the equation and can be found through equation solving.

    Show in article · Read it in context on Wikipedia

    Polynomial.IsRoot special case

    def Polynomial.IsRoot {R : Type u} [Semiring R] : R[X] → R → Prop

    Mathlib.Algebra.Polynomial.Eval.Defs · lines 350–351

    Why a special case: It covers equations in one unknown written with zero on the other side, where the passage speaks of equations in general.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 0b5724f07d22 · pair key f06dc5a1ed96.

    Polynomial.rootSet special case

    def Polynomial.rootSet {T : Type w} [CommRing T] : T[X] → (S : Type*) → [CommRing S] → [IsDomain S] → [Algebra T S] → Set S

    Mathlib.Algebra.Polynomial.Roots · lines 576–578

    Why a special case: It gathers the solutions of a polynomial equation into a set, for equations of that one shape.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 86504439c631 · pair key c5c6ba5329bf.
  43. Definition · main statement · Concepts › Equations

    Formalized

    Formalized: Lean core states a more general result (a definition).

    Another type of equation is inequality. Inequalities are used to show that one side of the equation is greater, or less, than the other.

    Show in article · Read it in context on Wikipedia

    LT more general

    class LT : Type u → Type u

    Init.Prelude · lines 1413–1415

    Why more general: Lean keeps the relation as a class over an arbitrary type and derives the greater-than form from it by exchanging the two sides.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 7b289fa9cb65 · pair key 3803a7fd2c99.

    GT.gt more general

    abbrev GT.gt {α : Type u} [LT α] : α → α → Prop

    Init.Prelude · line 1420

    Why more general: It records one of the two forms the passage names, the other being its unfolding with the sides exchanged.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 9ba88ec98889 · pair key 17b0b46e3b1d.
  44. Notation · supporting · Concepts › Equations

    Formalized

    Formalized: Lean core states a more general result (a Prop-valued definition: it states the claim without proving it).

    The symbols used for this are: a > b where > represents 'greater than', and a < b where < represents 'less than'.

    Show in article · Read it in context on Wikipedia

    GT.gt more general

    abbrev GT.gt {α : Type u} [LT α] : α → α → Prop

    Init.Prelude · line 1420

    Why more general: Lean fixes the meaning of the symbol for every type carrying a comparison relation, by turning that relation around.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key a01208310c6e · pair key 21c895afe5ee.
  45. Notation · supporting · Concepts › Equations

    Formalized

    Formalized: Lean core states a more general result (a definition).

    The symbols used for this are: a > b where > represents 'greater than', and a < b where < represents 'less than'.

    Show in article · Read it in context on Wikipedia

    LT more general

    class LT : Type u → Type u

    Init.Prelude · lines 1413–1415

    Why more general: Lean's class supplies the a < b notation for any type equipped with such a relation.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 52f67b9fb36d · pair key 4e41c6b89728.

    Real.instLT special case

    instance Real.instLT : LT ℝ

    Mathlib.Basic.Real.Basic · lines 266–267

    Why a special case: The article does not pin its numbers to the reals, so this covers the real case alone.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 3aa28536a7c8 · pair key 95e540b4c1ed.
  46. Theorem · supporting · Concepts › Equations

    Partial

    Partial: Mathlib states part of this (proved).

    Just like standard equality equations, numbers can be added, subtracted, multiplied or divided.

    Show in article · Read it in context on Wikipedia

    add_lt_add_right states part

    theorem add_lt_add_right {α : Type*} {b c : α} [Add α] [LT α] [AddLeftStrictMono α] : b < c → ∀ (a : α), a + b < a + c

    Mathlib.Algebra.Order.Monoid.Unbundled.Basic · line 103

    Why only part: It carries the addition case of the passage, leaving subtraction, multiplication and division to other declarations.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 2cdd327511a0 · pair key 5458387ba7da.

    sub_lt_sub_right states part

    theorem sub_lt_sub_right {α : Type u} [AddGroup α] [LT α] [AddRightStrictMono α] {a b : α} : a < b → ∀ (c : α), a - c < b - c

    Mathlib.Algebra.Order.Group.Unbundled.Basic · line 596

    Why only part: It carries the subtraction case of the passage only.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 66253f590e4f · pair key 2c2752a76052.

    mul_lt_mul_of_pos_right states part

    theorem mul_lt_mul_of_pos_right {α : Type*} [Mul α] [Zero α] [Preorder α] {a b c : α} [MulPosStrictMono α] : b < c → 0 < a → b * a < c * a

    Mathlib.Algebra.Order.GroupWithZero.Defs · lines 237–238

    Why only part: It carries the multiplication case and asks the multiplier to be positive, which the article's next sentence treats separately.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 3 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 8adc3db48e42 · pair key da1471c9bed4.

    div_lt_div_of_pos_right states part

    theorem div_lt_div_of_pos_right {G₀ : Type*} [GroupWithZero G₀] [PartialOrder G₀] [MulPosReflectLT G₀] {a b c : G₀} : a < b → 0 < c → a / c < b / c

    Mathlib.Algebra.Order.GroupWithZero.Basic · lines 1198–1200

    Why only part: It carries the division case and asks the divisor to be positive.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 4 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 7132736e1b9e · pair key fbbbfb7e3255.
  47. Theorem · main statement · Concepts › Equations

    Partial

    Partial: Mathlib states part of this (proved).

    The only exception is that when multiplying or dividing by a negative number, the inequality symbol must be flipped.

    Show in article · Read it in context on Wikipedia

    mul_lt_mul_of_neg_right states part

    theorem mul_lt_mul_of_neg_right {R : Type u} [Semiring R] [PartialOrder R] {a b c : R} [ExistsAddOfLE R] [MulPosStrictMono R] [AddRightStrictMono R] [AddRightReflectLT R] : b < a → c < 0 → a * c < b * c

    Mathlib.Algebra.Order.Ring.Unbundled.Basic · lines 222–230

    Why only part: It carries the multiplication half of the passage, with the multiplier written on the right.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 179c2919f60c · pair key 438cfb1740d9.

    mul_lt_mul_of_neg_left states part

    theorem mul_lt_mul_of_neg_left {R : Type u} [Semiring R] [PartialOrder R] {a b c : R} [ExistsAddOfLE R] [PosMulStrictMono R] [AddRightStrictMono R] [AddRightReflectLT R] : b < a → c < 0 → c * a < c * b

    Mathlib.Algebra.Order.Ring.Unbundled.Basic · lines 212–220

    Why only part: It carries the multiplication half with the multiplier written on the left.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 74a3cbe23c54 · pair key 5af76414f26d.

    div_lt_div_of_neg_of_lt states part

    theorem div_lt_div_of_neg_of_lt {α : Type*} [Field α] [PartialOrder α] [PosMulReflectLT α] [IsStrictOrderedRing α] {a b c : α} : c < 0 → b < a → a / c < b / c

    Mathlib.Algebra.Order.Field.Basic · lines 455–457

    Why only part: It carries the division half of the passage.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 3 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 9eab434e4fd5 · pair key 7e581abe82fc.
  48. Theorem · main statement · Concepts › Equations › Properties of equality

    Formalized

    Formalized: Mathlib states this exactly (proved).

    Formalized by 3 parts together:

    1. rfl Lean core (proved)
      • equality is reflexive: b = b
    2. Eq.symm Lean core (proved)
      • equality is symmetric: if a = b then b = a
    3. Eq.trans Lean core (proved)
      • equality is transitive: if a = b and b = c then a = c
    By definition, equality is an equivalence relation, meaning it is reflexive (i.e. b = b), symmetric (i.e. if a = b then b = a), and transitive (i.e. if a = b and b = c then a = c).[33]

    Show in article · Read it in context on Wikipedia

    eq_equivalence exact match

    theorem eq_equivalence {α : Sort*} : Equivalence Eq

    Mathlib.Basic.Logic.Basic · lines 464–465

    Note: Lean packages the three properties as the fields of its Equivalence structure for equality.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b33d12016dd3 · pair key 37a4f2bb675b.

    rfl states part

    def rfl {α : Sort u} {a : α} : a = a

    Init.Prelude · line 343

    Why only part: This is the term that proves reflexivity of equality in Lean.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 1850fea2740b · pair key 636b72e5d50a.

    Eq.symm states part

    theorem Eq.symm {α : Sort u} {a b : α} : a = b → b = a

    Init.Prelude · lines 372–373

    Why only part: Its docstring states symmetry of equality in the same words as the passage.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 3 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 7d8dd068ca21 · pair key 0ee9990cd993.

    Eq.trans states part

    theorem Eq.trans {α : Sort u} {a b c : α} : a = b → b = c → a = c

    Init.Prelude · lines 388–389

    Why only part: Its docstring states transitivity of equality in the same words as the passage.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 4 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 706ca3de7a9f · pair key 558c737109fb.
  49. Theorem · main statement · Concepts › Equations › Properties of equality

    Formalized

    Formalized: Lean core states this exactly (proved).

    It also satisfies the important property that if two symbols are used for equal things, then one symbol can be substituted for the other in any true statement about the first and the statement will remain true. This implies the following properties:

    Show in article · Read it in context on Wikipedia

    Eq.subst exact match

    theorem Eq.subst {α : Sort u} {motive : α → Prop} {a b : α} : a = b → motive a → motive b

    Init.Prelude · lines 361–362

    Note: Lean's predicate argument is the arbitrary statement about the first symbol that the passage speaks of.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key ad852d12353e · pair key 9d757e1e80f7.
  50. Theorem · supporting · Concepts › Equations › Properties of equality

    Partial

    Partial: Lean core states part of this (proved).

    This implies the following properties:
    if a = b and c = d then a + c = b + d and ac = bd;

    Show in article · Read it in context on Wikipedia

    Lean.Omega.Int.add_congr states part

    theorem Lean.Omega.Int.add_congr {a b c d : Int} : a = b → c = d → a + c = b + d

    Init.Omega.Int · lines 77–78

    Why only part: It states the first conjunct for integer quantities, where the article leaves its numbers unrestricted.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key e7fab89e9034 · pair key 7ce652c1df44.

    Lean.Omega.Int.mul_congr states part

    theorem Lean.Omega.Int.mul_congr {a b c d : Int} : a = b → c = d → a * c = b * d

    Init.Omega.Int · lines 80–81

    Why only part: It states the second conjunct for integer quantities only.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 818eaaf02bf5 · pair key 564894f8fd9f.
  51. Theorem · supporting · Concepts › Equations › Properties of equality

    Formalized

    Formalized: Lean core states a more general result (proved).

    if a = b and c = d then a + c = b + d and ac = bd;
    if a = b then a + c = b + c and ac = bc;

    Show in article · Read it in context on Wikipedia

    congrArg more general

    theorem congrArg {α : Sort u} {β : Sort v} {a₁ a₂ : α} (f : α → β) : a₁ = a₂ → f a₁ = f a₂

    Init.Prelude · lines 415–416

    Why more general: Lean's function argument is filled in twice here, once by adding c and once by multiplying by c.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 15ea2fba44bc · pair key 8b96ae11752c.

    Lean.Omega.Int.mul_congr_left states part

    theorem Lean.Omega.Int.mul_congr_left {a b : Int} : a = b → ∀ (c : Int), a * c = b * c

    Init.Omega.Int · lines 83–84

    Why only part: It states the second conjunct for integer quantities only.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 4d0bd8bb41a7 · pair key 7abcb1b03892.
  52. Theorem · main statement · Concepts › Equations › Properties of equality

    Formalized

    Formalized: Lean core states this exactly (proved).

    if a = b then a + c = b + c and ac = bc;
    more generally, for any function f, if a = b then f(a) = f(b).

    Show in article · Read it in context on Wikipedia

    congrArg exact match

    theorem congrArg {α : Sort u} {β : Sort v} {a₁ a₂ : α} (f : α → β) : a₁ = a₂ → f a₁ = f a₂

    Init.Prelude · lines 415–416

    Note: The declaration's function argument is the article's arbitrary f, applied to its two equal quantities.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 92a35182c6b1 · pair key 967434ae0e6a.

    congr_arg exact match

    theorem congr_arg {α : Sort u} {β : Sort v} {a₁ a₂ : α} (f : α → β) : a₁ = a₂ → f a₁ = f a₂

    Batteries.Logic · line 66

    Note: This library restates the same fact under its own name.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 4453b52.
    • Location key 52dbae1539d8 · pair key 3d06be2c109f.
  53. Theorem · main statement · Concepts › Equations › Properties of inequality

    Formalized

    Formalized: Mathlib states this exactly (proved).

    The relations less than < and greater than > have the property of transitivity:[34]
    If a < b and b < c then a < c;

    Show in article · Read it in context on Wikipedia

    lt_trans exact match

    theorem lt_trans {α : Type*} [Preorder α] {a b c : α} : a < b → b < c → a < c

    Mathlib.Order.Defs.PartialOrder · line 97

    Note: The declaration asserts the same implication about the strict order, with no further hypothesis.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key c92fa9ba9fc6 · pair key 51be8306952a.

    Nat.lt_trans special case

    theorem Nat.lt_trans {n m k : Nat} : n < m → m < k → n < k

    Init.Prelude · lines 2081–2082

    Why a special case: The statement is the passage restricted to the counting numbers of Lean's core library.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key faf4706b2733 · pair key ffb6a87cb139.
  54. Theorem · supporting · Concepts › Equations › Properties of inequality

    Formalized

    Formalized: Mathlib states this exactly (proved).

    If a < b and b < c then a < c;
    If a < b and c < d then a + c < b + d;

    Show in article · Read it in context on Wikipedia

    add_lt_add exact match

    theorem add_lt_add {α : Type*} {a b c d : α} [Add α] [Preorder α] [AddLeftStrictMono α] [AddRightStrictMono α] : a < b → c < d → a + c < b + d

    Mathlib.Algebra.Order.Monoid.Unbundled.Basic · line 150

    Note: Lean states the same implication for an addition that is strictly monotone on the left and on the right.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d80ade57c376 · pair key 97b6e9bdc32e.

    Int.add_lt_add special case

    theorem Int.add_lt_add {a b c d : Int} : a < b → c < d → a + c < b + d

    Init.Data.Int.Order · lines 777–778

    Why a special case: The same implication, stated only for the integers of Lean's core library.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 09902802fac2 · pair key 58313c464115.
  55. Theorem · supporting · Concepts › Equations › Properties of inequality

    Formalized

    Formalized: Mathlib states this exactly (proved).

    If a < b and c < d then a + c < b + d;[35]
    If a < b and c > 0 then ac < bc;

    Show in article · Read it in context on Wikipedia

    mul_lt_mul_of_pos_right exact match

    theorem mul_lt_mul_of_pos_right {α : Type*} [Mul α] [Zero α] [Preorder α] {a b c : α} [MulPosStrictMono α] : b < c → 0 < a → b * a < c * a

    Mathlib.Algebra.Order.GroupWithZero.Defs · lines 237–238

    Note: Lean writes the positivity hypothesis as 0 < c, which is what c > 0 abbreviates, and puts the factor on the right as the passage does.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 123862156812 · pair key 519093861419.

    Int.mul_lt_mul_of_pos_right special case

    theorem Int.mul_lt_mul_of_pos_right {a b c : Int} : a < b → 0 < c → a * c < b * c

    Init.Data.Int.Order · lines 545–550

    Why a special case: The same implication, stated only for the integers of Lean's core library.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 745b594e67e6 · pair key 1182de9b7311.
  56. Theorem · supporting · Concepts › Equations › Properties of inequality

    Formalized

    Formalized: Mathlib states this exactly (proved).

    If a < b and c > 0 then ac < bc;
    If a < b and c < 0 then bc < ac.

    Show in article · Read it in context on Wikipedia

    mul_lt_mul_of_neg_right exact match

    theorem mul_lt_mul_of_neg_right {R : Type u} [Semiring R] [PartialOrder R] {a b c : R} [ExistsAddOfLE R] [MulPosStrictMono R] [AddRightStrictMono R] [AddRightReflectLT R] : b < a → c < 0 → a * c < b * c

    Mathlib.Algebra.Order.Ring.Unbundled.Basic · lines 222–230

    Note: Lean multiplies on the right by the negative factor and concludes with the two products swapped, as the passage writes them.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key f95561878c46 · pair key 9d8077a4891a.

    Int.mul_lt_mul_of_neg_right special case

    theorem Int.mul_lt_mul_of_neg_right {a b c : Int} : b < a → c < 0 → a * c < b * c

    Init.Data.Int.Order · lines 1209–1214

    Why a special case: The same implication, stated only for the integers of Lean's core library.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 1e26749303b0 · pair key 24e22a29eb20.
  57. Theorem · main statement · Concepts › Equations › Properties of inequality

    Formalized

    Formalized: Lean core states this exactly (proved).

    By reversing the inequation, < and > can be swapped,[36] for example:
    a < b is equivalent to b > a

    Show in article · Read it in context on Wikipedia

    gt_iff_lt exact match

    theorem gt_iff_lt {α : Type u_1} [LT α] {x y : α} : x > y ↔ y < x

    Init.Core · line 2338

    Note: Lean states the equivalence with the greater-than side written first; the equivalence itself is symmetric.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key f65bfc84c3ff · pair key 3f2253e19cf0.
  58. Definition · main statement · Concepts › Substitution

    Partial

    Partial: Mathlib states a special case (a definition).

    Substitution is replacing the terms in an expression to create a new expression.

    Show in article · Read it in context on Wikipedia

    MvPolynomial.bind₁ special case

    def MvPolynomial.bind₁ {σ : Type*} {τ : Type*} {R : Type*} [CommSemiring R] : (σ → MvPolynomial τ R) → MvPolynomial σ R →ₐ[R] MvPolynomial τ R

    Mathlib.Algebra.MvPolynomial.Monad · lines 67–68

    Why a special case: The library carries out the passage's operation for polynomial expressions only, not for written expressions of any shape.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 386f118ac1ae · pair key 007af77fc255.
  59. Example · supporting · Concepts › Substitution

    Not formalized
    Substituting 3 for a in the expression a*5 makes a new expression 3*5 with meaning 15.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 6197ad673844).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  60. Theorem · supporting · Concepts › Substitution

    Partial

    Partial: Formal Conjectures states a special case (a definition).

    Substituting the terms of a statement makes a new statement.

    Show in article · Read it in context on Wikipedia

    Arxiv.«1308.0994».Formula.subst special case

    def Arxiv.«1308.0994».Formula.subst : (ℕ → Arxiv.«1308.0994».Formula) → Arxiv.«1308.0994».Formula → Arxiv.«1308.0994».Formula

    FormalConjectures.Arxiv.«1308.0994».BoxdotConjecture · lines 96–100

    Why a special case: The library carries the passage out for the formulas of one formalized paper rather than for statements written in any language.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 67696519d428 · pair key 79414ca6b890.
  61. Theorem · main statement · Concepts › Substitution

    Formalized

    Formalized: Mathlib states a more general result (proved).

    When the original statement is true independently of the values of the terms, the statement created by substitutions is also true.

    Show in article · Read it in context on Wikipedia

    FirstOrder.Language.BoundedFormula.realize_subst more general

    theorem FirstOrder.Language.BoundedFormula.realize_subst {L : FirstOrder.Language} {M : Type w} [L.Structure M] {α : Type u'} {β : Type v'} {n : ℕ} {φ : L.BoundedFormula α n} {tf : α → L.Term β} {v : β → M} {xs : Fin n → M} : (φ.subst tf).Realize v xs ↔ φ.Realize (fun a ↦ FirstOrder.Language.Term.realize v (tf a)) xs

    Mathlib.ModelTheory.Semantics · lines 429–438

    Why more general: Lean records the semantics of substitution as an equivalence between truth of the substituted formula and truth of the original at the composed assignment.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key f9d172013e0d · pair key dceecba1ce19.
  62. Example · supporting · Concepts › Substitution

    Formalized

    Formalized: Mathlib states a more general result (proved).

    Hence, definitions can be made in symbolic terms and interpreted through substitution: if a2 := a × a is meant as the definition of a2, as the product of a with itself, substituting 3 for a informs the reader of this statement that 32 means 3 × 3 = 9.

    Show in article · Read it in context on Wikipedia

    pow_two more general

    theorem pow_two {M : Type*} [Monoid M] (a : M) : a ^ 2 = a * a

    Mathlib.Algebra.Group.Monoid · line 431

    Why more general: Lean writes the square as a power with exponent two rather than as a separately introduced abbreviation, and the equation it proves is the one the passage uses as the definition.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key f61f78662f61 · pair key 3d10ec969212.

    sq more general

    theorem sq {M : Type*} [Monoid M] (a : M) : a ^ 2 = a * a

    Mathlib.Algebra.Group.Monoid · line 433

    Why more general: This is the name Mathlib usually quotes for the same equation, recorded alongside the other spelling.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 319fd0f6d5d8 · pair key 81ba31a66f64.
  63. Theorem · supporting · Concepts › Substitution

    Not formalized
    For example, taking the statement x + 1 = 0, if x is substituted with 1, this implies 1 + 1 = 2 = 0, which is false, which implies that if x + 1 = 0 then x cannot be 1.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 0 candidates examined (receipt deeeef2e1482).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  64. Theorem · main statement · Concepts › Substitution

    Formalized

    Formalized: Mathlib states this exactly (proved).

    If x and y are integers, rationals, or real numbers, then xy = 0 implies x = 0 or y = 0.

    Show in article · Read it in context on Wikipedia

    Int.eq_zero_or_eq_zero_of_mul_eq_zero exact match

    theorem Int.eq_zero_or_eq_zero_of_mul_eq_zero {a b : ℤ} : a * b = 0 → a = 0 ∨ b = 0

    Mathlib.Data.Int.Order.Basic · line 50

    Note: Lean fixes the integers and states the same implication from a vanishing product to a vanishing factor.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 8fe9c2058731 · pair key 2bbfe13cec70.

    Int.mul_eq_zero more general

    theorem Int.mul_eq_zero {a b : Int} : a * b = 0 ↔ a = 0 ∨ b = 0

    Init.Data.Int.Lemmas · lines 551–557

    Why more general: Lean states the integer zero-product property as an equivalence, of which the passage asserts the forward half.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key b31985862bf6 · pair key 70a689c9b501.

    mul_eq_zero more general

    theorem mul_eq_zero {M₀ : Type*} [MulZeroClass M₀] [NoZeroDivisors M₀] {a b : M₀} : a * b = 0 ↔ a = 0 ∨ b = 0

    Mathlib.Algebra.GroupWithZero.Defs · lines 293–295

    Why more general: This is the universe's abstract form of the law, instantiated at the integers through the domain instance for them.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 3 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e5ae7db50517 · pair key c7c4a35b8866.
  65. Theorem · supporting · Concepts › Substitution

    Formalized

    Formalized: Lean core states a more general result (proved).

    If x and y are integers, rationals, or real numbers, then xy = 0 implies x = 0 or y = 0.

    Show in article · Read it in context on Wikipedia

    Rat.mul_eq_zero more general

    theorem Rat.mul_eq_zero {a b : Rat} : a * b = 0 ↔ a = 0 ∨ b = 0

    Init.Data.Rat.Lemmas · lines 550–558

    Why more general: Lean states the law for the rationals as an equivalence, and the passage asserts its forward direction.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 38398e4ebb17 · pair key 30011a279401.

    mul_eq_zero more general

    theorem mul_eq_zero {M₀ : Type*} [MulZeroClass M₀] [NoZeroDivisors M₀] {a b : M₀} : a * b = 0 ↔ a = 0 ∨ b = 0

    Mathlib.Algebra.GroupWithZero.Defs · lines 293–295

    Why more general: The abstract law applies to the rationals through the domain instance Mathlib records for them.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 85f0ea2c991d · pair key 69c21c37e196.
  66. Theorem · supporting · Concepts › Substitution

    Formalized

    Formalized: Mathlib states a more general result (proved).

    If x and y are integers, rationals, or real numbers, then xy = 0 implies x = 0 or y = 0.

    Show in article · Read it in context on Wikipedia

    Real.instIsDomain more general

    instance Real.instIsDomain : IsDomain ℝ

    Mathlib.Basic.Real.Basic · line 474

    Why more general: This is the real-number instance of the property, and the chain from it through cancellation to absence of zero divisors is instance resolution rather than a bridging lemma; it also carries nontriviality, which the passage does not mention.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 20e11426476c · pair key 0f4c6b6c3725.

    mul_eq_zero more general

    theorem mul_eq_zero {M₀ : Type*} [MulZeroClass M₀] [NoZeroDivisors M₀] {a b : M₀} : a * b = 0 ↔ a = 0 ∨ b = 0

    Mathlib.Algebra.GroupWithZero.Defs · lines 293–295

    Why more general: The abstract law reaches the reals through the domain instance recorded for them.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b684ed6330db · pair key dec83c649d50.
  67. Theorem · supporting · Concepts › Substitution

    Formalized

    Formalized: Mathlib states a more general result (proved).

    Consider abc = 0. Then, substituting a for x and bc for y, we learn a = 0 or bc = 0.

    Show in article · Read it in context on Wikipedia

    mul_eq_zero more general

    theorem mul_eq_zero {M₀ : Type*} [MulZeroClass M₀] [NoZeroDivisors M₀] {a b : M₀} : a * b = 0 ↔ a = 0 ∨ b = 0

    Mathlib.Algebra.GroupWithZero.Defs · lines 293–295

    Why more general: The declaration is the same law whose two slots the passage fills with a and with the product of b and c.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 9e22bdf8abd6 · pair key eb670b6168f7.
  68. Theorem · supporting · Concepts › Substitution

    Formalized

    Formalized: Mathlib states a more general result (proved).

    Then we can substitute again, letting x = b and y = c, to show that if bc = 0 then b = 0 or c = 0.

    Show in article · Read it in context on Wikipedia

    mul_eq_zero more general

    theorem mul_eq_zero {M₀ : Type*} [MulZeroClass M₀] [NoZeroDivisors M₀] {a b : M₀} : a * b = 0 ↔ a = 0 ∨ b = 0

    Mathlib.Algebra.GroupWithZero.Defs · lines 293–295

    Why more general: The declaration is the same law with its two slots filled by the passage's b and c.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b0eeb140791c · pair key 744002162153.
  69. Theorem · supporting · Concepts › Substitution

    Formalized

    Formalized: Mathlib states a more general result (proved).

    Therefore, if abc = 0, then a = 0 or (b = 0 or c = 0), so abc = 0 implies a = 0 or b = 0 or c = 0.

    Show in article · Read it in context on Wikipedia

    mul_eq_zero more general

    theorem mul_eq_zero {M₀ : Type*} [MulZeroClass M₀] [NoZeroDivisors M₀] {a b : M₀} : a * b = 0 ↔ a = 0 ∨ b = 0

    Mathlib.Algebra.GroupWithZero.Defs · lines 293–295

    Why more general: Lean's theorem is about a product of two factors over any type with no zero divisors; the article's three-factor form is this same theorem read twice, once with the first two letters grouped together.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 6985c62e5dfe · pair key f98197d6873d.
  70. Theorem · main statement · Concepts › Substitution

    Formalized

    Formalized: Mathlib states a more general result (proved).

    Therefore, if abc = 0, then a = 0 or (b = 0 or c = 0), so abc = 0 implies a = 0 or b = 0 or c = 0.

    Show in article · Read it in context on Wikipedia

    mul_eq_zero more general

    theorem mul_eq_zero {M₀ : Type*} [MulZeroClass M₀] [NoZeroDivisors M₀] {a b : M₀} : a * b = 0 ↔ a = 0 ∨ b = 0

    Mathlib.Algebra.GroupWithZero.Defs · lines 293–295

    Why more general: The Lean statement is typeclass-based, so one theorem covers the integers, the rationals and the reals at once, and the article's three letters come from reading it at two groupings of the product.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 5e10507359e4 · pair key 01fe42406c4c.
  71. Theorem · main statement · Solving algebraic equations › Linear equations with one variable

    Not formalized
    Linear equations are so-called, because when they are plotted, they describe a straight line.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 3f98b2e5a07f).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  72. Definition · main statement · Solving algebraic equations › Linear equations with one variable

    Not formalized
    They contain only constant numbers and a single variable without an exponent. As an example, consider:

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 62e97c34d6b6).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  73. Example · supporting · Solving algebraic equations › Linear equations with one variable

    Not formalized
    Equivalent equation: 2x + 4 = 12 where x represent the child's age

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 4458752ed954).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  74. Example · supporting · Solving algebraic equations › Linear equations with one variable

    Not formalized
    1. Equation to solve: 2x + 4 = 12

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 0 candidates examined (receipt ee44a71ae0f0).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  75. Theorem · supporting · Solving algebraic equations › Linear equations with one variable

    Formalized

    Formalized: Mathlib states a more general result (proved).

    2. Subtract 4 from both sides: 2x + 4 − 4 = 12 − 4

    Show in article · Read it in context on Wikipedia

    sub_left_inj more general

    theorem sub_left_inj {G : Type*} [AddGroup G] {a b c : G} : b - a = c - a ↔ b = c

    Mathlib.Algebra.Group.Basic · line 733

    Why more general: Lean states this as an equivalence between the two equalities, so one direction of it is the step the passage takes, and it is stated for subtraction in any additive group rather than for these particular numbers.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 42f51f3f23dc · pair key 3b96feb6771f.

    congrArg more general

    theorem congrArg {α : Sort u} {β : Sort v} {a₁ a₂ : α} (f : α → β) : a₁ = a₂ → f a₁ = f a₂

    Init.Prelude · lines 415–416

    Why more general: This is the congruence rule for an arbitrary function, so the article's operation of taking four from both sides is one choice of that function.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 403a1032ffc3 · pair key dc25b8b7d9dc.
  76. Theorem · supporting · Solving algebraic equations › Linear equations with one variable

    Formalized

    Formalized: Mathlib states a more general result (proved).

    3. This simplifies to: 2x = 8

    Show in article · Read it in context on Wikipedia

    add_sub_cancel_right more general

    theorem add_sub_cancel_right {G : Type*} [AddGroup G] (a b : G) : a + b - b = a

    Mathlib.Algebra.Group.Defs · line 80

    Why more general: The lemma is the cancellation fact behind this step; the numeric side 12 - 4 = 8 is pure evaluation.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key a12472c1c2d8 · pair key 4361c68fc593.
  77. Theorem · supporting · Solving algebraic equations › Linear equations with one variable

    Formalized

    Formalized: Lean core states a more general result (proved).

    4. Divide both sides by 2: 2x2 = 82

    Show in article · Read it in context on Wikipedia

    congrArg more general

    theorem congrArg {α : Sort u} {β : Sort v} {a₁ a₂ : α} (f : α → β) : a₁ = a₂ → f a₁ = f a₂

    Init.Prelude · lines 415–416

    Why more general: This is the inference the step performs: applying one and the same operation to two equal quantities.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 2361d32d8d8d · pair key 29114eb1991d.

    div_left_inj' more general

    theorem div_left_inj' {G₀ : Type*} [GroupWithZero G₀] {a b c : G₀} : c ≠ 0 → (a / c = b / c ↔ a = b)

    Mathlib.Algebra.GroupWithZero.Units.Basic · line 343

    Why more general: The declaration states an equivalence where the passage uses only one direction of it.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key f7ab772d99f0 · pair key 44d0d2ee59a0.
  78. Theorem · supporting · Solving algebraic equations › Linear equations with one variable

    Not formalized

    With community edits: Not formalized. As published it is Formalized.

    5. This simplifies to the solution: x = 4

    Show in article · Read it in context on Wikipedia

  79. Definition · main statement · Solving algebraic equations › Linear equations with one variable

    Partial

    Partial: Mathlib states part of this (proved).

    The general form of a linear equation with one variable, can be written as: ax + b = c

    Show in article · Read it in context on Wikipedia

    Polynomial.eq_X_add_C_of_degree_le_one states part

    theorem Polynomial.eq_X_add_C_of_degree_le_one {R : Type u} [Semiring R] {p : R[X]} : p.degree ≤ 1 → p = Polynomial.C (p.coeff 1) * Polynomial.X + Polynomial.C (p.coeff 0)

    Mathlib.Algebra.Polynomial.Degree.SmallDegree · lines 29–34

    Why only part: Lean states the shape of the polynomial itself, so the constant standing on the right of the article's equation lies outside its conclusion.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 2c3fb88c614c · pair key cacaf5dea306.
  80. Theorem · main statement · Solving algebraic equations › Linear equations with one variable

    Partial

    Partial: Mathlib states a special case (proved).

    Following the same procedure (i.e. subtract b from both sides, and then divide by a), the general solution is given by x = c − ba

    Show in article · Read it in context on Wikipedia

    Polynomial.roots_degree_eq_one special case

    theorem Polynomial.roots_degree_eq_one {R : Type u} [Field R] {p : R[X]} : p.degree = 1 → p.roots = {-((p.coeff 1)⁻¹ * p.coeff 0)}

    Mathlib.Algebra.Polynomial.FieldDivision · lines 531–534

    Why a special case: The solution set is written as the multiset of roots and the quotient as a product with the inverse coefficient, which is the same notion in library notation.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key ec3e7764be4a · pair key c37945314a0c.
  81. Theorem · main statement · Solving algebraic equations › Linear equations with two variables

    Not formalized
    A linear equation with two variables has many (i.e. an infinite number of) solutions.[38] For example:

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 5e665b42cc39).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  82. Example · supporting · Solving algebraic equations › Linear equations with two variables

    Not formalized
    Equivalent equation: y = x + 22 where y is the father's age, x is the son's age.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 19268a308a5a).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  83. Theorem · main statement · Solving algebraic equations › Linear equations with two variables

    Not formalized
    To solve a linear equation with two variables (unknowns), requires two related equations. For example, if it was also revealed that:

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 9468892048e3).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  84. Example · supporting · Solving algebraic equations › Linear equations with two variables

    Not formalized
    Problem in words
    In 10 years, the father will be twice as old as his son.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 4006353d53dd).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  85. Theorem · supporting · Solving algebraic equations › Linear equations with two variables

    Not formalized
    Equivalent equation y + 10= 2 × (x + 10)y= 2 × (x + 10) − 10Subtract 10 from both sidesy= 2x + 20 − 10Multiple out bracketsy= 2x + 10Simplify

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 0 candidates examined (receipt bea58f19f5d0).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  86. Theorem · supporting · Solving algebraic equations › Linear equations with two variables

    Not formalized
    {y = x + 22First equationy = 2x + 10Second equation
    Subtract the first equation from(y − y)= (2x − x) + 10 − 22the second in order to remove y0= x − 12Simplify12= xAdd 12 to both sidesx= 12Rearrange

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 1 candidates examined (receipt b92e257871c3).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  87. Theorem · supporting · Solving algebraic equations › Linear equations with two variables

    Not formalized
    In other words, the son is aged 12, and since the father 22 years older, he must be 34.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 0 candidates examined (receipt f512827da82f).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  88. Theorem · supporting · Solving algebraic equations › Linear equations with two variables

    Not formalized
    In other words, the son is aged 12, and since the father 22 years older, he must be 34.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 0 candidates examined (receipt f038108ebadb).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  89. Theorem · supporting · Solving algebraic equations › Linear equations with two variables

    Not formalized
    In 10 years, the son will be 22, and the father will be twice his age, 44.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 4de7704d1f2b).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  90. Theorem · supporting · Solving algebraic equations › Linear equations with two variables

    Not formalized
    In 10 years, the son will be 22, and the father will be twice his age, 44.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 5f4cef939bf0).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  91. Definition · main statement · Solving algebraic equations › Quadratic equations

    Partial

    Partial: Mathlib states a special case (proved).

    A quadratic equation is one which includes a term with an exponent of 2, for example, x2,[40] and no term with higher exponent.

    Show in article · Read it in context on Wikipedia

    Polynomial.degree_quadratic special case

    theorem Polynomial.degree_quadratic {R : Type u} {a b c : R} [Semiring R] : a ≠ 0 → (Polynomial.C a * Polynomial.X ^ 2 + Polynomial.C b * Polynomial.X + Polynomial.C c).degree = 2

    Mathlib.Algebra.Polynomial.Degree.SmallDegree · lines 101–104

    Why a special case: Lean writes the article's condition as the polynomial having degree equal to two, and states it over an arbitrary semiring rather than over numbers.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 48a4565a8cb4 · pair key fe3ea9d693bd.
  92. Definition · main statement · Solving algebraic equations › Quadratic equations

    Partial

    Partial: Mathlib states part of this (proved).

    In general, a quadratic equation can be expressed in the form ax2 + bx + c = 0,[42] where a is not zero (if it were zero, then the equation would not be quadratic but linear).

    Show in article · Read it in context on Wikipedia

    Polynomial.eq_quadratic_of_degree_le_two states part

    theorem Polynomial.eq_quadratic_of_degree_le_two {R : Type*} [Semiring R] {p : R[X]} : p.degree ≤ 2 → p = Polynomial.C (p.coeff 2) * Polynomial.X ^ 2 + Polynomial.C (p.coeff 1) * Polynomial.X + Polynomial.C (p.coeff 0)

    Mathlib.RingTheory.Polynomial.SmallDegreeVieta · lines 22–27

    Why only part: It delivers the shape of the equation but leaves the nonvanishing of the leading coefficient to the degree hypothesis.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 964ef6873bbc · pair key b5c4d1d82f1a.
  93. Definition · supporting · Solving algebraic equations › Quadratic equations

    Partial

    Partial: Mathlib states a more general result, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.

    Because of this a quadratic equation must contain the term ax2, which is known as the quadratic term.

    Show in article · Read it in context on Wikipedia

    Polynomial.coeff_ne_zero_of_eq_degree more general

    theorem Polynomial.coeff_ne_zero_of_eq_degree {R : Type u} {n : ℕ} [Semiring R] {p : R[X]} : p.degree = ↑n → p.coeff n ≠ 0

    Mathlib.Algebra.Polynomial.Degree.Defs · lines 237–238

    Why more general: Lean states it for every exponent over any semiring; taken at exponent two it gives the article's quadratic term.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 687ec574cf8a · pair key 4b75c251f35b.
  94. Theorem · supporting · Solving algebraic equations › Quadratic equations

    Formalized

    Formalized: Mathlib states a more general result (proved).

    Hence a ≠ 0, and so we may divide by a and rearrange the equation into the standard form

    Show in article · Read it in context on Wikipedia

    Polynomial.coeff_ne_zero_of_eq_degree more general

    theorem Polynomial.coeff_ne_zero_of_eq_degree {R : Type u} {n : ℕ} [Semiring R] {p : R[X]} : p.degree = ↑n → p.coeff n ≠ 0

    Mathlib.Algebra.Polynomial.Degree.Defs · lines 237–238

    Why more general: Lean phrases it for an arbitrary exponent over any semiring, and the coefficient at two of the article's trinomial is its a.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d627b929bfaa · pair key 5389dc51fcf2.
  95. Definition · main statement · Solving algebraic equations › Quadratic equations

    Partial

    Partial: Mathlib states part of this (proved).

    Hence a ≠ 0, and so we may divide by a and rearrange the equation into the standard form x2 + px + q = 0 where p = ba and q = ca.

    Show in article · Read it in context on Wikipedia

    Polynomial.monic_mul_leadingCoeff_inv states part

    theorem Polynomial.monic_mul_leadingCoeff_inv {K : Type*} [DivisionRing K] {p : K[X]} : p ≠ 0 → (p * Polynomial.C p.leadingCoeff⁻¹).Monic

    Mathlib.Algebra.Polynomial.Degree.Lemmas · lines 464–466

    Why only part: It yields the monic normalisation only; the values b/a and c/a of the two remaining coefficients are not part of its conclusion.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, low confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key eece76547df1 · pair key 8cf14645139b.
  96. Theorem · main statement · Solving algebraic equations › Quadratic equations

    Formalized

    Formalized: Mathlib states a more general result (proved).

    Solving this, by a process known as completing the square, leads to the quadratic formula x = −b ± √b2 − 4ac2a, where the symbol "±" indicates that both x = −b + √b2 − 4ac2a and x = −b − √b2 − 4ac2a are solutions of the quadratic equation.

    Show in article · Read it in context on Wikipedia

    quadratic_eq_zero_iff more general

    theorem quadratic_eq_zero_iff {K : Type*} [Field K] [NeZero 2] {a b c : K} : a ≠ 0 → ∀ {s : K}, discrim a b c = s * s → ∀ (x : K), a * (x * x) + b * x + c = 0 ↔ x = (-b + s) / (2 * a) ∨ x = (-b - s) / (2 * a)

    Mathlib.Algebra.QuadraticDiscriminant · lines 85–89

    Why more general: Lean states an equivalence over any field in which two is nonzero, so it also settles that no other value of x solves the equation.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key fd851c403453 · pair key bfea3443c56a.

    quadratic_eq_zero_iff_of_discrim_eq_zero special case

    theorem quadratic_eq_zero_iff_of_discrim_eq_zero {K : Type*} [Field K] [NeZero 2] {a b c : K} : a ≠ 0 → discrim a b c = 0 → ∀ (x : K), a * (x * x) + b * x + c = 0 ↔ x = -b / (2 * a)

    Mathlib.Algebra.QuadraticDiscriminant · lines 100–103

    Why a special case: It is the article's formula restricted to the one case where the two signs give the same value.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 2b6b71b3bf4e · pair key e6231b57cd68.
  97. Theorem · supporting · Solving algebraic equations › Quadratic equations

    Not formalized
    As an example of factoring: x2 + 3x − 10 = 0, which is the same thing as (x + 5)(x − 2) = 0.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 12ac3d969d6d).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  98. Theorem · main statement · Solving algebraic equations › Quadratic equations

    Formalized

    Formalized: Mathlib states a more general result (proved).

    It follows from the zero-product property that either x = 2 or x = −5 are the solutions, since precisely one of the factors must be equal to zero.

    Show in article · Read it in context on Wikipedia

    mul_eq_zero more general

    theorem mul_eq_zero {M₀ : Type*} [MulZeroClass M₀] [NoZeroDivisors M₀] {a b : M₀} : a * b = 0 ↔ a = 0 ∨ b = 0

    Mathlib.Algebra.GroupWithZero.Defs · lines 293–295

    Why more general: The lemma is phrased for an arbitrary multiplicative structure without zero divisors, and the article reads it off for the two real linear factors it has just written.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key f02157e3509d · pair key ebc7b7af8b02.

    quadratic_eq_zero_iff more general

    theorem quadratic_eq_zero_iff {K : Type*} [Field K] [NeZero 2] {a b c : K} : a ≠ 0 → ∀ {s : K}, discrim a b c = s * s → ∀ (x : K), a * (x * x) + b * x + c = 0 ↔ x = (-b + s) / (2 * a) ∨ x = (-b - s) / (2 * a)

    Mathlib.Algebra.QuadraticDiscriminant · lines 85–89

    Why more general: The declaration is stated for arbitrary coefficients over any field, and the article's factored equation is one choice of those coefficients.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key a73848eb49ff · pair key 6f2cb54ffc73.
  99. Theorem · supporting · Solving algebraic equations › Quadratic equations

    Partial

    With community edits: Partial. As published it is Formalized.

    Partial, by a community edit: Mathlib states part of this (proved).

    It follows from the zero-product property that either x = 2 or x = −5 are the solutions, since precisely one of the factors must be equal to zero.

    Show in article · Read it in context on Wikipedia

    mul_eq_zero states part

    theorem mul_eq_zero {M₀ : Type*} [MulZeroClass M₀] [NoZeroDivisors M₀] {a b : M₀} : a * b = 0 ↔ a = 0 ∨ b = 0

    Mathlib.Algebra.GroupWithZero.Defs · lines 293–295

    Community Agent The pipeline said more general; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.

    Why only part: mul_eq_zero says that, in a setting with no zero divisors, a product is zero exactly when at least one factor is zero. That covers the clause that one of the factors must be zero. It does not say only one factor vanishes. Both factors can be zero at the same time, so the passage's "precisely one" is a separate claim the lemma does not state.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e81c37191566 · pair key 9be1fda4e1b2.
  100. Theorem · main statement · Solving algebraic equations › Quadratic equations

    Partial

    Partial: Mathlib states part of this (proved).

    All quadratic equations will have two solutions in the complex number system, but need not have any in the real number system.

    Show in article · Read it in context on Wikipedia

    IsAlgClosed.card_roots_eq_natDegree states part

    theorem IsAlgClosed.card_roots_eq_natDegree {k : Type u} [Field k] [IsAlgClosed k] {p : k[X]} : p.roots.card = p.natDegree

    Mathlib.FieldTheory.IsAlgClosed.Basic · lines 113–115

    Why only part: The declaration counts roots of any polynomial over any algebraically closed field, and the complex quadratic of the passage is one instance of that.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b7eee27083ed · pair key 85cb5e123ca0.

    quadratic_ne_zero_of_discrim_ne_sq states part

    theorem quadratic_ne_zero_of_discrim_ne_sq {R : Type*} [CommRing R] {a b c : R} : (∀ (s : R), discrim a b c ≠ s ^ 2) → ∀ (x : R), a * (x * x) + b * x + c ≠ 0

    Mathlib.Algebra.QuadraticDiscriminant · lines 74–76

    Why only part: The declaration is stated for arbitrary coefficients in any commutative ring, so the real quadratic that witnesses the conjunct is one of its cases.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b34a6443a9e1 · pair key 3afcaef0d8a9.
  101. Example · supporting · Solving algebraic equations › Quadratic equations

    Formalized

    Formalized: Mathlib states a more general result (proved).

    For example, x2 + 1 = 0 has no real number solution since no real number squared equals −1.

    Show in article · Read it in context on Wikipedia

    sq_nonneg more general

    theorem sq_nonneg {R : Type u} [Semiring R] [LinearOrder R] [ExistsAddOfLE R] [PosMulMono R] [AddLeftMono R] (a : R) : 0 ≤ a ^ 2

    Mathlib.Algebra.Order.Ring.Unbundled.Basic · lines 608–618

    Why more general: The declaration holds in any linearly ordered semiring carrying the listed order instances, the reals being one of these.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b27d857f32e4 · pair key 79c4b728e694.
  102. Theorem · supporting · Solving algebraic equations › Quadratic equations

    Formalized

    Formalized: Mathlib states a more general result (proved).

    has no real number solution since no real number squared equals −1.

    Show in article · Read it in context on Wikipedia

    sq_nonneg more general

    theorem sq_nonneg {R : Type u} [Semiring R] [LinearOrder R] [ExistsAddOfLE R] [PosMulMono R] [AddLeftMono R] (a : R) : 0 ≤ a ^ 2

    Mathlib.Algebra.Order.Ring.Unbundled.Basic · lines 608–618

    Why more general: The declaration is written for any linearly ordered semiring with the listed order instances, and the reals are one such setting.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 32d210e9516f · pair key 27789cc695d0.

    IsSquare.nonneg more general

    theorem IsSquare.nonneg {R : Type*} [Semiring R] [LinearOrder R] [ExistsAddOfLE R] [PosMulMono R] [AddLeftMono R] {x : R} : IsSquare x → 0 ≤ x

    Mathlib.Algebra.Order.Ring.Basic · lines 24–28

    Why more general: The declaration speaks of any element that is a square in a linearly ordered semiring with the listed instances, not of the reals alone.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 6ec80f56e751 · pair key 6ce651347a4b.
  103. Example · supporting · Solving algebraic equations › Quadratic equations

    Formalized

    Formalized: Mathlib states a more general result (proved).

    Sometimes a quadratic equation has a root of multiplicity 2, such as: (x + 1)2 = 0.

    Show in article · Read it in context on Wikipedia

    Polynomial.rootMultiplicity_X_sub_C_pow more general

    theorem Polynomial.rootMultiplicity_X_sub_C_pow {R : Type u} [CommRing R] [Nontrivial R] (a : R) (n : ℕ) : Polynomial.rootMultiplicity a ((Polynomial.X - Polynomial.C a) ^ n) = n

    Mathlib.Algebra.Polynomial.RingDivision · lines 178–181

    Why more general: The declaration fixes the multiplicity for every exponent over every nontrivial commutative ring, and the article takes the exponent two case.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b75a529099ba · pair key 7753a9ea66e0.
  104. Theorem · supporting · Solving algebraic equations › Quadratic equations

    Formalized

    Formalized: Mathlib states a more general result (proved).

    For this equation, −1 is a root of multiplicity 2.

    Show in article · Read it in context on Wikipedia

    Polynomial.rootMultiplicity_X_sub_C_pow more general

    theorem Polynomial.rootMultiplicity_X_sub_C_pow {R : Type u} [CommRing R] [Nontrivial R] (a : R) (n : ℕ) : Polynomial.rootMultiplicity a ((Polynomial.X - Polynomial.C a) ^ n) = n

    Mathlib.Algebra.Polynomial.RingDivision · lines 178–181

    Why more general: Writing the factor as the unknown minus the constant minus one is the same polynomial as the one the article squares, and the lemma fixes its root multiplicity.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 1de825a7c2ed · pair key 8190afaca343.
  105. Theorem · supporting · Solving algebraic equations › Quadratic equations

    Formalized

    Formalized: Mathlib states a more general result (proved).

    This means −1 appears twice, since the equation can be rewritten in factored form as

    Show in article · Read it in context on Wikipedia

    Polynomial.count_roots more general

    theorem Polynomial.count_roots {R : Type u} {a : R} [CommRing R] [IsDomain R] [DecidableEq R] (p : R[X]) : Multiset.count a p.roots = Polynomial.rootMultiplicity a p

    Mathlib.Algebra.Polynomial.Roots · lines 97–101

    Why more general: The declaration ties the two readings together for any polynomial over any domain, and the article's squared factor is one of those polynomials.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 53d30266cc4f · pair key 4509dcd3447d.
  106. Theorem · supporting · Solving algebraic equations › Quadratic equations

    Formalized

    Formalized: Mathlib states a more general result (proved).

    This means −1 appears twice, since the equation can be rewritten in factored form as [x − (−1)][x − (−1)] = 0.

    Show in article · Read it in context on Wikipedia

    pow_two more general

    theorem pow_two {M : Type*} [Monoid M] (a : M) : a ^ 2 = a * a

    Mathlib.Algebra.Group.Monoid · line 431

    Why more general: Lean states the identity for any monoid element; the passage writes the repeated factor with the root minus one displayed, which is the same real expression.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key fde0752e4bb6 · pair key 0a8ae9920dea.
  107. Theorem · main statement · Solving algebraic equations › Quadratic equations › Complex numbers

    Partial

    Partial: Mathlib states part of this (proved).

    All quadratic equations have exactly two solutions in complex numbers (but they may be equal to each other), a category that includes real numbers, imaginary numbers, and sums of real and imaginary numbers.

    Show in article · Read it in context on Wikipedia

    IsAlgClosed.card_roots_eq_natDegree states part

    theorem IsAlgClosed.card_roots_eq_natDegree {k : Type u} [Field k] [IsAlgClosed k] {p : k[X]} : p.roots.card = p.natDegree

    Mathlib.FieldTheory.IsAlgClosed.Basic · lines 113–115

    Why only part: The passage also describes the complex numbers as reals, imaginaries and their sums, which this count of roots leaves to the second card.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 3e35dc52e1a4 · pair key 0da793f82946.

    Complex.re_add_im states part

    theorem Complex.re_add_im (z : ℂ) : ↑z.re + ↑z.im * Complex.I = z

    Mathlib.Basic.Complex.Basic · lines 264–265

    Why only part: Lean gives the decomposition as an identity on each complex number, with the imaginary part a real coefficient of i.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 32f6eb8448a5 · pair key cb72caaf14ac.
  108. Theorem · supporting · Solving algebraic equations › Quadratic equations › Complex numbers

    Formalized

    Formalized: Mathlib states a more general result (proved).

    For example, the quadratic equation x2 + x + 1 = 0 has solutions x = −1 + √−32  and  x = −1 − √−32.

    Show in article · Read it in context on Wikipedia

    quadratic_eq_zero_iff more general

    theorem quadratic_eq_zero_iff {K : Type*} [Field K] [NeZero 2] {a b c : K} : a ≠ 0 → ∀ {s : K}, discrim a b c = s * s → ∀ (x : K), a * (x * x) + b * x + c = 0 ↔ x = (-b + s) / (2 * a) ∨ x = (-b - s) / (2 * a)

    Mathlib.Algebra.QuadraticDiscriminant · lines 85–89

    Why more general: Lean writes the quadratic as a times x times x plus b times x plus c and gives both roots as an equivalence valid for every x.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 441a8d20d678 · pair key db0555c9c74c.
  109. Theorem · supporting · Solving algebraic equations › Quadratic equations › Complex numbers

    Formalized

    Formalized: Mathlib states a more general result (proved).

    Since √−3 is not any real number, both of these solutions for x are complex numbers.

    Show in article · Read it in context on Wikipedia

    Real.isSquare_iff more general

    theorem Real.isSquare_iff {x : ℝ} : IsSquare x ↔ 0 ≤ x

    Mathlib.Analysis.Real.Sqrt · lines 302–303

    Why more general: Lean phrases having a square root as being a square and characterises that by being nonnegative, which fails at a negative radicand.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e7502cf4cf16 · pair key 87a314579c93.
  110. Theorem · supporting · Solving algebraic equations › Quadratic equations › Complex numbers

    Formalized

    Formalized: Mathlib states a more general result (proved).

    Since √−3 is not any real number, both of these solutions for x are complex numbers.

    Show in article · Read it in context on Wikipedia

    quadratic_ne_zero_of_discrim_ne_sq more general

    theorem quadratic_ne_zero_of_discrim_ne_sq {R : Type*} [CommRing R] {a b c : R} : (∀ (s : R), discrim a b c ≠ s ^ 2) → ∀ (x : R), a * (x * x) + b * x + c ≠ 0

    Mathlib.Algebra.QuadraticDiscriminant · lines 74–76

    Why more general: Lean states the absence of a root over the given ring for every quadratic whose discriminant has no square root there.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 8376f9615dcc · pair key 3a82975eae77.
  111. Definition · main statement · Solving algebraic equations › Exponential and logarithmic equations

    Partial

    Partial: Mathlib states a special case (proved).

    An exponential equation is one which has the form ax = b for a > 0,[43] which has solution x = loga b = ln bln a when b > 0.

    Show in article · Read it in context on Wikipedia

    Real.logb_eq_iff_rpow_eq special case

    theorem Real.logb_eq_iff_rpow_eq {b x y : ℝ} : 0 < b → b ≠ 1 → 0 < y → (Real.logb b y = x ↔ b ^ x = y)

    Mathlib.Analysis.SpecialFunctions.Log.Base · lines 155–158

    Why a special case: Lean's base-a logarithm unfolds to the quotient of the two natural logarithms that closes the passage's formula, and the declaration adds that the base differs from one, where that quotient would divide by zero.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b3b6485a29a3 · pair key 5c8accd6ea0c.

    Real.rpow_logb special case

    theorem Real.rpow_logb {b x : ℝ} : 0 < b → b ≠ 1 → 0 < x → b ^ Real.logb b x = x

    Mathlib.Analysis.SpecialFunctions.Log.Base · lines 147–149

    Why a special case: It verifies the passage's proposed solution for a base away from one, the case in which Lean's base-a logarithm is well behaved.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 69fd5b749d8b · pair key 8dd22008e250.
  112. Theorem · supporting · Solving algebraic equations › Exponential and logarithmic equations

    Partial

    With community edits: Partial. As published it is Formalized.

    Partial, by a community edit: Mathlib states part of this (proved).

    For example, if 3 ⋅ 2x − 1 + 1 = 10 then, by subtracting 1 from both sides of the equation, and then dividing both sides by 3 we obtain 2x − 1 = 3 whence x − 1 = log2 3 or x = log2 3 + 1.

    Show in article · Read it in context on Wikipedia

    Real.logb_eq_iff_rpow_eq states part

    theorem Real.logb_eq_iff_rpow_eq {b x y : ℝ} : 0 < b → b ≠ 1 → 0 < y → (Real.logb b y = x ↔ b ^ x = y)

    Mathlib.Analysis.SpecialFunctions.Log.Base · lines 155–158

    Community Agent The pipeline said more general; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.

    Why only part: With base 2 and y = 3, Real.logb_eq_iff_rpow_eq states the passage's middle step: 2^(x-1) = 3 holds exactly when x - 1 = log_2 3. The other steps of the worked example aren't stated: subtracting 1, dividing by 3, and concluding x = log_2 3 + 1. So the declaration covers one clause of the passage, not the whole solution.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key acc8129e6662 · pair key 5e4f0b348e96.

    Real.logb_rpow states part

    theorem Real.logb_rpow {b x : ℝ} : 0 < b → b ≠ 1 → Real.logb b (b ^ x) = x

    Mathlib.Analysis.SpecialFunctions.Log.Base · lines 134–136

    Community Agent The pipeline said more general; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.

    Why only part: Real.logb_rpow says that the base-b logarithm of b^x is x, for b positive and not 1. With b = 2 this justifies the passage's step from 2^(x-1) = 3 to x - 1 = log_2 3 (take log_2 of both sides). The arithmetic steps and the final value x = log_2 3 + 1 are not stated. So the declaration supports one clause of the worked solution, not all of it.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e7ad6b49a3d3 · pair key 5df7485d7b49.
  113. Definition · main statement · Solving algebraic equations › Exponential and logarithmic equations

    Partial

    Partial: Mathlib states a special case (proved).

    A logarithmic equation is an equation of the form loga(x) = b for a > 0, which has solution x = ab.

    Show in article · Read it in context on Wikipedia

    Real.logb_eq_iff_rpow_eq special case

    theorem Real.logb_eq_iff_rpow_eq {b x y : ℝ} : 0 < b → b ≠ 1 → 0 < y → (Real.logb b y = x ↔ b ^ x = y)

    Mathlib.Analysis.SpecialFunctions.Log.Base · lines 155–158

    Why a special case: Lean reads the equation through its base-a logarithm and real exponentiation, and asks for a base other than one and a positive argument, the range where the passage's logarithm makes sense.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 18d685f60964 · pair key a41e573b7882.

    Real.logb_rpow special case

    theorem Real.logb_rpow {b x : ℝ} : 0 < b → b ≠ 1 → Real.logb b (b ^ x) = x

    Mathlib.Analysis.SpecialFunctions.Log.Base · lines 134–136

    Why a special case: It checks the passage's proposed solution for a base other than one, where Lean's base-a logarithm inverts exponentiation.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key db7396dde2c0 · pair key 6b8050d349b4.
  114. Theorem · supporting · Solving algebraic equations › Exponential and logarithmic equations

    Not formalized
    For example, if 4log5(x − 3) − 2 = 6 then, by adding 2 to both sides of the equation, followed by dividing both sides by 4, we get log5(x − 3) = 2 whence x − 3 = 52 = 25 from which we obtain x = 28.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 2 candidates examined (receipt ca211e25d7a0).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  115. Definition · main statement · Solving algebraic equations › Radical equations

    Not formalized
    A radical equation is one that includes a radical sign, which includes square roots, √x, cube roots, 3√x, and nth roots, n√x.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 2 candidates examined (receipt e434f00a540a).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  116. Theorem · main statement · Solving algebraic equations › Radical equations

    Partial

    Partial: Formal Conjectures states a special case (proved).

    Recall that an nth root can be rewritten in exponential format, so that n√x is equivalent to x1n.

    Show in article · Read it in context on Wikipedia

    Real.nthRoot_of_nonneg special case

    theorem Real.nthRoot_of_nonneg {n : ℕ} {r : ℝ} : 0 ≤ r → Real.nthRoot n r = r ^ (↑n)⁻¹

    FormalConjecturesForMathlib.Analysis.SpecialFunctions.NthRoot · lines 57–68

    Why a special case: It carries the hypothesis that x is nonnegative, which the passage does not impose, so it states the rewriting on part of the passage's range of x; at index zero the reciprocal cast gives exponent zero, outside the indices the passage speaks of.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key d0c9c2dbf4f8 · pair key 6d6b33a6912c.

    Real.nthRoot_of_even special case

    theorem Real.nthRoot_of_even {n : ℕ} : Even n → ∀ (r : ℝ), Real.nthRoot n r = r ^ (↑n)⁻¹

    FormalConjecturesForMathlib.Analysis.SpecialFunctions.NthRoot · lines 38–39

    Why a special case: It fixes the index to be even, so it gives the passage's rewriting only for even roots.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 040c64773d4f · pair key 1f2a3e60f698.

    Real.sqrt_eq_rpow special case

    theorem Real.sqrt_eq_rpow (x : ℝ) : √x = x ^ (1 / 2)

    Mathlib.Analysis.SpecialFunctions.Pow.Real · lines 990–996

    Why a special case: This is the passage's rewriting at index two only, with the exponent written as one half.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 3 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 6b148e04af1d · pair key 0088f0ac70aa.
  117. Theorem · supporting · Solving algebraic equations › Radical equations

    Not formalized
    Combined with regular exponents (powers), then 2√x3 (the square root of x cubed), can be rewritten as x32.[44]

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 3 candidates examined (receipt aba45ed03a92).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  118. Definition · main statement · Solving algebraic equations › Radical equations

    Partial

    Partial: Formal Conjectures states a special case (proved).

    So a common form of a radical equation is n√xm = a (equivalent to xmn = a) where m and n are integers. It has real solution(s):

    Show in article · Read it in context on Wikipedia

    Real.nthRoot_of_nonneg special case

    theorem Real.nthRoot_of_nonneg {n : ℕ} {r : ℝ} : 0 ≤ r → Real.nthRoot n r = r ^ (↑n)⁻¹

    FormalConjecturesForMathlib.Analysis.SpecialFunctions.NthRoot · lines 57–68

    Why a special case: It fixes the inner exponent to one and restricts to nonnegative x, where the passage allows any integer numerator and any x, so it gives that single case of the passage's equivalence of forms.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key f93ae904ff0c · pair key d24d90212a31.

    Real.sqrt_eq_rpow special case

    theorem Real.sqrt_eq_rpow (x : ℝ) : √x = x ^ (1 / 2)

    Mathlib.Analysis.SpecialFunctions.Pow.Real · lines 990–996

    Why a special case: This is the passage's pair of forms at the single index two and numerator one, where the passage ranges over integer exponents.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key fe4d49ded82b · pair key 9251fdc6412a.
  119. Theorem · main statement · Solving algebraic equations › Radical equations

    Not formalized
    n is odd n is even

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 7 queries and 4 candidates examined (receipt c069ef59e9fc).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  120. Theorem · supporting · Solving algebraic equations › Radical equations

    Not formalized
    For example, if: (x + 5)2/3 = 4 then x + 5= ±(√4)3,x + 5= ±8,x= −5 ± 8, and thus x = 3 or x = −13

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 3 candidates examined (receipt d8ef40c03ed4).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  121. Example · supporting · Solving algebraic equations › System of linear equations › Elimination method

    Not formalized
    An example of solving a system of linear equations is by using the elimination method: {4x + 2y= 142x − y= 1.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 5 queries and 3 candidates examined (receipt 9ce6baaf57fc).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  122. Theorem · supporting · Solving algebraic equations › System of linear equations › Elimination method

    Partial

    Partial: Mathlib states part of this (proved).

    Multiplying the terms in the second equation by 2: 4x + 2y = 14 4x − 2y = 2.

    Show in article · Read it in context on Wikipedia

    mul_right_inj' states part

    theorem mul_right_inj' {M₀ : Type*} [Mul M₀] [Zero M₀] [IsLeftCancelMulZero M₀] {a b c : M₀} : a ≠ 0 → (a * b = a * c ↔ b = c)

    Mathlib.Algebra.GroupWithZero.Defs · line 62

    Why only part: The declaration is stated for any multiplication in which a nonzero element cancels, and the doubled sides appear here already multiplied out.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key eaae4233279e · pair key 873868981bca.

    congrArg states part

    theorem congrArg {α : Sort u} {β : Sort v} {a₁ a₂ : α} (f : α → β) : a₁ = a₂ → f a₁ = f a₂

    Init.Prelude · lines 415–416

    Why only part: This is the bare inference the step performs, with no arithmetic assumption attached to it.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key a0b00ac94bca · pair key f8ed9d1ada6f.
  123. Theorem · supporting · Solving algebraic equations › System of linear equations › Elimination method

    Not formalized
    Adding the two equations together to get: 8x = 16 which simplifies to x = 2.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 72d2115cc3e1).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  124. Theorem · supporting · Solving algebraic equations › System of linear equations › Elimination method

    Not formalized
    Since the fact that x = 2 is known, it is then possible to deduce that y = 3 by either of the original two equations (by using 2 instead of x ) The full solution to this problem is then

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 72ce34793625).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  125. Theorem · main statement · Solving algebraic equations › System of linear equations › Elimination method

    Not formalized
    Since the fact that x = 2 is known, it is then possible to deduce that y = 3 by either of the original two equations (by using 2 instead of x ) The full solution to this problem is then {x = 2y = 3.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 84fe4d288b56).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  126. Example · supporting · Solving algebraic equations › System of linear equations › Substitution method

    Not formalized
    {4x + 2y= 142x − y= 1.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 185959ef88e2).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  127. Theorem · supporting · Solving algebraic equations › System of linear equations › Substitution method

    Not formalized
    Using the second equation: 2x − y = 1

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 22567bdb8f4c).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  128. Theorem · supporting · Solving algebraic equations › System of linear equations › Substitution method

    Formalized

    Formalized by 2 parts together (more general):

    1. sub_left_inj Mathlib (proved)
      • subtracting 2x from each side of the second equation gives -y = 1 - 2x
    2. neg_eq_iff_eq_neg Mathlib (proved)
      • multiplying that equation by -1 gives y = 2x - 1
    Subtracting 2x from each side of the equation: 2x − 2x − y= 1 − 2x−y= 1 − 2x and multiplying by −1: y = 2x − 1.

    Show in article · Read it in context on Wikipedia

    sub_left_inj states part

    theorem sub_left_inj {G : Type*} [AddGroup G] {a b c : G} : b - a = c - a ↔ b = c

    Mathlib.Algebra.Group.Basic · line 733

    Why only part: The declaration is stated for any additive group, and the left side appears here already simplified after the cancellation of the two like terms.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b6a59e2c84fe · pair key 9e92b242f891.

    neg_eq_iff_eq_neg states part

    theorem neg_eq_iff_eq_neg {G : Type*} [InvolutiveNeg G] {a b : G} : -a = b ↔ a = -b

    Mathlib.Algebra.Group.Basic · line 308

    Why only part: Changing the sign on both sides is stated as an equivalence over any type whose negation is its own inverse, and the resulting right side appears here with its two terms reordered.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b28ab041cf40 · pair key 3206acefda28.
  129. Theorem · supporting · Solving algebraic equations › System of linear equations › Substitution method

    Partial

    With community edits: Partial. As published it is Formalized.

    Partial, by a community edit: Lean core states part of this (proved).

    Using this y value in the first equation in the original system: 4x + 2(2x − 1)= 144x + 4x − 2= 148x − 2= 14

    Show in article · Read it in context on Wikipedia

    Eq.subst states part

    theorem Eq.subst {α : Sort u} {motive : α → Prop} {a b : α} : a = b → motive a → motive b

    Init.Prelude · lines 361–362

    Community Agent The pipeline said more general; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.

    Why only part: Eq.subst is substitution of equals: from a = b and P(a), conclude P(b). It covers the passage's first move, putting y = 2x - 1 into 4x + 2y = 14 to get 4x + 2(2x - 1) = 14. The later lines (expanding to 4x + 4x - 2 = 14 and collecting to 8x - 2 = 14) are ring arithmetic, which Eq.subst does not state. So it covers one clause of the passage.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 9eaa9176e880 · pair key ab0b8fb6d19a.
  130. Theorem · supporting · Solving algebraic equations › System of linear equations › Substitution method

    Not formalized
    Adding 2 on each side of the equation: 8x − 2 + 2= 14 + 28x= 16 which simplifies to x = 2

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 0 candidates examined (receipt b92ad3324ce4).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  131. Theorem · supporting · Solving algebraic equations › System of linear equations › Substitution method

    Not formalized
    {x = 2y = 3.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 53827e133504).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  132. Theorem · main statement · Solving algebraic equations › Other types of systems of linear equations › Inconsistent systems

    Partial

    Partial: Formal Conjectures states a special case (statement only: the proof is not finished).

    However, there are also systems of equations which do not have any solution.

    Show in article · Read it in context on Wikipedia

    MonochromaticQuantumGraph.eqSystem10_no_solution_d3 special case

    theorem MonochromaticQuantumGraph.eqSystem10_no_solution_d3 : ¬∃ W, MonochromaticQuantumGraph.EqSystemN 10 3 W

    FormalConjectures.Paper.MonochromaticQuantumGraph · lines 483–485

    Why a special case: The declaration pins one particular system of polynomial equations where the passage speaks of systems in general.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key ad5dc2e5c965 · pair key 631da903048e.

    MonochromaticQuantumGraph.eqSystem_no_solution_ge6_ge3 special case

    theorem MonochromaticQuantumGraph.eqSystem_no_solution_ge6_ge3 (N D : ℕ) : N ≥ 6 → Even N → D ≥ 3 → ¬∃ W, MonochromaticQuantumGraph.EqSystemN N D W

    FormalConjectures.Paper.MonochromaticQuantumGraph · lines 573–576

    Why a special case: The systems it speaks of are the quantum graph ones, a narrower collection than the systems of equations the passage ranges over.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1a, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 01eaaf041d90 · pair key 11403ae33054.
  133. Definition · main statement · Solving algebraic equations › Other types of systems of linear equations › Inconsistent systems

    Not formalized
    Such a system is called inconsistent.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 5ffde68352c6).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  134. Example · supporting · Solving algebraic equations › Other types of systems of linear equations › Inconsistent systems

    Not formalized
    An obvious example is {x + y= 10x + 0y= 2 .

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 144f2713e0f9).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  135. Theorem · supporting · Solving algebraic equations › Other types of systems of linear equations › Inconsistent systems

    Not formalized
    As 0≠2, the second equation in the system has no solution.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 1 candidates examined (receipt be2f20a0009f).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  136. Theorem · supporting · Solving algebraic equations › Other types of systems of linear equations › Inconsistent systems

    Not formalized
    Therefore, the system has no solution.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 4455715bc149).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  137. Example · supporting · Solving algebraic equations › Other types of systems of linear equations › Inconsistent systems

    Not formalized
    As an example, consider the system {4x + 2y= 12−2x − y= −4 .

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 400b488fc26b).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  138. Theorem · supporting · Solving algebraic equations › Other types of systems of linear equations › Inconsistent systems

    Not formalized
    Multiplying by 2 both sides of the second equation, and adding it to the first one results in 0x + 0y = 4 , which clearly has no solution.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 2 candidates examined (receipt a341add07497).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  139. Theorem · main statement · Solving algebraic equations › Other types of systems of linear equations › Undetermined systems

    Not formalized
    There are also systems which have infinitely many solutions, in contrast to a system with a unique solution (meaning, a unique pair of values for x and y) For example:

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 2 candidates examined (receipt b613c325157b).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  140. Example · supporting · Solving algebraic equations › Other types of systems of linear equations › Undetermined systems

    Not formalized
    There are also systems which have infinitely many solutions, in contrast to a system with a unique solution (meaning, a unique pair of values for x and y) For example: {4x + 2y= 12−2x − y= −6

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 4543ea782633).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  141. Theorem · supporting · Solving algebraic equations › Other types of systems of linear equations › Undetermined systems

    Not formalized
    Isolating y in the second equation: y = −2x + 6

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 2 candidates examined (receipt d0db4b4a140b).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  142. Theorem · supporting · Solving algebraic equations › Other types of systems of linear equations › Undetermined systems

    Not formalized
    And using this value in the first equation in the system: 4x + 2(−2x + 6) = 124x − 4x + 12 = 1212 = 12

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 2bc825750db8).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  143. Theorem · supporting · Solving algebraic equations › Other types of systems of linear equations › Undetermined systems

    Not formalized
    Indeed, one can easily verify (by just filling in some values of x) that for any x there is a solution as long as y = −2x + 6.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 6f1faa3e044e).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  144. Theorem · supporting · Solving algebraic equations › Other types of systems of linear equations › Undetermined systems

    Not formalized
    There is an infinite number of solutions for this system.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 38c4f359b41a).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  145. Definition · main statement · Solving algebraic equations › Other types of systems of linear equations › Over- and underdetermined systems

    Not formalized
    Systems with more variables than the number of linear equations are called underdetermined.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 1270d1c929fd).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  146. Theorem · main statement · Solving algebraic equations › Other types of systems of linear equations › Over- and underdetermined systems

    Not formalized
    Such a system, if it has any solutions, does not have a unique one but rather an infinitude of them.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 5464074583d0).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  147. Example · supporting · Solving algebraic equations › Other types of systems of linear equations › Over- and underdetermined systems

    Not formalized
    An example of such a system is {x + 2y= 10y − z= 2.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 0 candidates examined (receipt e6390bef6bfb).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  148. Definition · main statement · Solving algebraic equations › Other types of systems of linear equations › Over- and underdetermined systems

    Not formalized
    A system with a higher number of equations than variables is called overdetermined.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 3 queries and 0 candidates examined (receipt bf6804ccae4a).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  149. Theorem · main statement · Solving algebraic equations › Other types of systems of linear equations › Over- and underdetermined systems

    Not formalized
    If an overdetermined system has any solutions, necessarily some equations are linear combinations of the others.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct 2026 (UTC), locate run loc-tierA-b1a by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 7495128099e3).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.

Data: view model (JSON) · Literature Links records (JSONL)