Theorems 1 to 27
TheoremThe Irrationality of the Square Root of 2#
Irrationality of the Square Root of 2
irrational_sqrt_two : Irrational √2
Sources
Uses 5
InstanceThe Denumerability of the Rational Numbers#
Denumerability of the Rational Numbers
Rat.instDenumerable : Denumerable ℚ
Sources
Uses 2
TheoremPythagorean Theorem#
Pythagorean theorem, if-and-only-if angle-at-point form.
EuclideanGeometry.dist_sq_eq_dist_sq_add_dist_sq_iff_angle_eq_pi_div_two.{u_1, u_2} {V : Type u_1}
{P : Type u_2} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P]
[NormedAddTorsor V P] (p₁ p₂ p₃ : P) :
dist p₁ p₃ * dist p₁ p₃ = dist p₁ p₂ * dist p₁ p₂ + dist p₃ p₂ * dist p₃ p₂ ↔
EuclideanGeometry.angle p₁ p₂ p₃ = Real.pi / 2
Sources
- Mathlib documentation:
EuclideanGeometry.dist_sq_eq_dist_sq_add_dist_sq_iff_angle_eq_pi_div_two - Source of
EuclideanGeometry.dist_sq_eq_dist_sq_add_dist_sq_iff_angle_eq_pi_div_twoin Mathlib/Geometry/Euclidean/Angle/Unoriented/RightAngle.lean - Freek Wiedijk's 100 theorems, no. 4
- 1000+ theorems list: Q11518
- 1000+ theorems project: Q11518
- Wikipedia: Pythagorean theorem
- Wikidata: Q11518
Uses 2
TheoremThe Area of a Circle#
Area of a Circle: The area of a disc with radius r is π * r ^ 2.
Theorems100.area_disc (r : NNReal) :
MeasureTheory.volume (Theorems100.disc ↑r) = ↑NNReal.pi * ↑r ^ 2
Sources
TheoremEuler’s Generalization of Fermat’s Little Theorem#
The Fermat-Euler totient theorem. ZMod.pow_totient is an alternative statement
of the same theorem.
Nat.ModEq.pow_totient {x n : ℕ} (h : x.Coprime n) : x ^ n.totient ≡ 1 [MOD n]
Sources
Uses 2
TheoremThe Infinitude of Primes#
Euclid's theorem on the infinitude of primes.
Here given in the form: for every n, there exists a prime number p ≥ n.
Nat.exists_infinite_primes (n : ℕ) : ∃ p, n ≤ p ∧ Nat.Prime p
Sources
Uses 2 · Used by 1
TheoremEuler’s Summation of 1 + (1/2)^2 + (1/3)^2 + ….#
Mathlib states this as hasSum_zeta_two.
hasSum_zeta_two : HasSum (fun n => 1 / ↑n ^ 2) (Real.pi ^ 2 / 6)
Sources
Uses 12
TheoremFundamental Theorem of Integral Calculus#
Mathlib records this with 2 declarations.
intervalIntegral.integral_hasStrictDerivAt_of_tendsto_ae_right: Fundamental theorem of calculus-1, strict differentiability in the right endpoint.
If f : ℝ → E is integrable on a..b and f x has a finite limit c almost surely at b, then
u ↦ ∫ x in a..u, f x has derivative c at b in the sense of strict differentiability.
intervalIntegral.integral_hasStrictDerivAt_of_tendsto_ae_right.{u_3} {E : Type u_3}
[NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] {f : ℝ → E} {c : E} {a b : ℝ}
(hf : IntervalIntegrable f MeasureTheory.volume a b)
(hmeas : StronglyMeasurableAtFilter f (nhds b) MeasureTheory.volume)
(hb : Filter.Tendsto f (nhds b ⊓ MeasureTheory.ae MeasureTheory.volume) (nhds c)) :
HasStrictDerivAt (fun u => ∫ (x : ℝ) in a..u, f x) c b
intervalIntegral.integral_eq_sub_of_hasDeriv_right_of_le: Fundamental theorem of calculus-2: If f : ℝ → E is continuous on [a, b] (where a ≤ b)
and has a right derivative at f' x for all x in (a, b), and f' is integrable on [a, b],
then ∫ y in a..b, f' y equals f b - f a.
intervalIntegral.integral_eq_sub_of_hasDeriv_right_of_le.{u_3} {E : Type u_3} [NormedAddCommGroup E]
[NormedSpace ℝ E] {a b : ℝ} [CompleteSpace E] {f f' : ℝ → E} (hab : a ≤ b)
(hcont : ContinuousOn f (Set.Icc a b))
(hderiv : ∀ x ∈ Set.Ioo a b, HasDerivWithinAt f (f' x) (Set.Ioi x) x)
(f'int : IntervalIntegrable f' MeasureTheory.volume a b) : ∫ (y : ℝ) in a..b, f' y = f b - f a
Sources
- Mathlib documentation:
intervalIntegral.integral_hasStrictDerivAt_of_tendsto_ae_right - Source of
intervalIntegral.integral_hasStrictDerivAt_of_tendsto_ae_rightin Mathlib/MeasureTheory/Integral/IntervalIntegral/FundThmCalculus.lean - Mathlib documentation:
intervalIntegral.integral_eq_sub_of_hasDeriv_right_of_le - Source of
intervalIntegral.integral_eq_sub_of_hasDeriv_right_of_lein Mathlib/MeasureTheory/Integral/IntervalIntegral/FundThmCalculus.lean - Freek Wiedijk's 100 theorems, no. 15
- 1000+ theorems list: Q1217677
- 1000+ theorems project: Q1217677
- Wikipedia: Fundamental theorem of calculus
- Wikidata: Q1217677
Uses 15 · Used by 2
TheoremInsolvability of General Higher Degree Equations (Abel-Ruffini Theorem)#
Abel-Ruffini Theorem
AbelRuffini.exists_not_solvable_by_rad : ∃ x, IsAlgebraic ℚ x ∧ x ∉ solvableByRad ℚ ℂ
Sources
- Mathlib documentation:
AbelRuffini.exists_not_solvable_by_rad - Source of
AbelRuffini.exists_not_solvable_by_radin Archive/Wiedijk100Theorems/AbelRuffini.lean - Freek Wiedijk's 100 theorems, no. 16
- 1000+ theorems list: Q657482
- 1000+ theorems project: Q657482
- Wikipedia: Abel–Ruffini theorem
- Wikidata: Q657482
Uses 11
TheoremDe Moivre’s Formula#
De Moivre's formula
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
Sources
TheoremLiouville’s Theorem and the Construction of Transcendental Numbers#
Liouville's Theorem
Liouville.transcendental {x : ℝ} (lx : Liouville x) : Transcendental ℤ x
Sources
Uses 15 · Used by 1
TheoremThe Non-Denumerability of the Continuum#
Mathlib states this as Cardinal.not_countable_real.
Cardinal.not_countable_real : ¬Set.univ.Countable
Sources
- Mathlib documentation:
Cardinal.not_countable_real - Source of
Cardinal.not_countable_realin Mathlib/Analysis/Real/Cardinality.lean - Freek Wiedijk's 100 theorems, no. 22
- 1000+ theorems list: Q22952648
- 1000+ theorems project: Q22952648
- Wikipedia: Cardinality of the continuum § Uncountability
- Wikidata: Q22952648
Uses 11
TheoremFormula for Pythagorean Triples#
Formula for Pythagorean Triples
PythagoreanTriple.classification {x y z : ℤ} :
PythagoreanTriple x y z ↔
∃ k m n,
(x = k * (m ^ 2 - n ^ 2) ∧ y = k * (2 * m * n) ∨
x = k * (2 * m * n) ∧ y = k * (m ^ 2 - n ^ 2)) ∧
(z = k * (m ^ 2 + n ^ 2) ∨ z = -k * (m ^ 2 + n ^ 2))
Sources
Uses 8
TheoremSchroeder-Bernstein Theorem#
The Schröder-Bernstein Theorem:
Given injections α → β and β → α, we can get a bijection α → β.
Function.Embedding.schroeder_bernstein.{u, v} {α : Type u} {β : Type v} {f : α → β} {g : β → α}
(hf : Function.Injective f) (hg : Function.Injective g) : ∃ h, Function.Bijective h
Sources
- Mathlib documentation:
Function.Embedding.schroeder_bernstein - Source of
Function.Embedding.schroeder_bernsteinin Mathlib/SetTheory/Cardinal/SchroederBernstein.lean - Freek Wiedijk's 100 theorems, no. 25
- 1000+ theorems list: Q1033910
- 1000+ theorems project: Q1033910
- Wikipedia: Cantor–Bernstein–Schroeder theorem
- Wikidata: Q1033910
Uses 1
TheoremLeibniz’s Series for Pi#
Leibniz's series for π. The alternating sum of odd number reciprocals is π / 4,
proved by using Abel's limit theorem to extend the Maclaurin series of arctan to 1.
Real.tendsto_sum_pi_div_four :
Filter.Tendsto (fun k => ∑ i ∈ Finset.range k, (-1) ^ i / (2 * ↑i + 1)) Filter.atTop
(nhds (Real.pi / 4))
Sources
Uses 5
TheoremSum of the Angles of a Triangle#
The sum of the angles of a triangle (possibly degenerate, where two given vertices are distinct), angle-at-point.
EuclideanGeometry.angle_add_angle_add_angle_eq_pi.{u_1, u_2} {V : Type u_1} {P : Type u_2}
[NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {p₁ p₂ : P}
(p₃ : P) (h : p₂ ≠ p₁) :
EuclideanGeometry.angle p₁ p₂ p₃ + EuclideanGeometry.angle p₂ p₃ p₁ +
EuclideanGeometry.angle p₃ p₁ p₂ =
Real.pi
Sources
Uses 5 · Used by 1
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.