Definition · main statement ✓ Formalized
Formalized: Lean core states a more general result (a definition).
The result of a multiplication operation is called a product. Show all
Mul more general
class Mul : Type u → Type u
Init.Prelude · lines 1654–1656
Why more general: lean-core declares the multiplication of two elements of one type, and its value at two numbers is what the passage calls the product.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key d3279b819288 · pair key 860b0ae9e3db.
Nat. mul special case
def Nat.mul : Nat → Nat → Nat
Init.Prelude · lines 1917–1919
Why a special case: lean-core's multiplication on the naturals, documented as the operation reached through the asterisk.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key c65167c1451b · pair key 97daeb1c9390.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting ◔ Partial
Partial: Lean core states part of this (a definition).
Multiplication is often denoted by the cross symbol, ×, by the mid-line dot operator, ⋅, by juxtaposition, or, in programming languages, by an asterisk, *. Show all
HMul states part
class HMul : Type u → Type v → outParam (Type w) → Type (max (max u v) w)
Init.Prelude · lines 1505–1508
Why only part: lean-core's notation class is what gives multiplication its asterisk infix form in the language; the cross, the raised dot and juxtaposition are not declared anywhere in the universe.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 995633d776f5 · pair key 6a9a18d6905b.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement ◔ Partial
Partial: Lean core states this up to a convention difference, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.
The multiplication of whole numbers may be thought of as repeated addition; that is, the multiplication of two numbers is equivalent to adding as many copies of one of them, the multiplicand, as the quantity of the other one, the multiplier. Show all
List. sum_replicate_nat close match
theorem List.sum_replicate_nat {n a : Nat} : (List.replicate n a).sum = n * a
Init.Data.List.Nat.Sum · lines 38–39
Why close, not exact: lean-core writes the repeated sum as the sum of a list holding as many copies of the multiplicand as the multiplier says, and proves it equals their product.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key e9f5ef0392f4 · pair key 46c85a621814.
List. sum_const_nat close match
theorem List.sum_const_nat (m n : ℕ) : (List.replicate m n).sum = m * n
Mathlib.Algebra.BigOperators.Group.List.Basic · lines 385–386
Why close, not exact: mathlib states the same equation for naturals, the sum of a list of repeats against the product.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f83ccf488a3e · pair key ffc475f80570.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement ◔ Partial
Partial: Lean core states this up to a convention difference, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.
a × b = b + ⋯ + b a times .Show all
List. sum_replicate_nat close match
theorem List.sum_replicate_nat {n a : Nat} : (List.replicate n a).sum = n * a
Init.Data.List.Nat.Sum · lines 38–39
Why close, not exact: lean-core states that the product of two naturals equals the sum of a list made of a copies of b, which is the displayed formula with the row of copies written as a list.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 1f89e34e66b8 · pair key c1f6b1854029.
List. sum_const_nat close match
theorem List.sum_const_nat (m n : ℕ) : (List.replicate m n).sum = m * n
Mathlib.Algebra.BigOperators.Group.List.Basic · lines 385–386
Why close, not exact: mathlib proves the same equation over the naturals with the repeated summands held in a list.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 757e8a5c004e · pair key 151e7ec933af.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting ◔ Partial
Partial: Lean core states part of this (proved).
For example, the expression 3 × 4 can be phrased as "3 times 4", or "Three groups of four", notating the multiplication symbol with the word of, and evaluated as 4 + 4 + 4 , where 3 is the multiplier, but also as "3 multiplied by 4", in which case 3 becomes the multiplicand. Show all
List. sum_replicate_nat states part
theorem List.sum_replicate_nat {n a : Nat} : (List.replicate n a).sum = n * a
Init.Data.List.Nat.Sum · lines 38–39
Why only part: It yields the arithmetic the example performs, while which of the two numbers is called multiplier or multiplicand is left unsaid.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 8cb792596bdd · pair key 9a3685c66d5f.
List. sum_const_nat states part
theorem List.sum_const_nat (m n : ℕ) : (List.replicate m n).sum = m * n
Mathlib.Algebra.BigOperators.Group.List.Basic · lines 385–386
Why only part: mathlib's version entails the same evaluation of the example and says nothing about the naming of the two roles.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 25a237a161e4 · pair key 563960ff290a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement ✓ Formalized
Formalized: Lean core states a more general result (proved).
One of the main properties of multiplication is the commutative property, which states in this case that adding 3 copies of 4 gives the same result as adding 4 copies of 3. Show all
Nat. mul_comm more general
theorem Nat.mul_comm (n m : Nat) : n * m = m * n
Init.Data.Nat.Basic · lines 211–213
Why more general: lean-core proves that the two orders of a product of naturals agree, which is the property the passage appeals to for three and four.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 06e83308ad44 · pair key 68ebbe31fd74.
mul_comm more general
theorem mul_comm {G : Type*} [CommMagma G] (a b : G) : a * b = b * a
Mathlib.Algebra.Group.Semigroup · line 258
Why more general: mathlib states the commutative law wherever a commutative multiplication is available, the naturals included.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c1525cd81270 · pair key 67e7ae2d97d7.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting ✓ Formalized
Formalized: Lean core states this exactly (proved).
Thus, the designation of multiplier and multiplicand does not affect the result of the multiplication. Show all
Nat. mul_comm exact match
theorem Nat.mul_comm (n m : Nat) : n * m = m * n
Init.Data.Nat.Basic · lines 211–213
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key d79219f7989a · pair key 1e868e2d6e2c.
mul_comm more general
theorem mul_comm {G : Type*} [CommMagma G] (a b : G) : a * b = b * a
Mathlib.Algebra.Group.Semigroup · line 258
Why more general: Stated for an arbitrary type whose multiplication commutes, and the passage's whole numbers are one such type.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e8ccfc2a377c · pair key 6e18485e00f0.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting ◔ Partial
Partial: Mathlib states part of this (proved).
Multiplication can also be visualized as counting objects arranged in a rectangle (for whole numbers) or as calculating the area of a rectangle with sides of given lengths. Show all
Finset. card_product states part
theorem Finset.card_product {α : Type*} {β : Type*} (s : Finset α) (t : Finset β) : (s ×ˢ t).card = s.card * t.card
Mathlib.Data.Finset.Prod · lines 141–142
Why only part: Gives the counting half of the passage; the area of a rectangle is left to the other locations.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 179937ca5993 · pair key c8f8ee081cde.
Mathoverflow34145. lbMeasure_rectangle_toSet states part
theorem Mathoverflow34145.lbMeasure_rectangle_toSet (r : Mathoverflow34145.Rectangle) : Mathoverflow34145.lbMeasure r.toSet = ENNReal.ofReal |r.width * r.height|
FormalConjectures.Mathoverflow.«34145» · lines 117–119
Why only part: Gives the area half of the passage, with the product under an absolute value because the width and height parameters may be signed.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78. Location key e094fa806a73 · pair key a0bc145608f2.
Real. volume_Icc_pi states part
theorem Real.volume_Icc_pi {ι : Type*} [Fintype ι] {a b : ι → ℝ} : MeasureTheory.MeasureSpace.volume (Set.Icc a b) = ∏ i, ENNReal.ofReal (b i - a i)
Mathlib.MeasureTheory.Measure.Lebesgue.Basic · lines 236–238
Why only part: Gives the area half of the passage in any finite number of coordinates; the counting of an array is not part of it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ac8743549a79 · pair key 903c4c203878.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting ✕ Not formalized
The area of a rectangle remains the same regardless of which side is measured first —a result of the commutative property. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt be318405ee4f). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Related, but states something else (3)
mul_comm related
theorem mul_comm {G : Type*} [CommMagma G] (a b : G) : a * b = b * a
Mathlib.Algebra.Group.Semigroup · line 258
How it differs: Stated for any type whose multiplication commutes, and the side lengths of the passage are real numbers.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2c9a517915c6 · pair key 9ea36d472f11.
Mathoverflow34145. lbMeasure_rectangle_toSet related
theorem Mathoverflow34145.lbMeasure_rectangle_toSet (r : Mathoverflow34145.Rectangle) : Mathoverflow34145.lbMeasure r.toSet = ENNReal.ofReal |r.width * r.height|
FormalConjectures.Mathoverflow.«34145» · lines 117–119
How it differs: Computes the area of a rectangle from its width and height, but asserts nothing about taking the two sides in the other order.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78. Location key 39190a5a3e01 · pair key 77427dda6f58.
MeasureTheory.Measure. measurePreserving_swap related
theorem MeasureTheory.Measure.measurePreserving_swap {α : Type*} {β : Type*} [MeasurableSpace α] [MeasurableSpace β] {μ : MeasureTheory.Measure α} {ν : MeasureTheory.Measure β} [hν : MeasureTheory.SFinite ν] [MeasureTheory.SFinite μ] : MeasureTheory.MeasurePreserving Prod.swap (μ.prod ν) (ν.prod μ)
Mathlib.MeasureTheory.Measure.Prod · lines 719–720
How it differs: Says that exchanging the two coordinates of a product measure preserves it, which reaches the passage only together with the area formula.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, low confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f38e589b731d · pair key 9f7e26d985bf.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement ◔ 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 inverse operation of multiplication is considered division. Show all
div_eq_iff more general
theorem div_eq_iff {G₀ : Type*} [GroupWithZero G₀] {a b c : G₀} : b ≠ 0 → (a / b = c ↔ a = c * b)
Mathlib.Algebra.GroupWithZero.Units.Basic · line 345
Why more general: Stated for any group with zero, where the quotient is characterised by the multiplication equation it solves.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 0072193aaaf6 · pair key 8523a78aba35.
mul_div_cancel_right₀ states part
theorem mul_div_cancel_right₀ {M₀ : Type*} [MonoidWithZero M₀] [Div M₀] [MulDivCancelClass M₀] (a : M₀) {b : M₀} : b ≠ 0 → a * b / b = a
Mathlib.Algebra.GroupWithZero.Defs · lines 197–198
Why only part: States one direction of the inverse relation, multiplication followed by division.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1d92dea7bd31 · pair key f6ee85dc65be.
div_mul_cancel₀ states part
theorem div_mul_cancel₀ {G₀ : Type*} [GroupWithZero G₀] {b : G₀} (a : G₀) : b ≠ 0 → a / b * b = a
Mathlib.Algebra.GroupWithZero.Units.Basic · line 336
Why only part: States the other direction of the inverse relation, division followed by multiplication.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 548aa59a9ff2 · pair key 8f4777922858.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting ✓ Formalized
Formalized: Lean core states a more general result (proved).
For example, since 4 multiplied by 3 equals 12, 12 divided by 3 equals 4. Show all
Nat. div_eq_of_eq_mul_left more general
theorem Nat.div_eq_of_eq_mul_left {n m k : Nat} : 0 < n → m = k * n → m / n = k
Init.Data.Nat.Div.Basic · lines 455–456
Why more general: Stated for arbitrary naturals, of which the passage's three numbers are one choice.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 4911ee9bfd23 · pair key 75d88b54494d.
Nat. eq_div_of_mul_eq_left more general
theorem Nat.eq_div_of_mul_eq_left {c a b : Nat} : c ≠ 0 → a * c = b → a = b / c
Init.Data.Nat.Lemmas · lines 1049–1050
Why more general: Stated for arbitrary naturals and read here at the three numbers of the example.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 831bb9b00060 · pair key 034f0145772a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Indeed, multiplication by 3, followed by division by 3, yields the original number. Show all
mul_div_cancel_right₀ more general
theorem mul_div_cancel_right₀ {M₀ : Type*} [MonoidWithZero M₀] [Div M₀] [MulDivCancelClass M₀] (a : M₀) {b : M₀} : b ≠ 0 → a * b / b = a
Mathlib.Algebra.GroupWithZero.Defs · lines 197–198
Why more general: Stated for an arbitrary divisor that is not zero, and read here at the divisor 3.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7c1328df4e1f · pair key f03c3ad44bf3.
Nat. mul_div_cancel special case
theorem Nat.mul_div_cancel (m : Nat) {n : Nat} : 0 < n → m * n / n = m
Init.Data.Nat.Div.Basic · lines 427–429
Why a special case: Covers the passage at whole numbers, where division is the truncating one of Nat.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 305a558d0f39 · pair key 45d58fc9d535.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting ✓ Formalized
Formalized: Mathlib states a more general result (proved).
The division of a number other than 0 by itself equals 1. Show all
div_self more general
theorem div_self {G₀ : Type*} [GroupWithZero G₀] {a : G₀} : a ≠ 0 → a / a = 1
Mathlib.Algebra.GroupWithZero.Units.Basic · line 293
Why more general: Stated for any group with zero, and the numbers of the passage form one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 010f0619e4e4 · pair key bd9a7c52c3a2.
Nat. div_self special case
theorem Nat.div_self {n : Nat} : 0 < n → n / n = 1
Init.Data.Nat.Div.Basic · lines 451–453
Why a special case: Covers the whole-number case of the passage.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 51c25bfc3207 · pair key 01a33e7c329f.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · main statement · Notation ✓ Formalized
Formalized: Lean core states a more general result (a definition).
In arithmetic, multiplication is often written using the multiplication sign (either × or × ) between the factors (that is, in infix notation) Show all
Mul more general
class Mul : Type u → Type u
Init.Prelude · lines 1654–1656
Why more general: The library writes the sign as an asterisk rather than the cross of arithmetic, and declares the notation for an arbitrary type rather than for numbers alone.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 84058dba4cbe · pair key d132a9d8695a.
HMul more general
class HMul : Type u → Type v → outParam (Type w) → Type (max (max u v) w)
Init.Prelude · lines 1505–1508
Why more general: The heterogeneous form of the same infix notation, letting the two factors have different types, and again written with an asterisk.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 91535ca6eb48 · pair key a2682562dc1a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Notation ✕ Not formalized
For example, 2 × 3 = 6, ("two times three equals six")Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 05d9a12adf9d). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Notation ✕ Not formalized
2 × 3 = 6, ("two times three equals six") 3 × 4 = 12, Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt d598c55c523a). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Notation ✕ Not formalized
3 × 4 = 12, 2 × 3 × 5 = 6 × 5 = 30, Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt f1c621327e07). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Notation ✕ Not formalized
2 × 3 × 5 = 6 × 5 = 30, 2 × 2 × 2 × 2 × 2 = 32. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt c5f135459179). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Notation ◔ Partial
With community edits: Partial. As published it is Formalized.
Partial, by a community edit: Lean core states something related (a definition).
There are other mathematical notations for multiplication: Multiplication is also denoted by a middle-position dot: 5 ⋅ 2 Show all
Nat. mul special case
def Nat.mul : Nat → Nat → Nat
Init.Prelude · lines 1917–1919
Why a special case: Its own documentation says the operation is normally reached through the asterisk, Lean's symbol in place of the article's dot, and it covers only natural numbers.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 644c288ca9a4 · pair key b217b9af9828.
Related, but states something else (1)
Mul related
class Mul : Type u → Type u
Init.Prelude · lines 1654–1656
Community Agent The pipeline said more general ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
How it differs: Mul is the class carrying a multiplication operation, written with an asterisk in Lean. The passage is about the centred-dot symbol for multiplication, which Lean does not provide for Mul, so the class is related but does not formalize this notation.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 0eb182651970 · pair key e5aa45b61db4.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Notation ✕ Not formalized
With community edits: Not formalized. As published it is Formalized.
The middle dot notation, or dot operator, is now standard in the United States and other countries.[clarification needed] When the dot operator character is not accessible, the interpunct (·) is used. Show all
Related, but states something else (2)
Mul related
class Mul : Type u → Type u
Init.Prelude · lines 1654–1656
Community Agent The pipeline said more general ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
How it differs: Mul is the class carrying multiplication, written with an asterisk in Lean. The passage is about using the interpunct as a typographic fallback for the multiplication dot; Lean has no such notation for Mul, so the class is related but does not formalize the passage.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 76e50a50c04e · pair key e59c4ff7ea8d.
HMul related
class HMul : Type u → Type v → outParam (Type w) → Type (max (max u v) w)
Init.Prelude · lines 1505–1508
Community Agent The pipeline said more general ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
How it differs: HMul is the class behind Lean's infix asterisk for multiplication. The passage is about using the interpunct as a fallback for the multiplication dot; Lean attaches no dot or interpunct to HMul, so the class is related but does not formalize the passage.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, low confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 6d73283f51df · pair key ef2cc9d9d107.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Notation ✕ Not formalized
With community edits: Not formalized. As published it is Formalized.
In algebra, multiplication involving variables is often written as a juxtaposition (e.g., xy for x times y or 5x for five times x ), also called implied multiplication. Show all
Related, but states something else (2)
Mul related
class Mul : Type u → Type u
Init.Prelude · lines 1654–1656
Community Agent The pipeline said more general ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
How it differs: This passage is about one notation: writing a product by juxtaposition (xy, 5x), called implied multiplication. Mul is the homogeneous multiplication typeclass, whose product is written with the explicit infix a * b (through HMul). In Lean, terms placed side by side are read as function application, so juxtaposition does not denote a product. Mul supplies the operation but none of the notation the passage describes.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 799709756ba4 · pair key b4997da467ed.
HMul related
class HMul : Type u → Type v → outParam (Type w) → Type (max (max u v) w)
Init.Prelude · lines 1505–1508
Community Agent The pipeline said more general ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
How it differs: This passage is about writing a product by juxtaposition (xy, 5x), called implied multiplication. HMul is the notation class for the explicit infix a * b. Lean does not read juxtaposition as multiplication: a spaced x y is function application, and an unspaced xy is a single name. So HMul supplies a different notation, not the one the passage describes.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, low confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key cde5a2a6836a · pair key 1822d0306300.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Notation ✓ Formalized
Formalized: Lean core states a more general result (a definition).
The notation can also be used for quantities that are surrounded by parentheses (e.g., 5(2) , (5)2 or (5)(2) for five times two) Show all
Mul more general
class Mul : Type u → Type u
Init.Prelude · lines 1654–1656
Why more general: Lean writes this operation with an asterisk between the factors, with brackets doing no more than grouping, whereas the passage lets adjacency alone carry the product; the class also ranges over far more types than numbers.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key d89024e7747e · pair key baa63591f999.
Related, but states something else (1)
Nat. mul related
def Nat.mul : Nat → Nat → Nat
Init.Prelude · lines 1917–1919
Community Agent The pipeline said special case ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
How it differs: The passage is about notation: writing parenthesized factors side by side, as in 5(2), to mean their product. Nat.mul is the multiplication function on natural numbers, written in Lean with the asterisk operator through its Mul instance. It is the operation being denoted, but it says nothing about juxtaposition or parentheses, so it is related rather than a special case of the passage.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key e1a710ee9482 · pair key 26758fb3deed.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Notation ✓ Formalized
Formalized by 2 parts together (more general):
crossProduct Mathlib (definition) the cross symbol applied to two vectors means their cross product, which is again a vector dotProduct Mathlib (definition) the dot applied to two vectors means their dot product, which is a scalar
The cross symbol generally denotes taking a cross product of two vectors, yielding a vector as its result, while the dot denotes taking the dot product of two vectors, resulting in a scalar. Show all
crossProduct states part
def crossProduct {R : Type*} [CommRing R] : (Fin 3 → R) →ₗ[R] (Fin 3 → R) →ₗ[R] Fin 3 → R
Mathlib.LinearAlgebra.CrossProduct · lines 47–59
Why only part: Mathlib builds the operation over an arbitrary commutative ring of scalars, and its value lies in the same space of vectors.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 405c9a0cc1d5 · pair key 082db5fbd0c9.
dotProduct states part
def dotProduct {m : Type*} {α : Type v} [Fintype m] [Mul α] [AddCommMonoid α] : (m → α) → (m → α) → α
Mathlib.Data.Matrix.Mul · lines 76–77
Why only part: The scalars may be any type with multiplication and addition and the index any finite type, and the result lives in the scalar type.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 4dd1374636b0 · pair key 2c70464572d3.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Notation ✕ Not formalized
The numbers to be multiplied are generally called the factors (as in factorization). Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 3a6642c600c1). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Notation ✕ Not formalized
The number to be multiplied is the multiplicand , and the number by which it is multiplied is the multiplier. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 31fd5b95cb42). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Notation ✕ Not formalized
The number to be multiplied is the multiplicand, and the number by which it is multiplied is the multiplier. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt f35a67a74ea1). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Notation ✕ Not formalized
Usually, the multiplier is placed first, and the multiplicand is placed second ;[17][18] however, sometimes the first factor is considered the multiplicand and the second the multiplier. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 890ef5179c60). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Notation ◔ Partial
Partial: Mathlib states a special case (a definition).
In algebra, a number that is the multiplier of a variable or expression (e.g., the 3 in 3xy 2 ) is called a coefficient. Show all
Polynomial. coeff special case
def Polynomial.coeff {R : Type u} [Semiring R] : R[X] → ℕ →₀ R
Mathlib.Algebra.Polynomial.Basic · lines 558–559
Why a special case: Mathlib's function is the coefficient in one variable, whereas the passage's own example multiplies a product of two variables.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1263a16bfb6e · pair key 18784bda3cb7.
Related, but states something else (1)
MvPolynomial. monomial related
def MvPolynomial.monomial {R : Type u} {σ : Type*} [CommSemiring R] : (σ →₀ ℕ) → R →ₗ[R] MvPolynomial σ R
Mathlib.Algebra.MvPolynomial.Basic · lines 91–92
How it differs: It builds a monomial out of a scalar and an exponent vector rather than naming the scalar that multiplies an expression.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a54569fb73c9 · pair key 618cff7ee0a9.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Notation ✓ Formalized
Formalized: Lean core states a more general result (a definition).
The result of a multiplication is called a product. Show all
Mul more general
class Mul : Type u → Type u
Init.Prelude · lines 1654–1656
Why more general: The class supplies multiplication for an arbitrary type, and the element it returns on two arguments is the one the passage names.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key ddc4429d864c · pair key cdcdff597683.
Nat. mul special case
def Nat.mul : Nat → Nat → Nat
Init.Prelude · lines 1917–1919
Why a special case: This is multiplication for natural numbers only, one of the number systems the passage covers.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 1cd99e64aa9d · pair key 84ade78f3bcc.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Notation ✓ Formalized
Formalized: Mathlib states a more general result (proved).
When one factor is an integer, the product is a multiple of the other or of the product of the others. Show all
zsmul_eq_mul more general
theorem zsmul_eq_mul {α : Type*} [NonAssocRing α] (a : α) (n : ℤ) : n • a = ↑n * a
Mathlib.Data.Int.Cast.Lemmas · lines 103–105
Why more general: Its integer argument is an integer, so the passage's integer factor is met directly, and the ring may be any ring, including the reals where the passage's example lives.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d56c9a7e8365 · pair key a88fc9ab39e1.
Related, but states something else (1)
AddSubgroup. zsmul_mem_zmultiples related
theorem AddSubgroup.zsmul_mem_zmultiples {G : Type*} [AddGroup G] (g : G) (k : ℤ) : k • g ∈ AddSubgroup.zmultiples g
Mathlib.Algebra.Group.Subgroup.ZPowers.Basic · line 58
How it differs: It places an integer multiple inside the subgroup of multiples, and reaching the passage's product needs in addition the lemma identifying multiplication by an integer with that multiple.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key cea4c258e868 · pair key 31e50f41cdc9.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Notation ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Thus, 2 × π is a multiple of π , as is 5133 × 486 × π Show all
dvd_mul_left more general
theorem dvd_mul_left {α : Type*} [CommSemigroup α] (a b : α) : a ∣ b * a
Mathlib.Algebra.Divisibility.Basic · lines 246–247
Why more general: the library reads being a multiple as divisibility, and the factor that the article calls an integer is exactly the left factor of the product here
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 6e8a206ca5bb · pair key 92dd264b2891.
Related, but states something else (1)
AddSubgroup. zsmul_mem_zmultiples related
theorem AddSubgroup.zsmul_mem_zmultiples {G : Type*} [AddGroup G] (g : G) (k : ℤ) : k • g ∈ AddSubgroup.zmultiples g
Mathlib.Algebra.Group.Subgroup.ZPowers.Basic · line 58
How it differs: it places an integer multiple inside the subgroup generated by pi, which is a different formulation of multiple from the product the article writes
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9ea81c1f9e26 · pair key 8acdd187c57a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Notation ✓ Formalized
Formalized: Mathlib states a more general result (proved).
A product of integers is a multiple of each factor ; for example, 15 is the product of 3 and 5 and is both a multiple of 3 and a multiple of 5. Show all
Finset. dvd_prod_of_mem more general
theorem Finset.dvd_prod_of_mem {ι : Type*} {M : Type*} [CommMonoid M] (f : ι → M) {a : ι} {s : Finset ι} : a ∈ s → f a ∣ ∏ i ∈ s, f i
Mathlib.Algebra.BigOperators.Group.Finset.Piecewise · lines 231–234
Why more general: the library states this for a finite indexed product in any commutative monoid, which covers a product of any number of integer factors
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ffa236738d30 · pair key 8f6a983d5df3.
Int. dvd_mul_right states part
theorem Int.dvd_mul_right (a b : Int) : a ∣ a * b
Init.Data.Int.DivMod.Bootstrap · line 54
Why only part: this is the integer-specific form for the first of two factors
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 4792a0049b0d · pair key f40c56dbe0eb.
Int. dvd_mul_left states part
theorem Int.dvd_mul_left (a b : Int) : b ∣ a * b
Init.Data.Int.DivMod.Bootstrap · line 56
Why only part: this is the integer-specific form for the second of two factors
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key d8503b3de991 · pair key d88609950b36.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Notation ◔ Partial
Partial: Lean core states part of this (proved).
A product of integers is a multiple of each factor; for example, 15 is the product of 3 and 5 and is both a multiple of 3 and a multiple of 5. Show all
Nat. dvd_mul_right states part
theorem Nat.dvd_mul_right (a b : Nat) : a ∣ a * b
Init.Data.Nat.Dvd · line 24
Why only part: the numeric evaluation of the product to fifteen is settled by computation
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 1f817d1ce9b6 · pair key f2d8e468363f.
Nat. dvd_mul_left states part
theorem Nat.dvd_mul_left (a b : Nat) : a ∣ b * a
Init.Data.Nat.Dvd · line 23
Why only part: the numeric evaluation of the product to fifteen is settled by computation
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key c9adc1d98be3 · pair key 9fe47d2cc437.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Definitions › Product of two natural numbers ✓ Formalized
Formalized: Lean core states this up to a convention difference (a definition).
The product of two natural numbers r , s ∈ ℕ is defined as: r ⋅ s ≡ ∑s i = 1 r = r + r + ⋯ + r s times ≡ ∑r j = 1 s = s + s + ⋯ + s r times . Show all
Nat. mul close match
def Nat.mul : Nat → Nat → Nat
Init.Prelude · lines 1917–1919
Why close, not exact: Lean's logical model builds the product by recursion on the second argument, accumulating one copy of the first argument at each step, where the article writes the same repeated sum with a summation sign
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 94239ab38942 · pair key c1308368dff2.
Finset. sum_const_nat close match
theorem Finset.sum_const_nat {ι : Type*} {s : Finset ι} {m : ℕ} {f : ι → ℕ} : (∀ x ∈ s, f x = m) → ∑ x ∈ s, f x = s.card * m
Mathlib.Algebra.BigOperators.Group.Finset.Basic · lines 992–994
Why close, not exact: the library writes the repeated sum as a sum over a finite index set and reads the number of copies off the size of that set
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 5ebfa986658e · pair key e3ed8b7d3867.
Related, but states something else (1)
Nat. mul_comm related
theorem Nat.mul_comm (n m : Nat) : n * m = m * n
Init.Data.Nat.Basic · lines 211–213
How it differs: it states that the product does not depend on the order of the two factors, which is the fact behind the article's two readings of the repeated sum
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key f9e9f44f741b · pair key d15b421eb5dc.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Definitions › Product of two integers ◔ Partial
Partial: Lean core states a more general result, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.
An integer can be either zero, a nonzero natural number, or minus a nonzero natural number. Show all
Int. eq_nat_or_neg more general
theorem Int.eq_nat_or_neg (a : Int) : ∃ n, a = ↑n ∨ a = -↑n
Init.Data.Int.Order · line 1407
Why more general: the witness is a natural number (ℕ), cast into the integers, so the passage's zero case is the case where that natural number is zero and the other two cases are the cast and its negation
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key c4695efa14c4 · pair key 3cb5181615f9.
Int. natAbs_eq more general
theorem Int.natAbs_eq (a : Int) : a = ↑a.natAbs ∨ a = -↑a.natAbs
Init.Data.Int.Order · lines 622–624
Why more general: the natural number here (ℕ) is the absolute value of the integer, and its vanishing is exactly the passage's zero case
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 0e3841803cb9 · pair key 0ac5e87f447c.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Definitions › Product of two integers ✓ Formalized
Formalized: Lean core states this exactly (proved).
The product of zero and another integer is always zero. Show all
Int. zero_mul exact match
theorem Int.zero_mul (a : Int) : 0 * a = 0
Init.Data.Int.Lemmas · line 455
Note: the vanishing factor stands on the left of the product here
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 9cef6fa9bd3b · pair key 0664059d9426.
Int. mul_zero exact match
theorem Int.mul_zero (a : Int) : a * 0 = 0
Init.Data.Int.Lemmas · line 453
Note: the vanishing factor stands on the right of the product here
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 267b69995668 · pair key ba02113c43ea.
Int. mul_eq_zero more general
theorem Int.mul_eq_zero {a b : Int} : a * b = 0 ↔ a = 0 ∨ b = 0
Init.Data.Int.Lemmas · lines 551–557
Why more general: it characterises exactly when an integer product vanishes, which covers the passage's direction as one half of the equivalence
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 5c775048712b · pair key 03d20fb90dbf.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Definitions › Product of two integers ✓ Formalized
Formalized: Lean core states a more general result (a definition).
The product of two nonzero integers is determined by the product of their positive amounts, combined with the sign derived from the following rule: Show all
Int. mul more general
def Int.mul : Int → Int → Int
Init.Data.Int.Basic · lines 186–191
Why more general: the library's model of integer multiplication splits on the nonnegative and negative-successor shapes of the two arguments, which is where the magnitudes are multiplied and the sign is chosen
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 56ab0957d438 · pair key 3afa2b6348cf.
Int. natAbs_mul states part
theorem Int.natAbs_mul (a b : Int) : (a * b).natAbs = a.natAbs * b.natAbs
Init.Data.Int.Order · lines 629–631
Why only part: magnitude is taken here as the natural number absolute value of an integer
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key e6d3e9d9cb35 · pair key b661ed2f6278.
Int. sign_mul states part
theorem Int.sign_mul (a b : Int) : (a * b).sign = a.sign * b.sign
Init.Data.Int.Order · lines 1321–1323
Why only part: for nonzero arguments the sign takes the two values the article's table is indexed by
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key e7c40355015c · pair key 77cddb6bab50.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Definitions › Product of two integers ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
(This rule is a consequence of the distributivity of multiplication over addition, and is not an additional rule.) Show all
NonUnitalNonAssocRing. toHasDistribNeg more general
instance NonUnitalNonAssocRing.toHasDistribNeg {α : Type u} [NonUnitalNonAssocRing α] : HasDistribNeg α
Mathlib.Algebra.Ring.Defs · lines 340–343
Why more general: the sign behaviour of multiplication is produced here as a derived instance from the ring axioms, so no separate rule of signs is postulated
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key fdce7fb2b6df · pair key 2fc5ff649345.
Related, but states something else (2)
Int. neg_mul_neg related
theorem Int.neg_mul_neg (a b : Int) : -a * -b = a * b
Init.Data.Int.Lemmas · line 523
Community Agent The pipeline said states part ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
How it differs: Int.neg_mul_neg states one row of the integer sign rule: the product of two negatives equals the product of their negations. The passage claims something else, namely that the sign rule follows from distributivity and is not an extra axiom. The statement does not say that, although Lean core proves it from Int.neg_mul and Int.mul_neg, which rest on distributivity.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 12e38ff6ed7c · pair key b0658cb8906e.
Int. sign_mul related
theorem Int.sign_mul (a b : Int) : (a * b).sign = a.sign * b.sign
Init.Data.Int.Order · lines 1321–1323
How it differs: it records the rule itself for the integers
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 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, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 7a071bc00979 · pair key 897f7d6a7324.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Definitions › Product of two integers ✓ Formalized
Formalized by 4 parts together:
Int. mul_pos Lean core (proved) a product of two positive numbers is positive Int. mul_neg_of_pos_of_neg Lean core (proved) a positive number times a negative number is negative Int. mul_neg_of_neg_of_pos Lean core (proved) a negative number times a positive number is negative Int. mul_pos_of_neg_of_neg Lean core (proved) a product of two negative numbers is positive
In words: A positive number multiplied by a positive number is positive (product of natural numbers), A positive number multiplied by a negative number is negative, A negative number multiplied by a positive number is negative, A negative number multiplied by a negative number is positive. Show all
Int. mul_pos states part
theorem Int.mul_pos {a b : Int} : 0 < a → 0 < b → 0 < a * b
Init.Data.Int.Order · lines 533–537
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key e0cc919143d6 · pair key c3111886b16d.
Int. mul_neg_of_pos_of_neg states part
theorem Int.mul_neg_of_pos_of_neg {a b : Int} : 0 < a → b < 0 → a * b < 0
Init.Data.Int.Order · lines 1189–1191
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 2950a99bfd72 · pair key d63cab6091ed.
Int. mul_neg_of_neg_of_pos states part
theorem Int.mul_neg_of_neg_of_pos {a b : Int} : a < 0 → 0 < b → a * b < 0
Init.Data.Int.Order · lines 1193–1195
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 37bfa9a2c715 · pair key 6d5ccd64e7da.
Int. mul_pos_of_neg_of_neg states part
theorem Int.mul_pos_of_neg_of_neg {a b : Int} : a < 0 → b < 0 → 0 < a * b
Init.Data.Int.Order · lines 1216–1218
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 9e182cec6768 · pair key 18932d8ef877.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Definitions › Product of two fractions ◔ Partial
Partial: Lean core states this up to a convention difference, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.
Two fractions can be multiplied by multiplying their numerators and denominators: z n ⋅ z ′n ′ = z ⋅ z ′n ⋅ n ′ , which is defined when n , n ′ ≠ 0 . Show all
Rat. divInt_mul_divInt close match
theorem Rat.divInt_mul_divInt (n₁ n₂ : Int) {d₁ d₂ : Int} : Rat.divInt n₁ d₁ * Rat.divInt n₂ d₂ = Rat.divInt (n₁ * n₂) (d₁ * d₂)
Init.Data.Rat.Lemmas · lines 460–464
Why close, not exact: Lean writes the fraction with numerator z and denominator n as divInt z n, and the lemma reads the product off the product of the numerators over the product of the denominators.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 7d0a7568d4b7 · pair key b0713ce645b5.
Rat. mul_def' close match
theorem Rat.mul_def' (a b : Rat) : a * b = mkRat (a.num * b.num) (a.den * b.den)
Init.Data.Rat.Lemmas · lines 427–428
Why close, not exact: Lean forms the product from the product of the numerators and the product of the denominators and then reduces that fraction to lowest terms with mkRat.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 3bdbf9c27938 · pair key fefe8dd80be5.
div_mul_div_comm more general
theorem div_mul_div_comm {α : Type*} [DivisionCommMonoid α] (a b c d : α) : a / b * (c / d) = a * c / (b * d)
Mathlib.Algebra.Group.Basic · line 588
Why more general: It is proved for an arbitrary commutative division monoid instead of for fractions built from integers.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 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-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key fa785d91c3f8 · pair key 77f59a52da8e.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Definitions › Product of two real numbers ✓ Formalized
Formalized: Mathlib states a more general result (proved).
A fundamental aspect of these definitions is that every real number can be approximated to any accuracy by rational numbers. Show all
Rat. isDenseEmbedding_coe_real more general
theorem Rat.isDenseEmbedding_coe_real : IsDenseEmbedding Rat.cast
Mathlib.Topology.Instances.Rat · lines 43–44
Why more general: It also records that the cast is a topological embedding, a further fact the passage does not assert.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9eea91347205 · pair key ec69059c7107.
exists_rat_near more general
theorem exists_rat_near {K : Type*} [Field K] [LinearOrder K] [IsStrictOrderedRing K] [Archimedean K] {ε : K} (x : K) : 0 < ε → ∃ q, |x - ↑q| < ε
Mathlib.Algebra.Order.Archimedean.Basic · lines 440–443
Why more general: It is stated for any Archimedean ordered field rather than for the real numbers alone.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e901bce9e44a · pair key dac7ea40ed98.
Rat. denseRange_cast more general
theorem Rat.denseRange_cast {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] [TopologicalSpace 𝕜] [OrderTopology 𝕜] [Archimedean 𝕜] : DenseRange Rat.cast
Mathlib.Topology.Algebra.Order.Archimedean · lines 32–35
Why more general: It is proved for every Archimedean ordered field carrying the order topology, not only for the reals.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 407e9ef687e6 · pair key be87214a554e.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Definitions › Product of two real numbers ✓ Formalized
Formalized: Mathlib states a more general result (proved).
A standard way for expressing this is that every real number is the least upper bound of a set of rational numbers. Show all
ConditionallyCompleteLinearOrderedField. inducedMap_self more general
theorem ConditionallyCompleteLinearOrderedField.inducedMap_self {β : Type*} [Field β] [ConditionallyCompleteLinearOrder β] [IsStrictOrderedRing β] (b : β) : ConditionallyCompleteLinearOrderedField.inducedMap β β b = b
Mathlib.Algebra.Order.CompleteField · lines 202–203
Why more general: The induced map is defined as the supremum of the rational cut below its argument, and the declaration is proved for any conditionally complete ordered field; supremum and least upper bound are two encodings of one notion here, and the declaration pins the witnessing set instead of merely asserting that one exists.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ec16c87d7f11 · pair key 66908bcff122.
Related, but states something else (1)
LinearOrderedField. cutMap_self related
theorem LinearOrderedField.cutMap_self {α : Type*} [Field α] [LinearOrder α] (a : α) : LinearOrderedField.cutMap α a = Set.Iio a ∩ Set.range Rat.cast
Mathlib.Algebra.Order.CompleteField · lines 100–101
How it differs: It only identifies the cut set as the rationals below the element and says nothing about its least upper bound.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ac80475f7ecc · pair key 16a669416385.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Definitions › Product of two real numbers ◔ Partial
With community edits: Partial. As published it is Not formalized.
Partial, by a community edit: Mathlib states a special case (proved).
In particular, every positive real number is the least upper bound of the truncations of its infinite decimal representation ; for example, π is the least upper bound of {3, 3.1, 3.14, 3.141, …}. Show all
Real. hasSum_ofDigitsTerm_digits special case
theorem Real.hasSum_ofDigitsTerm_digits (x : ℝ) {b : ℕ} [NeZero b] : 1 < b → x ∈ Set.Ico 0 1 → HasSum (Real.ofDigitsTerm (x.digits b)) x
Mathlib.Analysis.Real.OfDigits · lines 149–156
Community Agent The pipeline said related ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
Why a special case: States that for x in [0,1), the series of x's base-b digits sums to x; its partial sums are the truncations. Only a special case of the passage: it covers [0,1), not every positive real. It states a limit, not a least upper bound. Lemmas sum_ofDigitsTerm_digits_le and le_sum_ofDigitsTerm_digits in the same file give the bound pair: each truncation is at most x and at least x - b^(-n).
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key bab06fadd4ac · pair key 45fdb1037f22.
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt a65aa3f7ce16). 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).
Related, but states something else (1)
Real. sum_ofDigitsTerm_digits_le related
theorem Real.sum_ofDigitsTerm_digits_le {x : ℝ} {b : ℕ} [NeZero b] : x ∈ Set.Ico 0 1 → ∀ (n : ℕ), ∑ i ∈ Finset.range n, Real.ofDigitsTerm (x.digits b) i ≤ x
Mathlib.Analysis.Real.OfDigits · lines 140–147
How it differs: It bounds each truncation by the number but leaves open whether the number is the smallest such bound.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 32b00f0b4477 · pair key 10a59d5510b9.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Definitions › Product of two real numbers ✕ Not formalized
In particular, every positive real number is the least upper bound of the truncations of its infinite decimal representation; for example, π is the least upper bound of {3, 3.1, 3.14, 3.141, …}. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 590729e00035). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Definitions › Product of two real numbers ✓ Formalized
Formalized: Mathlib states a more general result (proved).
A fundamental property of real numbers is that rational approximations are compatible with arithmetic operations, and, in particular, with multiplication. Show all
instIsTopologicalRingReal more general
instance instIsTopologicalRingReal : IsTopologicalRing ℝ
Mathlib.Topology.Algebra.Ring.Real · line 60
Why more general: It records continuity of addition, negation and multiplication for all real arguments, not only for approximating rationals.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f5bde5291def · pair key a5c42829fe07.
Related, but states something else (1)
Filter.Tendsto. mul related
theorem Filter.Tendsto.mul {M : Type*} [TopologicalSpace M] [Mul M] [ContinuousMul M] {α : Type*} {f g : α → M} {x : Filter α} {a b : M} : Filter.Tendsto f x (𝓝 a) → Filter.Tendsto g x (𝓝 b) → Filter.Tendsto (fun x ↦ f x * g x) x (𝓝 (a * b))
Mathlib.Topology.Algebra.Monoid.Defs · lines 78–80
How it differs: It covers multiplication alone, while the passage speaks of the arithmetic operations generally.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1a2007e2d629 · pair key ca4fd7eb7880.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Definitions › Product of two real numbers ◐ Statement only
With community edits: Statement only. As published it is Not formalized.
Statement only, by a community edit: Mathlib states a more general result (statement only: the proof is not finished).
This means that, if a and b are positive real numbers such that a = supx ∈ A x and b = supy ∈ B y , then a ⋅ b = supx ∈ A , y ∈ B x ⋅ y . In particular, the product of two positive real numbers is the least upper bound of the term-by-term products of the sequences of their decimal representations. Show all
csSup_mul more general
No module or line: an editor named the declaration, not a place in the source.
Mathlib
Community Agent Added by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026
Why more general: In any conditionally complete lattice-ordered group, the supremum of the pointwise product of two nonempty, bounded-above sets equals the product of their suprema. The positive reals under multiplication form such a group, so the passage is an instance: take A and B to be sets of positive reals with suprema a and b.
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 43dd75453d65). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Related, but states something else (2)
Real. mul_iSup_of_nonneg related
theorem Real.mul_iSup_of_nonneg {ι : Sort*} {r : ℝ} : 0 ≤ r → ∀ (f : ι → ℝ), r * ⨆ i, f i = ⨆ i, r * f i
Mathlib.Basic.Real.Pointwise · lines 116–117
How it differs: It moves one nonnegative constant factor through a supremum, which on its own does not give the passage's identity for two varying factors.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 6dd6e61b3dc8 · pair key 9d58c605682e.
Real. iSup_mul_of_nonneg related
theorem Real.iSup_mul_of_nonneg {ι : Sort*} {r : ℝ} : 0 ≤ r → ∀ (f : ι → ℝ), (⨆ i, f i) * r = ⨆ i, f i * r
Mathlib.Basic.Real.Pointwise · lines 128–129
How it differs: It is the same one-sided identity with the constant factor on the right, and again leaves the two-factor case open.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 054810bfcf3e · pair key 00036c015ac9.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Definitions › Product of two real numbers ✕ Not formalized
This means that, if a and b are positive real numbers such that a = supx ∈ A x and b = supy ∈ B y , then a ⋅ b = supx ∈ A , y ∈ B x ⋅ y . In particular, the product of two positive real numbers is the least upper bound of the term-by-term products of the sequences of their decimal representations. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 33b5420fc4ec). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Definitions › Product of two complex numbers ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
Two complex numbers can be multiplied by the distributive law and the fact that i 2 = −1 , as follows: (a + b i ) ⋅ (c + d i ) = a ⋅ c + a ⋅ d i + b i ⋅ c + b ⋅ d ⋅ i 2 = (a ⋅ c − b ⋅ d ) + (a ⋅ d + b ⋅ c ) i Show all
Complex. mk_mul_mk close match
theorem Complex.mk_mul_mk (x₁ x₂ y₁ y₂ : ℝ) : { re := x₁, im := y₁ } * { re := x₂, im := y₂ } = { re := x₁ * x₂ - y₁ * y₂, im := x₁ * y₂ + y₁ * x₂ }
Mathlib.Basic.Complex.Basic · lines 211–212
Why close, not exact: Mathlib writes a complex number as a record of its real and imaginary parts, and this theorem gives Mathlib's product of two such records in exactly the component form the passage displays.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 90334981f02b · pair key 34709a2deec2.
Complex. instMul close match
instance Complex.instMul : Mul ℂ
Mathlib.Basic.Complex.Basic · lines 208–209
Why close, not exact: Mathlib packages complex multiplication as a typeclass instance on ℂ rather than as a displayed equation, and its underlying rule is the component formula the passage gives.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9ad3ef8ce063 · pair key e5eed866f668.
Related, but states something else (2)
Complex. mul_re related
theorem Complex.mul_re (z w : ℂ) : (z * w).re = z.re * w.re - z.im * w.im
Mathlib.Basic.Complex.Basic · lines 215–216
How it differs: It records only the real coordinate of a product, so by itself it does not give the passage's whole equation.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 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-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key bffc454c40b1 · pair key bf3a57f00739.
Complex. mul_im related
theorem Complex.mul_im (z w : ℂ) : (z * w).im = z.re * w.im + z.im * w.re
Mathlib.Basic.Complex.Basic · lines 219–220
How it differs: It records only the imaginary coordinate of a product, so by itself it does not give the passage's whole equation.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 321eec84ac06 · pair key c0e981253593.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Construction · supporting · Definitions › Product of two complex numbers ◔ Partial
Partial: Mathlib states this up to a convention difference, but as a proved theorem, not a definition; a construction passage is formalized only by a Lean definition.
The geometric meaning of complex multiplication can be understood by rewriting complex numbers in polar coordinates: a + b i = r ⋅ (cos(φ ) + i sin(φ )) = r ⋅ e iφ Show all
Complex. norm_mul_exp_arg_mul_I close match
theorem Complex.norm_mul_exp_arg_mul_I (x : ℂ) : ↑‖x‖ * Complex.exp (↑x.arg * Complex.I) = x
Mathlib.Analysis.SpecialFunctions.Complex.Arg · lines 56–60
Why close, not exact: Mathlib supplies the two polar data itself, taking r to be the modulus of z and φ to be the principal argument of z, and at z = 0 both sides collapse to zero.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 0f647d5fa971 · pair key fc374e5efa66.
Related, but states something else (2)
Complex. norm_mul_cos_add_sin_mul_I related
theorem Complex.norm_mul_cos_add_sin_mul_I (x : ℂ) : ↑‖x‖ * (Complex.cos ↑x.arg + Complex.sin ↑x.arg * Complex.I) = x
Mathlib.Analysis.SpecialFunctions.Complex.Arg · lines 63–64
How it differs: It gives the trigonometric middle term of the passage's chain, and reaching the exponential end needs Euler's formula as a separate lemma.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 80a64620ebf3 · pair key 1678c254ca96.
Complex. polarCoord related
def Complex.polarCoord : OpenPartialHomeomorph ℂ (ℝ × ℝ)
Mathlib.Analysis.SpecialFunctions.PolarCoord · lines 184–185
How it differs: It is a chart between the slit plane and a strip of the plane rather than the identity the passage writes down.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 78aab594f540 · pair key 4b6cc7169293.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Definitions › Product of two complex numbers ◔ Partial
Partial: Mathlib states this up to a convention difference, but as a proved theorem, not a definition; a notation passage is formalized only by a Lean definition.
Furthermore, c + d i = s ⋅ (cos(ψ ) + i sin(ψ )) = s ⋅ e iψ , Show all
Complex. norm_mul_exp_arg_mul_I close match
theorem Complex.norm_mul_exp_arg_mul_I (x : ℂ) : ↑‖x‖ * Complex.exp (↑x.arg * Complex.I) = x
Mathlib.Analysis.SpecialFunctions.Complex.Arg · lines 56–60
Why close, not exact: Mathlib chooses the two polar data itself, the modulus of z for s and the principal argument of z for ψ, and at z = 0 both sides collapse to zero.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1c41d564c5eb · pair key 71842d9a7243.
Related, but states something else (1)
Complex. norm_mul_cos_add_sin_mul_I related
theorem Complex.norm_mul_cos_add_sin_mul_I (x : ℂ) : ↑‖x‖ * (Complex.cos ↑x.arg + Complex.sin ↑x.arg * Complex.I) = x
Mathlib.Analysis.SpecialFunctions.Complex.Arg · lines 63–64
How it differs: It gives the trigonometric middle term of the passage's chain, and reaching the exponential end needs Euler's formula as a separate lemma.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f2d67bb0f903 · pair key 623131f64950.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Definitions › Product of two complex numbers ✕ Not formalized
from which one obtains (a ⋅ c − b ⋅ d ) + (a ⋅ d + b ⋅ c )i = r ⋅ s ⋅ e i (φ + ψ ) . Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 9340073c83c0). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Related, but states something else (2)
Complex. exp_add related
theorem Complex.exp_add (x y : ℂ) : Complex.exp (x + y) = Complex.exp x * Complex.exp y
Mathlib.Analysis.Complex.Exponential · lines 112–131
How it differs: It splits the exponential of a sum of angles, but joining that to the component product needs the complex product formula as a further named lemma.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b4cf3f7a5b5d · pair key 6a280be5ac14.
Complex. mk_mul_mk related
theorem Complex.mk_mul_mk (x₁ x₂ y₁ y₂ : ℝ) : { re := x₁, im := y₁ } * { re := x₂, im := y₂ } = { re := x₁ * x₂ - y₁ * y₂, im := x₁ * y₂ + y₁ * x₂ }
Mathlib.Basic.Complex.Basic · lines 211–212
How it differs: It gives the component product of two complex numbers and says nothing about the exponential side of the passage's equation.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key fc28eb6afc3a · pair key 17234001824a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Definitions › Product of two complex numbers ✓ Formalized
Formalized by 2 parts together (close match):
Complex. norm_mul Mathlib (proved) the magnitude of a product of complex numbers is the product of their magnitudes Complex. arg_mul_coe_angle Mathlib (proved) the argument of a product of complex numbers is the sum of their arguments
The geometric meaning is that the magnitudes are multiplied and the arguments are added. Show all
Complex. norm_mul states part
theorem Complex.norm_mul (z w : ℂ) : ‖z * w‖ = ‖z‖ * ‖w‖
Mathlib.Analysis.Complex.Norm · lines 75–76
Why only part: The norm on ℂ is the modulus the passage calls the magnitude.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3bf63925ea65 · pair key 5855b661330a.
Complex. arg_mul_coe_angle states part
theorem Complex.arg_mul_coe_angle {x y : ℂ} : x ≠ 0 → y ≠ 0 → ↑(x * y).arg = ↑x.arg + ↑y.arg
Mathlib.Analysis.SpecialFunctions.Complex.Arg · lines 488–496
Why only part: Mathlib records the argument as an element of the circle of real angles, so the equation is an identity of angles rather than of real numbers in a chosen range.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d8fafc9e048a · pair key c06587a73e96.
Related, but states something else (1)
Complex. arg_mul_eq_add_arg_iff related
theorem Complex.arg_mul_eq_add_arg_iff {x y : ℂ} : x ≠ 0 → y ≠ 0 → ((x * y).arg = x.arg + y.arg ↔ x.arg + y.arg ∈ Set.Ioc (-π) π)
Mathlib.Analysis.SpecialFunctions.Complex.Arg · lines 529–532
How it differs: It says when the real-valued principal arguments add on the nose, which is a range condition rather than the passage's geometric law.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 276bcb0c5ed3 · pair key 5f8a96c8440f.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Definitions › Product of two quaternions ✕ Not formalized
With community edits: Not formalized. As published it is Formalized.
Note, in this case, that a ⋅ b and b ⋅ a are in general different. Show all
Related, but states something else (3)
TauCeti.Quaternion. commute_iff related
theorem TauCeti.Quaternion.commute_iff {R : Type*} [CommRing R] {x y : Quaternion R} : Commute x y ↔ 2 * (x.imJ * y.imK - x.imK * y.imJ) = 0 ∧ 2 * (x.imK * y.imI - x.imI * y.imK) = 0 ∧ 2 * (x.imI * y.imJ - x.imJ * y.imI) = 0
TauCeti.Algebra.Central.Quaternion · lines 87–110
Community Agent The pipeline said more general ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 10 Nov 2026.
How it differs: TauCeti.Quaternion.commute_iff gives a criterion for when two quaternions commute: 2 must annihilate the cross product of their imaginary parts. It does not itself say that some pair of real quaternions fails to commute. Getting the passage's claim needs extra steps: choosing a pair such as i and j and using 2 ≠ 0 in the reals. So the theorem is related to the passage, but the passage is not an instance of it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key a6c05a2488b0 · pair key 112d48026e90.
TauCeti.Quaternion. commute_iff' related
theorem TauCeti.Quaternion.commute_iff' {R : Type*} [CommRing R] {x y : Quaternion R} : IsLeftRegular 2 → (Commute x y ↔ x.imJ * y.imK = x.imK * y.imJ ∧ x.imK * y.imI = x.imI * y.imK ∧ x.imI * y.imJ = x.imJ * y.imI)
TauCeti.Algebra.Central.Quaternion · lines 118–125
How it differs: It restates the commuting criterion only after a regularity assumption on two has been supplied, which is an extra step rather than part of the passage.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key 55d5f9a3bdd8 · pair key 0bc670857e2f.
TauCeti.Quaternion. center_eq_bot related
theorem TauCeti.Quaternion.center_eq_bot {R : Type*} [CommRing R] : IsLeftRegular 2 → Subalgebra.center R (Quaternion R) = ⊥
TauCeti.Algebra.Central.Quaternion · lines 152–160
How it differs: It locates the centre of the quaternions in the scalars, from which non-commutativity follows only with a further nontriviality argument.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key c57894fb7fe9 · pair key ed30959ed8cc.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Computation ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Common logarithms were invented to simplify such calculations, since adding logarithms is equivalent to multiplying Show all
Real. logb_mul more general
theorem Real.logb_mul {b x y : ℝ} : x ≠ 0 → y ≠ 0 → Real.logb b (x * y) = Real.logb b x + Real.logb b y
Mathlib.Analysis.SpecialFunctions.Log.Base · lines 85–86
Why more general: Mathlib states the law for an arbitrary base at once, where the passage has in view the common logarithms used for hand computation.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 6c5b543e0dc0 · pair key 57953dce2b9f.
Real. log_mul special case
theorem Real.log_mul {x y : ℝ} : x ≠ 0 → y ≠ 0 → Real.log (x * y) = Real.log x + Real.log y
Mathlib.Analysis.SpecialFunctions.Log.Basic · lines 133–135
Why a special case: This is the passage's law for the single base chosen by Mathlib's unadorned logarithm.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7de9a192c5a0 · pair key c223596c9cf7.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Computation › Historical algorithms › Egyptians ✕ Not formalized
For instance, to find the product of 13 and 21 one had to double 21 three times, obtaining 2 × 21 = 42, 4 × 21 = 2 × 42 = 84, 8 × 21 = 2 × 84 = 168. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 55821de3e26f). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Computation › Historical algorithms › Egyptians ✕ Not formalized
13 × 21 = (1 + 4 + 8) × 21 = (1 × 21) + (4 × 21) + (8 × 21) = 21 + 84 + 168 = 273. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt b5a8e0c9fcf6). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Computation › Modern methods › Grid method ✕ Not formalized
An example of multiplying 34 by 13 would be to lay the numbers out in a grid as follows: × 30 4 10 300 40 3 90 12 Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 5396a10308df). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Computation › Computer algorithms ✕ Not formalized
The classical method of multiplying two n-digit numbers requires n2 digit multiplications. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 4c527e2d59bd). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Computation › Computer algorithms ✕ Not formalized
Methods based on the discrete Fourier transform reduce the computational complexity to O(n log n log log n). Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 2fe4acbec7d9). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Related, but states something else (2)
MathlibExt.TheoryOfComputation.IntegerMultiplicationWanted.IntegerMultiplication. theorem_1_1 related
theorem MathlibExt.TheoryOfComputation.IntegerMultiplicationWanted.IntegerMultiplication.theorem_1_1 : ∃ T, (fun n ↦ ↑(T.time n)) =O[Filter.atTop] fun n ↦ ↑n * Real.log ↑n
WantedExt.TheoryOfComputation.IntegerMultiplicationWanted · line 88
How it differs: It asserts a machine whose running time is bounded by a constant multiple of n log n, with no hypothesis about how that machine works.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773. Location key 32c1f79a9289 · pair key 9269a01b7059.
MathlibExt.Analysis.Fourier.FastFourierTransformWanted. fftCost_recurrence related
theorem MathlibExt.Analysis.Fourier.FastFourierTransformWanted.fftCost_recurrence (n : ℕ) : 0 < n → MathlibExt.Analysis.Fourier.FastFourierTransformWanted.fftCost (2 * n) = 2 * MathlibExt.Analysis.Fourier.FastFourierTransformWanted.fftCost n + 2 * n
MathlibExt.Analysis.Fourier.FastFourierTransform · line 136
How it differs: It gives the halving recurrence for the step count of the transform itself, not a bound on the cost of multiplying two numbers.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773. Location key 9ca8f42871f9 · pair key 1926e2568f57.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Computation › Computer algorithms ◐ Statement only
Statement only: ATLAS (atlas-lean) states this up to a convention difference (wanted: stated as a goal, with no proof).
In March 2019, David Harvey and Joris van der Hoeven submitted a paper presenting an integer multiplication algorithm with a complexity of O (n log n ). [28] The algorithm, also based on the fast Fourier transform, is conjectured to be asymptotically optimal. Show all
MathlibExt.TheoryOfComputation.IntegerMultiplicationWanted.IntegerMultiplication. theorem_1_1 close match
theorem MathlibExt.TheoryOfComputation.IntegerMultiplicationWanted.IntegerMultiplication.theorem_1_1 : ∃ T, (fun n ↦ ↑(T.time n)) =O[Filter.atTop] fun n ↦ ↑n * Real.log ↑n
WantedExt.TheoryOfComputation.IntegerMultiplicationWanted · line 88
Why close, not exact: The machine multiplies natural numbers (ℕ) handed to it in binary, least significant bit first, and its step count is bounded as a function of the input length; that is the bit-size reading of the passage's integer multiplication, where a sign is one further bit of input and the claim is about the n-digit size of the factors.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773. Location key 544cfbbd0bb5 · pair key 7b1e60f824c5.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Conjecture · main statement · Computation › Computer algorithms ✕ Not formalized
In March 2019, David Harvey and Joris van der Hoeven submitted a paper presenting an integer multiplication algorithm with a complexity of O (n log n ). [28] The algorithm, also based on the fast Fourier transform, is conjectured to be asymptotically optimal.[29] Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 1672f3b386d2). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Related, but states something else (1)
MathlibExt.TheoryOfComputation.IntegerMultiplicationWanted.IntegerMultiplication. theorem_1_1 related
theorem MathlibExt.TheoryOfComputation.IntegerMultiplicationWanted.IntegerMultiplication.theorem_1_1 : ∃ T, (fun n ↦ ↑(T.time n)) =O[Filter.atTop] fun n ↦ ↑n * Real.log ↑n
WantedExt.TheoryOfComputation.IntegerMultiplicationWanted · line 88
How it differs: It states that the n log n running time is achieved by some machine, and says nothing about what every machine must spend.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773. Location key 1a7c84cdd971 · pair key 532e7965f184.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Computation › Computer algorithms ✕ Not formalized
The algorithm is not practically useful, as it only becomes faster for multiplying extremely large numbers (having more than 2172912 bits). Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt a14169b5e9f9). 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).
Related, but states something else (1)
MathlibExt.TheoryOfComputation.IntegerMultiplicationWanted.IntegerMultiplication. theorem_1_1 related
theorem MathlibExt.TheoryOfComputation.IntegerMultiplicationWanted.IntegerMultiplication.theorem_1_1 : ∃ T, (fun n ↦ ↑(T.time n)) =O[Filter.atTop] fun n ↦ ↑n * Real.log ↑n
WantedExt.TheoryOfComputation.IntegerMultiplicationWanted · line 88
How it differs: It records the existence of a machine multiplying two numbers within a bound of the order of n times the logarithm of n, and says nothing about the size at which such a method overtakes the older ones.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773. Location key e4ea6fe29436 · pair key a8e4bd2930da.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Products of measurements ✕ Not formalized
[4 bags] × [3 marbles per bag] = 12 marbles. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 3e8a31f524dc). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Products of measurements ✕ Not formalized
50 kilometers per hour × 3 hours = 150 kilometers. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 3fece7dd834f). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Products of measurements ✕ Not formalized
Other examples of multiplication involving units include: 2.5 meters × 4.5 meters = 11.25 square meters Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 586571a18dbf). 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).
Related, but states something else (1)
Mathoverflow34145. lbMeasure_rectangle_toSet related
theorem Mathoverflow34145.lbMeasure_rectangle_toSet (r : Mathoverflow34145.Rectangle) : Mathoverflow34145.lbMeasure r.toSet = ENNReal.ofReal |r.width * r.height|
FormalConjectures.Mathoverflow.«34145» · lines 117–119
How it differs: It computes the plane measure of a rectangular region from its two side lengths, which reaches the passage only once one reads the passage's two lengths as the sides of a region, a reading the passage does not make.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78. Location key 6f50325d9ced · pair key 6073ddd97f2a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Products of measurements ✕ Not formalized
2.5 meters × 4.5 meters = 11.25 square meters 11 meters/second × 9 seconds = 99 meters Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt e01e236e64a3). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Products of measurements ✕ Not formalized
11 meters/second × 9 seconds = 99 meters 4.5 residents per house × 20 houses = 90 residents Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt dad59b1d59be). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · main statement · Product of a sequence › Capital pi notation ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
The product of a sequence of factors can be written with the product symbol ∏ , which derives from the capital letter Π (pi) in the Greek alphabet (much like the same way the summation symbol ∑ is derived from the Greek letter Σ (sigma)).[31][32] Show all
Finset. prod more general
def Finset.prod {ι : Type*} {M : Type*} [CommMonoid M] : Finset ι → (ι → M) → M
Mathlib.Algebra.BigOperators.Group.Finset.Defs · lines 67–68
Why more general: Mathlib takes the product over any finite index set in any commutative monoid, and this is the operation its own capital-pi symbol abbreviates.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3c68fe66c02c · pair key 62f3ce760da0.
Related, but states something else (2)
List. prod related
def List.prod {α : Type u_1} [Mul α] [One α] : List α → α
Init.Data.List.Basic · lines 2075–2076
Community Agent The pipeline said more general ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
How it differs: List.prod defines the product of a finite list of factors, the operation the passage puts a name to, but no capital-pi notation is attached to it in Lean core or Mathlib. In Mathlib the ∏ symbol abbreviates Finset.prod. Because this passage is about writing products with ∏, List.prod is related to it but does not formalize it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 6f62cd5fc220 · pair key 95054db50f79.
BigOperators. bigprod related
def BigOperators.bigprod : Lean.ParserDescr
Mathlib.Algebra.BigOperators.Group.Finset.Defs · line 195
How it differs: This is the parser that introduces the capital-pi symbol as the way to write the finite product, so it fixes the symbol but asserts no mathematical content of its own.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 01ad4541248d · pair key f5e91388da69.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Product of a sequence › Capital pi notation ✓ Formalized
Formalized: Mathlib states a more general result (proved).
The meaning of this notation is given by ∏4 i = 1 (i + 1) = (1 + 1) (2 + 1) (3 + 1) (4 + 1), which results in ∏4 i = 1 (i + 1) = 120. Show all
Fin. prod_univ_four more general
theorem Fin.prod_univ_four {M : Type*} [CommMonoid M] (f : Fin 4 → M) : ∏ i, f i = f 0 * f 1 * f 2 * f 3
Mathlib.Algebra.BigOperators.Fin · lines 124–126
Why more general: Mathlib numbers the four indices from zero where the example counts them from one, so the same four factors occur in the same order on both sides.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 063deffcae68 · pair key 00638679da9a.
Related, but states something else (1)
Finset. prod_range_succ related
theorem Finset.prod_range_succ {M : Type*} [CommMonoid M] (f : ℕ → M) (n : ℕ) : ∏ x ∈ Finset.range (n + 1), f x = (∏ x ∈ Finset.range n, f x) * f n
Mathlib.Algebra.BigOperators.Group.Finset.Basic · lines 560–562
How it differs: It takes one factor off the top of a product over an initial range, so arriving at a four-factor expansion needs it several times together with the value of the empty product.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 18dc8b4a3d42 · pair key 2691c04674d8.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Product of a sequence › Capital pi notation ✕ Not formalized
The meaning of this notation is given by ∏4 i = 1 (i + 1) = (1 + 1) (2 + 1) (3 + 1) (4 + 1), which results in ∏4 i = 1 (i + 1) = 120. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 1385e2affa66). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Product of a sequence › Capital pi notation ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
In such a notation, the variable i represents a varying integer, called the multiplication index, that runs from the lower value 1 indicated in the subscript to the upper value 4 given by the superscript. Show all
Finset. prod more general
def Finset.prod {ι : Type*} {M : Type*} [CommMonoid M] : Finset ι → (ι → M) → M
Mathlib.Algebra.BigOperators.Group.Finset.Defs · lines 67–68
Why more general: Mathlib binds the index over an arbitrary finite index set, so the bounded integer range the passage describes is one choice of that set.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f0e15777dbb6 · pair key a5cc8d009bdc.
Related, but states something else (1)
Finset. Icc related
def Finset.Icc {α : Type*} [Preorder α] [LocallyFiniteOrder α] : α → α → Finset α
Mathlib.Order.Interval.Finset.Defs · lines 273–274
How it differs: It supplies the range of index values delimited by the two bounds but says nothing about any product.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a352f406910e · pair key d420a918410a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Product of a sequence › Capital pi notation ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
The product is obtained by multiplying together all factors obtained by substituting the multiplication index for an integer between the lower and the upper values (the bounds included) in the expression that follows the product operator. Show all
Finset. prod more general
def Finset.prod {ι : Type*} {M : Type*} [CommMonoid M] : Finset ι → (ι → M) → M
Mathlib.Algebra.BigOperators.Group.Finset.Defs · lines 67–68
Why more general: The declaration multiplies a function over an arbitrary finite index set, which covers the bounded run of index values the passage uses.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 5fd5a1dab14e · pair key e41d994fcc49.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Product of a sequence › Capital pi notation ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
More generally, the notation is defined as ∏n i = m x i = x m ⋅ x m + 1 ⋅ x m + 2 ⋅ ⋯ ⋅ x n − 1 ⋅ x n , where m and n are integers or expressions that evaluate to integers. Show all
Finset. prod more general
def Finset.prod {ι : Type*} {M : Type*} [CommMonoid M] : Finset ι → (ι → M) → M
Mathlib.Algebra.BigOperators.Group.Finset.Defs · lines 67–68
Why more general: The declaration works for any finite index set over any index type, so the integer bounds m and n the passage names are one instance of it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f52ddb7c25ca · pair key fc8c0503102d.
Related, but states something else (1)
Finset. prod_Icc_succ_top related
theorem Finset.prod_Icc_succ_top {M : Type*} [CommMonoid M] {a b : ℕ} : a ≤ b + 1 → ∀ (f : ℕ → M), ∏ k ∈ Finset.Icc a (b + 1), f k = (∏ k ∈ Finset.Icc a b, f k) * f (b + 1)
Mathlib.Algebra.BigOperators.Intervals · lines 75–77
How it differs: It peels a single top factor off a product over an interval of naturals rather than giving the whole run of factors for integer bounds.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 69975467081b · pair key 5085ada7e315.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Product of a sequence › Capital pi notation ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
In the case where m = n, the value of the product is the same as that of the single factor xm ; if m > n, the product is an empty product whose value is 1—regardless of the expression for the factors. Show all
Finset. prod_singleton close match
theorem Finset.prod_singleton {ι : Type*} {M : Type*} [CommMonoid M] (f : ι → M) (a : ι) : ∏ x ∈ {a}, f x = f a
Mathlib.Algebra.BigOperators.Group.Finset.Basic · lines 75–76
Why close, not exact: Lean writes the one-element run of indices as the finset whose only member is m, so Finset.Icc m m and that one-member finset name the same index range.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 69a12da7de75 · pair key 3cc61302c233.
Related, but states something else (1)
Finset. Icc_self related
theorem Finset.Icc_self {α : Type*} [PartialOrder α] [LocallyFiniteOrder α] (a : α) : Finset.Icc a a = {a}
Mathlib.Order.Interval.Finset.Basic · line 550
How it differs: It rewrites the index range when the bounds agree but says nothing about the value of a product.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d0d37398f562 · pair key 89f928d45566.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Product of a sequence › Capital pi notation ◔ Partial
Partial: Mathlib states part of this (proved).
In the case where m = n, the value of the product is the same as that of the single factor xm; if m > n, the product is an empty product whose value is 1—regardless of the expression for the factors. Show all
Finset. prod_empty states part
theorem Finset.prod_empty {ι : Type*} {M : Type*} {f : ι → M} [CommMonoid M] : ∏ x ∈ ∅, f x = 1
Mathlib.Algebra.BigOperators.Group.Finset.Defs · lines 378–379
Why only part: It fixes the value of an empty product but does not itself say that the passage's bounds give an empty index range.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f83471cc588b · pair key 433f6f2d36ad.
Related, but states something else (1)
Finset. Icc_eq_empty_of_lt related
theorem Finset.Icc_eq_empty_of_lt {α : Type*} {a b : α} [Preorder α] [LocallyFiniteOrder α] : b < a → Finset.Icc a b = ∅
Mathlib.Order.Interval.Finset.Basic · lines 114–115
How it differs: It settles that the index range is empty in the passage's case but leaves the value of the product to a second declaration.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 4aede9c02989 · pair key 10179665ffac.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Product of a sequence › Capital pi notation › Properties of capital pi notation ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
By definition, ∏n i = 1 x i = x 1 ⋅ x 2 ⋅ … ⋅ x n . Show all
Finset. prod more general
def Finset.prod {ι : Type*} {M : Type*} [CommMonoid M] : Finset ι → (ι → M) → M
Mathlib.Algebra.BigOperators.Group.Finset.Defs · lines 67–68
Why more general: The declaration multiplies a family over any finite index set, and the run from one to n the passage uses is one such set.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key aaccdd55e230 · pair key ef3aa8a4cccb.
Related, but states something else (1)
Finset. prod_range_succ related
theorem Finset.prod_range_succ {M : Type*} [CommMonoid M] (f : ℕ → M) (n : ℕ) : ∏ x ∈ Finset.range (n + 1), f x = (∏ x ∈ Finset.range n, f x) * f n
Mathlib.Algebra.BigOperators.Group.Finset.Basic · lines 560–562
How it differs: It removes the last factor of a product indexed by the first n naturals rather than writing out the whole run of factors.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c258a22cc916 · pair key 29aba500588f.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Product of a sequence › Capital pi notation › Properties of capital pi notation ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
If all factors are identical, a product of n factors is equivalent to exponentiation: ∏n i = 1 x = x ⋅ x ⋅ … ⋅ x = x n . Show all
Finset. pow_eq_prod_const close match
theorem Finset.pow_eq_prod_const {M : Type*} [CommMonoid M] (b : M) (n : ℕ) : b ^ n = ∏ _k ∈ Finset.range n, b
Mathlib.Algebra.BigOperators.Group.Finset.Basic · line 677
Why close, not exact: Lean indexes the n equal factors by Finset.range n, which starts the index at zero where the passage starts it at one, and writes the power on the left of the equation.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c72393a28fb3 · pair key d25a015db3ee.
Related, but states something else (1)
Finset. prod_const related
theorem Finset.prod_const {ι : Type*} {M : Type*} {s : Finset ι} [CommMonoid M] (b : M) : ∏ _x ∈ s, b = b ^ s.card
Mathlib.Algebra.BigOperators.Group.Finset.Basic · lines 661–662
How it differs: Its exponent is the size of the index set, so reaching the passage's exponent n needs a separate counting lemma for the range from one to n.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ee34f8c129c8 · pair key c750bf5b548a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Product of a sequence › Capital pi notation › Properties of capital pi notation ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Associativity and commutativity of multiplication imply ∏n i = 1 x i y i = (∏n i = 1 x i )(∏n i = 1 y i ) andShow all
Finset. prod_mul_distrib more general
theorem Finset.prod_mul_distrib {ι : Type*} {M : Type*} {s : Finset ι} [CommMonoid M] {f g : ι → M} : ∏ x ∈ s, f x * g x = (∏ x ∈ s, f x) * ∏ x ∈ s, g x
Mathlib.Algebra.BigOperators.Group.Finset.Basic · lines 310–311
Why more general: Mathlib allows an arbitrary finite index set and arbitrary commutative monoid values, so the article's run of indices is one reading of it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a6d891e89f0c · pair key 1fb9d776bc74.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Product of a sequence › Capital pi notation › Properties of capital pi notation ◔ Partial
Partial: Mathlib states a special case (proved).
∏n i = 1 x i y i = (∏n i = 1 x i )(∏n i = 1 y i ) and (∏n i = 1 x i )a = ∏n i = 1 x a i if a is a non-negative integer, or if all x i are positive real numbers, and ∏n i = 1 x a i = x ∑n i = 1 a i if all a i are non-negative integers, or if x is a positive real number. Show all
Finset. prod_pow special case
theorem Finset.prod_pow {ι : Type*} {M : Type*} [CommMonoid M] (s : Finset ι) (n : ℕ) (f : ι → M) : ∏ x ∈ s, f x ^ n = (∏ x ∈ s, f x) ^ n
Mathlib.Algebra.BigOperators.Group.Finset.Defs · lines 635–636
Why a special case: Its exponent ranges over the naturals, so it reaches the article's whole-number case and not the alternative in which the exponent is real and the factors positive.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key cb82684c3a90 · pair key 085a3a5cbe48.
Real. finsetProd_rpow special case
theorem Real.finsetProd_rpow {ι : Type*} (s : Finset ι) (f : ι → ℝ) : (∀ i ∈ s, 0 ≤ f i) → ∀ (r : ℝ), ∏ i ∈ s, f i ^ r = (∏ i ∈ s, f i) ^ r
Mathlib.Analysis.SpecialFunctions.Pow.NNReal · lines 255–258
Why a special case: Its factors are required to be nonnegative reals and its exponent is real, which is the article's second case; the extra factor value zero is harmless since the article's factors are positive.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2ff7fca8f31f · pair key 8091d0943117.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Product of a sequence › Capital pi notation › Properties of capital pi notation ◔ Partial
Partial: Mathlib states a special case (proved).
if a is a non-negative integer, or if all x i are positive real numbers, and ∏n i = 1 x a i = x ∑n i = 1 a i if all a i are non-negative integers, or if x is a positive real number.Show all
Finset. prod_pow_eq_pow_sum special case
theorem Finset.prod_pow_eq_pow_sum {ι : Type*} {M : Type*} [CommMonoid M] (s : Finset ι) (f : ι → ℕ) (a : M) : ∏ i ∈ s, a ^ f i = a ^ ∑ i ∈ s, f i
Mathlib.Algebra.BigOperators.Group.Finset.Basic · lines 680–682
Why a special case: Its exponents are natural numbers, so it reaches the article's whole-number case and not the alternative in which the base is a positive real and the exponents arbitrary.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key da144dcc5956 · pair key 0ceb7ffa4ebe.
Finset. prod_zpow_eq_zpow_sum special case
theorem Finset.prod_zpow_eq_zpow_sum {ι : Type*} {G : Type*} [CommGroup G] (s : Finset ι) (y : G) (e : ι → ℤ) : ∏ i ∈ s, y ^ e i = y ^ ∑ i ∈ s, e i
TauCeti.Algebra.BigOperators.ZPow · lines 42–49
Why a special case: It requires the base to be invertible, which the article's positive real case supplies, and it allows negative exponents the article does not mention.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key d30efc564e77 · pair key cf5729c785ff.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Product of a sequence › Infinite products ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
One may also consider products of infinitely many factors; these are called infinite products. Show all
tprod more general
def tprod {α : Type*} {β : Type*} [CommMonoid α] [TopologicalSpace α] : (β → α) → optParam (SummationFilter β) (SummationFilter.unconditional β) → α
Mathlib.Topology.Algebra.InfiniteSum.Defs · lines 143–148
Why more general: Mathlib defines this object for an arbitrary index type, arbitrary topological commutative monoid values and a choice of summation direction, and it is the library's infinite product.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1de7159d152e · pair key 09a7216d465d.
Related, but states something else (1)
Multipliable related
def Multipliable {α : Type*} {β : Type*} [CommMonoid α] [TopologicalSpace α] : (β → α) → optParam (SummationFilter β) (SummationFilter.unconditional β) → Prop
Mathlib.Topology.Algebra.InfiniteSum.Defs · lines 115–116
How it differs: It is the statement that such an infinite product exists, which is a condition on the family rather than the named object itself.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 8983b2e916ac · pair key b9e30307ba2a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Product of a sequence › Infinite products ✕ Not formalized
Notationally, this consists in replacing n above by the infinity symbol ∞. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt ee9440de6b89). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Product of a sequence › Infinite products ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
The product of such an infinite sequence is defined as the limit of the product of the first n factors, as n grows without bound. That is, ∏∞ i = m x i = limn → ∞ ∏n i = m x i . Show all
tprod more general
def tprod {α : Type*} {β : Type*} [CommMonoid α] [TopologicalSpace α] : (β → α) → optParam (SummationFilter β) (SummationFilter.unconditional β) → α
Mathlib.Topology.Algebra.InfiniteSum.Defs · lines 143–148
Why more general: Mathlib's product is the limit of the finite partial products along a chosen direction of finite index sets, and along the growing initial ranges on the naturals that direction is the one the article takes.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7a0895c411d8 · pair key 21513f49d783.
HasProd more general
def HasProd {α : Type*} {β : Type*} [CommMonoid α] [TopologicalSpace α] : (β → α) → α → optParam (SummationFilter β) (SummationFilter.unconditional β) → Prop
Mathlib.Topology.Algebra.InfiniteSum.Defs · lines 107–108
Why more general: This is the relation form of the same definition: the finite partial products, taken along the chosen direction, converge to the stated value.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 6bdd3760803c · pair key e501db0089c3.
Multipliable. tendsto_prod_tprod_nat special case
theorem Multipliable.tendsto_prod_tprod_nat {M : Type*} [CommMonoid M] [TopologicalSpace M] {f : ℕ → M} : Multipliable f → Filter.Tendsto (fun n ↦ ∏ i ∈ Finset.range n, f i) Filter.atTop (𝓝 (∏' (i : ℕ), f i))
Mathlib.Topology.Algebra.InfiniteSum.NatInt · lines 56–58
Why a special case: It assumes convergence that does not depend on the order of the factors, an assumption the article does not make, and under it delivers the article's defining limit.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 811d4747bf41 · pair key 242b6e2cb30c.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Product of a sequence › Infinite products ◔ Partial
Partial: Mathlib states a special case (proved).
One can similarly replace m with negative infinity, and define: ∏∞ i = −∞ x i = (limm → −∞ ∏0 i = m x i ) ⋅ (limn → ∞ ∏n i = 1 x i ), provided both limits exist.[citation needed] Show all
tprod_int_rec special case
theorem tprod_int_rec {M : Type*} [CommMonoid M] [TopologicalSpace M] [ContinuousMul M] [T2Space M] {f g : ℕ → M} : Multipliable f → Multipliable g → ∏' (n : ℤ), Int.rec f g n = (∏' (n : ℕ), f n) * ∏' (n : ℕ), g n
Mathlib.Topology.Algebra.InfiniteSum.NatInt · lines 400–402
Why a special case: Lean cuts the index at zero, putting the middle factor with the forward half, and writes each half's limit as that half's infinite product.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1605a4fb1654 · pair key 335738f6e418.
Related, but states something else (2)
tprod related
def tprod {α : Type*} {β : Type*} [CommMonoid α] [TopologicalSpace α] : (β → α) → optParam (SummationFilter β) (SummationFilter.unconditional β) → α
Mathlib.Topology.Algebra.InfiniteSum.Defs · lines 143–148
How it differs: Mathlib takes a single limit over intervals widening in both directions where the article multiplies two one-sided limits, and the two values agree whenever the article's two limits exist.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 247d26b23d0a · pair key 609e9afa4de8.
SummationFilter. conditional related
def SummationFilter.conditional (β : Type*) [Preorder β] [LocallyFiniteOrder β] : SummationFilter β
Mathlib.Topology.Algebra.InfiniteSum.SummationFilter · lines 217–218
How it differs: It defines the direction of widening intervals along which a two-sided product is taken, not the product itself.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 56f6dee8e56d · pair key 2e8ccadfcf4d.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Exponentiation ✓ Formalized
Formalized: Lean core states a more general result (a definition).
When multiplication is repeated, the resulting operation is known as exponentiation. Show all
Finset. pow_eq_prod_const close match
theorem Finset.pow_eq_prod_const {M : Type*} [CommMonoid M] (b : M) (n : ℕ) : b ^ n = ∏ _k ∈ Finset.range n, b
Mathlib.Algebra.BigOperators.Group.Finset.Basic · line 677
Why close, not exact: Mathlib writes the power out as the product of as many copies of the base as the exponent counts, indexed by a range of that length.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 45e4977c8f1f · pair key fb2aa9bddb77.
npowRec more general
def npowRec {M : Type u_1} [One M] [Mul M] : Nat → M → M
Init.Data.Zero · lines 40–42
Why more general: Lean builds the power operation of a monoid by iterating the multiplication, for any type carrying a unit and a multiplication, and its docstring describes it as the base multiplied by itself that many times.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 2d93c782e785 · pair key b7389a757632.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Exponentiation ✓ Formalized
Formalized: Mathlib states a more general result (proved).
For instance, the product of three factors of two (2×2×2) is "two raised to the third power", and is denoted by 23, a two with a superscript three. Show all
pow_three' more general
theorem pow_three' {M : Type*} [Monoid M] (a : M) : a ^ 3 = a * a * a
Mathlib.Algebra.Group.Monoid · line 436
Why more general: Lean brackets the three equal factors to the left, the way the article writes the product.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ebf7cada26e3 · pair key b436c4992649.
pow_three more general
theorem pow_three {M : Type*} [Monoid M] (a : M) : a ^ 3 = a * (a * a)
Mathlib.Algebra.Group.Monoid · line 439
Why more general: Lean brackets the three equal factors to the right, giving the same numerical product.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 59c241205e08 · pair key 11636623118c.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Exponentiation ◔ Partial
Partial: Mathlib states this up to a convention difference, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.
In general, the exponent (or superscript) indicates how many times the base appears in the expression, so that the expression a n = a × a × ⋯ × a n = ∏n i = 1 a indicates that n copies of the base a are to be multiplied together. Show all
Finset. pow_eq_prod_const close match
theorem Finset.pow_eq_prod_const {M : Type*} [CommMonoid M] (b : M) (n : ℕ) : b ^ n = ∏ _k ∈ Finset.range n, b
Mathlib.Algebra.BigOperators.Group.Finset.Basic · line 677
Why close, not exact: Lean lets the product index run over the first n naturals, so the product still has n factors, each equal to the base.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 38b2706849a5 · pair key 5ac32eb5be0a.
List. prod_eq_pow_card more general
theorem List.prod_eq_pow_card {M : Type*} [Monoid M] (l : List M) (m : M) : (∀ x ∈ l, x = m) → l.prod = m ^ l.length
Deprecated at this commit, in favour of List. prod_eq_pow_length .
Mathlib.Algebra.BigOperators.Group.List.Defs · line 100
Why more general: Lean counts the factors by the length of a list rather than by an index running from one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9f153395a8d1 · pair key f1ead1c8992f.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Exponentiation ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
This notation can be used whenever multiplication is known to be power associative. Show all
PNatPowAssoc more general
class PNatPowAssoc (M : Type*) [Mul M] [Pow M ℕ+] : Prop
Mathlib.Algebra.Group.PNatPowAssoc · lines 46–50
Why more general: Lean carries the exponent notation as a power instance and power associativity as a separate Prop mixin over it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 18e0541fc880 · pair key b0afc6b2b02a.
NatPowAssoc special case
class NatPowAssoc (M : Type*) [MulOneClass M] [Pow M ℕ] : Prop
Mathlib.Algebra.Group.NatPowAssoc · lines 46–52
Why a special case: Lean's unital form of the mixin also pins down the zeroth power, which the article's numbers possess.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7216bfdec8e7 · pair key b66e745e04d5.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Properties ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Commutative property The order in which two numbers are multiplied does not matter:[34][35] x ⋅ y = y ⋅ x . Show all
mul_comm more general
theorem mul_comm {G : Type*} [CommMagma G] (a b : G) : a * b = b * a
Mathlib.Algebra.Group.Semigroup · line 258
Why more general: Lean states the law for any type whose multiplication commutes.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9cb6d3d8720f · pair key a957027b7eea.
Real. commRing special case
instance Real.commRing : CommRing ℝ
Mathlib.Basic.Real.Basic · lines 176–197
Why a special case: The commutativity of real multiplication is one of the fields this instance supplies.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b37e4833cb0e · pair key 78b62660425c.
Complex. instCommSemiring special case
instance Complex.instCommSemiring : CommSemiring ℂ
Mathlib.Basic.Complex.Basic · lines 405–406
Why a special case: Lean records the commutativity of complex multiplication inside this instance.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 19465086e331 · pair key c765e4a5817e.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Properties ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Associative property Expressions solely involving multiplication or addition are invariant with respect to the order of operations:[34][35] (x ⋅ y ) ⋅ z = x ⋅ (y ⋅ z ). Show all
mul_assoc more general
theorem mul_assoc {G : Type*} [Semigroup G] (a b c : G) : a * b * c = a * (b * c)
Mathlib.Algebra.Group.Semigroup · lines 161–162
Why more general: Lean states the law for any type whose multiplication is associative.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1dc8864c14a7 · pair key e8a1ae1d18b9.
Real. commRing special case
instance Real.commRing : CommRing ℝ
Mathlib.Basic.Real.Basic · lines 176–197
Why a special case: The associativity of real multiplication is among the fields this instance supplies.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 30a72f2f2fb7 · pair key 1fa8091addf7.
Complex. instCommSemiring special case
instance Complex.instCommSemiring : CommSemiring ℂ
Mathlib.Basic.Complex.Basic · lines 405–406
Why a special case: Lean records the associativity of complex multiplication inside this instance.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 851f60022bfc · pair key 522195f70c9c.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Properties ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Distributive property Holds with respect to multiplication over addition. This identity is of prime importance in simplifying algebraic expressions:[34][35] x ⋅ (y + z ) = x ⋅ y + x ⋅ z . Show all
mul_add more general
theorem mul_add {R : Type v} [Mul R] [Add R] [LeftDistribClass R] (a b c : R) : a * (b + c) = a * b + a * c
Mathlib.Algebra.Ring.Defs · line 91
Why more general: Lean states the law for any type carrying both operations with left distributivity.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ad7ef8f8026e · pair key 8b750b351bba.
left_distrib more general
theorem left_distrib {R : Type v} [Mul R] [Add R] [LeftDistribClass R] (a b c : R) : a * (b + c) = a * b + a * c
Mathlib.Algebra.Ring.Defs · lines 87–89
Why more general: Lean keeps this as the primitive name of the law that mul_add abbreviates.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d0eee05d8a2b · pair key b0be59b0c101.
Real. commRing special case
instance Real.commRing : CommRing ℝ
Mathlib.Basic.Real.Basic · lines 176–197
Why a special case: Distributivity for the reals is among the fields this instance supplies.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 73c23c947912 · pair key 30635baae677.
Complex. instCommSemiring special case
instance Complex.instCommSemiring : CommSemiring ℂ
Mathlib.Basic.Complex.Basic · lines 405–406
Why a special case: Distributivity for the complexes is recorded inside this instance.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 8afabb06524b · pair key 7e98231f6576.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Properties ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
Identity element The multiplicative identity is 1 ; anything multiplied by 1 is itself. Show all
MulOneClass more general
class MulOneClass : Type u_2 → Type u_2
Mathlib.Algebra.Group.Monoid · lines 74–78
Why more general: Lean names the distinguished element one and packages the two identity laws for it as a class over any type.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key de3dd551c888 · pair key f7ec8e8780ab.
Real. commRing special case
instance Real.commRing : CommRing ℝ
Mathlib.Basic.Real.Basic · lines 176–197
Why a special case: The unit of real multiplication is one of the data this instance supplies.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 280d0b17c5ce · pair key ce43d2cca610.
Complex. instCommSemiring special case
instance Complex.instCommSemiring : CommSemiring ℂ
Mathlib.Basic.Complex.Basic · lines 405–406
Why a special case: The unit of complex multiplication is recorded inside this instance.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 65a94ae79640 · pair key f3c12dfa8624.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Properties ✓ Formalized
Formalized: Mathlib states a more general result (proved).
The multiplicative identity is 1; anything multiplied by 1 is itself. This feature of 1 is known as the identity property:[34][35] x ⋅ 1 = x . Show all
mul_one more general
theorem mul_one {M : Type*} [MulOneClass M] (a : M) : a * 1 = a
Mathlib.Algebra.Group.Monoid · lines 95–96
Why more general: Lean states the law for any type carrying a multiplication and a distinguished one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a7ab98c461f1 · pair key a3e2a0435b0a.
Real. commRing special case
instance Real.commRing : CommRing ℝ
Mathlib.Basic.Real.Basic · lines 176–197
Why a special case: The identity law for the real unit is among the fields this instance supplies.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 76ddb75aa16a · pair key a6dee0c12b5d.
Complex. instCommSemiring special case
instance Complex.instCommSemiring : CommSemiring ℂ
Mathlib.Basic.Complex.Basic · lines 405–406
Why a special case: The identity law for the complex unit is recorded inside this instance.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 24991887cffe · pair key d1174c72f4fb.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Properties ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Property of 0 Any number multiplied by 0 is 0. This is known as the zero property of multiplication:[34] x ⋅ 0 = 0. Show all
Mathlib.Tactic.Ring.Common. mul_zero more general
theorem Mathlib.Tactic.Ring.Common.mul_zero {R : Type*} [CommSemiring R] (a : R) : a * 0 = 0
Mathlib.Tactic.Ring.Common · line 654
Why more general: Lean states the law over any commutative semiring, and the reals and complexes are among those.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b9fb3b6f665f · pair key 00afe5e0db2a.
Int. mul_zero special case
theorem Int.mul_zero (a : Int) : a * 0 = 0
Init.Data.Int.Lemmas · line 453
Why a special case: The integers are one of the number systems the section says these laws cover.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key c313c0989795 · pair key cf660d8a8b5a.
Rat. mul_zero special case
theorem Rat.mul_zero (a : Rat) : a * 0 = 0
Init.Data.Rat.Lemmas · line 441
Why a special case: Fractions are listed in the section as numbers the properties hold for.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key d92e6b99bc44 · pair key 76ca3cf5ff8c.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Properties ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Negation −1 times any number is equal to the additive inverse of that number: (−1) ⋅ x = (−x ), where (−x ) + x = 0. −1 times −1 is 1: (−1) ⋅ (−1) = 1. Show all
neg_one_mul more general
theorem neg_one_mul {α : Type u} [MulOneClass α] [HasDistribNeg α] (a : α) : -1 * a = -a
Mathlib.Algebra.Ring.Defs · line 316
Why more general: In Lean minus x denotes the ring's additive inverse of x, so the article's cancelling sum is how that inverse is fixed.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key bf68303348e0 · pair key 2bc18d463511.
Int. neg_eq_neg_one_mul special case
theorem Int.neg_eq_neg_one_mul (a : Int) : -a = -1 * a
Init.Data.Int.Lemmas · lines 546–549
Why a special case: The two sides of the equation are written in the opposite order from the article's.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 96e624a7f486 · pair key 9077b2792bff.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Properties ✓ Formalized
Formalized: Mathlib states a more general result (proved).
−1 times any number is equal to the additive inverse of that number: (−1) ⋅ x = (−x ), where (−x ) + x = 0. −1 times −1 is 1: (−1) ⋅ (−1) = 1. Show all
neg_mul_neg more general
theorem neg_mul_neg {α : Type u} [Mul α] [HasDistribNeg α] (a b : α) : -a * -b = a * b
Mathlib.Algebra.Ring.Defs · line 292
Why more general: Lean states the sign rule for arbitrary factors; the article's equation is what it says when both factors are one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d4b5afd200f8 · pair key b82e4b92edd0.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Properties ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Inverse element Every number x, except 0, has a multiplicative inverse, 1 x , such that x ⋅ (1 x ) = 1 . Show all
mul_one_div_cancel more general
theorem mul_one_div_cancel {G₀ : Type*} [GroupWithZero G₀] {a : G₀} : a ≠ 0 → a * (1 / a) = 1
Mathlib.Algebra.GroupWithZero.Units.Basic · line 338
Why more general: Lean writes the reciprocal as one divided by x, as the article does, and states it for any group with zero.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key af6da171ece3 · pair key 7e8d78ebdcce.
mul_inv_cancel₀ more general
theorem mul_inv_cancel₀ {G₀ : Type u} [GroupWithZero G₀] {a : G₀} : a ≠ 0 → a * a⁻¹ = 1
Mathlib.Algebra.GroupWithZero.Defs · line 228
Why more general: The reciprocal is written with the inversion operator rather than as one over x; both name the same element.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c3443f13c51a · pair key c512a89afa02.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Properties ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Order preservation Multiplication by a positive number preserves the order:For a > 0, if b > c, then ab > ac. Show all
mul_lt_mul_of_pos_left more general
theorem mul_lt_mul_of_pos_left {α : Type*} [Mul α] [Zero α] [Preorder α] {a b c : α} [PosMulStrictMono α] : b < c → 0 < a → a * b < a * c
Mathlib.Algebra.Order.GroupWithZero.Defs · lines 233–234
Why more general: Lean phrases the comparison with the strict less-than sign and multiplies on the left, as the article's product does.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7bc97708deec · pair key 7f14d8f28645.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Properties ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Multiplication by a negative number reverses the order:For a < 0, if b > c, then ab < ac. Show all
mul_lt_mul_of_neg_left more general
theorem mul_lt_mul_of_neg_left {R : Type u} [Semiring R] [PartialOrder R] {a b c : R} [ExistsAddOfLE R] [PosMulStrictMono R] [AddRightStrictMono R] [AddRightReflectLT R] : b < a → c < 0 → c * a < c * b
Mathlib.Algebra.Order.Ring.Unbundled.Basic · lines 212–220
Why more general: Lean calls the negative factor c and writes the comparison with the strict less-than sign.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e8788acca18e · pair key 81e2bba609f6.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Properties ✕ Not formalized
The complex numbers do not have an ordering that is compatible with both addition and multiplication. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 4 candidates examined (receipt e9c392e0ea58). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Properties ✕ Not formalized
For example, multiplication is not, in general, commutative for matrices and quaternions. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 760d5c7eafa3). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Properties ✕ Not formalized
For example, multiplication is not, in general, commutative for matrices and quaternions.[34] Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 4 candidates examined (receipt e4e7a5258890). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Related, but states something else (1)
TauCeti.Quaternion. instIsCentral related
instance TauCeti.Quaternion.instIsCentral {R : Type*} [CommRing R] [NoZeroDivisors R] [NeZero 2] : Algebra.IsCentral R (Quaternion R)
TauCeti.Algebra.Central.Quaternion · lines 165–166
How it differs: The instance pins the centre of the quaternions down to the scalars of the base ring; the failure of commutativity follows only once one adds that the quaternions are bigger than those scalars.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key b19b145bba59 · pair key ac17ae644184.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Properties ✕ Not formalized
Hurwitz's theorem shows that for the hypercomplex numbers of dimension 8 or greater, including the octonions, sedenions, and trigintaduonions, multiplication is generally not associative. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 3 candidates examined (receipt 689e3b0320f5). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Related, but states something else (1)
TauCeti.Octonion. left_alternative related
theorem TauCeti.Octonion.left_alternative {R : Type*} [CommRing R] (x y : TauCeti.Octonion R) : x * x * y = x * (x * y)
TauCeti.Algebra.Octonion.Basic · lines 638–646
How it differs: The lemma records a rebracketing of octonion products that does hold when a factor is repeated; it asserts nothing about triples whose two bracketings differ.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key d45120deb7db · pair key d03513cc5787.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Axioms ✓ Formalized
Formalized: Lean core states this exactly (a definition).
Formalized by 2 parts together (close match):
Nat. mul_zero Lean core (proved) Nat. mul_succ Lean core (proved) x × S(y) = (x × y) + x, where S(y) is the successor of y
Peano arithmetic has two axioms for multiplication: x × 0 = 0 x × S (y ) = (x × y ) + x Show all
Nat. mul exact match
def Nat.mul : Nat → Nat → Nat
Init.Prelude · lines 1917–1919
Note: Lean defines multiplication on the naturals by recursion on the second argument: it returns zero at zero, and at a successor it adds the first argument to the previous value.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 702602e4641e · pair key 65ff761c58bf.
Nat. mul_zero states part
theorem Nat.mul_zero (n : Nat) : n * 0 = 0
Init.Data.Nat.Basic · lines 191–192
Why only part: The lemma unfolds Lean's multiplication at zero on the right, stating the defining equation of the library's operation.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key b8e1e4ee3b71 · pair key 38cf760d6aff.
Nat. mul_succ states part
theorem Nat.mul_succ (n m : Nat) : n * m.succ = n * m + n
Init.Data.Nat.Basic · lines 194–195
Why only part: The lemma unfolds Lean's multiplication at the successor of the second argument, stating the recursion step of the library's operation.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 5188f9890bc1 · pair key f4d29ef3b6a3.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Axioms ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
Here S(y) represents the successor of y; i.e., the natural number that follows y. Show all
Nat. instSuccOrder close match
instance Nat.instSuccOrder : SuccOrder ℕ
Mathlib.Order.SuccPred.Nat · lines 31–32
Why close, not exact: Lean packages the successor operation on the naturals as an order instance, carrying with the operation the proofs that its value is the least natural above the argument.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 654612395432 · pair key a877b006434c.
Order. succ more general
def Order.succ {α : Type*} [Preorder α] [SuccOrder α] : α → α
Mathlib.Order.SuccPred.Basic · lines 138–139
Why more general: The operation is defined for any preordered type that carries a successor structure, which is wider than the naturals of the passage (PD1).
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 4d014bcb4c1e · pair key 3e919dd32e1c.
Related, but states something else (1)
Nat. succ_eq_succ related
theorem Nat.succ_eq_succ : Order.succ = Nat.succ
Mathlib.Order.SuccPred.Nat · lines 51–52
How it differs: It only identifies the order-theoretic successor on the naturals with the constructor successor, a link between two spellings rather than a statement of what S denotes.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 84e59622318e · pair key a6eba9b6b12b.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Axioms ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
For instance, S(0), denoted by 1, is a multiplicative identity because x × 1 = x × S (0) = (x × 0) + x = 0 + x = x . Show all
Nat. instMulOneClass close match
instance Nat.instMulOneClass : MulOneClass ℕ
Mathlib.Algebra.Group.Nat.Defs · lines 26–28
Why close, not exact: Lean packages the two identity laws for the unit of the naturals into a single class instance that also carries the multiplication and the unit themselves.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 58e93f156506 · pair key 1954c6ec6487.
Nat. mul_one states part
theorem Nat.mul_one (n : Nat) : n * 1 = n
Init.Data.Nat.Basic · lines 216–217
Why only part: The lemma covers the right-hand identity law only, which is the half of the passage that the article's own computation shows.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 82acd134d66f · pair key 554d09307e0b.
Nat. one_mul states part
theorem Nat.one_mul (n : Nat) : 1 * n = n
Init.Data.Nat.Basic · lines 219–220
Why only part: The lemma covers the left-hand identity law only.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 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-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key bebc2f65f300 · pair key bd6794b81051.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Axioms ✓ Formalized
Formalized: Lean core states this exactly (proved).
For instance, S(0), denoted by 1, is a multiplicative identity because x × 1 = x × S (0) = (x × 0) + x = 0 + x = x .Show all
Nat. mul_one exact match
theorem Nat.mul_one (n : Nat) : n * 1 = n
Init.Data.Nat.Basic · lines 216–217
Note: The declaration states that a natural number times the unit is that number, which is what the chain asserts from its first term to its last.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key d751bd5fe107 · pair key 9360fe043910.
Related, but states something else (2)
Nat. mul_succ related
theorem Nat.mul_succ (n m : Nat) : n * m.succ = n * m + n
Init.Data.Nat.Basic · lines 194–195
How it differs: It justifies one middle step of the displayed computation, rewriting the product with a successor, without giving the chain's end-to-end equality.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 5f6b3ea3ac2d · pair key fb59244ca5db.
Nat. zero_add related
theorem Nat.zero_add (n : Nat) : 0 + n = n
Init.Data.Nat.Basic · lines 131–133
How it differs: It justifies the last middle step of the computation, dropping a zero summand, without giving the chain's end-to-end equality.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 92a18299a035 · pair key d201c0efd593.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Axioms ✓ Formalized
Formalized: Lean core states this up to a convention difference (a definition).
The axioms for integers typically define them as equivalence classes of ordered pairs of natural numbers. Show all
Int close match
inductive Int
Init.Data.Int.Basic · lines 46–58
Why close, not exact: Lean writes each integer either as a natural number or as the negation of a successor of a natural number, so the same numbers are carried by a tagged ℕ instead of by a class of pairs.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key e6bce6d52b84 · pair key 8683f1d3e5ff.
Algebra. GrothendieckAddGroup more general
abbrev Algebra.GrothendieckAddGroup (M : Type u_1) [AddCommMonoid M] : Type u_1
Mathlib.GroupTheory.MonoidLocalization.GrothendieckGroup · line 34
Why more general: The construction quotients pairs drawn from any additive commutative monoid, so it is wider than the ℕ of the passage, and at ℕ it returns precisely the classes of ordered pairs of natural numbers (PD1).
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a1a1c8c8e801 · pair key a05a82a941c4.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Axioms ✓ Formalized
Formalized: Lean core states this up to a convention difference (a definition).
The model is based on treating (x,y) as equivalent to x − y when x and y are treated as integers. Show all
Int. subNatNat close match
def Int.subNatNat : Nat → Nat → Int
Init.Data.Int.Basic · lines 146–149
Why close, not exact: The declaration takes the two natural numbers as separate arguments rather than as one ordered pair, and returns their difference as an integer, negative when the second exceeds the first.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key c731ec5b0279 · pair key 16f4b473013c.
Int. subNatNat_eq_coe close match
theorem Int.subNatNat_eq_coe {m n : Nat} : Int.subNatNat m n = ↑m - ↑n
Init.Data.Int.Lemmas · lines 353–361
Why close, not exact: The lemma unfolds the library's map on two naturals into the difference of their images in the integers.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 99d3ab08157f · pair key 1126d5132f20.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Axioms ✓ Formalized
Formalized: Lean core states a more general result (proved).
Thus both (0,1) and (1,2) are equivalent to −1. Show all
Int. subNatNat_eq_coe more general
theorem Int.subNatNat_eq_coe {m n : Nat} : Int.subNatNat m n = ↑m - ↑n
Init.Data.Int.Lemmas · lines 353–361
Why more general: Its binders m and n range over ℕ, which is what the article's pairs are built from, and its value lies in ℤ, so the integer -1 the passage names is the value obtained.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key c530946ff2ea · pair key 26eb4dba3b44.
AddLocalization. mk_eq_mk_iff' states part
theorem AddLocalization.mk_eq_mk_iff' {α : Type*} [AddCommMonoid α] [IsCancelAdd α] {s : AddSubmonoid α} {a₁ b₁ : α} {a₂ b₂ : ↥s} : AddLocalization.mk a₁ a₂ = AddLocalization.mk b₁ b₂ ↔ ↑b₂ + a₁ = ↑a₂ + b₁
Mathlib.GroupTheory.MonoidLocalization.Basic · line 780
Why only part: It settles that the two pairs agree, and says nothing about the value -1 itself.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 38f565beba55 · pair key 92468593655c.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Axioms ✓ Formalized
Formalized: Lean core states this up to a convention difference (a definition).
The multiplication axiom for integers defined this way is (x p , x m ) × (y p , y m ) = (x p × y p + x m × y m , x p × y m + x m × y p ). Show all
Int. mul close match
def Int.mul : Int → Int → Int
Init.Data.Int.Basic · lines 186–191
Why close, not exact: Lean carries an integer as a natural or as the negation of a successor instead of as a class of pairs of naturals; the operation on ℤ it fixes is the one the displayed formula lays down.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 28520808e16e · pair key bbc8de5124b0.
Algebra.GrothendieckAddGroup. instMul more general
instance Algebra.GrothendieckAddGroup.instMul {S : Type*} [NonUnitalNonAssocSemiring S] : Mul (Algebra.GrothendieckAddGroup S)
TauCeti.RingTheory.GrothendieckRing · lines 92–95
Why more general: The product is put on the formal differences of any such semiring; the pairs of naturals that give the integers are the case the passage writes out.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key 7fe2139848b3 · pair key a3abcc5fceb0.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Axioms ✓ Formalized
Formalized: Lean core states a more general result (proved).
The rule that −1 × −1 = 1 can then be deduced from (0, 1) × (0, 1) = (0 × 0 + 1 × 1, 0 × 1 + 1 × 0) = (1, 0). Show all
Int. neg_mul_neg more general
theorem Int.neg_mul_neg (a b : Int) : -a * -b = a * b
Init.Data.Int.Lemmas · line 523
Why more general: The passage arrives at the rule through the computation on pairs, while the declaration states the rule itself in ℤ.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 4d0f350530db · pair key f38765290f79.
neg_mul_neg more general
theorem neg_mul_neg {α : Type u} [Mul α] [HasDistribNeg α] (a b : α) : -a * -b = a * b
Mathlib.Algebra.Ring.Defs · line 292
Why more general: It is stated for any type with a multiplication and a negation that distributes over it, the integers among them.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 22bc16ee4301 · pair key a0f36b983e1f.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Multiplication with set theory ✓ Formalized
Formalized: Lean core states this exactly (a definition).
The product of non-negative integers can be defined with set theory using cardinal numbers or the Peano axioms. Show all
Nat. mul exact match
def Nat.mul : Nat → Nat → Nat
Init.Prelude · lines 1917–1919
Note: ℕ is Lean's type of the non-negative integers the passage speaks of, and this is the recursion on the successor that the Peano route gives for their product.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key a3fda11afc27 · pair key b203e60687b6.
Fintype. card_prod close match
theorem Fintype.card_prod (α : Type*) (β : Type*) [Fintype α] [Fintype β] : Fintype.card (α × β) = Fintype.card α * Fintype.card β
Mathlib.Data.Fintype.Prod · lines 56–58
Why close, not exact: The two sizes are natural numbers, Lean's non-negative integers, and the theorem puts their product as the size of the product set, which is the counting route through cardinalities.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 6671b2d4bd7a · pair key 17bfaecd147e.
Cardinal. mul_def more general
theorem Cardinal.mul_def (α β : Type u) : Cardinal.mk α * Cardinal.mk β = Cardinal.mk (α × β)
Mathlib.SetTheory.Cardinal.Defs · lines 275–276
Why more general: Cardinal multiplication is fixed here for every cardinal; the finite ones are ℕ, the non-negative integers the passage counts with.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f1cef19636d3 · pair key 776b1b752120.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Multiplication with set theory ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
The product of real numbers is defined in terms of products of rational numbers ; see construction of the real numbers. Show all
Real. cauchy_mul close match
theorem Real.cauchy_mul (a b : ℝ) : (a * b).cauchy = a.cauchy * b.cauchy
Mathlib.Basic.Real.Basic · lines 150–151
Why close, not exact: Lean's ℝ carries each real as a class of Cauchy sequences of rationals, and this theorem puts the product of two reals as the product taken in that completion of ℚ.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 14399954a1e6 · pair key 20f3d870f760.
CauSeq.Completion. instMulCauchy more general
instance CauSeq.Completion.instMulCauchy {α : Type*} [Field α] [LinearOrder α] [IsStrictOrderedRing α] {β : Type*} [Ring β] {abv : β → α} [IsAbsoluteValue abv] : Mul (CauSeq.Completion.Cauchy abv)
Mathlib.Algebra.Order.CauSeq.Completion · lines 86–87
Why more general: The instance puts a product on the completion of any ring carrying an absolute value; the rationals are the case the passage uses.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 4c6a34cac381 · pair key 61dc70def5ae.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Multiplication in group theory ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
These axioms are closure, associativity, and the inclusion of an identity element and inverses. Show all
Group close match
class Group : Type u_2 → Type u_2
Mathlib.Algebra.Group.Defs · lines 33–34
Why close, not exact: Lean packs the operation, the unit and the inversion with their laws as fields of a single class, and the closure of the operation is carried by its type G → G → G rather than written as a separate law; the division field is packaging.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key cc8dd5c6ef39 · pair key e391643f7d1f.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · main statement · Multiplication in group theory ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
A simple example is the set of non-zero rational numbers. Show all
Units. instGroup more general
instance Units.instGroup {α : Type u} [Monoid α] : Group αˣ
Mathlib.Algebra.Group.Units.Defs · lines 260–261
Why more general: Lean reaches this group by resolution from ℚ's field instance to its monoid and then to the units, and a unit of ℚ is a nonzero rational packaged with its inverse, so the carrier is the set the passage names.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2e869794c00d · pair key 7f0838615d76.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Multiplication in group theory ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
Here the identity element is 1, as opposed to groups under addition where the identity is typically 0. Show all
Rat. commGroupWithZero more general
instance Rat.commGroupWithZero : CommGroupWithZero ℚ
Mathlib.Algebra.Ring.Rat · lines 44–52
Why more general: The instance carries the whole multiplicative structure of the rationals, including the absorbing zero, and the passage reads off only its neutral element.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 61a45dcd1f36 · pair key 022543545844.
Units. val_one more general
theorem Units.val_one {α : Type u} [Monoid α] : ↑1 = 1
Mathlib.Algebra.Group.Units.Defs · lines 182–183
Why more general: Stated for an arbitrary monoid; the group of invertible rationals is Mathlib's way of writing the nonzero rationals under multiplication.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 697539bcedc7 · pair key ae23a6cbef8b.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Multiplication in group theory ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Note that with the rationals, zero must be excluded because, under multiplication, it does not have an inverse: there is no rational number that can be multiplied by zero to result in 1. Show all
Units. ne_zero more general
theorem Units.ne_zero {M₀ : Type*} [MonoidWithZero M₀] [Nontrivial M₀] (u : M₀ˣ) : ↑u ≠ 0
Mathlib.Algebra.GroupWithZero.Units.Basic · lines 35–36
Why more general: Stated for any monoid with zero rather than for the rationals alone; the nontriviality hypothesis rules out only the one-element ring, where the claim would be empty.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2ba69b74d231 · pair key ab3964b9fb7a.
not_isUnit_zero more general
theorem not_isUnit_zero {M₀ : Type*} [MonoidWithZero M₀] [Nontrivial M₀] : ¬IsUnit 0
Mathlib.Algebra.GroupWithZero.Units.Basic · lines 71–72
Why more general: Stated for an arbitrary monoid with zero; the reason zero has to be dropped is exactly that it is never invertible.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9ba189a93db0 · pair key 74ff29ded8ab.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Multiplication in group theory ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Note that with the rationals, zero must be excluded because, under multiplication, it does not have an inverse: there is no rational number that can be multiplied by zero to result in 1. Show all
not_isUnit_zero more general
theorem not_isUnit_zero {M₀ : Type*} [MonoidWithZero M₀] [Nontrivial M₀] : ¬IsUnit 0
Mathlib.Algebra.GroupWithZero.Units.Basic · lines 71–72
Why more general: Stated for an arbitrary monoid with zero, and Mathlib writes invertibility where the passage speaks of having a multiplicative inverse.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 017260bc62aa · pair key 74c24bb264e9.
Units. ne_zero more general
theorem Units.ne_zero {M₀ : Type*} [MonoidWithZero M₀] [Nontrivial M₀] (u : M₀ˣ) : ↑u ≠ 0
Mathlib.Algebra.GroupWithZero.Units.Basic · lines 35–36
Why more general: Stated for an arbitrary monoid with zero; it records the same obstruction from the side of the invertible elements.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 16e5b1884bd7 · pair key a9ae1e50b4e0.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Multiplication in group theory ✓ Formalized
Formalized by 2 parts together (more general):
Rat. commGroupWithZero Mathlib (definition) the multiplicative group of the non-zero rationals is abelian DihedralGroup. not_commutative Mathlib (proved) a set that satisfies the group axioms under multiplication need not be abelian
In this example, the result is an abelian group, but that is not always the case. Show all
Rat. commGroupWithZero states part
instance Rat.commGroupWithZero : CommGroupWithZero ℚ
Mathlib.Algebra.Ring.Rat · lines 44–52
Why only part: Besides the abelian group on the nonzero rationals the instance also records how zero multiplies, which the passage does not discuss.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c3f25b6820bf · pair key b3fd7a3471e9.
DihedralGroup. not_commutative states part
theorem DihedralGroup.not_commutative {n : ℕ} : n ≠ 1 → n ≠ 2 → ¬IsMulCommutative (DihedralGroup n)
Mathlib.GroupTheory.SpecificGroups.Dihedral · lines 226–232
Why only part: The declaration names one concrete family of groups where the passage only claims that some group fails to be abelian.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3cdb24c4cb09 · pair key 22867baf5ea5.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · main statement · Multiplication in group theory ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
To see this, consider the set of invertible square matrices of a given dimension over a given field. Here, it is straightforward to verify closure, associativity, and inclusion of identity (the identity matrix) and inverses. Show all
Matrix. GeneralLinearGroup more general
abbrev Matrix.GeneralLinearGroup (n : Type u) (R : Type v) [DecidableEq n] [Fintype n] [Semiring R] : Type (max v u)
Mathlib.LinearAlgebra.Matrix.GeneralLinearGroup.Defs · lines 42–44
Why more general: Defined over any semiring where the passage fixes a field, so it covers coefficient rings the passage never considers.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a5163833e94d · pair key 7e6f100e92c8.
Units. instGroup more general
instance Units.instGroup {α : Type u} [Monoid α] : Group αˣ
Mathlib.Algebra.Group.Units.Defs · lines 260–261
Why more general: This is the instance Lean's resolution reaches for the invertible matrices, through the monoid structure of the square matrices over the field.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 8e841175f8a7 · pair key ad950333ea73.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Multiplication in group theory ◔ Partial
Partial: TauCeti states a special case (proved).
However, matrix multiplication is not commutative, which shows that this group is non-abelian. Show all
TauCeti.Matrix.GeneralLinearGroup. not_isSolvable_fin_two special case
theorem TauCeti.Matrix.GeneralLinearGroup.not_isSolvable_fin_two (F : Type u) [Field F] : (∃ a, a ≠ 0 ∧ a ^ 2 ≠ 1) → ¬Group.IsSolvable (GL (Fin 2) F)
TauCeti.LinearAlgebra.Matrix.GeneralLinearGroup.Solvable · lines 36–42
Why a special case: It fixes the dimension at two and asks the field to hold a suitable element, so it covers only some of the dimensions and fields the passage ranges over.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key 0e07c28cc4cb · pair key f86d641993f9.
Related, but states something else (1)
LieAlgebra.SpecialLinear. sl_non_abelian related
theorem LieAlgebra.SpecialLinear.sl_non_abelian (n : Type*) (R : Type u₂) [CommRing R] [DecidableEq n] [Fintype n] [Nontrivial R] : 1 < Fintype.card n → ¬IsLieAbelian ↥(LieAlgebra.SpecialLinear.sl n R)
Mathlib.Algebra.Lie.Classical · lines 141–149
How it differs: It produces traceless matrices whose two products disagree, which is the reason the passage gives rather than the conclusion it draws about the invertible matrices.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3409f53073aa · pair key c9a85a2a1661.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Multiplication in group theory ◐ Statement only
With community edits: Statement only. As published it is Not formalized.
Statement only, by a community edit: Mathlib states this up to a convention difference (statement only: the proof is not finished).
Another fact worth noticing is that the integers under multiplication do not form a group—even if zero is excluded. Show all
Int. not_isField close match
No module or line: an editor named the declaration, not a place in the source.
Mathlib
Community Agent Added by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026
Why close, not exact: Int.not_isField proves that the integers are not a field. IsField asks for two distinct elements, commutativity, and an inverse for every nonzero element. The integers have the first two, so the theorem says some nonzero integer has no multiplicative inverse, which is why the nonzero integers are not a group under multiplication. Convention difference: it is phrased as 'not a field', not 'not a group'.
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 56e856ba1031). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Related, but states something else (2)
Int. isUnit_iff related
theorem Int.isUnit_iff {u : ℤ} : IsUnit u ↔ u = 1 ∨ u = -1
Mathlib.Algebra.Group.Int.Units · lines 45–49
How it differs: It characterises invertibility for every integer, while the passage only needs one nonzero integer that fails to be invertible.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 45484e36f7d3 · pair key d8824ffd6f7a.
Int. units_eq_one_or related
theorem Int.units_eq_one_or (u : ℤˣ) : u = 1 ∨ u = -1
Mathlib.Algebra.Ring.Int.Units · lines 32–33
How it differs: It enumerates the invertible integers, which is more than the passage needs to deny the group axioms.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 139c709f46c8 · pair key 731fb590afb8.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Multiplication in group theory ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
This is easily seen by the nonexistence of an inverse for all elements other than 1 and −1. Show all
Int. isUnit_eq_one_or close match
theorem Int.isUnit_eq_one_or {u : ℤ} : IsUnit u → u = 1 ∨ u = -1
Mathlib.Algebra.Group.Int.Units · lines 36–37
Why close, not exact: Mathlib writes the hypothesis as invertibility in the integers where the article says the element has a multiplicative inverse there.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e2767642e868 · pair key 084bc598fe58.
Int. isUnit_iff more general
theorem Int.isUnit_iff {u : ℤ} : IsUnit u ↔ u = 1 ∨ u = -1
Mathlib.Algebra.Group.Int.Units · lines 45–49
Why more general: It states an equivalence where the passage only asserts the direction from having an inverse to being one of the two numerals.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key aa2ec74f96c7 · pair key 7ed59311551b.
Int. units_eq_one_or close match
theorem Int.units_eq_one_or (u : ℤˣ) : u = 1 ∨ u = -1
Mathlib.Algebra.Ring.Int.Units · lines 32–33
Community Agent The pipeline said more general ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
Why close, not exact: Says every element of the unit group of the integers (the integers with a two-sided inverse) is 1 or -1. That is the passage's claim that no other integer has an inverse, stated for the bundled unit type instead of for integers carrying an inverse. It is no more general than the passage.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 4ac3177e08ae · pair key c6bef6a099e7.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · main statement · Multiplication in group theory ✕ Not formalized
With community edits: Not formalized. As published it is Formalized.
Multiplication in group theory is typically notated either by a dot or by juxtaposition (the omission of an operation symbol between elements). Show all
Related, but states something else (2)
Mul related
class Mul : Type u → Type u
Init.Prelude · lines 1654–1656
Community Agent The pipeline said more general ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
How it differs: The passage is about notation: group multiplication is written with a dot or by juxtaposition. Mul is the class of a binary multiplication operation, and at the pin its only notation is the asterisk a * b. It provides neither listed form, so it is related to the passage but does not formalize the notation it describes.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key ecf281024f0e · pair key b8200a5523d6.
Group related
class Group : Type u_2 → Type u_2
Mathlib.Algebra.Group.Defs · lines 33–34
How it differs: Mathlib's group class is the multiplicatively written one, as opposed to its additive twin, but what it states are the group axioms rather than any convention about printing the operation.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 5dc10b3f1f6f · pair key a558d83adac1.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Multiplication in group theory ✓ Formalized
Formalized: Lean core states a more general result (a definition).
So multiplying element a by element b could be notated as a ⋅ b or ab. Show all
Mul more general
class Mul : Type u → Type u
Init.Prelude · lines 1654–1656
Why more general: The class writes the product of two elements of one type as an infix term; Lean's symbol for it is an asterisk where the passage offers a dot or bare apposition of a and b.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 0ad23c54e538 · pair key a9f26c94db82.
HMul more general
class HMul : Type u → Type v → outParam (Type w) → Type (max (max u v) w)
Init.Prelude · lines 1505–1508
Why more general: Lean's heterogeneous class allows the two factors to come from different types and the product from a third; the passage keeps all three the same.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key cf567eb3b1c2 · pair key f7f6a557d130.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Multiplication in group theory ✕ Not formalized
When referring to a group via the indication of the set and operation, the dot is used. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 04fc5c611c9b). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Related, but states something else (2)
GrpCat related
structure GrpCat
Mathlib.Algebra.Category.Grp.Basic · lines 39–42
How it differs: This bundles a carrier together with its group structure as one object of a category, which is the closest the universe comes to naming a group by its set and its operation, but it fixes no symbol for that operation.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 091774f11e16 · pair key 0f10be372060.
Mul related
class Mul : Type u → Type u
Init.Prelude · lines 1654–1656
How it differs: It supplies the infix symbol for a type's multiplication, but it never addresses how a group is displayed alongside the set it is carried by.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 793f7f39f197 · pair key 29d337128cfd.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Multiplication in group theory ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
For example, our first example could be indicated by (ℚ/{0}, ⋅) . Show all
Rat. commGroupWithZero more general
instance Rat.commGroupWithZero : CommGroupWithZero ℚ
Mathlib.Algebra.Ring.Rat · lines 44–52
Why more general: Mathlib keeps the multiplicative structure of the rationals in the group-with-zero form, which packages the invertibility of every non-zero rational and adds that the operation commutes.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 515fbbeefbe5 · pair key aba04108394a.
Units. instGroup more general
instance Units.instGroup {α : Type u} [Monoid α] : Group αˣ
Mathlib.Algebra.Group.Units.Defs · lines 260–261
Why more general: The declaration is the general fact that invertible elements of a monoid form a group; at the rationals those elements are the non-zero ones.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 20465defd0c9 · pair key df6c0f706141.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Multiplication of different kinds of numbers ✓ Formalized
Formalized, by a community edit: Lean core states this up to a convention difference (a definition).
Integers N × M is the sum of N copies of M when N and M are positive whole numbers.Show all
Nat. mul close match
def Nat.mul : Nat → Nat → Nat
Init.Prelude · lines 1917–1919
Community Agent The pipeline said exact match ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
Why close, not exact: Nat.mul defines multiplication of natural numbers by repeated addition, but it recurses on the second factor: a times (b + 1) is a times b plus a. So a times b is b copies of a, while the passage takes N times M to be N copies of M. The two agree only by commutativity. The convention for which factor counts the copies is reversed, and Lean also covers zero.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 7fae79aa7bea · pair key d8ddc8667941.
List. sum_replicate_nat close match
theorem List.sum_replicate_nat {n a : Nat} : (List.replicate n a).sum = n * a
Init.Data.List.Nat.Sum · lines 38–39
Why close, not exact: Lean renders the sum of N copies of M as the sum of the list that repeats M N times, and states that this sum is the product of the two numbers.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 03a8e6c27551 · pair key f588219b8e54.
List. sum_const_nat close match
theorem List.sum_const_nat (m n : ℕ) : (List.replicate m n).sum = m * n
Mathlib.Algebra.BigOperators.Group.List.Basic · lines 385–386
Why close, not exact: Mathlib's version of the same equation writes the repeated summand as a list repeating M and equates its total with the product.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 124b144ea009 · pair key 4c1867989682.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Multiplication of different kinds of numbers ✓ Formalized
Formalized: Mathlib states a more general result (proved).
This gives the number of things in an array N wide and M high. Show all
Fintype. card_prod more general
theorem Fintype.card_prod (α : Type*) (β : Type*) [Fintype α] [Fintype β] : Fintype.card (α × β) = Fintype.card α * Fintype.card β
Mathlib.Data.Fintype.Prod · lines 56–58
Why more general: The lemma counts the pairs drawn from two finite types, and the cells of the passage's array are exactly such pairs.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 42962939f60a · pair key faaca1ec5562.
Finset. card_product more general
theorem Finset.card_product {α : Type*} {β : Type*} (s : Finset α) (t : Finset β) : (s ×ˢ t).card = s.card * t.card
Mathlib.Data.Finset.Prod · lines 141–142
Why more general: The lemma counts the pairs formed from two finite sets, which is the array laid out by its columns and rows.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 09594033c36c · pair key b9db4f3cce26.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Multiplication of different kinds of numbers ◔ Partial
Partial, by a community edit: Lean core states part of this (proved).
Generalization to negative numbers can be done by N × (−M ) = (−N ) × M = −(N × M ) and (−N ) × (−M ) = N × M The same sign rules apply to rational and real numbers. Show all
Int. mul_neg states part
theorem Int.mul_neg (a b : Int) : a * -b = -(a * b)
Init.Data.Int.Lemmas · lines 520–521
Community Agent The pipeline said more general ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
Why only part: The passage gives two rules for extending multiplication to negatives: N times (-M) equals -(N times M), and (-N) times M equals -(N times M). Int.mul_neg states the first rule, a * -b = -(a * b), for all integers. The second rule, a negative left factor, is the separate lemma Int.neg_mul. So this declaration states one clause of the passage.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key cca00494a5ca · pair key ebd540f57cc9.
Int. neg_mul_eq_mul_neg states part
theorem Int.neg_mul_eq_mul_neg (a b : Int) : -(a * b) = a * -b
Init.Data.Int.Lemmas · lines 512–513
Community Agent The pipeline said more general ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
Why only part: The passage gives two rules: N times (-M) equals -(N times M), and (-N) times M equals -(N times M). Int.neg_mul_eq_mul_neg states the first one with the sides swapped, -(a * b) = a * -b, for all integers. It says nothing about a negative left factor, which is Int.neg_mul_eq_neg_mul. So it states one clause of the passage.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key bbf1c08e24d1 · pair key 71a7217c8608.
mul_neg states part
theorem mul_neg {α : Type u} [Mul α] [HasDistribNeg α] (a b : α) : a * -b = -(a * b)
Mathlib.Algebra.Ring.Defs · lines 289–290
Community Agent The pipeline said more general ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
Why only part: mul_neg states a * -b = -(a * b) in any type whose negation distributes over multiplication, and the integers are one such type. That gives the passage's rule N times (-M) equals -(N times M). The passage's other rule, (-N) times M equals -(N times M), is the separate lemma neg_mul. So this declaration states one clause of the passage, in general form.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d6d68497c9d5 · pair key 12ae1d77d4b8.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Multiplication of different kinds of numbers ✓ Formalized
Formalized: Lean core states a more general result (proved).
Generalization to negative numbers can be done by N × (−M ) = (−N ) × M = −(N × M ) and (−N ) × (−M ) = N × M The same sign rules apply to rational and real numbers. Show all
Int. neg_mul_neg more general
theorem Int.neg_mul_neg (a b : Int) : -a * -b = a * b
Init.Data.Int.Lemmas · line 523
Why more general: Lean states the identity for all integer arguments, so it reaches beyond the whole numbers the passage negates to cases where the factors are already negative or zero.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 21c0a073dd0f · pair key 340923853b77.
neg_mul_neg more general
theorem neg_mul_neg {α : Type u} [Mul α] [HasDistribNeg α] (a b : α) : -a * -b = a * b
Mathlib.Algebra.Ring.Defs · line 292
Why more general: Mathlib states the identity for any type with a multiplication and a distributing negation, the integers among them.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b35100881ece · pair key c024a39275c1.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Multiplication of different kinds of numbers ◔ Partial
Partial: Lean core states part of this (proved).
Generalization to negative numbers can be done by N × (−M ) = (−N ) × M = −(N × M ) and (−N ) × (−M ) = N × M The same sign rules apply to rational and real numbers. Show all
Rat. mul_neg states part
theorem Rat.mul_neg (a b : Rat) : a * -b = -(a * b)
Init.Data.Rat.Lemmas · lines 486–488
Why only part: Stated for the rational numbers themselves, with no side condition on the two factors.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 161528f41c31 · pair key 4b0f2b7c78d6.
Rat. neg_mul states part
theorem Rat.neg_mul (a b : Rat) : -a * b = -(a * b)
Init.Data.Rat.Lemmas · lines 482–484
Why only part: The companion of the previous rule, also stated directly for rationals.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 64291fac8539 · pair key fc7a79d57b4d.
neg_mul_neg states part
theorem neg_mul_neg {α : Type u} [Mul α] [HasDistribNeg α] (a b : α) : -a * -b = a * b
Mathlib.Algebra.Ring.Defs · line 292
Why only part: Stated over any multiplicative carrier with distributive negation, which the rationals are.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 54f5a7e13eab · pair key 5f9fcca5ac9e.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Multiplication of different kinds of numbers ◔ Partial
Partial: Mathlib states part of this (proved).
Generalization to negative numbers can be done by N × (−M ) = (−N ) × M = −(N × M ) and (−N ) × (−M ) = N × M The same sign rules apply to rational and real numbers. Show all
mul_neg states part
theorem mul_neg {α : Type u} [Mul α] [HasDistribNeg α] (a b : α) : a * -b = -(a * b)
Mathlib.Algebra.Ring.Defs · lines 289–290
Why only part: Stated over any multiplicative carrier with distributive negation, which the reals are.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 11a52add4f16 · pair key e67de8061b02.
neg_mul states part
theorem neg_mul {α : Type u} [Mul α] [HasDistribNeg α] (a b : α) : -a * b = -(a * b)
Mathlib.Algebra.Ring.Defs · lines 285–286
Why only part: The companion rule for a negated left factor over the same carriers.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 30ff8b0d4630 · pair key debea0bfcd85.
neg_mul_neg states part
theorem neg_mul_neg {α : Type u} [Mul α] [HasDistribNeg α] (a b : α) : -a * -b = a * b
Mathlib.Algebra.Ring.Defs · line 292
Why only part: Stated over any multiplicative carrier with distributive negation, which the reals are.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e87911f4a671 · pair key b61a6f65f3ef.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Multiplication of different kinds of numbers ✓ Formalized
Formalized: Lean core states this up to a convention difference (a definition).
Rational numbers Generalization to fractions A B × C D is by multiplying the numerators and denominators, respectively: A B × C D = (A × C ) (B × D ) . Show all
Rat. mul close match
def Rat.mul : Rat → Rat → Rat
Init.Data.Rat.Basic · lines 168–183
Why close, not exact: Lean's definition of rational multiplication divides out the common factor of the numerator product and the denominator product, so the value comes back in lowest terms.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key ee5dc0dd6832 · pair key bc0b08f1e95a.
Rat. divInt_mul_divInt close match
theorem Rat.divInt_mul_divInt (n₁ n₂ : Int) {d₁ d₂ : Int} : Rat.divInt n₁ d₁ * Rat.divInt n₂ d₂ = Rat.divInt (n₁ * n₂) (d₁ * d₂)
Init.Data.Rat.Lemmas · lines 460–464
Why close, not exact: The lemma unfolds Lean's rational product at quotients of integers into the quotient of the product of numerators by the product of denominators.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key ea32a51cae1c · pair key f3952e578b78.
Rat. mul_eq_mkRat close match
theorem Rat.mul_eq_mkRat (q r : ℚ) : q * r = mkRat (q.num * r.num) (q.den * r.den)
Mathlib.Data.Rat.Defs · lines 110–111
Why close, not exact: Lean writes the product of two rationals as the fraction built from the product of the numerators over the product of the denominators, reduced by mkRat.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key dde5e00347ef · pair key cdaa3dcdfd1b.
div_mul_div_comm more general
theorem div_mul_div_comm {α : Type*} [DivisionCommMonoid α] (a b c d : α) : a / b * (c / d) = a * c / (b * d)
Mathlib.Algebra.Group.Basic · line 588
Why more general: Stated for any carrier with commutative division, of which the rationals are one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3875c1b4c461 · pair key 753a0ce81a65.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Multiplication of different kinds of numbers ◔ Partial
Partial: Mathlib states part of this (proved).
This gives the area of a rectangle A B high and C D wide, and is the same as the number of things in an array when the rational numbers happen to be whole numbers. Show all
Real. volume_Icc_pi_toReal states part
theorem Real.volume_Icc_pi_toReal {ι : Type*} [Fintype ι] {a b : ι → ℝ} : a ≤ b → (MeasureTheory.MeasureSpace.volume (Set.Icc a b)).toReal = ∏ i, (b i - a i)
Mathlib.MeasureTheory.Measure.Lebesgue.Basic · lines 241–243
Why only part: The passage's rectangle is the box between the zero corner and the corner given by the two side lengths.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ecce9b489e4e · pair key 664c36cf0cdf.
Finset. card_product states part
theorem Finset.card_product {α : Type*} {β : Type*} (s : Finset α) (t : Finset β) : (s ×ˢ t).card = s.card * t.card
Mathlib.Data.Finset.Prod · lines 141–142
Why only part: The array of the passage is the set of pairs drawn from a set of columns and a set of rows.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7a4854452796 · pair key 60a8e47dd620.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Multiplication of different kinds of numbers ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
Real numbers Real numbers and their products can be defined in terms of sequences of rational numbers. Show all
Real close match
structure Real
Mathlib.Basic.Real.Basic · lines 36–38
Why close, not exact: Lean's type of reals wraps a single field, an element of the Cauchy completion of the rationals for the rational absolute value, and the arithmetic it carries, the product among it, is that of the completion.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7b16b8b3e392 · pair key 9fe0c5c6dc6a.
Real. cauchy_mul close match
theorem Real.cauchy_mul (a b : ℝ) : (a * b).cauchy = a.cauchy * b.cauchy
Mathlib.Basic.Real.Basic · lines 150–151
Why close, not exact: The lemma unfolds the product of two reals into the product of the Cauchy-sequence classes that represent them.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 483a48073345 · pair key fc44ff2946fd.
Real. instMul close match
instance Real.instMul : Mul ℝ
Mathlib.Basic.Real.Basic · lines 106–107
Why close, not exact: Lean packages the product of reals as a type-class instance on the type built from rational Cauchy sequences.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 40ea496610aa · pair key c2b90926fdaf.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Multiplication of different kinds of numbers ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
Complex numbers Considering complex numbers z 1 and z 2 as ordered pairs of real numbers (a 1 , b 1 ) and (a 2 , b 2 ) , the product z 1 × z 2 is (a 1 × a 2 − b 1 × b 2 , a 1 × b 2 + a 2 × b 1 ) . Show all
Complex. instMul close match
instance Complex.instMul : Mul ℂ
Mathlib.Basic.Complex.Basic · lines 208–209
Why close, not exact: Lean packages the product as a type-class instance on a structure whose two real fields are the ordered pair of the passage.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key da081b0b2654 · pair key 7bc9b7866180.
Complex. mk_mul_mk close match
theorem Complex.mk_mul_mk (x₁ x₂ y₁ y₂ : ℝ) : { re := x₁, im := y₁ } * { re := x₂, im := y₂ } = { re := x₁ * x₂ - y₁ * y₂, im := x₁ * y₂ + y₁ * x₂ }
Mathlib.Basic.Complex.Basic · lines 211–212
Why close, not exact: The lemma unfolds the product of two complex numbers written by their real and imaginary parts into the pair of components.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1c8eebc68d13 · pair key cb029b4c40b5.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Multiplication of different kinds of numbers ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
This is the same as for reals a 1 × a 2 when the imaginary parts b 1 and b 2 are zero.Equivalently , denoting √−1 as i , z 1 × z 2 = (a 1 + b 1 i )(a 2 + b 2 i ) = (a 1 × a 2 ) + (a 1 × b 2 i ) + (b 1 × a 2 i ) + (b 1 × b 2 i 2 ) = (a 1 a 2 − b 1 b 2 ) + (a 1 b 2 + b 1 a 2 )i . … Show all
Complex. ofReal_mul close match
theorem Complex.ofReal_mul (r s : ℝ) : ↑(r * s) = ↑r * ↑s
Mathlib.Basic.Complex.Basic · lines 223–224
Why close, not exact: Lean states the agreement through the coercion of a real into the complex numbers, which sends a real to the complex number with that real part and imaginary part zero.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 5c4e2bc8909d · pair key 7fd0f960558d.
Complex. mk_mul_mk more general
theorem Complex.mk_mul_mk (x₁ x₂ y₁ y₂ : ℝ) : { re := x₁, im := y₁ } * { re := x₂, im := y₂ } = { re := x₁ * x₂ - y₁ * y₂, im := x₁ * y₂ + y₁ * x₂ }
Mathlib.Basic.Complex.Basic · lines 211–212
Why more general: Stated for arbitrary real and imaginary parts, of which the passage's case with vanishing imaginary parts is one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 17cbe5577bc6 · pair key 869cf8a749d5.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Multiplication of different kinds of numbers ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
This is the same as for reals a 1 × a 2 when the imaginary parts b 1 and b 2 are zero.Equivalently, denoting √−1 as i , z 1 × z 2 = (a 1 + b 1 i )(a 2 + b 2 i ) = (a 1 × a 2 ) + (a 1 × b 2 i ) + (b 1 × a 2 i ) + (b 1 × b 2 i 2 ) = (a 1 a 2 − b 1 b 2 ) + (a 1 b 2 + b 1 a 2 )i . [34] Alternatively , in trigonometric form, if z 1 = r 1 (cos ϕ 1 + i sin ϕ 1 ), z 2 = r 2 (cos ϕ 2 + i sin ϕ 2 ) , then z 1 z 2 = r 1 r 2 (cos(ϕ 1 + ϕ 2 ) + i sin(ϕ 1 + ϕ 2 )). … Show all
Complex. mk_mul_mk close match
theorem Complex.mk_mul_mk (x₁ x₂ y₁ y₂ : ℝ) : { re := x₁, im := y₁ } * { re := x₂, im := y₂ } = { re := x₁ * x₂ - y₁ * y₂, im := x₁ * y₂ + y₁ * x₂ }
Mathlib.Basic.Complex.Basic · lines 211–212
Why close, not exact: Lean names a complex number by its two real components rather than in the form a plus b i, and returns the product with real component a1a2 minus b1b2 and imaginary component a1b2 plus b1a2.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key fb541ca5a98a · pair key 57d3adb8f059.
Related, but states something else (1)
Complex. mk_eq_add_mul_I related
theorem Complex.mk_eq_add_mul_I (a b : ℝ) : { re := a, im := b } = ↑a + ↑b * Complex.I
Mathlib.Basic.Complex.Basic · lines 260–261
How it differs: It records that the complex number with parts a and b is a plus b times i, the change of notation the passage opens with, and states no product.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key fd8011250296 · pair key ea56638d5646.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Multiplication of different kinds of numbers ◔ Partial
Partial: Mathlib states a special case (proved).
…z 1 × z 2 = (a 1 + b 1 i )(a 2 + b 2 i ) = (a 1 × a 2 ) + (a 1 × b 2 i ) + (b 1 × a 2 i ) + (b 1 × b 2 i 2 ) = (a 1 a 2 − b 1 b 2 ) + (a 1 b 2 + b 1 a 2 )i . [34] Alternatively, in trigonometric form, if z 1 = r 1 (cos ϕ 1 + i sin ϕ 1 ), z 2 = r 2 (cos ϕ 2 + i sin ϕ 2 ) , then z 1 z 2 = r 1 r 2 (cos(ϕ 1 + ϕ 2 ) + i sin(ϕ 1 + ϕ 2 )). Show all
Circle. exp_add special case
theorem Circle.exp_add (x y : ℝ) : Circle.exp (x + y) = Circle.exp x * Circle.exp y
Mathlib.Analysis.Complex.Circle · lines 133–135
Why a special case: Circle.exp t names the complex number exp(t i), which Mathlib's definitions of cosine and sine expand to cos t + i sin t, and the declaration fixes each factor at modulus one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7311529081a1 · pair key 7e6e8c2787f2.
Related, but states something else (2)
Complex. exp_add related
theorem Complex.exp_add (x y : ℂ) : Complex.exp (x + y) = Complex.exp x * Complex.exp y
Mathlib.Analysis.Complex.Exponential · lines 112–131
How it differs: It gives the product rule for the complex exponential; turning that into the passage's cosine-and-sine form needs Euler's identity and a rearrangement of the two radii.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1c617c328caa · pair key aabda77d4292.
Complex. arg_mul_coe_angle related
theorem Complex.arg_mul_coe_angle {x y : ℂ} : x ≠ 0 → y ≠ 0 → ↑(x * y).arg = ↑x.arg + ↑y.arg
Mathlib.Analysis.SpecialFunctions.Complex.Arg · lines 488–496
How it differs: It says the angle of a product is the sum of the two angles, read modulo a full turn, and says nothing about the two radii or about the displayed product formula.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2b725640a23a · pair key 1990e2372388.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Multiplication of different kinds of numbers ✓ Formalized
Formalized: Lean core states a more general result (a definition).
A very general, and abstract, concept of multiplication is as the "multiplicatively denoted" (second) binary operation in a ring. Show all
Mul more general
class Mul : Type u → Type u
Init.Prelude · lines 1654–1656
Why more general: Lean's class carries the multiplicatively written binary operation for any carrier type, so it also covers carriers that are not rings.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key e9bbaac177de · pair key 349186ec978e.
Related, but states something else (1)
Ring related
class Ring : Type u → Type u
Mathlib.Algebra.Ring.Defs · line 146
How it differs: It declares the structure the passage names, with its two operations and their laws, rather than singling out the multiplicative one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e094d20876e6 · pair key e5bf0e19e9c5.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Multiplication of different kinds of numbers ◔ Partial
Partial: Mathlib states part of this (a definition).
An example of a ring that is not any of the number systems above is a polynomial ring (polynomials can be added and multiplied, but polynomials are not numbers in any usual sense). Show all
Polynomial. ring states part
instance Polynomial.ring {R : Type u} [Ring R] : Ring (R[X])
Mathlib.Algebra.Polynomial.Basic · lines 1108–1112
Why only part: It supplies the ring structure on polynomials; whether polynomials deserve to be called numbers is not something a declaration settles.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 8c23da555e4d · pair key a7b49ad913da.
Polynomial. commRing states part
instance Polynomial.commRing {R : Type u} [CommRing R] : CommRing (R[X])
Mathlib.Algebra.Polynomial.Basic · lines 1141–1144
Why only part: This is the commutative-coefficient form of the same structure; it likewise leaves the article's remark about number systems untouched.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d23cd8026e48 · pair key 8f075526d59b.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Multiplication of different kinds of numbers ✓ Formalized
Formalized: Mathlib states this exactly (proved).
Division Often division, x y , is the same as multiplication by an inverse, x (1 y ) . Show all
div_eq_mul_one_div exact match
theorem div_eq_mul_one_div {G : Type*} [DivInvMonoid G] (a b : G) : a / b = a * (1 / b)
Mathlib.Algebra.Group.Basic · line 344
Note: The declaration writes the reciprocal exactly as the passage does, as one divided by the second number.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 18d23c326087 · pair key fa2deec3446b.
div_eq_mul_inv exact match
theorem div_eq_mul_inv {G : Type*} [DivInvMonoid G] (a b : G) : a / b = a * b⁻¹
Mathlib.Algebra.Group.DivInvMonoid · lines 242–243
Note: Lean writes the reciprocal of the divisor with an inverse symbol where the passage writes it as one over the divisor, the same element.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9cd604e666c9 · pair key 947780825bf0.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Multiplication of different kinds of numbers ◔ Partial
Partial: Lean core states part of this (a definition).
Multiplication for some types of "numbers" may have corresponding division, without inverses ; in an integral domain x may have no inverse " 1 x " but x y may be defined. Show all
Nat. div states part
def Nat.div : Nat → Nat → Nat
Init.Prelude · lines 2315–2326
Why only part: It defines the quotient of two naturals, discarding a remainder and returning zero for a zero divisor; it says nothing by itself about inverses.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 3dbda327cb4b · pair key a5d971f477b1.
Nat. isUnit_iff states part
theorem Nat.isUnit_iff {n : ℕ} : IsUnit n ↔ n = 1
Mathlib.Algebra.Group.Nat.Units · line 38
Why only part: It characterises the invertible naturals as the single number one, which settles that inverses are missing for every other natural.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 78edf33a1fe7 · pair key 14ef7aaca535.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Multiplication of different kinds of numbers ◔ Partial
Partial: Mathlib states part of this (proved).
Multiplication for some types of "numbers" may have corresponding division, without inverses; in an integral domain x may have no inverse " 1 x " but x y may be defined. Show all
Int. isUnit_iff states part
theorem Int.isUnit_iff {u : ℤ} : IsUnit u ↔ u = 1 ∨ u = -1
Mathlib.Algebra.Group.Int.Units · lines 45–49
Why only part: It pins down the invertible integers as exactly two of them, which gives the missing reciprocal the passage speaks of inside an integral domain.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 19c1ab6e2055 · pair key 1f1186b49882.
Int. instDiv states part
instance Int.instDiv : Div Int
Init.Data.Int.DivMod.Basic · lines 111–112
Why only part: It equips the integers with a quotient using the Euclidean rounding convention, which is defined for every pair of integers.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key bbc9f85b89be · pair key 170f19b366b0.
Related, but states something else (1)
EuclideanDomain. mul_div_cancel' related
theorem EuclideanDomain.mul_div_cancel' {R : Type u} [EuclideanDomain R] {a b : R} : b ≠ 0 → b ∣ a → b * (a / b) = a
Mathlib.Algebra.EuclideanDomain.Basic · lines 101–102
How it differs: It shows the quotient behaving as exact division in a domain whose divisor need not be invertible.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. 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-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 5d07d6ea2a7c · pair key d189db0e63a2.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Multiplication of different kinds of numbers ◔ Partial
Partial: Mathlib states part of this (proved).
In a division ring there are inverses, but x y may be ambiguous in non-commutative rings since x (1 y ) need not be the same as (1 y )x .[41] [citation needed] Show all
mul_inv_cancel₀ states part
theorem mul_inv_cancel₀ {G₀ : Type u} [GroupWithZero G₀] {a : G₀} : a ≠ 0 → a * a⁻¹ = 1
Mathlib.Algebra.GroupWithZero.Defs · line 228
Why only part: The further remark about a quotient being ambiguous when multiplication does not commute is a separate claim this equation does not address.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 59ced9b57b12 · pair key c443360f055c.
inv_mul_cancel₀ states part
theorem inv_mul_cancel₀ {G₀ : Type*} [GroupWithZero G₀] {a : G₀} : a ≠ 0 → a⁻¹ * a = 1
Mathlib.Algebra.GroupWithZero.NeZero · lines 52–56
Why only part: It records the inverse acting from the left, which matters precisely because multiplication here need not commute.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a3c6bda57b10 · pair key 291f3617c635.
Related, but states something else (1)
DivisionRing related
class DivisionRing : Type u_2 → Type u_2
Mathlib.Algebra.Field.Defs · lines 116–153
How it differs: It declares the structure the passage names, with inverses for nonzero elements built into its data and laws.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e6dfc5538012 · pair key 6b852b79aeff.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Multiplication of different kinds of numbers ✕ Not formalized
In a division ring there are inverses, but x y may be ambiguous in non-commutative rings since x (1 y ) need not be the same as (1 y )x .[41] [citation needed]Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 3 candidates examined (receipt c52aad301027). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗