ruc-ai4math/mathlib_handler_benchmark_410 huggingface dataset:
-- Mathlib/Geometry/Euclidean/Angle/Unoriented/Affine.lean
V : Type u_1
P : Type u_2
inst✝³ : NormedAddCommGroup V
inst✝² : InnerProductSpace ℝ V
inst✝¹ : MetricSpace P
inst✝ : NormedAddTorsor V P
p p₀ p₁ p₂ p1 p2 p3 : P
h : ∠ p1 p2 p3 = 0
\u22a2 P
-- Mathlib/FieldTheory/Adjoin.lean
F : Type u_1
inst✝² : Field F
E : Type u_2
inst✝¹ : Field E
inst✝ : Algebra F E
S : Set E
α : E
p : F[X]
\u22a2 IsSplittingField F E p ↔ Splits (algebraMap F E) p ∧ adjoin F (p.rootSet E) = ⊤
-- Mathlib/FieldTheory/Adjoin.lean
F : Type u_1
inst✝² : Field F
E : Type u_2
inst✝¹ : Field E
inst✝ : Algebra F E
S : Set E
α : E
p : F[X]
\u22a2 IsSplittingField F E p ↔ Splits (algebraMap F E) p ∧ Algebra.adjoin F (p.rootSet E) = ⊤.toSubalgebra
-- Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean
x y : ℝ≥0∞
hx : x ≠ 0
hy : y ≠ 0
z : ℝ
\u22a2 (x * y) ^ z = x ^ z * y ^ z
-- Mathlib/Data/Multiset/Functor.lean
F : Type u → Type u
inst✝⁵ : Applicative F
inst✝⁴ : CommApplicative F
α' β' : Type u
f✝ : α' → F β'
G H : Type u_1 → Type u_1
inst✝³ : Applicative G
inst✝² : Applicative H
inst✝¹ : CommApplicative G
inst✝ : CommApplicative H
eta : ApplicativeTransformation G H
α β : Type u_1
f : α → G β
x : Multiset α
\u22a2 (fun {α} => eta.app α) (traverse f x) = traverse ((fun {α} => eta.app α) ∘ f) x
-- Mathlib/Data/Multiset/Functor.lean
F : Type u → Type u
inst✝⁵ : Applicative F
inst✝⁴ : CommApplicative F
α' β' : Type u
f✝ : α' → F β'
G H : Type u_1 → Type u_1
inst✝³ : Applicative G
inst✝² : Applicative H
inst✝¹ : CommApplicative G
inst✝ : CommApplicative H
eta : ApplicativeTransformation G H
α β : Type u_1
f : α → G β
x : Multiset α
\u22a2 ∀ (a : List α), (fun {α} => eta.app α) (traverse f ⟦a⟧) = traverse ((fun {α} => eta.app α) ∘ f) ⟦a⟧
-- Mathlib/Data/Multiset/Functor.lean
F : Type u → Type u
inst✝⁵ : Applicative F
inst✝⁴ : CommApplicative F
α' β' : Type u
f✝ : α' → F β'
G H : Type u_1 → Type u_1
inst✝³ : Applicative G
inst✝² : Applicative H
inst✝¹ : CommApplicative G
inst✝ : CommApplicative H
eta : ApplicativeTransformation G H
α β : Type u_1
f : α → G β
x : Multiset α
a✝ : List α
\u22a2 (fun {α} => eta.app α) (traverse f ⟦a✝⟧) = traverse ((fun {α} => eta.app α) ∘ f) ⟦a✝⟧
-- Mathlib/CategoryTheory/Limits/Shapes/Pullback/HasPullback.lean
C : Type u
inst✝² : Category.{v, u} C
W X✝ Y✝ Z✝ X Y Z : C
f₁ f₂ : X ⟶ Z
g₁ g₂ : Y ⟶ Z
h₁ : f₁ = f₂
h₂ : g₁ = g₂
inst✝¹ : HasPullback f₁ g₁
inst✝ : HasPullback f₂ g₂
\u22a2 (congrHom h₁ h₂).inv = map f₂ g₂ f₁ g₁ (𝟙 X) (𝟙 Y) (𝟙 Z) ⋯ ⋯
-- Mathlib/Order/Filter/AtTopBot.lean
ι : Type u_1
ι' : Type u_2
α : Type u_3
β : Type u_4
γ : Type u_5
inst✝ : LinearOrderedRing α
\u22a2 ¬Tendsto (fun x => x ^ 0) atTop atBot
-- Mathlib/RingTheory/DedekindDomain/Factorization.lean
R : Type u_1
inst✝⁴ : CommRing R
K : Type u_2
inst✝³ : Field K
inst✝² : Algebra R K
inst✝¹ : IsFractionRing R K
inst✝ : IsDedekindDomain R
v : HeightOneSpectrum R
I : Ideal R
\u22a2 Associates.mk (∏ᶠ (v : HeightOneSpectrum R), v.maxPowDividing I) ≠ 0
-- Mathlib/RingTheory/DedekindDomain/Factorization.lean
R : Type u_1
inst✝⁴ : CommRing R
K : Type u_2
inst✝³ : Field K
inst✝² : Algebra R K
inst✝¹ : IsFractionRing R K
inst✝ : IsDedekindDomain R
v : HeightOneSpectrum R
I : Ideal R
\u22a2 (if h : (mulSupport fun v => v.maxPowDividing I).Finite then ∏ i ∈ h.toFinset, i.maxPowDividing I else 1) ≠ 0
-- Mathlib/MeasureTheory/MeasurableSpace/CountablyGenerated.lean
α : Type u_1
β : Type u_2
f : α → β
b : Set (Set β)
hbc : b.Countable
this : MeasurableSpace α := generateFrom (preimage f '' b)
\u22a2 CountablyGenerated α
-- Mathlib/Data/Nat/Prime/Basic.lean
n✝ n : ℕ
\u22a2 n = 1 ↔ ∀ (p : ℕ), Prime p → ¬p ∣ n
-- Mathlib/CategoryTheory/Shift/Basic.lean
C : Type u
A : Type u_1
inst✝² : Category.{v, u} C
inst✝¹ : AddMonoid A
inst✝ : HasShift C A
a₁ a₂ a₃ a₁₂ a₂₃ a₁₂₃ : A
h₁₂ : a₁ + a₂ = a₁₂
h₂₃ : a₂ + a₃ = a₂₃
h₁₂₃ : a₁ + a₂ + a₃ = a₁₂₃
X : C
\u22a2 (shiftFunctorAdd' C a₁₂ a₃ a₁₂₃ ⋯).hom.app X ≫ (shiftFunctor C a₃).map ((shiftFunctorAdd' C a₁ a₂ a₁₂ h₁₂).hom.app X) = (shiftFunctorAdd' C a₁ a₂₃ a₁₂₃ ⋯).hom.app X ≫ (shiftFunctorAdd' C a₂ a₃ a₂₃ h₂₃).hom.app ((shiftFunctor C a₁).obj X)
-- Mathlib/Data/Real/Irrational.lean
q : ℚ
x y : ℝ
h : Irrational x
\u22a2 Irrational (↑(-q) + (↑q + x))
-- Mathlib/NumberTheory/BernoulliPolynomials.lean
n : ℕ
\u22a2 bernoulli n = ∑ i ∈ range (n + 1), (monomial i) (_root_.bernoulli (n - i) * ↑(n.choose i))
-- Mathlib/NumberTheory/BernoulliPolynomials.lean
n : ℕ
\u22a2 ∑ i ∈ range (n + 1), (monomial (n - i)) (_root_.bernoulli i * ↑(n.choose i)) = ∑ j ∈ range (n + 1), (monomial (n - j)) (_root_.bernoulli (n - (n - j)) * ↑(n.choose (n - j)))
-- Mathlib/NumberTheory/BernoulliPolynomials.lean
n : ℕ
\u22a2 ∀ x ∈ range (n + 1), (monomial (n - x)) (_root_.bernoulli x * ↑(n.choose x)) = (monomial (n - x)) (_root_.bernoulli (n - (n - x)) * ↑(n.choose (n - x)))
-- Mathlib/NumberTheory/BernoulliPolynomials.lean
n x : ℕ
hx : x ∈ range (n + 1)
\u22a2 (monomial (n - x)) (_root_.bernoulli x * ↑(n.choose x)) = (monomial (n - x)) (_root_.bernoulli (n - (n - x)) * ↑(n.choose (n - x)))
-- Mathlib/NumberTheory/BernoulliPolynomials.lean
n x : ℕ
hx : x ≤ n
\u22a2 (monomial (n - x)) (_root_.bernoulli x * ↑(n.choose x)) = (monomial (n - x)) (_root_.bernoulli (n - (n - x)) * ↑(n.choose (n - x)))
-- Mathlib/MeasureTheory/Function/ConditionalExpectation/CondexpL2.lean
α : Type u_1
E : Type u_2
E' : Type u_3
F : Type u_4
G : Type u_5
G' : Type u_6
𝕜 : Type u_7
p : ℝ≥0∞
inst✝¹³ : RCLike 𝕜
inst✝¹² : NormedAddCommGroup E
inst✝¹¹ : InnerProductSpace 𝕜 E
inst✝¹⁰ : CompleteSpace E
inst✝⁹ : NormedAddCommGroup E'
inst✝⁸ : InnerProductSpace 𝕜 E'
inst✝⁷ : CompleteSpace E'
inst✝⁶ : NormedSpace ℝ E'
inst✝⁵ : NormedAddCommGroup F
inst✝⁴ : NormedSpace 𝕜 F
inst✝³ : NormedAddCommGroup G
inst✝² : NormedAddCommGroup G'
inst✝¹ : NormedSpace ℝ G'
inst✝ : CompleteSpace G'
m m0 : MeasurableSpace α
μ : Measure α
s t : Set α
hm : m ≤ m0
hs : MeasurableSet s
hμs : μ s ≠ ⊤
ht : MeasurableSet t
hμt : μ t ≠ ⊤
\u22a2 ∫⁻ (a : α) in t, ↑‖↑↑↑((condexpL2 ℝ ℝ hm) (indicatorConstLp 2 hs hμs 1)) a‖₊ ∂μ ≤ μ (s ∩ t)
-- Mathlib/MeasureTheory/Function/ConditionalExpectation/CondexpL2.lean
α : Type u_1
E : Type u_2
E' : Type u_3
F : Type u_4
G : Type u_5
G' : Type u_6
𝕜 : Type u_7
p : ℝ≥0∞
inst✝¹³ : RCLike 𝕜
inst✝¹² : NormedAddCommGroup E
inst✝¹¹ : InnerProductSpace 𝕜 E
inst✝¹⁰ : CompleteSpace E
inst✝⁹ : NormedAddCommGroup E'
inst✝⁸ : InnerProductSpace 𝕜 E'
inst✝⁷ : CompleteSpace E'
inst✝⁶ : NormedSpace ℝ E'
inst✝⁵ : NormedAddCommGroup F
inst✝⁴ : NormedSpace 𝕜 F
inst✝³ : NormedAddCommGroup G
inst✝² : NormedAddCommGroup G'
inst✝¹ : NormedSpace ℝ G'
inst✝ : CompleteSpace G'
m m0 : MeasurableSpace α
μ : Measure α
s t : Set α
hm : m ≤ m0
hs : MeasurableSet s
hμs : μ s ≠ ⊤
ht : MeasurableSet t
hμt : μ t ≠ ⊤
\u22a2 ∫⁻ (x : α) in t, ↑‖↑↑(indicatorConstLp 2 hs hμs 1) x‖₊ ∂μ = μ (s ∩ t)
-- Mathlib/MeasureTheory/Function/ConditionalExpectation/CondexpL2.lean
α : Type u_1
E : Type u_2
E' : Type u_3
F : Type u_4
G : Type u_5
G' : Type u_6
𝕜 : Type u_7
p : ℝ≥0∞
inst✝¹³ : RCLike 𝕜
inst✝¹² : NormedAddCommGroup E
inst✝¹¹ : InnerProductSpace 𝕜 E
inst✝¹⁰ : CompleteSpace E
inst✝⁹ : NormedAddCommGroup E'
inst✝⁸ : InnerProductSpace 𝕜 E'
inst✝⁷ : CompleteSpace E'
inst✝⁶ : NormedSpace ℝ E'
inst✝⁵ : NormedAddCommGroup F
inst✝⁴ : NormedSpace 𝕜 F
inst✝³ : NormedAddCommGroup G
inst✝² : NormedAddCommGroup G'
inst✝¹ : NormedSpace ℝ G'
inst✝ : CompleteSpace G'
m m0 : MeasurableSpace α
μ : Measure α
s t : Set α
hm : m ≤ m0
hs : MeasurableSet s
hμs : μ s ≠ ⊤
ht : MeasurableSet t
hμt : μ t ≠ ⊤
h_eq : ∫⁻ (x : α) in t, ↑‖↑↑(indicatorConstLp 2 hs hμs 1) x‖₊ ∂μ = ∫⁻ (x : α) in t, s.indicator (fun x => 1) x ∂μ
\u22a2 ∫⁻ (x : α) in t, ↑‖↑↑(indicatorConstLp 2 hs hμs 1) x‖₊ ∂μ = μ (s ∩ t)
-- Mathlib/MeasureTheory/Function/ConditionalExpectation/CondexpL2.lean
α : Type u_1
E : Type u_2
E' : Type u_3
F : Type u_4
G : Type u_5
G' : Type u_6
𝕜 : Type u_7
p : ℝ≥0∞
inst✝¹³ : RCLike 𝕜
inst✝¹² : NormedAddCommGroup E
inst✝¹¹ : InnerProductSpace 𝕜 E
inst✝¹⁰ : CompleteSpace E
inst✝⁹ : NormedAddCommGroup E'
inst✝⁸ : InnerProductSpace 𝕜 E'
inst✝⁷ : CompleteSpace E'
inst✝⁶ : NormedSpace ℝ E'
inst✝⁵ : NormedAddCommGroup F
inst✝⁴ : NormedSpace 𝕜 F
inst✝³ : NormedAddCommGroup G
inst✝² : NormedAddCommGroup G'
inst✝¹ : NormedSpace ℝ G'
inst✝ : CompleteSpace G'
m m0 : MeasurableSpace α
μ : Measure α
s t : Set α
hm : m ≤ m0
hs : MeasurableSet s
hμs : μ s ≠ ⊤
ht : MeasurableSet t
hμt : μ t ≠ ⊤
h_eq : ∫⁻ (x : α) in t, ↑‖↑↑(indicatorConstLp 2 hs hμs 1) x‖₊ ∂μ = ∫⁻ (x : α) in t, s.indicator (fun x => 1) x ∂μ
\u22a2 1 * (μ.restrict (s ∩ t)) Set.univ = μ (s ∩ t)
-- Mathlib/Topology/Connected/PathConnected.lean
X : Type u_1
Y : Type u_2
inst✝¹ : TopologicalSpace X
inst✝ : TopologicalSpace Y
x y z : X
ι : Type u_3
F : Set X
h : JoinedIn F x y
\u22a2 JoinedIn F y x
-- Mathlib/Topology/Connected/PathConnected.lean
X : Type u_1
Y : Type u_2
inst✝¹ : TopologicalSpace X
inst✝ : TopologicalSpace Y
x y z : X
ι : Type u_3
F : Set X
h : JoinedIn F x y
hx : x ∈ F
hy : y ∈ F
\u22a2 JoinedIn F y x
-- Mathlib/Topology/Connected/PathConnected.lean
X : Type u_1
Y : Type u_2
inst✝¹ : TopologicalSpace X
inst✝ : TopologicalSpace Y
x y z : X
ι : Type u_3
F : Set X
hx✝ : x ∈ F
hy✝ : y ∈ F
h : Joined ⟨x, ⋯⟩ ⟨y, ⋯⟩
hx : x ∈ F
hy : y ∈ F
\u22a2 Joined ⟨y, ⋯⟩ ⟨x, ⋯⟩
-- Mathlib/Analysis/CstarAlgebra/ContinuousFunctionalCalculus/Unique.lean
X : Type u_1
inst✝ : TopologicalSpace X
f g : C(X, ℝ)
x : X
\u22a2 ↑(((f * g).toNNReal + (-f).toNNReal * g.toNNReal + f.toNNReal * (-g).toNNReal) x) = ↑(((-(f * g)).toNNReal + f.toNNReal * g.toNNReal + (-f).toNNReal * (-g).toNNReal) x)
-- Mathlib/Analysis/CstarAlgebra/ContinuousFunctionalCalculus/Unique.lean
X : Type u_1
inst✝ : TopologicalSpace X
f g : C(X, ℝ)
x : X
\u22a2 max (f x * g x) 0 + (-(f x * max (g x) 0) + max (f x) 0 * max (g x) 0) + (-(max (f x) 0 * g x) + max (f x) 0 * max (g x) 0) = -(f x * g x) + max (f x * g x) 0 + max (f x) 0 * max (g x) 0 + (-(max (f x) 0 * g x) + f x * g x + (-(f x * max (g x) 0) + max (f x) 0 * max (g x) 0))
-- Mathlib/Algebra/Polynomial/Derivation.lean
R : Type u_1
A : Type u_2
M : Type u_3
inst✝⁶ : CommSemiring R
inst✝⁵ : CommSemiring A
inst✝⁴ : Algebra R A
inst✝³ : AddCommMonoid M
inst✝² : Module A M
inst✝¹ : Module R M
inst✝ : IsScalarTower R A M
d✝ : Derivation R A M
a : A
d : Derivation R A M
f : R[X]
\u22a2 (AEval.of R M a).symm ((d.compAEval a) f) = (aeval a) (derivative f) • d a
-- Mathlib/Algebra/Lie/Weights/Chain.lean
R : Type u_1
L : Type u_2
inst✝¹⁰ : CommRing R
inst✝⁹ : LieRing L
inst✝⁸ : LieAlgebra R L
M : Type u_3
inst✝⁷ : AddCommGroup M
inst✝⁶ : Module R M
inst✝⁵ : LieRingModule L M
inst✝⁴ : LieModule R L M
inst✝³ : LieAlgebra.IsNilpotent R L
inst✝² : NoZeroSMulDivisors ℤ R
inst✝¹ : NoZeroSMulDivisors R M
inst✝ : IsNoetherian R M
α : L → R
β : Weight R L M
hα : α ≠ 0
\u22a2 weightSpace M ((-↑(chainBotCoeff α β) - 1) • α + ⇑β) = ⊥
-- Mathlib/MeasureTheory/Measure/Lebesgue/EqHaar.lean
ι : Type u_1
inst✝¹ : Finite ι
f : (ι → ℝ) →ₗ[ℝ] ι → ℝ
hf : LinearMap.det f ≠ 0
μ : Measure (ι → ℝ)
inst✝ : μ.IsAddHaarMeasure
\u22a2 map (⇑f) μ = ENNReal.ofReal |(LinearMap.det f)⁻¹| • μ
-- Mathlib/MeasureTheory/Measure/Lebesgue/EqHaar.lean
ι : Type u_1
inst✝¹ : Finite ι
f : (ι → ℝ) →ₗ[ℝ] ι → ℝ
hf : LinearMap.det f ≠ 0
μ : Measure (ι → ℝ)
inst✝ : μ.IsAddHaarMeasure
val✝ : Fintype ι
\u22a2 map (⇑f) μ = ENNReal.ofReal |(LinearMap.det f)⁻¹| • μ
-- Mathlib/MeasureTheory/Measure/Lebesgue/EqHaar.lean
ι : Type u_1
inst✝¹ : Finite ι
f : (ι → ℝ) →ₗ[ℝ] ι → ℝ
hf : LinearMap.det f ≠ 0
μ : Measure (ι → ℝ)
inst✝ : μ.IsAddHaarMeasure
val✝ : Fintype ι
this : μ = μ ↑(piIcc01 ι) • addHaarMeasure (piIcc01 ι)
\u22a2 map (⇑f) μ = ENNReal.ofReal |(LinearMap.det f)⁻¹| • μ
-- Mathlib/RingTheory/MvPowerSeries/Trunc.lean
σ : Type u_1
R : Type u_2
inst✝ : CommSemiring R
n m : σ →₀ ℕ
φ : MvPowerSeries σ R
\u22a2 MvPolynomial.coeff m (truncFun n φ) = if m < n then (coeff R m) φ else 0
-- Mathlib/MeasureTheory/Integral/Periodic.lean
T : ℝ
hT : Fact (0 < T)
t : ℝ
f : AddCircle T → ℝ≥0∞
\u22a2 ∫⁻ (a : ℝ) in Ioc t (t + T), f ↑a = ∫⁻ (b : AddCircle T), f b
-- Mathlib/MeasureTheory/Integral/Periodic.lean
T : ℝ
hT : Fact (0 < T)
t : ℝ
f : AddCircle T → ℝ≥0∞
m : MeasurableSet (Ioc t (t + T))
\u22a2 ∫⁻ (a : ℝ) in Ioc t (t + T), f ↑a = ∫⁻ (b : AddCircle T), f b
-- Mathlib/MeasureTheory/Integral/Periodic.lean
T : ℝ
hT : Fact (0 < T)
t : ℝ
f : AddCircle T → ℝ≥0∞
m : MeasurableSet (Ioc t (t + T))
this : ∫⁻ (a : AddCircle T), f a ∂Measure.map (⇑(measurableEquivIoc T t).symm) volume = ∫⁻ (a : ↑(Ioc t (t + T))), f ((measurableEquivIoc T t).symm a)
\u22a2 ∫⁻ (a : ℝ) in Ioc t (t + T), f ↑a = ∫⁻ (b : AddCircle T), f b
-- Mathlib/MeasureTheory/Integral/Periodic.lean
T : ℝ
hT : Fact (0 < T)
t : ℝ
f : AddCircle T → ℝ≥0∞
m : MeasurableSet (Ioc t (t + T))
this : ∫⁻ (a : AddCircle T), f a ∂Measure.map (fun x => ↑↑x) volume = ∫⁻ (a : ↑(Ioc t (t + T))), f ↑↑a
\u22a2 ∫⁻ (a : ℝ) in Ioc t (t + T), f ↑a = ∫⁻ (b : AddCircle T), f b
-- Mathlib/MeasureTheory/Integral/Periodic.lean
T : ℝ
hT : Fact (0 < T)
t : ℝ
f : AddCircle T → ℝ≥0∞
m : MeasurableSet (Ioc t (t + T))
this : ∫⁻ (a : AddCircle T), f a ∂Measure.map (fun x => ↑↑x) volume = ∫⁻ (a : ↑(Ioc t (t + T))), f ↑↑a
\u22a2 ∫⁻ (a : ℝ) in Ioc t (t + T), f ↑a = ∫⁻ (b : AddCircle T), f b ∂Measure.map QuotientAddGroup.mk (volume.restrict (Ioc t (t + T)))
-- Mathlib/MeasureTheory/Integral/Periodic.lean
T : ℝ
hT : Fact (0 < T)
t : ℝ
f : AddCircle T → ℝ≥0∞
m : MeasurableSet (Ioc t (t + T))
this : ∫⁻ (a : AddCircle T), f a ∂Measure.map (fun x => ↑↑x) volume = ∫⁻ (a : ↑(Ioc t (t + T))), f ↑↑a
\u22a2 ∫⁻ (a : ℝ) in Ioc t (t + T), f ↑a = ∫⁻ (a : ↑(Ioc t (t + T))), f ↑↑a
-- Mathlib/MeasureTheory/Integral/Periodic.lean
T : ℝ
hT : Fact (0 < T)
t : ℝ
f : AddCircle T → ℝ≥0∞
m : MeasurableSet (Ioc t (t + T))
this : ∫⁻ (a : AddCircle T), f a ∂Measure.map (fun x => ↑↑x) volume = ∫⁻ (a : ↑(Ioc t (t + T))), f ↑↑a
\u22a2 ∫⁻ (b : AddCircle T), f b ∂Measure.map QuotientAddGroup.mk (volume.restrict (Ioc t (t + T))) = ∫⁻ (a : AddCircle T), f a ∂Measure.map (fun x => ↑↑x) volume
-- Mathlib/CategoryTheory/Monoidal/Braided/Basic.lean
C : Type u₁
inst✝² : Category.{v₁, u₁} C
inst✝¹ : MonoidalCategory C
inst✝ : BraidedCategory C
X : C
\u22a2 (β_ (𝟙_ C) X).hom = (λ_ X).hom ≫ (ρ_ X).inv
-- Mathlib/Data/Set/Card.lean
α : Type u_1
β : Type u_2
s t : Set α
hs : s.Finite
\u22a2 ↑s.ncard = s.encard
-- Mathlib/Combinatorics/SimpleGraph/Clique.lean
α : Type u_1
β : Type u_2
G H : SimpleGraph α
n : ℕ
s : Finset α
a b c : α
\u22a2 G.IsNClique 0 s ↔ s = ∅
-- Mathlib/Combinatorics/SimpleGraph/Clique.lean
α : Type u_1
β : Type u_2
G H : SimpleGraph α
n : ℕ
s : Finset α
a b c : α
\u22a2 s = ∅ → G.IsClique ↑s
-- Mathlib/Algebra/MvPolynomial/Basic.lean
R : Type u
S₁ : Type v
S₂ : Type w
S₃ : Type x
σ : Type u_1
a a' a₁ a₂ : R
e : ℕ
n m : σ
s : σ →₀ ℕ
inst✝¹ : CommSemiring R
inst✝ : CommSemiring S₁
p q : MvPolynomial σ R
\u22a2 AddMonoidAlgebra.single 0 a * AddMonoidAlgebra.single s a' = AddMonoidAlgebra.single s (a * a')
-- Mathlib/Algebra/Polynomial/Monic.lean
R : Type u
S : Type v
a b : R
m n : ℕ
ι : Type y
inst✝ : Ring R
p : R[X]
x : R
\u22a2 (X - C x).Monic
-- Mathlib/Control/Applicative.lean
F : Type u → Type w
G : Type v → Type u
inst✝³ : Applicative F
inst✝² : Applicative G
inst✝¹ : LawfulApplicative F
inst✝ : LawfulApplicative G
α β γ : Type v
f : α → β
x : Comp F G α
\u22a2 (Seq.seq (pure f) fun x_1 => x).run = (f <$> x).run
-- Mathlib/MeasureTheory/Function/SimpleFunc.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
inst✝¹ : MeasurableSpace α
K : Type u_5
inst✝ : Zero β
f : α →ₛ β
s : Set α
hs : MeasurableSet s
t : Set β
ht : 0 ∉ t
\u22a2 ↑(f.restrict s) ⁻¹' t = s ∩ ↑f ⁻¹' t
-- Mathlib/CategoryTheory/Sites/Subsheaf.lean
C : Type u
inst✝ : Category.{v, u} C
J : GrothendieckTopology C
F F' F'' : Cᵒᵖ ⥤ Type w
G G' : Subpresheaf F
U : Cᵒᵖ
s : F.obj U
V W : C
i : V ⟶ unop U
hi : (fun V f => F.map f.op s ∈ G.obj (op V)) V i
j : W ⟶ V
\u22a2 (fun V f => F.map f.op s ∈ G.obj (op V)) W (j ≫ i)
-- Mathlib/CategoryTheory/Sites/Subsheaf.lean
C : Type u
inst✝ : Category.{v, u} C
J : GrothendieckTopology C
F F' F'' : Cᵒᵖ ⥤ Type w
G G' : Subpresheaf F
U : Cᵒᵖ
s : F.obj U
V W : C
i : V ⟶ unop U
hi : (fun V f => F.map f.op s ∈ G.obj (op V)) V i
j : W ⟶ V
\u22a2 F.map j.op (F.map i.op s) ∈ G.obj (op W)
-- Mathlib/Probability/Density.lean
Ω : Type u_1
E : Type u_2
inst✝¹ : MeasurableSpace E
m : MeasurableSpace Ω
ℙ : Measure Ω
μ : Measure E
X : Ω → E
inst✝ : HasPDF X ℙ μ
f : E → ℝ≥0∞
hf : AEMeasurable f μ
\u22a2 ∫⁻ (x : E), pdf X ℙ μ x * f x ∂μ = ∫⁻ (x : Ω), f (X x) ∂ℙ
-- Mathlib/Topology/Connected/Basic.lean
α : Type u
β : Type v
ι : Type u_1
π : ι → Type u_2
inst✝ : TopologicalSpace α
s✝ t u✝ v✝ s : Set α
x : α
H : ∀ y ∈ s, ∃ t ⊆ s, x ∈ t ∧ y ∈ t ∧ IsPreconnected t
u v : Set α
hu : IsOpen u
hv : IsOpen v
hs : s ⊆ u ∪ v
z : α
zs : z ∈ s
zu : z ∈ u
y : α
ys : y ∈ s
yv : y ∈ v
xs : x ∈ s
\u22a2 (s ∩ (u ∩ v)).Nonempty
-- Mathlib/Algebra/Group/Units.lean
α : Type u
M : Type u_1
N : Type u_2
inst✝ : Monoid M
a✝ b c a : M
h : IsUnit a
y : M
\u22a2 (fun x => x * a) (y * ↑h.unit⁻¹) = y
-- Mathlib/Geometry/Euclidean/Circumcenter.lean
V : Type u_1
P : Type u_2
inst✝³ : NormedAddCommGroup V
inst✝² : InnerProductSpace ℝ V
inst✝¹ : MetricSpace P
inst✝ : NormedAddTorsor V P
n : ℕ
s : Simplex ℝ P n
i₁ i₂ : Fin (n + 1)
h : i₁ ≠ i₂
hc : {i₁, i₂}.card = 2
W : AffineSubspace ℝ P := affineSpan ℝ (s.points '' {i₁, i₂})
\u22a2 (EuclideanGeometry.reflection (affineSpan ℝ (s.points '' {i₁, i₂}))) s.circumcenter = (affineCombination ℝ univ s.pointsWithCircumcenter) (reflectionCircumcenterWeightsWithCircumcenter i₁ i₂)
-- Mathlib/Geometry/Euclidean/Circumcenter.lean
V : Type u_1
P : Type u_2
inst✝³ : NormedAddCommGroup V
inst✝² : InnerProductSpace ℝ V
inst✝¹ : MetricSpace P
inst✝ : NormedAddTorsor V P
n : ℕ
s : Simplex ℝ P n
i₁ i₂ : Fin (n + 1)
h : i₁ ≠ i₂
hc : {i₁, i₂}.card = 2
W : AffineSubspace ℝ P := affineSpan ℝ (s.points '' {i₁, i₂})
h_faces : ↑((EuclideanGeometry.orthogonalProjection W) s.circumcenter) = ↑((s.face hc).orthogonalProjectionSpan s.circumcenter)
\u22a2 (EuclideanGeometry.reflection (affineSpan ℝ (s.points '' {i₁, i₂}))) s.circumcenter = (affineCombination ℝ univ s.pointsWithCircumcenter) (reflectionCircumcenterWeightsWithCircumcenter i₁ i₂)
-- Mathlib/Geometry/Euclidean/Circumcenter.lean
V : Type u_1
P : Type u_2
inst✝³ : NormedAddCommGroup V
inst✝² : InnerProductSpace ℝ V
inst✝¹ : MetricSpace P
inst✝ : NormedAddTorsor V P
n : ℕ
s : Simplex ℝ P n
i₁ i₂ : Fin (n + 1)
h : i₁ ≠ i₂
hc : {i₁, i₂}.card = 2
W : AffineSubspace ℝ P := affineSpan ℝ (s.points '' {i₁, i₂})
h_faces : ↑((EuclideanGeometry.orthogonalProjection W) s.circumcenter) = ↑((s.face hc).orthogonalProjectionSpan s.circumcenter)
\u22a2 ∑ i : Fin (n + 1), (centroidWeightsWithCircumcenter {i₁, i₂} - circumcenterWeightsWithCircumcenter n + centroidWeightsWithCircumcenter {i₁, i₂} - reflectionCircumcenterWeightsWithCircumcenter i₁ i₂) (pointIndex i) • (s.pointsWithCircumcenter (pointIndex i) -ᵥ Classical.choice ⋯) + (centroidWeightsWithCircumcenter {i₁, i₂} - circumcenterWeightsWithCircumcenter n + centroidWeightsWithCircumcenter {i₁, i₂} - reflectionCircumcenterWeightsWithCircumcenter i₁ i₂) circumcenterIndex • (s.pointsWithCircumcenter circumcenterIndex -ᵥ Classical.choice ⋯) = 0
-- Mathlib/Geometry/Euclidean/Circumcenter.lean
V : Type u_1
P : Type u_2
inst✝³ : NormedAddCommGroup V
inst✝² : InnerProductSpace ℝ V
inst✝¹ : MetricSpace P
inst✝ : NormedAddTorsor V P
n : ℕ
s : Simplex ℝ P n
i₁ i₂ : Fin (n + 1)
h : i₁ ≠ i₂
hc : {i₁, i₂}.card = 2
W : AffineSubspace ℝ P := affineSpan ℝ (s.points '' {i₁, i₂})
h_faces : ↑((EuclideanGeometry.orthogonalProjection W) s.circumcenter) = ↑((s.face hc).orthogonalProjectionSpan s.circumcenter)
\u22a2 ∑ x : Fin (n + 1), ((if x ∈ {i₁, i₂} then ((↑2)⁻¹ + (↑2)⁻¹) • (s.pointsWithCircumcenter (pointIndex x) -ᵥ Classical.choice ⋯) else 0) - if x = i₁ ∨ x = i₂ then 1 • (s.pointsWithCircumcenter (pointIndex x) -ᵥ Classical.choice ⋯) else 0) = 0
-- Mathlib/Geometry/Euclidean/Circumcenter.lean
V : Type u_1
P : Type u_2
inst✝³ : NormedAddCommGroup V
inst✝² : InnerProductSpace ℝ V
inst✝¹ : MetricSpace P
inst✝ : NormedAddTorsor V P
n : ℕ
s : Simplex ℝ P n
i₁ i₂ : Fin (n + 1)
h : i₁ ≠ i₂
hc : {i₁, i₂}.card = 2
W : AffineSubspace ℝ P := affineSpan ℝ (s.points '' {i₁, i₂})
h_faces : ↑((EuclideanGeometry.orthogonalProjection W) s.circumcenter) = ↑((s.face hc).orthogonalProjectionSpan s.circumcenter)
\u22a2 ∑ x : Fin (n + 1), ((if x ∈ {i₁, i₂} then ((↑2)⁻¹ + (↑2)⁻¹) • (s.pointsWithCircumcenter (pointIndex x) -ᵥ Classical.choice ⋯) else ∑ _x ∈ ?m.329271, 0) - if x = i₁ ∨ x = i₂ then 1 • (s.pointsWithCircumcenter (pointIndex x) -ᵥ Classical.choice ⋯) else ∑ _x ∈ ?m.329271, 0) = ∑ _x ∈ ?m.329271, 0
-- Mathlib/Geometry/Euclidean/Circumcenter.lean
V : Type u_1
P : Type u_2
inst✝³ : NormedAddCommGroup V
inst✝² : InnerProductSpace ℝ V
inst✝¹ : MetricSpace P
inst✝ : NormedAddTorsor V P
n : ℕ
s : Simplex ℝ P n
i₁ i₂ : Fin (n + 1)
h : i₁ ≠ i₂
hc : {i₁, i₂}.card = 2
W : AffineSubspace ℝ P := affineSpan ℝ (s.points '' {i₁, i₂})
h_faces : ↑((EuclideanGeometry.orthogonalProjection W) s.circumcenter) = ↑((s.face hc).orthogonalProjectionSpan s.circumcenter)
\u22a2 Type ?u.329268
-- Mathlib/Geometry/Euclidean/Circumcenter.lean
V : Type u_1
P : Type u_2
inst✝³ : NormedAddCommGroup V
inst✝² : InnerProductSpace ℝ V
inst✝¹ : MetricSpace P
inst✝ : NormedAddTorsor V P
n : ℕ
s : Simplex ℝ P n
i₁ i₂ : Fin (n + 1)
h : i₁ ≠ i₂
hc : {i₁, i₂}.card = 2
W : AffineSubspace ℝ P := affineSpan ℝ (s.points '' {i₁, i₂})
h_faces : ↑((EuclideanGeometry.orthogonalProjection W) s.circumcenter) = ↑((s.face hc).orthogonalProjectionSpan s.circumcenter)
\u22a2 Finset ?m.329269
-- Mathlib/AlgebraicGeometry/StructureSheaf.lean
R : Type u
inst✝² : CommRing R
S : Type u
inst✝¹ : CommRing S
P : Type u
inst✝ : CommRing P
f : R →+* S
U : Opens ↑(PrimeSpectrum.Top R)
V : Opens ↑(PrimeSpectrum.Top S)
hUV : V.carrier ⊆ ⇑(PrimeSpectrum.comap f) ⁻¹' U.carrier
a b : R
hb : ∀ x ∈ U, b ∈ x.asIdeal.primeCompl
p : ↥(unop (op V))
\u22a2 ↑((comap f U V hUV) (const R a b U hb)) p = ↑(const S (f a) (f b) V ⋯) p
-- Mathlib/AlgebraicGeometry/StructureSheaf.lean
R : Type u
inst✝² : CommRing R
S : Type u
inst✝¹ : CommRing S
P : Type u
inst✝ : CommRing P
f : R →+* S
U : Opens ↑(PrimeSpectrum.Top R)
V : Opens ↑(PrimeSpectrum.Top S)
hUV : V.carrier ⊆ ⇑(PrimeSpectrum.comap f) ⁻¹' U.carrier
a b : R
hb : ∀ x ∈ U, b ∈ x.asIdeal.primeCompl
p : ↥(unop (op V))
\u22a2 (Localization.localRingHom ((PrimeSpectrum.comap f) ↑p).asIdeal (↑p).asIdeal f ⋯) (IsLocalization.mk' (Localizations R ↑⟨(PrimeSpectrum.comap f) ↑p, ⋯⟩) a ⟨b, ⋯⟩) = IsLocalization.mk' (Localizations S ↑p) (f a) ⟨f b, ⋯⟩
-- Mathlib/AlgebraicGeometry/StructureSheaf.lean
R : Type u
inst✝² : CommRing R
S : Type u
inst✝¹ : CommRing S
P : Type u
inst✝ : CommRing P
f : R →+* S
U : Opens ↑(PrimeSpectrum.Top R)
V : Opens ↑(PrimeSpectrum.Top S)
hUV : V.carrier ⊆ ⇑(PrimeSpectrum.comap f) ⁻¹' U.carrier
a b : R
hb : ∀ x ∈ U, b ∈ x.asIdeal.primeCompl
p : ↥(unop (op V))
\u22a2 IsLocalization.mk' (Localization.AtPrime (↑p).asIdeal) (f a) ⟨f ↑⟨b, ⋯⟩, ⋯⟩ = IsLocalization.mk' (Localizations S ↑p) (f a) ⟨f b, ⋯⟩
-- Mathlib/Algebra/GradedMonoid.lean
ι : Type u_1
R : Type u_2
S : Type u_3
inst✝³ : SetLike S R
inst✝² : Monoid R
inst✝¹ : AddMonoid ι
A : ι → S
inst✝ : GradedMonoid A
n : ℕ
i : Fin n → ι
r : Fin n → R
h : ∀ (j : Fin n), r j ∈ A (i j)
\u22a2 (List.ofFn r).prod ∈ A (List.ofFn i).sum
-- Mathlib/Algebra/GradedMonoid.lean
ι : Type u_1
R : Type u_2
S : Type u_3
inst✝³ : SetLike S R
inst✝² : Monoid R
inst✝¹ : AddMonoid ι
A : ι → S
inst✝ : GradedMonoid A
n : ℕ
i : Fin n → ι
r : Fin n → R
h : ∀ (j : Fin n), r j ∈ A (i j)
\u22a2 (List.map r (List.finRange n)).prod ∈ A (List.map i (List.finRange n)).sum
-- Mathlib/Analysis/Analytic/Uniqueness.lean
𝕜 : Type u_1
inst✝⁴ : NontriviallyNormedField 𝕜
E : Type u_2
inst✝³ : NormedAddCommGroup E
inst✝² : NormedSpace 𝕜 E
F : Type u_3
inst✝¹ : NormedAddCommGroup F
inst✝ : NormedSpace 𝕜 F
f : E → F
U : Set E
hf : AnalyticOn 𝕜 f U
hU : IsPreconnected U
z₀ : E
h₀ : z₀ ∈ U
hfz₀ : f =ᶠ[𝓝 z₀] 0
F' : Type u_3 := UniformSpace.Completion F
e : F →L[𝕜] F' := UniformSpace.Completion.toComplL
\u22a2 EqOn f 0 U