WikiLean · Articles Articles Brain Contribute About

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

Sign (mathematics)

83 passages47 formalized22 partial14 not formalized

Statement only

More ways to filter
Library
About this page

This page

  • Wikipedia revision 1373168233, pinned: the text here is that revision, not today's article.
  • WikiProject Mathematics: C-class, High importance
  • 83 passages checked, 124 Lean locations (and 28 related declarations).

Central statements: 49 of the 83 passages state the article's subject or a named result or definition; the other 34 are supporting (examples, setup). Of these 49: 33 formalized, 10 partial, 6 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 (82 locations and 6 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): 25 of 42 locations and 1 of 8 absences. In all, 107 of 124 Lean locations (86%) and 7 of 14 absences (50%) were re-checked.
  • Passage text: 83 of 83 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 1373168233 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

    Formalized

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

    In mathematics, the sign of a real number is its property of being either positive, negative, or 0.

    Show in article · Read it in context on Wikipedia

    Real.sign close match

    def Real.sign : ℝ → ℝ

    Mathlib.Basic.Real.Sign · lines 34–35

    Why close, not exact: Mathlib returns the three signs as the real values -1, 0 and 1 rather than as a bare three-way attribute.

    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 d3e5d61b37d9 · pair key 72573f418702.

    SignType.sign more general

    def SignType.sign {α : Type*} [Zero α] [Preorder α] [DecidableLT α] : α →o SignType

    Mathlib.Basic.Sign.Defs · lines 265–271

    Why more general: Mathlib defines this map for any type with a zero, an order and decidable comparison, and bundles it as a monotone map into the type of signs.

    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 e4eb35f05cf3 · pair key 007ea6dced1e.

    Int.sign special case

    def Int.sign : Int → Int

    Init.Data.Int.Basic · lines 351–354

    Why a special case: Lean states this for integer inputs only and returns the attribute as an integer.

    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.
    • 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 2801331dcd85 · pair key 0079c959f509.
  2. Definition · main statement

    Formalized

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

    In mathematics and physics, the phrase "change of sign" is associated with exchanging an object for its additive inverse (multiplication with −1, negation), an operation which is not restricted to real numbers.

    Show in article · Read it in context on Wikipedia

    neg_add_cancel states part

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

    Mathlib.Algebra.Group.Defs · line 53

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

    Why only part: neg_add_cancel is a theorem, not a definition of change of sign: in any additive group it states that -a + a = 0, so the unary minus gives the additive inverse, and it is not limited to the reals. That covers the passage's identification of negation with the additive inverse, but it does not define the operation the passage names.

    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 214488d0e8a9 · pair key 278b94fce09e.

    Neg more general

    class Neg : Type u → Type u

    Init.Prelude · lines 1662–1665

    Why more general: Lean's notation class for the unary minus, available on any type that provides one, which is why the operation is not tied to the reals.

    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 73f8ba6265ec · pair key 748769f79401.
  3. Theorem · supporting

    Formalized

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

    It applies among other objects to vectors, matrices, and complex numbers, which are not prescribed to be only either positive, negative, or zero.

    Show in article · Read it in context on Wikipedia

    Pi.instNeg more general

    instance Pi.instNeg {ι : Type*} {G : ι → Type*} [(i : ι) → Neg (G i)] : Neg ((i : ι) → G i)

    Mathlib.Algebra.Notation.Pi.Defs · line 87

    Why more general: Mathlib negates an indexed family of values coordinate by coordinate, with no ordering or positivity asked of the entries.

    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 15533a7b7450 · pair key b702a1826f28.
  4. Theorem · supporting

    Formalized

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

    It applies among other objects to vectors, matrices, and complex numbers, which are not prescribed to be only either positive, negative, or zero.

    Show in article · Read it in context on Wikipedia

    Matrix.neg more general

    instance Matrix.neg {m : Type*} {n : Type*} {α : Type v} [Neg α] : Neg (Matrix m n α)

    Mathlib.LinearAlgebra.Matrix.Defs · lines 214–215

    Why more general: Mathlib negates a matrix entry by entry for any entry type with a negation, with no sign attribute asked of the matrix.

    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 20ed5307f4c1 · pair key d75105f28baa.
  5. Theorem · supporting

    Formalized

    Formalized: Mathlib states this exactly (a definition).

    It applies among other objects to vectors, matrices, and complex numbers, which are not prescribed to be only either positive, negative, or zero.

    Show in article · Read it in context on Wikipedia

    Complex.instNeg exact match

    instance Complex.instNeg : Neg ℂ

    Mathlib.Basic.Complex.Basic · lines 181–182

    Note: Mathlib defines the negation on the whole of ℂ, asking of its argument neither a sign nor an order.

    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 763cf090ccc2 · pair key 00b08506c240.

    Complex.addCommGroup more general

    instance Complex.addCommGroup : AddCommGroup ℂ

    Mathlib.Basic.Complex.Basic · lines 326–336

    Why more general: It asserts the whole additive group structure of ℂ, of which the negation the passage names is one piece.

    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 3dfb8e2.
    • Location key 9e71c3e2f77f · pair key d2995d906ea0.
  6. Theorem · main statement · Sign of a number

    Formalized

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

    A number system that bears the structure of an ordered ring contains a unique number that when added with any number leaves the latter unchanged.

    Show in article · Read it in context on Wikipedia

    add_eq_left more general

    theorem add_eq_left {M : Type*} [AddMonoid M] [IsLeftCancelAdd M] {a b : M} : a + b = a ↔ b = 0

    Mathlib.Algebra.Group.Basic · line 238

    Why more general: Mathlib states it for any additive monoid whose addition cancels on the left, which covers the ordered rings 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, 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 6322c1a657f6 · pair key a02cfd7a80d5.

    add_zero states part

    theorem add_zero {M : Type*} [AddZeroClass M] (a : M) : a + 0 = a

    Mathlib.Algebra.Group.Monoid · line 94

    Why only part: Mathlib states the neutrality of zero on the right for any type carrying an addition with a zero.

    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 0151338e95fc · pair key 4824d7cbf881.
  7. Definition · supporting · Sign of a number

    Formalized

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

    This unique number is known as the system's additive identity element.

    Show in article · Read it in context on Wikipedia

    AddZeroClass more general

    class AddZeroClass : Type u_2 → Type u_2

    Mathlib.Algebra.Group.Monoid · lines 65–69

    Why more general: Mathlib packages the identity element together with the two laws that pin it down as one structure on the type.

    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, 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 ae1f8df040c3 · pair key cc5880ab426d.
  8. Example · supporting · Sign of a number

    Formalized

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

    For example, the integers has the structure of an ordered ring.

    Show in article · Read it in context on Wikipedia

    Int.instIsStrictOrderedRing more general

    instance Int.instIsStrictOrderedRing : IsStrictOrderedRing ℤ

    Mathlib.Algebra.Order.Ring.Int · line 42

    Why more general: Mathlib records for ℤ the sharper form of the order axioms, from which the ordered ring instance on ℤ follows.

    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 e5ef25d17a39 · pair key ed8a27207799.
  9. Notation · supporting · Sign of a number

    Formalized

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

    This number is generally denoted as 0.

    Show in article · Read it in context on Wikipedia

    AddZeroClass more general

    class AddZeroClass : Type u_2 → Type u_2

    Mathlib.Algebra.Group.Monoid · lines 65–69

    Why more general: Mathlib writes the two-sided identity law with the literal symbol 0 for any type that carries an addition.

    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 632d11e94d7c · pair key d1ec931ea96d.
  10. Definition · main statement · Sign of a number

    Partial

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

    Because of the total order in this ring, there are numbers greater than zero, called the positive numbers.

    Show in article · Read it in context on Wikipedia

    Set.Ioi states part

    def Set.Ioi {α : Type*} [Preorder α] : α → Set α

    Mathlib.Order.Interval.Set.Defs · line 37

    Why only part: Mathlib names the open upper interval for any preorder and any endpoint, which at 0 is the set of positive elements.

    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 71400e22bd22 · pair key fc23317d1472.
  11. Theorem · main statement · Sign of a number

    Partial

    Partial: Mathlib states part of this (proved).

    Another property required for a ring to be ordered is that, for each positive number, there exists a unique corresponding number less than 0 whose sum with the original positive number is 0.

    Show in article · Read it in context on Wikipedia

    add_eq_zero_iff_eq_neg' states part

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

    Mathlib.Algebra.Group.Basic · line 655

    Why only part: Mathlib states the pairing as an equivalence with the negation, over any additive group.

    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 40619e3edfae · pair key 0b653bf391f7.

    add_neg_cancel states part

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

    Mathlib.Algebra.Group.Defs · line 61

    Why only part: It supplies the partner summing to 0 while leaving the order position of that partner open.

    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 524db16a0a91 · pair key 97b34e8fec5a.

    neg_neg_iff_pos states part

    theorem neg_neg_iff_pos {α : Type u} [AddGroup α] [LT α] [AddLeftStrictMono α] {a : α} : -a < 0 ↔ 0 < a

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

    Why only part: It settles where the negation sits in the order, with the summing identity coming from elsewhere.

    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 52fc62f0677a · pair key 6a69b1a9ef32.
  12. Definition · main statement · Sign of a number

    Formalized

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

    These numbers less than 0 are called the negative numbers.

    Show in article · Read it in context on Wikipedia

    Set.Iio more general

    def Set.Iio {α : Type*} [Preorder α] : α → Set α

    Mathlib.Order.Interval.Set.Defs · line 38

    Why more general: Mathlib names the open lower interval for any preorder and any endpoint, and at 0 this is the collection the passage names.

    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 176ca59ce482 · pair key a0d3c79d6a84.
  13. Definition · supporting · Sign of a number

    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.

    The numbers in each such pair are their respective additive inverses.

    Show in article · Read it in context on Wikipedia

    add_eq_zero_iff_eq_neg' more general

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

    Mathlib.Algebra.Group.Basic · line 655

    Why more general: Mathlib records the pairing through its negation operation, over any additive group rather than over numbers alone.

    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 7b292871862b · pair key 3065070ba172.
  14. Definition · main statement · Sign of a number

    Formalized

    Formalized by 2 parts together (more general):

    1. SignType.sign Mathlib (definition)
      • the trichotomy attribute of being zero, positive or negative is named the sign of the number
    2. SignType.cast Mathlib (definition)
      • that attribute is encoded by the reals 0 for zero, 1 for positive and -1 for negative
    This attribute of a number, being exclusively either zero (0), positive (+), or negative (−), is called its sign, and is often encoded to the real numbers 0, 1, and −1, respectively (similar to the way the sign function is defined).[1]

    Show in article · Read it in context on Wikipedia

    SignType.sign states part

    def SignType.sign {α : Type*} [Zero α] [Preorder α] [DecidableLT α] : α →o SignType

    Mathlib.Basic.Sign.Defs · lines 265–271

    Why only part: Mathlib defines this attribute for any type with a zero and an order and takes its values in a dedicated three-element type.

    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 978ff8e87fb4 · pair key 5dc7a9382da0.

    SignType.cast states part

    def SignType.cast {α : Type*} [Zero α] [One α] [Neg α] : SignType → α

    Mathlib.Basic.Sign.Defs · lines 210–213

    Why only part: Mathlib writes the encoding as a coercion into any type with a zero, a one and a negation.

    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 57004a6f0b2b · pair key b58ddc22311b.

    Real.sign special case

    def Real.sign : ℝ → ℝ

    Mathlib.Basic.Real.Sign · lines 34–35

    Why a special case: It fixes the ordered ring to be the reals, where the encoding and the naming coincide in one declaration.

    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 b0e2774fd07e · pair key 3e372c87d4f8.
  15. Theorem · main statement · Sign of a number

    Partial

    Partial: Mathlib states part of this (proved).

    Since rational and real numbers are also ordered rings (in fact ordered fields), the sign attribute also applies to these number systems.

    Show in article · Read it in context on Wikipedia

    Rat.instIsStrictOrderedRing states part

    instance Rat.instIsStrictOrderedRing : IsStrictOrderedRing ℚ

    Mathlib.Algebra.Order.Ring.Rat · lines 34–35

    Why only part: Mathlib splits the ordered field of ℚ into separate instances on the same type, this one carrying the order compatibility alongside ℚ's field and linear order instances.

    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 adf4fd74dfdd · pair key 63989b113302.

    Real.instIsStrictOrderedRing states part

    instance Real.instIsStrictOrderedRing : IsStrictOrderedRing ℝ

    Mathlib.Basic.Real.Basic · lines 359–363

    Why only part: Mathlib splits the ordered field of ℝ into separate instances on the same type, this one carrying the order compatibility alongside ℝ's field and linear order instances.

    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 67c16eeeace3 · pair key 85d4611f21f5.
  16. Theorem · supporting · Sign of a number

    Formalized

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

    Since rational and real numbers are also ordered rings (in fact ordered fields), the sign attribute also applies to these number systems.

    Show in article · Read it in context on Wikipedia

    SignType.sign more general

    def SignType.sign {α : Type*} [Zero α] [Preorder α] [DecidableLT α] : α →o SignType

    Mathlib.Basic.Sign.Defs · lines 265–271

    Why more general: Mathlib defines the sign attribute once for every type with a zero and an order, so the two number systems of the passage are instances of 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, 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 199ee684e4cd · pair key 111e405cde5a.

    Real.sign special case

    def Real.sign : ℝ → ℝ

    Mathlib.Basic.Real.Sign · lines 34–35

    Why a special case: It covers the real half of the passage's claim, with the rationals handled by the general definition.

    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 3dfb8e2.
    • Location key f4679ed40647 · pair key 7891b61bcc3a.
  17. Notation · main statement · Sign of a number

    Formalized

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

    When a minus sign is used in between two numbers, it represents the binary operation of subtraction.

    Show in article · Read it in context on Wikipedia

    Sub more general

    class Sub : Type u → Type u

    Init.Prelude · lines 1649–1651

    Why more general: Lean hangs the infix minus on this class for any carrier type, so it reaches the article's numbers and much else.

    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 3afddb7331b5 · pair key 4051e2b0609e.

    HSub more general

    class HSub : Type u → Type v → outParam (Type w) → Type (max (max u v) w)

    Init.Prelude · lines 1495–1499

    Why more general: This is the mixed-type form of the same notation: the two operands may live in different types and the result in a third.

    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 af6c6f885e52 · pair key 6e74ea0d24af.

    Int.sub special case

    def Int.sub : Int → Int → Int

    Init.Data.Int.Basic · line 209

    Why a special case: This is the operation the article's notation denotes for one of its number systems, the integers.

    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.
    • 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 c0800e60e686 · pair key 656fde92da84.
  18. Notation · main statement · Sign of a number

    Partial

    Partial: Mathlib states part of this (proved).

    When a minus sign is written before a single number, it represents the unary operation of yielding the additive inverse (sometimes called negation) of the operand.

    Show in article · Read it in context on Wikipedia

    neg_add_cancel states part

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

    Mathlib.Algebra.Group.Defs · line 53

    Why only part: This pins the sense of the prefix minus as the inverse under addition; the notation itself belongs to the Neg class.

    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 8b55a4c5315d · pair key 47892e6fdf9f.

    Int.neg special case

    def Int.neg : Int → Int

    Init.Data.Int.Basic · lines 120–123

    Why a special case: This is the unary operation the article's notation denotes for one of its number systems, the integers.

    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 314180d41566 · pair key 697a6d02b18d.
  19. Theorem · main statement · Sign of a number

    Formalized

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

    Abstractly then, the difference of two number is the sum of the minuend with the additive inverse of the subtrahend.

    Show in article · Read it in context on Wikipedia

    sub_eq_add_neg more general

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

    Mathlib.Algebra.Group.DivInvMonoid · line 240

    Why more general: Lean states the identity for any carrier equipped with addition, negation and subtraction, the article's numbers among 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 c64297fc5f4e · pair key c823a6f3b8a2.

    Int.sub_eq_add_neg special case

    theorem Int.sub_eq_add_neg {a b : Int} : a - b = a + -b

    Init.Data.Int.Lemmas · line 103

    Why a special case: This is the article's identity for one of its number systems rather than for numbers at large.

    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 9e347b492fe6 · pair key 4a8f1ebed495.
  20. Theorem · main statement · Sign of a number

    Formalized

    Formalized by 3 parts together (more general):

    1. neg_zero Mathlib (proved)
      • zero is its own additive inverse: -0 = 0
    2. neg_lt_zero Mathlib (proved)
      • the additive inverse of a positive number is a negative number
    3. neg_pos Mathlib (proved)
      • the additive inverse of a negative number is a positive number
    While 0 is its own additive inverse (−0 = 0), the additive inverse of a positive number is negative, and the additive inverse of a negative number is positive.

    Show in article · Read it in context on Wikipedia

    neg_zero states part

    theorem neg_zero {G : Type*} [NegZeroClass G] : -0 = 0

    Mathlib.Algebra.Group.DivInvMonoid · line 297

    Why only part: Lean states the equation for any carrier with a zero and a negation that fix each other, the article's numbers included.

    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 cedaa91d84a5 · pair key c10266f45680.

    neg_lt_zero states part

    theorem neg_lt_zero {α : Type u} [AddGroup α] [LT α] [AddLeftStrictMono α] {a : α} : -a < 0 ↔ 0 < a

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

    Why only part: Lean states the two implications at once where the article reads only the one from positive input to negative output.

    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 b2581d063c98 · pair key a6fe1be6b843.

    neg_pos states part

    theorem neg_pos {α : Type u} [AddGroup α] [LT α] [AddLeftStrictMono α] {a : α} : 0 < -a ↔ a < 0

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

    Why only part: Lean states the two implications at once where the article reads only the one from negative input to positive output.

    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 f3ccedbbc5a0 · pair key 0f806257ac0e.
  21. Example · supporting · Sign of a number

    Formalized

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

    A double application of this operation is written as −(−3) = 3.

    Show in article · Read it in context on Wikipedia

    neg_neg more general

    theorem neg_neg {G : Type*} [InvolutiveNeg G] (a : G) : - -a = a

    Mathlib.Algebra.Group.DivInvMonoid · line 51

    Why more general: Lean states double negation for any carrier whose minus undoes itself, which the article's numbers do.

    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 4e710755d6c5 · pair key 84b4add6032f.

    Int.neg_neg more general

    theorem Int.neg_neg (a : Int) : - -a = a

    Init.Data.Int.Lemmas · lines 91–94

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

    Why more general: Int.neg_neg states that negating an integer twice gives the integer back, for every integer. The passage's example, that -(-3) equals 3, is the case of 3, so the example is an instance of this theorem.

    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 aeb4166b772f · pair key daa975734361.
  22. Notation · supporting · Sign of a number

    Partial

    Partial: Lean core states part of this (a definition).

    The plus sign is predominantly used in algebra to denote the binary operation of addition, and only rarely to emphasize the positivity of an expression.

    Show in article · Read it in context on Wikipedia

    Add states part

    class Add : Type u → Type u

    Init.Prelude · lines 1644–1646

    Why only part: The class carries the plus notation for addition; how rarely writers put a plus in front of an expression to mark it positive is a remark on usage that no declaration carries.

    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 c0dd126ac3b1 · pair key b3fff5f81d5c.

    HAdd states part

    class HAdd : Type u → Type v → outParam (Type w) → Type (max (max u v) w)

    Init.Prelude · lines 1486–1489

    Why only part: This is the mixed-type form of the plus notation; the remark about marking an expression positive is again usage, not a statement.

    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 fdf887ee8e8e · pair key 0a2f3594c07e.
  23. Notation · main statement · Sign of a number

    Not formalized
    In common numeral notation (used in arithmetic and elsewhere), the sign of a number is often made explicit by placing a plus or a minus sign before the number.

    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 1e8ddb3035b2).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  24. Notation · supporting · Sign of a number

    Not formalized
    For example, +3 denotes "positive three", and −3 denotes "negative three" (algebraically: the additive inverse of 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 e9b8ed59ffa5).
    • 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. Notation · supporting · Sign of a number

    Partial

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

    For example, +3 denotes "positive three", and −3 denotes "negative three" (algebraically: the additive inverse of 3).

    Show in article · Read it in context on Wikipedia

    Int.add_left_neg more general

    theorem Int.add_left_neg (a : Int) : -a + a = 0

    Init.Data.Int.Lemmas · lines 246–249

    Why more general: The library reads the article's unary minus as negation on the integers, where the numeral three lives.

    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 ecbe9b9917e3 · pair key 37ca337d710e.

    neg_add_cancel more general

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

    Mathlib.Algebra.Group.Defs · line 53

    Why more general: Stated for an arbitrary additive group rather than for the numerals of ordinary arithmetic.

    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 9c1826c65fe3 · pair key 8c118a0521c4.
  26. Notation · supporting · Sign of a number

    Partial

    Partial: Mathlib states a special case (proved).

    Without specific context (or when no explicit sign is given), a number is interpreted per default as positive.

    Show in article · Read it in context on Wikipedia

    Nat.ofNat_pos special case

    theorem Nat.ofNat_pos {α : Type*} [Semiring α] [PartialOrder α] [IsOrderedRing α] [Nontrivial α] {n : ℕ} [n.AtLeastTwo] : 0 < OfNat.ofNat n

    Mathlib.Data.Nat.Cast.Order.Ring · lines 65–68

    Why a special case: The declaration covers written numerals from two upwards, so it is the article's default reading at those numerals.

    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 ca195866c839 · pair key 6774287ccc2f.
  27. Definition · main statement · Sign of a number › Sign of zero

    Partial

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

    Within the convention of zero being neither positive nor negative, a specific sign-value 0 may be assigned to the number value 0.

    Show in article · Read it in context on Wikipedia

    Real.sign_zero exact match

    theorem Real.sign_zero : Real.sign 0 = 0

    Mathlib.Basic.Real.Sign · lines 43–44

    Note: The real sign function sends zero to zero, as the convention in the passage prescribes.

    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 2e00dc2b0c21 · pair key bdbf2728b2f0.

    sign_zero more general

    theorem sign_zero {α : Type*} [Zero α] [Preorder α] [DecidableLT α] : SignType.sign 0 = 0

    Mathlib.Basic.Sign.Defs · line 277

    Why more general: Sign values here live in the three-element sign type rather than among the numbers themselves.

    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 dead301297c1 · pair key 4ffd5f474da4.

    Int.sign_zero special case

    theorem Int.sign_zero : Int.sign 0 = 0

    Init.Data.Int.Order · line 1292

    Why a special case: The same assignment restricted to the integers.

    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 c8517174deb4 · pair key 2e313e9368de.
  28. Notation · main statement · Sign of a number › Sign of zero

    Partial

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

    In arithmetic, +0 and −0 both denote the same number 0.

    Show in article · Read it in context on Wikipedia

    neg_zero more general

    theorem neg_zero {G : Type*} [NegZeroClass G] : -0 = 0

    Mathlib.Algebra.Group.DivInvMonoid · line 297

    Why more general: Lean writes the bare numeral where the article writes a leading plus, and the equation handles the minus form.

    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 3bba69265f89 · pair key 08f827ead3d9.

    Int.neg_zero special case

    theorem Int.neg_zero : -0 = 0

    Init.Data.Int.Lemmas · line 26

    Why a special case: The identification read at the integers.

    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 da246ca77a87 · pair key e000c535d310.
  29. Notation · supporting · Sign of a number › Sign of zero

    Partial

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

    The symbols +0 and −0 rarely appear as substitutes for 0+ and 0−, used in calculus and mathematical analysis for one-sided limits (right-sided limit and left-sided limit, respectively).

    Show in article · Read it in context on Wikipedia

    Function.rightLim states part

    def Function.rightLim {α : Type*} {β : Type*} [LinearOrder α] [TopologicalSpace β] : (α → β) → α → β

    Mathlib.Topology.Order.LeftRightLim · line 50

    Why only part: The library names the right-hand limit of a function at a point of a linearly ordered domain.

    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 2728cc05214a · pair key a562cfbde09e.

    Function.leftLim states part

    def Function.leftLim {α : Type*} {β : Type*} [LinearOrder α] [TopologicalSpace β] : (α → β) → α → β

    Mathlib.Topology.Order.LeftRightLim · lines 54–58

    Why only part: The library names the left-hand limit of a function at a point of a linearly ordered domain.

    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 0cda58be7201 · pair key 179db1a7e9d5.
  30. Definition · supporting · Sign of a number › Sign of zero

    Partial

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

    This notation refers to the behaviour of a function as its real input variable approaches 0 along positive (resp., negative) values; the two limits need not exist or agree.

    Show in article · Read it in context on Wikipedia

    Function.rightLim states part

    def Function.rightLim {α : Type*} {β : Type*} [LinearOrder α] [TopologicalSpace β] : (α → β) → α → β

    Mathlib.Topology.Order.LeftRightLim · line 50

    Why only part: Its definition uses the order topology on the domain, so approach is through values above the point.

    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 14c342c5c93f · pair key 88f089df5076.

    Function.leftLim states part

    def Function.leftLim {α : Type*} {β : Type*} [LinearOrder α] [TopologicalSpace β] : (α → β) → α → β

    Mathlib.Topology.Order.LeftRightLim · lines 54–58

    Why only part: Its definition uses the order topology on the domain, so approach is through values below the point.

    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 344783522b0d · pair key 7f0e549d3b1f.
  31. Theorem · supporting · Sign of a number › Sign of zero

    Not formalized
    This notation refers to the behaviour of a function as its real input variable approaches 0 along positive (resp., negative) values; the two limits need not exist or agree.

    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 943ede357687).
    • 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).
  32. Definition · main statement · Sign of a number › Terminology for signs

    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.

    When 0 is said to be neither positive nor negative, the following phrases may refer to the sign of a number:
    A number is positive if it is greater than zero.

    Show in article · Read it in context on Wikipedia

    sign_eq_one_iff more general

    theorem sign_eq_one_iff {α : Type*} [Zero α] [Preorder α] [DecidableLT α] {a : α} : SignType.sign a = 1 ↔ 0 < a

    Mathlib.Basic.Sign.Defs · lines 286–290

    Why more general: The library writes the plus sign as the value one of the sign type, the encoding the article itself describes.

    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 452833549677 · pair key c19236172eba.

    Int.sign_eq_one_iff_pos special case

    theorem Int.sign_eq_one_iff_pos {a : Int} : a.sign = 1 ↔ 0 < a

    Init.Data.Int.Order · lines 1344–1345

    Why a special case: The same criterion for integers, with the plus sign written as the number one.

    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 d149794ca6dd · pair key 3ef87c24e003.
  33. Definition · main statement · Sign of a number › Terminology for signs

    Formalized

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

    A number is negative if it is less than zero.

    Show in article · Read it in context on Wikipedia

    Set.Iio more general

    def Set.Iio {α : Type*} [Preorder α] : α → Set α

    Mathlib.Order.Interval.Set.Defs · line 38

    Why more general: The library leaves the bound a parameter instead of fixing zero, and it records the numbers below it as a set rather than as an adjective applied to one number.

    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 523975ddf032 · pair key 6239a66bd798.
  34. Definition · main statement · Sign of a number › Terminology for signs

    Formalized

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

    A number is non-negative if it is greater than or equal to zero.

    Show in article · Read it in context on Wikipedia

    Nonneg more general

    abbrev Nonneg (α : Type u_2) [Zero α] [LE α] : Type (max 0 u_2)

    Mathlib.Algebra.Order.Nonneg.Basic · line 47

    Why more general: The library packages the condition as the subtype of elements satisfying it and states it for any type with a zero and an order, reaching well beyond the numbers the article discusses.

    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 f71d83bdb014 · pair key 898f7ff6d6ac.

    Set.Ici more general

    def Set.Ici {α : Type*} [Preorder α] : α → Set α

    Mathlib.Order.Interval.Set.Defs · line 44

    Why more general: The bound stays a parameter in the library, so zero is one instance of it, and the elements are collected as a set rather than described by an adjective.

    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 4a9efb5160c2 · pair key b9b6f60a78c1.

    NNReal special case

    def NNReal : Type

    Mathlib.Basic.NNReal.Defs · line 60

    Why a special case: The declaration covers only the reals, where the passage speaks of numbers in any ordered ring, and it bundles the condition into a type of its own.

    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 e0c14f3de3b8 · pair key 0f17dd242931.

    Int.NonNeg special case

    inductive Int.NonNeg : Int → Prop

    Init.Data.Int.Basic · lines 217–221

    Why a special case: Core phrases the condition as being equal to a natural number, the same notion in another encoding, and it is stated for the integers alone.

    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.
    • 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 7e2b0bca3e5f · pair key ef3486121586.
  35. Definition · main statement · Sign of a number › Terminology for signs

    Formalized

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

    A number is non-positive if it is less than or equal to zero.

    Show in article · Read it in context on Wikipedia

    Set.Iic more general

    def Set.Iic {α : Type*} [Preorder α] : α → Set α

    Mathlib.Order.Interval.Set.Defs · line 45

    Why more general: The bound is a parameter of the library definition rather than fixed at zero, and the numbers meeting the condition are gathered as a set.

    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 9659f0dc6cf8 · pair key c47cf83a0941.
  36. Definition · main statement · Sign of a number › Terminology for signs

    Formalized

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

    When 0 is said to be both positive and negative,[2][verification needed] modified phrases are used to refer to the sign of a number:
    A number is strictly positive if it is greater than zero.

    Show in article · Read it in context on Wikipedia

    Set.Ioi more general

    def Set.Ioi {α : Type*} [Preorder α] : α → Set α

    Mathlib.Order.Interval.Set.Defs · line 37

    Why more general: The library keeps the bound general instead of fixing zero, and collects the numbers above it as a set rather than naming an adjective for one number.

    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 02cc2c4bdfbf · pair key 257a43783c0d.

    PNat special case

    def PNat : Type

    Mathlib.Data.PNat.Notation · line 17

    Why a special case: The declaration covers the naturals alone, where the passage speaks of numbers generally, and it bundles the condition into a type.

    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 c57fd72f868f · pair key 3c4ae09fd72f.
  37. Definition · main statement · Sign of a number › Terminology for signs

    Formalized

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

    A number is strictly negative if it is less than zero.

    Show in article · Read it in context on Wikipedia

    Set.Iio more general

    def Set.Iio {α : Type*} [Preorder α] : α → Set α

    Mathlib.Order.Interval.Set.Defs · line 38

    Why more general: The library has one definition for the numbers below a bound and no separate word for the convention in which zero counts as negative too.

    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 2fd2fe8c0942 · pair key 7d38928c2c11.
  38. Definition · main statement · Sign of a number › Terminology for signs

    Formalized

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

    A number is positive if it is greater than or equal to zero.

    Show in article · Read it in context on Wikipedia

    Nonneg more general

    abbrev Nonneg (α : Type u_2) [Zero α] [LE α] : Type (max 0 u_2)

    Mathlib.Algebra.Order.Nonneg.Basic · line 47

    Why more general: The library calls this collection the non-negative one, which under the convention of this passage is the same property that the article names positive, and it states it for any type with a zero and an order.

    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 7d2a1c56ee43 · pair key 51dc74cb2bb3.

    Set.Ici more general

    def Set.Ici {α : Type*} [Preorder α] : α → Set α

    Mathlib.Order.Interval.Set.Defs · line 44

    Why more general: The bound is left general in the library, so zero is one case of it, and the numbers are gathered as a set rather than named by an adjective.

    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 8d53d343d8d9 · pair key 465fb984cbce.

    NNReal special case

    def NNReal : Type

    Mathlib.Basic.NNReal.Defs · line 60

    Why a special case: It covers the reals only, where the passage speaks of numbers in any ordered ring, and it uses the other convention's word for the same condition.

    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 5930ade20780 · pair key e800ca07542a.
  39. Definition · main statement · Sign of a number › Terminology for signs

    Formalized

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

    A number is negative if it is less than or equal to zero.

    Show in article · Read it in context on Wikipedia

    Set.Iic more general

    def Set.Iic {α : Type*} [Preorder α] : α → Set α

    Mathlib.Order.Interval.Set.Defs · line 45

    Why more general: The library has a single definition for the numbers under a bound and no separate word for the convention in which zero counts as negative.

    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 fb68cdcc406e · pair key f18bd0605b26.
  40. Example · supporting · Sign of a number › Terminology for signs

    Partial

    Partial: Mathlib states part of this (proved).

    For example, the absolute value of a real number is always "non-negative", but is not necessarily "positive" in the first interpretation, whereas in the second interpretation, it is called "positive"—though not necessarily "strictly positive".

    Show in article · Read it in context on Wikipedia

    abs_nonneg states part

    theorem abs_nonneg {α : Type*} [Lattice α] [AddGroup α] [AddLeftMono α] [AddRightMono α] (a : α) : 0 ≤ |a|

    Mathlib.Algebra.Order.Group.Unbundled.Abs · line 107

    Why only part: It gives the inequality the passage leads with but says nothing about the absolute value failing to be above zero, which is what the rest of the sentence turns on.

    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 8e6fe5b6d895 · pair key 1ec80812f646.
  41. Definition · main statement · Sign of a number › Terminology for signs

    Partial

    Partial: Mathlib states part of this (proved).

    For example, a function would be called a positive function if its values are positive for all arguments of its domain, or a non-negative function if all of its values are non-negative.

    Show in article · Read it in context on Wikipedia

    Pi.le_def states part

    theorem Pi.le_def {ι : Type*} {π : ι → Type*} [(i : ι) → LE (π i)] {x y : (i : ι) → π i} : x ≤ y ↔ ∀ (i : ι), x i ≤ y i

    Mathlib.Order.Defs.Prop · lines 22–24

    Why only part: Mathlib compares functions value by value, so a function lies above zero precisely when every one of its values 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, 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 3600370d5982 · pair key bb7ef6fd9fb8.

    MetaMathlibExt.IsPositiveSequence special case

    def MetaMathlibExt.IsPositiveSequence : (ℕ → ℕ) → Prop

    MathlibExt.Combinatorics.Enumerative.TotienomialCoefficient · line 31

    Why a special case: The declaration fixes the function type to sequences of natural numbers and reads the domain as the positive indices.

    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, 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 64c2773.
    • Location key b030dbec9997 · pair key 2f10f1464506.
  42. Theorem · main statement · Sign of a number › Complex numbers

    Not formalized
    Complex numbers are impossible to order, so they cannot carry the structure of an ordered ring, and, accordingly, cannot be partitioned into positive and negative complex numbers.

    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 30250b39da0d).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  43. Theorem · main statement · Sign of a number › Complex numbers

    Not formalized
    Complex numbers are impossible to order, so they cannot carry the structure of an ordered ring, and, accordingly, cannot be partitioned into positive and negative complex numbers.

    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 835f15888e46).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  44. Definition · main statement · Sign of a number › Complex numbers

    Formalized

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

    They do, however, share an attribute with the reals, which is called absolute value or magnitude.

    Show in article · Read it in context on Wikipedia

    Complex.instNorm close match

    instance Complex.instNorm : Norm ℂ

    Mathlib.Analysis.Complex.Norm · lines 28–29

    Why close, not exact: Mathlib calls this size function the norm of a complex number and writes it with double bars, where the passage calls it absolute value or magnitude.

    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 53c679988619 · pair key d2661126b5df.
  45. Theorem · main statement · Sign of a number › Complex numbers

    Formalized

    Formalized: Mathlib states this exactly (proved).

    Magnitudes are always non-negative real numbers, and to any non-zero number there belongs a positive real number, its absolute value.

    Show in article · Read it in context on Wikipedia

    Complex.norm_nonneg exact match

    theorem Complex.norm_nonneg (z : ℂ) : 0 ≤ ‖z‖

    Mathlib.Analysis.Complex.Norm · lines 36–37

    Note: The magnitude is a real number by its very type here, and the declaration supplies the stated bound on 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, 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 b2ba499ee1d6 · pair key 0eb1225e828e.

    norm_nonneg more general

    theorem norm_nonneg {E : Type*} [SeminormedAddGroup E] (a : E) : 0 ≤ ‖a‖

    Mathlib.Analysis.Normed.Group.Basic · line 127

    Why more general: The declaration is stated for any seminormed additive group rather than for the complex numbers 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, 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 442face1c2f6 · pair key cc57722ccc18.
  46. Theorem · main statement · Sign of a number › Complex numbers

    Formalized

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

    Magnitudes are always non-negative real numbers, and to any non-zero number there belongs a positive real number, its absolute value.

    Show in article · Read it in context on Wikipedia

    norm_pos_iff more general

    theorem norm_pos_iff {E : Type*} [NormedAddGroup E] {a : E} : 0 < ‖a‖ ↔ a ≠ 0

    Mathlib.Analysis.Normed.Group.Basic · line 996

    Why more general: The declaration states the equivalence in both directions, and one of its halves is what the passage asserts.

    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 4c81c075c8b5 · pair key 9f4b512ef68d.

    AbsoluteValue.pos more general

    theorem AbsoluteValue.pos {R : Type*} {S : Type*} [Semiring R] [Semiring S] [PartialOrder S] (abv : AbsoluteValue R S) {x : R} : x ≠ 0 → 0 < abv x

    Mathlib.Algebra.Order.AbsoluteValue.Basic · line 119

    Why more general: The declaration is stated for an arbitrary absolute value on an arbitrary semiring rather than for the complex magnitude 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 b798b4072140 · pair key 71afd94fe92e.
  47. Example · supporting · Sign of a number › Complex numbers

    Formalized

    Formalized by 2 parts together (more general):

    1. abs_of_neg Mathlib (proved)
      • the absolute value of -3 is 3
    2. abs_of_nonneg Mathlib (proved)
      • the absolute value of 3 is 3
    For example, the absolute value of −3 and the absolute value of 3 are both equal to 3.

    Show in article · Read it in context on Wikipedia

    abs_of_neg states part

    theorem abs_of_neg {α : Type*} [Lattice α] [AddGroup α] {a : α} [AddLeftMono α] : a < 0 → |a| = -a

    Mathlib.Algebra.Order.Group.Unbundled.Abs · line 96

    Why only part: Lean writes the conclusion as the negation of the argument, which at minus three evaluates to three.

    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 18cb90369ba4 · pair key adc0e5aa0901.

    abs_of_nonneg states part

    theorem abs_of_nonneg {α : Type*} [Lattice α] [AddGroup α] {a : α} [AddLeftMono α] : 0 ≤ a → |a| = a

    Mathlib.Algebra.Order.Group.Unbundled.Abs · line 88

    Why only part: The declaration is stated for any element of a lattice-ordered additive group, three among 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 cb6e391faae3 · pair key 1f15db880429.
  48. Notation · supporting · Sign of a number › Complex numbers

    Partial

    Partial: Mathlib states part of this (proved).

    This is written in symbols as |−3| = 3 and |3| = 3.

    Show in article · Read it in context on Wikipedia

    abs_of_neg states part

    theorem abs_of_neg {α : Type*} [Lattice α] [AddGroup α] {a : α} [AddLeftMono α] : a < 0 → |a| = -a

    Mathlib.Algebra.Order.Group.Unbundled.Abs · line 96

    Why only part: Mathlib writes the same bars around the argument, and the declaration gives the value that stands on the right of the first displayed 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, 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 cc51b1c808d7 · pair key b0bb4515e7a6.

    abs_of_nonneg states part

    theorem abs_of_nonneg {α : Type*} [Lattice α] [AddGroup α] {a : α} [AddLeftMono α] : 0 ≤ a → |a| = a

    Mathlib.Algebra.Order.Group.Unbundled.Abs · line 88

    Why only part: Mathlib writes the same bars around the argument, and the declaration gives the value on the right of the second displayed equality.

    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 334f7fe0d772 · pair key 7e6504831b25.
  49. Theorem · main statement · Sign of a number › Complex numbers

    Formalized

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

    In general, any arbitrary real value can be specified by its magnitude and its sign.

    Show in article · Read it in context on Wikipedia

    sign_mul_abs more general

    theorem sign_mul_abs {α : Type u} [Ring α] [LinearOrder α] [IsStrictOrderedRing α] (x : α) : ↑(SignType.sign x) * |x| = x

    Mathlib.Basic.Sign.Basic · lines 105–106

    Why more general: Lean reconstructs the number from its sign and its magnitude, which settles the passage's claim that the two data fix the number; the declaration is written for any linearly ordered ring and is read here at ℝ.

    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 63878f033e8c · pair key 05bebbe5c2e0.
  50. Theorem · main statement · Sign of a number › Complex numbers

    Formalized

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

    Using the standard encoding, any real value is given by the product of the magnitude and the sign in standard encoding.

    Show in article · Read it in context on Wikipedia

    sign_mul_abs more general

    theorem sign_mul_abs {α : Type u} [Ring α] [LinearOrder α] [IsStrictOrderedRing α] (x : α) : ↑(SignType.sign x) * |x| = x

    Mathlib.Basic.Sign.Basic · lines 105–106

    Why more general: The sign here is the coerced three-valued sign, whose values are the numbers minus one, zero and one that the article names as its encoding; the statement is written for any linearly ordered ring and read at ℝ.

    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 1509df37e1dd · pair key 43dd840a670d.

    abs_mul_sign more general

    theorem abs_mul_sign {α : Type u} [Ring α] [LinearOrder α] [IsStrictOrderedRing α] (x : α) : |x| * ↑(SignType.sign x) = x

    Mathlib.Basic.Sign.Basic · lines 108–109

    Why more general: Same identity with the two factors written the other way round, which multiplication in ℝ makes the same statement.

    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 d11f8bf152f2 · pair key a04f8fa0b045.

    Int.sign_mul_abs special case

    theorem Int.sign_mul_abs (a : ℤ) : a.sign * |a| = a

    Mathlib.Algebra.Order.Group.Unbundled.Int · lines 48–49

    Why a special case: This is the passage's identity restricted to the integers, where the sign takes the same three values.

    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.
    • 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 251c3846353c · pair key dbde94e9efc5.
  51. Theorem · main statement · Sign of a number › Complex numbers

    Partial

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

    Since the real and complex numbers both form a field and contain the positive reals, they also contain the reciprocals of the magnitudes of all non-zero numbers.

    Show in article · Read it in context on Wikipedia

    Real.instField states part

    instance Real.instField : Field ℝ

    Mathlib.Basic.Real.Basic · lines 481–496

    Why only part: Lean records the field structure of ℝ; the containment the conjunct adds is immediate, since the positive reals are among the reals, so no further content is left.

    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 41ee3a95e31a · pair key 88da73004fdf.

    Complex.instField states part

    instance Complex.instField : Field ℂ

    Mathlib.Basic.Complex.Basic · lines 712–720

    Why only part: It says nothing about the real numbers sitting inside ℂ, so the containment half of the conjunct is left to another declaration.

    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 260c3c4d6e2c · pair key 3ec1d8e51cd3.

    Complex.ofReal_injective states part

    theorem Complex.ofReal_injective : Function.Injective Complex.ofReal

    Mathlib.Basic.Complex.Basic · line 103

    Why only part: It carries the containment half of the second conjunct and says nothing about the field operations of ℂ.

    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.
    • 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 894ea3e3cfa8 · pair key a9cc4a0aca8c.
  52. Theorem · supporting · Sign of a number › Complex numbers

    Not formalized
    Since the real and complex numbers both form a field and contain the positive reals, they also contain the reciprocals of the magnitudes of all non-zero numbers.

    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 eb9d2bd303d9).
    • 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).
  53. Theorem · supporting · Sign of a number › Complex numbers

    Formalized

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

    This means that any non-zero number may be multiplied with the reciprocal of its magnitude, that is, divided by its magnitude.

    Show in article · Read it in context on Wikipedia

    div_eq_mul_inv more general

    theorem div_eq_mul_inv {G : Type*} [DivInvMonoid G] (a b : G) : a / b = a * b⁻¹

    Mathlib.Algebra.Group.DivInvMonoid · lines 242–243

    Why more general: Lean states the identity for every pair of elements, so it also covers magnitudes of zero, where both sides agree by the convention on inverting zero; the passage's non-zero case is one instance of 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 600c10d79daf · pair key 5d5927cc82bf.

    division_def more general

    theorem division_def {G : Type*} [DivInvMonoid G] (a b : G) : a / b = a * b⁻¹

    Mathlib.Algebra.Group.DivInvMonoid · line 245

    Why more general: The same identity under a second name in the 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, 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 e65e686817f6 · pair key 677afc1b59f5.
  54. Theorem · main statement · Sign of a number › Complex numbers

    Formalized

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

    It is immediate that the quotient of any non-zero real number by its magnitude yields exactly its sign.

    Show in article · Read it in context on Wikipedia

    TauCeti.sign_eq_div_abs more general

    theorem TauCeti.sign_eq_div_abs {α : Type*} [DivisionRing α] [LinearOrder α] [IsStrictOrderedRing α] (x : α) : ↑(SignType.sign x) = x / |x|

    TauCeti.Data.SignType.Basic · lines 27–31

    Why more general: The left side is the coerced three-valued sign, whose values are the numbers minus one, zero and one, and Lean states the equation for every element, the extra value at zero carrying no content.

    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 83245ab.
    • Location key 45f97d303b65 · pair key 2ac8670c7fb6.

    Int.sign_eq_ediv_abs' special case

    theorem Int.sign_eq_ediv_abs' (a : ℤ) : a.sign = a / |a|

    Mathlib.Algebra.Order.Group.Unbundled.Int · lines 126–128

    Why a special case: The passage's statement restricted to integer values, where integer division of a number by its magnitude already lands on the three sign values.

    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 b8381fc7ee43 · pair key 5b09e0fdd1e6.
  55. Definition · main statement · Sign of a number › Complex numbers

    Formalized

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

    By analogy, the sign of a complex number z can be defined as the quotient of z and its magnitude |z|.

    Show in article · Read it in context on Wikipedia

    NormedSpace.normalize more general

    def NormedSpace.normalize {V : Type*} [NormedAddCommGroup V] [NormedSpace ℝ V] : V → V

    Mathlib.Analysis.Normed.Module.Normalize · line 25

    Why more general: Lean defines the unit-length vector in the direction of any vector of a real normed space, which at ℂ is the article's complex sign, and it fixes the value zero where the quotient would be undefined.

    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 ddbeaf5508c6 · pair key 31c8eaa46118.
  56. Theorem · main statement · Sign of a number › Complex numbers

    Formalized

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

    The sign of a complex number is the exponential of the product of its argument with the imaginary unit.

    Show in article · Read it in context on Wikipedia

    TauCeti.Contour.div_norm_eq_exp_arg_mul_I close match

    theorem TauCeti.Contour.div_norm_eq_exp_arg_mul_I {w : ℂ} : w ≠ 0 → w / ↑‖w‖ = Complex.exp (↑w.arg * Complex.I)

    TauCeti.Analysis.Contour.Argument.Lift · lines 279–282

    Why close, not exact: Lean writes the left side as the quotient of the number by its norm, which is the term the article's complex sign abbreviates, and reads the argument as the library's principal value lying in the half-open interval between minus pi and pi.

    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 83245ab.
    • Location key 6dce288cc4b4 · pair key 1d927520e668.
  57. Definition · main statement · Sign of a number › Sign functions › Real sign function

    Formalized

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

    The sign function or signum function extracts the sign of a real number, by mapping the set of real numbers to the set of the three reals {−1,  0,  1}. It can be defined as follows:[1] sgn :ℝ → {−1, 0, 1}x ↦ sgn(x) = {−1if x < 0,0if x = 0,1if x > 0. Thus sgn(x) is 1 when x is positive, and sgn(x) is −1 when x is negative.

    Show in article · Read it in context on Wikipedia

    Real.sign close match

    def Real.sign : ℝ → ℝ

    Mathlib.Basic.Real.Sign · lines 34–35

    Why close, not exact: Mathlib's real sign function is valued in the reals, writing the three sign values as the reals -1, 0 and 1 rather than carving out a three-element codomain.

    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 835a77c48eaa · pair key dea997d924e0.

    SignType.sign more general

    def SignType.sign {α : Type*} [Zero α] [Preorder α] [DecidableLT α] : α →o SignType

    Mathlib.Basic.Sign.Defs · lines 265–271

    Why more general: The declaration fixes the sign of an element of any zero-equipped preorder with decidable strict order, and the real case is one instance 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, 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 b706a5f39944 · pair key b1321e18cb5d.
  58. Theorem · supporting · Sign of a number › Sign functions › Real sign function

    Formalized

    Formalized by 2 parts together:

    1. Real.sign_of_pos Mathlib (proved)
      • sgn takes the value 1 at every positive real number
    2. Real.sign_of_neg Mathlib (proved)
      • sgn takes the value -1 at every negative real number
    …sgn :ℝ → {−1, 0, 1}x ↦ sgn(x) = {−1if x < 0,0if x = 0,1if x > 0. Thus sgn(x) is 1 when x is positive, and sgn(x) is −1 when x is negative.

    Show in article · Read it in context on Wikipedia

    Real.sign_of_pos states part

    theorem Real.sign_of_pos {r : ℝ} : 0 < r → r.sign = 1

    Mathlib.Basic.Real.Sign · lines 39–40

    Why only part: The declaration is stated for the real numbers with exactly the positivity assumption the conjunct carries.

    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 15d46a1f293a · pair key 85764a9268b6.

    Real.sign_of_neg states part

    theorem Real.sign_of_neg {r : ℝ} : r < 0 → r.sign = -1

    Mathlib.Basic.Real.Sign · line 37

    Why only part: The declaration is stated for the real numbers with exactly the negativity assumption the conjunct carries.

    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 4a4c21733d8c · pair key b23819a9260e.
  59. Theorem · main statement · Sign of a number › Sign functions › Real sign function

    Partial

    Partial: Mathlib states a special case (proved).

    For non-zero values of x, this function can also be defined by the formula sgn(x) = x|x| = |x|x, where |x| is the absolute value of x.

    Show in article · Read it in context on Wikipedia

    Int.sign_eq_abs_ediv special case

    theorem Int.sign_eq_abs_ediv (a : ℤ) : a.sign = |a| / a

    Mathlib.Algebra.Order.Group.Unbundled.Int · lines 130–132

    Why a special case: The declaration fixes this quotient only for integer arguments, with integer division, which agrees with real division once the argument is nonzero.

    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 7a810b785f01 · pair key 6b2a55990b8e.
  60. Theorem · main statement · Sign of a number › Sign functions › Complex sign function

    Formalized

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

    The complex sign function requires the magnitude of its argument z = x + iy, which can be calculated as |z| = √zz̄ = √x2 + y2.

    Show in article · Read it in context on Wikipedia

    Complex.norm_eq_sqrt_sq_add_sq close match

    theorem Complex.norm_eq_sqrt_sq_add_sq (z : ℂ) : ‖z‖ = √(z.re ^ 2 + z.im ^ 2)

    Mathlib.Analysis.Complex.Norm · lines 171–172

    Why close, not exact: Mathlib writes the magnitude of a complex number as its norm and its two coordinates through the real-part and imaginary-part projections.

    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 1fc017c3918c · pair key 2eb0122eee9f.
  61. Definition · main statement · Sign of a number › Sign functions › Complex sign function

    Formalized

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

    Analogous to above, the complex sign function extracts the complex sign of a complex number by mapping the set of non-zero complex numbers to the set of unimodular complex numbers, and 0 to 0: {z ∈ ℂ : |z| = 1} ∪ {0}. It may be defined as follows:

    Show in article · Read it in context on Wikipedia

    NormedSpace.normalize more general

    def NormedSpace.normalize {V : Type*} [NormedAddCommGroup V] [NormedSpace ℝ V] : V → V

    Mathlib.Analysis.Normed.Module.Normalize · line 25

    Why more general: Mathlib builds this normalization for every real normed space, so the complex-number case is one instance of the same construction.

    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 7c59577b3e80 · pair key b5702949b0f5.

    NormedSpace.norm_normalize_eq_one_iff states part

    theorem NormedSpace.norm_normalize_eq_one_iff {V : Type*} [NormedAddCommGroup V] [NormedSpace ℝ V] {x : V} : ‖NormedSpace.normalize x‖ = 1 ↔ x ≠ 0

    Mathlib.Analysis.Normed.Module.Normalize · lines 42–43

    Why only part: It pins down where the value is unimodular but says nothing on its own about the value assigned to zero.

    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 83b6bab7acf9 · pair key a411f7ed879f.
  62. Definition · main statement · Sign of a number › Sign functions › Complex sign function

    Formalized

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

    Let z be also expressed by its magnitude and one of its arguments φ as z = |z|⋅eiφ, then[3] sgn(z) = {0for z = 0z|z| = eiφotherwise.

    Show in article · Read it in context on Wikipedia

    NormedSpace.normalize more general

    def NormedSpace.normalize {V : Type*} [NormedAddCommGroup V] [NormedSpace ℝ V] : V → V

    Mathlib.Analysis.Normed.Module.Normalize · line 25

    Why more general: Mathlib builds this normalization for every real normed space, so the complex-number case is one instance of it; the polar shape of the nonzero value is recorded by 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 72b083d5fb2d · pair key c7a705f5d4ed.

    TauCeti.Contour.div_norm_eq_exp_arg_mul_I states part

    theorem TauCeti.Contour.div_norm_eq_exp_arg_mul_I {w : ℂ} : w ≠ 0 → w / ↑‖w‖ = Complex.exp (↑w.arg * Complex.I)

    TauCeti.Analysis.Contour.Argument.Lift · lines 279–282

    Why only part: Mathlib and this library write the magnitude as a norm and take the angle to be the principal argument, the representative between minus pi and pi.

    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 83245ab.
    • Location key 533a5a0e65ee · pair key c148d7df8c84.
  63. Theorem · supporting · Sign of a number › Sign functions › Complex sign function

    Formalized

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

    If the original value was R,θ in polar form, then sign(R, θ) is 1 θ.

    Show in article · Read it in context on Wikipedia

    TauCeti.Contour.div_norm_eq_exp_arg_mul_I close match

    theorem TauCeti.Contour.div_norm_eq_exp_arg_mul_I {w : ℂ} : w ≠ 0 → w / ↑‖w‖ = Complex.exp (↑w.arg * Complex.I)

    TauCeti.Analysis.Contour.Argument.Lift · lines 279–282

    Why close, not exact: The declaration takes the angle to be the principal argument, the representative between minus pi and pi, and the exponential term is unchanged by shifting the angle by a full turn.

    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 83245ab.
    • Location key 69a6afd66ecc · pair key 4d852c4695e1.
  64. Definition · main statement · Signs per convention › Sign of an angle

    Formalized

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

    In such a situation, the sign indicates whether the angle is in the clockwise or counterclockwise direction.

    Show in article · Read it in context on Wikipedia

    Real.Angle.sign close match

    def Real.Angle.sign : Real.Angle → SignType

    Mathlib.Analysis.SpecialFunctions.Trigonometric.Angle · lines 723–724

    Why close, not exact: Mathlib reads the sign of an angle in the reals modulo a full turn off the sign of its sine and records it as a value of the three-element sign type.

    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 f39abed27aa7 · pair key 727c31bbb79b.

    Real.Angle.toReal_neg_iff_sign_neg states part

    theorem Real.Angle.toReal_neg_iff_sign_neg {θ : Real.Angle} : θ.toReal < 0 ↔ θ.sign = -1

    Mathlib.Analysis.SpecialFunctions.Trigonometric.Angle · lines 763–765

    Why only part: It fixes the clockwise half of the correspondence and leaves the counterclockwise half to a companion lemma.

    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 af94a0c8e42f · pair key 9a7bfa125849.
  65. Definition · main statement · Signs per convention › Sign of an angle

    Not formalized
    Though different conventions can be used, it is common in mathematics to have counterclockwise angles count as positive, and clockwise angles count as negative.

    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 4 candidates examined (receipt 3c9de8ccfcd8).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  66. Definition · supporting · Signs per convention › Sign of an angle

    Not formalized
    Specifically, a right-handed rotation around an oriented axis typically counts as positive, while a left-handed rotation counts as negative.

    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 4afc64b0f6e8).
    • 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).
  67. Theorem · supporting · Signs per convention › Sign of an angle

    Partial

    Partial: Mathlib states part of this (proved).

    An angle which is the negative of a given angle has an equal arc, but the opposite axis.

    Show in article · Read it in context on Wikipedia

    Real.Angle.abs_toReal_neg states part

    theorem Real.Angle.abs_toReal_neg (θ : Real.Angle) : |(-θ).toReal| = |θ.toReal|

    Mathlib.Analysis.SpecialFunctions.Trigonometric.Angle · lines 510–513

    Why only part: Mathlib writes the arc of an angle as the absolute value of its representative in the half-turn to half-turn range, and states the equality in that form.

    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 0d42c8f22c86 · pair key c410e14c6c74.

    Orientation.oangle_neg_orientation_eq_neg states part

    theorem Orientation.oangle_neg_orientation_eq_neg {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [Fact (Module.finrank ℝ V = 2)] (o : Orientation ℝ V (Fin 2)) (x y : V) : (-o).oangle x y = -o.oangle x y

    Mathlib.Geometry.Euclidean.Angle.Oriented.Basic · lines 596–597

    Why only part: In the library the role of the oriented axis is played by an orientation of a two dimensional space, so the statement is the article's claim for plane angles.

    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 d7a96b960f7a · pair key dc9521366a7d.
  68. Definition · main statement · Signs per convention › Sign of a change

    Formalized

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

    When a quantity x changes over time, the change in the value of x is typically defined by the equation Δx = xfinal − xinitial.

    Show in article · Read it in context on Wikipedia

    fwdDiff more general

    def fwdDiff {M : Type*} {G : Type*} [AddCommMonoid M] [AddCommGroup G] : M → (M → G) → M → G

    Mathlib.Algebra.Group.ForwardDiff · line 40

    Why more general: Mathlib defines the operator for a function on any additive monoid with values in any additive group, so it covers far more than a real quantity watched over time.

    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 5d9c95ed6100 · pair key ab84735a877e.
  69. Theorem · supporting · Signs per convention › Sign of a change

    Formalized

    Formalized by 2 parts together (more general):

    1. sub_pos Mathlib (proved)
      • an increase of the quantity gives a positive change
    2. sub_neg Mathlib (proved)
      • a decrease of the quantity gives a negative change
    Using this convention, an increase in x counts as positive change, while a decrease of x counts as negative change.

    Show in article · Read it in context on Wikipedia

    sub_pos states part

    theorem sub_pos {α : Type u} [AddGroup α] [LT α] [AddRightStrictMono α] {a b : α} : 0 < a - b ↔ b < a

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

    Why only part: The lemma is an equivalence, so it also yields the converse reading, which this case of the article does not ask for.

    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 3e09509aca8c · pair key b57b7faa0ede.

    sub_neg states part

    theorem sub_neg {α : Type u} [AddGroup α] [LT α] [AddRightStrictMono α] {a b : α} : a - b < 0 ↔ a < b

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

    Why only part: The lemma is again an equivalence, which also yields the converse reading that this case does not ask for.

    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 7ea07113b4d5 · pair key e19b6129cafc.
  70. Theorem · main statement · Signs per convention › Sign of a change

    Not formalized
    As a result, any increasing function has positive derivative, while any decreasing function has negative derivative.

    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 4 candidates examined (receipt b78c6fdc854b).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  71. Definition · main statement · Signs per convention › Other meanings

    Not formalized
    In addition to the sign of a real number, the word sign is also used in various related ways throughout mathematics and other sciences:
    Words up to sign mean that, for a quantity q, it is known that either q = Q or q = −Q for certain Q.

    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 61f35a80882c).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  72. Notation · supporting · Signs per convention › Other meanings

    Not formalized
    Words up to sign mean that, for a quantity q, it is known that either q = Q or q = −Q for certain Q. It is often expressed as q = ±Q.

    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 72d869a57de7).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  73. Theorem · supporting · Signs per convention › Other meanings

    Formalized

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

    Words up to sign mean that, for a quantity q, it is known that either q = Q or q = −Q for certain Q. It is often expressed as q = ±Q. For real numbers, it means that only the absolute value |q| of the quantity is known.

    Show in article · Read it in context on Wikipedia

    abs_eq_abs more general

    theorem abs_eq_abs {α : Type*} [AddGroup α] [LinearOrder α] {a b : α} : |a| = |b| ↔ a = b ∨ a = -b

    Mathlib.Algebra.Order.Group.Unbundled.Abs · line 210

    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 4fa2f726af00 · pair key bf9eea82898a.

    Int.natAbs_eq_natAbs_iff special case

    theorem Int.natAbs_eq_natAbs_iff {a b : Int} : a.natAbs = b.natAbs ↔ a = b ∨ a = -b

    Init.Data.Int.Order · lines 633–640

    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 b4ee44ca8d58 · pair key 20d1c1c5db32.
  74. Theorem · supporting · Signs per convention › Other meanings

    Not formalized
    For complex numbers and vectors, a quantity known up to sign is a stronger condition than a quantity with known magnitude: aside Q and −Q, there are many other possible values of q such that |q| = |Q|.

    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 953983776b72).
    • 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).
  75. Theorem · supporting · Signs per convention › Other meanings

    Not formalized
    For complex numbers and vectors, a quantity known up to sign is a stronger condition than a quantity with known magnitude: aside Q and −Q, there are many other possible values of q such that |q| = |Q|.

    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 b510f554c0fd).
    • 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).
  76. Definition · main statement · Signs per convention › Other meanings

    Formalized

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

    The sign of a permutation is defined to be positive if the permutation is even, and negative if the permutation is odd.

    Show in article · Read it in context on Wikipedia

    Equiv.Perm.sign close match

    def Equiv.Perm.sign {α : Type u} [DecidableEq α] [Fintype α] : Equiv.Perm α →* ℤˣ

    Mathlib.GroupTheory.Perm.Sign · lines 358–359

    Why close, not exact: Lean sends a permutation to a unit of the integers, writing the first case as 1 and the second as -1.

    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 fc30fdd17b8c · pair key 95fc451d1cd2.
  77. Definition · main statement · Signs per convention › Other meanings

    Formalized

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

    In graph theory, a signed graph is a graph in which each edge has been marked with a positive or negative sign.

    Show in article · Read it in context on Wikipedia

    SimpleGraph.EdgeLabeling more general

    def SimpleGraph.EdgeLabeling {V : Type u_1} : SimpleGraph V → Type u_5 → Type (max u_1 u_5)

    Mathlib.Combinatorics.SimpleGraph.Coloring.EdgeLabeling · lines 35–36

    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 f84d61680e9c · pair key 069747370834.
  78. Definition · main statement · Signs per convention › Other meanings

    Formalized

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

    In mathematical analysis, a signed measure is a generalization of the concept of measure in which the measure of a set may have positive or negative values.

    Show in article · Read it in context on Wikipedia

    MeasureTheory.SignedMeasure close match

    abbrev MeasureTheory.SignedMeasure (α : Type u_2) [MeasurableSpace α] : Type (max u_2 0)

    Mathlib.MeasureTheory.VectorMeasure.Defs · lines 63–64

    Why close, not exact: Lean writes the notion as its vector measure structure with values in the reals, so each measurable set is assigned a real number of either sign.

    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 c3f76aaa14fc · pair key f1cfe4207e2b.

    MeasureTheory.VectorMeasure more general

    structure MeasureTheory.VectorMeasure (α : Type*) [MeasurableSpace α] (M : Type*) [AddCommMonoid M] [TopologicalSpace M]

    Mathlib.MeasureTheory.VectorMeasure.Defs · lines 50–60

    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 774af8a39151 · pair key 503c56d41c4b.
  79. Definition · supporting · Signs per convention › Other meanings

    Partial

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

    The concept of signed distance is used to convey side, inside or out. The ideas of signed area and signed volume are sometimes used when it is convenient for certain areas or volumes to count as negative.

    Show in article · Read it in context on Wikipedia

    AffineSubspace.signedInfDist special case

    def AffineSubspace.signedInfDist {V : Type*} {P : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] (s : AffineSubspace ℝ P) [Nonempty ↥s] [s.direction.HasOrthogonalProjection] : P → P →ᴬ[ℝ] ℝ

    Mathlib.Geometry.Euclidean.SignedDist · lines 241–242

    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 d208112bb6f6 · pair key b4132cff53b3.

    signedDist special case

    def signedDist {V : Type*} {P : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] : V → P →ᴬ[ℝ] P →ᴬ[ℝ] ℝ

    Mathlib.Geometry.Euclidean.SignedDist · lines 48–58

    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 79cf32a6dd66 · pair key 8ce563d39048.
  80. Definition · supporting · Signs per convention › Other meanings

    Partial

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

    The ideas of signed area and signed volume are sometimes used when it is convenient for certain areas or volumes to count as negative.

    Show in article · Read it in context on Wikipedia

    Orientation.areaForm special case

    def Orientation.areaForm {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E] [Fact (Module.finrank ℝ E = 2)] : Orientation ℝ E (Fin 2) → E →ₗ[ℝ] E →ₗ[ℝ] ℝ

    Mathlib.Analysis.InnerProductSpace.TwoDim · lines 90–95

    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 f13a29ebaa55 · pair key 80524974ed62.

    TauCeti.signedArea special case

    def TauCeti.signedArea : (ℝ → ℂ) → ℝ → ℝ → ℝ

    TauCeti.Analysis.Green.Examples.CurveArea.SignedArea · lines 38–39

    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 83245ab.
    • Location key d9a14bd004f5 · pair key 9eb1da44d3ae.
  81. Definition · supporting · Signs per convention › Other meanings

    Partial

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

    The ideas of signed area and signed volume are sometimes used when it is convenient for certain areas or volumes to count as negative.

    Show in article · Read it in context on Wikipedia

    Orientation.volumeForm special case

    def Orientation.volumeForm {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E] {n : ℕ} [_i : Fact (Module.finrank ℝ E = n)] : Orientation ℝ E (Fin n) → E [⋀^Fin n]→ₗ[ℝ] ℝ

    Mathlib.Analysis.InnerProductSpace.Orientation · lines 170–176

    Why a special case: Mathlib fixes the notion only for a finite-dimensional real inner product space carrying an orientation, where the passage speaks of signed volume wherever it is convenient.

    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 756f397837fc · pair key f9ec77ff8e96.
  82. Theorem · main statement · Signs per convention › Other meanings

    Formalized

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

    In an (abstract) oriented vector space, each ordered basis for the vector space can be classified as either positively or negatively oriented.

    Show in article · Read it in context on Wikipedia

    Module.Basis.orientation_eq_or_eq_neg more general

    theorem Module.Basis.orientation_eq_or_eq_neg {R : Type*} [CommRing R] [LinearOrder R] [IsStrictOrderedRing R] {M : Type*} [AddCommGroup M] [_root_.Module R M] {ι : Type*} [Fintype ι] [DecidableEq ι] (e : Module.Basis ι R M) (x : Orientation R M ι) : x = e.orientation ∨ x = -e.orientation

    Mathlib.LinearAlgebra.Orientation · lines 248–254

    Why more general: The declaration is stated for every orientation of the space at once and over an ordered commutative ring, which covers the passage's field of scalars; the two sides of each equation are written with the orientation first.

    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 f1891d8e997e · pair key c6b98bb5a344.

    Orientation.eq_or_eq_neg more general

    theorem Orientation.eq_or_eq_neg {R : Type*} [Field R] [LinearOrder R] [IsStrictOrderedRing R] {M : Type*} [AddCommGroup M] [_root_.Module R M] {ι : Type*} [Fintype ι] [FiniteDimensional R M] (x₁ x₂ : Orientation R M ι) : Fintype.card ι = Module.finrank R M → x₁ = x₂ ∨ x₁ = -x₂

    Mathlib.LinearAlgebra.Orientation · lines 348–353

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

    Why more general: For any finite-dimensional vector space over an ordered field, this states that two orientations indexed by a type whose size is the dimension are either equal or negatives of each other. Take one to be the orientation a basis gives and the other the chosen orientation: the basis is then positively or negatively oriented. A basis always meets the size hypothesis, and an ordered basis means the space is finite-dimensional.

    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 155cd3678b5c · pair key dac0761b47cb.
  83. Definition · supporting · Signs per convention › Other meanings

    Not formalized
    In a signed-digit representation, each digit of a number may have a positive or negative sign.

    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 4 candidates examined (receipt 4fe2313a40ed).
    • 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).

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