-
Definition · Subject of the article
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted i, called the imaginary unit and satisfying the equation i2 = −1 ; because no real number satisfies the above equation, i was called an imaginary number by René Descartes.
Show in article · Read it in context on Wikipedia ↗
Complex close match
structure Complex
Mathlib.Basic.Complex.Basic · lines 35–39
Why close, not exact: Mathlib realises the same number system as a structure with a real component and an imaginary one, instead of adjoining a symbol to the reals, and its element Complex.I is the imaginary unit whose square is minus 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
0955d0bd0b47 · pair key 957aaa0fe1a9.
Related, but states something else
Complex.I_sq related
theorem Complex.I_sq : Complex.I ^ 2 = -1
Mathlib.Basic.Complex.Basic · line 626
How it differs: It records the equation obeyed by the imaginary unit that the passage quotes, while saying nothing about what the number system is.
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
8d71e2f6d0c7 · pair key 3779a48d1847.
Sign in to tag this passage
-
Theorem · supporting
✓Formalized
Formalized: Mathlib states a more general result (proved).
In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted i, called the imaginary unit and satisfying the equation i2 = −1; because no real number satisfies the above equation, i was called an imaginary number by René Descartes.
Show in article · Read it in context on Wikipedia ↗
Real.isSquare_iff more general
theorem Real.isSquare_iff {x : ℝ} : IsSquare x ↔ 0 ≤ x
Mathlib.Analysis.Real.Sqrt · lines 302–303
Why more general: Being a square in Mathlib's sense is the existence of a real whose product with itself is the number, which is the passage's equation read the other way round.
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
0f3c5d0ffba0 · pair key bf42db81690d.
TauCeti.instFactNotIsSquareNegOfNat_tauCeti more general
instance TauCeti.instFactNotIsSquareNegOfNat_tauCeti {R : Type*} [AddGroup R] [One R] [Mul R] [IsSemireal R] : Fact ¬IsSquare (-1)
TauCeti.Algebra.Ring.Semireal · lines 22–24
Why more general: The claim is supplied as a Fact instance over any semireal ring, and the reals reach that hypothesis through the ordered-ring instance chain.
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
1ba68583e18d · pair key 38ff61e0ba32.
Related, but states something else
sq_nonneg related
theorem sq_nonneg {R : Type u} [Semiring R] [LinearOrder R] [ExistsAddOfLE R] [PosMulMono R] [AddLeftMono R] (a : R) : 0 ≤ a ^ 2
Mathlib.Algebra.Order.Ring.Unbundled.Basic · lines 608–618
Community Agent The pipeline said more general; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
How it differs: sq_nonneg says every square in a linearly ordered semiring is nonnegative. That is the usual reason no real number squares to -1, but the lemma does not state that claim: you still have to compare with -1 < 0. It is an ingredient of the proof, not a statement 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 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
f7dd4ef680e0 · pair key a5d2f9e622c8.
Sign in to tag this passage
-
Theorem · main statement
✓Formalized
Formalized: Mathlib states this exactly (proved).
Every complex number can be expressed in the form a + bi, where a and b are real numbers, a is called the real part, and b is called the imaginary part.
Show in article · Read it in context on Wikipedia ↗
Complex.re_add_im exact match
theorem Complex.re_add_im (z : ℂ) : ↑z.re + ↑z.im * Complex.I = z
Mathlib.Basic.Complex.Basic · lines 264–265
Note: Mathlib supplies the two real numbers as the components z.re and z.im of the number, which the passage calls its real and imaginary parts.
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
364f845c20fe · pair key 44360941bffc.
Related, but states something else
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 runs the other way, saying that the number built from two reals has the written form, so on its own it does not reach an arbitrary complex 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 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
f268a97d793c · pair key 186c82298d5e.
Sign in to tag this passage
-
Notation · supporting
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
The set of complex numbers is denoted by either of the symbols ℂ or C.
Show in article · Read it in context on Wikipedia ↗
Complex close match
structure Complex
Mathlib.Basic.Complex.Basic · lines 35–39
Why close, not exact: Mathlib writes this type with the blackboard-bold symbol the passage lists first, and treats the collection of complex numbers as a type rather than as a 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
d60ad7047f53 · pair key 87ad3a0aace3.
Sign in to tag this passage
-
Theorem · main statement
✓Formalized
Formalized: Mathlib states this exactly (proved).
Complex numbers allow solutions to all polynomial equations, even those that have no solutions in real numbers.
Show in article · Read it in context on Wikipedia ↗
Complex.exists_root exact match
theorem Complex.exists_root {f : ℂ[X]} : 0 < f.degree → ∃ z, f.IsRoot z
Mathlib.Analysis.Complex.Polynomial.Basic · lines 37–48
Note: Lean's positive-degree hypothesis is the condition that an unknown is actually present in the equation, and the solution it produces is a complex number, so equations with no real solution are covered as well.
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
0407e7ed8611 · pair key acac4d3cb1ba.
Complex.isAlgClosed close match
instance Complex.isAlgClosed : IsAlgClosed ℂ
Mathlib.Analysis.Complex.Polynomial.Basic · lines 52–53
Why close, not exact: Mathlib phrases the claim as the typeclass saying every polynomial over the complex numbers splits there, which is the same assertion written through splitting.
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
8e48dc9c41ad · pair key e5ad70377947.
Related, but states something else
IsAlgClosed.exists_root related
theorem IsAlgClosed.exists_root {k : Type u} [Field k] [IsAlgClosed k] (p : k[X]) : p.degree ≠ 0 → ∃ x, p.IsRoot x
Mathlib.FieldTheory.IsAlgClosed.Basic · lines 79–80
How it differs: Stated for an arbitrary algebraically closed field, which the complex numbers are by the instance Mathlib proves.
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
3dfb8e2. - Location key
6728995066dc · pair key a86c66c2bc75.
Sign in to tag this passage
-
Theorem · main statement
✓Formalized
Formalized: Mathlib states this exactly (proved).
More precisely, the fundamental theorem of algebra asserts that every non-constant polynomial equation with real or complex coefficients has a solution which is a complex number.
Show in article · Read it in context on Wikipedia ↗
Complex.exists_root exact match
theorem Complex.exists_root {f : ℂ[X]} : 0 < f.degree → ∃ z, f.IsRoot z
Mathlib.Analysis.Complex.Polynomial.Basic · lines 37–48
Note: Lean quantifies over polynomials whose coefficients lie in the complex numbers, and coefficients that happen to be real are complex numbers, so both coefficient fields the passage lists are covered; its docstring names the theorem as the passage 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
c287e913f16c · pair key afb0cd3ad9c7.
Complex.isAlgClosed close match
instance Complex.isAlgClosed : IsAlgClosed ℂ
Mathlib.Analysis.Complex.Polynomial.Basic · lines 52–53
Why close, not exact: Mathlib carries the same theorem as the typeclass asserting that polynomials over the complex numbers split, and its docstring names it as the passage 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 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
cb226f844309 · pair key 054c298290e9.
Related, but states something else
IsAlgClosed.exists_root related
theorem IsAlgClosed.exists_root {k : Type u} [Field k] [IsAlgClosed k] (p : k[X]) : p.degree ≠ 0 → ∃ x, p.IsRoot x
Mathlib.FieldTheory.IsAlgClosed.Basic · lines 79–80
How it differs: Stated for an arbitrary algebraically closed field rather than for the complex 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 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
3dfb8e2. - Location key
f7c351857902 · pair key a0e685cd9797.
Sign in to tag this passage
-
Example · supporting
✓Formalized
Formalized: Mathlib states a more general result (proved).
For example, the equation (x + 1)2 = −9 has no real solution, because the square of a real number cannot be negative, but has the two nonreal complex solutions x = −1 + 3i and x = −1 − 3i.
Show in article · Read it in context on Wikipedia ↗
Real.isSquare_iff more general
theorem Real.isSquare_iff {x : ℝ} : IsSquare x ↔ 0 ≤ x
Mathlib.Analysis.Real.Sqrt · lines 302–303
Why more general: Being a square in Mathlib's sense is exactly having a real whose product with itself is the number, which a solution of the passage's equation would provide.
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
fabc5ee229f8 · pair key 842118f261c7.
Related, but states something else
sq_nonneg related
theorem sq_nonneg {R : Type u} [Semiring R] [LinearOrder R] [ExistsAddOfLE R] [PosMulMono R] [AddLeftMono R] (a : R) : 0 ≤ a ^ 2
Mathlib.Algebra.Order.Ring.Unbundled.Basic · lines 608–618
Community Agent The pipeline said more general; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
How it differs: sq_nonneg says every square in an ordered semiring is nonnegative. That is the reason (x+1)^2 = -9 has no real solution, but the lemma does not state it: you still have to compare with -9 < 0. It is an ingredient of the argument, not a statement 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
3dfb8e2. - Location key
2f2496aaaadb · pair key 994d1dee8365.
Sign in to tag this passage
-
Theorem · supporting
✓Formalized
Formalized: Mathlib states a more general result (proved).
For example, the equation (x + 1)2 = −9 has no real solution, because the square of a real number cannot be negative, but has the two nonreal complex solutions x = −1 + 3i and x = −1 − 3i.
Show in article · Read it in context on Wikipedia ↗
Real.isSquare_iff more general
theorem Real.isSquare_iff {x : ℝ} : IsSquare x ↔ 0 ≤ x
Mathlib.Analysis.Real.Sqrt · lines 302–303
Why more general: Reading a square as the product of the number with itself makes it a square in Mathlib's sense, and the equivalence then fixes its 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
9396ff955da8 · pair key b9c93df045a7.
sq_nonneg more general
theorem sq_nonneg {R : Type u} [Semiring R] [LinearOrder R] [ExistsAddOfLE R] [PosMulMono R] [AddLeftMono R] (a : R) : 0 ≤ a ^ 2
Mathlib.Algebra.Order.Ring.Unbundled.Basic · lines 608–618
Why more general: Stated for an arbitrary linearly ordered semiring with the usual monotonicity instances rather than for the reals 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
9b152e942b62 · pair key e0c640f64f2e.
mul_self_nonneg more general
theorem mul_self_nonneg {R : Type u} [Semiring R] [LinearOrder R] [ExistsAddOfLE R] [PosMulMono R] [AddLeftMono R] (a : R) : 0 ≤ a * a
Mathlib.Algebra.Order.Ring.Unbundled.Basic · lines 630–631
Why more general: It writes the square as a product of the element with itself rather than through the power 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 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
c762818f71e7 · pair key d4c688844870.
Int.sq_nonneg special case
theorem Int.sq_nonneg (m : Int) : 0 ≤ m ^ 2
Init.Data.Int.Pow · lines 121–125
Why a special case: Stated only for integer values, so it covers part of the range of the passage's 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 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
c1c44026e2e9 · pair key 54e8330f94cd.
Sign in to tag this passage
-
Example · supporting
✕Not formalized
For example, the equation (x + 1)2 = −9 has no real solution, because the square of a real number cannot be negative, but has the two nonreal complex solutions x = −1 + 3i and x = −1 − 3i.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 5 queries and 4 candidates examined (receipt 2705109c8458). - 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
-
Definition · main statement
◔Partial
Partial: Mathlib states part of this (a definition).
Addition, subtraction and multiplication of complex numbers are defined, taking advantage of the rule i2 = −1, along with the associative, commutative, and distributive laws.
Show in article · Read it in context on Wikipedia ↗
Complex.instMul states part
instance Complex.instMul : Mul ℂ
Mathlib.Basic.Complex.Basic · lines 208–209
Why only part: Mathlib defines the product by the real and imaginary coordinates that the rule for the imaginary unit forces.
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
929374394606 · pair key 2ca4b3f0879a.
Complex.instAdd states part
instance Complex.instAdd : Add ℂ
Mathlib.Basic.Complex.Basic · lines 166–167
Why only part: Addition is given coordinatewise on the real and imaginary parts.
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
d80c23c6f89a · pair key e2ee9cdd3d68.
Complex.instSub states part
instance Complex.instSub : Sub ℂ
Mathlib.Basic.Complex.Basic · lines 196–197
Why only part: Subtraction is likewise given coordinatewise on the two parts.
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
f6b0036a4187 · pair key 321fa72a5760.
Complex.I_sq states part
theorem Complex.I_sq : Complex.I ^ 2 = -1
Mathlib.Basic.Complex.Basic · line 626
Why only part: This is the arithmetic rule the passage says the operations are built on.
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
b3924b42bf4b · pair key 38869838129a.
Complex.instField states part
instance Complex.instField : Field ℂ
Mathlib.Basic.Complex.Basic · lines 712–720
Why only part: Mathlib bundles those laws, together with inverses, into one field structure on the complex 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 5 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
6f9756dc928a · pair key e546b1cb119c.
Sign in to tag this passage
-
Theorem · main statement
✓Formalized
Formalized: Mathlib states this exactly (proved).
Every nonzero complex number has a multiplicative inverse, allowing division by complex numbers other than zero.
Show in article · Read it in context on Wikipedia ↗
Complex.mul_inv_cancel exact match
theorem Complex.mul_inv_cancel {z : ℂ} : z ≠ 0 → z * z⁻¹ = 1
Mathlib.Basic.Complex.Basic · lines 698–700
Note: The hypothesis confines the equation to nonzero numbers, so no value outside the passage's domain is involved.
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
d78721b48166 · pair key 5723381659f4.
Complex.instField more general
instance Complex.instField : Field ℂ
Mathlib.Basic.Complex.Basic · lines 712–720
Why more general: A field structure carries inverses of nonzero elements and the division they give, along with all the ring 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, 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
3243f9f62a40 · pair key 6f2686a5b4a6.
Related, but states something else
Complex.inv_def related
theorem Complex.inv_def (z : ℂ) : z⁻¹ = (starRingEnd ℂ) z * ↑(Complex.normSq z)⁻¹
Mathlib.Basic.Complex.Basic · lines 682–683
How it differs: It unfolds the inverse into conjugate over squared modulus, a formula the passage does not give 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 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
6989e7b9e33c · pair key c2ddf662fe55.
Sign in to tag this passage
-
Theorem · main statement
◔Partial
Partial: Mathlib states part of this (a definition).
This makes the complex numbers a field with the real numbers as a subfield.
Show in article · Read it in context on Wikipedia ↗
Complex.instField states part
instance Complex.instField : Field ℂ
Mathlib.Basic.Complex.Basic · lines 712–720
Why only part: This is Mathlib's field structure on the complex 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, 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
3af6d77ba417 · pair key f6fe1b1a9042.
Related, but states something else
Complex.ofRealHom related
def Complex.ofRealHom : ℝ →+* ℂ
Mathlib.Basic.Complex.Basic · lines 593–598
How it differs: A ring homomorphism out of the real field into a nonzero ring has image a copy of the reals closed under the operations.
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
d7941355cace · pair key 40c4ea3ae80b.
Complex.ofReal_injective related
theorem Complex.ofReal_injective : Function.Injective Complex.ofReal
Mathlib.Basic.Complex.Basic · line 103
How it differs: It states injectivity of the coercion from the reals, a fact supporting the embedding rather 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, 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
2b1b0df60605 · pair key fc2ab63c4dd7.
Sign in to tag this passage
-
Notation · supporting
✓Formalized
Formalized: Mathlib states a more general result (a definition).
Because of these properties, a + bi = a + ib , and which form is written depends upon convention and style considerations.
Show in article · Read it in context on Wikipedia ↗
Complex.instCommSemiring more general
instance Complex.instCommSemiring : CommSemiring ℂ
Mathlib.Basic.Complex.Basic · lines 405–406
Why more general: This structure asserts that multiplication of complex numbers commutes, among the other semiring 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 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
1eba647baa4c · pair key 87cfe2a86f42.
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 commutativity for any type with a commuting multiplication, the complex numbers 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, 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
a1bf5811d165 · pair key b27a0a2e97da.
Sign in to tag this passage
-
Theorem · main statement
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
The complex numbers also form a real vector space of dimension two, with {1, i} as a standard basis.
Show in article · Read it in context on Wikipedia ↗
Complex.basisOneI close match
def Complex.basisOneI : Module.Basis (Fin 2) ℝ ℂ
Mathlib.LinearAlgebra.Complex.Module · lines 143–152
Why close, not exact: Mathlib packages the basis as a family indexed by a two-element type whose values are one and the imaginary unit, rather than as the set the passage 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 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
901a10c2095e · pair key 8d34363b123d.
Complex.finrank_real_complex states part
theorem Complex.finrank_real_complex : Module.finrank ℝ ℂ = 2
Mathlib.LinearAlgebra.Complex.FiniteDimensional · lines 31–32
Why only part: This gives the dimension the passage names without naming the basis.
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
20663ad5e890 · pair key 471325757b46.
Related, but states something else
Complex.coe_basisOneI related
theorem Complex.coe_basisOneI : ⇑Complex.basisOneI = ![1, Complex.I]
Mathlib.LinearAlgebra.Complex.Module · lines 159–163
How it differs: It spells out the two values of the bundled basis, a lemma about that definition.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 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
0dc951042002 · pair key 73f32984ac78.
Sign in to tag this passage
-
Definition · supporting
✓Formalized
Formalized: Mathlib states this exactly (a definition).
This standard basis makes the complex numbers a Cartesian plane, called the complex plane.
Show in article · Read it in context on Wikipedia ↗
Complex.equivRealProdLm exact match
def Complex.equivRealProdLm : ℂ ≃ₗ[ℝ] ℝ × ℝ
Mathlib.LinearAlgebra.Complex.Module · lines 277–279
Note: Mathlib writes the Cartesian plane as the product of two copies of the real line and the identification as a real-linear equivalence onto 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
6708f68b3ca8 · pair key 9e6034182e0f.
Complex.equivRealProdCLM more general
def Complex.equivRealProdCLM : ℂ ≃L[ℝ] ℝ × ℝ
Mathlib.Analysis.Complex.Basic · lines 134–136
Why more general: This version adds that the identification and its inverse are continuous, which the passage does not claim.
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
b9eb0cf9ca93 · pair key 875ec4afcc25.
Complex.equivRealProd states part
def Complex.equivRealProd : ℂ ≃ ℝ × ℝ
Mathlib.Basic.Complex.Basic · lines 52–54
Why only part: It records the underlying bijection alone, without the linear structure of the plane.
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
965908bfd216 · pair key c0fadaf1a9a4.
Sign in to tag this passage
-
Theorem · supporting
✕Not formalized
For example, the real numbers form the real line, which is pictured as the horizontal axis of the complex plane, while real multiples of i are the vertical axis.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 5 queries and 5 candidates examined (receipt dac6999d4d97). - 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
-
Definition · main statement
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
A complex number can also be defined by its geometric polar coordinates: the radius is called the absolute value of the complex number, while the angle from the positive real axis is called the argument of the complex number.
Show in article · Read it in context on Wikipedia ↗
Complex.polarCoord_apply close match
theorem Complex.polarCoord_apply (a : ℂ) : ↑Complex.polarCoord a = (‖a‖, a.arg)
Mathlib.Analysis.SpecialFunctions.PolarCoord · lines 187–190
Why close, not exact: Mathlib writes the absolute value with norm bars and reads the polar pair off its coordinate map for the complex plane.
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
1c734a01f05e · pair key 7a38f56bfda2.
Complex.polarCoord close match
def Complex.polarCoord : OpenPartialHomeomorph ℂ (ℝ × ℝ)
Mathlib.Analysis.SpecialFunctions.PolarCoord · lines 184–185
Why close, not exact: Mathlib packages the polar coordinate assignment together with its inverse and the two open sets on which the pair are mutually continuous.
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
4792ab31964a · pair key 737c7964f6a6.
Complex.norm_mul_cos_add_sin_mul_I close match
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
Why close, not exact: Mathlib writes the recovery of a complex number from modulus and argument through cosine and sine instead of naming the coordinate pair.
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
106d36e91520 · pair key 17d176abc919.
Sign in to tag this passage
-
Theorem · supporting
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
The complex numbers of absolute value one form the unit circle.
Show in article · Read it in context on Wikipedia ↗
Circle close match
def Circle : Type
Mathlib.Analysis.Complex.Circle · lines 53–54
Why close, not exact: Mathlib wraps the complex numbers of norm one into a type carrying the multiplicative structure, and names that type the unit circle.
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
d5c3e8d2cf38 · pair key f4296abf30f3.
mem_sphere_zero_iff_norm more general
theorem mem_sphere_zero_iff_norm {E : Type*} [SeminormedAddGroup E] {a : E} {r : ℝ} : a ∈ Metric.sphere 0 r ↔ ‖a‖ = r
Mathlib.Analysis.Normed.Group.Basic · line 306
Why more general: The equivalence is stated for an arbitrary seminormed additive group and an arbitrary radius, and the passage's case is radius one in the plane.
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
0ee309290c2d · pair key 3c50ef2c36f2.
Submonoid.coe_unitSphere more general
theorem Submonoid.coe_unitSphere (𝕜 : Type*) [SeminormedRing 𝕜] [NormMulClass 𝕜] [NormOneClass 𝕜] : ↑(Submonoid.unitSphere 𝕜) = Metric.sphere 0 1
Mathlib.Analysis.Normed.Field.UnitBall · line 185
Why more general: The identity is stated for any seminormed ring with a multiplicative norm, the complex numbers 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 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
dedb120b96fb · pair key 4fbaba137aef.
Circle.norm_coe states part
theorem Circle.norm_coe (z : Circle) : ‖↑z‖ = 1
Mathlib.Analysis.Complex.Circle · line 73
Why only part: It gives one inclusion of the passage's identification, from the circle to the numbers of 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 4 for this passage, high confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
405d60a62a3e · pair key 7c5e9020b2d3.
Sign in to tag this passage
-
Theorem · supporting
✓Formalized
Formalized: Mathlib states a more general result (a definition).
Adding a fixed complex number to all complex numbers defines a translation in the complex plane, and multiplying by a fixed complex number is a similarity centered at the origin (dilating by the absolute value, and rotating by the argument).
Show in article · Read it in context on Wikipedia ↗
AffineIsometryEquiv.constVAdd more general
def AffineIsometryEquiv.constVAdd (𝕜 : Type*) {V : Type*} (P : Type*) [NormedField 𝕜] [SeminormedAddCommGroup V] [NormedSpace 𝕜 V] [PseudoMetricSpace P] [NormedAddTorsor V P] : V → P ≃ᵃⁱ[𝕜] P
Mathlib.Analysis.Normed.Affine.Isometry · lines 753–754
Why more general: Mathlib builds translation by a vector for any normed real affine space, the complex plane being one of them.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, 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
3f02bca3da54 · pair key fd8b1f00e3c2.
IsometryEquiv.addRight more general
def IsometryEquiv.addRight {G : Type v} [AddGroup G] [PseudoEMetricSpace G] [IsIsometricVAdd Gᵃᵒᵖ G] : G → G ≃ᵢ G
Mathlib.Topology.MetricSpace.IsometricSMul · line 156
Why more general: Mathlib states adding a fixed element as a distance-preserving equivalence for any additive group with isometric addition.
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
43b20b665775 · pair key bd128cb7e5ce.
AffineEquiv.constVAdd more general
def AffineEquiv.constVAdd (k : Type*) (P₁ : Type*) {V₁ : Type*} [Ring k] [AddCommGroup V₁] [_root_.Module k V₁] [AddTorsor V₁ P₁] : V₁ → P₁ ≃ᵃ[k] P₁
Mathlib.LinearAlgebra.AffineSpace.AffineEquiv · lines 462–465
Why more general: Mathlib presents shifting by a vector as an affine automorphism for any affine space over a ring.
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
0768cd349a67 · pair key 9fe3dedd300b.
Sign in to tag this passage
-
Theorem · supporting
◔Partial
Partial: Mathlib states a special case (a definition).
Adding a fixed complex number to all complex numbers defines a translation in the complex plane, and multiplying by a fixed complex number is a similarity centered at the origin (dilating by the absolute value, and rotating by the argument).
Show in article · Read it in context on Wikipedia ↗
rotation special case
def rotation : Circle →* ℂ ≃ₗᵢ[ℝ] ℂ
Mathlib.Analysis.Complex.Isometry · lines 50–56
Why a special case: The multiplier is restricted to modulus one, the case of the passage where the scaling factor is one and only the turning remains.
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
15f76099ba07 · pair key b5724a74d005.
DilationEquiv.mulLeft states part
def DilationEquiv.mulLeft {α : Type*} [NormedDivisionRing α] (a : α) : a ≠ 0 → α ≃ᵈ α
Mathlib.Analysis.Normed.Field.Lemmas · lines 43–45
Why only part: It gives the similarity property of multiplication without naming the scaling factor or the turning angle.
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
b000b61914e7 · pair key 97a68a14dd83.
Related, but states something else
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 characterises when the argument of a product is the sum of the arguments, under the principal-range condition, rather than describing the map of the plane.
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
95590e923fa8 · pair key afbb25b65b5f.
Sign in to tag this passage
-
Theorem · supporting
✓Formalized
Formalized: Mathlib states a more general result (proved).
The operation of complex conjugation is the reflection symmetry with respect to the real axis.
Show in article · Read it in context on Wikipedia ↗
RCLike.conj_eq_re_sub_im more general
theorem RCLike.conj_eq_re_sub_im {K : Type*} [RCLike K] (z : K) : (starRingEnd K) z = ↑(RCLike.re z) - ↑(RCLike.im z) * RCLike.I
Mathlib.Analysis.RCLike.Basic · lines 327–329
Why more general: The identity is stated for either of the two fields Mathlib treats together, and the complex numbers are one of them.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
062fc3e960a9 · pair key b418b6554acb.
Complex.conj_im states part
theorem Complex.conj_im (z : ℂ) : ((starRingEnd ℂ) z).im = -z.im
Mathlib.Basic.Complex.Basic · lines 470–471
Why only part: It gives the second coordinate of the image and says nothing about 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 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
02fe9ca7ab70 · pair key cac1da464771.
Complex.conj_re states part
theorem Complex.conj_re (z : ℂ) : ((starRingEnd ℂ) z).re = z.re
Mathlib.Basic.Complex.Basic · lines 466–467
Why only part: It gives the first coordinate of the image and says nothing about the second.
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
b17c533993ba · pair key b3201a2176c4.
Complex.conjLIE states part
def Complex.conjLIE : ℂ ≃ₗᵢ[ℝ] ℂ
Mathlib.Analysis.Complex.Basic · lines 205–206
Why only part: It bundles conjugation as a real-linear isometric equivalence without locating the fixed line.
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. - 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
47c37c9a63c3 · pair key e681cae12aa0.
Sign in to tag this passage
-
Theorem · main statement
✓Formalized
Formalized by 3 parts together (more general):
Complex.isAlgClosed Mathlib (proved)- the complex numbers are an algebraically closed field
Complex.instAlgebraOfReal Mathlib (definition)- the complex numbers are a commutative algebra over the reals
Complex.orthonormalBasisOneI Mathlib (definition)- the complex numbers are a Euclidean vector space of dimension two
The complex numbers form a rich structure that is simultaneously an algebraically closed field, a commutative algebra over the reals, and a Euclidean vector space of dimension two.
Show in article · Read it in context on Wikipedia ↗
Complex.isAlgClosed states part
instance Complex.isAlgClosed : IsAlgClosed ℂ
Mathlib.Analysis.Complex.Polynomial.Basic · lines 52–53
Why only part: Mathlib registers algebraic closedness of the complex field as an 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 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
c8d138e5b831 · pair key e9db503b9a6b.
Complex.instAlgebraOfReal states part
instance Complex.instAlgebraOfReal {R : Type*} [CommSemiring R] [Algebra R ℝ] : Algebra R ℂ
Mathlib.LinearAlgebra.Complex.Module · lines 101–104
Why only part: Mathlib builds the algebra structure on the complex numbers for any base whose scalars already act on the reals, the reals themselves 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, 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
dd822005f20a · pair key 6bc1dc464a5d.
Complex.orthonormalBasisOneI states part
def Complex.orthonormalBasisOneI : OrthonormalBasis (Fin 2) ℝ ℂ
Mathlib.Analysis.InnerProductSpace.PiL2 · lines 853–857
Why only part: Mathlib records the two real directions by indexing an orthonormal basis with a two-element type rather than by a separate dimension count.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 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
6cdd93f18480 · pair key 3cd49157a286.
Complex.finrank_real_complex states part
theorem Complex.finrank_real_complex : Module.finrank ℝ ℂ = 2
Mathlib.LinearAlgebra.Complex.FiniteDimensional · lines 31–32
Why only part: It gives the dimension count alone, with no inner product structure attached.
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
2ac4ed4275a7 · pair key c555b00e0661.
Sign in to tag this passage
-
Definition · main statement · Definition and basic operations
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
A complex number is an expression of the form a + bi, where a and b are real numbers, and i is an abstract symbol, the so-called imaginary unit, whose meaning will be explained further below.
Show in article · Read it in context on Wikipedia ↗
Complex close match
structure Complex
Mathlib.Basic.Complex.Basic · lines 35–39
Why close, not exact: Mathlib stores a complex number as its pair of real coordinates instead of as a written sum with a symbol.
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
4955ba263c71 · pair key a1cfd999c4a3.
Complex.mk_eq_add_mul_I close match
theorem Complex.mk_eq_add_mul_I (a b : ℝ) : { re := a, im := b } = ↑a + ↑b * Complex.I
Mathlib.Basic.Complex.Basic · lines 260–261
Why close, not exact: Mathlib shows its stored pair of real coordinates equals the written sum with the imaginary unit.
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
e79adc61720f · pair key cb0808b97158.
Complex.re_add_im close match
theorem Complex.re_add_im (z : ℂ) : ↑z.re + ↑z.im * Complex.I = z
Mathlib.Basic.Complex.Basic · lines 264–265
Why close, not exact: Mathlib states that each complex number is recovered as the written sum of its two real coordinates with the unit.
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
5cecd649651a · pair key ab69bb58ff06.
Sign in to tag this passage
-
Notation · supporting · Definition and basic operations
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
A complex number is an expression of the form a + bi, where a and b are real numbers, and i is an abstract symbol, the so-called imaginary unit, whose meaning will be explained further below.
Show in article · Read it in context on Wikipedia ↗
Complex.I close match
def Complex.I : ℂ
Mathlib.Basic.Complex.Basic · lines 240–241
Why close, not exact: Mathlib pins the imaginary unit down as the element with coordinates zero and one rather than leaving the symbol uninterpreted.
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
7ab2371d595f · pair key 95357cd5256f.
Related, but states something else
Complex.I_sq related
theorem Complex.I_sq : Complex.I ^ 2 = -1
Mathlib.Basic.Complex.Basic · line 626
How it differs: It states the defining equation satisfied by the unit, which is a property of the symbol rather than its introduction in the written 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 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
84c217f50382 · pair key f5192706252a.
Sign in to tag this passage
-
Example · supporting · Definition and basic operations
✓Formalized
Formalized: Mathlib states a more general result (proved).
For example, 2 + 3i is a complex number.
Show in article · Read it in context on Wikipedia ↗
Complex.mk_eq_add_mul_I more general
theorem Complex.mk_eq_add_mul_I (a b : ℝ) : { re := a, im := b } = ↑a + ↑b * Complex.I
Mathlib.Basic.Complex.Basic · lines 260–261
Why more general: The declaration runs over all real coefficients; the example picks two of them.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
5041f1a3bd6f · pair key 5645e119f1f8.
Sign in to tag this passage
-
Definition · main statement · Definition and basic operations
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
For a complex number a + bi, the real number a is called its real part, and the real number b (not the complex number bi) is its imaginary part.
Show in article · Read it in context on Wikipedia ↗
Complex.mk_eq_add_mul_I close match
theorem Complex.mk_eq_add_mul_I (a b : ℝ) : { re := a, im := b } = ↑a + ↑b * Complex.I
Mathlib.Basic.Complex.Basic · lines 260–261
Why close, not exact: Mathlib presents the number by its coordinate pair and equates that pair with a + bi, so the two parts are read off by projection rather than named in words.
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
14fb6f128f01 · pair key 95e8f38b74a1.
Complex close match
structure Complex
Mathlib.Basic.Complex.Basic · lines 35–39
Why close, not exact: Mathlib builds a complex number from a pair of reals and names the two fields re and im, the two parts 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 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
356decb8d377 · pair key 69793bebd0ed.
Sign in to tag this passage
-
Notation · supporting · Definition and basic operations
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
The real part of a complex number z is denoted Re(z), ℛℯ(z), or ℜ(z) ; the imaginary part is Im(z), ℐ𝓂(z), or ℑ(z): for example, Re(2 + 3i) = 2, Im(2 + 3i) = 3.
Show in article · Read it in context on Wikipedia ↗
Complex.reAddGroupHom close match
def Complex.reAddGroupHom : ℂ →+ ℝ
Mathlib.Basic.Complex.Basic · lines 421–424
Why close, not exact: Mathlib packages the real-part map of a complex number as an additive group homomorphism into the reals and writes its value as the projection z.re.
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
5b03443ce1e2 · pair key 7922def72405.
Complex.reLm close match
def Complex.reLm : ℂ →ₗ[ℝ] ℝ
Mathlib.LinearAlgebra.Complex.Module · lines 222–225
Why close, not exact: Mathlib packages the same real-part map as a linear map of real vector spaces, its additivity and homogeneity carried along as fields.
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
ddaec4e321b9 · pair key d323e2308c40.
Complex.reCLM close match
def Complex.reCLM : ℂ →L[ℝ] ℝ
Mathlib.Analysis.Complex.Basic · lines 152–153
Why close, not exact: Mathlib packages the same real-part map as a continuous linear map of real normed spaces, with continuity carried as a field.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 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
84a7c2beab05 · pair key 839ab22f7a26.
Sign in to tag this passage
-
Notation · supporting · Definition and basic operations
◔Partial
Partial: Mathlib states part of this (a definition).
The real part of a complex number z is denoted Re(z), ℛℯ(z), or ℜ(z); the imaginary part is Im(z), ℐ𝓂(z), or ℑ(z): for example, Re(2 + 3i) = 2, Im(2 + 3i) = 3.
Show in article · Read it in context on Wikipedia ↗
Complex.imAddGroupHom states part
def Complex.imAddGroupHom : ℂ →+ ℝ
Mathlib.Basic.Complex.Basic · lines 431–434
Why only part: Mathlib packages the imaginary-part map as an additive group homomorphism into the reals; the two sample values the passage computes are outside what it says.
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
0193eb9e39af · pair key 3840759c3687.
Complex.mk_eq_add_mul_I states part
theorem Complex.mk_eq_add_mul_I (a b : ℝ) : { re := a, im := b } = ↑a + ↑b * Complex.I
Mathlib.Basic.Complex.Basic · lines 260–261
Why only part: It settles the two worked values but says nothing about the symbol the passage introduces.
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
cda4ea35e5e2 · pair key afbdb08ad4f0.
Complex.imLm states part
def Complex.imLm : ℂ →ₗ[ℝ] ℝ
Mathlib.LinearAlgebra.Complex.Module · lines 232–235
Why only part: A second packaging of the imaginary-part map; the sample values are outside what it says.
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
e64ca26292c8 · pair key b688721e63c2.
Sign in to tag this passage
-
Definition · main statement · Definition and basic operations
✓Formalized
Formalized: Mathlib states this exactly (a definition).
A complex number z can be identified with the ordered pair of real numbers (ℜ(z), ℑ(z)), which may be interpreted as coordinates of a point in a Euclidean plane with standard coordinates, which is then called the complex plane or Argand diagram.[6][7][a]
Show in article · Read it in context on Wikipedia ↗
Complex.equivRealProd exact match
def Complex.equivRealProd : ℂ ≃ ℝ × ℝ
Mathlib.Basic.Complex.Basic · lines 52–54
Note: Its value at z is the ordered pair of the two coordinates, as its application lemma records, and the pairs are the points of the plane the passage draws.
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
aa821bd8a47c · pair key cf9bb07a7156.
Complex.equivRealProd_apply close match
theorem Complex.equivRealProd_apply (z : ℂ) : Complex.equivRealProd z = (z.re, z.im)
Mathlib.Basic.Complex.Basic · line 51
Why close, not exact: It spells out Mathlib's correspondence by the very formula the passage uses, the pair of the two coordinates of z.
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
7475a95f22e3 · pair key 8b2a53dcd2aa.
Complex.equivRealProdLm more general
def Complex.equivRealProdLm : ℂ ≃ₗ[ℝ] ℝ × ℝ
Mathlib.LinearAlgebra.Complex.Module · lines 277–279
Why more general: Mathlib's version also carries the real-linear structure of the plane, which the passage does not assert 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 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
700fa4a8f158 · pair key 78f964dead5d.
Complex.equivRealProdCLM more general
def Complex.equivRealProdCLM : ℂ ≃L[ℝ] ℝ × ℝ
Mathlib.Analysis.Complex.Basic · lines 134–136
Why more general: Mathlib's version also carries the real-linear and topological structure of the plane, which the passage does not assert 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 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
4e4ec23be875 · pair key 05629b41b647.
Sign in to tag this passage
-
Definition · supporting · Definition and basic operations
✓Formalized
Formalized: Mathlib states this exactly (a definition).
A real number a can be regarded as a complex number a + 0i, whose imaginary part is 0.
Show in article · Read it in context on Wikipedia ↗
Complex.ofReal exact match
def Complex.ofReal : ℝ → ℂ
Mathlib.Basic.Complex.Basic · lines 83–84
Note: Mathlib's inclusion of the reals sends a to the complex number whose imaginary coordinate is zero.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, 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
65cd8aa1417d · pair key 52138df9d15c.
Complex.ofReal_def close match
theorem Complex.ofReal_def (r : ℝ) : ↑r = { re := r, im := 0 }
Mathlib.Basic.Complex.Basic · lines 96–97
Why close, not exact: It writes the included real as the coordinate pair with first entry a and second entry zero, the formula the passage states in words.
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
ef22603c58be · pair key 6e4808cbdac4.
Complex.ofReal_im states part
theorem Complex.ofReal_im (r : ℝ) : (↑r).im = 0
Mathlib.Basic.Complex.Basic · lines 93–94
Why only part: It records the vanishing of the imaginary coordinate and nothing about the real 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 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
a62907c334ca · pair key fb7a85c7815e.
Complex.ofReal_re states part
theorem Complex.ofReal_re (r : ℝ) : (↑r).re = r
Mathlib.Basic.Complex.Basic · lines 89–90
Why only part: It records the real coordinate of the included number and nothing about the imaginary 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. - 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
a9108fd08807 · pair key 4e9d2cbf673a.
Sign in to tag this passage
-
Definition · supporting · Definition and basic operations
◔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.
A purely imaginary number bi is a complex number 0 + bi, whose real part is zero.
Show in article · Read it in context on Wikipedia ↗
Complex.mk_eq_add_mul_I more general
theorem Complex.mk_eq_add_mul_I (a b : ℝ) : { re := a, im := b } = ↑a + ↑b * Complex.I
Mathlib.Basic.Complex.Basic · lines 260–261
Why more general: The declaration runs over every real first coefficient; the passage reads off the case where that coefficient is zero.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Re-checked 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
8b335442e279 · pair key 28c1fac6a2bd.
Related, but states something else
Complex.mul_I_re related
theorem Complex.mul_I_re (z : ℂ) : (z * Complex.I).re = -z.im
Mathlib.Basic.Complex.Basic · line 267
How it differs: It gives the real part of a product with the imaginary unit for an arbitrary complex factor, and reaches the passage's claim only together with the vanishing of the imaginary part of a real.
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
33218a23d73d · pair key 7bc3392fc13a.
Sign in to tag this passage
-
Notation · supporting · Definition and basic operations
✕Not formalized
It is common to write a + 0i = a, 0 + bi = bi, and a + (−b)i = a − bi; for example, 3 + (−4)i = 3 − 4i.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt e450d7011a17). - 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
Complex.ofReal_def related
theorem Complex.ofReal_def (r : ℝ) : ↑r = { re := r, im := 0 }
Mathlib.Basic.Complex.Basic · lines 96–97
How it differs: It presents an included real by its coordinate pair, which reaches the abbreviation of a sum with a vanishing imaginary term only together with the lemma equating that pair with the 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 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
372f62d8e2de · pair key ad3e65bd2666.
Complex.ofReal_neg related
theorem Complex.ofReal_neg (r : ℝ) : ↑(-r) = -↑r
Mathlib.Basic.Complex.Basic · lines 193–194
How it differs: It moves a sign through the inclusion of the reals; turning that into the passage's rewriting of a sum with a negated coefficient needs further ring lemmas.
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
6cd41245e2fd · pair key 8d578c6b3253.
Sign in to tag this passage
-
Notation · supporting · Definition and basic operations
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
The set of all complex numbers is denoted by ℂ (blackboard bold) or C (upright bold).
Show in article · Read it in context on Wikipedia ↗
termℂ close match
def termℂ : Lean.ParserDescr
Mathlib.Basic.Complex.Basic · line 41
Why close, not exact: Mathlib declares the blackboard bold letter as the notation for its type of complex numbers, which is the symbol the article gives first for this 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
7fb31e659efe · pair key a2e3707e6d9b.
Related, but states something else
Complex related
structure Complex
Mathlib.Basic.Complex.Basic · lines 35–39
How it differs: This is the type of complex numbers that the notation abbreviates, rather than a record of how that set is written.
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
e55b6f6e2c11 · pair key 71f4c7dd760a.
Sign in to tag this passage
-
Notation · supporting · Definition and basic operations
✕Not formalized
In some disciplines such as electromagnetism and electrical engineering, j is used instead of i, as i frequently represents electric current,[8][9] and complex numbers are written as a + bj or a + jb.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 15fc68c5b9c0). - 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
-
Definition · main statement · Definition and basic operations › Addition and subtraction
◔Partial
Partial: Mathlib states part of this (proved).
Two complex numbers a = x + yi and b = u + vi are added by separately adding their real and imaginary parts. That is to say:
Show in article · Read it in context on Wikipedia ↗
Complex.add_re states part
theorem Complex.add_re (z w : ℂ) : (z + w).re = z.re + w.re
Mathlib.Basic.Complex.Basic · lines 170–171
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
e97e905774b8 · pair key da8dd92e681d.
Complex.add_im states part
theorem Complex.add_im (z w : ℂ) : (z + w).im = z.im + w.im
Mathlib.Basic.Complex.Basic · lines 174–175
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
5589295ac9dc · pair key a57b5da36c0b.
Sign in to tag this passage
-
Theorem · main statement · Definition and basic operations › Addition and subtraction
◔Partial
Partial: Mathlib states part of this (proved).
That is to say:
a + b = (x + yi) + (u + vi) = (x + u) + (y + v)i. Similarly, subtraction can be performed as a − b = (x + yi) − (u + vi) = (x − u) + (y − v)i.
Show in article · Read it in context on Wikipedia ↗
Complex.add_re states part
theorem Complex.add_re (z w : ℂ) : (z + w).re = z.re + w.re
Mathlib.Basic.Complex.Basic · lines 170–171
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
96796f2535ed · pair key 4112a58c2b0a.
Complex.add_im states part
theorem Complex.add_im (z w : ℂ) : (z + w).im = z.im + w.im
Mathlib.Basic.Complex.Basic · lines 174–175
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
63674c256234 · pair key b717c5a31873.
Sign in to tag this passage
-
Definition · main statement · Definition and basic operations › Addition and subtraction
◔Partial
Partial: Mathlib states part of this (proved).
a + b = (x + yi) + (u + vi) = (x + u) + (y + v)i. Similarly, subtraction can be performed as a − b = (x + yi) − (u + vi) = (x − u) + (y − v)i.
Show in article · Read it in context on Wikipedia ↗
Complex.sub_re states part
theorem Complex.sub_re (z w : ℂ) : (z - w).re = z.re - w.re
Mathlib.Basic.Complex.Basic · lines 652–653
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
6bd7347d83dd · pair key 90ea95fff2a1.
Complex.sub_im states part
theorem Complex.sub_im (z w : ℂ) : (z - w).im = z.im - w.im
Mathlib.Basic.Complex.Basic · lines 656–657
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
9422ab5777c0 · pair key 40832cca1f48.
Sign in to tag this passage
-
Theorem · supporting · Definition and basic operations › Addition and subtraction
✓Formalized
Formalized: Mathlib states a more general result (proved).
The addition can be geometrically visualized as follows: the sum of two complex numbers a and b, interpreted as points in the complex plane, is the point obtained by building a parallelogram from the three vertices O, and the points of the arrows labeled a and b (provided that they are not on a line).
Show in article · Read it in context on Wikipedia ↗
midpoint_zero_add more general
theorem midpoint_zero_add (R : Type*) {V : Type*} [Ring R] [Invertible 2] [AddCommGroup V] [_root_.Module R V] (x y : V) : midpoint R 0 (x + y) = midpoint R x y
Mathlib.LinearAlgebra.AffineSpace.Midpoint · lines 200–201
Why more general: Mathlib states the midpoint identity for an arbitrary module over a ring with invertible 2, and it also covers the aligned case that the article sets aside.
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
d790a0d43523 · pair key 06ed83b0100a.
Sign in to tag this passage
-
Theorem · supporting · Definition and basic operations › Addition and subtraction
✕Not formalized
Equivalently, calling these points A, B, respectively and the fourth point of the parallelogram X the triangles OAB and XBA are congruent.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 3 candidates examined (receipt 35af7136b3b6). - 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
-
Definition · main statement · Definition and basic operations › Multiplication
◔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.
The product of two complex numbers is computed as follows: (a + bi) ⋅ (c + di) = ac − bd + (ad + bc)i.
Show in article · Read it in context on Wikipedia ↗
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 both factors and the product as records of their real and imaginary components, where the article writes each number as a real plus a real multiple of the imaginary unit.
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
ed3225eb8fe0 · pair key dd925e0184df.
Complex.mul_re states part
theorem Complex.mul_re (z w : ℂ) : (z * w).re = z.re * w.re - z.im * w.im
Mathlib.Basic.Complex.Basic · lines 215–216
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
e6238792c220 · pair key a458258afdf8.
Complex.mul_im states part
theorem Complex.mul_im (z w : ℂ) : (z * w).im = z.re * w.im + z.im * w.re
Mathlib.Basic.Complex.Basic · lines 219–220
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
8fa49bdf64a4 · pair key 8e746911462b.
Sign in to tag this passage
-
Example · supporting · Definition and basic operations › Multiplication
✓Formalized
Formalized: Mathlib states a more general result (proved).
For example, (2 − i)(3 + 4i) = 2 ⋅ 3 − ((−1) ⋅ 4) + (2 ⋅ 4 + (−1) ⋅ 3)i = 10 + 5i. In particular, this includes as a special case the fundamental formula
Show in article · Read it in context on Wikipedia ↗
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: The lemma writes a complex number as its pair of real components, where the passage writes the same numbers in the a plus bi shape.
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
3325a95ccc82 · pair key 4d27f0dc5042.
Sign in to tag this passage
-
Theorem · main statement · Definition and basic operations › Multiplication
✓Formalized
Formalized: Mathlib states this exactly (proved).
For example, (2 − i)(3 + 4i) = 2 ⋅ 3 − ((−1) ⋅ 4) + (2 ⋅ 4 + (−1) ⋅ 3)i = 10 + 5i. In particular, this includes as a special case the fundamental formula i2 = i ⋅ i = −1.
Show in article · Read it in context on Wikipedia ↗
Complex.I_sq exact match
theorem Complex.I_sq : Complex.I ^ 2 = -1
Mathlib.Basic.Complex.Basic · line 626
Note: Mathlib writes the square with power notation and gives the value minus 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
899756ecd6fe · pair key f2c5e7f737ca.
Complex.I_mul_I close match
theorem Complex.I_mul_I : Complex.I * Complex.I = -1
Mathlib.Basic.Complex.Basic · lines 252–253
Why close, not exact: Mathlib here multiplies the imaginary unit by itself instead of using the power notation 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
3dfb8e2. - Location key
9aa1bc673804 · pair key 1b5ad83e3c5b.
Sign in to tag this passage
-
Theorem · supporting · Definition and basic operations › Multiplication
✕Not formalized
This formula distinguishes the complex number i from any real number, since the square of any (negative or positive) real number is always a non-negative real number.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 16e1a5562de0). - 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
Complex.conj_eq_iff_real related
theorem Complex.conj_eq_iff_real {z : ℂ} : (starRingEnd ℂ) z = z ↔ ∃ r, z = ↑r
Mathlib.Basic.Complex.Basic · lines 488–490
How it differs: It characterises the complex numbers fixed by conjugation as those coming from a real 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, 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
8456beed8b5c · pair key 1f493c1de57d.
Complex.I_im related
theorem Complex.I_im : Complex.I.im = 1
Mathlib.Basic.Complex.Basic · lines 248–249
How it differs: It records that the imaginary part of the imaginary unit 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, 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
eb2d1e8baeae · pair key f0144208b58d.
Complex.ofReal_im related
theorem Complex.ofReal_im (r : ℝ) : (↑r).im = 0
Mathlib.Basic.Complex.Basic · lines 93–94
How it differs: It records that a real number viewed as a complex number has 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 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
17fec859b606 · pair key 8f441dd87137.
Sign in to tag this passage
-
Theorem · supporting · Definition and basic operations › Multiplication
✓Formalized
Formalized: Mathlib states a more general result (proved).
This formula distinguishes the complex number i from any real number, since the square of any (negative or positive) real number is always a non-negative real number.
Show in article · Read it in context on Wikipedia ↗
sq_nonneg more general
theorem sq_nonneg {R : Type u} [Semiring R] [LinearOrder R] [ExistsAddOfLE R] [PosMulMono R] [AddLeftMono R] (a : R) : 0 ≤ a ^ 2
Mathlib.Algebra.Order.Ring.Unbundled.Basic · lines 608–618
Why more general: The lemma is stated for any ordered semiring, and the reals are one of them.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, 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
496f87ee820a · pair key 63891703fccc.
mul_self_nonneg more general
theorem mul_self_nonneg {R : Type u} [Semiring R] [LinearOrder R] [ExistsAddOfLE R] [PosMulMono R] [AddLeftMono R] (a : R) : 0 ≤ a * a
Mathlib.Algebra.Order.Ring.Unbundled.Basic · lines 630–631
Why more general: This version writes the square as a product and holds in any ordered semiring.
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
930e979be412 · pair key 43a8a3756c87.
Sign in to tag this passage
-
Theorem · supporting · Definition and basic operations › Multiplication
✓Formalized
Formalized: Mathlib states a more general result (a definition).
With this definition of multiplication and addition, familiar rules for the arithmetic of rational or real numbers continue to hold for complex numbers.
Show in article · Read it in context on Wikipedia ↗
Complex.instField more general
instance Complex.instField : Field ℂ
Mathlib.Basic.Complex.Basic · lines 712–720
Why more general: Mathlib's field structure on the complex numbers packages associativity, commutativity, distributivity and inverses, the rules the passage has in mind.
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
b4e4a0958122 · pair key 3012a9d463c3.
Complex.instCommSemiring states part
instance Complex.instCommSemiring : CommSemiring ℂ
Mathlib.Basic.Complex.Basic · lines 405–406
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 commutative semiring structure on the complex numbers states some of the familiar arithmetic rules (commutativity, associativity, distributivity, identities for addition and multiplication) but not subtraction or division by non-zero numbers, which rational and real arithmetic also has. It covers one part of the passage's claim, not all 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 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
40265c2fedc6 · pair key 63210916f17c.
Sign in to tag this passage
-
Theorem · supporting · Definition and basic operations › Multiplication
✓Formalized
Formalized: Mathlib states a more general result (a definition).
More precisely, the distributive property, the commutative properties (of addition and multiplication) hold.
Show in article · Read it in context on Wikipedia ↗
Complex.instCommSemiring more general
instance Complex.instCommSemiring : CommSemiring ℂ
Mathlib.Basic.Complex.Basic · lines 405–406
Why more general: The structure also records associativity and the unit laws alongside the distributivity and commutativity the passage asserts.
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
a7f445f56815 · pair key 4f498fcb94d1.
Complex.instField more general
instance Complex.instField : Field ℂ
Mathlib.Basic.Complex.Basic · lines 712–720
Why more general: Besides the two properties of the passage, the field structure also supplies inverses for non-zero complex 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. - 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
61cbc3a0b180 · pair key 2f3b5058828b.
Sign in to tag this passage
-
Theorem · main statement · Definition and basic operations › Multiplication
✓Formalized
Formalized: Mathlib states this exactly (a definition).
Therefore, the complex numbers form an algebraic structure known as a field, the same way as the rational or real numbers do.
Show in article · Read it in context on Wikipedia ↗
Complex.instField exact match
instance Complex.instField : Field ℂ
Mathlib.Basic.Complex.Basic · lines 712–720
Note: Mathlib's instance gives the complex numbers the field structure named in 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
b95f2565ec63 · pair key 19ebe2f30bed.
Related, but states something else
Real.instField related
instance Real.instField : Field ℝ
Mathlib.Basic.Real.Basic · lines 481–496
How it differs: It is the field structure on the real numbers, the comparison the passage draws.
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
b557ad18793b · pair key 4cfaf079b303.
Rat.instField related
instance Rat.instField : Field ℚ
Mathlib.Algebra.Field.Rat · lines 27–36
How it differs: It is the field structure on the rational numbers, the other comparison the passage draws.
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
08fa462ba2c9 · pair key 9103f9c318ac.
Sign in to tag this passage
-
Definition · main statement · Definition and basic operations › Complex conjugate, absolute value, argument and division
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
The complex conjugate of the complex number z = x + yi is defined as z̄ = x − yi. [11] It is also denoted by some authors by z∗.
Show in article · Read it in context on Wikipedia ↗
Complex.instStarRing close match
instance Complex.instStarRing : StarRing ℂ
Mathlib.Basic.Complex.Basic · lines 459–463
Why close, not exact: Mathlib introduces conjugation as the star operation of a star-ring structure on the complex numbers, with the ring-homomorphism fields attached; its docstring says this is where the complex conjugate is defined.
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
45f4c00d349f · pair key e6731fa53db1.
RCLike.conj_eq_re_sub_im more general
theorem RCLike.conj_eq_re_sub_im {K : Type*} [RCLike K] (z : K) : (starRingEnd K) z = ↑(RCLike.re z) - ↑(RCLike.im z) * RCLike.I
Mathlib.Analysis.RCLike.Basic · lines 327–329
Why more general: The lemma is stated for any RCLike field, so it also covers the 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 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
495264951e46 · pair key 68e563f6120a.
Related, but states something else
Complex.conj_im related
theorem Complex.conj_im (z : ℂ) : ((starRingEnd ℂ) z).im = -z.im
Mathlib.Basic.Complex.Basic · lines 470–471
How it differs: It unfolds the imaginary part of the conjugate of a complex 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 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
5f4721882f59 · pair key 86b01b25f6f1.
Sign in to tag this passage
-
Notation · supporting · Definition and basic operations › Complex conjugate, absolute value, argument and division
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
The complex conjugate of the complex number z = x + yi is defined as z̄ = x − yi. [11] It is also denoted by some authors by z∗.
Show in article · Read it in context on Wikipedia ↗
Complex.star_def close match
theorem Complex.star_def : Star.star = ⇑(starRingEnd ℂ)
Mathlib.Basic.Complex.Basic · lines 500–501
Why close, not exact: Lean writes the involution as star z rather than with a postfix asterisk, and this equation identifies that operation with complex conjugation.
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
3360ec04b56a · pair key 5fc2decdffc3.
Complex.instStarRing close match
instance Complex.instStarRing : StarRing ℂ
Mathlib.Basic.Complex.Basic · lines 459–463
Why close, not exact: Its docstring records that the star of a complex number in this structure is the complex conjugate, written star z in Lean.
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
9ba3c6228875 · pair key af52bafcd9f6.
Sign in to tag this passage
-
Theorem · supporting · Definition and basic operations › Complex conjugate, absolute value, argument and division
✓Formalized
Formalized: Mathlib states a more general result (proved).
Geometrically, z is the "reflection" of z about the real axis.
Show in article · Read it in context on Wikipedia ↗
RCLike.conj_eq_re_sub_im more general
theorem RCLike.conj_eq_re_sub_im {K : Type*} [RCLike K] (z : K) : (starRingEnd K) z = ↑(RCLike.re z) - ↑(RCLike.im z) * RCLike.I
Mathlib.Analysis.RCLike.Basic · lines 327–329
Why more general: The universe records the reflection in coordinates, same real part and negated imaginary part, over any RCLike field rather than over ℂ 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
3dfb8e2. - Location key
9161e638bf65 · pair key 32fe8ac58d24.
Complex.conj_re states part
theorem Complex.conj_re (z : ℂ) : ((starRingEnd ℂ) z).re = z.re
Mathlib.Basic.Complex.Basic · lines 466–467
Why only part: It fixes the coordinate along the axis of the reflection and says nothing about the other 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. - 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
18089f1adf4d · pair key 698134d8a94c.
Complex.conj_im states part
theorem Complex.conj_im (z : ℂ) : ((starRingEnd ℂ) z).im = -z.im
Mathlib.Basic.Complex.Basic · lines 470–471
Why only part: It records the sign change across the axis and leaves the real coordinate unmentioned.
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
d906aa96a032 · pair key e1285284b96f.
Sign in to tag this passage
-
Theorem · supporting · Definition and basic operations › Complex conjugate, absolute value, argument and division
✓Formalized
Formalized: Mathlib states a more general result (proved).
Conjugating twice gives the original complex number: z̄ = z. A complex number is real if and only if it equals its own conjugate.
Show in article · Read it in context on Wikipedia ↗
Complex.conj_conj more general
theorem Complex.conj_conj {R : Type u} [CommSemiring R] [StarRing R] (x : R) : (starRingEnd R) ((starRingEnd R) x) = x
Mathlib.Algebra.Star.Basic · line 373
Why more general: Mathlib proves the involutive law for every commutative semiring with a star ring structure, so it covers more carriers than ℂ.
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
97fa834e8b5b · pair key 9c9ac5d5c990.
starRingEnd_self_apply more general
theorem starRingEnd_self_apply {R : Type u} [CommSemiring R] [StarRing R] (x : R) : (starRingEnd R) ((starRingEnd R) x) = x
Mathlib.Algebra.Star.Basic · line 357
Why more general: The underlying lemma of which the Complex-named declaration is an alias, stated over any commutative semiring with a star ring.
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
44f15156f710 · pair key ecae5cef3765.
Sign in to tag this passage
-
Theorem · main statement · Definition and basic operations › Complex conjugate, absolute value, argument and division
✓Formalized
Formalized: Mathlib states this exactly (proved).
Conjugating twice gives the original complex number: z̄ = z. A complex number is real if and only if it equals its own conjugate.
Show in article · Read it in context on Wikipedia ↗
Complex.conj_eq_iff_real exact match
theorem Complex.conj_eq_iff_real {z : ℂ} : (starRingEnd ℂ) z = z ↔ ∃ r, z = ↑r
Mathlib.Basic.Complex.Basic · lines 488–490
Note: Being real is written as z arising from some real number under the coercion of ℝ into ℂ.
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
8b415d09b892 · pair key 9c7427172fc5.
Complex.conj_eq_iff_im close match
theorem Complex.conj_eq_iff_im {z : ℂ} : (starRingEnd ℂ) z = z ↔ z.im = 0
Mathlib.Basic.Complex.Basic · lines 495–497
Why close, not exact: Mathlib encodes being real as the imaginary part being zero instead of as lying in the image of 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 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
3040fb5ba58d · pair key 8e6c91e89663.
RCLike.conj_eq_iff_real more general
theorem RCLike.conj_eq_iff_real {K : Type*} [RCLike K] {z : K} : (starRingEnd K) z = z ↔ ∃ r, z = ↑r
Mathlib.Analysis.RCLike.Basic · lines 371–374
Why more general: The same equivalence is proved for both RCLike fields, so it also covers the 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 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
de0a6ec3747d · pair key ed4102b312ae.
Sign in to tag this passage
-
Theorem · supporting · Definition and basic operations › Complex conjugate, absolute value, argument and division
✕Not formalized
The unary operation of taking the complex conjugate of a complex number cannot be expressed by applying only the basic operations of addition, subtraction, multiplication and division.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt cb0d3b6c2c67). - 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
-
Theorem · main statement · Definition and basic operations › Complex conjugate, absolute value, argument and division
✓Formalized
Formalized: Mathlib states this up to a convention difference (proved).
For any complex number z = x + yi , the product z ⋅ z̄ = (x + iy)(x − iy) = x2 + y2
Show in article · Read it in context on Wikipedia ↗
Complex.mul_conj close match
theorem Complex.mul_conj (z : ℂ) : z * (starRingEnd ℂ) z = ↑(Complex.normSq z)
Mathlib.Basic.Complex.Basic · lines 585–586
Why close, not exact: Mathlib writes the right-hand sum of squares under the name normSq, whose value at z is the real part times itself plus the imaginary part times 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 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
67f542073051 · pair key d4e646634047.
Related, but states something else
Complex.normSq_add_mul_I related
theorem Complex.normSq_add_mul_I (x y : ℝ) : Complex.normSq (↑x + ↑y * Complex.I) = x ^ 2 + y ^ 2
Mathlib.Basic.Complex.Basic · lines 541–542
How it differs: It evaluates normSq at x + y i as the sum of the two squares, supplying the right-hand side 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
d3aecbd2f97d · pair key 499212917590.
Sign in to tag this passage
-
Theorem · supporting · Definition and basic operations › Complex conjugate, absolute value, argument and division
✓Formalized
Formalized: Mathlib states a more general result (proved).
z ⋅ z̄ = (x + iy)(x − iy) = x2 + y2
is a non-negative real number.
Show in article · Read it in context on Wikipedia ↗
mul_star_self_nonneg more general
theorem mul_star_self_nonneg {R : Type*} [NonUnitalSemiring R] [PartialOrder R] [StarRing R] [StarOrderedRing R] (r : R) : 0 ≤ r * Star.star r
Mathlib.Algebra.Order.Star.Basic · lines 217–218
Why more general: Mathlib proves this for every star ordered ring; on ℂ the relation 0 ≤ w says exactly that w is a real number that is not negative.
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
1938720e5cae · pair key cb96076427db.
Related, but states something else
Complex.mul_conj related
theorem Complex.mul_conj (z : ℂ) : z * (starRingEnd ℂ) z = ↑(Complex.normSq z)
Mathlib.Basic.Complex.Basic · lines 585–586
How it differs: It identifies the product with the coercion of a real number but records nothing about its 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 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
5ecb95a6ae24 · pair key 7a7acc6f63f0.
Complex.normSq_nonneg related
theorem Complex.normSq_nonneg (z : ℂ) : 0 ≤ Complex.normSq z
Mathlib.Basic.Complex.Basic · lines 554–555
How it differs: It gives the sign of normSq, which reaches the passage only in company with the product identity.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 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
c00c5e7fe21b · pair key 6e2fbc32dcbf.
Sign in to tag this passage
-
Definition · main statement · Definition and basic operations › Complex conjugate, absolute value, argument and division
✓Formalized
Formalized: Mathlib states this exactly (a definition).
This allows to define the absolute value (or modulus or magnitude) of z to be the square root[12] |z| = √x2 + y2. By Pythagoras' theorem, |z| is the distance from the origin to the point representing the complex number z in the complex plane.
Show in article · Read it in context on Wikipedia ↗
Complex.instNorm exact match
instance Complex.instNorm : Norm ℂ
Mathlib.Analysis.Complex.Norm · lines 28–29
Note: Lean writes the modulus of z as the norm of z, and Complex.norm_eq_sqrt_sq_add_sq records that its value is the square root of the sum of the squares of the coordinates.
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
509410949c54 · pair key e6a0d7a6c713.
Complex.norm_eq_sqrt_sq_add_sq close match
theorem Complex.norm_eq_sqrt_sq_add_sq (z : ℂ) : ‖z‖ = √(z.re ^ 2 + z.im ^ 2)
Mathlib.Analysis.Complex.Norm · lines 171–172
Why close, not exact: It unfolds the library's modulus into the square root of the sum of the squares of the real and imaginary parts.
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
89f11672cbcc · pair key 30545ee50d8f.
Sign in to tag this passage
-
Theorem · supporting · Definition and basic operations › Complex conjugate, absolute value, argument and division
✓Formalized
Formalized: Mathlib states a more general result (proved).
This allows to define the absolute value (or modulus or magnitude) of z to be the square root[12] |z| = √x2 + y2. By Pythagoras' theorem, |z| is the distance from the origin to the point representing the complex number z in the complex plane.
Show in article · Read it in context on Wikipedia ↗
dist_zero_right more general
theorem dist_zero_right {E : Type*} [SeminormedAddGroup E] (a : E) : Dist.dist a 0 = ‖a‖
Mathlib.Analysis.Normed.Group.Basic · line 55
Why more general: Mathlib states this for an arbitrary seminormed additive group, of which the complex plane is one 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 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
33af9ec51fdc · pair key 58d95303e5f1.
Related, but states something else
Complex.dist_eq related
theorem Complex.dist_eq (z w : ℂ) : Dist.dist z w = ‖z - w‖
Mathlib.Analysis.Complex.Norm · line 234
How it differs: Mathlib writes the absolute value of a complex number with norm bars rather than vertical bars, and gives the distance between any two points 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 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
52cebe3e0ef1 · pair key b48648bf27f8.
Complex.dist_eq_re_im related
theorem Complex.dist_eq_re_im (z w : ℂ) : Dist.dist z w = √((z.re - w.re) ^ 2 + (z.im - w.im) ^ 2)
Mathlib.Analysis.Complex.Norm · lines 236–238
How it differs: This gives the distance between two complex numbers as the square root of the summed squared coordinate differences, the Pythagorean computation the passage appeals to rather than the identity it asserts.
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
7f368491f213 · pair key 6733e0c87b77.
Sign in to tag this passage
-
Definition · main statement · Definition and basic operations › Complex conjugate, absolute value, argument and division
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
In particular, the circle of radius one around the origin consists precisely of the numbers z such that |z| = 1, known as the unit complex numbers.
Show in article · Read it in context on Wikipedia ↗
Circle close match
def Circle : Type
Mathlib.Analysis.Complex.Circle · lines 53–54
Why close, not exact: Mathlib packages these numbers as a type carrying the multiplicative structure they inherit from ℂ, where the passage speaks of them simply as a set of points.
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
9a878d25b6b9 · pair key 48c76f71a2fc.
mem_sphere_zero_iff_norm more general
theorem mem_sphere_zero_iff_norm {E : Type*} [SeminormedAddGroup E] {a : E} {r : ℝ} : a ∈ Metric.sphere 0 r ↔ ‖a‖ = r
Mathlib.Analysis.Normed.Group.Basic · line 306
Why more general: Mathlib proves this for every seminormed additive group and every radius, of which the complex plane with radius one is one 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
3dfb8e2. - Location key
95cf3b5df28d · pair key 5fff7bfb326f.
Related, but states something else
Circle.norm_coe related
theorem Circle.norm_coe (z : Circle) : ‖↑z‖ = 1
Mathlib.Analysis.Complex.Circle · line 73
How it differs: It gives only the inclusion from the circle into the numbers of absolute value one, not the converse.
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
3dfb8e2. - Location key
c84325be48bb · pair key 8af76814e11e.
Sign in to tag this passage
-
Theorem · supporting · Definition and basic operations › Complex conjugate, absolute value, argument and division
✓Formalized
Formalized: Mathlib states this up to a convention difference (proved).
If z = x = x + 0i is a real number, then |z| = |x|: its absolute value as a complex number and as a real number are equal.
Show in article · Read it in context on Wikipedia ↗
Complex.norm_real close match
theorem Complex.norm_real (r : ℝ) : ‖↑r‖ = ‖r‖
Mathlib.Analysis.Complex.Norm · lines 105–106
Why close, not exact: Mathlib writes the real absolute value as the norm of a real number and the complex one as the norm of its image in ℂ, two names for the same two quantities.
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
fb03a4fa9043 · pair key ee9b83fc6d0d.
Complex.abs_re_eq_norm more general
theorem Complex.abs_re_eq_norm {z : ℂ} : |z.re| = ‖z‖ ↔ z.im = 0
Mathlib.Analysis.Complex.Norm · lines 205–206
Why more general: Mathlib states an equivalence covering all complex numbers, where the passage uses only the direction for those with vanishing imaginary part.
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
a0125555f3cc · pair key 8d90830faba8.
Related, but states something else
Real.norm_eq_abs related
theorem Real.norm_eq_abs (r : ℝ) : ‖r‖ = |r|
Mathlib.Analysis.Normed.Group.Real · lines 58–59
How it differs: It only records that Mathlib's norm on ℝ is the real absolute value, a naming fact rather than a comparison of the real and complex sizes of one 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 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
859be51d5d50 · pair key 9c04c323169f.
Sign in to tag this passage
-
Theorem · main statement · Definition and basic operations › Complex conjugate, absolute value, argument and division
✓Formalized
Formalized: Mathlib states this up to a convention difference (proved).
1z = z̄zz̄ = z̄|z|2 = x − yix2 + y2 = xx2 + y2 − yx2 + y2i. More generally, the division of an arbitrary complex number w = u + vi by a non-zero complex number z = x + yi equals wz = wz̄|z|2 = (u + vi)(x − iy)x2 + y2 = ux + vyx2 + y2 + vx − uyx2 + y2i.…
Show in article · Read it in context on Wikipedia ↗
Complex.inv_def close match
theorem Complex.inv_def (z : ℂ) : z⁻¹ = (starRingEnd ℂ) z * ↑(Complex.normSq z)⁻¹
Mathlib.Basic.Complex.Basic · lines 682–683
Why close, not exact: Mathlib writes the reciprocal as the conjugate scaled by the inverse of the squared length function, whose value at x + yi is the sum of the squares of x and y.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
6522d0ec5613 · pair key aad1dfb933ad.
Complex.inv_re states part
theorem Complex.inv_re (z : ℂ) : z⁻¹.re = z.re / Complex.normSq z
Mathlib.Basic.Complex.Basic · line 686
Why only part: It fixes only the real coordinate of the reciprocal.
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
0e51ffc20710 · pair key f1bea61fae8f.
Complex.inv_im states part
theorem Complex.inv_im (z : ℂ) : z⁻¹.im = -z.im / Complex.normSq z
Mathlib.Basic.Complex.Basic · line 689
Why only part: It fixes only the imaginary coordinate of the reciprocal.
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
d72de32f66a5 · pair key 831caa43bb09.
Related, but states something else
Complex.normSq_apply related
theorem Complex.normSq_apply (z : ℂ) : Complex.normSq z = z.re * z.re + z.im * z.im
Mathlib.Basic.Complex.Basic · lines 516–517
How it differs: It only unfolds the squared length function into coordinates and says nothing about reciprocals.
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
0c640a9e446b · pair key f8f9969f802d.
Sign in to tag this passage
-
Theorem · main statement · Definition and basic operations › Complex conjugate, absolute value, argument and division
◔Partial
Partial: Mathlib states part of this (proved).
1z = z̄zz̄ = z̄|z|2 = x − yix2 + y2 = xx2 + y2 − yx2 + y2i. More generally, the division of an arbitrary complex number w = u + vi by a non-zero complex number z = x + yi equals wz = wz̄|z|2 = (u + vi)(x − iy)x2 + y2 = ux + vyx2 + y2 + vx − uyx2 + y2i. This process is sometimes called "rationalization" of the denominator (although the denominator in the final expression may be an irrational real number), because it resembles the method to remove roots from simple expressions in a denominator.
Show in article · Read it in context on Wikipedia ↗
Complex.div_re states part
theorem Complex.div_re (z w : ℂ) : (z / w).re = z.re * w.re / Complex.normSq w + z.im * w.im / Complex.normSq w
Mathlib.Basic.Complex.Basic · lines 704–705
Why only part: It fixes only the real coordinate of the quotient.
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
29a3133eda30 · pair key b50f2a9f6644.
Complex.div_im states part
theorem Complex.div_im (z w : ℂ) : (z / w).im = z.im * w.re / Complex.normSq w - z.re * w.im / Complex.normSq w
Mathlib.Basic.Complex.Basic · lines 707–708
Why only part: It fixes only the imaginary coordinate of the quotient.
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
09efac6761f9 · pair key 4a91d078b2eb.
Related, but states something else
Complex.normSq_apply related
theorem Complex.normSq_apply (z : ℂ) : Complex.normSq z = z.re * z.re + z.im * z.im
Mathlib.Basic.Complex.Basic · lines 516–517
How it differs: It only unfolds the squared length function into coordinates and says nothing about quotients.
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
eaa830d34292 · pair key 1033105c74cd.
Complex.inv_def related
theorem Complex.inv_def (z : ℂ) : z⁻¹ = (starRingEnd ℂ) z * ↑(Complex.normSq z)⁻¹
Mathlib.Basic.Complex.Basic · lines 682–683
How it differs: It handles the reciprocal of a single number, so reaching the quotient of two numbers from it still needs the multiplication 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 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
d5fab8483412 · pair key 6fe28a8788e6.
Sign in to tag this passage
-
Definition · main statement · Definition and basic operations › Complex conjugate, absolute value, argument and division
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
The argument of z (sometimes called the "phase" φ)[7] is the angle of the radius Oz with the positive real axis, and is written as arg z, expressed in radians in this article.
Show in article · Read it in context on Wikipedia ↗
Complex.arg close match
def Complex.arg : ℂ → ℝ
Mathlib.Analysis.SpecialFunctions.Complex.Arg · lines 30–32
Why close, not exact: Mathlib pins the value down to the representative lying in the half-open interval from minus pi to pi, and sets the value at the origin 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
c2916b993a0f · pair key 4ce784a85718.
Related, but states something else
Complex.norm_mul_exp_arg_mul_I related
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
How it differs: It characterises the angle by recovering the number from its length and its angle, which is a property of the defined object rather than the definition 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, 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
9bc9a888885c · pair key 46a86ef0f543.
Complex.norm_mul_cos_arg related
theorem Complex.norm_mul_cos_arg (x : ℂ) : ‖x‖ * Real.cos x.arg = x.re
Mathlib.Analysis.SpecialFunctions.Complex.Arg · lines 67–68
How it differs: It only records how the cosine of the angle recovers the real coordinate, a consequence of the definition rather than the definition.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 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
3939bd7c4ac3 · pair key 67f597c76e39.
Sign in to tag this passage
-
Theorem · supporting · Definition and basic operations › Complex conjugate, absolute value, argument and division
✓Formalized
Formalized: Mathlib states a more general result (proved).
The angle is defined only up to adding integer multiples of 2π , since a rotation by 2π (or 360°) around the origin leaves all points in the complex plane unchanged.
Show in article · Read it in context on Wikipedia ↗
Real.Angle.angle_eq_iff_two_pi_dvd_sub more general
theorem Real.Angle.angle_eq_iff_two_pi_dvd_sub {ψ θ : ℝ} : ↑θ = ↑ψ ↔ ∃ k, θ - ψ = 2 * π * ↑k
Mathlib.Analysis.SpecialFunctions.Trigonometric.Angle · lines 99–103
Why more general: Mathlib proves this for every pair of real numbers viewed in its circle of angles, where the passage speaks of the angle attached to a complex 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, 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
5dde9756af2e · pair key 829069bffddf.
Related, but states something else
Real.Angle.coe_eq_zero_iff related
theorem Real.Angle.coe_eq_zero_iff {x : ℝ} : ↑x = 0 ↔ ∃ n, n • (2 * π) = x
Mathlib.Analysis.SpecialFunctions.Trigonometric.Angle · lines 87–88
How it differs: It characterises when a radian measure is the trivial angle, the special case of the comparison rather than the general ambiguity the passage records.
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
0efc9c8377c7 · pair key b019e92b3e9f.
Complex.arg_exp_mul_I related
theorem Complex.arg_exp_mul_I (θ : ℝ) : (Complex.exp (↑θ * Complex.I)).arg = toIocMod Real.two_pi_pos (-π) θ
Mathlib.Analysis.SpecialFunctions.Complex.Arg · lines 123–125
How it differs: It computes the chosen representative of the angle of a point given by a radian measure, so reading off the ambiguity from it still needs the periodicity of that reduction.
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
c04c10f2a523 · pair key 6100f12ec353.
Sign in to tag this passage
-
Theorem · supporting · Definition and basic operations › Complex conjugate, absolute value, argument and division
✓Formalized
With community edits: Formalized. As published it is Not formalized.
Formalized, by a community edit: Mathlib states this up to a convention difference (proved).
The angle is defined only up to adding integer multiples of 2π, since a rotation by 2π (or 360°) around the origin leaves all points in the complex plane unchanged.
Show in article · Read it in context on Wikipedia ↗
Complex.exp_two_pi_mul_I close match
theorem Complex.exp_two_pi_mul_I : Complex.exp (2 * ↑π * Complex.I) = 1
Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic · lines 1239–1240
Community Agent The pipeline said related; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
Why close, not exact: Rotating a point z by an angle t about the origin multiplies z by exp(i t). Complex.exp_two_pi_mul_I says exp(2 pi i) = 1, so rotation by 2 pi multiplies every point by 1 and leaves it fixed. Convention difference: the lemma states the rotation factor equals 1, not that the rotation map is the identity.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 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
7818fca7c448 · pair key c099633094eb.
✕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 bb17c181523a). - 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
Orientation.rotation_zero related
theorem Orientation.rotation_zero {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [Fact (Module.finrank ℝ V = 2)] (o : Orientation ℝ V (Fin 2)) : o.rotation 0 = LinearIsometryEquiv.refl ℝ V
Mathlib.Geometry.Euclidean.Angle.Oriented.Rotation · line 127
How it differs: Mathlib states this for any oriented real inner product plane, of which the complex plane is one instance, and names the full turn by the trivial element of its circle of angles.
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
aed4ac1ed61f · pair key 3c03769d07eb.
Real.Angle.coe_two_pi related
theorem Real.Angle.coe_two_pi : ↑(2 * π) = 0
Mathlib.Analysis.SpecialFunctions.Trigonometric.Angle · lines 106–107
How it differs: It records that a full turn is the trivial angle, the reason behind the passage rather than its assertion about the points of the plane.
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
b3425e71ac6c · pair key eef1885fc88c.
Sign in to tag this passage
-
Definition · supporting · Definition and basic operations › Complex conjugate, absolute value, argument and division
✓Formalized
Formalized: Mathlib states this exactly (a definition).
One possible choice to uniquely specify the argument is to require it to be within the interval (−π, π], which is referred to as the principal value.[15]
Show in article · Read it in context on Wikipedia ↗
Complex.arg exact match
def Complex.arg : ℂ → ℝ
Mathlib.Analysis.SpecialFunctions.Complex.Arg · lines 30–32
Note: Its documented range is the half-open interval from minus pi to pi, and it returns zero at the origin, where the passage supplies no angle at all; nothing in the passage depends on that returned 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
3dfb8e2. - Location key
ec5347199f65 · pair key 530283e74628.
Circle.argEquiv special case
def Circle.argEquiv : Circle ≃ ↑(Set.Ioc (-π) π)
Mathlib.Analysis.SpecialFunctions.Complex.Circle · lines 63–67
Why a special case: It is stated for the unit circle only, so it gives the passage's uniqueness for numbers of absolute value 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. - 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
7be52e90a923 · pair key e43977652d0f.
Complex.arg_mem_Ioc states part
theorem Complex.arg_mem_Ioc (z : ℂ) : z.arg ∈ Set.Ioc (-π) π
Mathlib.Analysis.SpecialFunctions.Complex.Arg · lines 136–145
Why only part: It gives the range requirement of the passage but not on its own the uniqueness.
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
ec57b0dbdaa4 · pair key 7dab54349aeb.
Complex.arg_cos_add_sin_mul_I states part
theorem Complex.arg_cos_add_sin_mul_I {θ : ℝ} : θ ∈ Set.Ioc (-π) π → (Complex.cos ↑θ + Complex.sin ↑θ * Complex.I).arg = θ
Mathlib.Analysis.SpecialFunctions.Complex.Arg · lines 110–111
Why only part: It fixes the choice inside the interval but says nothing about numbers of other absolute values.
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. - 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
237f567f7758 · pair key 739924dc8e78.
Sign in to tag this passage
-
Theorem · supporting · Definition and basic operations › Complex conjugate, absolute value, argument and division
✕Not formalized
The argument can be computed from the rectangular form x + yi by means of the arctan (inverse tangent) function.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 5 queries and 0 candidates examined (receipt bfebfbef4bf5). - 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
Complex.tan_arg related
theorem Complex.tan_arg (x : ℂ) : Real.tan x.arg = x.im / x.re
Mathlib.Analysis.SpecialFunctions.Complex.Arg · lines 217–221
How it differs: It links the argument to the rectangular data through the tangent, which alone leaves the choice between two opposite directions 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 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
c84054ce71de · pair key ff191d9e60ef.
Sign in to tag this passage
-
Theorem · main statement · Definition and basic operations › Polar form
✓Formalized
Formalized: Mathlib states this exactly (proved).
For any complex number z, with absolute value r = |z| and argument φ, the equation z = r(cos φ + isin φ) holds.
Show in article · Read it in context on Wikipedia ↗
Complex.norm_mul_cos_add_sin_mul_I exact match
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
Note: The library writes the absolute value as the norm of z and puts the imaginary unit after the sine; at the origin the equation reads zero equals zero, where the passage gives no angle.
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
fe2bff4cafb6 · pair key e1f9e1136626.
Sign in to tag this passage
-
Definition · supporting · Definition and basic operations › Polar form
◔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.
This identity is referred to as the polar form of z.
Show in article · Read it in context on Wikipedia ↗
Complex.polarCoord_symm_apply close match
theorem Complex.polarCoord_symm_apply (p : ℝ × ℝ) : ↑Complex.polarCoord.symm p = ↑p.1 * (↑(Real.cos p.2) + ↑(Real.sin p.2) * Complex.I)
Mathlib.Analysis.SpecialFunctions.PolarCoord · lines 198–200
Why close, not exact: It spells the library's polar coordinate object out as the passage's expression, the first entry times the cosine plus the sine times the imaginary unit.
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
8aa5bb8c8cda · pair key 1fdec2d772da.
Complex.norm_mul_cos_add_sin_mul_I close match
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
Why close, not exact: It writes each complex number in the shape the passage names, with the absolute value written as a norm.
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
e10874967e65 · pair key 537ce85172ac.
Complex.polarCoord special case
def Complex.polarCoord : OpenPartialHomeomorph ℂ (ℝ × ℝ)
Mathlib.Analysis.SpecialFunctions.PolarCoord · lines 184–185
Why a special case: Its source leaves out the nonpositive reals, which the passage's form still covers with the angle pi.
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
6471fd883f27 · pair key 582276ea836f.
Sign in to tag this passage
-
Notation · supporting · Definition and basic operations › Polar form
✕Not formalized
It is sometimes abbreviated as z = rmathrmcis φ.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 428327981117). - 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
-
Notation · supporting · Definition and basic operations › Polar form
✕Not formalized
In electronics, one represents a phasor with amplitude r and phase φ in angle notation:[17] z = r∠φ.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt b68a1bcd58b8). - 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
-
Theorem · main statement · Definition and basic operations › Polar form
◔Partial
Partial: Mathlib states part of this (proved).
If two complex numbers are given in polar form, i.e., z1 = r1(cos φ1 + i sin φ1) and z2 = r2(cos φ2 + i sin φ2), the product and division can be computed as z1z2 = r1r2(cos(φ1 + φ2) + isin(φ1 + φ2)). z1z2 = r1r2(cos(φ1 − φ2) + isin(φ1 − φ2)), if z2 ≠ 0. (These are a consequence of the trigonometric identities for the sine and cosine function.) In other words, the absolute values are multiplied and the arguments are added to yield the polar form of the product.
Show in article · Read it in context on Wikipedia ↗
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: It gives the absolute value half of the first conjunct and leaves the angle of the product 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 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
e0687c6f05cc · pair key 9266cf6ad54f.
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: The sum is taken in the library's type of angles, so it is read modulo a full turn, as the cosine and sine of the passage already are; a vanishing factor, which the lemma excludes, makes the passage's equation read zero equals 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 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
85690ed2788b · pair key 8a0dc79fcbba.
Complex.norm_div states part
theorem Complex.norm_div (z w : ℂ) : ‖z / w‖ = ‖z‖ / ‖w‖
Mathlib.Analysis.Complex.Norm · lines 79–80
Why only part: It gives the absolute value half of the second conjunct and says nothing about the angle of the quotient.
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
05742d63c780 · pair key a11806a95117.
Complex.arg_div_coe_angle states part
theorem Complex.arg_div_coe_angle {x y : ℂ} : x ≠ 0 → y ≠ 0 → ↑(x / y).arg = ↑x.arg - ↑y.arg
Mathlib.Analysis.SpecialFunctions.Complex.Arg · lines 498–500
Why only part: The difference is taken in the library's type of angles, hence modulo a full turn; the excluded case of a vanishing numerator makes the passage's quotient equation read zero equals 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 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
35f14ecc4bb6 · pair key 9d12bf139082.
Sign in to tag this passage
-
Theorem · supporting · Definition and basic operations › Polar form
◔Partial
Partial: Mathlib states part of this (proved).
…z1z2 = r1r2(cos(φ1 − φ2) + isin(φ1 − φ2)), if z2 ≠ 0. (These are a consequence of the trigonometric identities for the sine and cosine function.) In other words, the absolute values are multiplied and the arguments are added to yield the polar form of the product.
Show in article · Read it in context on Wikipedia ↗
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: It carries the absolute value half of the sentence and not the behaviour of the arguments.
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
2acc7706d2ad · pair key 7da146ce7b26.
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: The addition happens in the library's type of angles, so it is read modulo a full turn, and a vanishing factor, which the lemma excludes, has no angle in the passage either.
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
e27c7efbb1bb · pair key da2edf6d39a4.
Sign in to tag this passage
-
Example · supporting · Definition and basic operations › Polar form
✓Formalized
Formalized: Mathlib states a more general result (proved).
The picture at the right illustrates the multiplication of (2 + i)(3 + i) = 5 + 5i. Because the real and imaginary part of 5 + 5i are equal, the argument of that number is 45 degrees, or π/4 (in radian).
Show in article · Read it in context on Wikipedia ↗
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: The declaration writes a complex number by its two real components rather than in the a + bi shape the passage uses; Complex.mk_eq_add_mul_I links the two ways of writing one and the same 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
7232ffbfa672 · pair key 67ebd8b07b24.
Sign in to tag this passage
-
Theorem · supporting · Definition and basic operations › Polar form
✕Not formalized
The picture at the right illustrates the multiplication of (2 + i)(3 + i) = 5 + 5i. Because the real and imaginary part of 5 + 5i are equal, the argument of that number is 45 degrees, or π/4 (in radian).
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt ed1c181229dd). - 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
Complex.arg_mul_cos_add_sin_mul_I related
theorem Complex.arg_mul_cos_add_sin_mul_I {r : ℝ} : 0 < r → ∀ {θ : ℝ}, θ ∈ Set.Ioc (-π) π → (↑r * (Complex.cos ↑θ + Complex.sin ↑θ * Complex.I)).arg = θ
Mathlib.Analysis.SpecialFunctions.Complex.Arg · lines 87–108
How it differs: It reads the angle off a number already presented as a positive multiple of a cosine-plus-i-sine pair; reaching the passage's number would first need the values of the cosine and sine at a quarter of pi.
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
334a42767753 · pair key 55aaef5cecdd.
Complex.tan_arg related
theorem Complex.tan_arg (x : ℂ) : Real.tan x.arg = x.im / x.re
Mathlib.Analysis.SpecialFunctions.Complex.Arg · lines 217–221
How it differs: It gives the tangent of the angle as the ratio of the two components, so for the passage's number it yields a tangent of one rather than the angle 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
32c6eda28932 · pair key 936a2adb235a.
Sign in to tag this passage
-
Theorem · supporting · Definition and basic operations › Polar form
✓Formalized
With community edits: Formalized. As published it is Not formalized.
Formalized, by a community edit: Mathlib states this up to a convention difference (proved).
On the other hand, it is also the sum of the angles at the origin of the red and blue triangles are arctan(1/3) and arctan(1/2), respectively.
Show in article · Read it in context on Wikipedia ↗
Real.arctan_inv_2_add_arctan_inv_3 close match
theorem Real.arctan_inv_2_add_arctan_inv_3 : Real.arctan 2⁻¹ + Real.arctan 3⁻¹ = π / 4
Mathlib.Analysis.SpecialFunctions.Trigonometric.Arctan · lines 326–327
Community Agent The pipeline said related; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
Why close, not exact: The passage finishes the example (2+i)(3+i) = 5+5i: the argument of 5+5i is the sum of the angles arctan(1/2) and arctan(1/3). Real.arctan_inv_2_add_arctan_inv_3 proves arctan(1/2) + arctan(1/3) = π/4. The difference: the passage calls the left side the argument of 5+5i, which the previous sentence shows is π/4. The declaration writes π/4 directly and says nothing about complex 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. - 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
0b1b556e4aca · pair key 8d7dbd1a5c31.
✕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 a5656556b4fd). - 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
Complex.arg_mul related
theorem Complex.arg_mul {x y : ℂ} : x ≠ 0 → y ≠ 0 → x.arg + y.arg ∈ Set.Ioc (-π) π → (x * y).arg = x.arg + y.arg
Mathlib.Analysis.SpecialFunctions.Complex.Arg · line 534
How it differs: It gives the additivity of the angle under multiplication for two nonzero factors whose angles sum inside the chosen branch, leaving both angles unevaluated.
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
5009c57dfd46 · pair key b73fc8e23a08.
Sign in to tag this passage
-
Theorem · main statement · Definition and basic operations › Polar form
✓Formalized
Formalized: Mathlib states this exactly (proved).
Thus, the formula π4 = arctan(12) + arctan(13) holds.
Show in article · Read it in context on Wikipedia ↗
Real.arctan_inv_2_add_arctan_inv_3 exact match
theorem Real.arctan_inv_2_add_arctan_inv_3 : Real.arctan 2⁻¹ + Real.arctan 3⁻¹ = π / 4
Mathlib.Analysis.SpecialFunctions.Trigonometric.Arctan · lines 326–327
Note: Lean writes the two reciprocals as inverses of 2 and of 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
576656a01651 · pair key d63eb5ea7b5f.
Sign in to tag this passage
-
Theorem · supporting · Definition and basic operations › Polar form
✓Formalized
Formalized: Mathlib states this exactly (proved).
As the arctan function can be approximated highly efficiently, formulas like this – known as Machin-like formulas – are used for high-precision approximations of π:[18] π4 = 4arctan(15) − arctan(1239)
Show in article · Read it in context on Wikipedia ↗
Real.four_mul_arctan_inv_5_sub_arctan_inv_239 exact match
theorem Real.four_mul_arctan_inv_5_sub_arctan_inv_239 : 4 * Real.arctan 5⁻¹ - Real.arctan 239⁻¹ = π / 4
Mathlib.Analysis.SpecialFunctions.Trigonometric.Arctan · lines 336–338
Note: The remark that formulas of this shape serve high-precision computations of pi is motivation rather than a mathematical assertion, so the equality is the whole content 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
b5ba45b8e320 · pair key afce63dd971f.
Sign in to tag this passage
-
Theorem · main statement · Definition and basic operations › Powers and roots
◔Partial
Partial: Mathlib states a special case (proved).
The n-th power of a complex number can be computed using de Moivre's formula, which is obtained by repeatedly applying the above formula for the product: zn = z ⋅ … ⋅ zn factors = (r(cos φ + isin φ))n = rn (cos nφ + isin nφ). For example, the first few powers of the imaginary unit i are i, i2 = −1, i3 = −i, i4 = 1, i5 = i, ….
Show in article · Read it in context on Wikipedia ↗
Complex.cos_add_sin_mul_I_pow special case
theorem Complex.cos_add_sin_mul_I_pow (n : ℕ) (z : ℂ) : (Complex.cos z + Complex.sin z * Complex.I) ^ n = Complex.cos (↑n * z) + Complex.sin (↑n * z) * Complex.I
Mathlib.Analysis.Complex.Trigonometric · lines 542–544
Why a special case: The modulus is fixed at one here, so the factor r to the n never appears; in exchange the angle is allowed to be any complex number rather than a real 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
cadb7cabe77b · pair key 6b76285d8605.
Sign in to tag this passage
-
Example · supporting · Definition and basic operations › Powers and roots
◔Partial
Partial: Mathlib states part of this (proved).
…by repeatedly applying the above formula for the product: zn = z ⋅ … ⋅ zn factors = (r(cos φ + isin φ))n = rn (cos nφ + isin nφ). For example, the first few powers of the imaginary unit i are i, i2 = −1, i3 = −i, i4 = 1, i5 = i, ….
Show in article · Read it in context on Wikipedia ↗
Complex.I_sq states part
theorem Complex.I_sq : Complex.I ^ 2 = -1
Mathlib.Basic.Complex.Basic · line 626
Why only part: A single power is settled here; the later entries of the run come from separate declarations.
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
47fb90b38253 · pair key e7c996ee97ed.
Complex.I_pow_three states part
theorem Complex.I_pow_three : Complex.I ^ 3 = -Complex.I
Mathlib.Basic.Complex.Basic · line 629
Why only part: Only the third power is settled by this 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. - 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
012790962ff7 · pair key b8eeeb6da0fe.
Complex.I_pow_four states part
theorem Complex.I_pow_four : Complex.I ^ 4 = 1
Mathlib.Basic.Complex.Basic · line 632
Why only part: The fifth entry and the implied repetition after it are not settled by this 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 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
01cb413b2f00 · pair key b6723e974051.
Sign in to tag this passage
-
Theorem · main statement · Definition and basic operations › Powers and roots
◔Partial
Partial: Mathlib states a special case (proved).
The n nth roots of a complex number z are given by z1/n = n√r(cos(φ + 2kπn) + isin(φ + 2kπn)) for 0 ≤ k ≤ n − 1.
Show in article · Read it in context on Wikipedia ↗
Complex.mem_rootsOfUnity special case
theorem Complex.mem_rootsOfUnity (n : ℕ) [NeZero n] (x : ℂˣ) : x ∈ rootsOfUnity n ℂ ↔ ∃ i < n, Complex.exp (2 * ↑π * Complex.I * (↑i / ↑n)) = ↑x
Mathlib.RingTheory.RootsOfUnity.Complex · lines 113–128
Why a special case: The modulus of z is fixed at one and the starting angle at zero, and the roots are written as exponentials rather than as a cosine plus i times a sine.
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
ef790fbbcd49 · pair key 115ecbbb475c.
Polynomial.nthRoots_two_one special case
theorem Polynomial.nthRoots_two_one {R : Type u} [CommRing R] [IsDomain R] : Polynomial.nthRoots 2 1 = {-1, 1}
Mathlib.Algebra.Polynomial.Roots · lines 456–459
Why a special case: Only the degenerate case of two square roots of one is settled, and the declaration is stated over any integral domain rather than over ℂ 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, 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
7043796f43fc · pair key 0c33fef8e355.
Related, but states something else
IsPrimitiveRoot.nthRoots_eq related
theorem IsPrimitiveRoot.nthRoots_eq {R : Type*} [CommRing R] [IsDomain R] {n : ℕ} {ζ : R} : IsPrimitiveRoot ζ n → ∀ {α a : R}, α ^ n = a → Polynomial.nthRoots n a = Multiset.map (fun x ↦ ζ ^ x * α) (Multiset.range n)
Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots · lines 593–610
How it differs: It assumes an n-th root of the number is already given and describes the whole collection as its multiples by the powers of a root of unity, so the passage's explicit polar formula would still have to be derived from 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, 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
207b5abfb491 · pair key 005a9e38df4a.
Sign in to tag this passage
-
Notation · supporting · Definition and basic operations › Powers and roots
✓Formalized
Formalized: Formal Conjectures states a more general result (a definition).
(Here n√r is the usual (positive) nth root of the positive real number r.) Because sine and cosine are periodic, other integer values of k do not give other values.
Show in article · Read it in context on Wikipedia ↗
Real.nthRoot more general
def Real.nthRoot : ℕ → ℝ → ℝ
FormalConjecturesForMathlib.Analysis.SpecialFunctions.NthRoot · lines 35–36
Why more general: Lean's function is also defined at negative arguments, where for odd index it returns the negative real root.
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
e754a78. - Location key
3210ae356cbf · pair key 8c64451e23d0.
Real.rpow more general
def Real.rpow : ℝ → ℝ → ℝ
Mathlib.Analysis.SpecialFunctions.Pow.Real · lines 34–35
Why more general: Lean defines a real power for every real exponent, the article's root being the exponent one over 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. - 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
130ac551d346 · pair key 495b3b6d9ff7.
Sign in to tag this passage
-
Theorem · supporting · Definition and basic operations › Powers and roots
◔Partial
With community edits: Partial. As published it is Not formalized.
Partial, by a community edit: Mathlib states a special case (statement only: the proof is not finished).
(Here n√r is the usual (positive) nth root of the positive real number r.) Because sine and cosine are periodic, other integer values of k do not give other values.
Show in article · Read it in context on Wikipedia ↗
Complex.mem_rootsOfUnity special case
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 a special case: Complex.mem_rootsOfUnity says the complex n-th roots of unity are exactly exp(2πik/n) for whole numbers k with 0 ≤ k < n. Every integer k gives an n-th root of unity, so any other k repeats one of these n values. This is the passage's claim for z = 1 only. The lemma does not cover n-th roots of a general z, written as r^(1/n) at the angles (φ + 2kπ)/n.
✕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 28f5b05f39b9). - 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
Real.cos_periodic related
theorem Real.cos_periodic : Function.Periodic Real.cos (2 * π)
Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic · lines 312–313
How it differs: It records the periodicity of the cosine, which the article gives as its reason rather than as its claim.
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
8a46e0f6fe83 · pair key e250bab85538.
Complex.exp_periodic related
theorem Complex.exp_periodic : Function.Periodic Complex.exp (2 * ↑π * Complex.I)
Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic · lines 1221–1222
How it differs: It states that the complex exponential repeats after two pi times the imaginary unit.
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
a585eae90c1d · pair key b86e6a0f15b5.
Sign in to tag this passage
-
Theorem · main statement · Definition and basic operations › Powers and roots
◔Partial
Partial: Mathlib states a special case (proved).
For any z ≠ 0, there are, in particular n distinct complex n-th roots.
Show in article · Read it in context on Wikipedia ↗
Complex.card_rootsOfUnity special case
theorem Complex.card_rootsOfUnity (n : ℕ) [NeZero n] : Nat.card ↥(rootsOfUnity n ℂ) = n
Mathlib.RingTheory.RootsOfUnity.Complex · lines 130–131
Why a special case: Lean counts the roots as a subgroup of the units of the complex numbers rather than as a set of complex 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, 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
41aff567d154 · pair key 64c159d3680c.
IsPrimitiveRoot.card_nthRootsFinset_of_pow_eq special case
theorem IsPrimitiveRoot.card_nthRootsFinset_of_pow_eq {R : Type u} [CommRing R] [IsDomain R] {n : ℕ} {ζ α a : R} : IsPrimitiveRoot ζ n → α ^ n = a → a ≠ 0 → (Polynomial.nthRootsFinset n a).card = n
TauCeti.RingTheory.RootsOfUnity.PrimitiveRoots · lines 91–95
Why a special case: It asks for a primitive nth root and for one nth root of the element, both of which hold of every nonzero complex 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 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
094e879a462c · pair key 9351ca910fe5.
Related, but states something else
IsPrimitiveRoot.nthRoots_nodup related
theorem IsPrimitiveRoot.nthRoots_nodup {R : Type*} [CommRing R] [IsDomain R] {ζ : R} {n : ℕ} : IsPrimitiveRoot ζ n → ∀ {a : R}, a ≠ 0 → (Polynomial.nthRoots n a).Nodup
Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots · lines 670–680
How it differs: It says the multiset of nth roots of a nonzero element repeats no entry, without counting 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 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
8bb006cd72d2 · pair key 7a2455d890fb.
Sign in to tag this passage
-
Example · supporting · Definition and basic operations › Powers and roots
✕Not formalized
For example, there are 4 fourth roots of 1, namely z1 = 1, z2 = i, z3 = −1, z4 = −i.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt a6dcb94c64aa). - 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
IsPrimitiveRoot.card_nthRootsFinset_of_pow_eq related
theorem IsPrimitiveRoot.card_nthRootsFinset_of_pow_eq {R : Type u} [CommRing R] [IsDomain R] {n : ℕ} {ζ α a : R} : IsPrimitiveRoot ζ n → α ^ n = a → a ≠ 0 → (Polynomial.nthRootsFinset n a).card = n
TauCeti.RingTheory.RootsOfUnity.PrimitiveRoots · lines 91–95
How it differs: It counts the distinct nth roots of a nonzero element of a domain without naming any of them.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - 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
4bd42cc2723e · pair key 2fa5bfb8fc7d.
Sign in to tag this passage
-
Theorem · supporting · Definition and basic operations › Powers and roots
◔Partial
Partial: Mathlib states part of this (proved).
In general there is no natural way of distinguishing one particular complex nth root of a complex number. (This is in contrast to the roots of a positive real number x, which has a unique positive real n-th root, which is therefore commonly referred to as the n-th root of x.) One refers to this situation by saying that the nth root is an n-valued function of z.
Show in article · Read it in context on Wikipedia ↗
pow_left_strictMonoOn₀ states part
theorem pow_left_strictMonoOn₀ {M₀ : Type*} [MonoidWithZero M₀] [PartialOrder M₀] {n : ℕ} [PosMulStrictMono M₀] [MulPosMono M₀] : n ≠ 0 → StrictMonoOn (fun x ↦ x ^ n) {a | 0 ≤ a}
Mathlib.Algebra.Order.GroupWithZero.Basic · lines 597–599
Why only part: It gives the uniqueness the article contrasts with the complex case, and says nothing about the absence of a distinguished complex root.
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
ed25036a6b60 · pair key 80695dfadd40.
Real.pow_nthRoot states part
theorem Real.pow_nthRoot {n : ℕ} (r : ℝ) : n ≠ 0 ∧ 0 ≤ r ∨ Odd n → Real.nthRoot n r ^ n = r
FormalConjecturesForMathlib.Analysis.SpecialFunctions.NthRoot · lines 79–88
Why only part: It supplies the existence half of the contrast the article draws, leaving the complex side 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, 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
8be6dcbce0a6 · pair key af3678229440.
Sign in to tag this passage
-
Notation · supporting · Definition and basic operations › Powers and roots
✕Not formalized
(This is in contrast to the roots of a positive real number x, which has a unique positive real n-th root, which is therefore commonly referred to as the n-th root of x.) One refers to this situation by saying that the nth root is an n-valued function of z.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 02ddff4aa121). - 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
-
Theorem · main statement · Definition and basic operations › Fundamental theorem of algebra
✓Formalized
Formalized: Mathlib states this up to a convention difference (proved).
The fundamental theorem of algebra, of Carl Friedrich Gauss and Jean le Rond d'Alembert, states that for any complex numbers (called coefficients) a0, ..., an, the equation anzn + ⋯ + a1z + a0 = 0 has at least one complex solution z, provided that at least one of the higher coefficients a1, ..., an is nonzero.[19]
Show in article · Read it in context on Wikipedia ↗
Complex.exists_root close match
theorem Complex.exists_root {f : ℂ[X]} : 0 < f.degree → ∃ z, f.IsRoot z
Mathlib.Analysis.Complex.Polynomial.Basic · lines 37–48
Why close, not exact: Lean writes the equation as a polynomial over the complex numbers of positive degree, where the article lists its coefficients and asks that one of the higher ones be nonzero.
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
dbdb2a38221c · pair key b171c30b37c9.
Complex.isAlgClosed close match
instance Complex.isAlgClosed : IsAlgClosed ℂ
Mathlib.Analysis.Complex.Polynomial.Basic · lines 52–53
Why close, not exact: Lean packages the statement as a class instance for the complex numbers, whose field also covers the zero polynomial, where any number is a root.
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
6a7e934021ed · pair key e415b073c6c9.
Sign in to tag this passage
-
Theorem · supporting · Definition and basic operations › Fundamental theorem of algebra
◔Partial
Partial: TauCeti states part of this (proved).
This property does not hold for the field of rational numbers ℚ (the polynomial x2 − 2 does not have a rational root, because √2 is not a rational number) nor the real numbers ℝ (the polynomial x2 + 4 does not have a real root, because the square of x is positive for any real number x).
Show in article · Read it in context on Wikipedia ↗
not_isSquare_intCast_of_squarefree_of_ne_one states part
theorem not_isSquare_intCast_of_squarefree_of_ne_one {n : ℤ} : Squarefree n → n ≠ 1 → ¬IsSquare ↑n
TauCeti.Algebra.Squarefree · lines 94–99
Why only part: It gives the witness the article offers for the rationals, and not the conclusion that the field of rationals fails to be algebraically closed.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
83245ab. - Location key
9325a83b409b · pair key dff0570eb359.
Related, but states something else
irrational_sqrt_two related
theorem irrational_sqrt_two : Irrational √2
Mathlib.NumberTheory.Real.Irrational · lines 141–142
How it differs: It states that the real square root of two is not rational, which is the reason the article attaches to its first witness.
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
9ab7ad857c5e · pair key 07c3d028cbb9.
quadratic_ne_zero_of_discrim_ne_sq related
theorem quadratic_ne_zero_of_discrim_ne_sq {R : Type*} [CommRing R] {a b c : R} : (∀ (s : R), discrim a b c ≠ s ^ 2) → ∀ (x : R), a * (x * x) + b * x + c ≠ 0
Mathlib.Algebra.QuadraticDiscriminant · lines 74–76
How it differs: It rules out roots of a quadratic whose discriminant is no square, a hypothesis that over the reals needs the sign of squares supplied separately.
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
7006f3b12979 · pair key c38240f22a87.
Sign in to tag this passage
-
Definition · main statement · Definition and basic operations › Fundamental theorem of algebra
◔Partial
Partial: Mathlib states this exactly, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.
Because of this fact, ℂ is called an algebraically closed field.
Show in article · Read it in context on Wikipedia ↗
Complex.isAlgClosed exact match
instance Complex.isAlgClosed : IsAlgClosed ℂ
Mathlib.Analysis.Complex.Polynomial.Basic · lines 52–53
Note: Mathlib records this under the name of the fundamental theorem of algebra, as the predicate holding 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
f669a84aea48 · pair key bfc4f6179d15.
Complex.exists_root close match
theorem Complex.exists_root {f : ℂ[X]} : 0 < f.degree → ∃ z, f.IsRoot z
Mathlib.Analysis.Complex.Polynomial.Basic · lines 37–48
Why close, not exact: The library writes the property in root form instead of naming the predicate, and nonzero constants are outside the notion because they admit no root.
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
000896b84054 · pair key 8ba90c5ae101.
Sign in to tag this passage
-
Definition · supporting · Definition and basic operations › Fundamental theorem of algebra
◔Partial
Partial: FF.QuadraticAlgebras states part of this (a definition).
The field of complex numbers is defined as the (unique) algebraic extension field of the real numbers later in #Abstract algebraic definitions.
Show in article · Read it in context on Wikipedia ↗
QuadraticAlgebra.adjoinRootComplexEquivOfIrreducible states part
def QuadraticAlgebra.adjoinRootComplexEquivOfIrreducible (p : ℝ[X]) : Irreducible p → 1 < p.natDegree → AdjoinRoot p ≃ₐ[ℝ] ℂ
QuadraticAlgebras.RealComplexAdjoinRoot · lines 142–146
Why only part: The data produced is an ℝ-algebra isomorphism onto ℂ, which carries the uniqueness the passage attaches to the extension.
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
85a6b1b. - Location key
36502f146936 · pair key a4f13687ad3f.
Related, but states something else
Algebra.IsAlgebraic.of_finite related
instance Algebra.IsAlgebraic.of_finite (R : Type*) (A : Type*) [CommRing R] [Nontrivial R] [Ring A] [Algebra R A] [Module.Finite R A] : Algebra.IsAlgebraic R A
Mathlib.RingTheory.Algebraic.Integral · lines 108–109
Community Agent The pipeline said states part; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
How it differs: Algebra.IsAlgebraic.of_finite is a general instance: an algebra that is finite as a module over a nontrivial commutative ring is algebraic over it. Applied to the complex numbers as a two-dimensional real space, it shows they are algebraic over the reals. It does not define the complex numbers or say they are the unique such extension, which is what this definition passage is about.
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
fefdabc17842 · pair key 83b6ece4fd30.
Complex.isAlgClosed related
instance Complex.isAlgClosed : IsAlgClosed ℂ
Mathlib.Analysis.Complex.Polynomial.Basic · lines 52–53
How it differs: Being algebraically closed is why ℂ is the algebraic closure of ℝ, but the declaration states that property, not the passage's claim about extensions 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 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
d0cce3780679 · pair key e63d87946ab9.
Sign in to tag this passage
-
Theorem · supporting · History
✕Not formalized
The solution in radicals (without trigonometric functions) of a general cubic equation, when all three of its roots are real numbers, contains the square roots of negative numbers, a situation that cannot be rectified by factoring aided by the rational root test, if the cubic is irreducible; this is the so-called casus irreducibilis ('irreducible case').
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 5 queries and 3 candidates examined (receipt ff85b1026af8). - 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
-
Theorem · supporting · History
✓Formalized
Formalized: Mathlib states this exactly (proved).
Complex numbers thus form an algebraically closed field, where any polynomial equation has a root.
Show in article · Read it in context on Wikipedia ↗
Complex.isAlgClosed exact match
instance Complex.isAlgClosed : IsAlgClosed ℂ
Mathlib.Analysis.Complex.Polynomial.Basic · lines 52–53
Note: Mathlib's predicate says every polynomial over the field splits, equivalently that each nonconstant one has a root, which is how the passage spells out the property.
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
c159b8633115 · pair key 65a86d978a8b.
Complex.exists_root close match
theorem Complex.exists_root {f : ℂ[X]} : 0 < f.degree → ∃ z, f.IsRoot z
Mathlib.Analysis.Complex.Polynomial.Basic · lines 37–48
Why close, not exact: The library gives the root form directly rather than naming the predicate, and keeps the degree condition that the passage's own surrounding text 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, 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
bb4778be6a24 · pair key 57a9c9f9d4da.
Sign in to tag this passage
-
Theorem · supporting · History
✕Not formalized
In fact, it was proved later that the use of complex numbers is unavoidable when all three roots are real and distinct.[c]
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 5 queries and 3 candidates examined (receipt b15c83f08997). - 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
-
Theorem · main statement · History
✓Formalized
Formalized: Mathlib states a more general result (proved).
For instance, in 1730 Abraham de Moivre noted that the identities relating trigonometric functions of an integer multiple of an angle to powers of trigonometric functions of that angle could be re-expressed by the following de Moivre's formula:
(cos θ + isin θ)n = cos nθ + isin nθ.
Show in article · Read it in context on Wikipedia ↗
Complex.cos_add_sin_mul_I_pow more general
theorem Complex.cos_add_sin_mul_I_pow (n : ℕ) (z : ℂ) : (Complex.cos z + Complex.sin z * Complex.I) ^ n = Complex.cos (↑n * z) + Complex.sin (↑n * z) * Complex.I
Mathlib.Analysis.Complex.Trigonometric · lines 542–544
Why more general: The library proves it for an arbitrary complex argument, a wider setting than the passage's angle, writes the imaginary unit to the right of the sine, and lets the exponent range over ℕ, which covers the powers the displayed formula 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
5c74a1eacac4 · pair key bf1c245a3144.
Sign in to tag this passage
-
Theorem · main statement · History
✓Formalized
Formalized: Mathlib states this up to a convention difference (proved).
In 1748, Euler went further and obtained Euler's formula of complex analysis:[32]
eiθ = cos θ + isin θ
Show in article · Read it in context on Wikipedia ↗
Complex.exp_ofReal_mul_I close match
theorem Complex.exp_ofReal_mul_I (x : ℝ) : Complex.exp (↑x * Complex.I) = ↑(Real.cos x) + ↑(Real.sin x) * Complex.I
Mathlib.Analysis.Complex.Trigonometric · lines 538–539
Why close, not exact: The library writes the exponent as the angle times the imaginary unit and places that unit after the sine factor, and it casts the real trigonometric values into ℂ.
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
9bced931530b · pair key b62dd22580a9.
Complex.exp_mul_I more general
theorem Complex.exp_mul_I (x : ℂ) : Complex.exp (x * Complex.I) = Complex.cos x + Complex.sin x * Complex.I
Mathlib.Analysis.Complex.Trigonometric · lines 514–515
Why more general: Stated for every complex argument, a wider setting than the passage's real angle, with the imaginary unit written after each factor.
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
9aad639dc93b · pair key 3d6398903cca.
Sign in to tag this passage
-
Definition · main statement · Abstract algebraic definitions
◔Partial
Partial: TauCeti states part of this (proved).
One formal definition of the complex numbers is that they form the quadratic extension field of the real numbers such that the polynomial x2 + 1 = 0 splits.
Show in article · Read it in context on Wikipedia ↗
TauCeti.instIsQuadraticExtensionRealComplex states part
instance TauCeti.instIsQuadraticExtensionRealComplex : Algebra.IsQuadraticExtension ℝ ℂ
TauCeti.FieldTheory.Galois.Complex · lines 25–26
Why only part: The library records the degree-two half of the passage's description and says nothing about the splitting of the quadratic polynomial.
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
83245ab. - Location key
1adca348855a · pair key f8d92d6770f4.
Complex.isAlgClosed states part
instance Complex.isAlgClosed : IsAlgClosed ℂ
Mathlib.Analysis.Complex.Polynomial.Basic · lines 52–53
Why only part: Mathlib's predicate is that each polynomial over the field splits, so the splitting half of the passage follows from this declaration by 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
ae6af3312524 · pair key c7c291e226c7.
Related, but states something else
QuadraticAlgebra.adjoinRootComplexEquivOfRoot related
def QuadraticAlgebra.adjoinRootComplexEquivOfRoot (p : ℝ[X]) : Irreducible p → p.natDegree = 2 → (z : ℂ) → (Polynomial.aeval z) p = 0 → AdjoinRoot p ≃ₐ[ℝ] ℂ
QuadraticAlgebras.RealComplexAdjoinRoot · lines 88–96
How it differs: It identifies the root field of the passage's quadratic with ℂ, which is what lets the passage speak of the quadratic extension rather than one of many.
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
85a6b1b. - Location key
a55fdd101e6b · pair key a41010889ff8.
Sign in to tag this passage
-
Theorem · main statement · Abstract algebraic definitions
◔Partial
Partial: FF.QuadraticAlgebras states a special case (a definition).
Any two such fields are isomorphic; more generally, any non-trivial finite extension field of the reals is isomorphic to the complex field.
Show in article · Read it in context on Wikipedia ↗
QuadraticAlgebra.realComplexEquiv special case
def QuadraticAlgebra.realComplexEquiv : QuadraticAlgebra ℝ (-1) 0 ≃ₐ[ℝ] ℂ
QuadraticAlgebras.RealComplexAdjoinRoot · lines 47–63
Why a special case: Both of its fields are degree-two over the reals and contain a square root of minus one, so it is one instance of the pairs the passage quantifies 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
85a6b1b. - Location key
c8a295b3033b · pair key dae80a4d3dc5.
QuadraticAlgebra.adjoinRootComplexEquivOfRoot special case
def QuadraticAlgebra.adjoinRootComplexEquivOfRoot (p : ℝ[X]) : Irreducible p → p.natDegree = 2 → (z : ℂ) → (Polynomial.aeval z) p = 0 → AdjoinRoot p ≃ₐ[ℝ] ℂ
QuadraticAlgebras.RealComplexAdjoinRoot · lines 88–96
Why a special case: The second field is fixed to be ℂ, so it covers the pairs in which one member is the complex numbers rather than an arbitrary pair.
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
85a6b1b. - Location key
031ecf828c3c · pair key 6c148b0081e1.
Related, but states something else
Polynomial.IsSplittingField.algEquiv related
def Polynomial.IsSplittingField.algEquiv {K : Type v} (L : Type w) [Field K] [Field L] [Algebra K L] (f : K[X]) [h : Polynomial.IsSplittingField K L f] : L ≃ₐ[K] f.SplittingField
Mathlib.FieldTheory.SplittingField.Construction · lines 305–308
How it differs: It identifies any splitting field of a polynomial with the constructed one; getting the passage out of it needs the further fact that a degree-two extension in which the polynomial splits is a splitting field, and then a composition of two isomorphisms.
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
2c79a205944a · pair key 3da6a2693133.
Sign in to tag this passage
-
Theorem · main statement · Abstract algebraic definitions
◔Partial
Partial: FF.QuadraticAlgebras states a special case (a definition).
Any two such fields are isomorphic; more generally, any non-trivial finite extension field of the reals is isomorphic to the complex field.
Show in article · Read it in context on Wikipedia ↗
QuadraticAlgebra.adjoinRootComplexEquivOfIrreducible special case
def QuadraticAlgebra.adjoinRootComplexEquivOfIrreducible (p : ℝ[X]) : Irreducible p → 1 < p.natDegree → AdjoinRoot p ≃ₐ[ℝ] ℂ
QuadraticAlgebras.RealComplexAdjoinRoot · lines 142–146
Why a special case: The extensions it reaches are those presented as a root field of an irreducible real polynomial, a special shape of the arbitrary non-trivial finite extension the passage speaks 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, 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
85a6b1b. - Location key
83753a33c24f · pair key 5ee84ccdae04.
QuadraticAlgebra.realComplexEquiv special case
def QuadraticAlgebra.realComplexEquiv : QuadraticAlgebra ℝ (-1) 0 ≃ₐ[ℝ] ℂ
QuadraticAlgebras.RealComplexAdjoinRoot · lines 47–63
Why a special case: It handles a single named extension instead of every non-trivial finite 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
85a6b1b. - Location key
5f7fce59723d · pair key 80086a7d76f4.
Related, but states something else
Real.nonempty_algEquiv_or related
theorem Real.nonempty_algEquiv_or (F : Type*) [Field F] [Algebra ℝ F] [Algebra.IsAlgebraic ℝ F] : Nonempty (F ≃ₐ[ℝ] ℝ) ∨ Nonempty (F ≃ₐ[ℝ] ℂ)
Mathlib.Analysis.Complex.Polynomial.Basic · lines 58–60
How it differs: It gives the dichotomy that an algebraic extension of the reals is isomorphic over the reals to the reals or to the complexes; discarding the first alternative for a non-trivial extension needs a separate dimension 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, 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
660ee29e802d · pair key 48d870d4abbc.
Sign in to tag this passage
-
Definition · supporting · Abstract algebraic definitions › Construction as a quotient field
✓Formalized
Formalized: Mathlib states a more general result (a definition).
One approach to ℂ is via polynomials, i.e., expressions of the form p(X) = anXn + ⋯ + a1X + a0, where the coefficients a0, ..., an are real numbers.
Show in article · Read it in context on Wikipedia ↗
Polynomial more general
structure Polynomial (R : Type*) [Semiring R]
Mathlib.Algebra.Polynomial.Basic · lines 69–71
Why more general: Mathlib defines this type over an arbitrary semiring of coefficients, which covers the real coefficients of the passage and many others.
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
52cc0dee294d · pair key 4759bfc74c0d.
Polynomial.as_sum_range_C_mul_X_pow more general
theorem Polynomial.as_sum_range_C_mul_X_pow {R : Type u} [Semiring R] (p : R[X]) : p = ∑ i ∈ Finset.range (p.natDegree + 1), Polynomial.C (p.coeff i) * Polynomial.X ^ i
Mathlib.Algebra.Polynomial.Degree.Support · lines 94–96
Why more general: Stated for coefficients in any semiring, with the sum running up to the degree of p, which is the finite expression 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, 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
e9d789dcc45a · pair key 8ecf4e6e2bb6.
Sign in to tag this passage
-
Notation · supporting · Abstract algebraic definitions › Construction as a quotient field
✓Formalized
Formalized: Mathlib states a more general result (a definition).
The set of all such polynomials is denoted by ℝ[X].
Show in article · Read it in context on Wikipedia ↗
Polynomial.«term_[X]» more general
def Polynomial.«term_[X]» : Lean.TrailingParserDescr
Mathlib.Algebra.Polynomial.Basic · line 73
Why more general: Mathlib introduces the same bracket notation for an arbitrary coefficient ring rather than for the reals 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. - 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
0ce5c377fc9e · pair key 21c22ebfc937.
Polynomial more general
structure Polynomial (R : Type*) [Semiring R]
Mathlib.Algebra.Polynomial.Basic · lines 69–71
Why more general: The thing the passage's symbol names, defined in the library over any semiring of coefficients.
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
41dfe3a1cd79 · pair key 82263c070dc7.
Sign in to tag this passage
-
Theorem · supporting · Abstract algebraic definitions › Construction as a quotient field
✓Formalized
Formalized: Mathlib states a more general result (a definition).
Since sums and products of polynomials are again polynomials, this set ℝ[X] forms a commutative ring, called the polynomial ring (over the reals).
Show in article · Read it in context on Wikipedia ↗
Polynomial.semiring more general
instance Polynomial.semiring {R : Type u} [Semiring R] : Semiring (R[X])
Mathlib.Algebra.Polynomial.Basic · lines 266–269
Why more general: The instance also carries the semiring laws, which is more than the closure the passage records.
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
160c3ef6df75 · pair key 4a55316168b9.
Polynomial.commRing more general
instance Polynomial.commRing {R : Type u} [CommRing R] : CommRing (R[X])
Mathlib.Algebra.Polynomial.Basic · lines 1141–1144
Why more general: It carries the whole commutative ring structure, far beyond closure under the two operations.
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
f6021ded3d59 · pair key 0dd31dffdac0.
Sign in to tag this passage
-
Theorem · supporting · Abstract algebraic definitions › Construction as a quotient field
✓Formalized
Formalized: Mathlib states a more general result (a definition).
Since sums and products of polynomials are again polynomials, this set ℝ[X] forms a commutative ring, called the polynomial ring (over the reals).
Show in article · Read it in context on Wikipedia ↗
Polynomial.commRing more general
instance Polynomial.commRing {R : Type u} [CommRing R] : CommRing (R[X])
Mathlib.Algebra.Polynomial.Basic · lines 1141–1144
Why more general: Stated for coefficients in any commutative ring, the reals being one of them.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, 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
762480fd2924 · pair key dcdcdb95d9c3.
Related, but states something else
Polynomial.semiring related
instance Polynomial.semiring {R : Type u} [Semiring R] : Semiring (R[X])
Mathlib.Algebra.Polynomial.Basic · lines 266–269
How it differs: It supplies only the semiring structure, without additive inverses or commutative multiplication, so it falls short of what the passage asserts.
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
94a4ed6407b5 · pair key 74cb38e9de97.
Sign in to tag this passage
-
Definition · supporting · Abstract algebraic definitions › Construction as a quotient field
✓Formalized
Formalized: Mathlib states a more general result (a definition).
To every such polynomial p, one may assign the complex number p(i) = anin + ⋯ + a1i + a0, i.e., the value obtained by setting X = i.
Show in article · Read it in context on Wikipedia ↗
Polynomial.aeval more general
def Polynomial.aeval {R : Type u} {A : Type z} [CommSemiring R] [Semiring A] [Algebra R A] : A → R[X] →ₐ[R] A
Mathlib.Algebra.Polynomial.AlgebraMap · lines 259–260
Why more general: Defined for an arbitrary commutative base ring, algebra and point, of which the passage's reals, complexes and imaginary unit are one 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 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
c21287ce9b33 · pair key dc88ec088d9f.
Polynomial.aeval_eq_sum_range more general
theorem Polynomial.aeval_eq_sum_range {R : Type u} {S : Type v} [CommSemiring R] [Semiring S] [Algebra R S] {p : R[X]} (x : S) : (Polynomial.aeval x) p = ∑ i ∈ Finset.range (p.natDegree + 1), p.coeff i • x ^ i
Mathlib.Algebra.Polynomial.AlgebraMap · lines 524–527
Why more general: Holds over an arbitrary algebra, with the sum running to the degree of the polynomial, matching the finite expression 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. - 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
57105fc946ab · pair key b5a835631f1d.
Sign in to tag this passage
-
Definition · supporting · Abstract algebraic definitions › Construction as a quotient field
✓Formalized
Formalized: Mathlib states a more general result (a definition).
This defines a function ℝ[X] → ℂ
Show in article · Read it in context on Wikipedia ↗
Polynomial.aeval more general
def Polynomial.aeval {R : Type u} {A : Type z} [CommSemiring R] [Semiring A] [Algebra R A] : A → R[X] →ₐ[R] A
Mathlib.Algebra.Polynomial.AlgebraMap · lines 259–260
Why more general: Bundled as a homomorphism of real algebras, so it carries more structure than the bare function 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, 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
54ba2cfcd86e · pair key d16f8b4beade.
Polynomial.eval₂ more general
def Polynomial.eval₂ {R : Type*} {S : Type*} [Semiring R] [Semiring S] : (R →+* S) → S → R[X] → S
Mathlib.Algebra.Polynomial.Eval.Defs · lines 56–57
Why more general: Stated for any pair of semirings with a ring homomorphism and a point; the passage's case is 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 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
b3b1294f8102 · pair key 5ebd07e8d50c.
Sign in to tag this passage
-
Theorem · main statement · Abstract algebraic definitions › Construction as a quotient field
◐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).
This function is surjective since every complex number can be obtained in such a way: the evaluation of a linear polynomial a + bX at X = i is a + bi.
Show in article · Read it in context on Wikipedia ↗
Complex.adjoin_I 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: The passage says evaluating real polynomials at i reaches every complex number. Complex.adjoin_I says the real subalgebra generated by i is all of the complex numbers. Convention difference: Mathlib states this as 'the subalgebra generated by i is everything' rather than 'evaluation at i is surjective'; Algebra.adjoin_singleton_eq_range_aeval identifies that subalgebra with the range of evaluation at i.
✕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 f83fd350eacb). - 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
-
Theorem · supporting · Abstract algebraic definitions › Construction as a quotient field
✕Not formalized
This function is surjective since every complex number can be obtained in such a way: the evaluation of a linear polynomial a + bX at X = i is a + bi.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 7e33f98b7f43). - 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
-
Theorem · supporting · Abstract algebraic definitions › Construction as a quotient field
✓Formalized
Formalized: Mathlib states this up to a convention difference (proved).
However, the evaluation of polynomial X2 + 1 at i is 0, since i2 + 1 = 0. This polynomial is irreducible, i.e., cannot be written as a product of two linear polynomials.
Show in article · Read it in context on Wikipedia ↗
Complex.I_sq close match
theorem Complex.I_sq : Complex.I ^ 2 = -1
Mathlib.Basic.Complex.Basic · line 626
Why close, not exact: Lean records the square of the imaginary unit on its own, with the constant term on the right of the equation instead of added on the left.
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
d287c9d8ca40 · pair key c9e1ff759e41.
Sign in to tag this passage
-
Theorem · supporting · Abstract algebraic definitions › Construction as a quotient field
✓Formalized
Formalized: TauCeti states a more general result (proved).
However, the evaluation of polynomial X2 + 1 at i is 0, since i2 + 1 = 0. This polynomial is irreducible, i.e., cannot be written as a product of two linear polynomials.
Show in article · Read it in context on Wikipedia ↗
Polynomial.irreducible_X_sq_add_one more general
theorem Polynomial.irreducible_X_sq_add_one (K : Type*) [Field K] [LinearOrder K] [IsStrictOrderedRing K] : Irreducible (Polynomial.X ^ 2 + 1)
TauCeti.Algebra.Polynomial.XPowSubC · lines 73–77
Why more general: The declaration is stated for any field carrying a compatible linear order, and the reals are one of them.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, 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
cf576ff9c867 · pair key 775e14db0e15.
Sign in to tag this passage
-
Theorem · main statement · Abstract algebraic definitions › Construction as a quotient field
◔Partial
Partial: FF.QuadraticAlgebras states part of this (a definition).
Basic facts of abstract algebra then imply that the kernel of the above map is an ideal generated by this polynomial, and that the quotient by this ideal is a field, and that there is an isomorphism ℝ[X]/(X2 + 1)→ ≅ ℂ between the quotient ring and ℂ.
Show in article · Read it in context on Wikipedia ↗
QuadraticAlgebra.adjoinRootComplexEquivOfRoot states part
def QuadraticAlgebra.adjoinRootComplexEquivOfRoot (p : ℝ[X]) : Irreducible p → p.natDegree = 2 → (z : ℂ) → (Polynomial.aeval z) p = 0 → AdjoinRoot p ≃ₐ[ℝ] ℂ
QuadraticAlgebras.RealComplexAdjoinRoot · lines 88–96
Why only part: The equivalence it produces carries the real-algebra structure along with the ring structure, and it is stated for any real quadratic rather than this one 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, 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
85a6b1b. - Location key
52b72a9b6561 · pair key e8f7c362ee60.
AdjoinRoot.instField states part
instance AdjoinRoot.instField {K : Type*} [Field K] {f : K[X]} [Fact (Irreducible f)] : Field (AdjoinRoot f)
Mathlib.RingTheory.AdjoinRoot · lines 616–631
Why only part: The instance is stated for an arbitrary base field and an arbitrary irreducible polynomial 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 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
8dba69d92a43 · pair key 550f2b27d018.
Related, but states something else
minpoly.ker_aeval_eq_span_minpoly related
theorem minpoly.ker_aeval_eq_span_minpoly (A : Type*) {B : Type*} [Field A] [Ring B] [Algebra A B] (x : B) : RingHom.ker (Polynomial.aeval x) = A[X] ∙ minpoly A x
Mathlib.FieldTheory.Minpoly.Field · lines 128–132
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
3a10087e02d7 · pair key c868327c4104.
Complex.minpoly_I related
theorem Complex.minpoly_I {K : Type*} [Field K] [Algebra K ℂ] : Irreducible (Polynomial.X ^ 2 + 1) → minpoly K Complex.I = Polynomial.X ^ 2 + 1
TauCeti.Analysis.Complex.Minpoly · lines 33–35
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
83245ab. - Location key
2e78030ca0c5 · pair key c8755a06a35f.
Sign in to tag this passage
-
Theorem · supporting · Abstract algebraic definitions › Construction as a quotient field
✓Formalized
Formalized: TauCeti states this up to a convention difference (proved).
This definition expresses ℂ as a quadratic algebra.
Show in article · Read it in context on Wikipedia ↗
TauCeti.instIsQuadraticExtensionRealComplex close match
instance TauCeti.instIsQuadraticExtensionRealComplex : Algebra.IsQuadraticExtension ℝ ℂ
TauCeti.FieldTheory.Galois.Complex · lines 25–26
Why close, not exact: Mathlib calls the property a quadratic extension of the reals and unfolds it as freeness of rank two over 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
83245ab. - Location key
9e7839f7fbc4 · pair key 08ce4f641b57.
QuadraticAlgebra.realComplexEquiv close match
def QuadraticAlgebra.realComplexEquiv : QuadraticAlgebra ℝ (-1) 0 ≃ₐ[ℝ] ℂ
QuadraticAlgebras.RealComplexAdjoinRoot · lines 47–63
Why close, not exact: The library writes the claim as a real-algebra isomorphism with its own type of quadratic algebras at the parameters minus one and 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 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
85a6b1b. - Location key
28cf02fda25e · pair key b8d1afdabc3b.
Sign in to tag this passage
-
Theorem · supporting · Abstract algebraic definitions › Construction as a quotient field
✕Not formalized
Accepting that ℂ is algebraically closed, because it is an algebraic extension of ℝ in this approach, ℂ is therefore the algebraic closure of ℝ.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 4 candidates examined (receipt 71ee55a15935). - 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
-
Definition · main statement · Abstract algebraic definitions › Matrix representation of complex numbers
◔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.
Complex numbers a + bi can also be represented by 2 × 2 matrices that have the form (a−bba). Here the entries a and b are real numbers. As the sum and product of two such matrices is again of this form, these matrices form a subring of the ring of 2 × 2 matrices.
Show in article · Read it in context on Wikipedia ↗
Algebra.leftMulMatrix_complex close match
theorem Algebra.leftMulMatrix_complex (z : ℂ) : (Algebra.leftMulMatrix Complex.basisOneI) z = !![z.re, -z.im; z.im, z.re]
Mathlib.RingTheory.Complex · lines 19–30
Why close, not exact: Mathlib builds the matrix as the one of multiplication by the number in its basis of one and the imaginary unit, and the theorem unfolds that construction into the passage's four entries.
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
57f9d8be31e1 · pair key dd7db6e2ef55.
Matrix.val_planeConformalMatrix special case
theorem Matrix.val_planeConformalMatrix {R : Type*} [Field R] (a b : R) (hab : a ^ 2 + b ^ 2 ≠ 0) : ↑(Matrix.planeConformalMatrix a b hab) = !![a, -b; b, a]
Mathlib.LinearAlgebra.Matrix.GeneralLinearGroup.Basic · line 25
Why a special case: The entry formula is the passage's, while the invertibility hypothesis leaves out the number 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 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
3816fe2b2d0e · pair key 106087cc398a.
Sign in to tag this passage
-
Theorem · supporting · Abstract algebraic definitions › Matrix representation of complex numbers
✓Formalized
Formalized: Mathlib states a more general result (a definition).
As the sum and product of two such matrices is again of this form, these matrices form a subring of the ring of 2 × 2 matrices.
Show in article · Read it in context on Wikipedia ↗
AlgHom.range more general
def AlgHom.range {R : Type u} {A : Type v} {B : Type w} [CommSemiring R] [Semiring A] [Algebra R A] [Semiring B] [Algebra R B] : (A →ₐ[R] B) → Subalgebra R B
Mathlib.Algebra.Algebra.Subalgebra.Basic · lines 545–546
Why more general: Lean records the family as the range of an algebra map, stated for arbitrary base rings and algebras, so the object it builds carries more closure facts than the passage asks 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 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
25eb7ff7b993 · pair key d281ab008118.
Related, but states something else
Algebra.leftMulMatrix_complex related
theorem Algebra.leftMulMatrix_complex (z : ℂ) : (Algebra.leftMulMatrix Complex.basisOneI) z = !![z.re, -z.im; z.im, z.re]
Mathlib.RingTheory.Complex · lines 19–30
How it differs: It computes the matrix of multiplication by a complex number and so pins down the family the passage talks about, but on its own it asserts nothing about sums or products.
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
03055d1f7bdb · pair key 98e40aad8725.
Sign in to tag this passage
-
Theorem · supporting · Abstract algebraic definitions › Matrix representation of complex numbers
✓Formalized
Formalized: Mathlib states a more general result (a definition).
As the sum and product of two such matrices is again of this form, these matrices form a subring of the ring of 2 × 2 matrices.
Show in article · Read it in context on Wikipedia ↗
AlgHom.range more general
def AlgHom.range {R : Type u} {A : Type v} {B : Type w} [CommSemiring R] [Semiring A] [Algebra R A] [Semiring B] [Algebra R B] : (A →ₐ[R] B) → Subalgebra R B
Mathlib.Algebra.Algebra.Subalgebra.Basic · lines 545–546
Why more general: Lean produces a subalgebra over the reals, which records closure under real scalars as well as under the ring operations the passage mentions, and it is stated for arbitrary base rings and algebras.
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
dd770a657277 · pair key 8923d4779ee4.
Related, but states something else
Algebra.leftMulMatrix_complex related
theorem Algebra.leftMulMatrix_complex (z : ℂ) : (Algebra.leftMulMatrix Complex.basisOneI) z = !![z.re, -z.im; z.im, z.re]
Mathlib.RingTheory.Complex · lines 19–30
How it differs: It states which matrix a complex number gives, which is what identifies the carrier of the subring, but it makes no subring claim 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 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
1a4d6829f553 · pair key 9fd3a0bf0d10.
Sign in to tag this passage
-
Theorem · main statement · Abstract algebraic definitions › Matrix representation of complex numbers
✕Not formalized
A simple computation shows that the map a + ib ↦ (a−bba) is a ring isomorphism from the field of complex numbers to the ring of these matrices, proving that these matrices form a field.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 674bff63cd08). - 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
Algebra.leftMulMatrix_complex related
theorem Algebra.leftMulMatrix_complex (z : ℂ) : (Algebra.leftMulMatrix Complex.basisOneI) z = !![z.re, -z.im; z.im, z.re]
Mathlib.RingTheory.Complex · lines 19–30
How it differs: It states the value of the passage's map on every complex number, but it says nothing about that map being an isomorphism onto the matrix family, and nothing about that family being a field.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, 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
4180bfb426ce · pair key b2341ce4cb34.
AlgHom.range related
def AlgHom.range {R : Type u} {A : Type v} {B : Type w} [CommSemiring R] [Semiring A] [Algebra R A] [Semiring B] [Algebra R B] : (A →ₐ[R] B) → Subalgebra R B
Mathlib.Algebra.Algebra.Subalgebra.Basic · lines 545–546
How it differs: It gives the target subring of the passage's correspondence but provides no equivalence between the complex numbers and that subring.
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
e340af7ceda5 · pair key b9c86a0d738a.
Sign in to tag this passage
-
Theorem · supporting · Abstract algebraic definitions › Matrix representation of complex numbers
◔Partial
Partial: Mathlib states part of this (proved).
This isomorphism associates the square of the absolute value of a complex number with the determinant of the corresponding matrix, and the conjugate of a complex number with the transpose of the matrix.
Show in article · Read it in context on Wikipedia ↗
Algebra.norm_complex_eq states part
theorem Algebra.norm_complex_eq : Algebra.norm ℝ = ↑Complex.normSq
Mathlib.RingTheory.Complex · lines 42–43
Why only part: Lean writes the determinant of the multiplication matrix as the algebra norm over the reals and writes the squared modulus as normSq, so the same equation appears under those two 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. - 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
9127538fc851 · pair key d7fce54f7ad2.
Related, but states something else
Complex.toMatrix_conjAe related
theorem Complex.toMatrix_conjAe : (LinearMap.toMatrix Complex.basisOneI Complex.basisOneI) ↑↑Complex.conjAe = !![1, 0; 0, -1]
Mathlib.LinearAlgebra.Complex.Module · lines 263–266
How it differs: It computes the matrix of the conjugation map itself in the basis one and i, which is a different object from the transpose of the matrix attached to a complex 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 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
3787ff083f29 · pair key b0092c3f0d72.
Algebra.norm_eq_matrix_det related
theorem Algebra.norm_eq_matrix_det {R : Type*} {S : Type*} [CommRing R] [Ring S] [Algebra R S] {ι : Type w} [Fintype ι] [DecidableEq ι] (b : Module.Basis ι R S) (s : S) : (Algebra.norm R) s = ((Algebra.leftMulMatrix b) s).det
Mathlib.RingTheory.Norm.Defs · lines 82–84
How it differs: It links the algebra norm to the determinant of the multiplication matrix for any basis, which is the reading used above, but on its own it names no complex absolute 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 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
0a2206ed0f43 · pair key 9a3affac48b1.
Sign in to tag this passage
-
Theorem · supporting · Abstract algebraic definitions › Matrix representation of complex numbers
✓Formalized
Formalized: Mathlib states a more general result (proved).
The polar form representation of complex numbers explicitly gives these matrices as scaled rotation matrices. r(cos θ + isin θ) ↦ (rcos θ−rsin θrsin θrcos θ) In particular, the case of r = 1, which is |a + ib| = √a2 + b2 = 1, gives (unscaled) rotation matrices.
Show in article · Read it in context on Wikipedia ↗
Algebra.leftMulMatrix_complex more general
theorem Algebra.leftMulMatrix_complex (z : ℂ) : (Algebra.leftMulMatrix Complex.basisOneI) z = !![z.re, -z.im; z.im, z.re]
Mathlib.RingTheory.Complex · lines 19–30
Why more general: The declaration states the correspondence for an arbitrary complex number in terms of its real and imaginary parts; the passage reads it off at a number written in polar 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 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
06b75876870b · pair key 5ed9af0ff9b4.
Related, but states something else
Matrix.val_planeConformalMatrix related
theorem Matrix.val_planeConformalMatrix {R : Type*} [Field R] (a b : R) (hab : a ^ 2 + b ^ 2 ≠ 0) : ↑(Matrix.planeConformalMatrix a b hab) = !![a, -b; b, a]
Mathlib.LinearAlgebra.Matrix.GeneralLinearGroup.Basic · line 25
How it differs: It only unfolds a packaged invertible matrix to its entries and makes no claim about which complex number produces 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, 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
8cf92b1ed125 · pair key c1ad8fc8fa6a.
Sign in to tag this passage
-
Theorem · supporting · Abstract algebraic definitions › Matrix representation of complex numbers
✓Formalized
Formalized: Mathlib states this up to a convention difference (proved).
r(cos θ + isin θ) ↦ (rcos θ−rsin θrsin θrcos θ) In particular, the case of r = 1, which is |a + ib| = √a2 + b2 = 1, gives (unscaled) rotation matrices.
Show in article · Read it in context on Wikipedia ↗
toMatrix_rotation close match
theorem toMatrix_rotation (a : Circle) : (LinearMap.toMatrix Complex.basisOneI Complex.basisOneI) ↑(rotation a).toLinearEquiv = ↑(Matrix.planeConformalMatrix (↑a).re (↑a).im ⋯)
Mathlib.Analysis.Complex.Isometry · lines 142–150
Why close, not exact: Lean calls the complex numbers of modulus one the circle and writes the matrix through planeConformalMatrix of the real and imaginary parts, where the passage writes the same entries as cosine and sine of an angle.
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
1ad76e935d24 · pair key f7a6f0f184f0.
Related, but states something else
Matrix.val_planeConformalMatrix related
theorem Matrix.val_planeConformalMatrix {R : Type*} [Field R] (a b : R) (hab : a ^ 2 + b ^ 2 ≠ 0) : ↑(Matrix.planeConformalMatrix a b hab) = !![a, -b; b, a]
Mathlib.LinearAlgebra.Matrix.GeneralLinearGroup.Basic · line 25
How it differs: It only unfolds the packaged matrix to its entries and asserts nothing about complex numbers of 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 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
eeb97780fa4d · pair key a1428359ed82.
Sign in to tag this passage
-
Definition · main statement · Complex analysis › Convergence
✕Not formalized
A sequence of complex numbers is said to converge if and only if its real and imaginary parts do.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 13fcdbfbe4e6). - 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
Complex.equivRealProdCLM related
def Complex.equivRealProdCLM : ℂ ≃L[ℝ] ℝ × ℝ
Mathlib.Analysis.Complex.Basic · lines 134–136
How it differs: It is the continuous linear equivalence between the complex numbers and pairs of reals, from which the passage would follow only together with a transfer lemma for limits and the componentwise criterion in 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 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
a3a766e8d5ef · pair key 0c78b1a3b16f.
RCLike.hasSum_iff related
theorem RCLike.hasSum_iff {α : Type*} {𝕜 : Type*} [RCLike 𝕜] {L : SummationFilter α} (f : α → 𝕜) (c : 𝕜) : HasSum f c L ↔ HasSum (fun x ↦ RCLike.re (f x)) (RCLike.re c) L ∧ HasSum (fun x ↦ RCLike.im (f x)) (RCLike.im c) L
Mathlib.Analysis.Complex.Basic · lines 544–549
How it differs: It splits summability of a family into its real and imaginary parts, which is about sums rather than about convergence of a sequence.
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
ac4c97b63fbb · pair key 4ac8e1055be8.
Prod.tendsto_iff related
theorem Prod.tendsto_iff {Y : Type v} {Z : Type*} [TopologicalSpace Y] [TopologicalSpace Z] {X : Type*} (seq : X → Y × Z) {f : Filter X} (p : Y × Z) : Filter.Tendsto seq f (𝓝 p) ↔ Filter.Tendsto (fun n ↦ (seq n).1) f (𝓝 p.1) ∧ Filter.Tendsto (fun n ↦ (seq n).2) f (𝓝 p.2)
Mathlib.Topology.Constructions.SumProd · lines 294–297
How it differs: It gives the componentwise criterion for convergence into a product of two spaces, and the complex numbers are not that product until one inserts the equivalence above.
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
a665ef2d8a92 · pair key d80f19606d9c.
Sign in to tag this passage
-
Theorem · supporting · Complex analysis › Convergence
✓Formalized
Formalized: Mathlib states a more general result (proved).
This is equivalent to the (ε, δ)-definition of limits, where the absolute value of real numbers is replaced by the one of complex numbers.
Show in article · Read it in context on Wikipedia ↗
Metric.tendsto_atTop more general
theorem Metric.tendsto_atTop {α : Type u} {β : Type v} [PseudoMetricSpace α] [Nonempty β] [SemilatticeSup β] {u : β → α} {a : α} : Filter.Tendsto u Filter.atTop (𝓝 a) ↔ ∀ ε > 0, ∃ N, ∀ n ≥ N, Dist.dist (u n) a < ε
Mathlib.Topology.MetricSpace.Pseudo.Defs · lines 910–913
Why more general: Lean states the criterion for any pseudometric space and any directed index; at the complex numbers the distance is the modulus of the difference, which is the form 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
27a7973e6a63 · pair key 518e2c9d2fb0.
Related, but states something else
Complex.dist_eq related
theorem Complex.dist_eq (z w : ℂ) : Dist.dist z w = ‖z - w‖
Mathlib.Analysis.Complex.Norm · line 234
How it differs: It identifies the distance of two complex numbers with the norm of their difference, which is how the previous record's distances become the complex absolute 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. - 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
9ed6b7787518 · pair key e524940494de.
Sign in to tag this passage
-
Theorem · main statement · Complex analysis › Convergence
✓Formalized
Formalized by 2 parts together:
Complex.instCompleteSpace Mathlib (proved)- C with the metric given by the absolute value of the difference is a complete metric space
Complex.norm_add_le' Mathlib (proved)- the absolute value of a sum of two complex numbers is at most the sum of their absolute values
From a more abstract point of view, ℂ, endowed with the metric d(z1, z2) = |z1 − z2| is a complete metric space, which notably includes the triangle inequality |z1 + z2| ≤ |z1| + |z2| for any two complex numbers z1 and z2.
Show in article · Read it in context on Wikipedia ↗
Complex.instCompleteSpace states part
instance Complex.instCompleteSpace : CompleteSpace ℂ
Mathlib.Analysis.Complex.Basic · lines 127–128
Why only part: Mathlib puts on the complex numbers the distance given by the modulus of the difference, so completeness here is completeness for the passage's metric.
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
0b540873536a · pair key ed5eecda6e53.
Complex.norm_add_le' states part
theorem Complex.norm_add_le' (z w : ℂ) : ‖z + w‖ ≤ ‖z‖ + ‖w‖
Mathlib.Analysis.Complex.Norm · lines 48–55
Why only part: Lean writes the modulus of a complex number as its norm, so this is the inequality 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 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
ee279c2e2aa5 · pair key 24e84db3b909.
Sign in to tag this passage
-
Definition · main statement · Complex analysis › Complex exponential
✓Formalized
Formalized: Mathlib states this exactly (a definition).
Like in real analysis, this notion of convergence is used to construct a number of elementary functions: the exponential function exp z, also written ez, is defined as the infinite series, which can be shown to converge for any z: exp z := 1 + z + z22 ⋅ 1 + z33 ⋅ 2 ⋅ 1 + ⋯ = ∑∞n = 0 znn!. For example, exp(1) is Euler's number e ≈ 2.718.
Show in article · Read it in context on Wikipedia ↗
Complex.exp exact match
def Complex.exp : ℂ → ℂ
Mathlib.Analysis.Complex.Exponential · lines 63–64
Note: Mathlib builds the value as the limit of the partial sums of the series the passage writes, so the function exists at every complex argument, which carries the convergence the passage asserts.
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
7480b7841966 · pair key 28abc8a26502.
Related, but states something else
NormedSpace.exp_eq_tsum_div related
theorem NormedSpace.exp_eq_tsum_div {𝔸 : Type*} [DivisionRing 𝔸] [TopologicalSpace 𝔸] [IsTopologicalRing 𝔸] [CharZero 𝔸] : NormedSpace.exp = fun x ↦ ∑' (n : ℕ), x ^ n / ↑n.factorial
Mathlib.Analysis.Normed.Algebra.Exponential · lines 262–265
How it differs: It writes the abstract exponential of such an algebra as the sum of the passage's series, but it speaks of the general exponential, which another lemma identifies with the complex 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
13140178ead1 · pair key dc4c4b5c827b.
Sign in to tag this passage
-
Example · supporting · Complex analysis › Complex exponential
◔Partial
Partial: Mathlib states part of this (proved).
…function exp z, also written ez, is defined as the infinite series, which can be shown to converge for any z: exp z := 1 + z + z22 ⋅ 1 + z33 ⋅ 2 ⋅ 1 + ⋯ = ∑∞n = 0 znn!. For example, exp(1) is Euler's number e ≈ 2.718.
Show in article · Read it in context on Wikipedia ↗
Real.exp_one_gt_d9 states part
theorem Real.exp_one_gt_d9 : 2.7182818283 < Real.exp 1
Mathlib.Analysis.Complex.ExponentialBounds · lines 35–36
Why only part: Mathlib has no separate constant for Euler's number: it is the exponential at one, and the complex exponential at one is the cast of this real 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, 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
41d07296f635 · pair key c8935483bfb8.
Real.exp_one_lt_d9 states part
theorem Real.exp_one_lt_d9 : Real.exp 1 < 2.7182818286
Mathlib.Analysis.Complex.ExponentialBounds · lines 38–39
Why only part: Together with the matching lower bound this pins the value the passage rounds to 2.718.
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
02d8445b9706 · pair key 64899b141a2c.
Sign in to tag this passage
-
Theorem · main statement · Complex analysis › Complex exponential
✓Formalized
Formalized: Mathlib states this exactly (proved).
Euler's formula states: exp(iφ) = cos φ + isin φ for any real number φ.
Show in article · Read it in context on Wikipedia ↗
Complex.exp_ofReal_mul_I exact match
theorem Complex.exp_ofReal_mul_I (x : ℝ) : Complex.exp (↑x * Complex.I) = ↑(Real.cos x) + ↑(Real.sin x) * Complex.I
Mathlib.Analysis.Complex.Trigonometric · lines 538–539
Note: Lean writes the product of the angle with the imaginary unit in the other order and casts the real cosine and sine into the complex 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, 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
905d5fe98a0a · pair key 4c911983cd76.
Complex.exp_mul_I more general
theorem Complex.exp_mul_I (x : ℂ) : Complex.exp (x * Complex.I) = Complex.cos x + Complex.sin x * Complex.I
Mathlib.Analysis.Complex.Trigonometric · lines 514–515
Why more general: The declaration gives the same identity for every complex argument, and the passage's angle is one of these.
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
b1031f68d879 · pair key 7898069394f0.
Sign in to tag this passage
-
Theorem · main statement · Complex analysis › Complex exponential
✓Formalized
Formalized: Mathlib states this exactly (proved).
As a special case, this includes Euler's identity exp(iπ) = −1.
Show in article · Read it in context on Wikipedia ↗
Complex.exp_pi_mul_I exact match
theorem Complex.exp_pi_mul_I : Complex.exp (↑π * Complex.I) = -1
Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic · lines 1231–1232
Note: Lean writes the product with the imaginary unit on the right, which is the same complex number as in 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
0bd8201107ce · pair key 5595d7fb6ec2.
Sign in to tag this passage
-
Theorem · main statement · Complex analysis › Complex logarithm
✓Formalized
Formalized by 2 parts together (more general):
Real.exp_log Mathlib (proved)- for every positive real t some real x satisfies exp(x) = t
Real.exp_injective Mathlib (proved)
For any positive real number t, there is a unique real number x such that exp(x) = t.
Show in article · Read it in context on Wikipedia ↗
Real.exp_log states part
theorem Real.exp_log {x : ℝ} : 0 < x → Real.exp (Real.log x) = x
Mathlib.Analysis.SpecialFunctions.Log.Basic · lines 59–61
Why only part: The declaration names a solution outright, and the existence conjunct is what remains when the name is forgotten.
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
f32bdb44d94a · pair key 2f4640b0cb26.
Real.exp_injective states part
theorem Real.exp_injective : Function.Injective Real.exp
Mathlib.Analysis.Complex.Exponential · lines 320–321
Why only part: Uniqueness of the solution at a given value is injectivity applied to two candidate solutions.
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
e559e95b45ff · pair key ab4323a857b4.
Related, but states something else
Real.expOrderIso related
def Real.expOrderIso : ℝ ≃o ↑(Set.Ioi 0)
Mathlib.Analysis.SpecialFunctions.Exp · lines 304–309
How it differs: It is an order isomorphism from the reals onto the positive reals, but its underlying map is tied to the exponential only by a separate lemma, so on its own it does not speak of the passage's function.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. - Re-checked 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
65443539e572 · pair key da5f64bcde0f.
Sign in to tag this passage
-
Definition · main statement · Complex analysis › Complex logarithm
✓Formalized
Formalized: Mathlib states this exactly (a definition).
This leads to the definition of the natural logarithm as the inverse ln: ℝ+ → ℝ; x ↦ ln x of the exponential function.
Show in article · Read it in context on Wikipedia ↗
Real.log exact match
def Real.log : ℝ → ℝ
Mathlib.Analysis.SpecialFunctions.Log.Basic · lines 44–45
Note: Lean lets the function take every real argument and fixes a default value outside the positive reals, which the passage's mathematics does not use.
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
62da420396e5 · pair key 645daa773ecd.
Related, but states something else
Real.exp_log related
theorem Real.exp_log {x : ℝ} : 0 < x → Real.exp (Real.log x) = x
Mathlib.Analysis.SpecialFunctions.Log.Basic · lines 59–61
How it differs: It states that the exponential undoes the logarithm on positive arguments, unfolding the defining property the passage glosses rather than giving the map 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. - Re-checked 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
00c6880b4b86 · pair key 0a0fe595e5ac.
Sign in to tag this passage
-
Theorem · main statement · Complex analysis › Complex logarithm
◔Partial
Partial: Mathlib states part of this (proved).
The situation is different for complex numbers, since exp(z + 2πi) = exp zexp(2πi) = exp z by the functional equation and Euler's identity.
Show in article · Read it in context on Wikipedia ↗
Complex.exp_periodic states part
theorem Complex.exp_periodic : Function.Periodic Complex.exp (2 * ↑π * Complex.I)
Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic · lines 1221–1222
Why only part: Periodicity with that period is the equation the passage displays; that the exponential therefore fails to be injective is left to be read off from 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
0d35d571112d · pair key dfb2dea27c69.
Complex.exp_eq_exp_iff_exists_int states part
theorem Complex.exp_eq_exp_iff_exists_int {x y : ℂ} : Complex.exp x = Complex.exp y ↔ ∃ n, x = y + ↑n * (2 * ↑π * Complex.I)
Mathlib.Analysis.SpecialFunctions.Complex.Log · lines 172–173
Why only part: It characterises when two complex numbers share an exponential, and the passage's equality is one case 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 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
12d113b46708 · pair key 071ffd6be05b.
Sign in to tag this passage
-
Example · supporting · Complex analysis › Complex logarithm
◔Partial
With community edits: Partial. As published it is Formalized.
Partial, by a community edit: Mathlib states part of this (proved).
For example, eiπ = e3iπ = −1 , so both iπ and 3iπ are possible values for the complex logarithm of −1.
Show in article · Read it in context on Wikipedia ↗
Complex.exp_pi_mul_I states part
theorem Complex.exp_pi_mul_I : Complex.exp (↑π * Complex.I) = -1
Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic · lines 1231–1232
Community Agent The pipeline said exact match; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
Why only part: Complex.exp_pi_mul_I states that e^(iπ) = -1 (Lean writes the exponent as π times I). This is one clause of the passage's chain e^(iπ) = e^(3iπ) = -1. The declaration does not state the other clause, e^(3iπ) = -1, so it formalizes only part 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 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
4ade6eeebdb4 · pair key fc1ef2ec19da.
Related, but states something else
Complex.exp_two_pi_mul_I related
theorem Complex.exp_two_pi_mul_I : Complex.exp (2 * ↑π * Complex.I) = 1
Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic · lines 1239–1240
How it differs: It gives the value one at two pi times I, which is what turns the middle term of the chain into the same 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. - 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
a46faab1db69 · pair key 50b2ad9e614d.
Sign in to tag this passage
-
Theorem · supporting · Complex analysis › Complex logarithm
◔Partial
Partial: Mathlib states part of this (proved).
For example, eiπ = e3iπ = −1 , so both iπ and 3iπ are possible values for the complex logarithm of −1.
Show in article · Read it in context on Wikipedia ↗
Complex.exp_pi_mul_I states part
theorem Complex.exp_pi_mul_I : Complex.exp (↑π * Complex.I) = -1
Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic · lines 1231–1232
Why only part: The second number the passage names, three times i pi, is not reached by this equality on 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 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
c50a9b6e7675 · pair key 4587ebb44e65.
Related, but states something else
Complex.exp_add_pi_mul_I related
theorem Complex.exp_add_pi_mul_I (z : ℂ) : Complex.exp (z + ↑π * Complex.I) = -Complex.exp z
Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic · lines 1260–1261
How it differs: Adding pi times I to an exponent flips the sign of the exponential, which reaches the second value only together with the value at two pi times I.
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
24c5698d5058 · pair key cd82b90b1def.
Complex.exp_eq_exp_iff_exists_int related
theorem Complex.exp_eq_exp_iff_exists_int {x y : ℂ} : Complex.exp x = Complex.exp y ↔ ∃ n, x = y + ↑n * (2 * ↑π * Complex.I)
Mathlib.Analysis.SpecialFunctions.Complex.Log · lines 172–173
How it differs: It shows the two exponents have equal exponentials, without saying what that common value is.
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
972b1b282462 · pair key 475cc4ac4b5d.
Sign in to tag this passage
-
Definition · main statement · Complex analysis › Complex logarithm
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
In general, given any non-zero complex number w, any number z solving the equation exp z = w is called a complex logarithm of w, denoted log w.
Show in article · Read it in context on Wikipedia ↗
Complex.log close match
def Complex.log : ℂ → ℂ
Mathlib.Analysis.SpecialFunctions.Complex.Log · lines 30–31
Why close, not exact: Lean's log is the solution of the exponential equation whose imaginary part lies in the interval from minus pi to pi, while the article writes log w for a solution of that same 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
61c7e5909615 · pair key 7cf277a3c122.
Complex.exp_log close match
theorem Complex.exp_log {x : ℂ} : x ≠ 0 → Complex.exp (Complex.log x) = x
Mathlib.Analysis.SpecialFunctions.Complex.Log · lines 41–45
Why close, not exact: It spells the defining condition out for the library's log, with the same nonzero hypothesis the article 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, 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
28a383ffb153 · pair key 4f7ffa4c285b.
Sign in to tag this passage
-
Theorem · main statement · Complex analysis › Complex logarithm
◔Partial
Partial: Mathlib states part of this (proved).
It can be shown that these numbers satisfy z = log w = ln |w| + iarg w, where arg is the argument defined above, and ln the (real) natural logarithm. As arg is a multivalued function, unique only up to a multiple of 2π, log is also multivalued.
Show in article · Read it in context on Wikipedia ↗
Complex.log_re states part
theorem Complex.log_re (x : ℂ) : (Complex.log x).re = Real.log ‖x‖
Mathlib.Analysis.SpecialFunctions.Complex.Log · line 33
Why only part: The imaginary half of the formula comes from 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 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
bddd6e07d41b · pair key e0e94a376acb.
Complex.log_im states part
theorem Complex.log_im (x : ℂ) : (Complex.log x).im = x.arg
Mathlib.Analysis.SpecialFunctions.Complex.Log · line 35
Why only part: The real half of the formula comes from 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: 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
eba487a70148 · pair key 01475939fc4b.
Related, but states something else
Complex.norm_mul_exp_arg_mul_I related
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
How it differs: The polar decomposition gives the formula back only with the real exponential and logarithm lemma added.
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
684b9a4b4992 · pair key 0db0ebc911df.
Sign in to tag this passage
-
Theorem · supporting · Complex analysis › Complex logarithm
✓Formalized
Formalized: Mathlib states this up to a convention difference (proved).
As arg is a multivalued function, unique only up to a multiple of 2π, log is also multivalued.
Show in article · Read it in context on Wikipedia ↗
Complex.exp_eq_exp_iff_exists_int close match
theorem Complex.exp_eq_exp_iff_exists_int {x y : ℂ} : Complex.exp x = Complex.exp y ↔ ∃ n, x = y + ↑n * (2 * ↑π * Complex.I)
Mathlib.Analysis.SpecialFunctions.Complex.Log · lines 172–173
Why close, not exact: Lean writes the ambiguity through equality of exponentials rather than through the logarithm, and its shift index runs over the integers in the type 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 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
a994b44344b5 · pair key a8491195b865.
Complex.log_exp_exists states part
theorem Complex.log_exp_exists (z : ℂ) : ∃ n, Complex.log (Complex.exp z) = z + ↑n * (2 * ↑π * Complex.I)
Mathlib.Analysis.SpecialFunctions.Complex.Log · lines 180–183
Why only part: It fixes one of the two numbers to be the principal value rather than comparing arbitrary logarithms.
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
8d5cd12e83d6 · pair key 47af9f52a1a6.
Related, but states something else
Complex.exp_periodic related
theorem Complex.exp_periodic : Function.Periodic Complex.exp (2 * ↑π * Complex.I)
Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic · lines 1221–1222
How it differs: Periodicity gives that such a shift keeps the exponential, but not that every pair of logarithms differs by 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 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
962a3b4ce865 · pair key 260130ca690e.
Sign in to tag this passage
-
Definition · supporting · Complex analysis › Complex logarithm
✓Formalized
Formalized: Mathlib states this exactly (a definition).
The principal value of log is often taken by restricting the imaginary part to the interval (−π, π].
Show in article · Read it in context on Wikipedia ↗
Complex.log exact match
def Complex.log : ℂ → ℂ
Mathlib.Analysis.SpecialFunctions.Complex.Log · lines 30–31
Note: At the input zero Lean returns zero, a default outside the domain of nonzero numbers that the passage leaves without a 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 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
596af5573e99 · pair key 679cf746d8e3.
Complex.neg_pi_lt_log_im states part
theorem Complex.neg_pi_lt_log_im (x : ℂ) : -π < (Complex.log x).im
Mathlib.Analysis.SpecialFunctions.Complex.Log · line 37
Why only part: It gives the open end of the interval 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 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
4e053d3c8e0f · pair key 814100d86784.
Complex.log_im_le_pi states part
theorem Complex.log_im_le_pi (x : ℂ) : (Complex.log x).im ≤ π
Mathlib.Analysis.SpecialFunctions.Complex.Log · line 39
Why only part: It gives the closed end of the interval 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 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
67d2b9380e19 · pair key 09b674d87998.
Sign in to tag this passage
-
Theorem · supporting · Complex analysis › Complex logarithm
◔Partial
Partial: Mathlib states a special case (a definition).
This leads to the complex logarithm being a bijective function taking values in the strip ℝ+ + i (−π, π] (that is denoted S0 in the above illustration) ln: ℂ× → ℝ+ + i (−π, π].
Show in article · Read it in context on Wikipedia ↗
Complex.expOpenPartialHomeomorph special case
def Complex.expOpenPartialHomeomorph : OpenPartialHomeomorph ℂ ℂ
Mathlib.Analysis.SpecialFunctions.Complex.Log · lines 297–314
Why a special case: Its two sets are the passage's pair with the boundary ray and the negative reals removed, and it carries the topological structure as well.
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
897c6800db02 · pair key d8fd62cf7630.
Complex.log_exp states part
theorem Complex.log_exp {x : ℂ} : -π < x.im → x.im ≤ π → Complex.log (Complex.exp x) = x
Mathlib.Analysis.SpecialFunctions.Complex.Log · lines 54–56
Why only part: It covers the onto half of the claim and leaves the injectivity to another 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. - 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
03e8b2a7a25c · pair key 9dac2c7580ed.
Complex.exp_log states part
theorem Complex.exp_log {x : ℂ} : x ≠ 0 → Complex.exp (Complex.log x) = x
Mathlib.Analysis.SpecialFunctions.Complex.Log · lines 41–45
Why only part: It covers the one-to-one half of the claim.
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
f14a9a776173 · pair key 04dbb2695d76.
Related, but states something else
Complex.exp_inj_of_neg_pi_lt_of_le_pi related
theorem Complex.exp_inj_of_neg_pi_lt_of_le_pi {x y : ℂ} : -π < x.im → x.im ≤ π → -π < y.im → y.im ≤ π → Complex.exp x = Complex.exp y → x = y
Mathlib.Analysis.SpecialFunctions.Complex.Log · lines 67–69
How it differs: It states injectivity of the exponential on the strip, the companion of the claim about the 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 4 for this passage, high confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
4d8c9ef2bb8f · pair key 389ea1526607.
Sign in to tag this passage
-
Theorem · supporting · Complex analysis › Complex logarithm
◔Partial
Partial: Mathlib states part of this (proved).
If z ∈ ℂ ∖ (−ℝ≥ 0) is not a non-positive real number (a positive or a non-real number), the resulting principal value of the complex logarithm is obtained with −π < φ < π.
Show in article · Read it in context on Wikipedia ↗
Complex.arg_lt_pi_iff states part
theorem Complex.arg_lt_pi_iff {z : ℂ} : z.arg < π ↔ 0 ≤ z.re ∨ z.im ≠ 0
Mathlib.Analysis.SpecialFunctions.Complex.Arg · lines 260–261
Why only part: The lower bound of the passage's inequality comes from 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 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
7fffec772fb5 · pair key bd78c43dc05d.
Complex.neg_pi_lt_arg states part
theorem Complex.neg_pi_lt_arg (x : ℂ) : -π < x.arg
Mathlib.Analysis.SpecialFunctions.Complex.Arg · lines 158–159
Why only part: The upper bound of the passage's inequality comes from 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. - 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
5f66a45e859f · pair key 5587f1dc62e6.
Related, but states something else
Complex.log_im related
theorem Complex.log_im (x : ℂ) : (Complex.log x).im = x.arg
Mathlib.Analysis.SpecialFunctions.Complex.Log · line 35
How it differs: It identifies the imaginary part of the logarithm with the argument, which is the term the passage calls the angle.
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
eff2c09c35ad · pair key c88074c6016d.
Sign in to tag this passage
-
Theorem · supporting · Complex analysis › Complex logarithm
◔Partial
Partial: Mathlib states part of this (proved).
It is an analytic function outside the negative real numbers, but it cannot be prolongated to a function that is continuous at any negative real number z ∈ −ℝ+, where the principal value is ln z = ln(−z) + iπ.
Show in article · Read it in context on Wikipedia ↗
analyticAt_clog states part
theorem analyticAt_clog {z : ℂ} : z ∈ Complex.slitPlane → AnalyticAt ℂ Complex.log z
Mathlib.Analysis.SpecialFunctions.Complex.Analytic · lines 28–32
Why only part: Mathlib's slit plane is the complement of the non-positive reals, which is the domain the sentence fixes for z before this clause.
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
a48bca96d568 · pair key 82533261541d.
Related, but states something else
Complex.tendsto_log_nhdsWithin_im_nonneg_of_re_neg_of_im_zero related
theorem Complex.tendsto_log_nhdsWithin_im_nonneg_of_re_neg_of_im_zero {z : ℂ} : z.re < 0 → z.im = 0 → Filter.Tendsto Complex.log (𝓝[{z | 0 ≤ z.im}] z) (𝓝 (↑(Real.log ‖z‖) + ↑π * Complex.I))
Mathlib.Analysis.SpecialFunctions.Complex.Log · lines 225–228
How it differs: It gives the limit of the principal logarithm along the upper side of the cut at a negative real, which is the value the sentence records 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 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
ed4d7f78ba81 · pair key 99bc1ad4d76e.
Complex.tendsto_log_nhdsWithin_im_neg_of_re_neg_of_im_zero related
theorem Complex.tendsto_log_nhdsWithin_im_neg_of_re_neg_of_im_zero {z : ℂ} : z.re < 0 → z.im = 0 → Filter.Tendsto Complex.log (𝓝[{z | z.im < 0}] z) (𝓝 (↑(Real.log ‖z‖) - ↑π * Complex.I))
Mathlib.Analysis.SpecialFunctions.Complex.Log · lines 202–212
How it differs: It gives the limit of the principal logarithm along the lower side of the cut at a negative real, which differs from the upper 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 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
6938aeb23eef · pair key 66fd42f274a1.
Complex.continuousWithinAt_log_of_re_neg_of_im_zero related
theorem Complex.continuousWithinAt_log_of_re_neg_of_im_zero {z : ℂ} : z.re < 0 → z.im = 0 → ContinuousWithinAt Complex.log {z | 0 ≤ z.im} z
Mathlib.Analysis.SpecialFunctions.Complex.Log · lines 214–223
How it differs: It states continuity of the principal logarithm within the closed upper half plane at a negative real 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 4 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
e6daf787ac7f · pair key 7a26bfd79db1.
Sign in to tag this passage
-
Definition · main statement · Complex analysis › Complex logarithm
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
Complex exponentiation zω is defined as zω = exp(ωln z), and is multi-valued, except when ω is an integer.
Show in article · Read it in context on Wikipedia ↗
Complex.cpow close match
def Complex.cpow : ℂ → ℂ → ℂ
Mathlib.Analysis.SpecialFunctions.Pow.Complex · lines 27–28
Why close, not exact: Lean's function evaluates the exponential at the principal logarithm times the exponent, so one determination is returned, and the base zero gets the defaults 1 and 0.
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
f34c4c9c6c61 · pair key f87995345c7f.
Complex.cpow_def_of_ne_zero close match
theorem Complex.cpow_def_of_ne_zero {x : ℂ} : x ≠ 0 → ∀ (y : ℂ), x ^ y = Complex.exp (Complex.log x * y)
Mathlib.Analysis.SpecialFunctions.Pow.Complex · lines 40–41
Why close, not exact: This equation gives the library's power by the sentence's own formula, with the principal logarithm on the right and the base assumed nonzero.
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
566c0861d841 · pair key 8bf7cb7495ee.
Related, but states something else
Complex.cpow_intCast related
theorem Complex.cpow_intCast (x : ℂ) (n : ℤ) : x ^ ↑n = x ^ n
Mathlib.Analysis.SpecialFunctions.Pow.Complex · line 137
How it differs: It identifies the power at an integer exponent with the ordinary integer power of 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 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
79a8b85e0a43 · pair key 81923eb7e6b4.
Sign in to tag this passage
-
Theorem · supporting · Complex analysis › Complex logarithm
✕Not formalized
For ω = 1 / n, for some natural number n, this recovers the non-uniqueness of nth roots mentioned above.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 5 queries and 3 candidates examined (receipt 3ceccdcc7810). - 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
-
Definition · supporting · Complex analysis › Complex logarithm
◔Partial
Partial: Mathlib states a special case (proved).
If z > 0 is real (and ω an arbitrary complex number), one has a preferred choice of ln x, the real logarithm, which can be used to define a preferred exponential function.
Show in article · Read it in context on Wikipedia ↗
Real.rpow_def_of_pos special case
theorem Real.rpow_def_of_pos {x : ℝ} : 0 < x → ∀ (y : ℝ), x ^ y = Real.exp (Real.log x * y)
Mathlib.Analysis.SpecialFunctions.Pow.Real · lines 50–51
Why a special case: This is the exponential function built from the real logarithm, taken at real exponents.
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
ea69c29883e9 · pair key a56d5b277096.
Complex.ofReal_log states part
theorem Complex.ofReal_log {x : ℝ} : 0 ≤ x → ↑(Real.log x) = Complex.log ↑x
Mathlib.Analysis.SpecialFunctions.Complex.Log · lines 71–73
Why only part: It identifies the preferred value of the logarithm at a positive real with the real logarithm; the sentence's further remark about the resulting exponential function is not part of this 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
c16ac53acf73 · pair key a9f3d65661d3.
Related, but states something else
Complex.ofReal_cpow related
theorem Complex.ofReal_cpow {x : ℝ} : 0 ≤ x → ∀ (y : ℝ), ↑(x ^ y) = ↑x ^ ↑y
Mathlib.Analysis.SpecialFunctions.Pow.Real · lines 282–284
How it differs: It says the real power of a nonnegative real base agrees with the complex power at the same real exponent.
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
58dcc6179ad2 · pair key d2c9af65117f.
Sign in to tag this passage
-
Theorem · supporting · Complex analysis › Complex logarithm
✕Not formalized
Complex numbers, unlike real numbers, do not in general satisfy the unmodified power and logarithm identities, particularly when naïvely treated as single-valued functions; see failure of power and logarithm identities.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 4 candidates examined (receipt 6469eb5316a2). - 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
-
Example · supporting · Complex analysis › Complex logarithm
✕Not formalized
For example, they do not satisfy abc = (ab)c. Both sides of the equation are multivalued by the definition of complex exponentiation given here, and the values on the left are a subset of those on the right.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 53f223dc40ed). - 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
-
Theorem · supporting · Complex analysis › Complex logarithm
✕Not formalized
For example, they do not satisfy abc = (ab)c. Both sides of the equation are multivalued by the definition of complex exponentiation given here, and the values on the left are a subset of those on the right.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt e622a8728590). - 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
-
Theorem · supporting · Complex analysis › Complex logarithm
✕Not formalized
For example, they do not satisfy abc = (ab)c. Both sides of the equation are multivalued by the definition of complex exponentiation given here, and the values on the left are a subset of those on the right.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 4034252a9d7d). - 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
-
Definition · main statement · Complex analysis › Complex sine and cosine
✓Formalized
Formalized, by a community edit: Mathlib states a more general result (a definition).
The series defining the real trigonometric functions sin and cos, as well as the hyperbolic functions sinh and cosh, also carry over to complex arguments without change.
Show in article · Read it in context on Wikipedia ↗
Complex.sin more general
def Complex.sin : ℂ → ℂ
Mathlib.Analysis.Complex.Trigonometric · lines 29–30
Community Agent The pipeline said exact match; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
Why more general: The passage speaks of the series defining the real sine. Complex.sin is the sine on all complex numbers, defined through the complex exponential; Mathlib defines the real sine (Real.sin) as the real part of Complex.sin at real points. The passage's real function is therefore the restriction of this more general one, not the same object.
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
04dc7ca58359 · pair key 3464e3d350c0.
Complex.hasSum_sin more general
theorem Complex.hasSum_sin (z : ℂ) : HasSum (fun n ↦ (-1) ^ n * z ^ (2 * n + 1) / ↑(2 * n + 1).factorial) (Complex.sin z)
Mathlib.Analysis.SpecialFunctions.Trigonometric.Series · lines 77–81
Community Agent The pipeline said close match; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
Why more general: States that the alternating series of odd powers over factorials sums to the sine at every complex number. The passage's series for the real sine is the case of real arguments, so the passage is an instance of this more general statement.
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
090bc778b3f0 · pair key dfa1b67c45ad.
Sign in to tag this passage
-
Definition · supporting · Complex analysis › Complex sine and cosine
✓Formalized
Formalized: Mathlib states this exactly (a definition).
The series defining the real trigonometric functions sin and cos, as well as the hyperbolic functions sinh and cosh, also carry over to complex arguments without change.
Show in article · Read it in context on Wikipedia ↗
Complex.cos exact match
def Complex.cos : ℂ → ℂ
Mathlib.Analysis.Complex.Trigonometric · lines 34–35
Note: The data defined is the cosine on every complex argument; the library reaches the same function through the complex exponential, and the article's power series sums to it at each complex point.
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
90311b2af9f1 · pair key a439c191a9e0.
Complex.hasSum_cos close match
theorem Complex.hasSum_cos (z : ℂ) : HasSum (fun n ↦ (-1) ^ n * z ^ (2 * n) / ↑(2 * n).factorial) (Complex.cos z)
Mathlib.Analysis.SpecialFunctions.Trigonometric.Series · lines 71–74
Why close, not exact: The declaration unfolds the library's complex cosine into the alternating power series of even powers over factorials, the series the article writes for real arguments.
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
3e08b52650d0 · pair key 63c5dc0d6101.
Sign in to tag this passage
-
Definition · supporting · Complex analysis › Complex sine and cosine
✓Formalized
Formalized: Mathlib states this exactly (a definition).
The series defining the real trigonometric functions sin and cos, as well as the hyperbolic functions sinh and cosh, also carry over to complex arguments without change.
Show in article · Read it in context on Wikipedia ↗
Complex.sinh exact match
def Complex.sinh : ℂ → ℂ
Mathlib.Analysis.Complex.Trigonometric · lines 49–50
Note: The data defined is the hyperbolic sine on every complex argument; the library builds the same function from the complex exponential, and the article's power series sums to it at each complex point.
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
b8f23058fa4d · pair key d48030975060.
Complex.hasSum_sinh close match
theorem Complex.hasSum_sinh (z : ℂ) : HasSum (fun n ↦ z ^ (2 * n + 1) / ↑(2 * n + 1).factorial) (Complex.sinh z)
Mathlib.Analysis.SpecialFunctions.Trigonometric.Series · lines 128–130
Why close, not exact: The declaration unfolds the library's complex hyperbolic sine into the series of odd powers over factorials, the series the article uses on 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 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
7009b2b5ecc6 · pair key 3c8b85420a13.
Sign in to tag this passage
-
Definition · supporting · Complex analysis › Complex sine and cosine
✓Formalized
Formalized: Mathlib states this exactly (a definition).
The series defining the real trigonometric functions sin and cos, as well as the hyperbolic functions sinh and cosh, also carry over to complex arguments without change.
Show in article · Read it in context on Wikipedia ↗
Complex.cosh exact match
def Complex.cosh : ℂ → ℂ
Mathlib.Analysis.Complex.Trigonometric · lines 54–55
Note: The data defined is the hyperbolic cosine on every complex argument; the library builds the same function from the complex exponential, and the article's power series sums to it at each complex point.
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
ab9bc5116455 · pair key f3953e954648.
Complex.hasSum_cosh close match
theorem Complex.hasSum_cosh (z : ℂ) : HasSum (fun n ↦ z ^ (2 * n) / ↑(2 * n).factorial) (Complex.cosh z)
Mathlib.Analysis.SpecialFunctions.Trigonometric.Series · lines 124–125
Why close, not exact: The declaration unfolds the library's complex hyperbolic cosine into the series of even powers over factorials, the series the article uses on 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 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
1509e4b022f1 · pair key 33bda6d83777.
Sign in to tag this passage
-
Theorem · supporting · Complex analysis › Complex sine and cosine
✕Not formalized
For the other trigonometric and hyperbolic functions, such as tan, things are slightly more complicated, as the defining series do not converge for all complex values.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt e24b892b18d9). - 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
-
Theorem · main statement · Complex analysis › Complex sine and cosine
◔Partial
Partial: Mathlib states a special case (proved).
The value of a trigonometric or hyperbolic function of a complex number can be expressed in terms of those functions evaluated on real numbers, via angle-addition formulas.
Show in article · Read it in context on Wikipedia ↗
Complex.sin_eq special case
theorem Complex.sin_eq (z : ℂ) : Complex.sin z = Complex.sin ↑z.re * Complex.cosh ↑z.im + Complex.cos ↑z.re * Complex.sinh ↑z.im * Complex.I
Mathlib.Analysis.Complex.Trigonometric · lines 336–337
Why a special case: The library applies the complex functions to the coerced real and imaginary parts, whose values are the real ones the passage speaks 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
e803b0aba218 · pair key 2f415e295c3d.
Complex.cos_eq special case
theorem Complex.cos_eq (z : ℂ) : Complex.cos z = Complex.cos ↑z.re * Complex.cosh ↑z.im - Complex.sin ↑z.re * Complex.sinh ↑z.im * Complex.I
Mathlib.Analysis.Complex.Trigonometric · lines 342–343
Why a special case: As with the sine, the coerced real and imaginary parts carry the real values the passage refers to.
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
75eb5f68f2ae · pair key 69cc7d993c4b.
Complex.tan_eq special case
theorem Complex.tan_eq {z : ℂ} : (((∀ (k : ℤ), ↑z.re ≠ (2 * ↑k + 1) * ↑π / 2) ∧ ∀ (l : ℤ), ↑z.im * Complex.I ≠ (2 * ↑l + 1) * ↑π / 2) ∨ (∃ k, ↑z.re = (2 * ↑k + 1) * ↑π / 2) ∧ ∃ l, ↑z.im * Complex.I = (2 * ↑l + 1) * ↑π / 2) → Complex.tan z = (Complex.tan ↑z.re + Complex.tanh ↑z.im * Complex.I) / (1 - Complex.tan ↑z.re * Complex.tanh ↑z.im * Complex.I)
Mathlib.Analysis.SpecialFunctions.Trigonometric.Complex · lines 173–180
Why a special case: The declaration adds a side condition on the real and imaginary parts that the article's displayed identity leaves implicit.
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
b2617037549f · pair key 5540181f4ec5.
Sign in to tag this passage
-
Theorem · supporting · Complex analysis › Complex sine and cosine
✓Formalized
Formalized: Mathlib states this up to a convention difference (proved).
For z = x + iy, sin z = sin xcosh y + icos xsinh y
Show in article · Read it in context on Wikipedia ↗
Complex.sin_eq close match
theorem Complex.sin_eq (z : ℂ) : Complex.sin z = Complex.sin ↑z.re * Complex.cosh ↑z.im + Complex.cos ↑z.re * Complex.sinh ↑z.im * Complex.I
Mathlib.Analysis.Complex.Trigonometric · lines 336–337
Why close, not exact: The library writes the two real coordinates as the real and imaginary parts of z and applies the complex sine, cosine, hyperbolic cosine and hyperbolic sine to their coercions, where the article names them x and y and uses the functions of a real variable.
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
e562a48575b1 · pair key a750d735ac84.
Complex.sin_add_mul_I more general
theorem Complex.sin_add_mul_I (x y : ℂ) : Complex.sin (x + y * Complex.I) = Complex.sin x * Complex.cosh y + Complex.cos x * Complex.sinh y * Complex.I
Mathlib.Analysis.Complex.Trigonometric · lines 333–334
Why more general: The declaration allows both arguments to be complex, and the article's real x and y are one instance of that.
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
cfb693b64ffc · pair key f88090ee0376.
Sign in to tag this passage
-
Theorem · supporting · Complex analysis › Complex sine and cosine
✓Formalized
Formalized: Mathlib states this up to a convention difference (proved).
sin z = sin xcosh y + icos xsinh y
cos z = cos xcosh y − isin xsinh y
Show in article · Read it in context on Wikipedia ↗
Complex.cos_eq close match
theorem Complex.cos_eq (z : ℂ) : Complex.cos z = Complex.cos ↑z.re * Complex.cosh ↑z.im - Complex.sin ↑z.re * Complex.sinh ↑z.im * Complex.I
Mathlib.Analysis.Complex.Trigonometric · lines 342–343
Why close, not exact: The library writes the two real coordinates as the real and imaginary parts of z and applies the complex cosine, sine, hyperbolic cosine and hyperbolic sine to their coercions, where the article names them x and y and uses the functions of a real variable.
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
e3a842f85473 · pair key 28d832999184.
Complex.cos_add_mul_I more general
theorem Complex.cos_add_mul_I (x y : ℂ) : Complex.cos (x + y * Complex.I) = Complex.cos x * Complex.cosh y - Complex.sin x * Complex.sinh y * Complex.I
Mathlib.Analysis.Complex.Trigonometric · lines 339–340
Why more general: The declaration allows both arguments to be complex, and the article's real x and y are one instance of that.
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
cfe059e9b5ba · pair key 97742cccbd25.
Sign in to tag this passage
-
Theorem · supporting · Complex analysis › Complex sine and cosine
✓Formalized
Formalized: Mathlib states this up to a convention difference (proved).
cos z = cos xcosh y − isin xsinh y
tan z = tan x + itanh y1 − itan xtanh y
Show in article · Read it in context on Wikipedia ↗
Complex.tan_eq close match
theorem Complex.tan_eq {z : ℂ} : (((∀ (k : ℤ), ↑z.re ≠ (2 * ↑k + 1) * ↑π / 2) ∧ ∀ (l : ℤ), ↑z.im * Complex.I ≠ (2 * ↑l + 1) * ↑π / 2) ∨ (∃ k, ↑z.re = (2 * ↑k + 1) * ↑π / 2) ∧ ∃ l, ↑z.im * Complex.I = (2 * ↑l + 1) * ↑π / 2) → Complex.tan z = (Complex.tan ↑z.re + Complex.tanh ↑z.im * Complex.I) / (1 - Complex.tan ↑z.re * Complex.tanh ↑z.im * Complex.I)
Mathlib.Analysis.SpecialFunctions.Trigonometric.Complex · lines 173–180
Why close, not exact: The side condition carried by the declaration rules out exactly the arguments at which one of the two tangent factors runs off to infinity, which the article's following sentence handles on 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 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack, which downgraded it. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
051a7e5fdeb1 · pair key 9eea9097b166.
Complex.tan_add_mul_I more general
theorem Complex.tan_add_mul_I {x y : ℂ} : (((∀ (k : ℤ), x ≠ (2 * ↑k + 1) * ↑π / 2) ∧ ∀ (l : ℤ), y * Complex.I ≠ (2 * ↑l + 1) * ↑π / 2) ∨ (∃ k, x = (2 * ↑k + 1) * ↑π / 2) ∧ ∃ l, y * Complex.I = (2 * ↑l + 1) * ↑π / 2) → Complex.tan (x + y * Complex.I) = (Complex.tan x + Complex.tanh y * Complex.I) / (1 - Complex.tan x * Complex.tanh y * Complex.I)
Mathlib.Analysis.SpecialFunctions.Trigonometric.Complex · lines 166–171
Why more general: It is phrased for two arbitrary complex arguments, and the article's pair of real numbers is one way of choosing 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
bae4fb6ef513 · pair key 617c15da0938.
Sign in to tag this passage
-
Theorem · supporting · Complex analysis › Complex sine and cosine
✕Not formalized
tan z = tan x + itanh y1 − itan xtanh y
cot z = −1 + icot xcoth ycot x − icoth y
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 4 candidates examined (receipt 2dd38ec07804). - 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
-
Theorem · supporting · Complex analysis › Complex sine and cosine
◔Partial
Partial: Mathlib states a special case (proved).
cot z = −1 + icot xcoth ycot x − icoth y
sinh z = sinh xcos y + icosh xsin y
Show in article · Read it in context on Wikipedia ↗
Complex.sinh_mul_I special case
theorem Complex.sinh_mul_I (x : ℂ) : Complex.sinh (x * Complex.I) = Complex.sin x * Complex.I
Mathlib.Analysis.Complex.Trigonometric · lines 290–292
Why a special case: The article's identity with vanishing real part reads as the hyperbolic sine of zero times the cosine of y plus i times the hyperbolic cosine of zero times the sine of y, which collapses to i times the sine of y.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, 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
61055f7cd86f · pair key 12e2f0a287f5.
Sign in to tag this passage
-
Theorem · supporting · Complex analysis › Complex sine and cosine
◔Partial
Partial: Mathlib states a special case (proved).
sinh z = sinh xcos y + icosh xsin y
cosh z = cosh xcos y + isinh xsin y
Show in article · Read it in context on Wikipedia ↗
Complex.cosh_mul_I special case
theorem Complex.cosh_mul_I (x : ℂ) : Complex.cosh (x * Complex.I) = Complex.cos x
Mathlib.Analysis.Complex.Trigonometric · lines 294–295
Why a special case: The article's identity with vanishing real part reads as the hyperbolic cosine of zero times the cosine of y plus i times the hyperbolic sine of zero times the sine of y, which collapses to the cosine of y.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, 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
00fd90e75667 · pair key ac34ed8c84ae.
Sign in to tag this passage
-
Theorem · supporting · Complex analysis › Complex sine and cosine
◔Partial
Partial: Mathlib states a special case (proved).
cosh z = cosh xcos y + isinh xsin y
tanh z = tanh x + itan y1 + itanh xtan y
Show in article · Read it in context on Wikipedia ↗
Complex.tanh_mul_I special case
theorem Complex.tanh_mul_I (x : ℂ) : Complex.tanh (x * Complex.I) = Complex.tan x * Complex.I
Mathlib.Analysis.Complex.Trigonometric · lines 297–298
Why a special case: The article's quotient with vanishing real part has the hyperbolic tangent of zero in both numerator and denominator, so it collapses to i times the tangent of y.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, 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
9168915cbf2a · pair key 6e6bd937af0a.
Sign in to tag this passage
-
Theorem · supporting · Complex analysis › Complex sine and cosine
✕Not formalized
tanh z = tanh x + itan y1 + itanh xtan y
coth z = 1 − icoth xcot ycoth x − icot y
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 66ab053ebd93). - 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
-
Definition · main statement · Complex analysis › Holomorphic functions
✓Formalized
Formalized: Mathlib states a more general result (a Prop-valued definition: it states the claim without proving it).
A function f : ℂ → ℂ is called holomorphic or complex differentiable at a point z0 if the limit limz → z0 f(z) − f(z0)/z − z0 exists (in which case it is denoted by f′(z0)).
Show in article · Read it in context on Wikipedia ↗
DifferentiableAt more general
def DifferentiableAt (𝕜 : Type*) [NontriviallyNormedField 𝕜] {E : Type*} [AddCommGroup E] [_root_.Module 𝕜 E] [TopologicalSpace E] {F : Type*} [AddCommGroup F] [_root_.Module 𝕜 F] [TopologicalSpace F] : (E → F) → E → Prop
Mathlib.Analysis.Calculus.FDeriv.Defs · lines 145–146
Why more general: It is the library's predicate for a function admitting a derivative at a point, phrased over an arbitrary nontrivially normed scalar field rather than only over the complex 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, 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
d8fe19afca2b · pair key 7cd3372c2dde.
hasDerivAt_iff_tendsto_slope more general
theorem hasDerivAt_iff_tendsto_slope {𝕜 : Type u} [NontriviallyNormedField 𝕜] {F : Type v} [NormedAddCommGroup F] [NormedSpace 𝕜 F] {f : 𝕜 → F} {f' : F} {x : 𝕜} : HasDerivAt f f' x ↔ Filter.Tendsto (slope f x) (𝓝[≠] x) (𝓝 f')
Mathlib.Analysis.Calculus.Deriv.Slope · lines 73–74
Why more general: It identifies the library's derivative relation with the convergence of the difference quotient the article uses as its defining condition, and it does so over an arbitrary nontrivially normed 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
895b5eb58392 · pair key 0f98d8348441.
Sign in to tag this passage
-
Example · supporting · Complex analysis › Holomorphic functions
◔Partial
Partial: Mathlib states part of this (proved).
For example, the function f(z) = z̄ is differentiable as a function ℝ2 → ℝ2, but is not complex differentiable.
Show in article · Read it in context on Wikipedia ↗
Complex.differentiable_conj states part
theorem Complex.differentiable_conj : Differentiable ℝ ⇑(starRingEnd ℂ)
Mathlib.Analysis.Complex.RealDeriv · line 124
Why only part: The declaration gives the real differentiability only; no declaration in the universe records that conjugation fails to be complex differentiable.
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
23505b1f4c9e · pair key 129637da6e6d.
Sign in to tag this passage
-
Theorem · main statement · Complex analysis › Holomorphic functions
✓Formalized
Formalized: Mathlib states a more general result (proved).
A real differentiable function is complex differentiable if and only if it satisfies the Cauchy–Riemann equations, which are sometimes abbreviated as ∂f∂z̄ = 0.
Show in article · Read it in context on Wikipedia ↗
differentiableAt_complex_iff_differentiableAt_real more general
theorem differentiableAt_complex_iff_differentiableAt_real {E : Type*} [NormedAddCommGroup E] [NormedSpace ℂ E] {f : ℂ → E} {x : ℂ} : DifferentiableAt ℂ f x ↔ DifferentiableAt ℝ f x ∧ (fderiv ℝ f x) Complex.I = Complex.I • (fderiv ℝ f x) 1
Mathlib.Analysis.Complex.Conformal · lines 286–291
Why more general: Mathlib states the criterion for an arbitrary complex normed target and writes the Cauchy-Riemann condition as complex linearity of the real derivative, where the article writes the vanishing of the conjugate derivative.
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
943388183fcf · pair key 27b0e41653a2.
Sign in to tag this passage
-
Theorem · main statement · Complex analysis › Holomorphic functions
✓Formalized
Formalized: ATLAS (atlas-lean) states a more general result (proved).
For example, the identity theorem asserts that two holomorphic functions f and g agree if they agree on an arbitrarily small open subset of ℂ.
Show in article · Read it in context on Wikipedia ↗
MDifferentiable.eq_of_eqOn_of_isOpen more general
theorem MDifferentiable.eq_of_eqOn_of_isOpen {E : Type*} [NormedAddCommGroup E] [NormedSpace ℂ E] {F : Type*} [NormedAddCommGroup F] [NormedSpace ℂ F] {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℂ E H} [I.Boundaryless] {M : Type*} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I 1 M] [ConnectedSpace M] {f g : M → F} : MDiff f → MDiff g → ∀ {U : Set M}, IsOpen U → U.Nonempty → Set.EqOn f g U → f = g
MathlibExt.Geometry.Manifold.HolomorphicIdentity · line 168
Why more general: It is stated for any connected complex manifold and any complex normed target, with manifold differentiability where the article says holomorphic.
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
8b41a845729d · pair key 472f815a6aa7.
AnalyticOnNhd.eq_of_eventuallyEq special case
theorem AnalyticOnNhd.eq_of_eventuallyEq {𝕜 : Type*} [NontriviallyNormedField 𝕜] {E : Type*} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {F : Type*} [NormedAddCommGroup F] [NormedSpace 𝕜 F] {f g : E → F} [PreconnectedSpace E] : AnalyticOnNhd 𝕜 f Set.univ → AnalyticOnNhd 𝕜 g Set.univ → ∀ {z₀ : E}, f =ᶠ[𝓝 z₀] g → f = g
Mathlib.Analysis.Analytic.Uniqueness · lines 235–238
Why a special case: Mathlib writes holomorphy on the whole plane as analyticity near every point and asks only for agreement near a single point.
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
a6fe77f00891 · pair key 2b66fada6398.
Sign in to tag this passage
-
Definition · supporting · Complex analysis › Holomorphic functions
✓Formalized
Formalized: Mathlib states a more general result (a Prop-valued definition: it states the claim without proving it).
Meromorphic functions, functions that can locally be written as f(z)/(z − z0)n with a holomorphic function f, still share some of the features of holomorphic functions.
Show in article · Read it in context on Wikipedia ↗
MeromorphicAt more general
def MeromorphicAt {𝕜 : Type*} [NontriviallyNormedField 𝕜] {E : Type*} [NormedAddCommGroup E] [NormedSpace 𝕜 E] : (𝕜 → E) → 𝕜 → Prop
Mathlib.Analysis.Meromorphic.Basic · lines 36–37
Why more general: Mathlib defines the predicate over any nontrivially normed field and any normed target, and multiplies by a power of the local coordinate where the article divides.
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
baaef5020ecb · pair key ebb649cc1ac4.
MeromorphicAt.iff_eventuallyEq_zpow_smul_analyticAt more general
theorem MeromorphicAt.iff_eventuallyEq_zpow_smul_analyticAt {𝕜 : Type*} [NontriviallyNormedField 𝕜] {E : Type*} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {x : 𝕜} {f : 𝕜 → E} : MeromorphicAt f x ↔ ∃ n g, AnalyticAt 𝕜 g x ∧ ∀ᶠ (z : 𝕜) in 𝓝[≠] x, f z = (z - x) ^ n • g z
Mathlib.Analysis.Meromorphic.Basic · lines 360–367
Why more general: It is stated over a general field and target and uses an integer power with a scalar action where the article writes a quotient.
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
9fe480236a03 · pair key b9e3e397180d.
Sign in to tag this passage
-
Example · supporting · Complex analysis › Holomorphic functions
✕Not formalized
Other functions have essential singularities, such as sin(1/z) at z = 0.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt f86a771fde9c). - 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
-
Theorem · supporting · Applications › Geometry › Shapes
✕Not formalized
Three non-collinear points u, v, w in the plane determine the shape of the triangle {u, v, w}.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 3 candidates examined (receipt b1a74648a073). - 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
-
Definition · main statement · Applications › Geometry › Shapes
✕Not formalized
Locating the points in the complex plane, this shape of a triangle may be expressed by complex arithmetic as S(u, v, w) = u − wu − v. The shape S of a triangle will remain the same, when the complex plane is transformed by translation or dilation (by an affine transformation), corresponding to the intuitive notion of shape, and describing similarity.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 3 candidates examined (receipt ba2b3ed51b12). - 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
-
Theorem · supporting · Applications › Geometry › Shapes
✕Not formalized
Locating the points in the complex plane, this shape of a triangle may be expressed by complex arithmetic as S(u, v, w) = u − wu − v. The shape S of a triangle will remain the same, when the complex plane is transformed by translation or dilation (by an affine transformation), corresponding to the intuitive notion of shape, and describing similarity.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 3 candidates examined (receipt d9aae83b9816). - 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
-
Theorem · supporting · Applications › Geometry › Shapes
✕Not formalized
Thus each triangle {u, v, w} is in a similarity class of triangles with the same shape.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 18c098885a24). - 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
-
Definition · main statement · Applications › Geometry › Fractal geometry
✓Formalized
Formalized: Formal Conjectures states this up to a convention difference (a definition).
It is defined by plotting every location c where iterating the sequence fc(z) = z2 + c does not diverge when iterated infinitely.
Show in article · Read it in context on Wikipedia ↗
Mandelbrot.mandelbrotSet close match
abbrev Mandelbrot.mandelbrotSet : Set ℂ
FormalConjectures.Wikipedia.Mandelbrot · line 49
Why close, not exact: The library writes non-divergence as the orbit of zero staying bounded, so the starting value of the iteration is made explicit where the article leaves it implicit.
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
e754a78. - Location key
a0ebd99087ca · pair key 5faa395e5c4d.
MathlibExt.Analysis.MandelbrotWanted.ComplexAnalysis.MandelbrotProblem.Mandelbrot close match
def MathlibExt.Analysis.MandelbrotWanted.ComplexAnalysis.MandelbrotProblem.Mandelbrot : Set ℂ
WantedExt.Analysis.MandelbrotWanted · line 61
Why close, not exact: This library also spells the article's non-divergence out as the forward orbit of zero under the quadratic map remaining bounded.
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
64c2773. - Location key
d1108cd25b73 · pair key fe624451d3e7.
Mandelbrot.multibrotSet more general
def Mandelbrot.multibrotSet : ℕ → Set ℂ
FormalConjectures.Wikipedia.Mandelbrot · lines 43–44
Why more general: The declaration is given for an arbitrary exponent, so it covers the article's quadratic family together with the higher 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 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
e754a78. - Location key
decddee8a44e · pair key 4c3babfae40a.
Related, but states something else
Mandelbrot.mandelbrotSet_eq related
theorem Mandelbrot.mandelbrotSet_eq : Mandelbrot.mandelbrotSet = {c | ∀ (k : ℕ), ‖(fun z ↦ z ^ 2 + c)^[k] 0‖ ≤ 2}
FormalConjectures.Wikipedia.Mandelbrot · lines 106–107
How it differs: The library records the defining membership rule in the explicit form of every iterate of zero staying inside the closed disc of radius two.
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, 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
e754a78. - Location key
0a17a4ad023b · pair key b2601a53a649.
Sign in to tag this passage
-
Definition · supporting · Applications › Geometry › Fractal geometry
✓Formalized
Formalized: ATLAS (atlas-lean) states this up to a convention difference (a definition).
Similarly, Julia sets have the same rules, except where c remains constant.
Show in article · Read it in context on Wikipedia ↗
MathlibExt.Analysis.FatouJuliaWanted.ComplexAnalysis.FatouJuliaProblem.FilledJulia close match
def MathlibExt.Analysis.FatouJuliaWanted.ComplexAnalysis.FatouJuliaProblem.FilledJulia : ℂ → Set ℂ
WantedExt.Analysis.FatouJuliaWanted · line 72
Why close, not exact: The library calls the set of points with bounded forward orbit under the quadratic map at a fixed parameter the filled Julia set, and writes non-divergence as boundedness of that orbit.
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
ebc3bca893f5 · pair key 970e2d09eabf.
Sign in to tag this passage
-
Theorem · main statement · Applications › Geometry › Triangles
◔Partial
Partial: ATLAS (atlas-lean) states part of this (proved).
Every triangle has a unique Steiner inellipse – an ellipse inside the triangle and tangent to the midpoints of the three sides of the triangle.
Show in article · Read it in context on Wikipedia ↗
MetaMathlibExt.marden states part
theorem MetaMathlibExt.marden (a b c : ℂ) : … → ∃ f1 f2 L, (Polynomial.derivative ((Polynomial.X - Polynomial.C a) * (Polynomial.X - Polynomial.C b) * (Polynomial.X - Polynomial.C c))).roots = {f1, f2} ∧ ‖(a + b) / 2 - f1‖ + ‖(a + b) / 2 - f2‖ = L ∧ ‖(b + c) / 2 - f1‖ + ‖(b + c) / 2 - f2‖ = L ∧ ‖(c + a) / 2 - f1‖ + ‖(c + a) / 2 - f2‖ = L ∧ (∀ (t : ℝ), t ≠ 0 → L < ‖(a + b) / 2 + ↑t * (b - a) - f1‖ + ‖(a + b) / 2 + ↑t * (b - a) - f2‖) ∧ (∀ (t : ℝ), t ≠ 0 → L < ‖(b + c) / 2 + ↑t * (c - b) - f1‖ + ‖(b + c) / 2 + ↑t * (c - b) - …
Full type, as Lean prints it
∀ (a b c : ℂ), ((b - a) / (c - a)).im ≠ 0 → ∃ f1 f2 L, (Polynomial.derivative ((Polynomial.X - Polynomial.C a) * (Polynomial.X - Polynomial.C b) * (Polynomial.X - Polynomial.C c))).roots = {f1, f2} ∧ ‖(a + b) / 2 - f1‖ + ‖(a + b) / 2 - f2‖ = L ∧ ‖(b + c) / 2 - f1‖ + ‖(b + c) / 2 - f2‖ = L ∧ ‖(c + a) / 2 - f1‖ + ‖(c + a) / 2 - f2‖ = L ∧ (∀ (t : ℝ), t ≠ 0 → L < ‖(a + b) / 2 + ↑t * (b - a) - f1‖ + ‖(a + b) / 2 + ↑t * (b - a) - f2‖) ∧ (∀ (t : ℝ), t ≠ 0 → L < ‖(b + c) / 2 + ↑t * (c - b) - f1‖ + ‖(b + c) / 2 + ↑t * (c - b) - f2‖) ∧ ∀ (t : ℝ), t ≠ 0 → L < ‖(c + a) / 2 + ↑t * (a - c) - f1‖ + ‖(c + a) / 2 + ↑t * (a - c) - f2‖
MathlibExt.Geometry.Euclidean.Marden · line 409
Why only part: The declaration gives the conic by a pair of foci and a common distance sum, with tangency at each midpoint written as a strict inequality along the sideline, and it allows the two foci to coincide so the equilateral case is covered; it does not state that such an ellipse is the only 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
64c2773. - Location key
12caff347140 · pair key a726025aca3d.
Sign in to tag this passage
-
Theorem · main statement · Applications › Geometry › Triangles
✓Formalized
Formalized: ATLAS (atlas-lean) states this up to a convention difference (proved).
Marden's theorem says that the solutions of this equation are the complex numbers denoting the locations of the two foci of the Steiner inellipse.
Show in article · Read it in context on Wikipedia ↗
MetaMathlibExt.marden close match
theorem MetaMathlibExt.marden (a b c : ℂ) : … → ∃ f1 f2 L, (Polynomial.derivative ((Polynomial.X - Polynomial.C a) * (Polynomial.X - Polynomial.C b) * (Polynomial.X - Polynomial.C c))).roots = {f1, f2} ∧ ‖(a + b) / 2 - f1‖ + ‖(a + b) / 2 - f2‖ = L ∧ ‖(b + c) / 2 - f1‖ + ‖(b + c) / 2 - f2‖ = L ∧ ‖(c + a) / 2 - f1‖ + ‖(c + a) / 2 - f2‖ = L ∧ (∀ (t : ℝ), t ≠ 0 → L < ‖(a + b) / 2 + ↑t * (b - a) - f1‖ + ‖(a + b) / 2 + ↑t * (b - a) - f2‖) ∧ (∀ (t : ℝ), t ≠ 0 → L < ‖(b + c) / 2 + ↑t * (c - b) - f1‖ + ‖(b + c) / 2 + ↑t * (c - b) - …
Full type, as Lean prints it
∀ (a b c : ℂ), ((b - a) / (c - a)).im ≠ 0 → ∃ f1 f2 L, (Polynomial.derivative ((Polynomial.X - Polynomial.C a) * (Polynomial.X - Polynomial.C b) * (Polynomial.X - Polynomial.C c))).roots = {f1, f2} ∧ ‖(a + b) / 2 - f1‖ + ‖(a + b) / 2 - f2‖ = L ∧ ‖(b + c) / 2 - f1‖ + ‖(b + c) / 2 - f2‖ = L ∧ ‖(c + a) / 2 - f1‖ + ‖(c + a) / 2 - f2‖ = L ∧ (∀ (t : ℝ), t ≠ 0 → L < ‖(a + b) / 2 + ↑t * (b - a) - f1‖ + ‖(a + b) / 2 + ↑t * (b - a) - f2‖) ∧ (∀ (t : ℝ), t ≠ 0 → L < ‖(b + c) / 2 + ↑t * (c - b) - f1‖ + ‖(b + c) / 2 + ↑t * (c - b) - f2‖) ∧ ∀ (t : ℝ), t ≠ 0 → L < ‖(c + a) / 2 + ↑t * (a - c) - f1‖ + ‖(c + a) / 2 + ↑t * (a - c) - f2‖
MathlibExt.Geometry.Euclidean.Marden · line 409
Why close, not exact: The library presents the inellipse through its two foci and the common distance sum shared by the three edge midpoints, with tangency along each sideline recorded as a strict inequality away from the midpoint, and it permits the two foci to coincide so the equilateral case is 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 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
8034203b3e07 · pair key 3360bc1e0b6b.
Sign in to tag this passage
-
Theorem · supporting · Applications › Algebraic number theory
✓Formalized
Formalized: Mathlib states this exactly (proved).
As mentioned above, any nonconstant polynomial equation (in complex coefficients) has a solution in ℂ.
Show in article · Read it in context on Wikipedia ↗
Complex.exists_root exact match
theorem Complex.exists_root {f : ℂ[X]} : 0 < f.degree → ∃ z, f.IsRoot z
Mathlib.Analysis.Complex.Polynomial.Basic · lines 37–48
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
9671e721e517 · pair key 32610b661889.
IsAlgClosed.exists_root more general
theorem IsAlgClosed.exists_root {k : Type u} [Field k] [IsAlgClosed k] (p : k[X]) : p.degree ≠ 0 → ∃ x, p.IsRoot x
Mathlib.FieldTheory.IsAlgClosed.Basic · lines 79–80
Why more general: The hypothesis of non-zero degree is wider than the passage's nonconstancy, since it also admits the zero polynomial, for which every point is a root.
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
50d1f1d7d080 · pair key 4c6162e467bd.
Sign in to tag this passage
-
Theorem · supporting · Applications › Algebraic number theory
✓Formalized
Formalized: Mathlib states a more general result (proved).
A fortiori, the same is true if the equation has rational coefficients.
Show in article · Read it in context on Wikipedia ↗
IsAlgClosed.exists_aeval_eq_zero more general
theorem IsAlgClosed.exists_aeval_eq_zero (k : Type u) [Field k] {R : Type*} [CommSemiring R] [IsAlgClosed k] [Algebra R k] [FaithfulSMul R k] (p : R[X]) : p.degree ≠ 0 → ∃ x, (Polynomial.aeval x) p = 0
Mathlib.FieldTheory.IsAlgClosed.Basic · lines 176–178
Why more general: The statement is given for an arbitrary commutative coefficient semiring mapping faithfully into an arbitrary algebraically closed field, and its degree hypothesis also admits the zero polynomial.
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
4bf3cb22cc47 · pair key 03c0761f4a15.
Sign in to tag this passage
-
Definition · supporting · Applications › Algebraic number theory
✓Formalized
Formalized: Mathlib states a more general result (a Prop-valued definition: it states the claim without proving it).
The roots of such equations are called algebraic numbers – they are a principal object of study in algebraic number theory.
Show in article · Read it in context on Wikipedia ↗
IsAlgebraic more general
def IsAlgebraic (R : Type u) {A : Type v} [CommRing R] [Ring A] [Algebra R A] : A → Prop
Mathlib.RingTheory.Algebraic.Defs · lines 45–46
Why more general: The predicate is stated over an arbitrary commutative base ring and an arbitrary algebra over it, so the passage's rational coefficients inside the complex numbers are one 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 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
431421f420d5 · pair key fca581fd20f3.
Subalgebra.algebraicClosure more general
def Subalgebra.algebraicClosure (R : Type*) (S : Type*) [CommRing R] [CommRing S] [Algebra R S] [IsDomain R] : Subalgebra R S
Mathlib.RingTheory.Algebraic.Integral · lines 387–391
Why more general: The library collects these elements as a subalgebra of the ambient ring, so it carries ring structure on top of the collection the passage names, and it is set up for an arbitrary domain and algebra.
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
759876cec473 · pair key 6c74ddbab5f9.
Sign in to tag this passage
-
Theorem · main statement · Applications › Algebraic number theory
◐Statement only
Statement only: ATLAS (atlas-lean) states a more general result (wanted: stated as a goal, with no proof).
With algebraic methods, more specifically applying the machinery of field theory to the number field containing roots of unity, it can be shown that it is not possible to construct a regular nonagon using only compass and straightedge – a purely geometric problem.
Show in article · Read it in context on Wikipedia ↗
MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.gauss_wantzel_constructible_polygon more general
theorem MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.gauss_wantzel_constructible_polygon (n : ℕ) : 3 ≤ n → (MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.IsConstructible (Real.cos (2 * π / ↑n)) ↔ MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.GaussWantzelNumber n)
WantedExt.NumberTheory.GaussWantzelWanted · line 82
Why more general: The library's IsConstructible is the smallest subfield of the reals closed under square roots, the standard reading of ruler-and-compass data, and a regular polygon enters through the cosine of its central angle; reading the nine-sided case off the equivalence still needs the arithmetic check on the number 9 that the right-hand condition performs.
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
af13f6a25e94 · pair key 3969cd258a48.
Related, but states something else
MetaMathlibExt.angle_trisection_impossible related
theorem MetaMathlibExt.angle_trisection_impossible (IsConstructible IsConstructibleAngle : ℝ → Prop) : … → Irreducible (8 * Polynomial.X ^ 3 - 6 * Polynomial.X - 1) ∧ (Polynomial.aeval (Real.cos (π / 9))) (8 * Polynomial.X ^ 3 - 6 * Polynomial.X - 1) = 0 ∧ ¬IsConstructible (Real.cos (π / 9)) ∧ ¬∀ (θ : ℝ), IsConstructibleAngle θ → IsConstructibleAngle (θ / 3)
Full type, as Lean prints it
∀ (IsConstructible IsConstructibleAngle : ℝ → Prop), (∀ (x : ℝ), IsConstructible x ↔ ∃ n K, K 0 = ⊥ ∧ x ∈ K (Fin.last n) ∧ ∀ (i : Fin n), K i.castSucc ≤ K i.succ ∧ ∃ b ∈ K i.succ, b ^ 2 ∈ K i.castSucc ∧ ∀ y ∈ K i.succ, ∃ u v, u ∈ K i.castSucc ∧ v ∈ K i.castSucc ∧ y = u + b * v) → (∀ (θ : ℝ), IsConstructibleAngle θ ↔ IsConstructible (Real.cos θ)) → Irreducible (8 * Polynomial.X ^ 3 - 6 * Polynomial.X - 1) ∧ (Polynomial.aeval (Real.cos (Real.pi / 9))) (8 * Polynomial.X ^ 3 - 6 * Polynomial.X - 1) = 0 ∧ ¬IsConstructible (Real.cos (Real.pi / 9)) ∧ ¬∀ (θ : ℝ), IsConstructibleAngle θ → IsConstructibleAngle (θ / 3)
MathlibExt.Geometry.Euclidean.AngleTrisectionImpossible · line 425
How it differs: It settles the cosine of twenty degrees, while the nine-sided figure turns on the cosine of forty degrees; passing between them needs the closure of constructible lengths under angle bisection, a step the declaration does not carry.
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
64c2773. - Location key
ff6899d8cca3 · pair key 59b445ef59ec.
Sign in to tag this passage
-
Definition · supporting · Applications › Algebraic number theory
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
Another example is the Gaussian integers; that is, numbers of the form x + iy, where x and y are integers, which can be used to classify sums of squares.
Show in article · Read it in context on Wikipedia ↗
GaussianInt close match
abbrev GaussianInt : Type
Mathlib.NumberTheory.Zsqrtd.GaussianInt · lines 50–51
Why close, not exact: Mathlib builds this ring as the quadratic ring adjoining a square root of minus one, carried into the complex plane by the embedding GaussianInt.toComplex, so its elements are indexed by pairs of integers rather than written as sums; the article's remark on sums of squares names a use of this same ring.
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
8c627ec2f9dc · pair key 910c75360ca4.
Related, but states something else
GaussianInt.toComplex related
def GaussianInt.toComplex : GaussianInt →+* ℂ
Mathlib.NumberTheory.Zsqrtd.GaussianInt · lines 68–69
How it differs: This is the ring homomorphism that places the library's ring inside the complex plane, so it supports the article's description without being the ring the article 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 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
04ef13f46398 · pair key 568bb3536020.
Sign in to tag this passage
-
Theorem · main statement · Applications › Linear algebra
✓Formalized
Formalized: Mathlib states a more general result (proved).
Since ℂ is algebraically closed, any non-empty complex square matrix has at least one (complex) eigenvalue.
Show in article · Read it in context on Wikipedia ↗
Module.End.exists_eigenvalue more general
theorem Module.End.exists_eigenvalue {K : Type*} {V : Type*} [Field K] [AddCommGroup V] [_root_.Module K V] [IsAlgClosed K] [FiniteDimensional K V] [Nontrivial V] (f : Module.End K V) : ∃ c, f.HasEigenvalue c
Mathlib.LinearAlgebra.Eigenspace.Triangularizable · lines 62–65
Why more general: The library states this for an endomorphism of a finite-dimensional space over any algebraically closed field; a matrix is carried to its linear map, which is how the library itself phrases eigenvalues of matrices, as in eigenvalue_mem_ball.
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
a6d1dcd466d5 · pair key f7c9252b61a6.
spectrum.nonempty_of_isAlgClosed_of_finiteDimensional more general
theorem spectrum.nonempty_of_isAlgClosed_of_finiteDimensional (𝕜 : Type u) {A : Type v} [Field 𝕜] [Ring A] [Algebra 𝕜 A] [IsAlgClosed 𝕜] [Nontrivial A] [I : FiniteDimensional 𝕜 A] (a : A) : (spectrum 𝕜 a).Nonempty
Mathlib.FieldTheory.IsAlgClosed.Spectrum · lines 150–156
Why more general: Stated for an arbitrary element of a finite-dimensional algebra over an algebraically closed field; applied to the matrix algebra it gives the article's claim, with spectrum membership and eigenvalue linked by Matrix.mem_spectrum_iff_isRoot_charpoly.
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
cb9bf176cc61 · pair key b64c3f1d0732.
Related, but states something else
Matrix.mem_spectrum_iff_isRoot_charpoly related
theorem Matrix.mem_spectrum_iff_isRoot_charpoly {n : Type*} [Fintype n] [DecidableEq n] {K : Type*} [Field K] {A : Matrix n n K} {r : K} : r ∈ spectrum K A ↔ A.charpoly.IsRoot r
Mathlib.LinearAlgebra.Matrix.Charpoly.Eigs · lines 83–84
How it differs: It identifies spectrum membership with being a root of the characteristic polynomial over a field, and so supports the reading of the previous record without asserting that any such number 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 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
8d36543a2dc8 · pair key accfb44c8266.
Sign in to tag this passage
-
Theorem · supporting · Applications › Linear algebra
✕Not formalized
By comparison, real matrices do not always have real eigenvalues, for example rotation matrices (for rotations of the plane for angles other than 0° or 180°) leave no direction fixed, and therefore do not have any real eigenvalue.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 7f7b9022c217). - 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
Matrix.planeConformalMatrix related
def Matrix.planeConformalMatrix {R : Type*} [Field R] (a b : R) : a ^ 2 + b ^ 2 ≠ 0 → GL (Fin 2) R
Mathlib.LinearAlgebra.Matrix.GeneralLinearGroup.Basic · lines 26–28
How it differs: The library defines this rotation-shaped matrix and its determinant conditions, but records nothing about which real numbers it fixes or about the roots of its characteristic polynomial.
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
29e1288125b6 · pair key 54c428cdf502.
Sign in to tag this passage
-
Theorem · supporting · Applications › In applied mathematics › Control theory
✕Not formalized
If a linear, time-invariant (LTI) system has poles that are
in the right half plane, it will be unstable, all in the left half plane, it will be stable, on the imaginary axis, it will have marginal stability.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 601588df7cd3). - 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
-
Definition · supporting · Applications › In applied mathematics › Control theory
✕Not formalized
If a system has zeros in the right half plane, it is a nonminimum phase system.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt c99ed8f48fa7). - 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
-
Definition · supporting · Applications › In applied mathematics › Signal analysis
✕Not formalized
For a sine wave of a given frequency, the absolute value |z| of the corresponding z is the amplitude and the argument arg z is the phase.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 046896292075). - 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
Complex.norm_mul_exp_arg_mul_I related
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
How it differs: It writes a complex number as its modulus times a complex exponential of its argument, the polar reading the article renames; it attaches no wave, no amplitude and no phase to the 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. - 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
700918d11840 · pair key 59b2190479a5.
Sign in to tag this passage
-
Notation · supporting · Applications › In applied mathematics › Signal analysis
✕Not formalized
If Fourier analysis is employed to write a given real-valued signal as a sum of periodic functions, these periodic functions are often written as complex-valued functions of the form x(t) = Re{X(t)} and X(t) = Aeiωt = aeiϕeiωt = aei(ωt + ϕ) where ω represents the angular frequency and the complex number A encodes the phase and amplitude as explained above.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt cf193f0cfea5). - 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
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 is the exponential law for a sum, which the displayed chain uses in passing when the phase factor and the time factor are merged; it writes no signal and fixes no amplitude.
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
b50a3e7246bb · pair key e8cdfaab39d5.
Sign in to tag this passage
-
Theorem · supporting · Applications › In applied mathematics › Signal analysis
✓Formalized
Formalized: Mathlib states a more general result (proved).
Another example, relevant to the two side bands of amplitude modulation of AM radio, is: cos((ω + α)t) + cos((ω − α)t)= Re(ei(ω + α)t + ei(ω − α)t)= Re((eiαt + e−iαt) ⋅ eiωt)= Re(2cos(αt) ⋅ eiωt)= 2cos(αt) ⋅ Re(eiωt)= 2cos(αt) ⋅ cos(ωt).
Show in article · Read it in context on Wikipedia ↗
Real.cos_add_cos more general
theorem Real.cos_add_cos (x y : ℝ) : Real.cos x + Real.cos y = 2 * Real.cos ((x + y) / 2) * Real.cos ((x - y) / 2)
Mathlib.Analysis.Complex.Trigonometric · lines 622–623
Why more general: Mathlib states the sum of two cosines as twice the product of the cosines of the half sum and the half difference, for arbitrary real arguments.
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
fb5d4a8f82f0 · pair key 4d4681f34634.
Related, but states something else
Complex.cos_add_cos related
theorem Complex.cos_add_cos (x y : ℂ) : Complex.cos x + Complex.cos y = 2 * Complex.cos ((x + y) / 2) * Complex.cos ((x - y) / 2)
Mathlib.Analysis.Complex.Trigonometric · lines 364–374
How it differs: The same sum to product identity for complex arguments; the passage's quantities are real signals, and the real lemma above is the one stated for 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, 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
693e92f234fe · pair key e6486fed709e.
Sign in to tag this passage
-
Notation · supporting · Applications › In physics › Electromagnetism and electrical engineering
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
In electrical engineering, the imaginary unit is denoted by j, to avoid confusion with I, which is generally in use to denote electric current, or, more particularly, i, which is generally in use to denote instantaneous electric current.
Show in article · Read it in context on Wikipedia ↗
Complex.I close match
def Complex.I : ℂ
Mathlib.Basic.Complex.Basic · lines 240–241
Why close, not exact: Mathlib introduces the imaginary unit under the symbol I, where the passage records that electrical engineering writes the same element j; the article's remark about current symbols concerns usage rather than the 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
9a9b81c51605 · pair key 4eecde42f51a.
Sign in to tag this passage
-
Theorem · supporting · Applications › In physics › Electromagnetism and electrical engineering
✓Formalized
Formalized: Mathlib states a more general result (proved).
Because the voltage in an AC circuit is oscillating, it can be represented as V(t) = V0ejωt = V0(cos ωt + jsin ωt),
Show in article · Read it in context on Wikipedia ↗
Complex.exp_ofReal_mul_I more general
theorem Complex.exp_ofReal_mul_I (x : ℝ) : Complex.exp (↑x * Complex.I) = ↑(Real.cos x) + ↑(Real.sin x) * Complex.I
Mathlib.Analysis.Complex.Trigonometric · lines 538–539
Why more general: Mathlib states the exponential of a real multiple of the imaginary unit as the real cosine plus the real sine times that unit, for every real 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
6be00ce55be0 · pair key dd0253eb8e6f.
Complex.exp_mul_I more general
theorem Complex.exp_mul_I (x : ℂ) : Complex.exp (x * Complex.I) = Complex.cos x + Complex.sin x * Complex.I
Mathlib.Analysis.Complex.Trigonometric · lines 514–515
Why more general: Mathlib states Euler's formula for arbitrary complex arguments; the passage's phase is one of them, and at real arguments the two trigonometric functions agree with the real ones by the coercion.
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
f9d168167688 · pair key b027b3d11da6.
Sign in to tag this passage
-
Theorem · supporting · Applications › In physics › Electromagnetism and electrical engineering
◔Partial
With community edits: Partial. As published it is Formalized.
Partial, by a community edit: Mathlib states a special case (proved).
To obtain the measurable quantity, the real part is taken: v(t) = Re(V) = Re[V0ejωt] = V0cos ωt.
Show in article · Read it in context on Wikipedia ↗
Complex.exp_ofReal_mul_I_re special case
theorem Complex.exp_ofReal_mul_I_re (x : ℝ) : (Complex.exp (↑x * Complex.I)).re = Real.cos x
Mathlib.Analysis.Complex.Trigonometric · lines 531–532
Community Agent The pipeline said more general; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
Why a special case: Complex.exp_ofReal_mul_I_re says that the real part of exp(x i) is cos x for real x. That is the passage's identity with amplitude V0 = 1 and x = ωt. The passage's general case, Re[V0 e^{jωt}] = V0 cos ωt for any real amplitude V0, also needs the fact that taking real parts commutes with multiplying by a real number. So the declaration is a special case of the passage, not a more general statement.
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
35d30cc953b0 · pair key 76cdc7694c2b.
Related, but states something else
Complex.exp_re related
theorem Complex.exp_re (x : ℂ) : (Complex.exp x).re = Real.exp x.re * Real.cos x.im
Mathlib.Analysis.Complex.Trigonometric · lines 522–524
How it differs: It gives the real part of an arbitrary complex exponential as a product of a real exponential and a cosine; reaching the passage from it needs the value of the real exponential at 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 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
6f7db3f3e7e6 · pair key 2066dbde94d8.
Sign in to tag this passage
-
Definition · supporting · Applications › In physics › Electromagnetism and electrical engineering
✕Not formalized
The complex-valued signal V(t) is called the analytic representation of the real-valued, measurable signal v(t).
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt bc308a1796e6). - 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
-
Theorem · main statement · Characterizations, generalizations and related notions › Algebraic characterization
✓Formalized
Formalized: Mathlib states this exactly (proved).
The field ℂ has the following three properties:
First, it has characteristic 0. This means that 1 + 1 + ⋯ + 1 ≠ 0 for any number of summands (all of which equal one).
Show in article · Read it in context on Wikipedia ↗
Complex.instCharZero exact match
instance Complex.instCharZero : CharZero ℂ
Mathlib.Basic.Complex.Basic · lines 789–790
Note: Mathlib records characteristic zero as injectivity of the cast from the natural numbers, the same condition the passage spells out by repeated sums of 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
566c932f3336 · pair key 86d50c611af4.
Sign in to tag this passage
-
Theorem · main statement · Characterizations, generalizations and related notions › Algebraic characterization
✕Not formalized
Second, its transcendence degree over ℚ, the prime field of ℂ, is the cardinality of the continuum.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 4 candidates examined (receipt 108f9327bb2e). - 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
-
Theorem · main statement · Characterizations, generalizations and related notions › Algebraic characterization
✓Formalized
Formalized: Mathlib states this exactly (proved).
Third, it is algebraically closed (see above).
Show in article · Read it in context on Wikipedia ↗
Complex.isAlgClosed exact match
instance Complex.isAlgClosed : IsAlgClosed ℂ
Mathlib.Analysis.Complex.Polynomial.Basic · lines 52–53
Note: Mathlib registers the complex field as algebraically closed, the property the passage lists third.
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
7357e60aa3d2 · pair key 0749cf62fd6d.
Sign in to tag this passage
-
Theorem · main statement · Characterizations, generalizations and related notions › Algebraic characterization
✓Formalized
Formalized: Mathlib states a more general result (a definition).
It can be shown that any field having these properties is isomorphic (as a field) to ℂ. For example, the algebraic closure of the field ℚp of the p-adic number also satisfies these three properties, so these two fields are isomorphic (as fields, but not as topological fields).
Show in article · Read it in context on Wikipedia ↗
IsAlgClosed.equivOfTranscendenceBasis more general
def IsAlgClosed.equivOfTranscendenceBasis {R : Type*} {L : Type*} {K : Type*} [CommRing R] [Field K] [Algebra R K] [Field L] [Algebra R L] {ι : Type*} (v : ι → K) {κ : Type*} (w : κ → L) [IsAlgClosed K] [IsAlgClosed L] : ι ≃ κ → IsTranscendenceBasis R v → IsTranscendenceBasis R w → K ≃+* L
Mathlib.FieldTheory.IsAlgClosed.Classification · lines 62–73
Why more general: Mathlib phrases it over an arbitrary base ring and an arbitrary second field, and takes the transcendence bases themselves as arguments where the article speaks of the transcendence degree over the prime field.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Re-checked 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
429fbf93b663 · pair key 2f9c8d313404.
Related, but states something else
IsAlgClosed.ringEquiv_of_equiv_of_charZero related
theorem IsAlgClosed.ringEquiv_of_equiv_of_charZero {K : Type u} {L : Type v} [Field K] [Field L] [IsAlgClosed K] [IsAlgClosed L] [CharZero K] [CharZero L] : Cardinal.aleph0 < Cardinal.mk K → Nonempty (K ≃ L) → Nonempty (K ≃+* L)
Mathlib.FieldTheory.IsAlgClosed.Classification · lines 160–173
How it differs: It keys the classification on the two fields having the same number of elements, where the article keys it on the transcendence degree over the prime 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, 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
b4fe261899d9 · pair key e858da568706.
IsAlgClosed.cardinal_eq_cardinal_transcendence_basis_of_aleph0_lt related
theorem IsAlgClosed.cardinal_eq_cardinal_transcendence_basis_of_aleph0_lt {R : Type u} {K : Type v} [CommRing R] [Field K] [Algebra R K] [IsAlgClosed K] {ι : Type w} (v : ι → K) [Nontrivial R] : IsTranscendenceBasis R v → Cardinal.mk R ≤ Cardinal.aleph0 → Cardinal.aleph0 < Cardinal.mk K → (Cardinal.mk K).lift = (Cardinal.mk ι).lift
Mathlib.FieldTheory.IsAlgClosed.Classification · lines 123–143
How it differs: It equates the cardinality of an uncountable algebraically closed field with that of a transcendence basis, which is the link between the article's second property and Mathlib's cardinality hypothesis.
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
de122881f07a · pair key fdd4adbbb1ee.
Sign in to tag this passage
-
Theorem · supporting · Characterizations, generalizations and related notions › Algebraic characterization
◔Partial
Partial: Mathlib states part of this (proved).
It can be shown that any field having these properties is isomorphic (as a field) to ℂ. For example, the algebraic closure of the field ℚp of the p-adic number also satisfies these three properties, so these two fields are isomorphic (as fields, but not as topological fields).
Show in article · Read it in context on Wikipedia ↗
PadicAlgCl.charZero states part
instance PadicAlgCl.charZero (p : ℕ) [hp : Fact (Nat.Prime p)] : CharZero (PadicAlgCl p)
Mathlib.NumberTheory.Padics.Complex · lines 130–131
Why only part: PadicAlgCl p is Mathlib's name for a fixed algebraic closure of ℚ_p, so this is the declaration stated for the passage's own field.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, 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
33d758932dff · pair key 6c7c51d15571.
AlgebraicClosure.isAlgClosed states part
instance AlgebraicClosure.isAlgClosed (k : Type u) [Field k] : IsAlgClosed (AlgebraicClosure k)
Mathlib.FieldTheory.IsAlgClosed.AlgebraicClosure · line 203
Why only part: Stated for the algebraic closure of an arbitrary field, and PadicAlgCl p is that construction applied to ℚ_p.
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
9f9317fa2c90 · pair key 1e5ad6f45342.
Related, but states something else
continuum_le_cardinal_of_nontriviallyNormedField related
theorem continuum_le_cardinal_of_nontriviallyNormedField (𝕜 : Type*) [NontriviallyNormedField 𝕜] [CompleteSpace 𝕜] : Cardinal.continuum ≤ Cardinal.mk 𝕜
Mathlib.Topology.Algebra.Module.Cardinality · lines 34–50
How it differs: It bounds the size of a complete nontrivially normed field from below by the continuum, which bears on the size of ℚ_p but says nothing about a transcendence degree.
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. - 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
dba265072af1 · pair key abd01f523119.
Sign in to tag this passage
-
Theorem · supporting · Characterizations, generalizations and related notions › Algebraic characterization
✕Not formalized
It can be shown that any field having these properties is isomorphic (as a field) to ℂ. For example, the algebraic closure of the field ℚp of the p-adic number also satisfies these three properties, so these two fields are isomorphic (as fields, but not as topological fields).[61]
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt ec84e39d0c47). - 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
-
Theorem · supporting · Characterizations, generalizations and related notions › Algebraic characterization
✕Not formalized
Also, ℂ is isomorphic to the field of complex Puiseux series.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 606b551f8c0f). - 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
-
Theorem · supporting · Characterizations, generalizations and related notions › Algebraic characterization
✕Not formalized
Another consequence of this algebraic characterization is that ℂ contains many proper subfields that are isomorphic to ℂ.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 8549aeb6e0bd). - 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
-
Theorem · main statement · Characterizations, generalizations and related notions › Characterization as a topological field
◔Partial
Partial: Mathlib states part of this (proved).
ℂ contains a subset P (namely the set of positive real numbers) of nonzero elements satisfying the following three conditions:
P is closed under addition, multiplication and taking inverses. If x and y are distinct elements of P, then either x − y or y − x is in P. If S is any nonempty subset of P, then S + P = x + P for some x in ℂ.
Show in article · Read it in context on Wikipedia ↗
lt_or_gt_of_ne states part
theorem lt_or_gt_of_ne {α : Type*} [LinearOrder α] {a b : α} : a ≠ b → a < b ∨ b < a
Mathlib.Order.Defs.LinearOrder · lines 109–110
Why only part: Mathlib states the dichotomy for an arbitrary linear order and writes it with strict inequalities where the article writes membership of the difference in the positive 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
d068f01fd9dd · pair key 540fcd04b6a8.
mul_pos states part
theorem mul_pos {α : Type*} [MulZeroClass α] {a b : α} [Preorder α] [PosMulStrictMono α] : 0 < a → 0 < b → 0 < a * b
Mathlib.Algebra.Order.GroupWithZero.Basic · line 42
Why only part: It covers closure under multiplication only; closure under addition and under inverses are separate declarations.
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
813a7d4b8589 · pair key 118548147335.
add_pos states part
theorem add_pos {α : Type*} {a b c : α} [AddZeroClass α] [Preorder α] [AddLeftStrictMono α] : b < c → 0 < a → b < c + a
Mathlib.Algebra.Order.Monoid.Unbundled.Basic · line 755
Why only part: Mathlib's form is the covariant one, so the passage's additive closure appears by taking the lower bound to be 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 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
b91ef1719257 · pair key 9701aa285750.
inv_pos states part
theorem inv_pos {G₀ : Type*} [GroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {a : G₀} : 0 < a⁻¹ ↔ 0 < a
Mathlib.Algebra.Order.GroupWithZero.Basic · lines 836–841
Why only part: It is phrased as an equivalence between positivity of an element and of its inverse, which contains the direction the passage needs.
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
7d12a795d840 · pair key 3e1ac4fb781e.
Related, but states something else
Real.exists_isGLB related
theorem Real.exists_isGLB {s : Set ℝ} : s.Nonempty → BddBelow s → ∃ x, IsGLB s x
Mathlib.Algebra.Order.Archimedean.Real.Basic · lines 107–112
How it differs: It supplies the greatest lower bound that the third condition's witness would be, but it states nothing about the sumset of S with the positive reals.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 5 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
477cbb08f0cd · pair key a398fe931c91.
Sign in to tag this passage
-
Theorem · supporting · Characterizations, generalizations and related notions › Characterization as a topological field
◔Partial
Partial: Mathlib states part of this (a definition).
Moreover, ℂ has a nontrivial involutive automorphism x ↦ x* (namely the complex conjugation), such that x x* is in P for any nonzero x in ℂ.
Show in article · Read it in context on Wikipedia ↗
Complex.conjAe states part
def Complex.conjAe : Gal(ℂ/ℝ)
Mathlib.LinearAlgebra.Complex.Module · lines 250–255
Why only part: It is the bundled automorphism, so it carries the map but asserts neither nontriviality nor the positivity of the product with the image.
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
cad76c7fc528 · pair key ac4f10c71227.
Complex.mul_conj states part
theorem Complex.mul_conj (z : ℂ) : z * (starRingEnd ℂ) z = ↑(Complex.normSq z)
Mathlib.Basic.Complex.Basic · lines 585–586
Why only part: It identifies the product as a real value; that this value is positive for nonzero x is a separate 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: 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
bd38b500e86f · pair key c5f7a0ce812f.
Complex.conj_conj states part
theorem Complex.conj_conj {R : Type u} [CommSemiring R] [StarRing R] (x : R) : (starRingEnd R) ((starRingEnd R) x) = x
Mathlib.Algebra.Star.Basic · line 373
Why only part: Stated for any commutative star ring and applied here to ℂ.
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
942c03b79564 · pair key fd48274f448b.
Related, but states something else
Complex.normSq_pos related
theorem Complex.normSq_pos {z : ℂ} : 0 < Complex.normSq z ↔ z ≠ 0
Mathlib.Basic.Complex.Basic · lines 564–565
How it differs: It characterises positivity of normSq by nonvanishing, which only reaches the passage's condition once combined with the identity for the product with the conjugate.
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. - 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
c809863cd797 · pair key 9c5b60e4647d.
Complex.conj_I related
theorem Complex.conj_I : (starRingEnd ℂ) Complex.I = -Complex.I
Mathlib.Basic.Complex.Basic · lines 478–479
How it differs: It computes conjugation on the imaginary unit, which shows the automorphism is not the identity only after one knows the unit differs from 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 5 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
3dfb8e2. - Location key
91dbcd692f3f · pair key 3dee37fd6689.
Sign in to tag this passage
-
Theorem · supporting · Characterizations, generalizations and related notions › Characterization as a topological field
✕Not formalized
Any field F with these properties can be endowed with a topology by taking the sets B(x, p) = { y | p − (y − x)(y − x)* ∈ P } as a base, where x ranges over the field and p ranges over P.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt f58b71ff86aa). - 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
-
Theorem · main statement · Characterizations, generalizations and related notions › Characterization as a topological field
✕Not formalized
Any field F with these properties can be endowed with a topology by taking the sets B(x, p) = { y | p − (y − x)(y − x)* ∈ P } as a base, where x ranges over the field and p ranges over P. With this topology F is isomorphic as a topological field to ℂ.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 4b3b0354db02). - 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
-
Theorem · main statement · Characterizations, generalizations and related notions › Characterization as a topological field
◔Partial
Partial: Mathlib states a special case (proved).
The only connected locally compact topological fields are ℝ and ℂ. This gives another characterization of ℂ as a topological field, because ℂ can be distinguished from ℝ because the nonzero complex numbers are connected, while the nonzero real numbers are not.
Show in article · Read it in context on Wikipedia ↗
NormedAlgebra.Real.nonempty_algEquiv_or special case
theorem NormedAlgebra.Real.nonempty_algEquiv_or (F : Type*) [NormedField F] [NormedAlgebra ℝ F] : Nonempty (F ≃ₐ[ℝ] ℝ) ∨ Nonempty (F ≃ₐ[ℝ] ℂ)
Mathlib.Analysis.Normed.Algebra.GelfandMazur · lines 406–412
Why a special case: Mathlib assumes a real norm on the field where the sentence assumes connectedness together with local compactness, and both of the sentence's two answers meet that assumption.
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
d997c8c38e01 · pair key f5313c1cffe6.
Sign in to tag this passage
-
Theorem · supporting · Characterizations, generalizations and related notions › Characterization as a topological field
◔Partial
Partial: Mathlib states part of this (proved).
…connected locally compact topological fields are ℝ and ℂ. This gives another characterization of ℂ as a topological field, because ℂ can be distinguished from ℝ because the nonzero complex numbers are connected, while the nonzero real numbers are not.
Show in article · Read it in context on Wikipedia ↗
Complex.instPathConnectedSpaceUnits states part
instance Complex.instPathConnectedSpaceUnits : PathConnectedSpace ℂˣ
Mathlib.Analysis.Complex.Convex · lines 98–111
Why only part: The unit type of a field and its set of nonzero elements are two writings of one set, so only the strength of the conclusion separates this from the first conjunct; the second conjunct, about the nonzero reals, is not addressed 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, 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
bed633a4d2ca · pair key bf4340fe7a5b.
Related, but states something else
isConnected_compl_singleton_of_one_lt_rank related
theorem isConnected_compl_singleton_of_one_lt_rank {E : Type*} [AddCommGroup E] [_root_.Module ℝ E] [TopologicalSpace E] [ContinuousAdd E] [ContinuousSMul ℝ E] : 1 < Module.rank ℝ E → ∀ (x : E), IsConnected {x}ᶜ
Mathlib.Analysis.Normed.Module.Connected · lines 126–128
How it differs: After instantiating, the remaining side condition is that the real rank of the complex plane exceeds one, which needs the named rank lemma rather than decidable arithmetic, so by PD8 this stays related rather than broad.
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
6376ddef07ed · pair key 83a010c7d249.
Real.convex_iff_isPreconnected related
theorem Real.convex_iff_isPreconnected {s : Set ℝ} : Convex ℝ s ↔ IsPreconnected s
Mathlib.Analysis.Convex.Topology · lines 43–44
How it differs: It identifies the preconnected subsets of the line with the convex ones; the second conjunct would follow only after the separate observation that the nonzero reals are not convex, so it states something else.
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
1f1202193c0b · pair key 88765f663ac2.
Sign in to tag this passage
-
Theorem · supporting · Characterizations, generalizations and related notions › Other number systems
✕Not formalized
The process of extending the field ℝ of reals to ℂ is an instance of the Cayley–Dickson construction.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 02a2fd0ddd41). - 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
-
Theorem · supporting · Characterizations, generalizations and related notions › Other number systems
✕Not formalized
Applying this construction iteratively to ℂ then yields the quaternions, the octonions,[63] the sedenions, and the trigintaduonions.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 5 queries and 3 candidates examined (receipt debf9e287056). - 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
-
Theorem · main statement · Characterizations, generalizations and related notions › Other number systems
✕Not formalized
Unlike the reals, ℂ is not an ordered field, that is to say, it is not possible to define a relation z1 < z2 that is compatible with the addition and multiplication.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt f601f90eed2a). - 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
-
Theorem · supporting · Characterizations, generalizations and related notions › Other number systems
◔Partial
Partial: Mathlib states a special case (proved).
In fact, in any ordered field, the square of any element is necessarily positive, so i2 = −1 precludes the existence of an ordering on ℂ. [64] Passing from ℂ to the quaternions ℍ loses commutativity, while the octonions (additionally to not being commutative) fail to be associative.
Show in article · Read it in context on Wikipedia ↗
pow_two_pos_of_ne_zero special case
theorem pow_two_pos_of_ne_zero {R : Type*} [Semiring R] [LinearOrder R] [IsStrictOrderedRing R] [ExistsAddOfLE R] {a : R} : a ≠ 0 → 0 < a ^ 2
Mathlib.Algebra.Order.Ring.Basic · line 226
Why a special case: It reaches the strict conclusion but only for nonzero elements, so it is the passage's claim restricted to those elements of 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 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
1169a720560c · pair key 7906db723bc3.
Related, but states something else
sq_nonneg related
theorem sq_nonneg {R : Type u} [Semiring R] [LinearOrder R] [ExistsAddOfLE R] [PosMulMono R] [AddLeftMono R] (a : R) : 0 ≤ a ^ 2
Mathlib.Algebra.Order.Ring.Unbundled.Basic · lines 608–618
How it differs: The declaration is stated for any linearly ordered semiring, so it covers every ordered field; it gives that a square is never below zero, the content the passage uses to rule out an order in which a square equals minus one, with zero as the boundary 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, 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
ce5744be7290 · pair key 931fbd399572.
Sign in to tag this passage
-
Theorem · supporting · Characterizations, generalizations and related notions › Other number systems
✕Not formalized
In fact, in any ordered field, the square of any element is necessarily positive, so i2 = −1 precludes the existence of an ordering on ℂ. [64] Passing from ℂ to the quaternions ℍ loses commutativity, while the octonions (additionally to not being commutative) fail to be associative.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 4 candidates examined (receipt 262cd965f47d). - 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
-
Theorem · supporting · Characterizations, generalizations and related notions › Other number systems
◔Partial
Partial: TauCeti states part of this (proved).
In fact, in any ordered field, the square of any element is necessarily positive, so i2 = −1 precludes the existence of an ordering on ℂ. [64] Passing from ℂ to the quaternions ℍ loses commutativity, while the octonions (additionally to not being commutative) fail to be associative.
Show in article · Read it in context on Wikipedia ↗
TauCeti.Quaternion.commute_iff states part
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
Why only part: Lean states when two quaternions over a commutative ring commute; the passage's claim is read off by failing that criterion at 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 1 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
83245ab. - Location key
28fabe914567 · pair key e1ee6cb8727a.
Sign in to tag this passage
-
Theorem · supporting · Characterizations, generalizations and related notions › Other number systems
◔Partial
Partial: Mathlib states part of this (a definition).
The reals, complex numbers, quaternions and octonions are all normed division algebras over ℝ.
Show in article · Read it in context on Wikipedia ↗
Real.normedField states part
instance Real.normedField : NormedField ℝ
Mathlib.Analysis.Normed.Field.Basic · lines 302–304
Why only part: Lean records the reals as a normed field; the compatibility of that norm with real scalars is a separate 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 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
79fa13e42ce2 · pair key ef87ce42611e.
NormedAlgebra.id states part
instance NormedAlgebra.id (𝕜 : Type*) [NormedField 𝕜] : NormedAlgebra 𝕜 𝕜
Mathlib.Analysis.Normed.Module.Basic · lines 356–357
Why only part: Lean gives every normed field the structure of a normed algebra over itself, which at the reals is the 'over the reals' half.
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
9304471f4260 · pair key 85ec494aab0a.
Sign in to tag this passage
-
Theorem · supporting · Characterizations, generalizations and related notions › Other number systems
◔Partial
Partial: Mathlib states part of this (a definition).
The reals, complex numbers, quaternions and octonions are all normed division algebras over ℝ.
Show in article · Read it in context on Wikipedia ↗
Complex.instNormedField states part
instance Complex.instNormedField : NormedField ℂ
Mathlib.Analysis.Complex.Basic · lines 65–67
Why only part: Lean records the complex numbers as a normed field; their normed-algebra structure over the reals is a separate 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 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
15d5a95adafa · pair key 7513b9eea511.
Complex.instNormedAlgebraOfReal states part
instance Complex.instNormedAlgebraOfReal {R : Type*} [NormedField R] [NormedAlgebra R ℝ] : NormedAlgebra R ℂ
Mathlib.Analysis.Complex.Basic · lines 74–76
Why only part: Lean derives the normed-algebra structure on the complex numbers from any base normed field mapping into the reals, the reals 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, 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
a87cbdf9254d · pair key 9b753625a6ff.
Sign in to tag this passage
-
Theorem · supporting · Characterizations, generalizations and related notions › Other number systems
◔Partial
Partial: Mathlib states part of this (a definition).
The reals, complex numbers, quaternions and octonions are all normed division algebras over ℝ.
Show in article · Read it in context on Wikipedia ↗
Quaternion.instNormedDivisionRingReal states part
instance Quaternion.instNormedDivisionRingReal : NormedDivisionRing (Quaternion ℝ)
Mathlib.Analysis.Quaternion · lines 85–87
Why only part: Lean records the real quaternions as a normed division ring; the compatibility of that norm with real scalars is a separate 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 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
06db1c73f539 · pair key 6aebb83d59ad.
Quaternion.instNormedAlgebraReal states part
instance Quaternion.instNormedAlgebraReal : NormedAlgebra ℝ (Quaternion ℝ)
Mathlib.Analysis.Quaternion · lines 89–90
Why only part: Lean records the normed-algebra-over-the-reals structure on the quaternions as its own 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 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
67288713eb3a · pair key c0192f0d653a.
Sign in to tag this passage
-
Theorem · supporting · Characterizations, generalizations and related notions › Other number systems
✕Not formalized
The reals, complex numbers, quaternions and octonions are all normed division algebras over ℝ.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 31a4a5e546c3). - 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
TauCeti.Octonion.norm_mul related
theorem TauCeti.Octonion.norm_mul {R : Type*} [CommRing R] (x y : TauCeti.Octonion R) : (x * y).norm = x.norm * y.norm
TauCeti.Algebra.Octonion.Basic · lines 522–527
How it differs: Lean's octonion type is documented as the split octonions, whose norm form is isotropic and which therefore has zero divisors.
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
83245ab. - Location key
6ad2c2a44ec4 · pair key 5b9b27ee4298.
Sign in to tag this passage
-
Theorem · main statement · Characterizations, generalizations and related notions › Other number systems
◔Partial
Partial: ATLAS (atlas-lean) states a special case (proved).
By Hurwitz's theorem they are the only ones; the sedenions, the next step in the Cayley–Dickson construction, fail to have this structure.
Show in article · Read it in context on Wikipedia ↗
MathlibExt.Algebra.Algebra.FrobeniusDivisionWanted.frobenius_real_division_algebra special case
theorem MathlibExt.Algebra.Algebra.FrobeniusDivisionWanted.frobenius_real_division_algebra {A : Type*} [DivisionRing A] [Algebra ℝ A] [FiniteDimensional ℝ A] : Nonempty (A ≃ₐ[ℝ] ℝ) ∨ Nonempty (A ≃ₐ[ℝ] ℂ) ∨ Nonempty (A ≃ₐ[ℝ] Quaternion ℝ)
MathlibExt.Algebra.Algebra.FrobeniusDivision · line 862
Why a special case: Lean restricts to associative finite-dimensional algebras, where the list of possibilities shortens by one and the octonions drop 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 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
802690309744 · pair key 0967967a3c6d.
NormedAlgebra.Real.nonempty_algEquiv_or special case
theorem NormedAlgebra.Real.nonempty_algEquiv_or (F : Type*) [NormedField F] [NormedAlgebra ℝ F] : Nonempty (F ≃ₐ[ℝ] ℝ) ∨ Nonempty (F ≃ₐ[ℝ] ℂ)
Mathlib.Analysis.Normed.Algebra.GelfandMazur · lines 406–412
Why a special case: Lean asks that the multiplication commute, which rules out the quaternions and the octonions from its reach.
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
e92a712d4490 · pair key 9c4fbec5473f.
TauCeti.nonempty_algEquiv_real_or_quaternion special case
theorem TauCeti.nonempty_algEquiv_real_or_quaternion (D : Type*) [DivisionRing D] [Algebra ℝ D] [Algebra.IsCentral ℝ D] [FiniteDimensional ℝ D] : Nonempty (D ≃ₐ[ℝ] ℝ) ∨ Nonempty (D ≃ₐ[ℝ] Quaternion ℝ)
TauCeti.Algebra.CentralSimple.Real · lines 374–393
Why a special case: Lean adds centrality over the reals, which excludes the complex numbers and leaves two of the four algebras.
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
d325d454a397 · pair key 28ba5db53f1e.
Sign in to tag this passage
-
Theorem · supporting · Characterizations, generalizations and related notions › Other number systems
✕Not formalized
By Hurwitz's theorem they are the only ones; the sedenions, the next step in the Cayley–Dickson construction, fail to have this structure.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt dd9a01f77a92). - 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
-
Theorem · supporting · Characterizations, generalizations and related notions › Other number systems
✓Formalized
Formalized: Mathlib states a more general result (a definition).
This means the following: the ℝ -linear map ℂ→ ℂz↦ wz for some fixed complex number w can be represented by a 2 × 2 matrix (once a basis has been chosen).
Show in article · Read it in context on Wikipedia ↗
Algebra.leftMulMatrix more general
def Algebra.leftMulMatrix {R : Type*} {S : Type*} [CommSemiring R] [Semiring S] [Algebra R S] {m : Type*} [Fintype m] [DecidableEq m] : Module.Basis m R S → S →ₐ[R] Matrix m m R
Mathlib.LinearAlgebra.Matrix.ToLin · lines 949–962
Why more general: The declaration is stated for an arbitrary algebra S over a commutative base ring, so it covers the passage's case of the complex numbers over the reals along with many others.
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
6b636d160114 · pair key ef4ccaecd237.
LinearMap.toMatrix more general
def LinearMap.toMatrix {R : Type*} [CommSemiring R] {m : Type*} {n : Type*} [Fintype n] [Finite m] [DecidableEq n] {M₁ : Type*} {M₂ : Type*} [AddCommMonoid M₁] [AddCommMonoid M₂] [_root_.Module R M₁] [_root_.Module R M₂] : Module.Basis n R M₁ → Module.Basis m R M₂ → (M₁ →ₗ[R] M₂) ≃ₗ[R] Matrix m n R
Mathlib.LinearAlgebra.Matrix.ToLin · lines 583–584
Why more general: This covers every real linear map between finitely based modules, of which the passage's multiplication map is one 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 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
cc8628cb3f0c · pair key d6d11f27f9ab.
toMatrix_rotation special case
theorem toMatrix_rotation (a : Circle) : (LinearMap.toMatrix Complex.basisOneI Complex.basisOneI) ↑(rotation a).toLinearEquiv = ↑(Matrix.planeConformalMatrix (↑a).re (↑a).im ⋯)
Mathlib.Analysis.Complex.Isometry · lines 142–150
Why a special case: The declaration restricts the multiplier to the unit circle, so it gives the passage's claim only for those w.
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
88fd7015ebf4 · pair key 6cb697e01ae9.
Sign in to tag this passage
-
Theorem · supporting · Characterizations, generalizations and related notions › Other number systems
◔Partial
Partial: Mathlib states a special case (proved).
With respect to the basis (1, i), this matrix is (Re(w)−Im(w)Im(w)Re(w)), that is, the one mentioned in the section on matrix representation of complex numbers above.
Show in article · Read it in context on Wikipedia ↗
toMatrix_rotation special case
theorem toMatrix_rotation (a : Circle) : (LinearMap.toMatrix Complex.basisOneI Complex.basisOneI) ↑(rotation a).toLinearEquiv = ↑(Matrix.planeConformalMatrix (↑a).re (↑a).im ⋯)
Mathlib.Analysis.Complex.Isometry · lines 142–150
Why a special case: The multiplier is restricted to the unit circle, and the right hand side is written as the underlying matrix of a plane conformal invertible matrix rather than as a displayed array.
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
02b345b8da20 · pair key 14b1981f44d7.
Related, but states something else
Matrix.val_planeConformalMatrix related
theorem Matrix.val_planeConformalMatrix {R : Type*} [Field R] (a b : R) (hab : a ^ 2 + b ^ 2 ≠ 0) : ↑(Matrix.planeConformalMatrix a b hab) = !![a, -b; b, a]
Mathlib.LinearAlgebra.Matrix.GeneralLinearGroup.Basic · line 25
How it differs: It writes out the entries of the plane conformal matrix in the shape the passage displays, but it never says this matrix represents multiplication by a complex 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 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
10ae15d8e4ff · pair key ed93761f00e7.
Algebra.leftMulMatrix_eq_repr_mul related
theorem Algebra.leftMulMatrix_eq_repr_mul {R : Type*} {S : Type*} [CommSemiring R] [Semiring S] [Algebra R S] {m : Type*} [Fintype m] [DecidableEq m] (b : Module.Basis m R S) (x : S) (i j : m) : (Algebra.leftMulMatrix b) x i j = (b.repr (x * b j)) i
Mathlib.LinearAlgebra.Matrix.ToLin · lines 967–970
How it differs: It gives each entry as a basis coordinate of a product, so reaching the displayed array still needs the coordinates of w and of w times i to be worked out separately.
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
869575aa831d · pair key 9999623889c1.
Sign in to tag this passage
-
Theorem · supporting · Characterizations, generalizations and related notions › Other number systems
✕Not formalized
While this is a linear representation of ℂ in the 2 × 2 real matrices, it is not the only one.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 260d4d6a8d55). - 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
Complex.lift related
def Complex.lift {A : Type*} [Ring A] [Algebra ℝ A] : { I' // I' * I' = -1 } ≃ (ℂ →ₐ[ℝ] A)
Mathlib.LinearAlgebra.Complex.Module · lines 334–338
How it differs: It matches real algebra maps out of the complex numbers with elements squaring to minus one, but on its own it says nothing about how many such elements the two by two real matrices contain.
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
5f15e59c4373 · pair key b83b0fccfc6a.
Sign in to tag this passage
-
Theorem · supporting · Characterizations, generalizations and related notions › Other number systems
✓Formalized
Formalized: TauCeti states a more general result (proved).
Any matrix J = (pqr−p), p2 + qr + 1 = 0 has the property that its square is the negative of the identity matrix: J2 = −I.
Show in article · Read it in context on Wikipedia ↗
Matrix.sq_eq_trace_smul_sub_det_smul_one_fin_two more general
theorem Matrix.sq_eq_trace_smul_sub_det_smul_one_fin_two {R : Type*} [CommRing R] (A : Matrix (Fin 2) (Fin 2) R) : A ^ 2 = A.trace • A - A.det • 1
TauCeti.LinearAlgebra.Matrix.Trace.FinTwo · lines 63–67
Why more general: The declaration is the general two by two identity over any commutative ring; once it is applied to the displayed array only the trace and determinant of that array and real arithmetic with the given relation remain.
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
a2ae1db8cca3 · pair key d3c3cb7ac9b3.
Related, but states something else
Matrix.charpoly_fin_two related
theorem Matrix.charpoly_fin_two {R : Type u} [CommRing R] [Nontrivial R] (M : Matrix (Fin 2) (Fin 2) R) : M.charpoly = Polynomial.X ^ 2 - Polynomial.C M.trace * Polynomial.X + Polynomial.C M.det
Mathlib.LinearAlgebra.Matrix.Charpoly.Coeff · lines 228–230
How it differs: It identifies the characteristic polynomial of a two by two matrix, so reaching the passage would still require the Cayley Hamilton theorem as a separate step.
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
75028a3d6468 · pair key f8691854a0e1.
Sign in to tag this passage
-
Theorem · supporting · Characterizations, generalizations and related notions › Other number systems
✕Not formalized
Any matrix J = (pqr−p), p2 + qr + 1 = 0 has the property that its square is the negative of the identity matrix: J2 = −I. Then {z = aI + bJ : a, b ∈ ℝ} is also isomorphic to the field ℂ, and gives an alternative complex structure on ℝ2. This is generalized by the notion of a linear complex structure.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 8cd0ebdfcb1c). - 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
Complex.liftAux related
def Complex.liftAux {A : Type*} [Ring A] [Algebra ℝ A] (I' : A) : I' * I' = -1 → ℂ →ₐ[ℝ] A
Mathlib.LinearAlgebra.Complex.Module · lines 293–309
How it differs: It builds a real algebra map out of the complex numbers from such a J, but it asserts no isomorphism onto the span of the identity and J.
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
fda27afd66e4 · pair key 209a93cc2b5e.
Complex.range_liftAux related
theorem Complex.range_liftAux {A : Type*} [Ring A] [Algebra ℝ A] (I' : A) (hI' : I' * I' = -1) : (Complex.liftAux I' hI').range = ℝ[I']
Mathlib.LinearAlgebra.Complex.Module · lines 324–325
How it differs: It identifies the image of that map with the real subalgebra generated by J, which is the passage's set, but says nothing about the map being injective.
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
bde08f9d2ba4 · pair key 099351df59df.
TauCeti.AlmostComplexStructure related
structure TauCeti.AlmostComplexStructure (V : Type*) [AddCommGroup V] [_root_.Module ℝ V]
TauCeti.Geometry.Symplectic.AlmostComplex · lines 57–61
How it differs: It defines the notion of a real linear endomorphism squaring to minus one, which is what the passage calls a complex structure, but it asserts nothing about the passage's particular J.
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
83245ab. - Location key
588af3d2a6f4 · pair key 1e1d68fdefa3.
Sign in to tag this passage
-
Theorem · supporting · Characterizations, generalizations and related notions › Other number systems
✕Not formalized
Hypercomplex numbers also generalize ℝ, ℂ, ℍ, and 𝕆. For example, this notion contains the split-complex numbers, which are elements of the ring ℝ[x]/(x2 − 1) (as opposed to ℝ[x]/(x2 + 1) for complex numbers).
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt c487e401dc80). - 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
-
Definition · supporting · Characterizations, generalizations and related notions › Other number systems
✕Not formalized
Hypercomplex numbers also generalize ℝ, ℂ, ℍ, and 𝕆. For example, this notion contains the split-complex numbers, which are elements of the ring ℝ[x]/(x2 − 1) (as opposed to ℝ[x]/(x2 + 1) for complex numbers).
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 379a5cb52cc0). - 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
CliffordAlgebraComplex.equiv related
def CliffordAlgebraComplex.equiv : CliffordAlgebra CliffordAlgebraComplex.Q ≃ₐ[ℝ] ℂ
Mathlib.LinearAlgebra.CliffordAlgebra.Equivs · lines 188–189
How it differs: It is a real algebra isomorphism with the complex numbers for the Clifford algebra of the negative square form, the companion of the quotient by x squared plus one, and it never mentions the quotient by x squared minus 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. - 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
a3ec1a5d36cb · pair key 36b70c3697cf.
Sign in to tag this passage
-
Theorem · supporting · Characterizations, generalizations and related notions › Other number systems
✕Not formalized
In this ring, the equation a2 = 1 has four solutions.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt e3fa0c19029d). - 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
-
Theorem · supporting · Characterizations, generalizations and related notions › Other number systems
✓Formalized
Formalized: Mathlib states this exactly (a definition).
The field ℝ is the completion of ℚ, the field of rational numbers, with respect to the usual absolute value metric.
Show in article · Read it in context on Wikipedia ↗
rationalCauSeqPkg exact match
def rationalCauSeqPkg : AbstractCompletion ℚ
Mathlib.Topology.UniformSpace.CompareReals · lines 69–79
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
2c2c7f1f3e24 · pair key 46c73cab8423.
Rat.isDenseEmbedding_coe_real states part
theorem Rat.isDenseEmbedding_coe_real : IsDenseEmbedding Rat.cast
Mathlib.Topology.Instances.Rat · lines 43–44
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
af8c7a497767 · pair key 6595c3629f3c.
Real.instCompleteSpace states part
instance Real.instCompleteSpace : CompleteSpace ℝ
Mathlib.Topology.UniformSpace.Real · lines 27–35
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
ec1e4db49ef9 · pair key 3e7f197bb70e.
Sign in to tag this passage
-
Definition · supporting · Characterizations, generalizations and related notions › Other number systems
✓Formalized
Formalized: Mathlib states this exactly (a definition).
Other choices of metrics on ℚ lead to the fields ℚp of p-adic numbers (for any prime number p), which are thereby analogous to ℝ.
Show in article · Read it in context on Wikipedia ↗
Padic exact match
def Padic (p : ℕ) [Fact (Nat.Prime p)] : Type
Mathlib.NumberTheory.Padics.PadicNumbers · lines 536–538
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
68a36d05f9ca · pair key 8eefcf964d5a.
Padic.withValRingEquiv close match
def Padic.withValRingEquiv {p : ℕ} [Fact (Nat.Prime p)] : (Rat.padicValuation p).Completion ≃+* ℚ_[p]
Mathlib.NumberTheory.Padics.WithVal · lines 104–133
Why close, not exact: Writes the p-adic metric as the valuation of ℚ at p and identifies the resulting completion with ℚ_[p] by a ring isomorphism.
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
a4c0a45be98f · pair key b7897a30865f.
Related, but states something else
padicNorm related
def padicNorm : ℕ → ℚ → ℚ
Mathlib.NumberTheory.Padics.PadicNorm · lines 46–47
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
7f283914a9d2 · pair key d11d00cb6003.
Sign in to tag this passage
-
Theorem · main statement · Characterizations, generalizations and related notions › Other number systems
◔Partial
Partial: Mathlib states part of this (proved).
There are no other nontrivial ways of completing ℚ than ℝ and ℚp, by Ostrowski's theorem.
Show in article · Read it in context on Wikipedia ↗
Rat.AbsoluteValue.equiv_real_or_padic states part
theorem Rat.AbsoluteValue.equiv_real_or_padic (f : AbsoluteValue ℚ ℝ) : f.IsNontrivial → f ≈ Rat.AbsoluteValue.real ∨ ∃! p, ∃ (x : Fact (Nat.Prime p)), f ≈ Rat.AbsoluteValue.padic p
Mathlib.NumberTheory.Ostrowski · lines 437–441
Why only part: Writes a way of completing ℚ as a nontrivial absolute value taken up to equivalence, and lists the usual one and one per prime; ℝ and ℚ_p are built as the completions at exactly 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, 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
8aa55600ca95 · pair key 5afcf68add0f.
Rat.Place.exists_unique_place_equiv states part
theorem Rat.Place.exists_unique_place_equiv (f : AbsoluteValue ℚ ℝ) : f.IsNontrivial → ∃! v, f ≈ v.absoluteValue
MathlibExt.NumberTheory.Rat.Place · line 176
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
08c9966662e1 · pair key 0ff094f340da.
Rat.Place.completedField_finite states part
theorem Rat.Place.completedField_finite (prime : Nat.Primes) : (Rat.Place.finite prime).CompletedField = ℚ_[↑prime]
MathlibExt.NumberTheory.Rat.Place · line 94
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
64c2773. - Location key
47cf217a51bb · pair key f31ebf2f5197.
Rat.Place.completedField_infinite states part
theorem Rat.Place.completedField_infinite : Rat.Place.infinite.CompletedField = ℝ
MathlibExt.NumberTheory.Rat.Place · line 90
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
64c2773. - Location key
b99b75ebd7b5 · pair key a516e652d7b1.
Sign in to tag this passage
-
Theorem · supporting · Characterizations, generalizations and related notions › Other number systems
◔Partial
Partial: Mathlib states part of this (a definition).
The algebraic closures ℚp of ℚp still carry a norm, but (unlike ℂ) are not complete with respect to it.
Show in article · Read it in context on Wikipedia ↗
PadicAlgCl.normedField states part
instance PadicAlgCl.normedField (p : ℕ) [hp : Fact (Nat.Prime p)] : NormedField (PadicAlgCl p)
Mathlib.NumberTheory.Padics.Complex · line 67
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
22b4d5352727 · pair key 33ee94346bd2.
Related, but states something else
PadicAlgCl.norm_extends related
theorem PadicAlgCl.norm_extends (p : ℕ) [hp : Fact (Nat.Prime p)] (x : ℚ_[p]) : ‖(Algebra.algebraMap ℚ_[p] (PadicAlgCl p)) x‖ = ‖x‖
Mathlib.NumberTheory.Padics.Complex · lines 81–82
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
35bfcf148654 · pair key c728a6f16fd5.
Sign in to tag this passage
-
Theorem · supporting · Characterizations, generalizations and related notions › Other number systems
✓Formalized
Formalized: Mathlib states this exactly (proved).
The completion ℂp of ℚp turns out to be algebraically closed.
Show in article · Read it in context on Wikipedia ↗
PadicComplex.isAlgClosed exact match
instance PadicComplex.isAlgClosed (p : ℕ) [hp : Fact (Nat.Prime p)] : IsAlgClosed ℂ_[p]
Mathlib.NumberTheory.Padics.Complex · lines 244–245
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
f4f9f94ebb50 · pair key 87e0b61b2239.
Related, but states something else
IsAlgClosed.of_denseRange related
theorem IsAlgClosed.of_denseRange {K : Type*} {L : Type*} [Field K] [NontriviallyNormedField L] [CompleteSpace L] [CharZero L] [IsUltrametricDist L] [Algebra K L] : DenseRange ⇑(Algebra.algebraMap K L) → ∀ [IsAlgClosed K], IsAlgClosed L
Mathlib.Analysis.Normed.Field.Dense · lines 46–126
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
a232aa639e06 · pair key 17fbab62ceb8.
Sign in to tag this passage
-
Definition · supporting · Characterizations, generalizations and related notions › Other number systems
✓Formalized
Formalized: Mathlib states this exactly (a definition).
By analogy, the field is called p-adic complex numbers.
Show in article · Read it in context on Wikipedia ↗
PadicComplex exact match
abbrev PadicComplex (p : ℕ) [hp : Fact (Nat.Prime p)] : Type
Mathlib.NumberTheory.Padics.Complex · line 137
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
2fc3ca2e9795 · pair key 72823321718c.
Sign in to tag this passage
-
Definition · supporting · Characterizations, generalizations and related notions › Other number systems
◔Partial
Partial: Mathlib states a special case (a definition).
The fields ℝ, ℚp, and their finite field extensions, including ℂ, are called local fields.
Show in article · Read it in context on Wikipedia ↗
IsNonarchimedeanLocalField special case
class IsNonarchimedeanLocalField (K : Type*) [Field K] [ValuativeRel K] [TopologicalSpace K] : Prop
Mathlib.NumberTheory.LocalField.Basic · lines 46–50
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
9cd45b8ebabe · pair key 15206f25c1d1.
instIsNonarchimedeanLocalFieldPadic states part
instance instIsNonarchimedeanLocalFieldPadic {p : ℕ} [Fact (Nat.Prime p)] : IsNonarchimedeanLocalField ℚ_[p]
Mathlib.NumberTheory.Padics.LocalField · line 25
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
727d91703db1 · pair key 09e29ef8587d.
TauCeti.finiteExtension_isNonarchimedeanLocalField states part
theorem TauCeti.finiteExtension_isNonarchimedeanLocalField (K : Type*) [Field K] [ValuativeRel K] [TopologicalSpace K] [IsNonarchimedeanLocalField K] (M : Type*) [Field M] [Algebra K M] [Module.Finite K M] : IsNonarchimedeanLocalField M
TauCeti.NumberTheory.LocalField.FiniteExtension.Basic · lines 54–81
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
83245ab. - Location key
10109e2ae6b0 · pair key 21fdf3f92e1e.
Sign in to tag this passage