WikiLean · Articles Articles Brain Contribute About

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

Equation solving

54 passages11 formalized16 partial27 not formalized

Statement only

More ways to filter
Library
About this page

This page

  • Wikipedia revision 1325039164, pinned: the text here is that revision, not today's article.
  • WikiProject Mathematics: C-class, High importance
  • Annotated article on WikiLean.
  • 54 passages checked, 43 Lean locations (and 24 related declarations).

Central statements: 13 of the 54 passages state the article's subject or a named result or definition; the other 41 are supporting (examples, setup). Of these 13: 3 formalized, 5 partial, 5 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-b1b (cf-locate-recordset/2, statuses by status rule 3), exported 1 Nov 2026 by formal-companion at commit d85385a.
  • Seal sha256 23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602.
  • 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-b1b, run by jack, 31 Oct 2026, 04:59 – 1 Nov 2026, 03:06 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 (11 locations and 5 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): 11 of 32 locations and 5 of 22 absences. In all, 22 of 43 Lean locations (51%) and 10 of 27 absences (37%) were re-checked.
  • Passage text: 54 of 54 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 1325039164 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 · Subject of the article

    Partial

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

    In mathematics, to solve an equation is to find the solutions of an equation, which are the values (numbers, functions, sets, etc.) that fulfill the condition stated by the equation, consisting generally of two expressions related by an equals sign.

    Show in article · Read it in context on Wikipedia

    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: The declaration covers only polynomial equations over a commutative ring mapped into a domain, while the passage speaks of equations of every kind, including ones whose solutions are functions or sets.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 54c95dd3dae0 · pair key d9fbcc46bbfe.
  2. Definition · main statement

    Not formalized
    When seeking a solution, one or more variables are designated as unknowns.

    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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 6416e7298dd0).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  3. Definition · main statement

    Partial

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

    A solution is an assignment of values to the unknown variables that makes the equality in the equation true.

    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: The declaration fixes the equation to a univariate polynomial one and the assignment to a single value, where the passage allows an equation of any kind and an assignment to several unknowns.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 5cfe434a190f · pair key 2425a85914e7.
  4. Definition · supporting

    Partial

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

    In other words, a solution is a value or a collection of values (one for each unknown) such that, when substituted for the unknowns, the equation becomes an equality.

    Show in article · Read it in context on Wikipedia

    WeierstrassCurve.Affine.Equation special case

    def WeierstrassCurve.Affine.Equation {R : Type r} [CommRing R] : WeierstrassCurve.Affine R → R → R → Prop

    Mathlib.AlgebraicGeometry.EllipticCurve.Affine.Basic · lines 149–150

    Why a special case: The declaration fixes one family of equations in two unknowns, where the passage speaks of an arbitrary equation with any number of unknowns.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 0d62eaaf902b · pair key 68ccee052633.

    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: This covers only the one-unknown case of the passage, where a solution is a single value rather than a tuple.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 19671d33c718 · pair key c504f922eed7.
  5. Definition · supporting

    Partial

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

    A solution of an equation is often called a root of the equation, particularly but not only for polynomial equations.

    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: The declaration carries the naming only for polynomial equations, which the passage singles out while allowing the word elsewhere too; its docstring states that evaluation at a root is zero.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 1ebc7c451708 · pair key 72aa489d9c99.
  6. Definition · main statement

    Partial

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

    The set of all solutions of an equation is its solution set.

    Show in article · Read it in context on Wikipedia

    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: The declaration builds the set of solutions only for a polynomial equation into a domain, where the passage speaks of any equation whatsoever.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 990346951a51 · pair key 4106f91adb6c.
  7. Definition · main statement

    Not formalized
    Solving an equation numerically means that only numbers are admitted as solutions.

    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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 51de03f76196).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  8. Definition · supporting

    Not formalized
    Solving an equation symbolically means that expressions can be used for representing the solutions.

    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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 9cf645c7b929).
    • 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. Example · supporting

    Not formalized
    For example, the equation x + y = 2x – 1 is solved for the unknown x by the expression x = y + 1, because substituting y + 1 for x in the equation results in (y + 1) + y = 2(y + 1) – 1, a true statement.

    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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 8f59317c3561).
    • 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. Theorem · supporting

    Not formalized
    For example, the equation x + y = 2x – 1 is solved for the unknown x by the expression x = y + 1, because substituting y + 1 for x in the equation results in (y + 1) + y = 2(y + 1) – 1, a true statement.

    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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt dc01c3afa035).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  11. Example · supporting

    Not formalized
    It is also possible to take the variable y to be the unknown, and then the equation is solved by y = x – 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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 15910cc8235e).
    • 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. Example · supporting

    Not formalized
    Or x and y can both be treated as unknowns, and then there are many solutions to the equation; a symbolic solution is (x, y) = (a + 1, a), where the variable a may take any value.

    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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 6b1502ad5ed1).
    • 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).
  13. Example · supporting

    Not formalized
    Or x and y can both be treated as unknowns, and then there are many solutions to the equation; a symbolic solution is (x, y) = (a + 1, a), where the variable a may take any value.

    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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt a2f73a37e89e).
    • 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).
  14. Theorem · supporting

    Not formalized
    Instantiating a symbolic solution with specific numbers gives a numerical solution; for example, a = 0 gives (x, y) = (1, 0) (that is, x = 1, y = 0), and a = 1 gives (x, y) = (2, 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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 69f144fff1d0).
    • 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).
  15. Example · supporting

    Not formalized
    Instantiating a symbolic solution with specific numbers gives a numerical solution; for example, a = 0 gives (x, y) = (1, 0) (that is, x = 1, y = 0), and a = 1 gives (x, y) = (2, 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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt c76a8b5330ec).
    • 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. Example · supporting

    Not formalized
    Instantiating a symbolic solution with specific numbers gives a numerical solution; for example, a = 0 gives (x, y) = (1, 0) (that is, x = 1, y = 0), and a = 1 gives (x, y) = (2, 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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 9a2f47a958e3).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  17. Definition · supporting

    Not formalized
    When the task is to find the solution that is the best under some criterion, this is an optimization problem.

    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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 8c52546704a7).
    • 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. Definition · main statement · Overview

    Not formalized
    One general form of an equation is f(x1, …, xn) = c, where f is a function, x1, ..., xn are the unknowns, and c is a constant.

    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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt c32538b92b4e).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  19. Theorem · main statement · Overview

    Formalized

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

    Its solutions are the elements of the inverse image (fiber) f−1(c) = {(a1, …, an) ∈ D ∣ f(a1, …, an) = c}, where D is the domain of the function f.

    Show in article · Read it in context on Wikipedia

    Set.mem_preimage more general

    theorem Set.mem_preimage {α : Type u} {β : Type v} {f : α → β} {s : Set β} {a : α} : a ∈ f ⁻¹' s ↔ f a ∈ s

    Mathlib.Data.Set.Operations · line 140

    Why more general: Mathlib writes the fiber over c as the preimage of the one-point set holding c, and lying in that one-point set is the equation f a = c in another encoding (PD10), so nothing beyond the passage's own content is being asserted.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 52b494d43746 · pair key a196eadf4742.
  20. Theorem · supporting · Overview

    Not formalized
    The set of solutions can be the empty set (there are no solutions), a singleton (there is exactly one solution), finite, or infinite (there are infinitely many solutions).

    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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt beca08fbab6a).
    • 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. Example · supporting · Overview

    Formalized

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

    For example, an equation such as 3x + 2y = 21z, with unknowns x, y and z, can be put in the above form by subtracting 21z from both sides of the equation, to obtain 3x + 2y − 21z = 0

    Show in article · Read it in context on Wikipedia

    sub_eq_zero more general

    theorem sub_eq_zero {G : Type*} [AddGroup G] {a b : G} : a - b = 0 ↔ a = b

    Mathlib.Algebra.Group.Basic · line 754

    Why more general: The declaration is the two-way link between an equation and the form got by taking one side over to the other, stated for an arbitrary additive group rather than for this one equation.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 3f0c9b809c84 · pair key 14f520dbfdf3.
  22. Theorem · supporting · Overview

    Not formalized
    In this particular case there is not just one solution, but an infinite set of solutions, which can be written using set builder notation as {(x, y, z) ∣ 3x + 2y − 21z = 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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt f932b995fe64).
    • 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 · Overview

    Not formalized
    One particular solution is x = 0, y = 0, z = 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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt d1aa2a39398b).
    • 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).
  24. Theorem · supporting · Overview

    Not formalized
    Two other solutions are x = 3, y = 6, z = 1, and x = 8, y = 9, 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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 0 candidates examined (receipt 9bdc9458d91d).
    • 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).
  25. Theorem · supporting · Overview

    Not formalized
    There is a unique plane in three-dimensional space which passes through the three points with these coordinates, and this plane is the set of all points whose coordinates are solutions of the equation.

    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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 0 candidates examined (receipt e19e8e5a5b18).
    • 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).
  26. Theorem · supporting · Overview

    Not formalized
    There is a unique plane in three-dimensional space which passes through the three points with these coordinates, and this plane is the set of all points whose coordinates are solutions of the equation.

    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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt e1d843e5b155).
    • 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. Definition · main statement · Solution sets

    Partial

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

    The solution set of a given set of equations or inequalities is the set of all its solutions, a solution being a tuple of values, one for each unknown, that satisfies all the equations or inequalities.

    Show in article · Read it in context on Wikipedia

    MvPolynomial.zeroLocus special case

    def MvPolynomial.zeroLocus {k : Type*} (K : Type*) [Field k] [Field K] [Algebra k K] {σ : Type*} : Ideal (MvPolynomial σ k) → Set (σ → K)

    Mathlib.RingTheory.Nullstellensatz · lines 39–40

    Why a special case: The library object is the article's notion restricted to systems of polynomial equations over a field, with no inequalities among them.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 31e53784d47f · pair key 4fa23574ad30.

    MvPolynomial.ZariskiSpace.zeroLocus special case

    def MvPolynomial.ZariskiSpace.zeroLocus {K : Type u} {σ : Type v} [Field K] : Ideal (MvPolynomial σ K) → Set (MvPolynomial.ZariskiSpace K σ)

    MultivariatePolynomials.ZariskiTopology · lines 89–90

    Why a special case: Same restriction as the Mathlib object, carried over a type synonym for the space of points, and again with no inequalities.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 6060ee7.
    • Location key 25b8b140c7bd · pair key 0c70d962c395.
  28. Theorem · supporting · Solution sets

    Formalized

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

    If the solution set is empty, then there are no values of the unknowns that satisfy simultaneously all equations and inequalities.

    Show in article · Read it in context on Wikipedia

    Set.eq_empty_iff_forall_notMem more general

    theorem Set.eq_empty_iff_forall_notMem {α : Type u} {s : Set α} : s = ∅ ↔ ∀ (x : α), x ∉ s

    Mathlib.Data.Set.Basic · lines 460–461

    Why more general: Stated for any set at all; belonging to the solution set means by definition that the tuple satisfies every equation and inequality of the system.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 8878ef66babd · pair key 59c907fc60ea.
  29. Definition · supporting · Solution sets

    Not formalized
    This equation can be viewed as a Diophantine equation, that is, an equation for which only integer solutions are sought.

    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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 55ccd99a7a12).
    • 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).
  30. Theorem · supporting · Solution sets

    Formalized

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

    In this case, the solution set is the empty set, since 2 is not the square of an integer.

    Show in article · Read it in context on Wikipedia

    Prime.not_isSquare more general

    theorem Prime.not_isSquare {M : Type*} [CommMonoidWithZero M] [IsCancelMulZero M] {p : M} : Prime p → ¬IsSquare p

    Mathlib.Algebra.Prime.Lemmas · lines 148–149

    Why more general: Lean writes the property of being a square where the article writes the equation with an unknown squared; the carrier here is the integers.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 3e0b4a8e37fd · pair key 808fd1f22d06.
  31. Theorem · supporting · Solution sets

    Formalized

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

    In this case, the solution set is the empty set, since 2 is not the square of an integer.

    Show in article · Read it in context on Wikipedia

    Prime.not_isSquare more general

    theorem Prime.not_isSquare {M : Type*} [CommMonoidWithZero M] [IsCancelMulZero M] {p : M} : Prime p → ¬IsSquare p

    Mathlib.Algebra.Prime.Lemmas · lines 148–149

    Why more general: The carrier is the integers here, and Lean's property of being a square is the article's being the square of some integer.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 06b12955aa15 · pair key 65f55fc8a872.
  32. Theorem · supporting · Solution sets

    Partial

    Partial: Mathlib states a special case (proved).

    However, if one searches for real solutions, there are two solutions, √2 and –√2; in other words, the solution set is {√2, −√2}.

    Show in article · Read it in context on Wikipedia

    Real.sqrt_eq_iff_eq_sq special case

    theorem Real.sqrt_eq_iff_eq_sq {x y : ℝ} : 0 ≤ x → 0 ≤ y → (√x = y ↔ x = y ^ 2)

    Mathlib.Analysis.Real.Sqrt · lines 182–183

    Why a special case: The hypothesis of a nonnegative unknown restricts the equation to the half of the line where only one of the two roots lives, so the declaration gives that root and not the pair or its count.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 8c2006575991 · pair key 420ca1202c22.
  33. Theorem · supporting · Solution sets

    Partial

    Partial: Mathlib states a special case (proved).

    However, if one searches for real solutions, there are two solutions, √2 and –√2; in other words, the solution set is {√2, −√2}.

    Show in article · Read it in context on Wikipedia

    Real.sqrt_eq_iff_eq_sq special case

    theorem Real.sqrt_eq_iff_eq_sq {x y : ℝ} : 0 ≤ x → 0 ≤ y → (√x = y ↔ x = y ^ 2)

    Mathlib.Analysis.Real.Sqrt · lines 182–183

    Why a special case: Restricted to nonnegative unknowns the declaration describes one member of the two-element set the passage writes down, and it says nothing about the negative member.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 62758bfaa41d · pair key 67dad85b57a8.
  34. Definition · supporting · Solution sets

    Partial

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

    For representing them, a parametrization is often useful, which consists of expressing the solutions in terms of some of the unknowns or auxiliary variables.

    Show in article · Read it in context on Wikipedia

    TauCeti.kernelBasis special case

    def TauCeti.kernelBasis {F : Type u} [Field F] [DecidableEq F] {m n : ℕ} : Matrix (Fin m) (Fin n) F → List (Fin n → F)

    TauCeti.LinearAlgebra.Matrix.Echelon.KernelBasis · lines 359–361

    Why a special case: The construction is given only for homogeneous linear systems over a field, where the passage speaks of the solution set of an arbitrary system, so it is this notion at special objects.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 83245ab.
    • Location key 31f0bbe0c33a · pair key 7246f18fbb7f.

    TauCeti.span_kernelBasis special case

    theorem TauCeti.span_kernelBasis {F : Type u} [Field F] [DecidableEq F] {m n : ℕ} (A : Matrix (Fin m) (Fin n) F) : Submodule.span F {v | v ∈ TauCeti.kernelBasis A} = A.mulVecLin.ker

    TauCeti.LinearAlgebra.Matrix.Echelon.KernelBasis · lines 396–398

    Why a special case: It states the parametrizing property for homogeneous linear systems only, which is narrower than the arbitrary systems the passage's definition covers.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 83245ab.
    • Location key cbf4d718f9f7 · pair key 5fa23b70031b.
  35. Theorem · supporting · Solution sets

    Partial

    Partial: TauCeti states a special case (proved).

    This is always possible when all the equations are linear.

    Show in article · Read it in context on Wikipedia

    TauCeti.span_kernelBasis special case

    theorem TauCeti.span_kernelBasis {F : Type u} [Field F] [DecidableEq F] {m n : ℕ} (A : Matrix (Fin m) (Fin n) F) : Submodule.span F {v | v ∈ TauCeti.kernelBasis A} = A.mulVecLin.ker

    TauCeti.LinearAlgebra.Matrix.Echelon.KernelBasis · lines 396–398

    Why a special case: It proves existence under the stronger hypothesis that the system is homogeneous, a case the passage's linear systems include, and it also fixes the coefficients in a field.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 83245ab.
    • Location key be6809df9ca0 · pair key 4370e887bbf1.
  36. Theorem · main statement · Methods of solution

    Not formalized
    But this also reflects that, in general, no such method can exist: some problems are known to be unsolvable by an algorithm, such as Hilbert's tenth problem, which was proved unsolvable in 1970.

    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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 4 candidates examined (receipt 7e622b8bce5f).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  37. Theorem · main statement · Methods of solution › Polynomial equations

    Partial

    Partial: ATLAS (atlas-lean) states a special case (wanted: stated as a goal, with no proof).

    Polynomial equations of degree up to four can be solved exactly using algebraic methods, of which the quadratic formula is the simplest example.

    Show in article · Read it in context on Wikipedia

    MathlibExt.Algebra.AbelRuffiniWanted.abel_ruffini special case

    theorem MathlibExt.Algebra.AbelRuffiniWanted.abel_ruffini (n : ℕ) : 1 ≤ n → ((∀ (p : ℚ[X]), p.natDegree = n → ∀ (x : ℂ), (Polynomial.aeval x) p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4)

    WantedExt.Algebra.AbelRuffiniWanted · line 72

    Why a special case: The theorem fixes the coefficients in the rationals and the roots in the complex numbers, where the passage names no coefficient field, so it is this claim at those objects; it also records the converse for higher degrees.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 64c2773.
    • Location key 291e9532ec4f · pair key 679a21175c14.

    quadratic_eq_zero_iff special case

    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 a special case: It covers the degree-two case alone, under the extra assumption that the discriminant is a square in the field, which the article's real equations with nonnegative discriminant satisfy.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 a24444354738 · pair key d65f2ad11c53.
  38. Theorem · supporting · Methods of solution › Polynomial equations

    Partial

    Partial: ATLAS (atlas-lean) states part of this (wanted: stated as a goal, with no proof).

    Polynomial equations with a degree of five or higher require in general numerical methods (see below) or special functions such as Bring radicals, although some specific cases may be solvable algebraically, for example 4x5 − x3 − 3 = 0 (by using the rational root theorem), and

    Show in article · Read it in context on Wikipedia

    MathlibExt.Algebra.AbelRuffiniWanted.abel_ruffini states part

    theorem MathlibExt.Algebra.AbelRuffiniWanted.abel_ruffini (n : ℕ) : 1 ≤ n → ((∀ (p : ℚ[X]), p.natDegree = n → ∀ (x : ℂ), (Polynomial.aeval x) p = 0 → x ∈ solvableByRad ℚ ℂ) ↔ n ≤ 4)

    WantedExt.Algebra.AbelRuffiniWanted · line 72

    Why only part: It states the general half of the passage, that from degree five on algebraic solution formulas cease to work, and is stated for rational coefficients; it says nothing about numerical methods, about Bring radicals, or about the particular quintic the passage exhibits.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 64c2773.
    • Location key 1d0220a022a2 · pair key 8e1b9f6c81f3.
  39. Theorem · supporting · Methods of solution › Polynomial equations

    Not formalized
    (by using the rational root theorem), and
    x6 − 5x3 + 6 = 0 , (by using the substitution x = z1⁄3, which simplifies this to a quadratic equation in z).

    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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt f1bb5c894afc).
    • 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).
  40. Definition · main statement · Methods of solution › Diophantine equations

    Not formalized
    In Diophantine equations the solutions are required to be integers.

    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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt cf1c53321f54).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  41. Theorem · supporting · Methods of solution › Diophantine equations

    Not formalized
    For example, the polynomial equation 2x5 − 5x4 − x3 − 7x2 + 2x + 3 = 0 has as rational solutions x = −⁠1/2⁠ and x = 3, and so, viewed as a Diophantine equation, it has the unique solution x = 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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 2cb879e5c9e3).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  42. Theorem · supporting · Methods of solution › Diophantine equations

    Not formalized
    has as rational solutions x = −⁠1/2⁠ and x = 3, and so, viewed as a Diophantine equation, it has the unique solution x = 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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt a3cceecf593b).
    • 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).
  43. Definition · main statement · Methods of solution › Inverse functions

    Formalized

    Formalized: Mathlib states this up to a convention difference (a definition).

    Given a function h : A → B, the inverse function, denoted h−1 and defined as h−1 : B → A, is a function such that h−1(h(x)) = h(h−1(x)) = x .

    Show in article · Read it in context on Wikipedia

    Equiv close match

    structure Equiv : Sort u_1 → Sort u_2 → Sort (max (max 1 u_1) u_2)

    Mathlib.Logic.Equiv.Defs · lines 65–75

    Why close, not exact: Mathlib packages the map, the inverse map and the two inverse laws into a single structure where the passage writes h and its inverse side by side.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 cdfc93629c51 · pair key 592f4a739961.

    Function.LeftInverse states part

    def Function.LeftInverse {α : Sort u_1} {β : Sort u_2} : (β → α) → (α → β) → Prop

    Init.Data.Function · lines 73–74

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

    Why only part: Function.LeftInverse g f says g (f x) = x for every x. That is the first of the passage's two defining equations, h^-1(h(x)) = x. It does not include the second, h(h^-1(x)) = x, which is Function.RightInverse. So it states one clause of the definition of an inverse function, not the whole definition.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 d412edabebfd · pair key 79c1cf9fdd98.
  44. Theorem · supporting · Methods of solution › Inverse functions

    Formalized

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

    Now, if we apply the inverse function to both sides of h(x) = c, where c is a constant value in B, we obtain h−1(h(x))= h−1(c)x= h−1(c) and we have found the solution to the equation.

    Show in article · Read it in context on Wikipedia

    Equiv.apply_eq_iff_eq_symm_apply more general

    theorem Equiv.apply_eq_iff_eq_symm_apply {α : Sort u} {β : Sort v} {x : α} {y : β} (f : α ≃ β) : f x = y ↔ x = f.symm y

    Deprecated at this commit, in favour of Equiv.eq_symm_apply.

    Mathlib.Logic.Equiv.Defs · lines 299–300

    Why more general: Lean states an equivalence between the two equations for a bundled map, where the passage draws the implication in one direction only.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 349c543f9ebf · pair key 897562f2104f.
  45. Theorem · supporting · Methods of solution › Inverse functions

    Formalized

    Formalized: Lean core states this up to a convention difference (proved).

    If just one solution will do, instead of the full solution set, it is actually sufficient if only the functional identity h(h−1(x)) = x holds.

    Show in article · Read it in context on Wikipedia

    Function.RightInverse.surjective close match

    theorem Function.RightInverse.surjective {α : Sort u_1} {β : Sort u_2} {f : α → β} {g : β → α} : Function.RightInverse g f → Function.Surjective f

    Init.Data.Function · lines 102–103

    Why close, not exact: Lean phrases the conclusion as surjectivity of h, which unfolds to the existence of a solution of the equation for each constant in B.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 55279934f674 · pair key 0f7dc515e703.

    Function.HasRightInverse.surjective more general

    theorem Function.HasRightInverse.surjective {α : Sort u_1} {β : Sort u_2} {f : α → β} : Function.HasRightInverse f → Function.Surjective f

    Init.Data.Function · lines 105–106

    Why more general: It takes the bare existence of a right inverse as its hypothesis and concludes that the map is onto.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 78f0bc539a40 · pair key 2a881e0994ac.
  46. Example · supporting · Methods of solution › Inverse functions

    Partial

    Partial: Mathlib states part of this (proved).

    For example, the projection π1 : R2 → R defined by π1(x, y) = x has no post-inverse, but it has a pre-inverse π−11 defined by π−11(x) = (x, 0).

    Show in article · Read it in context on Wikipedia

    AddMonoidHom.fst_comp_inl states part

    theorem AddMonoidHom.fst_comp_inl {M : Type*} {N : Type*} [AddZeroClass M] [AddZeroClass N] : (AddMonoidHom.fst M N).comp (AddMonoidHom.inl M N) = AddMonoidHom.id M

    Mathlib.Algebra.Group.Prod · line 379

    Why only part: Lean states the identity for bundled additive maps over any two types carrying a zero, with the right-hand map sending x to the pair whose second entry is zero.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 d21b3fbd7801 · pair key 27338d2bec7d.

    Lean.Omega.Prod.fst_mk states part

    theorem Lean.Omega.Prod.fst_mk {α : Type u_1} {x : α} {β : Type u_2} {y : β} : (x, y).fst = x

    Init.Omega.Int · line 225

    Why only part: It is stated for arbitrary types and an arbitrary second entry, of which the passage's section at zero is one reading.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 ad0bd0e8002b · pair key 618cd46c9608.
  47. Theorem · supporting · Methods of solution › Inverse functions

    Formalized

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

    Indeed, the equation π1(x, y) = c is solved by (x, y) = π−11(c) = (c, 0).

    Show in article · Read it in context on Wikipedia

    Lean.Omega.Prod.fst_mk more general

    theorem Lean.Omega.Prod.fst_mk {α : Type u_1} {x : α} {β : Type u_2} {y : β} : (x, y).fst = x

    Init.Omega.Int · line 225

    Why more general: Lean states the projection equation for pairs of arbitrary types, while the passage reads it for pairs of real numbers.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 a21fd613d763 · pair key 02397bf9f655.
  48. Example · supporting · Methods of solution › Inverse functions

    Partial

    Partial: Formal Conjectures states part of this (proved).

    Examples of inverse functions include the nth root (inverse of xn); the logarithm (inverse of ax); the inverse trigonometric functions; and Lambert's W function (inverse of xex).

    Show in article · Read it in context on Wikipedia

    Real.pow_nthRoot states part

    theorem Real.pow_nthRoot {n : ℕ} (r : ℝ) : n ≠ 0 ∧ 0 ≤ r ∨ Odd n → Real.nthRoot n r ^ n = r

    FormalConjecturesForMathlib.Analysis.SpecialFunctions.NthRoot · lines 79–88

    Why only part: This gives one of the two identities that make the root an inverse of the power map; the hypothesis restricts to nonnegative arguments unless n is odd.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 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-b1b, 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 1a986043f45d · pair key 21e689d13e77.

    Real.nthRoot_pow states part

    theorem Real.nthRoot_pow {n : ℕ} (r : ℝ) : n ≠ 0 ∧ 0 ≤ r ∨ Odd n → Real.nthRoot n (r ^ n) = r

    FormalConjecturesForMathlib.Analysis.SpecialFunctions.NthRoot · lines 90–99

    Why only part: This gives the other of the two identities, under the same restriction on the argument or on the parity of n.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 20b25450c9d1 · pair key 10cbc621dce9.

    Real.rpow_inv_natCast_pow states part

    theorem Real.rpow_inv_natCast_pow {x : ℝ} {n : ℕ} : 0 ≤ x → n ≠ 0 → (x ^ (↑n)⁻¹) ^ n = x

    Mathlib.Analysis.SpecialFunctions.Pow.Real · lines 513–515

    Why only part: Here the n-th root is spelled as the real exponent one over n rather than as a named root function.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 546a8efe5f07 · pair key ebb2cff1bb30.

    Real.pow_rpow_inv_natCast states part

    theorem Real.pow_rpow_inv_natCast {x : ℝ} {n : ℕ} : 0 ≤ x → n ≠ 0 → (x ^ n) ^ (↑n)⁻¹ = x

    Mathlib.Analysis.SpecialFunctions.Pow.Real · lines 509–511

    Why only part: Same encoding of the root as a real exponent, giving the left-inverse identity.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 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-b1b, 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 d872328ed82c · pair key 8696186f3b60.
  49. Example · supporting · Methods of solution › Inverse functions

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    Examples of inverse functions include the nth root (inverse of xn); the logarithm (inverse of ax); the inverse trigonometric functions; and Lambert's W function (inverse of xex).

    Show in article · Read it in context on Wikipedia

    Real.logb_eq_iff_rpow_eq close match

    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 close, not exact: Lean writes the inverse relation as a pointwise equivalence between the base-a logarithm of y being x and a raised to x being y, for a positive base other than one and positive y.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 09934ba1794c · pair key f31f8abebc94.

    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

    Why only part: One of the two composition identities only.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 dbf8c856eb01 · pair key 1a0e4c83c12b.

    Real.rpow_logb states part

    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 only part: The other composition identity, on the positive reals.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 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-b1b, 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 78161300f510 · pair key faa8b6ddc4cf.
  50. Example · supporting · Methods of solution › Inverse functions

    Partial

    Partial: Mathlib states a special case (proved).

    Examples of inverse functions include the nth root (inverse of xn); the logarithm (inverse of ax); the inverse trigonometric functions; and Lambert's W function (inverse of xex).

    Show in article · Read it in context on Wikipedia

    Real.arcsin_eq_iff_eq_sin special case

    theorem Real.arcsin_eq_iff_eq_sin {x y : ℝ} : y ∈ Set.Ioo (-(π / 2)) (π / 2) → (Real.arcsin x = y ↔ x = Real.sin y)

    Mathlib.Analysis.SpecialFunctions.Trigonometric.Inverse · lines 174–177

    Why a special case: This is the passage read at one member of the family, the sine and its inverse.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 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-b1b, 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 72c3d905b167 · pair key 7131c19ca5f3.

    Real.tan_arctan states part

    theorem Real.tan_arctan (x : ℝ) : Real.tan (Real.arctan x) = x

    Mathlib.Analysis.SpecialFunctions.Trigonometric.Arctan · lines 123–124

    Why only part: One composition identity for one member of the family.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 b16cc2dcebc4 · pair key 8587c352379c.

    Real.arctan_tan states part

    theorem Real.arctan_tan {x : ℝ} : -(π / 2) < x → x < π / 2 → Real.arctan (Real.tan x) = x

    Mathlib.Analysis.SpecialFunctions.Trigonometric.Arctan · lines 133–134

    Why only part: The other composition identity for the tangent.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 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-b1b, 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 452f6e3bc15a · pair key 3a9d9663d6a2.

    Real.cos_arccos states part

    theorem Real.cos_arccos {x : ℝ} : -1 ≤ x → x ≤ 1 → Real.cos (Real.arccos x) = x

    Mathlib.Analysis.SpecialFunctions.Trigonometric.Inverse · lines 294–295

    Why only part: One composition identity for the cosine.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 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-b1b, 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 d53fc2bde2fd · pair key cc375bb64567.

    Real.arccos_cos states part

    theorem Real.arccos_cos {x : ℝ} : 0 ≤ x → x ≤ π → Real.arccos (Real.cos x) = x

    Mathlib.Analysis.SpecialFunctions.Trigonometric.Inverse · lines 297–298

    Why only part: The other composition identity for the cosine.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 5 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-b1b, 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 51beec82ae8e · pair key a7df4822a6ab.
  51. Example · supporting · Methods of solution › Inverse functions

    Not formalized
    Examples of inverse functions include the nth root (inverse of xn); the logarithm (inverse of ax); the inverse trigonometric functions; and Lambert's W function (inverse of xex).

    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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt a57576f8b54e).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  52. Theorem · main statement · Methods of solution › Factorization

    Formalized

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

    If the left-hand side expression of an equation P = 0 can be factorized as P = QR, the solution set of the original solution consists of the union of the solution sets of the two equations Q = 0 and R = 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 states the fact one value at a time, as an equivalence between the product vanishing and one of the two factors vanishing, where the passage packages it as an equality of solution sets.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 169c3c3fd592 · pair key e2d718bd0695.
  53. Example · supporting · Methods of solution › Factorization

    Not formalized
    For example, the equation tan x + cot x = 2 can be rewritten, using the identity tan x cot x = 1 as tan2 x − 2tan x + 1tan x = 0, which can be factorized into (tan x − 1)2tan x = 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–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 6cab4e8dbd8b).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  54. Theorem · supporting · Methods of solution › Factorization

    Partial

    Partial: Mathlib states part of this (proved).

    The solutions are thus the solutions of the equation tan x = 1, and are thus the set x = π4 + kπ,  k = 0, ±1, ±2, ….

    Show in article · Read it in context on Wikipedia

    Real.tan_pi_div_four states part

    theorem Real.tan_pi_div_four : Real.tan (π / 4) = 1

    Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic · lines 893–896

    Why only part: It is the conjunct at the single index zero, with no statement about the other indices or about exhaustiveness.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b 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-b1b, 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 0bb5c69e0323 · pair key 868a92045076.

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