{"task": "t8", "statement": "theorem size_insert (self : BinaryHeap α lt) (x : α) : (self.insert x).size = self.size + 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem size_pos_of_max {self : BinaryHeap α lt} (e : self.max = some x) : 0 < self.size :=", "area": "Data"} {"task": "t8", "statement": "theorem Heap.noSibling_merge (le) (s₁ s₂ : Heap α) : (s₁.merge le s₂).NoSibling :=", "area": "Data"} {"task": "t8", "statement": "theorem Heap.noSibling_combine (le) (s : Heap α) : (s.combine le).NoSibling :=", "area": "Data"} {"task": "t8", "statement": "theorem Heap.noSibling_deleteMin {s : Heap α} (eq : s.deleteMin le = some (a, s')) : s'.NoSibling :=", "area": "Data"} {"task": "t8", "statement": "theorem Heap.noSibling_tail? {s : Heap α} : s.tail? le = some s' → s'.NoSibling :=", "area": "Data"} {"task": "t8", "statement": "theorem Heap.noSibling_tail (le) (s : Heap α) : (s.tail le).NoSibling :=", "area": "Data"} {"task": "t8", "statement": "theorem Heap.size_merge_node (le) (a₁ : α) (c₁ s₁ : Heap α) (a₂ : α) (c₂ s₂ : Heap α) : (merge le (.node a₁ c₁ s₁) (.node a₂ c₂ s₂)).size = c₁.size + c₂.size + 2 :=", "area": "Data"} {"task": "t8", "statement": "theorem Heap.size_merge (le) {s₁ s₂ : Heap α} (h₁ : s₁.NoSibling) (h₂ : s₂.NoSibling) : (merge le s₁ s₂).size = s₁.size + s₂.size :=", "area": "Data"} {"task": "t8", "statement": "theorem Heap.size_combine (le) (s : Heap α) : (s.combine le).size = s.size :=", "area": "Data"} {"task": "t8", "statement": "theorem Heap.size_deleteMin {s : Heap α} (h : s.NoSibling) (eq : s.deleteMin le = some (a, s')) : s.size = s'.size + 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem Heap.size_tail? {s : Heap α} (h : s.NoSibling) : s.tail? le = some s' → s.size = s'.size + 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem Heap.size_tail (le) {s : Heap α} (h : s.NoSibling) : (s.tail le).size = s.size - 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem Heap.size_deleteMin_lt {s : Heap α} (eq : s.deleteMin le = some (a, s')) : s'.size < s.size :=", "area": "Data"} {"task": "t8", "statement": "theorem Heap.size_tail?_lt {s : Heap α} : s.tail? le = some s' → s'.size < s.size :=", "area": "Data"} {"task": "t8", "statement": "theorem Heap.WF.merge_node (h₁ : NodeWF le a₁ c₁) (h₂ : NodeWF le a₂ c₂) : (merge le (.node a₁ c₁ s₁) (.node a₂ c₂ s₂)).WF le :=", "area": "Data"} {"task": "t8", "statement": "theorem Heap.WF.deleteMin {s : Heap α} (h : s.WF le) (eq : s.deleteMin le = some (a, s')) : s'.WF le :=", "area": "Data"} {"task": "t8", "statement": "theorem Heap.WF.tail? (hwf : (s : Heap α).WF le) : s.tail? le = some tl → tl.WF le :=", "area": "Data"} {"task": "t8", "statement": "theorem Heap.WF.tail (hwf : (s : Heap α).WF le) : (s.tail le).WF le :=", "area": "Data"} {"task": "t8", "statement": "theorem beq_iff_eq {m n : Name} : m == n ↔ m = n :=", "area": "lean"} {"task": "t8", "statement": "theorem ofNat_pow (a b : Nat) : ((a ^ b : Nat) : Int) = (a : Int) ^ b :=", "area": "lean"} {"task": "t8", "statement": "theorem pos_pow_of_pos (a : Int) (b : Nat) (h : 0 < a) : 0 < a ^ b :=", "area": "lean"} {"task": "t8", "statement": "theorem ofNat_pos {a : Nat} : 0 < (a : Int) ↔ 0 < a :=", "area": "lean"} {"task": "t8", "statement": "theorem ofNat_shiftLeft_eq {x y : Nat} : (x <<< y : Int) = (x : Int) * (2 ^ y : Nat) :=", "area": "lean"} {"task": "t8", "statement": "theorem ofNat_shiftRight_eq_div_pow {x y : Nat} : (x >>> y : Int) = (x : Int) / (2 ^ y : Nat) :=", "area": "lean"} {"task": "t8", "statement": "theorem add_congr {a b c d : Int} (h₁ : a = b) (h₂ : c = d) : a + c = b + d :=", "area": "lean"} {"task": "t8", "statement": "theorem mul_congr {a b c d : Int} (h₁ : a = b) (h₂ : c = d) : a * c = b * d :=", "area": "lean"} {"task": "t8", "statement": "theorem mul_congr_left {a b : Int} (h₁ : a = b) (c : Int) : a * c = b * c :=", "area": "lean"} {"task": "t8", "statement": "theorem sub_congr {a b c d : Int} (h₁ : a = b) (h₂ : c = d) : a - c = b - d :=", "area": "lean"} {"task": "t8", "statement": "theorem neg_congr {a b : Int} (h₁ : a = b) : -a = -b :=", "area": "lean"} {"task": "t8", "statement": "theorem ofNat_sub_dichotomy {a b : Nat} : b ≤ a ∧ ((a - b : Nat) : Int) = a - b ∨ a < b ∧ ((a - b : Nat) : Int) = 0 :=", "area": "lean"} {"task": "t8", "statement": "theorem ofNat_min (a b : Nat) : ((min a b : Nat) : Int) = min (a : Int) (b : Int) :=", "area": "lean"} {"task": "t8", "statement": "theorem ofNat_max (a b : Nat) : ((max a b : Nat) : Int) = max (a : Int) (b : Int) :=", "area": "lean"} {"task": "t8", "statement": "theorem ofNat_natAbs (a : Int) : (a.natAbs : Int) = if 0 ≤ a then a else -a :=", "area": "lean"} {"task": "t8", "statement": "theorem natAbs_dichotomy {a : Int} : 0 ≤ a ∧ a.natAbs = a ∨ a < 0 ∧ a.natAbs = -a :=", "area": "lean"} {"task": "t8", "statement": "theorem neg_le_natAbs {a : Int} : -a ≤ a.natAbs :=", "area": "lean"} {"task": "t8", "statement": "theorem add_le_iff_le_sub (a b c : Int) : a + b ≤ c ↔ a ≤ c - b :=", "area": "lean"} {"task": "t8", "statement": "theorem le_add_iff_sub_le (a b c : Int) : a ≤ b + c ↔ a - c ≤ b :=", "area": "lean"} {"task": "t8", "statement": "theorem add_le_zero_iff_le_neg (a b : Int) : a + b ≤ 0 ↔ a ≤ - b :=", "area": "lean"} {"task": "t8", "statement": "theorem add_le_zero_iff_le_neg' (a b : Int) : a + b ≤ 0 ↔ b ≤ -a :=", "area": "lean"} {"task": "t8", "statement": "theorem add_nonnneg_iff_neg_le (a b : Int) : 0 ≤ a + b ↔ -b ≤ a :=", "area": "lean"} {"task": "t8", "statement": "theorem add_nonnneg_iff_neg_le' (a b : Int) : 0 ≤ a + b ↔ -a ≤ b :=", "area": "lean"} {"task": "t8", "statement": "theorem ne_iff_lt_or_gt {i j : Fin n} : i ≠ j ↔ i < j ∨ i > j :=", "area": "lean"} {"task": "t8", "statement": "theorem not_le {i j : Fin n} : ¬ i ≤ j ↔ j < i :=", "area": "lean"} {"task": "t8", "statement": "theorem not_lt {i j : Fin n} : ¬ i < j ↔ j ≤ i :=", "area": "lean"} {"task": "t8", "statement": "theorem ofNat_val_natCast {n x y : Nat} (h : y = x % (n + 1)): @Nat.cast Int instNatCastInt (@Fin.val (n + 1) (OfNat.ofNat x)) = OfNat.ofNat y :=", "area": "lean"} {"task": "t8", "statement": "theorem of_not_lex {α} {r : α → α → Prop} [DecidableEq α] {β} {s : β → β → Prop} {p q : α × β} (w : ¬ Prod.Lex r s p q) : ¬ r p.fst q.fst ∧ (p.fst ≠ q.fst ∨ ¬ s p.snd q.snd) :=", "area": "lean"} {"task": "t8", "statement": "theorem isValidUInt32 (n : Nat) (h : isValidCharNat n) : n < UInt32.size :=", "area": "lean"} {"task": "t8", "statement": "theorem isValidChar_zero : isValidChar 0 :=", "area": "lean"} {"task": "t8", "statement": "theorem size_toArray (as : List α) : as.toArray.size = as.length :=", "area": "lean"} {"task": "t8", "statement": "theorem size_mk (as : List α) : (Array.mk as).size = as.length :=", "area": "lean"} {"task": "t8", "statement": "theorem getElem_eq_data_getElem (a : Array α) (h : i < a.size) : a[i] = a.data[i] :=", "area": "lean"} {"task": "t8", "statement": "theorem getElem_eq_data_get (a : Array α) (h : i < a.size) : a[i] = a.data.get ⟨i, h⟩ :=", "area": "lean"} {"task": "t8", "statement": "theorem foldlM_eq_foldlM_data.aux [Monad m] (f : β → α → m β) (arr : Array α) (i j) (H : arr.size ≤ i + j) (b) : foldlM.loop f arr arr.size (Nat.le_refl _) i j b = (arr.data.drop j).foldlM f b :=", "area": "lean"} {"task": "t8", "statement": "theorem foldlM_eq_foldlM_data [Monad m] (f : β → α → m β) (init : β) (arr : Array α) : arr.foldlM f init = arr.data.foldlM f init :=", "area": "lean"} {"task": "t8", "statement": "theorem foldrM_eq_reverse_foldlM_data.aux [Monad m] (f : α → β → m β) (arr : Array α) (init : β) (i h) : (arr.data.take i).reverse.foldlM (fun x y => f y x) init = foldrM.fold f arr 0 i h init :=", "area": "lean"} {"task": "t8", "statement": "theorem foldrM_eq_reverse_foldlM_data [Monad m] (f : α → β → m β) (init : β) (arr : Array α) : arr.foldrM f init = arr.data.reverse.foldlM (fun x y => f y x) init :=", "area": "lean"} {"task": "t8", "statement": "theorem foldrM_eq_foldrM_data [Monad m] (f : α → β → m β) (init : β) (arr : Array α) : arr.foldrM f init = arr.data.foldrM f init :=", "area": "lean"} {"task": "t8", "statement": "theorem push_data (arr : Array α) (a : α) : (arr.push a).data = arr.data ++ [a] :=", "area": "lean"} {"task": "t8", "statement": "theorem foldrM_push [Monad m] (f : α → β → m β) (init : β) (arr : Array α) (a : α) : (arr.push a).foldrM f init = f a init >>= arr.foldrM f :=", "area": "lean"} {"task": "t8", "statement": "theorem foldrM_push' [Monad m] (f : α → β → m β) (init : β) (arr : Array α) (a : α) : (arr.push a).foldrM f init (start := arr.size + 1) = f a init >>= arr.foldrM f :=", "area": "lean"} {"task": "t8", "statement": "theorem toListAppend_eq (arr : Array α) (l) : arr.toListAppend l = arr.data ++ l :=", "area": "lean"} {"task": "t8", "statement": "theorem toList_eq (arr : Array α) : arr.toList = arr.data :=", "area": "lean"} {"task": "t8", "statement": "theorem toListRev_eq (arr : Array α) : arr.toListRev = arr.data.reverse :=", "area": "lean"} {"task": "t8", "statement": "theorem get_push_lt (a : Array α) (x : α) (i : Nat) (h : i < a.size) : have : i < (a.push x).size := by simp [*, Nat.lt_succ_of_le, Nat.le_of_lt] (a.push x)[i] = a[i] :=", "area": "lean"} {"task": "t8", "statement": "theorem get_push_eq (a : Array α) (x : α) : (a.push x)[a.size] = x :=", "area": "lean"} {"task": "t8", "statement": "theorem get_push (a : Array α) (x : α) (i : Nat) (h : i < (a.push x).size) : (a.push x)[i] = if h : i < a.size then a[i] else x :=", "area": "lean"} {"task": "t8", "statement": "theorem mapM_eq_foldlM [Monad m] [LawfulMonad m] (f : α → m β) (arr : Array α) : arr.mapM f = arr.foldlM (fun bs a => bs.push <$> f a) #[] :=", "area": "lean"} {"task": "t8", "statement": "theorem map_data (f : α → β) (arr : Array α) : (arr.map f).data = arr.data.map f :=", "area": "lean"} {"task": "t8", "statement": "theorem size_map (f : α → β) (arr : Array α) : (arr.map f).size = arr.size :=", "area": "lean"} {"task": "t8", "statement": "theorem append_data (arr arr' : Array α) : (arr ++ arr').data = arr.data ++ arr'.data :=", "area": "lean"} {"task": "t8", "statement": "theorem appendList_data (arr : Array α) (l : List α) : (arr ++ l).data = arr.data ++ l :=", "area": "lean"} {"task": "t8", "statement": "theorem appendList_nil (arr : Array α) : arr ++ ([] : List α) = arr :=", "area": "lean"} {"task": "t8", "statement": "theorem appendList_cons (arr : Array α) (a : α) (l : List α) : arr ++ (a :: l) = arr.push a ++ l :=", "area": "lean"} {"task": "t8", "statement": "theorem foldl_data_eq_bind (l : List α) (acc : Array β) (F : Array β → α → Array β) (G : α → List β) (H : ∀ acc a, (F acc a).data = acc.data ++ G a) : (l.foldl F acc).data = acc.data ++ l.bind G :=", "area": "lean"} {"task": "t8", "statement": "theorem foldl_data_eq_map (l : List α) (acc : Array β) (G : α → β) : (l.foldl (fun acc a => acc.push (G a)) acc).data = acc.data ++ l.map G :=", "area": "lean"} {"task": "t8", "statement": "theorem size_uset (a : Array α) (v i h) : (uset a i v h).size = a.size :=", "area": "lean"} {"task": "t8", "statement": "theorem anyM_eq_anyM_loop [Monad m] (p : α → m Bool) (as : Array α) (start stop) : anyM p as start stop = anyM.loop p as (min stop as.size) (Nat.min_le_right ..) start :=", "area": "lean"} {"task": "t8", "statement": "theorem anyM_stop_le_start [Monad m] (p : α → m Bool) (as : Array α) (start stop) (h : min stop as.size ≤ start) : anyM p as start stop = pure false :=", "area": "lean"} {"task": "t8", "statement": "theorem getElem?_len_le (a : Array α) {i : Nat} (h : a.size ≤ i) : a[i]? = none :=", "area": "lean"} {"task": "t8", "statement": "theorem getD_get? (a : Array α) (i : Nat) (d : α) : Option.getD a[i]? d = if p : i < a.size then a[i]'p else d :=", "area": "lean"} {"task": "t8", "statement": "theorem getD_eq_get? (a : Array α) (n d) : a.getD n d = (a[n]?).getD d :=", "area": "lean"} {"task": "t8", "statement": "theorem get!_eq_getElem? [Inhabited α] (a : Array α) (i : Nat) : a.get! i = (a.get? i).getD default :=", "area": "lean"} {"task": "t8", "statement": "theorem getElem_set_eq (a : Array α) (i : Fin a.size) (v : α) {j : Nat} (eq : i.val = j) (p : j < (a.set i v).size) : (a.set i v)[j]'p = v :=", "area": "lean"} {"task": "t8", "statement": "theorem getElem_set_ne (a : Array α) (i : Fin a.size) (v : α) {j : Nat} (pj : j < (a.set i v).size) (h : i.val ≠ j) : (a.set i v)[j]'pj = a[j]'(size_set a i v ▸ pj) :=", "area": "lean"} {"task": "t8", "statement": "theorem getElem_set (a : Array α) (i : Fin a.size) (v : α) (j : Nat) (h : j < (a.set i v).size) : (a.set i v)[j]'h = if i = j then v else a[j]'(size_set a i v ▸ h) :=", "area": "lean"} {"task": "t8", "statement": "theorem getElem?_set_eq (a : Array α) (i : Fin a.size) (v : α) : (a.set i v)[i.1]? = v :=", "area": "lean"} {"task": "t8", "statement": "theorem getElem?_set_ne (a : Array α) (i : Fin a.size) {j : Nat} (v : α) (ne : i.val ≠ j) : (a.set i v)[j]? = a[j]? :=", "area": "lean"} {"task": "t8", "statement": "theorem size_setD (a : Array α) (index : Nat) (val : α) : (Array.setD a index val).size = a.size :=", "area": "lean"} {"task": "t8", "statement": "theorem getElem_setD_eq (a : Array α) {i : Nat} (v : α) (h : _) : (setD a i v)[i]'h = v :=", "area": "lean"} {"task": "t8", "statement": "theorem getElem?_setD_eq (a : Array α) {i : Nat} (p : i < a.size) (v : α) : (a.setD i v)[i]? = some v :=", "area": "lean"} {"task": "t8", "statement": "theorem getD_get?_setD (a : Array α) (i : Nat) (v d : α) : Option.getD (setD a i v)[i]? d = if i < a.size then v else d :=", "area": "lean"} {"task": "t8", "statement": "theorem size_ofFn_go {n} (f : Fin n → α) (i acc) : (ofFn.go f i acc).size = acc.size + (n - i) :=", "area": "lean"} {"task": "t8", "statement": "theorem size_ofFn (f : Fin n → α) : (ofFn f).size = n :=", "area": "lean"} {"task": "t8", "statement": "theorem getElem_ofFn_go (f : Fin n → α) (i) {acc k} (hki : k < n) (hin : i ≤ n) (hi : i = acc.size) (hacc : ∀ j, ∀ hj : j < acc.size, acc[j] = f ⟨j, Nat.lt_of_lt_of_le hj (hi ▸ hin)⟩) : haveI : acc.size + (n - acc.size) = n := Nat.add_sub_cancel' (hi ▸ hin) (ofFn.go f i acc)[k]'(by simp [*]) = f ⟨k, hki⟩ :=", "area": "lean"} {"task": "t8", "statement": "theorem getElem_ofFn (f : Fin n → α) (i : Nat) (h) : (ofFn f)[i] = f ⟨i, size_ofFn f ▸ h⟩ :=", "area": "lean"} {"task": "t8", "statement": "theorem getElem_mkArray (n : Nat) (v : α) (h : i < (mkArray n v).size) : (mkArray n v)[i] = v :=", "area": "lean"} {"task": "t8", "statement": "theorem getElem?_mem {l : Array α} {i : Fin l.size} : l[i] ∈ l :=", "area": "lean"} {"task": "t8", "statement": "theorem get?_len_le (a : Array α) (i : Nat) (h : a.size ≤ i) : a[i]? = none :=", "area": "lean"} {"task": "t8", "statement": "theorem getElem_mem_data (a : Array α) (h : i < a.size) : a[i] ∈ a.data :=", "area": "lean"} {"task": "t8", "statement": "theorem getElem?_eq_data_get? (a : Array α) (i : Nat) : a[i]? = a.data.get? i :=", "area": "lean"} {"task": "t8", "statement": "theorem get!_eq_get? [Inhabited α] (a : Array α) : a.get! n = (a.get? n).getD default :=", "area": "lean"} {"task": "t8", "statement": "theorem back_eq_back? [Inhabited α] (a : Array α) : a.back = a.back?.getD default :=", "area": "lean"} {"task": "t8", "statement": "theorem back?_push (a : Array α) : (a.push x).back? = some x :=", "area": "lean"} {"task": "t8", "statement": "theorem back_push [Inhabited α] (a : Array α) : (a.push x).back = x :=", "area": "lean"} {"task": "t8", "statement": "theorem get?_push_lt (a : Array α) (x : α) (i : Nat) (h : i < a.size) : (a.push x)[i]? = some a[i] :=", "area": "lean"} {"task": "t8", "statement": "theorem get?_push_eq (a : Array α) (x : α) : (a.push x)[a.size]? = some x :=", "area": "lean"} {"task": "t8", "statement": "theorem get?_push {a : Array α} : (a.push x)[i]? = if i = a.size then some x else a[i]? :=", "area": "lean"} {"task": "t8", "statement": "theorem get?_size {a : Array α} : a[a.size]? = none :=", "area": "lean"} {"task": "t8", "statement": "theorem get_set_eq (a : Array α) (i : Fin a.size) (v : α) : (a.set i v)[i.1] = v :=", "area": "lean"} {"task": "t8", "statement": "theorem get?_set_eq (a : Array α) (i : Fin a.size) (v : α) : (a.set i v)[i.1]? = v :=", "area": "lean"} {"task": "t8", "statement": "theorem get?_set_ne (a : Array α) (i : Fin a.size) {j : Nat} (v : α) (h : i.1 ≠ j) : (a.set i v)[j]? = a[j]? :=", "area": "lean"} {"task": "t8", "statement": "theorem get?_set (a : Array α) (i : Fin a.size) (j : Nat) (v : α) : (a.set i v)[j]? = if i.1 = j then some v else a[j]? :=", "area": "lean"} {"task": "t8", "statement": "theorem get_set (a : Array α) (i : Fin a.size) (j : Nat) (hj : j < a.size) (v : α) : (a.set i v)[j]'(by simp [*]) = if i = j then v else a[j] :=", "area": "lean"} {"task": "t8", "statement": "theorem get_set_ne (a : Array α) (i : Fin a.size) {j : Nat} (v : α) (hj : j < a.size) (h : i.1 ≠ j) : (a.set i v)[j]'(by simp [*]) = a[j] :=", "area": "lean"} {"task": "t8", "statement": "theorem getElem_setD (a : Array α) (i : Nat) (v : α) (h : i < (setD a i v).size) : (setD a i v)[i] = v :=", "area": "lean"} {"task": "t8", "statement": "theorem set_set (a : Array α) (i : Fin a.size) (v v' : α) : (a.set i v).set ⟨i, by simp [i.2]⟩ v' = a.set i v' :=", "area": "lean"} {"task": "t8", "statement": "theorem fin_cast_val (e : n = n') (i : Fin n) : e ▸ i = ⟨i.1, e ▸ i.2⟩ :=", "area": "lean"} {"task": "t8", "statement": "theorem swap_def (a : Array α) (i j : Fin a.size) : a.swap i j = (a.set i (a.get j)).set ⟨j.1, by simp [j.2]⟩ (a.get i) :=", "area": "lean"} {"task": "t8", "statement": "theorem data_swap (a : Array α) (i j : Fin a.size) : (a.swap i j).data = (a.data.set i (a.get j)).set j (a.get i) :=", "area": "lean"} {"task": "t8", "statement": "theorem get?_swap (a : Array α) (i j : Fin a.size) (k : Nat) : (a.swap i j)[k]? = if j = k then some a[i.1] else if i = k then some a[j.1] else a[k]? :=", "area": "lean"} {"task": "t8", "statement": "theorem swapAt!_def (a : Array α) (i : Nat) (v : α) (h : i < a.size) : a.swapAt! i v = (a[i], a.set ⟨i, h⟩ v) :=", "area": "lean"} {"task": "t8", "statement": "theorem data_pop (a : Array α) : a.pop.data = a.data.dropLast :=", "area": "lean"} {"task": "t8", "statement": "theorem pop_push (a : Array α) : (a.push x).pop = a :=", "area": "lean"} {"task": "t8", "statement": "theorem eq_empty_of_size_eq_zero {as : Array α} (h : as.size = 0) : as = #[] :=", "area": "lean"} {"task": "t8", "statement": "theorem eq_push_pop_back_of_size_ne_zero [Inhabited α] {as : Array α} (h : as.size ≠ 0) : as = as.pop.push as.back :=", "area": "lean"} {"task": "t8", "statement": "theorem size_swap! (a : Array α) (i j) : (a.swap! i j).size = a.size :=", "area": "lean"} {"task": "t8", "statement": "theorem size_reverse (a : Array α) : a.reverse.size = a.size :=", "area": "lean"} {"task": "t8", "statement": "theorem size_range {n : Nat} : (range n).size = n :=", "area": "lean"} {"task": "t8", "statement": "theorem reverse_data (a : Array α) : a.reverse.data = a.data.reverse :=", "area": "lean"} {"task": "t8", "statement": "theorem foldl_induction {as : Array α} (motive : Nat → β → Prop) {init : β} (h0 : motive 0 init) {f : β → α → β} (hf : ∀ i : Fin as.size, ∀ b, motive i.1 b → motive (i.1 + 1) (f b as[i])) : motive as.size (as.foldl f init) :=", "area": "lean"} {"task": "t8", "statement": "theorem foldr_induction {as : Array α} (motive : Nat → β → Prop) {init : β} (h0 : motive as.size init) {f : α → β → β} (hf : ∀ i : Fin as.size, ∀ b, motive (i.1 + 1) b → motive i.1 (f as[i] b)) : motive 0 (as.foldr f init) :=", "area": "lean"} {"task": "t8", "statement": "theorem mem_map {f : α → β} {l : Array α} : b ∈ l.map f ↔ ∃ a, a ∈ l ∧ f a = b :=", "area": "lean"} {"task": "t8", "statement": "theorem mapM_eq_mapM_data [Monad m] [LawfulMonad m] (f : α → m β) (arr : Array α) : arr.mapM f = return mk (← arr.data.mapM f) :=", "area": "lean"} {"task": "t8", "statement": "theorem mapM_map_eq_foldl (as : Array α) (f : α → β) (i) : mapM.map (m := Id) f as i b = as.foldl (start := i) (fun r a => r.push (f a)) b :=", "area": "lean"} {"task": "t8", "statement": "theorem map_induction (as : Array α) (f : α → β) (motive : Nat → Prop) (h0 : motive 0) (p : Fin as.size → β → Prop) (hs : ∀ i, motive i.1 → p i (f as[i]) ∧ motive (i+1)) : motive as.size ∧ ∃ eq : (as.map f).size = as.size, ∀ i h, p ⟨i, h⟩ ((as.map f)[i]) :=", "area": "lean"} {"task": "t8", "statement": "theorem map_spec (as : Array α) (f : α → β) (p : Fin as.size → β → Prop) (hs : ∀ i, p i (f as[i])) : ∃ eq : (as.map f).size = as.size, ∀ i h, p ⟨i, h⟩ ((as.map f)[i]) :=", "area": "lean"} {"task": "t8", "statement": "theorem getElem_map (f : α → β) (as : Array α) (i : Nat) (h) : ((as.map f)[i]) = f (as[i]'(size_map .. ▸ h)) :=", "area": "lean"} {"task": "t8", "statement": "theorem mapIdx_induction (as : Array α) (f : Fin as.size → α → β) (motive : Nat → Prop) (h0 : motive 0) (p : Fin as.size → β → Prop) (hs : ∀ i, motive i.1 → p i (f i as[i]) ∧ motive (i + 1)) : motive as.size ∧ ∃ eq : (Array.mapIdx as f).size = as.size, ∀ i h, p ⟨i, h⟩ ((Array.mapIdx as f)[i]) :=", "area": "lean"} {"task": "t8", "statement": "theorem getElem_mapIdx (a : Array α) (f : Fin a.size → α → β) (i : Nat) (h : i < (mapIdx a f).size) : haveI : i < a.size := by simp_all (a.mapIdx f)[i] = f ⟨i, this⟩ a[i] :=", "area": "lean"} {"task": "t8", "statement": "theorem size_modify (a : Array α) (i : Nat) (f : α → α) : (a.modify i f).size = a.size :=", "area": "lean"} {"task": "t8", "statement": "theorem get_modify {arr : Array α} {x i} (h : i < arr.size) : (arr.modify x f).get ⟨i, by simp [h]⟩ = if x = i then f (arr.get ⟨i, h⟩) else arr.get ⟨i, h⟩ :=", "area": "lean"} {"task": "t8", "statement": "theorem filter_data (p : α → Bool) (l : Array α) : (l.filter p).data = l.data.filter p :=", "area": "lean"} {"task": "t8", "statement": "theorem filter_filter (q) (l : Array α) : filter p (filter q l) = filter (fun a => p a ∧ q a) l :=", "area": "lean"} {"task": "t8", "statement": "theorem mem_filter : x ∈ filter p as ↔ x ∈ as ∧ p x :=", "area": "lean"} {"task": "t8", "statement": "theorem filterMap_data (f : α → Option β) (l : Array α) : (l.filterMap f).data = l.data.filterMap f :=", "area": "lean"} {"task": "t8", "statement": "theorem mem_filterMap (f : α → Option β) (l : Array α) {b : β} : b ∈ filterMap f l ↔ ∃ a, a ∈ l ∧ f a = some b :=", "area": "lean"} {"task": "t8", "statement": "theorem mem_append {a : α} {s t : Array α} : a ∈ s ++ t ↔ a ∈ s ∨ a ∈ t :=", "area": "lean"} {"task": "t8", "statement": "theorem size_append (as bs : Array α) : (as ++ bs).size = as.size + bs.size :=", "area": "lean"} {"task": "t8", "statement": "theorem get_append_left {as bs : Array α} {h : i < (as ++ bs).size} (hlt : i < as.size) : (as ++ bs)[i] = as[i] :=", "area": "lean"} {"task": "t8", "statement": "theorem get_append_right {as bs : Array α} {h : i < (as ++ bs).size} (hle : as.size ≤ i) (hlt : i - as.size < bs.size := Nat.sub_lt_left_of_lt_add hle (size_append .. ▸ h)) : (as ++ bs)[i] = bs[i - as.size] :=", "area": "lean"} {"task": "t8", "statement": "theorem append_nil (as : Array α) : as ++ #[] = as :=", "area": "lean"} {"task": "t8", "statement": "theorem nil_append (as : Array α) : #[] ++ as = as :=", "area": "lean"} {"task": "t8", "statement": "theorem append_assoc (as bs cs : Array α) : as ++ bs ++ cs = as ++ (bs ++ cs) :=", "area": "lean"} {"task": "t8", "statement": "theorem extract_loop_zero (as bs : Array α) (start : Nat) : extract.loop as 0 start bs = bs :=", "area": "lean"} {"task": "t8", "statement": "theorem extract_loop_succ (as bs : Array α) (size start : Nat) (h : start < as.size) : extract.loop as (size+1) start bs = extract.loop as size (start+1) (bs.push as[start]) :=", "area": "lean"} {"task": "t8", "statement": "theorem extract_loop_of_ge (as bs : Array α) (size start : Nat) (h : start ≥ as.size) : extract.loop as size start bs = bs :=", "area": "lean"} {"task": "t8", "statement": "theorem extract_loop_eq_aux (as bs : Array α) (size start : Nat) : extract.loop as size start bs = bs ++ extract.loop as size start #[] :=", "area": "lean"} {"task": "t8", "statement": "theorem extract_loop_eq (as bs : Array α) (size start : Nat) (h : start + size ≤ as.size) : extract.loop as size start bs = bs ++ as.extract start (start + size) :=", "area": "lean"} {"task": "t8", "statement": "theorem size_extract_loop (as bs : Array α) (size start : Nat) : (extract.loop as size start bs).size = bs.size + min size (as.size - start) :=", "area": "lean"} {"task": "t8", "statement": "theorem size_extract (as : Array α) (start stop : Nat) : (as.extract start stop).size = min stop as.size - start :=", "area": "lean"} {"task": "t8", "statement": "theorem get_extract_loop_lt_aux (as bs : Array α) (size start : Nat) (hlt : i < bs.size) : i < (extract.loop as size start bs).size :=", "area": "lean"} {"task": "t8", "statement": "theorem get_extract_loop_lt (as bs : Array α) (size start : Nat) (hlt : i < bs.size) (h := get_extract_loop_lt_aux as bs size start hlt) : (extract.loop as size start bs)[i] = bs[i] :=", "area": "lean"} {"task": "t8", "statement": "theorem get_extract_loop_ge_aux (as bs : Array α) (size start : Nat) (hge : i ≥ bs.size) (h : i < (extract.loop as size start bs).size) : start + i - bs.size < as.size :=", "area": "lean"} {"task": "t8", "statement": "theorem get_extract_loop_ge (as bs : Array α) (size start : Nat) (hge : i ≥ bs.size) (h : i < (extract.loop as size start bs).size) (h' := get_extract_loop_ge_aux as bs size start hge h) : (extract.loop as size start bs)[i] = as[start + i - bs.size] :=", "area": "lean"} {"task": "t8", "statement": "theorem get_extract_aux {as : Array α} {start stop : Nat} (h : i < (as.extract start stop).size) : start + i < as.size :=", "area": "lean"} {"task": "t8", "statement": "theorem get_extract {as : Array α} {start stop : Nat} (h : i < (as.extract start stop).size) : (as.extract start stop)[i] = as[start + i]'(get_extract_aux h) :=", "area": "lean"} {"task": "t8", "statement": "theorem extract_all (as : Array α) : as.extract 0 as.size = as :=", "area": "lean"} {"task": "t8", "statement": "theorem extract_empty_of_stop_le_start (as : Array α) {start stop : Nat} (h : stop ≤ start) : as.extract start stop = #[] :=", "area": "lean"} {"task": "t8", "statement": "theorem extract_empty_of_size_le_start (as : Array α) {start stop : Nat} (h : as.size ≤ start) : as.extract start stop = #[] :=", "area": "lean"} {"task": "t8", "statement": "theorem anyM_loop_iff_exists (p : α → Bool) (as : Array α) (start stop) (h : stop ≤ as.size) : anyM.loop (m := Id) p as stop h start = true ↔ ∃ i : Fin as.size, start ≤ ↑i ∧ ↑i < stop ∧ p as[i] = true :=", "area": "lean"} {"task": "t8", "statement": "theorem any_iff_exists (p : α → Bool) (as : Array α) (start stop) : any as p start stop ↔ ∃ i : Fin as.size, start ≤ i.1 ∧ i.1 < stop ∧ p as[i] :=", "area": "lean"} {"task": "t8", "statement": "theorem any_eq_true (p : α → Bool) (as : Array α) : any as p ↔ ∃ i : Fin as.size, p as[i] :=", "area": "lean"} {"task": "t8", "statement": "theorem any_def {p : α → Bool} (as : Array α) : as.any p = as.data.any p :=", "area": "lean"} {"task": "t8", "statement": "theorem all_eq_not_any_not (p : α → Bool) (as : Array α) (start stop) : all as p start stop = !(any as (!p ·) start stop) :=", "area": "lean"} {"task": "t8", "statement": "theorem all_iff_forall (p : α → Bool) (as : Array α) (start stop) : all as p start stop ↔ ∀ i : Fin as.size, start ≤ i.1 ∧ i.1 < stop → p as[i] :=", "area": "lean"} {"task": "t8", "statement": "theorem all_eq_true (p : α → Bool) (as : Array α) : all as p ↔ ∀ i : Fin as.size, p as[i] :=", "area": "lean"} {"task": "t8", "statement": "theorem all_def {p : α → Bool} (as : Array α) : as.all p = as.data.all p :=", "area": "lean"} {"task": "t8", "statement": "theorem all_eq_true_iff_forall_mem {l : Array α} : l.all p ↔ ∀ x, x ∈ l → p x :=", "area": "lean"} {"task": "t8", "statement": "theorem contains_def [DecidableEq α] {a : α} {as : Array α} : as.contains a ↔ a ∈ as :=", "area": "lean"} {"task": "t8", "statement": "theorem get_swap_right (a : Array α) {i j : Fin a.size} : (a.swap i j)[j.val] = a[i] :=", "area": "lean"} {"task": "t8", "statement": "theorem get_swap_left (a : Array α) {i j : Fin a.size} : (a.swap i j)[i.val] = a[j] :=", "area": "lean"} {"task": "t8", "statement": "theorem get_swap_of_ne (a : Array α) {i j : Fin a.size} (hp : p < a.size) (hi : p ≠ i) (hj : p ≠ j) : (a.swap i j)[p]'(a.size_swap .. |>.symm ▸ hp) = a[p] :=", "area": "lean"} {"task": "t8", "statement": "theorem get_swap (a : Array α) (i j : Fin a.size) (k : Nat) (hk: k < a.size) : (a.swap i j)[k]'(by simp_all) = if k = i then a[j] else if k = j then a[i] else a[k] :=", "area": "lean"} {"task": "t8", "statement": "theorem get_swap' (a : Array α) (i j : Fin a.size) (k : Nat) (hk' : k < (a.swap i j).size) : (a.swap i j)[k] = if k = i then a[j] else if k = j then a[i] else a[k]'(by simp_all) :=", "area": "lean"} {"task": "t8", "statement": "theorem swap_swap (a : Array α) {i j : Fin a.size} : (a.swap i j).swap ⟨i.1, (a.size_swap ..).symm ▸i.2⟩ ⟨j.1, (a.size_swap ..).symm ▸j.2⟩ = a :=", "area": "lean"} {"task": "t8", "statement": "theorem swap_comm (a : Array α) {i j : Fin a.size} : a.swap i j = a.swap j i :=", "area": "lean"} {"task": "t8", "statement": "theorem some_inj {a b : α} : some a = some b ↔ a = b :=", "area": "lean"} {"task": "t8", "statement": "theorem subNatNat_of_sub_eq_zero {m n : Nat} (h : n - m = 0) : subNatNat m n = ↑(m - n) :=", "area": "lean"} {"task": "t8", "statement": "theorem subNatNat_of_sub_eq_succ {m n k : Nat} (h : n - m = succ k) : subNatNat m n = -[k+1] :=", "area": "lean"} {"task": "t8", "statement": "theorem negSucc_inj : negSucc m = negSucc n ↔ m = n :=", "area": "lean"} {"task": "t8", "statement": "theorem neg_inj {a b : Int} : -a = -b ↔ a = b :=", "area": "lean"} {"task": "t8", "statement": "theorem subNatNat_elim (m n : Nat) (motive : Nat → Nat → Int → Prop) (hp : ∀ i n, motive (n + i) n i) (hn : ∀ i m, motive m (m + i + 1) -[i+1]) : motive m n (subNatNat m n) :=", "area": "lean"} {"task": "t8", "statement": "theorem subNatNat_add_left : subNatNat (m + n) m = n :=", "area": "lean"} {"task": "t8", "statement": "theorem subNatNat_add_right : subNatNat m (m + n + 1) = negSucc n :=", "area": "lean"} {"task": "t8", "statement": "theorem subNatNat_add_add (m n k : Nat) : subNatNat (m + k) (n + k) = subNatNat m n :=", "area": "lean"} {"task": "t8", "statement": "theorem add_comm : ∀ a b : Int, a + b = b + a", "area": "lean"} {"task": "t8", "statement": "theorem ofNat_add_negSucc_of_lt (h : m < n.succ) : ofNat m + -[n+1] = -[n - m+1] :=", "area": "lean"} {"task": "t8", "statement": "theorem subNatNat_sub (h : n ≤ m) (k : Nat) : subNatNat (m - n) k = subNatNat m (k + n) :=", "area": "lean"} {"task": "t8", "statement": "theorem subNatNat_add (m n k : Nat) : subNatNat (m + n) k = m + subNatNat n k :=", "area": "lean"} {"task": "t8", "statement": "theorem subNatNat_add_negSucc (m n k : Nat) : subNatNat m n + -[k+1] = subNatNat m (n + succ k) :=", "area": "lean"} {"task": "t8", "statement": "theorem add_assoc : ∀ a b c : Int, a + b + c = a + (b + c)", "area": "lean"} {"task": "t8", "statement": "theorem add_left_comm (a b c : Int) : a + (b + c) = b + (a + c) :=", "area": "lean"} {"task": "t8", "statement": "theorem add_right_comm (a b c : Int) : a + b + c = a + c + b :=", "area": "lean"} {"task": "t8", "statement": "theorem subNatNat_self : ∀ n, subNatNat n n = 0", "area": "lean"} {"task": "t8", "statement": "theorem add_left_neg : ∀ a : Int, -a + a = 0", "area": "lean"} {"task": "t8", "statement": "theorem add_right_neg (a : Int) : a + -a = 0 :=", "area": "lean"} {"task": "t8", "statement": "theorem neg_eq_of_add_eq_zero {a b : Int} (h : a + b = 0) : -a = b :=", "area": "lean"} {"task": "t8", "statement": "theorem eq_neg_of_eq_neg {a b : Int} (h : a = -b) : b = -a :=", "area": "lean"} {"task": "t8", "statement": "theorem neg_eq_comm {a b : Int} : -a = b ↔ -b = a :=", "area": "lean"} {"task": "t8", "statement": "theorem neg_add_cancel_left (a b : Int) : -a + (a + b) = b :=", "area": "lean"} {"task": "t8", "statement": "theorem add_neg_cancel_left (a b : Int) : a + (-a + b) = b :=", "area": "lean"} {"task": "t8", "statement": "theorem add_neg_cancel_right (a b : Int) : a + b + -b = a :=", "area": "lean"} {"task": "t8", "statement": "theorem neg_add_cancel_right (a b : Int) : a + -b + b = a :=", "area": "lean"} {"task": "t8", "statement": "theorem add_left_cancel {a b c : Int} (h : a + b = a + c) : b = c :=", "area": "lean"} {"task": "t8", "statement": "theorem neg_add {a b : Int} : -(a + b) = -a + -b :=", "area": "lean"} {"task": "t8", "statement": "theorem sub_self (a : Int) : a - a = 0 :=", "area": "lean"} {"task": "t8", "statement": "theorem sub_zero (a : Int) : a - 0 = a :=", "area": "lean"} {"task": "t8", "statement": "theorem zero_sub (a : Int) : 0 - a = -a :=", "area": "lean"} {"task": "t8", "statement": "theorem sub_eq_zero_of_eq {a b : Int} (h : a = b) : a - b = 0 :=", "area": "lean"} {"task": "t8", "statement": "theorem eq_of_sub_eq_zero {a b : Int} (h : a - b = 0) : a = b :=", "area": "lean"} {"task": "t8", "statement": "theorem sub_sub (a b c : Int) : a - b - c = a - (b + c) :=", "area": "lean"} {"task": "t8", "statement": "theorem neg_sub (a b : Int) : -(a - b) = b - a :=", "area": "lean"} {"task": "t8", "statement": "theorem sub_sub_self (a b : Int) : a - (a - b) = b :=", "area": "lean"} {"task": "t8", "statement": "theorem sub_neg (a b : Int) : a - -b = a + b :=", "area": "lean"} {"task": "t8", "statement": "theorem add_sub_assoc (a b c : Int) : a + b - c = a + (b - c) :=", "area": "lean"} {"task": "t8", "statement": "theorem ofNat_sub (h : m ≤ n) : ((n - m : Nat) : Int) = n - m :=", "area": "lean"} {"task": "t8", "statement": "theorem negSucc_coe' (n : Nat) : -[n+1] = -↑n - 1 :=", "area": "lean"} {"task": "t8", "statement": "theorem subNatNat_eq_coe {m n : Nat} : subNatNat m n = ↑m - ↑n :=", "area": "lean"} {"task": "t8", "statement": "theorem toNat_sub (m n : Nat) : toNat (m - n) = m - n :=", "area": "lean"} {"task": "t8", "statement": "theorem add_right_inj (i j k : Int) : (i + k = j + k) ↔ i = j :=", "area": "lean"} {"task": "t8", "statement": "theorem add_left_inj (i j k : Int) : (k + i = k + j) ↔ i = j :=", "area": "lean"} {"task": "t8", "statement": "theorem sub_left_inj (i j k : Int) : (k - i = k - j) ↔ i = j :=", "area": "lean"} {"task": "t8", "statement": "theorem sub_right_inj (i j k : Int) : (i - k = j - k) ↔ i = j :=", "area": "lean"} {"task": "t8", "statement": "theorem mul_comm (a b : Int) : a * b = b * a :=", "area": "lean"} {"task": "t8", "statement": "theorem ofNat_mul_negOfNat (m n : Nat) : (m : Nat) * negOfNat n = negOfNat (m * n) :=", "area": "lean"} {"task": "t8", "statement": "theorem negOfNat_mul_ofNat (m n : Nat) : negOfNat m * (n : Nat) = negOfNat (m * n) :=", "area": "lean"} {"task": "t8", "statement": "theorem negSucc_mul_negOfNat (m n : Nat) : -[m+1] * negOfNat n = ofNat (succ m * n) :=", "area": "lean"} {"task": "t8", "statement": "theorem negOfNat_mul_negSucc (m n : Nat) : negOfNat n * -[m+1] = ofNat (n * succ m) :=", "area": "lean"} {"task": "t8", "statement": "theorem mul_assoc (a b c : Int) : a * b * c = a * (b * c) :=", "area": "lean"} {"task": "t8", "statement": "theorem mul_left_comm (a b c : Int) : a * (b * c) = b * (a * c) :=", "area": "lean"} {"task": "t8", "statement": "theorem mul_right_comm (a b c : Int) : a * b * c = a * c * b :=", "area": "lean"} {"task": "t8", "statement": "theorem mul_zero (a : Int) : a * 0 = 0 :=", "area": "lean"} {"task": "t8", "statement": "theorem negOfNat_eq_subNatNat_zero (n) : negOfNat n = subNatNat 0 n :=", "area": "lean"} {"task": "t8", "statement": "theorem ofNat_mul_subNatNat (m n k : Nat) : m * subNatNat n k = subNatNat (m * n) (m * k) :=", "area": "lean"} {"task": "t8", "statement": "theorem negOfNat_add (m n : Nat) : negOfNat m + negOfNat n = negOfNat (m + n) :=", "area": "lean"} {"task": "t8", "statement": "theorem negSucc_mul_subNatNat (m n k : Nat) : -[m+1] * subNatNat n k = subNatNat (succ m * k) (succ m * n) :=", "area": "lean"} {"task": "t8", "statement": "theorem mul_add : ∀ a b c : Int, a * (b + c) = a * b + a * c", "area": "lean"} {"task": "t8", "statement": "theorem add_mul (a b c : Int) : (a + b) * c = a * c + b * c :=", "area": "lean"} {"task": "t8", "statement": "theorem neg_mul_eq_neg_mul (a b : Int) : -(a * b) = -a * b :=", "area": "lean"} {"task": "t8", "statement": "theorem neg_mul_eq_mul_neg (a b : Int) : -(a * b) = a * -b :=", "area": "lean"} {"task": "t8", "statement": "theorem neg_mul_neg (a b : Int) : -a * -b = a * b :=", "area": "lean"} {"task": "t8", "statement": "theorem neg_mul_comm (a b : Int) : -a * b = a * -b :=", "area": "lean"} {"task": "t8", "statement": "theorem mul_sub (a b c : Int) : a * (b - c) = a * b - a * c :=", "area": "lean"} {"task": "t8", "statement": "theorem sub_mul (a b c : Int) : (a - b) * c = a * c - b * c :=", "area": "lean"} {"task": "t8", "statement": "theorem one_mul : ∀ a : Int, 1 * a = a", "area": "lean"} {"task": "t8", "statement": "theorem mul_one (a : Int) : a * 1 = a :=", "area": "lean"} {"task": "t8", "statement": "theorem mul_neg_one (a : Int) : a * -1 = -a :=", "area": "lean"} {"task": "t8", "statement": "theorem neg_eq_neg_one_mul : ∀ a : Int, -a = -1 * a", "area": "lean"} {"task": "t8", "statement": "theorem mul_eq_zero {a b : Int} : a * b = 0 ↔ a = 0 ∨ b = 0 :=", "area": "lean"} {"task": "t8", "statement": "theorem eq_of_mul_eq_mul_right {a b c : Int} (ha : a ≠ 0) (h : b * a = c * a) : b = c :=", "area": "lean"} {"task": "t8", "statement": "theorem eq_of_mul_eq_mul_left {a b c : Int} (ha : a ≠ 0) (h : a * b = a * c) : b = c :=", "area": "lean"} {"task": "t8", "statement": "theorem eq_one_of_mul_eq_self_left {a b : Int} (Hpos : a ≠ 0) (H : b * a = a) : b = 1 :=", "area": "lean"} {"task": "t8", "statement": "theorem eq_one_of_mul_eq_self_right {a b : Int} (Hpos : b ≠ 0) (H : b * a = b) : a = 1 :=", "area": "lean"} {"task": "t8", "statement": "theorem natCast_add (a b : Nat) : ((a + b : Nat) : Int) = (a : Int) + (b : Int) :=", "area": "lean"} {"task": "t8", "statement": "theorem natCast_mul (a b : Nat) : ((a * b : Nat) : Int) = (a : Int) * (b : Int) :=", "area": "lean"} {"task": "t8", "statement": "theorem ext {x y : ExceptT ε m α} (h : x.run = y.run) : x = y :=", "area": "lean"} {"task": "t8", "statement": "theorem run_bind_lift [Monad m] [LawfulMonad m] (x : m α) (f : α → ExceptT ε m β) : run (ExceptT.lift x >>= f : ExceptT ε m β) = x >>= fun a => run (f a) :=", "area": "lean"} {"task": "t8", "statement": "theorem bind_throw [Monad m] [LawfulMonad m] (f : α → ExceptT ε m β) : (throw e >>= f) = throw e :=", "area": "lean"} {"task": "t8", "statement": "theorem lift_pure [Monad m] [LawfulMonad m] (a : α) : ExceptT.lift (pure a) = (pure a : ExceptT ε m α) :=", "area": "lean"} {"task": "t8", "statement": "theorem run_map [Monad m] [LawfulMonad m] (f : α → β) (x : ExceptT ε m α) : (f <$> x).run = Except.map f <$> x.run :=", "area": "lean"} {"task": "t8", "statement": "theorem bind_pure_comp [Monad m] (f : α → β) (x : ExceptT ε m α) : x >>= pure ∘ f = f <$> x :=", "area": "lean"} {"task": "t8", "statement": "theorem seqLeft_eq {α β ε : Type u} {m : Type u → Type v} [Monad m] [LawfulMonad m] (x : ExceptT ε m α) (y : ExceptT ε m β) : x <* y = const β <$> x <*> y :=", "area": "lean"} {"task": "t8", "statement": "theorem seqRight_eq [Monad m] [LawfulMonad m] (x : ExceptT ε m α) (y : ExceptT ε m β) : x *> y = const α id <$> x <*> y :=", "area": "lean"} {"task": "t8", "statement": "theorem ext {x y : ReaderT ρ m α} (h : ∀ ctx, x.run ctx = y.run ctx) : x = y :=", "area": "lean"} {"task": "t8", "statement": "theorem run_bind [Monad m] (x : StateT σ m α) (f : α → StateT σ m β) (s : σ) : (x >>= f).run s = x.run s >>= λ p => (f p.1).run p.2 :=", "area": "lean"} {"task": "t8", "statement": "theorem run_map {α β σ : Type u} [Monad m] [LawfulMonad m] (f : α → β) (x : StateT σ m α) (s : σ) : (f <$> x).run s = (fun (p : α × σ) => (f p.1, p.2)) <$> x.run s :=", "area": "lean"} {"task": "t8", "statement": "theorem run_modifyGet [Monad m] (f : σ → α × σ) (s : σ) : (modifyGet f : StateT σ m α).run s = pure ((f s).1, (f s).2) :=", "area": "lean"} {"task": "t8", "statement": "theorem run_bind_lift {α σ : Type u} [Monad m] [LawfulMonad m] (x : m α) (f : α → StateT σ m β) (s : σ) : (StateT.lift x >>= f).run s = x >>= fun a => (f a).run s :=", "area": "lean"} {"task": "t8", "statement": "theorem run_seq {α β σ : Type u} [Monad m] [LawfulMonad m] (f : StateT σ m (α → β)) (x : StateT σ m α) (s : σ) : (f <*> x).run s = (f.run s >>= fun fs => (fun (p : α × σ) => (fs.1 p.1, p.2)) <$> x.run fs.2) :=", "area": "lean"} {"task": "t8", "statement": "theorem run_seqRight [Monad m] (x : StateT σ m α) (y : StateT σ m β) (s : σ) : (x *> y).run s = (x.run s >>= fun p => y.run p.2) :=", "area": "lean"} {"task": "t8", "statement": "theorem run_seqLeft {α β σ : Type u} [Monad m] (x : StateT σ m α) (y : StateT σ m β) (s : σ) : (x <* y).run s = (x.run s >>= fun p => y.run p.2 >>= fun p' => pure (p.1, p'.2)) :=", "area": "lean"} {"task": "t8", "statement": "theorem seqRight_eq [Monad m] [LawfulMonad m] (x : StateT σ m α) (y : StateT σ m β) : x *> y = const α id <$> x <*> y :=", "area": "lean"} {"task": "t8", "statement": "theorem seqLeft_eq [Monad m] [LawfulMonad m] (x : StateT σ m α) (y : StateT σ m β) : x <* y = const β <$> x <*> y :=", "area": "lean"} {"task": "t8", "statement": "theorem coeff_add_of_eq {n : ℕ} {a b : R} {f g : R[X]} (h_add_left : f.coeff n = a) (h_add_right : g.coeff n = b) : (f + g).coeff n = a + b :=", "area": "Tactic"} {"task": "t8", "statement": "theorem coeff_mul_add_of_le_natDegree_of_eq_ite {d df dg : ℕ} {a b : R} {f g : R[X]} (h_mul_left : natDegree f ≤ df) (h_mul_right : natDegree g ≤ dg) (h_mul_left : f.coeff df = a) (h_mul_right : g.coeff dg = b) (ddf : df + dg ≤ d) : (f * g).coeff d = if d = df + dg then a * b else 0 :=", "area": "Tactic"} {"task": "t8", "statement": "theorem coeff_pow_of_natDegree_le_of_eq_ite' {m n o : ℕ} {a : R} {p : R[X]} (h_pow : natDegree p ≤ n) (h_exp : m * n ≤ o) (h_pow_bas : coeff p n = a) : coeff (p ^ m) o = if o = m * n then a ^ m else 0 :=", "area": "Tactic"} {"task": "t8", "statement": "theorem natDegree_eq_of_le_of_coeff_ne_zero' {deg m o : ℕ} {c : R} {p : R[X]} (h_natDeg_le : natDegree p ≤ m) (coeff_eq : coeff p o = c) (coeff_ne_zero : c ≠ 0) (deg_eq_deg : m = deg) (coeff_eq_deg : o = deg) : natDegree p = deg :=", "area": "Tactic"} {"task": "t8", "statement": "theorem degree_eq_of_le_of_coeff_ne_zero' {deg m o : WithBot ℕ} {c : R} {p : R[X]} (h_deg_le : degree p ≤ m) (coeff_eq : coeff p (WithBot.unbot' 0 deg) = c) (coeff_ne_zero : c ≠ 0) (deg_eq_deg : m = deg) (coeff_eq_deg : o = deg) : degree p = deg :=", "area": "Tactic"} {"task": "t8", "statement": "theorem coeff_sub_of_eq {n : ℕ} {a b : R} {f g : R[X]} (hf : f.coeff n = a) (hg : g.coeff n = b) : (f - g).coeff n = a - b :=", "area": "Tactic"} {"task": "t8", "statement": "theorem coeff_intCast_ite {n : ℕ} {a : ℤ} : (Int.cast a : R[X]).coeff n = ite (n = 0) a 0 :=", "area": "Tactic"} {"task": "t8", "statement": "theorem isRat_mkRat : {a na n : ℤ} → {b nb d : ℕ} → IsInt a na → IsNat b nb → IsRat (na / nb : ℚ) n d → IsRat (mkRat a b) n d", "area": "Tactic"} {"task": "t8", "statement": "theorem isNat_ratCast [DivisionRing R] : {q : ℚ} → {n : ℕ} → IsNat q n → IsNat (q : R) n", "area": "Tactic"} {"task": "t8", "statement": "theorem isInt_ratCast [DivisionRing R] : {q : ℚ} → {n : ℤ} → IsInt q n → IsInt (q : R) n", "area": "Tactic"} {"task": "t8", "statement": "theorem isRat_ratCast [DivisionRing R] [CharZero R] : {q : ℚ} → {n : ℤ} → {d : ℕ} → IsRat q n d → IsRat (q : R) n d", "area": "Tactic"} {"task": "t8", "statement": "theorem isRat_inv_pos {α} [DivisionRing α] [CharZero α] {a : α} {n d : ℕ} : IsRat a (.ofNat (Nat.succ n)) d → IsRat a⁻¹ (.ofNat d) (Nat.succ n) :=", "area": "Tactic"} {"task": "t8", "statement": "theorem isRat_inv_one {α} [DivisionRing α] : {a : α} → IsNat a (nat_lit 1) → IsNat a⁻¹ (nat_lit 1)", "area": "Tactic"} {"task": "t8", "statement": "theorem isRat_inv_zero {α} [DivisionRing α] : {a : α} → IsNat a (nat_lit 0) → IsNat a⁻¹ (nat_lit 0)", "area": "Tactic"} {"task": "t8", "statement": "theorem isRat_inv_neg_one {α} [DivisionRing α] : {a : α} → IsInt a (.negOfNat (nat_lit 1)) → IsInt a⁻¹ (.negOfNat (nat_lit 1))", "area": "Tactic"} {"task": "t8", "statement": "theorem isRat_inv_neg {α} [DivisionRing α] [CharZero α] {a : α} {n d : ℕ} : IsRat a (.negOfNat (Nat.succ n)) d → IsRat a⁻¹ (.negOfNat d) (Nat.succ n) :=", "area": "Tactic"} {"task": "t8", "statement": "theorem eq_whisker' {X Y : C} {f g : X ⟶ Y} (w : f = g) {Z : C} (h : Y ⟶ Z) : f ≫ h = g ≫ h :=", "area": "Tactic"} {"task": "t8", "statement": "lemma pos_of_isNat [StrictOrderedSemiring A] (h : NormNum.IsNat e n) (w : Nat.ble 1 n = true) : 0 < (e : A) :=", "area": "Tactic"} {"task": "t8", "statement": "lemma nonneg_of_isNat [OrderedSemiring A] (h : NormNum.IsNat e n) : 0 ≤ (e : A) :=", "area": "Tactic"} {"task": "t8", "statement": "lemma nz_of_isNegNat [StrictOrderedRing A] (h : NormNum.IsInt e (.negOfNat n)) (w : Nat.ble 1 n = true) : (e : A) ≠ 0 :=", "area": "Tactic"} {"task": "t8", "statement": "lemma pos_of_isRat [LinearOrderedRing A] : (NormNum.IsRat e n d) → (decide (0 < n)) → ((0 : A) < (e : A))", "area": "Tactic"} {"task": "t8", "statement": "lemma nonneg_of_isRat [LinearOrderedRing A] : (NormNum.IsRat e n d) → (decide (n = 0)) → (0 ≤ (e : A))", "area": "Tactic"} {"task": "t8", "statement": "lemma nz_of_isRat [LinearOrderedRing A] : (NormNum.IsRat e n d) → (decide (n < 0)) → ((e : A) ≠ 0)", "area": "Tactic"} {"task": "t8", "statement": "@[simp, norm_cast] lemma coe_iInf (f : ι → Sublattice α) : ⨅ i, f i = ⋂ i, (f i : Set α) :=", "area": "Order"} {"task": "t8", "statement": "@[simp, norm_cast] lemma coe_eq_univ : L = (univ : Set α) ↔ L = ⊤ :=", "area": "Order"} {"task": "t8", "statement": "@[simp, norm_cast] lemma coe_eq_empty : L = (∅ : Set α) ↔ L = ⊥ :=", "area": "Order"} {"task": "t8", "statement": "@[simp] lemma mem_sInf {S : Set (Sublattice α)} : a ∈ sInf S ↔ ∀ L ∈ S, a ∈ L :=", "area": "Order"} {"task": "t8", "statement": "@[simp] lemma mem_iInf {f : ι → Sublattice α} : a ∈ ⨅ i, f i ↔ ∀ i, a ∈ f i :=", "area": "Order"} {"task": "t8", "statement": "lemma map_symm_eq_iff_eq_map {M : Sublattice β} {e : β ≃o α} : L.map ↑e.symm = M ↔ L = M.map ↑e :=", "area": "Order"} {"task": "t8", "statement": "lemma map_inf (L M : Sublattice α) (f : LatticeHom α β) (hf : Injective f) : map f (L ⊓ M) = map f L ⊓ map f M :=", "area": "Order"} {"task": "t8", "statement": "lemma map_top (f : LatticeHom α β) (h : Surjective f) : Sublattice.map f ⊤ = ⊤ :=", "area": "Order"} {"task": "t8", "statement": "theorem subset_sSup_of_within [Inhabited s] {t : Set s} (h' : t.Nonempty) (h'' : BddAbove t) (h : sSup ((↑) '' t : Set α) ∈ s) : sSup ((↑) '' t : Set α) = (@sSup s _ t : α) :=", "area": "Order"} {"task": "t8", "statement": "theorem subset_sSup_emptyset [Inhabited s] : sSup (∅ : Set s) = default :=", "area": "Order"} {"task": "t8", "statement": "theorem subset_sSup_of_not_bddAbove [Inhabited s] {t : Set s} (ht : ¬BddAbove t) : sSup t = default :=", "area": "Order"} {"task": "t8", "statement": "theorem subset_sInf_of_within [Inhabited s] {t : Set s} (h' : t.Nonempty) (h'' : BddBelow t) (h : sInf ((↑) '' t : Set α) ∈ s) : sInf ((↑) '' t : Set α) = (@sInf s _ t : α) :=", "area": "Order"} {"task": "t8", "statement": "theorem subset_sInf_emptyset [Inhabited s] : sInf (∅ : Set s) = default :=", "area": "Order"} {"task": "t8", "statement": "theorem subset_sInf_of_not_bddBelow [Inhabited s] {t : Set s} (ht : ¬BddBelow t) : sInf t = default :=", "area": "Order"} {"task": "t8", "statement": "theorem sSup_within_of_ordConnected {s : Set α} [hs : OrdConnected s] ⦃t : Set s⦄ (ht : t.Nonempty) (h_bdd : BddAbove t) : sSup ((↑) '' t : Set α) ∈ s :=", "area": "Order"} {"task": "t8", "statement": "theorem sInf_within_of_ordConnected {s : Set α} [hs : OrdConnected s] ⦃t : Set s⦄ (ht : t.Nonempty) (h_bdd : BddBelow t) : sInf ((↑) '' t : Set α) ∈ s :=", "area": "Order"} {"task": "t8", "statement": "theorem coe_iSup : (↑(⨆ i, f i) : α) = ⨆ i, (f i : α) :=", "area": "Order"} {"task": "t8", "statement": "theorem coe_biSup : (↑(⨆ i, ⨆ (_ : p i), f i) : α) = ⨆ i, ⨆ (_ : p i), (f i : α) :=", "area": "Order"} {"task": "t8", "statement": "theorem coe_iInf : (↑(⨅ i, f i) : α) = a ⊓ ⨅ i, (f i : α) :=", "area": "Order"} {"task": "t8", "statement": "theorem coe_biInf : (↑(⨅ i, ⨅ (_ : p i), f i) : α) = a ⊓ ⨅ i, ⨅ (_ : p i), (f i : α) :=", "area": "Order"} {"task": "t8", "statement": "lemma isLUB_iff_sSup_eq : IsLUB s a ↔ sSup s = a :=", "area": "Order"} {"task": "t8", "statement": "theorem le_iSup_iff {s : ι → α} : a ≤ iSup s ↔ ∀ b, (∀ i, s i ≤ b) → a ≤ b :=", "area": "Order"} {"task": "t8", "statement": "lemma isGLB_iff_sInf_eq : IsGLB s a ↔ sInf s = a :=", "area": "Order"} {"task": "t8", "statement": "theorem iInf_le_iff {s : ι → α} : iInf s ≤ a ↔ ∀ b, (∀ i, b ≤ s i) → b ≤ a :=", "area": "Order"} {"task": "t8", "statement": "theorem eq_singleton_bot_of_sSup_eq_bot_of_nonempty {s : Set α} (h_sup : sSup s = ⊥) (hne : s.Nonempty) : s = {⊥} :=", "area": "Order"} {"task": "t8", "statement": "theorem sSup_eq_iSup' (s : Set α) : sSup s = ⨆ a : s, (a : α) :=", "area": "Order"} {"task": "t8", "statement": "theorem biSup_congr' {p : ι → Prop} {f g : (i : ι) → p i → α} (h : ∀ i (hi : p i), f i hi = g i hi) : ⨆ i, ⨆ (hi : p i), f i hi = ⨆ i, ⨆ (hi : p i), g i hi :=", "area": "Order"} {"task": "t8", "statement": "theorem Function.Surjective.iSup_comp {f : ι → ι'} (hf : Surjective f) (g : ι' → α) : ⨆ x, g (f x) = ⨆ y, g y :=", "area": "Order"} {"task": "t8", "statement": "theorem Function.Surjective.iSup_congr {g : ι' → α} (h : ι → ι') (h1 : Surjective h) (h2 : ∀ x, g (h x) = f x) : ⨆ x, f x = ⨆ y, g y :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_congr_Prop {p q : Prop} {f₁ : p → α} {f₂ : q → α} (pq : p ↔ q) (f : ∀ x, f₁ (pq.mpr x) = f₂ x) : iSup f₁ = iSup f₂ :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_range' (g : β → α) (f : ι → β) : ⨆ b : range f, g b = ⨆ i, g (f i) :=", "area": "Order"} {"task": "t8", "statement": "theorem sSup_image' {s : Set β} {f : β → α} : sSup (f '' s) = ⨆ a : s, f a :=", "area": "Order"} {"task": "t8", "statement": "theorem biInf_congr' {p : ι → Prop} {f g : (i : ι) → p i → α} (h : ∀ i (hi : p i), f i hi = g i hi) : ⨅ i, ⨅ (hi : p i), f i hi = ⨅ i, ⨅ (hi : p i), g i hi :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup₂_le_iff {f : ∀ i, κ i → α} : ⨆ (i) (j), f i j ≤ a ↔ ∀ i j, f i j ≤ a :=", "area": "Order"} {"task": "t8", "statement": "theorem le_iInf₂_iff {f : ∀ i, κ i → α} : (a ≤ ⨅ (i) (j), f i j) ↔ ∀ i j, a ≤ f i j :=", "area": "Order"} {"task": "t8", "statement": "theorem Monotone.le_map_sSup [CompleteLattice β] {s : Set α} {f : α → β} (hf : Monotone f) : ⨆ a ∈ s, f a ≤ f (sSup s) :=", "area": "Order"} {"task": "t8", "statement": "theorem OrderIso.map_iSup [CompleteLattice β] (f : α ≃o β) (x : ι → α) : f (⨆ i, x i) = ⨆ i, f (x i) :=", "area": "Order"} {"task": "t8", "statement": "theorem OrderIso.map_sSup [CompleteLattice β] (f : α ≃o β) (s : Set α) : f (sSup s) = ⨆ a ∈ s, f a :=", "area": "Order"} {"task": "t8", "statement": "theorem Antitone.map_sSup_le [CompleteLattice β] {s : Set α} {f : α → β} (hf : Antitone f) : f (sSup s) ≤ ⨅ a ∈ s, f a :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_const [Nonempty ι] : ⨆ _ : ι, a = a :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup₂_eq_bot {f : ∀ i, κ i → α} : ⨆ (i) (j), f i j = ⊥ ↔ ∀ i j, f i j = ⊥ :=", "area": "Order"} {"task": "t8", "statement": "theorem iInf₂_eq_top {f : ∀ i, κ i → α} : ⨅ (i) (j), f i j = ⊤ ↔ ∀ i j, f i j = ⊤ :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_eq_dif {p : Prop} [Decidable p] (a : p → α) : ⨆ h : p, a h = if h : p then a h else ⊥ :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup₂_comm {ι₁ ι₂ : Sort*} {κ₁ : ι₁ → Sort*} {κ₂ : ι₂ → Sort*} (f : ∀ i₁, κ₁ i₁ → ∀ i₂, κ₂ i₂ → α) : ⨆ (i₁) (j₁) (i₂) (j₂), f i₁ j₁ i₂ j₂ = ⨆ (i₂) (j₂) (i₁) (j₁), f i₁ j₁ i₂ j₂ :=", "area": "Order"} {"task": "t8", "statement": "theorem iInf₂_comm {ι₁ ι₂ : Sort*} {κ₁ : ι₁ → Sort*} {κ₂ : ι₂ → Sort*} (f : ∀ i₁, κ₁ i₁ → ∀ i₂, κ₂ i₂ → α) : ⨅ (i₁) (j₁) (i₂) (j₂), f i₁ j₁ i₂ j₂ = ⨅ (i₂) (j₂) (i₁) (j₁), f i₁ j₁ i₂ j₂ :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_iSup_eq_left {b : β} {f : ∀ x : β, x = b → α} : ⨆ x, ⨆ h : x = b, f x h = f b rfl :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_iSup_eq_right {b : β} {f : ∀ x : β, b = x → α} : ⨆ x, ⨆ h : b = x, f x h = f b rfl :=", "area": "Order"} {"task": "t8", "statement": "theorem biSup_const {ι : Sort _} {a : α} {s : Set ι} (hs : s.Nonempty) : ⨆ i ∈ s, a = a :=", "area": "Order"} {"task": "t8", "statement": "lemma Equiv.biSup_comp {ι ι' : Type*} {g : ι' → α} (e : ι ≃ ι') (s : Set ι') : ⨆ i ∈ e.symm '' s, g (e i) = ⨆ i ∈ s, g i :=", "area": "Order"} {"task": "t8", "statement": "lemma biInf_le {ι : Type*} {s : Set ι} (f : ι → α) {i : ι} (hi : i ∈ s) : ⨅ i ∈ s, f i ≤ f i :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_sup [Nonempty ι] {f : ι → α} {a : α} : (⨆ x, f x) ⊔ a = ⨆ x, f x ⊔ a :=", "area": "Order"} {"task": "t8", "statement": "theorem iInf_inf [Nonempty ι] {f : ι → α} {a : α} : (⨅ x, f x) ⊓ a = ⨅ x, f x ⊓ a :=", "area": "Order"} {"task": "t8", "statement": "theorem sup_iSup [Nonempty ι] {f : ι → α} {a : α} : (a ⊔ ⨆ x, f x) = ⨆ x, a ⊔ f x :=", "area": "Order"} {"task": "t8", "statement": "theorem inf_iInf [Nonempty ι] {f : ι → α} {a : α} : (a ⊓ ⨅ x, f x) = ⨅ x, a ⊓ f x :=", "area": "Order"} {"task": "t8", "statement": "theorem biSup_sup {p : ι → Prop} {f : ∀ i, p i → α} {a : α} (h : ∃ i, p i) : (⨆ (i) (h : p i), f i h) ⊔ a = ⨆ (i) (h : p i), f i h ⊔ a :=", "area": "Order"} {"task": "t8", "statement": "theorem sup_biSup {p : ι → Prop} {f : ∀ i, p i → α} {a : α} (h : ∃ i, p i) : (a ⊔ ⨆ (i) (h : p i), f i h) = ⨆ (i) (h : p i), a ⊔ f i h :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_false {s : False → α} : iSup s = ⊥ :=", "area": "Order"} {"task": "t8", "statement": "theorem iInf_false {s : False → α} : iInf s = ⊤ :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_dite (f : ∀ i, p i → α) (g : ∀ i, ¬p i → α) : ⨆ i, (if h : p i then f i h else g i h) = (⨆ (i) (h : p i), f i h) ⊔ ⨆ (i) (h : ¬p i), g i h :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_range {g : β → α} {f : ι → β} : ⨆ b ∈ range f, g b = ⨆ i, g (f i) :=", "area": "Order"} {"task": "t8", "statement": "theorem sSup_image {s : Set β} {f : β → α} : sSup (f '' s) = ⨆ a ∈ s, f a :=", "area": "Order"} {"task": "t8", "statement": "theorem OrderIso.map_sSup_eq_sSup_symm_preimage [CompleteLattice β] (f : α ≃o β) (s : Set α) : f (sSup s) = sSup (f.symm ⁻¹' s) :=", "area": "Order"} {"task": "t8", "statement": "theorem OrderIso.map_sInf_eq_sInf_symm_preimage [CompleteLattice β] (f : α ≃o β) (s : Set α) : f (sInf s) = sInf (f.symm ⁻¹' s) :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_emptyset {f : β → α} : ⨆ x ∈ (∅ : Set β), f x = ⊥ :=", "area": "Order"} {"task": "t8", "statement": "theorem iInf_emptyset {f : β → α} : ⨅ x ∈ (∅ : Set β), f x = ⊤ :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_univ {f : β → α} : ⨆ x ∈ (univ : Set β), f x = ⨆ x, f x :=", "area": "Order"} {"task": "t8", "statement": "theorem iInf_univ {f : β → α} : ⨅ x ∈ (univ : Set β), f x = ⨅ x, f x :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_union {f : β → α} {s t : Set β} : ⨆ x ∈ s ∪ t, f x = (⨆ x ∈ s, f x) ⊔ ⨆ x ∈ t, f x :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_split (f : β → α) (p : β → Prop) : ⨆ i, f i = (⨆ (i) (_ : p i), f i) ⊔ ⨆ (i) (_ : ¬p i), f i :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_split_single (f : β → α) (i₀ : β) : ⨆ i, f i = f i₀ ⊔ ⨆ (i) (_ : i ≠ i₀), f i :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_singleton {f : β → α} {b : β} : ⨆ x ∈ (singleton b : Set β), f x = f b :=", "area": "Order"} {"task": "t8", "statement": "theorem iInf_singleton {f : β → α} {b : β} : ⨅ x ∈ (singleton b : Set β), f x = f b :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_pair {f : β → α} {a b : β} : ⨆ x ∈ ({a, b} : Set β), f x = f a ⊔ f b :=", "area": "Order"} {"task": "t8", "statement": "theorem iInf_pair {f : β → α} {a b : β} : ⨅ x ∈ ({a, b} : Set β), f x = f a ⊓ f b :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_image {γ} {f : β → γ} {g : γ → α} {t : Set β} : ⨆ c ∈ f '' t, g c = ⨆ b ∈ t, g (f b) :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_extend_bot {e : ι → β} (he : Injective e) (f : ι → α) : ⨆ j, extend e f ⊥ j = ⨆ i, f i :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_bool_eq {f : Bool → α} : ⨆ b : Bool, f b = f true ⊔ f false :=", "area": "Order"} {"task": "t8", "statement": "theorem sup_eq_iSup (x y : α) : x ⊔ y = ⨆ b : Bool, cond b x y :=", "area": "Order"} {"task": "t8", "statement": "theorem isGLB_biInf {s : Set β} {f : β → α} : IsGLB (f '' s) (⨅ x ∈ s, f x) :=", "area": "Order"} {"task": "t8", "statement": "theorem isLUB_biSup {s : Set β} {f : β → α} : IsLUB (f '' s) (⨆ x ∈ s, f x) :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_sigma {p : β → Type*} {f : Sigma p → α} : ⨆ x, f x = ⨆ (i) (j), f ⟨i, j⟩ :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_prod {f : β × γ → α} : ⨆ x, f x = ⨆ (i) (j), f (i, j) :=", "area": "Order"} {"task": "t8", "statement": "theorem biSup_prod {f : β × γ → α} {s : Set β} {t : Set γ} : ⨆ x ∈ s ×ˢ t, f x = ⨆ (a ∈ s) (b ∈ t), f (a, b) :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_sum {f : Sum β γ → α} : ⨆ x, f x = (⨆ i, f (Sum.inl i)) ⊔ ⨆ j, f (Sum.inr j) :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_option (f : Option β → α) : ⨆ o, f o = f none ⊔ ⨆ b, f (Option.some b) :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_option_elim (a : α) (f : β → α) : ⨆ o : Option β, o.elim a f = a ⊔ ⨆ b, f b :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_ne_bot_subtype (f : ι → α) : ⨆ i : { i // f i ≠ ⊥ }, f i = ⨆ i, f i :=", "area": "Order"} {"task": "t8", "statement": "theorem sSup_image2 {f : β → γ → α} {s : Set β} {t : Set γ} : sSup (image2 f s t) = ⨆ (a ∈ s) (b ∈ t), f a b :=", "area": "Order"} {"task": "t8", "statement": "theorem sInf_image2 {f : β → γ → α} {s : Set β} {t : Set γ} : sInf (image2 f s t) = ⨅ (a ∈ s) (b ∈ t), f a b :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_ge_eq_iSup_nat_add (u : ℕ → α) (n : ℕ) : ⨆ i ≥ n, u i = ⨆ i, u (i + n) :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_iInf_ge_nat_add (f : ℕ → α) (k : ℕ) : ⨆ n, ⨅ i ≥ n, f (i + k) = ⨆ n, ⨅ i ≥ n, f i :=", "area": "Order"} {"task": "t8", "statement": "theorem sup_iSup_nat_succ (u : ℕ → α) : (u 0 ⊔ ⨆ i, u (i + 1)) = ⨆ i, u i :=", "area": "Order"} {"task": "t8", "statement": "theorem iInf_nat_gt_zero_eq (f : ℕ → α) : ⨅ i > 0, f i = ⨅ i, f (i + 1) :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_eq_top (f : ι → α) : iSup f = ⊤ ↔ ∀ b < ⊤, ∃ i, b < f i :=", "area": "Order"} {"task": "t8", "statement": "theorem iInf_eq_bot (f : ι → α) : iInf f = ⊥ ↔ ∀ b > ⊥, ∃ i, f i < b :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_apply {α : Type*} {β : α → Type*} {ι : Sort*} [∀ i, SupSet (β i)] {f : ι → ∀ a, β a} {a : α} : (⨆ i, f i) a = ⨆ i, f i a :=", "area": "Order"} {"task": "t8", "statement": "theorem unary_relation_sSup_iff {α : Type*} (s : Set (α → Prop)) {a : α} : sSup s a ↔ ∃ r : α → Prop, r ∈ s ∧ r a :=", "area": "Order"} {"task": "t8", "statement": "theorem unary_relation_sInf_iff {α : Type*} (s : Set (α → Prop)) {a : α} : sInf s a ↔ ∀ r : α → Prop, r ∈ s → r a :=", "area": "Order"} {"task": "t8", "statement": "theorem binary_relation_sSup_iff {α β : Type*} (s : Set (α → β → Prop)) {a : α} {b : β} : sSup s a b ↔ ∃ r : α → β → Prop, r ∈ s ∧ r a b :=", "area": "Order"} {"task": "t8", "statement": "theorem binary_relation_sInf_iff {α β : Type*} (s : Set (α → β → Prop)) {a : α} {b : β} : sInf s a b ↔ ∀ r : α → β → Prop, r ∈ s → r a b :=", "area": "Order"} {"task": "t8", "statement": "theorem swap_iInf [InfSet α] [InfSet β] (f : ι → α × β) : (iInf f).swap = ⨅ i, (f i).swap :=", "area": "Order"} {"task": "t8", "statement": "theorem swap_iSup [SupSet α] [SupSet β] (f : ι → α × β) : (iSup f).swap = ⨆ i, (f i).swap :=", "area": "Order"} {"task": "t8", "statement": "theorem unbounded_le_iff [LinearOrder α] : Unbounded (· ≤ ·) s ↔ ∀ a, ∃ b ∈ s, a < b :=", "area": "Order"} {"task": "t8", "statement": "theorem unbounded_lt_iff [LinearOrder α] : Unbounded (· < ·) s ↔ ∀ a, ∃ b ∈ s, a ≤ b :=", "area": "Order"} {"task": "t8", "statement": "theorem bounded_le_iff_bounded_lt [Preorder α] [NoMaxOrder α] : Bounded (· ≤ ·) s ↔ Bounded (· < ·) s :=", "area": "Order"} {"task": "t8", "statement": "theorem unbounded_lt_iff_unbounded_le [Preorder α] [NoMaxOrder α] : Unbounded (· < ·) s ↔ Unbounded (· ≤ ·) s :=", "area": "Order"} {"task": "t8", "statement": "theorem bounded_lt_Iic [Preorder α] [NoMaxOrder α] (a : α) : Bounded (· < ·) (Iic a) :=", "area": "Order"} {"task": "t8", "statement": "theorem bounded_gt_Ici [Preorder α] [NoMinOrder α] (a : α) : Bounded (· > ·) (Ici a) :=", "area": "Order"} {"task": "t8", "statement": "theorem bounded_inter_not (H : ∀ a b, ∃ m, ∀ c, r c a ∨ r c b → r c m) (a : α) : Bounded r (s ∩ { b | ¬r b a }) ↔ Bounded r s :=", "area": "Order"} {"task": "t8", "statement": "theorem unbounded_inter_not (H : ∀ a b, ∃ m, ∀ c, r c a ∨ r c b → r c m) (a : α) : Unbounded r (s ∩ { b | ¬r b a }) ↔ Unbounded r s :=", "area": "Order"} {"task": "t8", "statement": "theorem unbounded_le_inter_not_le [SemilatticeSup α] (a : α) : Unbounded (· ≤ ·) (s ∩ { b | ¬b ≤ a }) ↔ Unbounded (· ≤ ·) s :=", "area": "Order"} {"task": "t8", "statement": "theorem bounded_le_inter_lt [LinearOrder α] (a : α) : Bounded (· ≤ ·) (s ∩ { b | a < b }) ↔ Bounded (· ≤ ·) s :=", "area": "Order"} {"task": "t8", "statement": "theorem unbounded_le_inter_lt [LinearOrder α] (a : α) : Unbounded (· ≤ ·) (s ∩ { b | a < b }) ↔ Unbounded (· ≤ ·) s :=", "area": "Order"} {"task": "t8", "statement": "theorem bounded_le_inter_le [LinearOrder α] (a : α) : Bounded (· ≤ ·) (s ∩ { b | a ≤ b }) ↔ Bounded (· ≤ ·) s :=", "area": "Order"} {"task": "t8", "statement": "theorem unbounded_le_inter_le [LinearOrder α] (a : α) : Unbounded (· ≤ ·) (s ∩ { b | a ≤ b }) ↔ Unbounded (· ≤ ·) s :=", "area": "Order"} {"task": "t8", "statement": "theorem unbounded_lt_inter_not_lt [SemilatticeSup α] (a : α) : Unbounded (· < ·) (s ∩ { b | ¬b < a }) ↔ Unbounded (· < ·) s :=", "area": "Order"} {"task": "t8", "statement": "theorem bounded_lt_inter_le [LinearOrder α] (a : α) : Bounded (· < ·) (s ∩ { b | a ≤ b }) ↔ Bounded (· < ·) s :=", "area": "Order"} {"task": "t8", "statement": "theorem unbounded_lt_inter_le [LinearOrder α] (a : α) : Unbounded (· < ·) (s ∩ { b | a ≤ b }) ↔ Unbounded (· < ·) s :=", "area": "Order"} {"task": "t8", "statement": "theorem bounded_lt_inter_lt [LinearOrder α] [NoMaxOrder α] (a : α) : Bounded (· < ·) (s ∩ { b | a < b }) ↔ Bounded (· < ·) s :=", "area": "Order"} {"task": "t8", "statement": "theorem unbounded_lt_inter_lt [LinearOrder α] [NoMaxOrder α] (a : α) : Unbounded (· < ·) (s ∩ { b | a < b }) ↔ Unbounded (· < ·) s :=", "area": "Order"} {"task": "t8", "statement": "theorem rev_last_eq_bot (n : ℕ) : rev (last n) = ⊥ :=", "area": "Order"} {"task": "t8", "statement": "lemma predAbove_right_monotone (p : Fin n) : Monotone p.predAbove :=", "area": "Order"} {"task": "t8", "statement": "lemma predAbove_left_monotone (i : Fin (n + 1)) : Monotone fun p ↦ predAbove p i :=", "area": "Order"} {"task": "t8", "statement": "@[simp] lemma symm_castOrderIso (h : n = m) : (castOrderIso h).symm = castOrderIso h.symm :=", "area": "Order"} {"task": "t8", "statement": "@[simp] lemma castOrderIso_refl (h : n = n := rfl) : castOrderIso h = OrderIso.refl (Fin n) :=", "area": "Order"} {"task": "t8", "statement": "lemma castOrderIso_toEquiv (h : n = m) : (castOrderIso h).toEquiv = Equiv.cast (h ▸ rfl) :=", "area": "Order"} {"task": "t8", "statement": "@[simp] lemma coe_orderIso_apply (e : Fin n ≃o Fin m) (i : Fin n) : (e i : ℕ) = i :=", "area": "Order"} {"task": "t8", "statement": "theorem map_iSup [SupSet α] [SupSet β] [sSupHomClass F α β] (f : F) (g : ι → α) : f (⨆ i, g i) = ⨆ i, f (g i) :=", "area": "Order"} {"task": "t8", "statement": "theorem map_iSup₂ [SupSet α] [SupSet β] [sSupHomClass F α β] (f : F) (g : ∀ i, κ i → α) : f (⨆ (i) (j), g i j) = ⨆ (i) (j), f (g i j) :=", "area": "Order"} {"task": "t8", "statement": "theorem map_iInf [InfSet α] [InfSet β] [sInfHomClass F α β] (f : F) (g : ι → α) : f (⨅ i, g i) = ⨅ i, f (g i) :=", "area": "Order"} {"task": "t8", "statement": "theorem map_iInf₂ [InfSet α] [InfSet β] [sInfHomClass F α β] (f : F) (g : ∀ i, κ i → α) : f (⨅ (i) (j), g i j) = ⨅ (i) (j), f (g i j) :=", "area": "Order"} {"task": "t8", "statement": "theorem cancel_left {g : sSupHom β γ} {f₁ f₂ : sSupHom α β} (hg : Injective g) : g.comp f₁ = g.comp f₂ ↔ f₁ = f₂ :=", "area": "Order"} {"task": "t8", "statement": "theorem cancel_left {g : sInfHom β γ} {f₁ f₂ : sInfHom α β} (hg : Injective g) : g.comp f₁ = g.comp f₂ ↔ f₁ = f₂ :=", "area": "Order"} {"task": "t8", "statement": "theorem cancel_left {g : FrameHom β γ} {f₁ f₂ : FrameHom α β} (hg : Injective g) : g.comp f₁ = g.comp f₂ ↔ f₁ = f₂ :=", "area": "Order"} {"task": "t8", "statement": "theorem cancel_left {g : CompleteLatticeHom β γ} {f₁ f₂ : CompleteLatticeHom α β} (hg : Injective g) : g.comp f₁ = g.comp f₂ ↔ f₁ = f₂ :=", "area": "Order"} {"task": "t8", "statement": "theorem toProd_injective : Injective (toProd : NonemptyInterval α → α × α) :=", "area": "Order"} {"task": "t8", "statement": "theorem mem_pure : b ∈ pure a ↔ b = a :=", "area": "Order"} {"task": "t8", "statement": "theorem dual_map (f : α →o β) (s : Interval α) : dual (s.map f) = s.dual.map (OrderHom.dual f) :=", "area": "Order"} {"task": "t8", "statement": "theorem coe_dual (s : Interval α) : (dual s : Set αᵒᵈ) = ofDual ⁻¹' s :=", "area": "Order"} {"task": "t8", "statement": "theorem subset_coe_map (f : α →o β) : ∀ s : Interval α, f '' s ⊆ s.map f", "area": "Order"} {"task": "t8", "statement": "theorem coe_inf : ∀ s t : Interval α, (↑(s ⊓ t) : Set α) = ↑s ∩ ↑t", "area": "Order"} {"task": "t8", "statement": "theorem disjoint_coe (s t : Interval α) : Disjoint (s : Set α) t ↔ Disjoint s t :=", "area": "Order"} {"task": "t8", "statement": "theorem coe_eq_pure : (s : Interval α) = Interval.pure a ↔ s = pure a :=", "area": "Order"} {"task": "t8", "statement": "theorem coe_sInf [@DecidableRel α (· ≤ ·)] (S : Set (Interval α)) : ↑(sInf S) = ⋂ s ∈ S, (s : Set α) :=", "area": "Order"} {"task": "t8", "statement": "theorem coe_iInf [@DecidableRel α (· ≤ ·)] (f : ι → Interval α) : ↑(⨅ i, f i) = ⋂ i, (f i : Set α) :=", "area": "Order"} {"task": "t8", "statement": "theorem coe_iInf₂ [@DecidableRel α (· ≤ ·)] (f : ∀ i, κ i → Interval α) : ↑(⨅ (i) (j), f i j) = ⋂ (i) (j), (f i j : Set α) :=", "area": "Order"} {"task": "t8", "statement": "private lemma aux (x : α) (p : α → Prop) : (∃ a : α, p a ∧ WithTop.some a = WithTop.some x) ↔ p x :=", "area": "Order"} {"task": "t8", "statement": "theorem map_subtype_embedding_Icc : (Icc a b).map (Embedding.subtype p) = (Icc a b : Finset α) :=", "area": "Order"} {"task": "t8", "statement": "theorem map_subtype_embedding_Ico : (Ico a b).map (Embedding.subtype p) = (Ico a b : Finset α) :=", "area": "Order"} {"task": "t8", "statement": "theorem map_subtype_embedding_Ioc : (Ioc a b).map (Embedding.subtype p) = (Ioc a b : Finset α) :=", "area": "Order"} {"task": "t8", "statement": "theorem map_subtype_embedding_Ioo : (Ioo a b).map (Embedding.subtype p) = (Ioo a b : Finset α) :=", "area": "Order"} {"task": "t8", "statement": "theorem map_subtype_embedding_Ici : (Ici a).map (Embedding.subtype p) = (Ici a : Finset α) :=", "area": "Order"} {"task": "t8", "statement": "theorem map_subtype_embedding_Ioi : (Ioi a).map (Embedding.subtype p) = (Ioi a : Finset α) :=", "area": "Order"} {"task": "t8", "statement": "theorem map_subtype_embedding_Iic : (Iic a).map (Embedding.subtype p) = (Iic a : Finset α) :=", "area": "Order"} {"task": "t8", "statement": "theorem map_subtype_embedding_Iio : (Iio a).map (Embedding.subtype p) = (Iio a : Finset α) :=", "area": "Order"} {"task": "t8", "statement": "theorem Set.finite_iff_bddBelow_bddAbove [Nonempty α] [Lattice α] [LocallyFiniteOrder α] : s.Finite ↔ BddBelow s ∧ BddAbove s :=", "area": "Order"} {"task": "t8", "statement": "@[simp] lemma toFinset_Icc (a b : α) [Fintype (Icc a b)] : (Icc a b).toFinset = Finset.Icc a b :=", "area": "Order"} {"task": "t8", "statement": "@[simp] lemma toFinset_Ico (a b : α) [Fintype (Ico a b)] : (Ico a b).toFinset = Finset.Ico a b :=", "area": "Order"} {"task": "t8", "statement": "@[simp] lemma toFinset_Ioc (a b : α) [Fintype (Ioc a b)] : (Ioc a b).toFinset = Finset.Ioc a b :=", "area": "Order"} {"task": "t8", "statement": "@[simp] lemma toFinset_Ioo (a b : α) [Fintype (Ioo a b)] : (Ioo a b).toFinset = Finset.Ioo a b :=", "area": "Order"} {"task": "t8", "statement": "@[simp] lemma toFinset_Ici (a : α) [Fintype (Ici a)] : (Ici a).toFinset = Finset.Ici a :=", "area": "Order"} {"task": "t8", "statement": "@[simp] lemma toFinset_Ioi (a : α) [Fintype (Ioi a)] : (Ioi a).toFinset = Finset.Ioi a :=", "area": "Order"} {"task": "t8", "statement": "@[simp] lemma toFinset_Iic (a : α) [Fintype (Iic a)] : (Iic a).toFinset = Finset.Iic a :=", "area": "Order"} {"task": "t8", "statement": "@[simp] lemma toFinset_Iio (a : α) [Fintype (Iio a)] : (Iio a).toFinset = Finset.Iio a :=", "area": "Order"} {"task": "t8", "statement": "private lemma Icc_neg_mono : Monotone fun n : ℕ ↦ Icc (-n : α) n :=", "area": "Order"} {"task": "t8", "statement": "@[simp] lemma box_zero : (box 0 : Finset α) = {0} :=", "area": "Order"} {"task": "t8", "statement": "lemma disjoint_box_succ_prod (n : ℕ) : Disjoint (box (n + 1)) (Icc (-n : α) n) :=", "area": "Order"} {"task": "t8", "statement": "lemma box_succ_disjUnion (n : ℕ) : (box (n + 1)).disjUnion (Icc (-n : α) n) (disjoint_box_succ_prod _) = Icc (-n.succ : α) n.succ :=", "area": "Order"} {"task": "t8", "statement": "@[simp] lemma zero_mem_box : (0 : α) ∈ box n ↔ n = 0 :=", "area": "Order"} {"task": "t8", "statement": "lemma eq_zero_iff_eq_zero_of_mem_box {x : α} (hx : x ∈ box n) : x = 0 ↔ n = 0 :=", "area": "Order"} {"task": "t8", "statement": "@[simp] lemma card_box_succ (n : ℕ) : (box (n + 1) : Finset (α × β)).card = (Icc (-n.succ : α) n.succ).card * (Icc (-n.succ : β) n.succ).card - (Icc (-n : α) n).card * (Icc (-n : β) n).card :=", "area": "Order"} {"task": "t8", "statement": "lemma card_box : ∀ {n}, n ≠ 0 → (box n : Finset (ℤ × ℤ)).card = 8 * n", "area": "Order"} {"task": "t8", "statement": "@[simp] lemma mem_box : ∀ {n}, x ∈ box n ↔ max x.1.natAbs x.2.natAbs = n", "area": "Order"} {"task": "t8", "statement": "lemma existsUnique_mem_box (x : ℤ × ℤ) : ∃! n : ℕ, x ∈ box n :=", "area": "Order"} {"task": "t8", "statement": "lemma MonotoneOn.mapsTo_Ici (h : MonotoneOn f (Ici a)) : MapsTo f (Ici a) (Ici (f a)) :=", "area": "Order"} {"task": "t8", "statement": "lemma MonotoneOn.mapsTo_Iic (h : MonotoneOn f (Iic b)) : MapsTo f (Iic b) (Iic (f b)) :=", "area": "Order"} {"task": "t8", "statement": "lemma AntitoneOn.mapsTo_Ici (h : AntitoneOn f (Ici a)) : MapsTo f (Ici a) (Iic (f a)) :=", "area": "Order"} {"task": "t8", "statement": "lemma AntitoneOn.mapsTo_Iic (h : AntitoneOn f (Iic b)) : MapsTo f (Iic b) (Ici (f b)) :=", "area": "Order"} {"task": "t8", "statement": "private lemma image_subtype_val_Ixx_Ixi {p q r : α → α → Prop} {a b : α} (c : {x // p a x ∧ q x b}) (h : ∀ {x}, r c x → p a x) : Subtype.val '' {y : {x // p a x ∧ q x b} | r c.1 y.1} = {y : α | r c.1 y ∧ q y b} :=", "area": "Order"} {"task": "t8", "statement": "private lemma image_subtype_val_Ixx_Iix {p q r : α → α → Prop} {a b : α} (c : {x // p a x ∧ q x b}) (h : ∀ {x}, r x c → q x b) : Subtype.val '' {y : {x // p a x ∧ q x b} | r y.1 c.1} = {y : α | p a y ∧ r y c.1} :=", "area": "Order"} {"task": "t8", "statement": "theorem left_mem_Ioo : a ∈ Ioo a b ↔ False :=", "area": "Order"} {"task": "t8", "statement": "theorem left_mem_Ico : a ∈ Ico a b ↔ a < b :=", "area": "Order"} {"task": "t8", "statement": "theorem left_mem_Icc : a ∈ Icc a b ↔ a ≤ b :=", "area": "Order"} {"task": "t8", "statement": "theorem left_mem_Ioc : a ∈ Ioc a b ↔ False :=", "area": "Order"} {"task": "t8", "statement": "theorem left_mem_Ici : a ∈ Ici a :=", "area": "Order"} {"task": "t8", "statement": "theorem right_mem_Ioo : b ∈ Ioo a b ↔ False :=", "area": "Order"} {"task": "t8", "statement": "theorem right_mem_Ico : b ∈ Ico a b ↔ False :=", "area": "Order"} {"task": "t8", "statement": "theorem right_mem_Icc : b ∈ Icc a b ↔ a ≤ b :=", "area": "Order"} {"task": "t8", "statement": "theorem right_mem_Ioc : b ∈ Ioc a b ↔ a < b :=", "area": "Order"} {"task": "t8", "statement": "theorem right_mem_Iic : a ∈ Iic a :=", "area": "Order"} {"task": "t8", "statement": "theorem Icc_eq_empty_iff : Icc a b = ∅ ↔ ¬a ≤ b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ico_eq_empty_iff : Ico a b = ∅ ↔ ¬a < b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioc_eq_empty_iff : Ioc a b = ∅ ↔ ¬a < b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioo_eq_empty_iff [DenselyOrdered α] : Ioo a b = ∅ ↔ ¬a < b :=", "area": "Order"} {"task": "t8", "statement": "theorem Icc_self (a : α) : Icc a a = {a} :=", "area": "Order"} {"task": "t8", "statement": "theorem Icc_eq_singleton_iff : Icc a b = {c} ↔ a = c ∧ b = c :=", "area": "Order"} {"task": "t8", "statement": "@[simp] lemma subsingleton_Icc_iff {α : Type*} [LinearOrder α] {a b : α} : Set.Subsingleton (Icc a b) ↔ b ≤ a :=", "area": "Order"} {"task": "t8", "statement": "theorem Icc_diff_left : Icc a b \\ {a} = Ioc a b :=", "area": "Order"} {"task": "t8", "statement": "theorem Icc_diff_right : Icc a b \\ {b} = Ico a b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ico_diff_left : Ico a b \\ {a} = Ioo a b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioc_diff_right : Ioc a b \\ {b} = Ioo a b :=", "area": "Order"} {"task": "t8", "statement": "theorem Icc_diff_both : Icc a b \\ {a, b} = Ioo a b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ici_diff_left : Ici a \\ {a} = Ioi a :=", "area": "Order"} {"task": "t8", "statement": "theorem Iic_diff_right : Iic a \\ {a} = Iio a :=", "area": "Order"} {"task": "t8", "statement": "theorem Ico_diff_Ioo_same (h : a < b) : Ico a b \\ Ioo a b = {a} :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioc_diff_Ioo_same (h : a < b) : Ioc a b \\ Ioo a b = {b} :=", "area": "Order"} {"task": "t8", "statement": "theorem Icc_diff_Ico_same (h : a ≤ b) : Icc a b \\ Ico a b = {b} :=", "area": "Order"} {"task": "t8", "statement": "theorem Icc_diff_Ioc_same (h : a ≤ b) : Icc a b \\ Ioc a b = {a} :=", "area": "Order"} {"task": "t8", "statement": "theorem Icc_diff_Ioo_same (h : a ≤ b) : Icc a b \\ Ioo a b = {a, b} :=", "area": "Order"} {"task": "t8", "statement": "theorem Ici_diff_Ioi_same : Ici a \\ Ioi a = {a} :=", "area": "Order"} {"task": "t8", "statement": "theorem Iic_diff_Iio_same : Iic a \\ Iio a = {a} :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioi_union_left : Ioi a ∪ {a} = Ici a :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioo_union_left (hab : a < b) : Ioo a b ∪ {a} = Ico a b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioo_union_right (hab : a < b) : Ioo a b ∪ {b} = Ioc a b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioo_union_both (h : a ≤ b) : Ioo a b ∪ {a, b} = Icc a b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioc_union_left (hab : a ≤ b) : Ioc a b ∪ {a} = Icc a b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ico_union_right (hab : a ≤ b) : Ico a b ∪ {b} = Icc a b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ico_insert_right (h : a ≤ b) : insert b (Ico a b) = Icc a b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioc_insert_left (h : a ≤ b) : insert a (Ioc a b) = Icc a b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioo_insert_left (h : a < b) : insert a (Ioo a b) = Ico a b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioo_insert_right (h : a < b) : insert b (Ioo a b) = Ioc a b :=", "area": "Order"} {"task": "t8", "statement": "theorem mem_Ici_Ioi_of_subset_of_subset {s : Set α} (ho : Ioi a ⊆ s) (hc : s ⊆ Ici a) : s ∈ ({Ici a, Ioi a} : Set (Set α)) :=", "area": "Order"} {"task": "t8", "statement": "theorem mem_Icc_Ico_Ioc_Ioo_of_subset_of_subset {s : Set α} (ho : Ioo a b ⊆ s) (hc : s ⊆ Icc a b) : s ∈ ({Icc a b, Ico a b, Ioc a b, Ioo a b} : Set (Set α)) :=", "area": "Order"} {"task": "t8", "statement": "theorem Icc_top : Icc a ⊤ = Ici a :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioc_top : Ioc a ⊤ = Ioi a :=", "area": "Order"} {"task": "t8", "statement": "theorem Icc_bot : Icc ⊥ a = Iic a :=", "area": "Order"} {"task": "t8", "statement": "theorem Ico_bot : Ico ⊥ a = Iio a :=", "area": "Order"} {"task": "t8", "statement": "theorem Icc_bot_top [PartialOrder α] [BoundedOrder α] : Icc (⊥ : α) ⊤ = univ :=", "area": "Order"} {"task": "t8", "statement": "theorem Ici_diff_Ici : Ici a \\ Ici b = Ico a b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ici_diff_Ioi : Ici a \\ Ioi b = Icc a b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioi_diff_Ioi : Ioi a \\ Ioi b = Ioc a b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioi_diff_Ici : Ioi a \\ Ici b = Ioo a b :=", "area": "Order"} {"task": "t8", "statement": "theorem Iic_diff_Iic : Iic b \\ Iic a = Ioc a b :=", "area": "Order"} {"task": "t8", "statement": "theorem Iio_diff_Iic : Iio b \\ Iic a = Ioo a b :=", "area": "Order"} {"task": "t8", "statement": "theorem Iic_diff_Iio : Iic b \\ Iio a = Icc a b :=", "area": "Order"} {"task": "t8", "statement": "theorem Iio_diff_Iio : Iio b \\ Iio a = Ico a b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioc_subset_Ioc_iff (h₁ : a₁ < b₁) : Ioc a₁ b₁ ⊆ Ioc a₂ b₂ ↔ b₁ ≤ b₂ ∧ a₂ ≤ a₁ :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioo_subset_Ioo_iff [DenselyOrdered α] (h₁ : a₁ < b₁) : Ioo a₁ b₁ ⊆ Ioo a₂ b₂ ↔ a₂ ≤ a₁ ∧ b₁ ≤ b₂ :=", "area": "Order"} {"task": "t8", "statement": "theorem Ico_eq_Ico_iff (h : a₁ < b₁ ∨ a₂ < b₂) : Ico a₁ b₁ = Ico a₂ b₂ ↔ a₁ = a₂ ∧ b₁ = b₂ :=", "area": "Order"} {"task": "t8", "statement": "lemma Ici_eq_singleton_iff_isTop {x : α} : (Ici x = {x}) ↔ IsTop x :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioi_subset_Ioi_iff : Ioi b ⊆ Ioi a ↔ a ≤ b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioi_subset_Ici_iff [DenselyOrdered α] : Ioi b ⊆ Ici a ↔ a ≤ b :=", "area": "Order"} {"task": "t8", "statement": "theorem Iio_subset_Iio_iff : Iio a ⊆ Iio b ↔ a ≤ b :=", "area": "Order"} {"task": "t8", "statement": "theorem Iio_subset_Iic_iff [DenselyOrdered α] : Iio a ⊆ Iic b ↔ a ≤ b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioo_union_Ioi' (h₁ : c < b) : Ioo a b ∪ Ioi c = Ioi (min a c) :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioo_union_Ioi (h : c < max a b) : Ioo a b ∪ Ioi c = Ioi (min a c) :=", "area": "Order"} {"task": "t8", "statement": "theorem Ico_union_Ici' (h₁ : c ≤ b) : Ico a b ∪ Ici c = Ici (min a c) :=", "area": "Order"} {"task": "t8", "statement": "theorem Ico_union_Ici (h : c ≤ max a b) : Ico a b ∪ Ici c = Ici (min a c) :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioc_union_Ioi' (h₁ : c ≤ b) : Ioc a b ∪ Ioi c = Ioi (min a c) :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioc_union_Ioi (h : c ≤ max a b) : Ioc a b ∪ Ioi c = Ioi (min a c) :=", "area": "Order"} {"task": "t8", "statement": "theorem Icc_union_Ici' (h₁ : c ≤ b) : Icc a b ∪ Ici c = Ici (min a c) :=", "area": "Order"} {"task": "t8", "statement": "theorem Icc_union_Ici (h : c ≤ max a b) : Icc a b ∪ Ici c = Ici (min a c) :=", "area": "Order"} {"task": "t8", "statement": "theorem Iio_union_Ico' (h₁ : c ≤ b) : Iio b ∪ Ico c d = Iio (max b d) :=", "area": "Order"} {"task": "t8", "statement": "theorem Iio_union_Ico (h : min c d ≤ b) : Iio b ∪ Ico c d = Iio (max b d) :=", "area": "Order"} {"task": "t8", "statement": "theorem Iic_union_Ioc' (h₁ : c < b) : Iic b ∪ Ioc c d = Iic (max b d) :=", "area": "Order"} {"task": "t8", "statement": "theorem Iic_union_Ioc (h : min c d < b) : Iic b ∪ Ioc c d = Iic (max b d) :=", "area": "Order"} {"task": "t8", "statement": "theorem Iio_union_Ioo' (h₁ : c < b) : Iio b ∪ Ioo c d = Iio (max b d) :=", "area": "Order"} {"task": "t8", "statement": "theorem Iio_union_Ioo (h : min c d < b) : Iio b ∪ Ioo c d = Iio (max b d) :=", "area": "Order"} {"task": "t8", "statement": "theorem Iic_union_Icc' (h₁ : c ≤ b) : Iic b ∪ Icc c d = Iic (max b d) :=", "area": "Order"} {"task": "t8", "statement": "theorem Iic_union_Icc (h : min c d ≤ b) : Iic b ∪ Icc c d = Iic (max b d) :=", "area": "Order"} {"task": "t8", "statement": "theorem Ico_union_Ico' (h₁ : c ≤ b) (h₂ : a ≤ d) : Ico a b ∪ Ico c d = Ico (min a c) (max b d) :=", "area": "Order"} {"task": "t8", "statement": "theorem Ico_union_Ico (h₁ : min a b ≤ max c d) (h₂ : min c d ≤ max a b) : Ico a b ∪ Ico c d = Ico (min a c) (max b d) :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioc_union_Ioc' (h₁ : c ≤ b) (h₂ : a ≤ d) : Ioc a b ∪ Ioc c d = Ioc (min a c) (max b d) :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioc_union_Ioc (h₁ : min a b ≤ max c d) (h₂ : min c d ≤ max a b) : Ioc a b ∪ Ioc c d = Ioc (min a c) (max b d) :=", "area": "Order"} {"task": "t8", "statement": "theorem Icc_union_Icc' (h₁ : c ≤ b) (h₂ : a ≤ d) : Icc a b ∪ Icc c d = Icc (min a c) (max b d) :=", "area": "Order"} {"task": "t8", "statement": "theorem Icc_union_Icc (h₁ : min a b < max c d) (h₂ : min c d < max a b) : Icc a b ∪ Icc c d = Icc (min a c) (max b d) :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioo_union_Ioo' (h₁ : c < b) (h₂ : a < d) : Ioo a b ∪ Ioo c d = Ioo (min a c) (max b d) :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioo_union_Ioo (h₁ : min a b < max c d) (h₂ : min c d < max a b) : Ioo a b ∪ Ioo c d = Ioo (min a c) (max b d) :=", "area": "Order"} {"task": "t8", "statement": "theorem Iic_inter_Iic {a b : α} : Iic a ∩ Iic b = Iic (a ⊓ b) :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioc_inter_Iic (a b c : α) : Ioc a b ∩ Iic c = Ioc a (b ⊓ c) :=", "area": "Order"} {"task": "t8", "statement": "theorem Ici_inter_Ici {a b : α} : Ici a ∩ Ici b = Ici (a ⊔ b) :=", "area": "Order"} {"task": "t8", "statement": "theorem Ico_inter_Ici (a b c : α) : Ico a b ∩ Ici c = Ico (a ⊔ c) b :=", "area": "Order"} {"task": "t8", "statement": "theorem Icc_inter_Icc : Icc a₁ b₁ ∩ Icc a₂ b₂ = Icc (a₁ ⊔ a₂) (b₁ ⊓ b₂) :=", "area": "Order"} {"task": "t8", "statement": "theorem Icc_inter_Icc_eq_singleton (hab : a ≤ b) (hbc : b ≤ c) : Icc a b ∩ Icc b c = {b} :=", "area": "Order"} {"task": "t8", "statement": "theorem Ico_inter_Ico : Ico a₁ b₁ ∩ Ico a₂ b₂ = Ico (a₁ ⊔ a₂) (b₁ ⊓ b₂) :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioc_inter_Ioc : Ioc a₁ b₁ ∩ Ioc a₂ b₂ = Ioc (a₁ ⊔ a₂) (b₁ ⊓ b₂) :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioo_inter_Ioo : Ioo a₁ b₁ ∩ Ioo a₂ b₂ = Ioo (a₁ ⊔ a₂) (b₁ ⊓ b₂) :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioo_inter_Iio : Ioo a b ∩ Iio c = Ioo a (min b c) :=", "area": "Order"} {"task": "t8", "statement": "theorem Iio_inter_Ioo : Iio a ∩ Ioo b c = Ioo b (min a c) :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioo_inter_Ioi : Ioo a b ∩ Ioi c = Ioo (max a c) b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioi_inter_Ioo : Set.Ioi a ∩ Set.Ioo b c = Set.Ioo (max a b) c :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioc_inter_Ioo_of_left_lt (h : b₁ < b₂) : Ioc a₁ b₁ ∩ Ioo a₂ b₂ = Ioc (max a₁ a₂) b₁ :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioc_inter_Ioo_of_right_le (h : b₂ ≤ b₁) : Ioc a₁ b₁ ∩ Ioo a₂ b₂ = Ioo (max a₁ a₂) b₂ :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioo_inter_Ioc_of_left_le (h : b₁ ≤ b₂) : Ioo a₁ b₁ ∩ Ioc a₂ b₂ = Ioo (max a₁ a₂) b₁ :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioo_inter_Ioc_of_right_lt (h : b₂ < b₁) : Ioo a₁ b₁ ∩ Ioc a₂ b₂ = Ioc (max a₁ a₂) b₂ :=", "area": "Order"} {"task": "t8", "statement": "theorem Ico_diff_Iio : Ico a b \\ Iio c = Ico (max a c) b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioc_diff_Ioi : Ioc a b \\ Ioi c = Ioc a (min b c) :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioc_inter_Ioi : Ioc a b ∩ Ioi c = Ioc (a ⊔ c) b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ico_inter_Iio : Ico a b ∩ Iio c = Ico a (min b c) :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioc_diff_Iic : Ioc a b \\ Iic c = Ioc (max a c) b :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioc_union_Ioc_right : Ioc a b ∪ Ioc a c = Ioc a (max b c) :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioc_union_Ioc_left : Ioc a c ∪ Ioc b c = Ioc (min a b) c :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioc_union_Ioc_symm : Ioc a b ∪ Ioc b a = Ioc (min a b) (max a b) :=", "area": "Order"} {"task": "t8", "statement": "theorem Ioc_union_Ioc_union_Ioc_cycle : Ioc a b ∪ Ioc b c ∪ Ioc c a = Ioc (min a (min b c)) (max a (max b c)) :=", "area": "Order"} {"task": "t8", "statement": "theorem Icc_prod_Icc (a₁ a₂ : α) (b₁ b₂ : β) : Icc a₁ a₂ ×ˢ Icc b₁ b₂ = Icc (a₁, b₁) (a₂, b₂) :=", "area": "Order"} {"task": "t8", "statement": "theorem Icc_prod_eq (a b : α × β) : Icc a b = Icc a.1 b.1 ×ˢ Icc a.2 b.2 :=", "area": "Order"} {"task": "t8", "statement": "theorem map_prod_eq_map₂ (m : α → β → γ) (f : Filter α) (g : Filter β) : Filter.map (fun p : α × β => m p.1 p.2) (f ×ˢ g) = map₂ m f g :=", "area": "Order"} {"task": "t8", "statement": "theorem map₂_mk_eq_prod (f : Filter α) (g : Filter β) : map₂ Prod.mk f g = f ×ˢ g :=", "area": "Order"} {"task": "t8", "statement": "theorem map₂_eq_bot_iff : map₂ m f g = ⊥ ↔ f = ⊥ ∨ g = ⊥ :=", "area": "Order"} {"task": "t8", "statement": "theorem map₂_neBot_iff : (map₂ m f g).NeBot ↔ f.NeBot ∧ g.NeBot :=", "area": "Order"} {"task": "t8", "statement": "theorem map₂_sup_left : map₂ m (f₁ ⊔ f₂) g = map₂ m f₁ g ⊔ map₂ m f₂ g :=", "area": "Order"} {"task": "t8", "statement": "theorem map₂_sup_right : map₂ m f (g₁ ⊔ g₂) = map₂ m f g₁ ⊔ map₂ m f g₂ :=", "area": "Order"} {"task": "t8", "statement": "theorem map₂_pure_left : map₂ m (pure a) g = g.map (m a) :=", "area": "Order"} {"task": "t8", "statement": "theorem map₂_pure_right : map₂ m f (pure b) = f.map (m · b) :=", "area": "Order"} {"task": "t8", "statement": "theorem map₂_pure : map₂ m (pure a) (pure b) = pure (m a b) :=", "area": "Order"} {"task": "t8", "statement": "theorem map₂_swap (m : α → β → γ) (f : Filter α) (g : Filter β) : map₂ m f g = map₂ (fun a b => m b a) g f :=", "area": "Order"} {"task": "t8", "statement": "theorem map₂_left [NeBot g] : map₂ (fun x _ => x) f g = f :=", "area": "Order"} {"task": "t8", "statement": "theorem map₂_right [NeBot f] : map₂ (fun _ y => y) f g = g :=", "area": "Order"} {"task": "t8", "statement": "theorem map_map₂ (m : α → β → γ) (n : γ → δ) : (map₂ m f g).map n = map₂ (fun a b => n (m a b)) f g :=", "area": "Order"} {"task": "t8", "statement": "theorem map₂_map_left (m : γ → β → δ) (n : α → γ) : map₂ m (f.map n) g = map₂ (fun a b => m (n a) b) f g :=", "area": "Order"} {"task": "t8", "statement": "theorem map₂_map_right (m : α → γ → δ) (n : β → γ) : map₂ m f (g.map n) = map₂ (fun a b => m a (n b)) f g :=", "area": "Order"} {"task": "t8", "statement": "theorem map₂_assoc {m : δ → γ → ε} {n : α → β → δ} {m' : α → ε' → ε} {n' : β → γ → ε'} {h : Filter γ} (h_assoc : ∀ a b c, m (n a b) c = m' a (n' b c)) : map₂ m (map₂ n f g) h = map₂ m' f (map₂ n' g h) :=", "area": "Order"} {"task": "t8", "statement": "theorem map₂_comm {n : β → α → γ} (h_comm : ∀ a b, m a b = n b a) : map₂ m f g = map₂ n g f :=", "area": "Order"} {"task": "t8", "statement": "theorem map₂_left_comm {m : α → δ → ε} {n : β → γ → δ} {m' : α → γ → δ'} {n' : β → δ' → ε} (h_left_comm : ∀ a b c, m a (n b c) = n' b (m' a c)) : map₂ m f (map₂ n g h) = map₂ n' g (map₂ m' f h) :=", "area": "Order"} {"task": "t8", "statement": "theorem map₂_right_comm {m : δ → γ → ε} {n : α → β → δ} {m' : α → γ → δ'} {n' : δ' → β → ε} (h_right_comm : ∀ a b c, m (n a b) c = n' (m' a c) b) : map₂ m (map₂ n f g) h = map₂ n' (map₂ m' f h) g :=", "area": "Order"} {"task": "t8", "statement": "theorem map_map₂_distrib {n : γ → δ} {m' : α' → β' → δ} {n₁ : α → α'} {n₂ : β → β'} (h_distrib : ∀ a b, n (m a b) = m' (n₁ a) (n₂ b)) : (map₂ m f g).map n = map₂ m' (f.map n₁) (g.map n₂) :=", "area": "Order"} {"task": "t8", "statement": "theorem map₂_distrib_le_left {m : α → δ → ε} {n : β → γ → δ} {m₁ : α → β → β'} {m₂ : α → γ → γ'} {n' : β' → γ' → ε} (h_distrib : ∀ a b c, m a (n b c) = n' (m₁ a b) (m₂ a c)) : map₂ m f (map₂ n g h) ≤ map₂ n' (map₂ m₁ f g) (map₂ m₂ f h) :=", "area": "Order"} {"task": "t8", "statement": "theorem map₂_distrib_le_right {m : δ → γ → ε} {n : α → β → δ} {m₁ : α → γ → α'} {m₂ : β → γ → β'} {n' : α' → β' → ε} (h_distrib : ∀ a b c, m (n a b) c = n' (m₁ a c) (m₂ b c)) : map₂ m (map₂ n f g) h ≤ map₂ n' (map₂ m₁ f h) (map₂ m₂ g h) :=", "area": "Order"} {"task": "t8", "statement": "theorem map_map₂_antidistrib {n : γ → δ} {m' : β' → α' → δ} {n₁ : β → β'} {n₂ : α → α'} (h_antidistrib : ∀ a b, n (m a b) = m' (n₁ b) (n₂ a)) : (map₂ m f g).map n = map₂ m' (g.map n₁) (f.map n₂) :=", "area": "Order"} {"task": "t8", "statement": "theorem map₂_left_identity {f : α → β → β} {a : α} (h : ∀ b, f a b = b) (l : Filter β) : map₂ f (pure a) l = l :=", "area": "Order"} {"task": "t8", "statement": "theorem map₂_right_identity {f : α → β → α} {b : β} (h : ∀ a, f a b = a) (l : Filter α) : map₂ f l (pure b) = l :=", "area": "Order"} {"task": "t8", "statement": "theorem coe_injective : Injective ((↑) : Ultrafilter α → Filter α)", "area": "Order"} {"task": "t8", "statement": "theorem le_of_inf_neBot' (f : Ultrafilter α) {g : Filter α} (hg : NeBot (g ⊓ f)) : ↑f ≤ g :=", "area": "Order"} {"task": "t8", "statement": "theorem disjoint_iff_not_le {f : Ultrafilter α} {g : Filter α} : Disjoint (↑f) g ↔ ¬↑f ≤ g :=", "area": "Order"} {"task": "t8", "statement": "theorem compl_not_mem_iff : sᶜ ∉ f ↔ s ∈ f :=", "area": "Order"} {"task": "t8", "statement": "theorem compl_mem_iff_not_mem : sᶜ ∈ f ↔ s ∉ f :=", "area": "Order"} {"task": "t8", "statement": "theorem le_sup_iff {u : Ultrafilter α} {f g : Filter α} : ↑u ≤ f ⊔ g ↔ ↑u ≤ f ∨ ↑u ≤ g :=", "area": "Order"} {"task": "t8", "statement": "theorem union_mem_iff : s ∪ t ∈ f ↔ s ∈ f ∨ t ∈ f :=", "area": "Order"} {"task": "t8", "statement": "theorem eventually_imp : (∀ᶠ x in f, p x → q x) ↔ (∀ᶠ x in f, p x) → ∀ᶠ x in f, q x :=", "area": "Order"} {"task": "t8", "statement": "theorem finite_sUnion_mem_iff {s : Set (Set α)} (hs : s.Finite) : ⋃₀ s ∈ f ↔ ∃ t ∈ s, t ∈ f :=", "area": "Order"} {"task": "t8", "statement": "theorem finite_biUnion_mem_iff {is : Set β} {s : β → Set α} (his : is.Finite) : (⋃ i ∈ is, s i) ∈ f ↔ ∃ i ∈ is, s i ∈ f :=", "area": "Order"} {"task": "t8", "statement": "theorem comap_id (f : Ultrafilter α) (h₀ : Injective (id : α → α) := injective_id) (h₁ : range id ∈ f := (by rw [range_id]; exact univ_mem)) : f.comap h₀ h₁ = f :=", "area": "Order"} {"task": "t8", "statement": "theorem comap_comap (f : Ultrafilter γ) {m : α → β} {n : β → γ} (inj₀ : Injective n) (large₀ : range n ∈ f) (inj₁ : Injective m) (large₁ : range m ∈ f.comap inj₀ large₀) (inj₂ : Injective (n ∘ m) := inj₀.comp inj₁) (large₂ : range (n ∘ m) ∈ f := (by rw [range_comp]; exact image_mem_of_mem_comap large₀ large₁)) : (f.comap inj₀ large₀).comap inj₁ large₁ = f.comap inj₂ large₂ :=", "area": "Order"} {"task": "t8", "statement": "theorem comap_pure {m : α → β} (a : α) (inj : Injective m) (large) : comap (pure <| m a) inj large = pure a :=", "area": "Order"} {"task": "t8", "statement": "theorem eq_pure_of_finite_mem (h : s.Finite) (h' : s ∈ f) : ∃ x ∈ s, f = pure x :=", "area": "Order"} {"task": "t8", "statement": "theorem NeBot.eq_pure_iff (hf : f.NeBot) {x : α} : f = pure x ↔ {x} ∈ f :=", "area": "Order"} {"task": "t8", "statement": "lemma atTop_eq_pure_of_isTop [LinearOrder α] {x : α} (hx : IsTop x) : (atTop : Filter α) = pure x :=", "area": "Order"} {"task": "t8", "statement": "theorem mem_iff_ultrafilter : s ∈ f ↔ ∀ g : Ultrafilter α, ↑g ≤ f → s ∈ g :=", "area": "Order"} {"task": "t8", "statement": "theorem iSup_ultrafilter_le_eq (f : Filter α) : ⨆ (g : Ultrafilter α) (_ : g ≤ f), (g : Filter α) = f :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_iff_ultrafilter (f : α → β) (l₁ : Filter α) (l₂ : Filter β) : Tendsto f l₁ l₂ ↔ ∀ g : Ultrafilter α, ↑g ≤ l₁ → Tendsto f g l₂ :=", "area": "Order"} {"task": "t8", "statement": "theorem forall_neBot_le_iff {g : Filter α} {p : Filter α → Prop} (hp : Monotone p) : (∀ f : Filter α, NeBot f → f ≤ g → p f) ↔ ∀ f : Ultrafilter α, ↑f ≤ g → p f :=", "area": "Order"} {"task": "t8", "statement": "theorem ofComapInfPrincipal_mem (h : m '' s ∈ g) : s ∈ ofComapInfPrincipal h :=", "area": "Order"} {"task": "t8", "statement": "theorem ofComapInfPrincipal_eq_of_map (h : m '' s ∈ g) : (ofComapInfPrincipal h).map m = g :=", "area": "Order"} {"task": "t8", "statement": "theorem HasBasis.eventuallyConst_iff {ι : Sort*} {p : ι → Prop} {s : ι → Set α} (h : l.HasBasis p s) : EventuallyConst f l ↔ ∃ i, p i ∧ ∀ x ∈ s i, ∀ y ∈ s i, f x = f y :=", "area": "Order"} {"task": "t8", "statement": "theorem eventuallyConst_pred' {p : α → Prop} : EventuallyConst p l ↔ (p =ᶠ[l] fun _ ↦ False) ∨ (p =ᶠ[l] fun _ ↦ True) :=", "area": "Order"} {"task": "t8", "statement": "theorem eventuallyConst_pred {p : α → Prop} : EventuallyConst p l ↔ (∀ᶠ x in l, p x) ∨ (∀ᶠ x in l, ¬p x) :=", "area": "Order"} {"task": "t8", "statement": "theorem EventuallyEq.eventuallyConst_iff {g : α → β} (h : f =ᶠ[l] g) : EventuallyConst f l ↔ EventuallyConst g l :=", "area": "Order"} {"task": "t8", "statement": "@[to_additive] lemma of_mulIndicator_const (h : EventuallyConst (s.mulIndicator fun _ ↦ c) l) (hc : c ≠ 1) : EventuallyConst s l :=", "area": "Order"} {"task": "t8", "statement": "theorem mulIndicator_const (h : EventuallyConst s l) (c : β) : EventuallyConst (s.mulIndicator fun _ ↦ c) l :=", "area": "Order"} {"task": "t8", "statement": "theorem mulIndicator_const_iff : EventuallyConst (s.mulIndicator fun _ ↦ c) l ↔ c = 1 ∨ EventuallyConst s l :=", "area": "Order"} {"task": "t8", "statement": "lemma eventuallyConst_atTop [SemilatticeSup α] [Nonempty α] : EventuallyConst f atTop ↔ (∃ i, ∀ j, i ≤ j → f j = f i) :=", "area": "Order"} {"task": "t8", "statement": "lemma eventuallyConst_atTop_nat {f : ℕ → α} : EventuallyConst f atTop ↔ ∃ n, ∀ m, n ≤ m → f (m + 1) = f m :=", "area": "Order"} {"task": "t8", "statement": "theorem smallSets_eq_generate {f : Filter α} : f.smallSets = generate (powerset '' f.sets) :=", "area": "Order"} {"task": "t8", "statement": "theorem bind_smallSets_gc : GaloisConnection (fun L : Filter (Set α) ↦ L.bind principal) smallSets :=", "area": "Order"} {"task": "t8", "statement": "@[simp] lemma tendsto_image_smallSets {f : α → β} : Tendsto (f '' ·) la.smallSets lb.smallSets ↔ Tendsto f la lb :=", "area": "Order"} {"task": "t8", "statement": "theorem smallSets_bot : (⊥ : Filter α).smallSets = pure ∅ :=", "area": "Order"} {"task": "t8", "statement": "theorem smallSets_top : (⊤ : Filter α).smallSets = ⊤ :=", "area": "Order"} {"task": "t8", "statement": "theorem smallSets_comap_eq_comap_image (l : Filter β) (f : α → β) : (comap f l).smallSets = comap (image f) l.smallSets :=", "area": "Order"} {"task": "t8", "statement": "theorem Tendsto.smallSets_mono {s t : α → Set β} (ht : Tendsto t la lb.smallSets) (hst : ∀ᶠ x in la, s x ⊆ t x) : Tendsto s la lb.smallSets :=", "area": "Order"} {"task": "t8", "statement": "theorem eventually_smallSets_eventually {p : α → Prop} : (∀ᶠ s in l.smallSets, ∀ᶠ x in l', x ∈ s → p x) ↔ ∀ᶠ x in l ⊓ l', p x :=", "area": "Order"} {"task": "t8", "statement": "theorem eventually_smallSets_forall {p : α → Prop} : (∀ᶠ s in l.smallSets, ∀ x ∈ s, p x) ↔ ∀ᶠ x in l, p x :=", "area": "Order"} {"task": "t8", "statement": "theorem disjoint_atBot_atTop [PartialOrder α] [Nontrivial α] : Disjoint (atBot : Filter α) atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem atTop_eq_generate_Ici [SemilatticeSup α] : atTop = generate (range (Ici (α := α))) :=", "area": "Order"} {"task": "t8", "statement": "theorem eventually_forall_ge_atTop [Preorder α] {p : α → Prop} : (∀ᶠ x in atTop, ∀ y, x ≤ y → p y) ↔ ∀ᶠ x in atTop, p x :=", "area": "Order"} {"task": "t8", "statement": "theorem Tendsto.eventually_forall_ge_atTop [Preorder β] {l : Filter α} {p : β → Prop} {f : α → β} (hf : Tendsto f l atTop) (h_evtl : ∀ᶠ x in atTop, p x) : ∀ᶠ x in l, ∀ y, f x ≤ y → p y :=", "area": "Order"} {"task": "t8", "statement": "theorem Tendsto.eventually_forall_le_atBot [Preorder β] {l : Filter α} {p : β → Prop} {f : α → β} (hf : Tendsto f l atBot) (h_evtl : ∀ᶠ x in atBot, p x) : ∀ᶠ x in l, ∀ y, y ≤ f x → p y :=", "area": "Order"} {"task": "t8", "statement": "theorem OrderTop.atTop_eq (α) [PartialOrder α] [OrderTop α] : (atTop : Filter α) = pure ⊤ :=", "area": "Order"} {"task": "t8", "statement": "theorem Subsingleton.atTop_eq (α) [Subsingleton α] [Preorder α] : (atTop : Filter α) = ⊤ :=", "area": "Order"} {"task": "t8", "statement": "lemma exists_eventually_atTop [SemilatticeSup α] [Nonempty α] {r : α → β → Prop} : (∃ b, ∀ᶠ a in atTop, r a b) ↔ ∀ᶠ a₀ in atTop, ∃ b, ∀ a ≥ a₀, r a b :=", "area": "Order"} {"task": "t8", "statement": "lemma exists_eventually_atBot [SemilatticeInf α] [Nonempty α] {r : α → β → Prop} : (∃ b, ∀ᶠ a in atBot, r a b) ↔ ∀ᶠ a₀ in atBot, ∃ b, ∀ a ≤ a₀, r a b :=", "area": "Order"} {"task": "t8", "statement": "theorem frequently_atTop [SemilatticeSup α] [Nonempty α] {p : α → Prop} : (∃ᶠ x in atTop, p x) ↔ ∀ a, ∃ b ≥ a, p b :=", "area": "Order"} {"task": "t8", "statement": "theorem frequently_atTop' [SemilatticeSup α] [Nonempty α] [NoMaxOrder α] {p : α → Prop} : (∃ᶠ x in atTop, p x) ↔ ∀ a, ∃ b > a, p b :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_atTop [Preorder β] {m : α → β} {f : Filter α} : Tendsto m f atTop ↔ ∀ b, ∀ᶠ a in f, b ≤ m a :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_atTop_mono' [Preorder β] (l : Filter α) ⦃f₁ f₂ : α → β⦄ (h : f₁ ≤ᶠ[l] f₂) (h₁ : Tendsto f₁ l atTop) : Tendsto f₂ l atTop :=", "area": "Order"} {"task": "t8", "statement": "lemma atTop_eq_generate_of_forall_exists_le [LinearOrder α] {s : Set α} (hs : ∀ x, ∃ y ∈ s, x ≤ y) : (atTop : Filter α) = generate (Ici '' s) :=", "area": "Order"} {"task": "t8", "statement": "lemma atTop_eq_generate_of_not_bddAbove [LinearOrder α] {s : Set α} (hs : ¬ BddAbove s) : (atTop : Filter α) = generate (Ici '' s) :=", "area": "Order"} {"task": "t8", "statement": "theorem comap_atTop (e : α ≃o β) : comap e atTop = atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem map_atTop (e : α ≃o β) : map (e : α → β) atTop = atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_atTop_iff {l : Filter γ} {f : γ → α} (e : α ≃o β) : Tendsto (fun x => e (f x)) l atTop ↔ Tendsto f l atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem inf_map_atTop_neBot_iff [SemilatticeSup α] [Nonempty α] {F : Filter β} {u : α → β} : NeBot (F ⊓ map u atTop) ↔ ∀ U ∈ F, ∀ N, ∃ n ≥ N, u n ∈ U :=", "area": "Order"} {"task": "t8", "statement": "theorem extraction_of_frequently_atTop' {P : ℕ → Prop} (h : ∀ N, ∃ n > N, P n) : ∃ φ : ℕ → ℕ, StrictMono φ ∧ ∀ n, P (φ n) :=", "area": "Order"} {"task": "t8", "statement": "theorem extraction_of_frequently_atTop {P : ℕ → Prop} (h : ∃ᶠ n in atTop, P n) : ∃ φ : ℕ → ℕ, StrictMono φ ∧ ∀ n, P (φ n) :=", "area": "Order"} {"task": "t8", "statement": "theorem extraction_forall_of_frequently {P : ℕ → ℕ → Prop} (h : ∀ n, ∃ᶠ k in atTop, P n k) : ∃ φ : ℕ → ℕ, StrictMono φ ∧ ∀ n, P n (φ n) :=", "area": "Order"} {"task": "t8", "statement": "theorem extraction_forall_of_eventually' {P : ℕ → ℕ → Prop} (h : ∀ n, ∃ N, ∀ k ≥ N, P n k) : ∃ φ : ℕ → ℕ, StrictMono φ ∧ ∀ n, P n (φ n) :=", "area": "Order"} {"task": "t8", "statement": "theorem Eventually.atTop_of_arithmetic {p : ℕ → Prop} {n : ℕ} (hn : n ≠ 0) (hp : ∀ k < n, ∀ᶠ a in atTop, p (n * a + k)) : ∀ᶠ a in atTop, p a :=", "area": "Order"} {"task": "t8", "statement": "theorem exists_le_of_tendsto_atTop [SemilatticeSup α] [Preorder β] {u : α → β} (h : Tendsto u atTop atTop) (a : α) (b : β) : ∃ a' ≥ a, b ≤ u a' :=", "area": "Order"} {"task": "t8", "statement": "theorem exists_lt_of_tendsto_atTop [SemilatticeSup α] [Preorder β] [NoMaxOrder β] {u : α → β} (h : Tendsto u atTop atTop) (a : α) (b : β) : ∃ a' ≥ a, b < u a' :=", "area": "Order"} {"task": "t8", "statement": "theorem high_scores [LinearOrder β] [NoMaxOrder β] {u : ℕ → β} (hu : Tendsto u atTop atTop) : ∀ N, ∃ n ≥ N, ∀ k < n, u k < u n :=", "area": "Order"} {"task": "t8", "statement": "theorem frequently_high_scores [LinearOrder β] [NoMaxOrder β] {u : ℕ → β} (hu : Tendsto u atTop atTop) : ∃ᶠ n in atTop, ∀ k < n, u k < u n :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_atTop_add_left_of_le' (C : β) (hf : ∀ᶠ x in l, C ≤ f x) (hg : Tendsto g l atTop) : Tendsto (fun x => f x + g x) l atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_atTop_add_right_of_le' (C : β) (hf : Tendsto f l atTop) (hg : ∀ᶠ x in l, C ≤ g x) : Tendsto (fun x => f x + g x) l atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem Tendsto.atTop_mul_atTop (hf : Tendsto f l atTop) (hg : Tendsto g l atTop) : Tendsto (fun x => f x * g x) l atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem Tendsto.atTop_mul_atBot (hf : Tendsto f l atTop) (hg : Tendsto g l atBot) : Tendsto (fun x => f x * g x) l atBot :=", "area": "Order"} {"task": "t8", "statement": "theorem Tendsto.atBot_mul_atTop (hf : Tendsto f l atBot) (hg : Tendsto g l atTop) : Tendsto (fun x => f x * g x) l atBot :=", "area": "Order"} {"task": "t8", "statement": "theorem Tendsto.atBot_mul_atBot (hf : Tendsto f l atBot) (hg : Tendsto g l atBot) : Tendsto (fun x => f x * g x) l atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem comap_abs_atTop : comap (abs : α → α) atTop = atBot ⊔ atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_pow_atTop_iff {n : ℕ} : Tendsto (fun x : α => x ^ n) atTop atTop ↔ n ≠ 0 :=", "area": "Order"} {"task": "t8", "statement": "theorem not_tendsto_pow_atTop_atBot [LinearOrderedRing α] : ∀ {n : ℕ}, ¬Tendsto (fun x : α => x ^ n) atTop atBot", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_const_mul_atTop_of_pos (hr : 0 < r) : Tendsto (fun x => r * f x) l atTop ↔ Tendsto f l atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_mul_const_atTop_of_pos (hr : 0 < r) : Tendsto (fun x => f x * r) l atTop ↔ Tendsto f l atTop :=", "area": "Order"} {"task": "t8", "statement": "lemma tendsto_div_const_atTop_of_pos (hr : 0 < r) : Tendsto (fun x ↦ f x / r) l atTop ↔ Tendsto f l atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_const_mul_atTop_iff_pos [NeBot l] (h : Tendsto f l atTop) : Tendsto (fun x => r * f x) l atTop ↔ 0 < r :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_mul_const_atTop_iff_pos [NeBot l] (h : Tendsto f l atTop) : Tendsto (fun x => f x * r) l atTop ↔ 0 < r :=", "area": "Order"} {"task": "t8", "statement": "lemma tendsto_div_const_atTop_iff_pos [NeBot l] (h : Tendsto f l atTop) : Tendsto (fun x ↦ f x / r) l atTop ↔ 0 < r :=", "area": "Order"} {"task": "t8", "statement": "theorem Tendsto.atTop_div_const (hr : 0 < r) (hf : Tendsto f l atTop) : Tendsto (fun x => f x / r) l atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_const_mul_pow_atTop_iff : Tendsto (fun x => c * x ^ n) atTop atTop ↔ n ≠ 0 ∧ 0 < c :=", "area": "Order"} {"task": "t8", "statement": "lemma tendsto_zpow_atTop_atTop {n : ℤ} (hn : 0 < n) : Tendsto (fun x : α ↦ x ^ n) atTop atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_const_mul_atBot_of_pos (hr : 0 < r) : Tendsto (fun x => r * f x) l atBot ↔ Tendsto f l atBot :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_mul_const_atBot_of_pos (hr : 0 < r) : Tendsto (fun x => f x * r) l atBot ↔ Tendsto f l atBot :=", "area": "Order"} {"task": "t8", "statement": "lemma tendsto_div_const_atBot_of_pos (hr : 0 < r) : Tendsto (fun x ↦ f x / r) l atBot ↔ Tendsto f l atBot :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_const_mul_atTop_of_neg (hr : r < 0) : Tendsto (fun x => r * f x) l atTop ↔ Tendsto f l atBot :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_mul_const_atTop_of_neg (hr : r < 0) : Tendsto (fun x => f x * r) l atTop ↔ Tendsto f l atBot :=", "area": "Order"} {"task": "t8", "statement": "lemma tendsto_div_const_atTop_of_neg (hr : r < 0) : Tendsto (fun x ↦ f x / r) l atTop ↔ Tendsto f l atBot :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_const_mul_atBot_of_neg (hr : r < 0) : Tendsto (fun x => r * f x) l atBot ↔ Tendsto f l atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_mul_const_atBot_of_neg (hr : r < 0) : Tendsto (fun x => f x * r) l atBot ↔ Tendsto f l atTop :=", "area": "Order"} {"task": "t8", "statement": "lemma tendsto_div_const_atBot_of_neg (hr : r < 0) : Tendsto (fun x ↦ f x / r) l atBot ↔ Tendsto f l atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_const_mul_atTop_iff [NeBot l] : Tendsto (fun x => r * f x) l atTop ↔ 0 < r ∧ Tendsto f l atTop ∨ r < 0 ∧ Tendsto f l atBot :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_mul_const_atTop_iff [NeBot l] : Tendsto (fun x => f x * r) l atTop ↔ 0 < r ∧ Tendsto f l atTop ∨ r < 0 ∧ Tendsto f l atBot :=", "area": "Order"} {"task": "t8", "statement": "lemma tendsto_div_const_atTop_iff [NeBot l] : Tendsto (fun x ↦ f x / r) l atTop ↔ 0 < r ∧ Tendsto f l atTop ∨ r < 0 ∧ Tendsto f l atBot :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_const_mul_atBot_iff [NeBot l] : Tendsto (fun x => r * f x) l atBot ↔ 0 < r ∧ Tendsto f l atBot ∨ r < 0 ∧ Tendsto f l atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_mul_const_atBot_iff [NeBot l] : Tendsto (fun x => f x * r) l atBot ↔ 0 < r ∧ Tendsto f l atBot ∨ r < 0 ∧ Tendsto f l atTop :=", "area": "Order"} {"task": "t8", "statement": "lemma tendsto_div_const_atBot_iff [NeBot l] : Tendsto (fun x ↦ f x / r) l atBot ↔ 0 < r ∧ Tendsto f l atBot ∨ r < 0 ∧ Tendsto f l atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_const_mul_atTop_iff_neg [NeBot l] (h : Tendsto f l atBot) : Tendsto (fun x => r * f x) l atTop ↔ r < 0 :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_mul_const_atTop_iff_neg [NeBot l] (h : Tendsto f l atBot) : Tendsto (fun x => f x * r) l atTop ↔ r < 0 :=", "area": "Order"} {"task": "t8", "statement": "lemma tendsto_div_const_atTop_iff_neg [NeBot l] (h : Tendsto f l atBot) : Tendsto (fun x ↦ f x / r) l atTop ↔ r < 0 :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_const_mul_atBot_iff_pos [NeBot l] (h : Tendsto f l atBot) : Tendsto (fun x => r * f x) l atBot ↔ 0 < r :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_mul_const_atBot_iff_pos [NeBot l] (h : Tendsto f l atBot) : Tendsto (fun x => f x * r) l atBot ↔ 0 < r :=", "area": "Order"} {"task": "t8", "statement": "lemma tendsto_div_const_atBot_iff_pos [NeBot l] (h : Tendsto f l atBot) : Tendsto (fun x ↦ f x / r) l atBot ↔ 0 < r :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_const_mul_atBot_iff_neg [NeBot l] (h : Tendsto f l atTop) : Tendsto (fun x => r * f x) l atBot ↔ r < 0 :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_mul_const_atBot_iff_neg [NeBot l] (h : Tendsto f l atTop) : Tendsto (fun x => f x * r) l atBot ↔ r < 0 :=", "area": "Order"} {"task": "t8", "statement": "lemma tendsto_div_const_atBot_iff_neg [NeBot l] (h : Tendsto f l atTop) : Tendsto (fun x ↦ f x / r) l atBot ↔ r < 0 :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_const_mul_pow_atBot_iff {c : α} {n : ℕ} : Tendsto (fun x => c * x ^ n) atTop atBot ↔ n ≠ 0 ∧ c < 0 :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_atTop' [Nonempty α] [SemilatticeSup α] {f : α → β} {l : Filter β} : Tendsto f atTop l ↔ ∀ s ∈ l, ∃ a, ∀ b ≥ a, f b ∈ s :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_atTop_principal [Nonempty β] [SemilatticeSup β] {f : β → α} {s : Set α} : Tendsto f atTop (𝓟 s) ↔ ∃ N, ∀ n ≥ N, f n ∈ s :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_atTop_embedding [Preorder β] [Preorder γ] {f : α → β} {e : β → γ} {l : Filter α} (hm : ∀ b₁ b₂, e b₁ ≤ e b₂ ↔ b₁ ≤ b₂) (hu : ∀ c, ∃ b, c ≤ e b) : Tendsto (e ∘ f) l atTop ↔ Tendsto f l atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem atTop_finset_eq_iInf : (atTop : Filter (Finset α)) = ⨅ x : α, 𝓟 (Ici {x}) :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_atTop_finset_of_monotone [Preorder β] {f : β → Finset α} (h : Monotone f) (h' : ∀ x : α, ∃ n, x ∈ f n) : Tendsto f atTop atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_finset_image_atTop_atTop [DecidableEq β] {i : β → γ} {j : γ → β} (h : Function.LeftInverse j i) : Tendsto (Finset.image j) atTop atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem prod_atTop_atTop_eq [Preorder α] [Preorder β] : (atTop : Filter α) ×ˢ (atTop : Filter β) = (atTop : Filter (α × β)) :=", "area": "Order"} {"task": "t8", "statement": "theorem prod_map_atTop_eq {α₁ α₂ β₁ β₂ : Type*} [Preorder β₁] [Preorder β₂] (u₁ : β₁ → α₁) (u₂ : β₂ → α₂) : map u₁ atTop ×ˢ map u₂ atTop = map (Prod.map u₁ u₂) atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_atBot_diagonal [SemilatticeInf α] : Tendsto (fun a : α => (a, a)) atBot atBot :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_atTop_diagonal [SemilatticeSup α] : Tendsto (fun a : α => (a, a)) atTop atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem Tendsto.prod_map_prod_atBot [SemilatticeInf γ] {F : Filter α} {G : Filter β} {f : α → γ} {g : β → γ} (hf : Tendsto f F atBot) (hg : Tendsto g G atBot) : Tendsto (Prod.map f g) (F ×ˢ G) atBot :=", "area": "Order"} {"task": "t8", "statement": "theorem Tendsto.prod_map_prod_atTop [SemilatticeSup γ] {F : Filter α} {G : Filter β} {f : α → γ} {g : β → γ} (hf : Tendsto f F atTop) (hg : Tendsto g G atTop) : Tendsto (Prod.map f g) (F ×ˢ G) atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem Tendsto.prod_atBot [SemilatticeInf α] [SemilatticeInf γ] {f g : α → γ} (hf : Tendsto f atBot atBot) (hg : Tendsto g atBot atBot) : Tendsto (Prod.map f g) atBot atBot :=", "area": "Order"} {"task": "t8", "statement": "theorem Tendsto.prod_atTop [SemilatticeSup α] [SemilatticeSup γ] {f g : α → γ} (hf : Tendsto f atTop atTop) (hg : Tendsto g atTop atTop) : Tendsto (Prod.map f g) atTop atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem eventually_atBot_prod_self [SemilatticeInf α] [Nonempty α] {p : α × α → Prop} : (∀ᶠ x in atBot, p x) ↔ ∃ a, ∀ k l, k ≤ a → l ≤ a → p (k, l) :=", "area": "Order"} {"task": "t8", "statement": "theorem eventually_atBot_prod_self' [SemilatticeInf α] [Nonempty α] {p : α × α → Prop} : (∀ᶠ x in atBot, p x) ↔ ∃ a, ∀ k ≤ a, ∀ l ≤ a, p (k, l) :=", "area": "Order"} {"task": "t8", "statement": "theorem eventually_atTop_prod_self' [SemilatticeSup α] [Nonempty α] {p : α × α → Prop} : (∀ᶠ x in atTop, p x) ↔ ∃ a, ∀ k ≥ a, ∀ l ≥ a, p (k, l) :=", "area": "Order"} {"task": "t8", "statement": "theorem eventually_atTop_curry [SemilatticeSup α] [SemilatticeSup β] {p : α × β → Prop} (hp : ∀ᶠ x : α × β in Filter.atTop, p x) : ∀ᶠ k in atTop, ∀ᶠ l in atTop, p (k, l) :=", "area": "Order"} {"task": "t8", "statement": "theorem map_atTop_eq_of_gc [SemilatticeSup α] [SemilatticeSup β] {f : α → β} (g : β → α) (b' : β) (hf : Monotone f) (gc : ∀ a, ∀ b ≥ b', f a ≤ b ↔ a ≤ g b) (hgi : ∀ b ≥ b', b ≤ f (g b)) : map f atTop = atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem map_val_atTop_of_Ici_subset [SemilatticeSup α] {a : α} {s : Set α} (h : Ici a ⊆ s) : map ((↑) : s → α) atTop = atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem atTop_Ioi_eq [SemilatticeSup α] (a : α) : atTop = comap ((↑) : Ioi a → α) atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem atTop_Ici_eq [SemilatticeSup α] (a : α) : atTop = comap ((↑) : Ici a → α) atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_Ioi_atTop [SemilatticeSup α] {a : α} {f : β → Ioi a} {l : Filter β} : Tendsto f l atTop ↔ Tendsto (fun x => (f x : α)) l atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_Iio_atBot [SemilatticeInf α] {a : α} {f : β → Iio a} {l : Filter β} : Tendsto f l atBot ↔ Tendsto (fun x => (f x : α)) l atBot :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_Ici_atTop [SemilatticeSup α] {a : α} {f : β → Ici a} {l : Filter β} : Tendsto f l atTop ↔ Tendsto (fun x => (f x : α)) l atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_Iic_atBot [SemilatticeInf α] {a : α} {f : β → Iic a} {l : Filter β} : Tendsto f l atBot ↔ Tendsto (fun x => (f x : α)) l atBot :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_comp_val_Ioi_atTop [SemilatticeSup α] [NoMaxOrder α] {a : α} {f : α → β} {l : Filter β} : Tendsto (fun x : Ioi a => f x) atTop l ↔ Tendsto f atTop l :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_comp_val_Ici_atTop [SemilatticeSup α] {a : α} {f : α → β} {l : Filter β} : Tendsto (fun x : Ici a => f x) atTop l ↔ Tendsto f atTop l :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_comp_val_Iio_atBot [SemilatticeInf α] [NoMinOrder α] {a : α} {f : α → β} {l : Filter β} : Tendsto (fun x : Iio a => f x) atBot l ↔ Tendsto f atBot l :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_comp_val_Iic_atBot [SemilatticeInf α] {a : α} {f : α → β} {l : Filter β} : Tendsto (fun x : Iic a => f x) atBot l ↔ Tendsto f atBot l :=", "area": "Order"} {"task": "t8", "statement": "theorem map_add_atTop_eq_nat (k : ℕ) : map (fun a => a + k) atTop = atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem map_sub_atTop_eq_nat (k : ℕ) : map (fun a => a - k) atTop = atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_add_atTop_iff_nat {f : ℕ → α} {l : Filter α} (k : ℕ) : Tendsto (fun n => f (n + k)) atTop l ↔ Tendsto f atTop l :=", "area": "Order"} {"task": "t8", "statement": "theorem map_div_atTop_eq_nat (k : ℕ) (hk : 0 < k) : map (fun a => a / k) atTop = atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_atTop_atTop_of_monotone' [Preorder ι] [LinearOrder α] {u : ι → α} (h : Monotone u) (H : ¬BddAbove (range u)) : Tendsto u atTop atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem unbounded_of_tendsto_atTop [Nonempty α] [SemilatticeSup α] [Preorder β] [NoMaxOrder β] {f : α → β} (h : Tendsto f atTop atTop) : ¬BddAbove (range f) :=", "area": "Order"} {"task": "t8", "statement": "theorem map_atTop_finset_prod_le_of_prod_eq [CommMonoid α] {f : β → α} {g : γ → α} (h_eq : ∀ u : Finset γ, ∃ v : Finset β, ∀ v', v ⊆ v' → ∃ u', u ⊆ u' ∧ ∏ x ∈ u', g x = ∏ b ∈ v', f b) : (atTop.map fun s : Finset β => ∏ b ∈ s, f b) ≤ atTop.map fun s : Finset γ => ∏ x ∈ s, g x :=", "area": "Order"} {"task": "t8", "statement": "theorem HasAntitoneBasis.subbasis_with_rel {f : Filter α} {s : ℕ → Set α} (hs : f.HasAntitoneBasis s) {r : ℕ → ℕ → Prop} (hr : ∀ m, ∀ᶠ n in atTop, r m n) : ∃ φ : ℕ → ℕ, StrictMono φ ∧ (∀ ⦃m n⦄, m < n → r (φ m) (φ n)) ∧ f.HasAntitoneBasis (s ∘ φ) :=", "area": "Order"} {"task": "t8", "statement": "theorem exists_seq_tendsto (f : Filter α) [IsCountablyGenerated f] [NeBot f] : ∃ x : ℕ → α, Tendsto x atTop f :=", "area": "Order"} {"task": "t8", "statement": "theorem exists_seq_monotone_tendsto_atTop_atTop (α : Type*) [SemilatticeSup α] [Nonempty α] [(atTop : Filter α).IsCountablyGenerated] : ∃ xs : ℕ → α, Monotone xs ∧ Tendsto xs atTop atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_iff_seq_tendsto {f : α → β} {k : Filter α} {l : Filter β} [k.IsCountablyGenerated] : Tendsto f k l ↔ ∀ x : ℕ → α, Tendsto x atTop k → Tendsto (f ∘ x) atTop l :=", "area": "Order"} {"task": "t8", "statement": "theorem eventually_iff_seq_eventually {ι : Type*} {l : Filter ι} {p : ι → Prop} [l.IsCountablyGenerated] : (∀ᶠ n in l, p n) ↔ ∀ x : ℕ → ι, Tendsto x atTop l → ∀ᶠ n : ℕ in atTop, p (x n) :=", "area": "Order"} {"task": "t8", "statement": "theorem frequently_iff_seq_frequently {ι : Type*} {l : Filter ι} {p : ι → Prop} [l.IsCountablyGenerated] : (∃ᶠ n in l, p n) ↔ ∃ x : ℕ → ι, Tendsto x atTop l ∧ ∃ᶠ n : ℕ in atTop, p (x n) :=", "area": "Order"} {"task": "t8", "statement": "theorem subseq_forall_of_frequently {ι : Type*} {x : ℕ → ι} {p : ι → Prop} {l : Filter ι} (h_tendsto : Tendsto x atTop l) (h : ∃ᶠ n in atTop, p (x n)) : ∃ ns : ℕ → ℕ, Tendsto (fun n => x (ns n)) atTop l ∧ ∀ n, p (x (ns n)) :=", "area": "Order"} {"task": "t8", "statement": "theorem exists_seq_forall_of_frequently {ι : Type*} {l : Filter ι} {p : ι → Prop} [l.IsCountablyGenerated] (h : ∃ᶠ n in l, p n) : ∃ ns : ℕ → ι, Tendsto ns atTop l ∧ ∀ n, p (ns n) :=", "area": "Order"} {"task": "t8", "statement": "theorem tendsto_of_subseq_tendsto {ι : Type*} {x : ι → α} {f : Filter α} {l : Filter ι} [l.IsCountablyGenerated] (hxy : ∀ ns : ℕ → ι, Tendsto ns atTop l → ∃ ms : ℕ → ℕ, Tendsto (fun n => x (ns <| ms n)) atTop f) : Tendsto x l f :=", "area": "Order"} {"task": "t8", "statement": "theorem subseq_tendsto_of_neBot {f : Filter α} [IsCountablyGenerated f] {u : ℕ → α} (hx : NeBot (f ⊓ map u atTop)) : ∃ θ : ℕ → ℕ, StrictMono θ ∧ Tendsto (u ∘ θ) atTop f :=", "area": "Order"} {"task": "t8", "statement": "theorem Monotone.piecewise_eventually_eq_iUnion {β : α → Type*} [Preorder ι] {s : ι → Set α} [∀ i, DecidablePred (· ∈ s i)] [DecidablePred (· ∈ ⋃ i, s i)] (hs : Monotone s) (f g : (a : α) → β a) (a : α) : ∀ᶠ i in atTop, (s i).piecewise f g a = (⋃ i, s i).piecewise f g a :=", "area": "Order"} {"task": "t8", "statement": "theorem Antitone.piecewise_eventually_eq_iInter {β : α → Type*} [Preorder ι] {s : ι → Set α} [∀ i, DecidablePred (· ∈ s i)] [DecidablePred (· ∈ ⋂ i, s i)] (hs : Antitone s) (f g : (a : α) → β a) (a : α) : ∀ᶠ i in atTop, (s i).piecewise f g a = (⋂ i, s i).piecewise f g a :=", "area": "Order"} {"task": "t8", "statement": "theorem Function.Injective.map_atTop_finset_prod_eq [CommMonoid α] {g : γ → β} (hg : Function.Injective g) {f : β → α} (hf : ∀ x, x ∉ Set.range g → f x = 1) : map (fun s => ∏ i ∈ s, f (g i)) atTop = map (fun s => ∏ i ∈ s, f i) atTop :=", "area": "Order"} {"task": "t8", "statement": "theorem age.countable_quotient [h : Countable M] : (Quotient.mk' '' L.age M).Countable :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem age_directLimit {ι : Type w} [Preorder ι] [IsDirected ι (· ≤ ·)] [Nonempty ι] (G : ι → Type max w w') [∀ i, L.Structure (G i)] (f : ∀ i j, i ≤ j → G i ↪[L] G j) [DirectedSystem G fun i j h => f i j h] : L.age (DirectLimit G f) = ⋃ i : ι, L.age (G i) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem exists_cg_is_age_of (hn : K.Nonempty) (h : ∀ M N : Bundled.{w} L.Structure, Nonempty (M ≃[L] N) → (M ∈ K ↔ N ∈ K)) (hc : (Quotient.mk' '' K).Countable) (fg : ∀ M : Bundled.{w} L.Structure, M ∈ K → Structure.FG L M) (hp : Hereditary K) (jep : JointEmbedding K) : ∃ M : Bundled.{w} L.Structure, Structure.CG L M ∧ L.age M = K :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem exists_countable_is_age_of_iff [Countable (Σ l, L.Functions l)] : (∃ M : Bundled.{w} L.Structure, Countable M ∧ L.age M = K) ↔ K.Nonempty ∧ (∀ M N : Bundled.{w} L.Structure, Nonempty (M ≃[L] N) → (M ∈ K ↔ N ∈ K)) ∧ (Quotient.mk' '' K).Countable ∧ (∀ M : Bundled.{w} L.Structure, M ∈ K → Structure.FG L M) ∧ Hereditary K ∧ JointEmbedding K :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem IsUltrahomogeneous.amalgamation_age (h : L.IsUltrahomogeneous M) : Amalgamation (L.age M) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem Definable.map_expansion {L' : FirstOrder.Language} [L'.Structure M] (h : A.Definable L s) (φ : L →ᴸ L') [φ.IsExpansionOn M] : A.Definable L' s :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem definable_iff_exists_formula_sum : A.Definable L s ↔ ∃ φ : L.Formula (A ⊕ α), s = {v | φ.Realize (Sum.elim (↑) v)} :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem empty_definable_iff : (∅ : Set M).Definable L s ↔ ∃ φ : L.Formula α, s = setOf φ.Realize :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem Definable.mono (hAs : A.Definable L s) (hAB : A ⊆ B) : B.Definable L s :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem definable_empty : A.Definable L (∅ : Set (α → M)) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem definable_univ : A.Definable L (univ : Set (α → M)) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem Definable.inter {f g : Set (α → M)} (hf : A.Definable L f) (hg : A.Definable L g) : A.Definable L (f ∩ g) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem Definable.union {f g : Set (α → M)} (hf : A.Definable L f) (hg : A.Definable L g) : A.Definable L (f ∪ g) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem definable_finset_inf {ι : Type*} {f : ι → Set (α → M)} (hf : ∀ i, A.Definable L (f i)) (s : Finset ι) : A.Definable L (s.inf f) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem definable_finset_sup {ι : Type*} {f : ι → Set (α → M)} (hf : ∀ i, A.Definable L (f i)) (s : Finset ι) : A.Definable L (s.sup f) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem definable_finset_biInter {ι : Type*} {f : ι → Set (α → M)} (hf : ∀ i, A.Definable L (f i)) (s : Finset ι) : A.Definable L (⋂ i ∈ s, f i) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem definable_finset_biUnion {ι : Type*} {f : ι → Set (α → M)} (hf : ∀ i, A.Definable L (f i)) (s : Finset ι) : A.Definable L (⋃ i ∈ s, f i) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem Definable.compl {s : Set (α → M)} (hf : A.Definable L s) : A.Definable L sᶜ :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem Definable.preimage_comp (f : α → β) {s : Set (α → M)} (h : A.Definable L s) : A.Definable L ((fun g : β → M => g ∘ f) ⁻¹' s) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem Definable.image_comp_equiv {s : Set (β → M)} (h : A.Definable L s) (f : α ≃ β) : A.Definable L ((fun g : β → M => g ∘ f) '' s) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem definable_iff_finitely_definable : A.Definable L s ↔ ∃ (A0 : Finset M), (A0 : Set M) ⊆ A ∧ (A0 : Set M).Definable L s :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem Definable.image_comp_sum_inl_fin (m : ℕ) {s : Set (Sum α (Fin m) → M)} (h : A.Definable L s) : A.Definable L ((fun g : Sum α (Fin m) → M => g ∘ Sum.inl) '' s) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem Definable.image_comp_embedding {s : Set (β → M)} (h : A.Definable L s) (f : α ↪ β) [Finite β] : A.Definable L ((fun g : β → M => g ∘ f) '' s) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem Definable.image_comp {s : Set (β → M)} (h : A.Definable L s) (f : α → β) [Finite α] [Finite β] : A.Definable L ((fun g : β → M => g ∘ f) '' s) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem card_functions_sum_skolem₁ : #(Σ n, (L.sum L.skolem₁).Functions n) = #(Σ n, L.BoundedFormula Empty (n + 1)) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem card_functions_sum_skolem₁_le : #(Σ n, (L.sum L.skolem₁).Functions n) ≤ max ℵ₀ L.card :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem skolem₁_reduct_isElementary (S : (L.sum L.skolem₁).Substructure M) : (LHom.sumInl.substructureReduct S).IsElementary :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem exists_elementarySubstructure_card_eq (s : Set M) (κ : Cardinal.{w'}) (h1 : ℵ₀ ≤ κ) (h2 : Cardinal.lift.{w'} #s ≤ Cardinal.lift.{w} κ) (h3 : Cardinal.lift.{w'} L.card ≤ Cardinal.lift.{max u v} κ) (h4 : Cardinal.lift.{w} κ ≤ Cardinal.lift.{w'} #M) : ∃ S : L.ElementarySubstructure M, s ⊆ S ∧ Cardinal.lift.{w'} #S = Cardinal.lift.{w} κ :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_relabel {t : L.Term α} {g : α → β} {v : β → M} : (t.relabel g).realize v = t.realize (v ∘ g) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_functions_apply₁ {f : L.Functions 1} {t : L.Term α} {v : α → M} : (f.apply₁ t).realize v = funMap f ![t.realize v] :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_functions_apply₂ {f : L.Functions 2} {t₁ t₂ : L.Term α} {v : α → M} : (f.apply₂ t₁ t₂).realize v = funMap f ![t₁.realize v, t₂.realize v] :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_subst {t : L.Term α} {tf : α → L.Term β} {v : β → M} : (t.subst tf).realize v = t.realize fun a => (tf a).realize v :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_restrictVar [DecidableEq α] {t : L.Term α} {s : Set α} (h : ↑t.varFinset ⊆ s) {v : α → M} : (t.restrictVar (Set.inclusion h)).realize (v ∘ (↑)) = t.realize v :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_restrictVarLeft [DecidableEq α] {γ : Type*} {t : L.Term (Sum α γ)} {s : Set α} (h : ↑t.varFinsetLeft ⊆ s) {v : α → M} {xs : γ → M} : (t.restrictVarLeft (Set.inclusion h)).realize (Sum.elim (v ∘ (↑)) xs) = t.realize (Sum.elim v xs) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_constantsToVars [L[[α]].Structure M] [(lhomWithConstants L α).IsExpansionOn M] {t : L[[α]].Term β} {v : β → M} : t.constantsToVars.realize (Sum.elim (fun a => ↑(L.con a)) v) = t.realize v :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_varsToConstants [L[[α]].Structure M] [(lhomWithConstants L α).IsExpansionOn M] {t : L.Term (Sum α β)} {v : β → M} : t.varsToConstants.realize v = t.realize (Sum.elim (fun a => ↑(L.con a)) v) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_constantsVarsEquivLeft [L[[α]].Structure M] [(lhomWithConstants L α).IsExpansionOn M] {n} {t : L[[α]].Term (Sum β (Fin n))} {v : β → M} {xs : Fin n → M} : (constantsVarsEquivLeft t).realize (Sum.elim (Sum.elim (fun a => ↑(L.con a)) v) xs) = t.realize (Sum.elim v xs) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_onTerm [L'.Structure M] (φ : L →ᴸ L') [φ.IsExpansionOn M] (t : L.Term α) (v : α → M) : (φ.onTerm t).realize v = t.realize v :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem Hom.realize_term (g : M →[L] N) {t : L.Term α} {v : α → M} : t.realize (g ∘ v) = g (t.realize v) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_top : (⊤ : L.BoundedFormula α l).Realize v xs ↔ True :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_inf : (φ ⊓ ψ).Realize v xs ↔ φ.Realize v xs ∧ ψ.Realize v xs :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_foldr_inf (l : List (L.BoundedFormula α n)) (v : α → M) (xs : Fin n → M) : (l.foldr (· ⊓ ·) ⊤).Realize v xs ↔ ∀ φ ∈ l, BoundedFormula.Realize φ v xs :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_imp : (φ.imp ψ).Realize v xs ↔ φ.Realize v xs → ψ.Realize v xs :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_rel₁ {R : L.Relations 1} {t : L.Term _} : (R.boundedFormula₁ t).Realize v xs ↔ RelMap R ![t.realize (Sum.elim v xs)] :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_rel₂ {R : L.Relations 2} {t₁ t₂ : L.Term _} : (R.boundedFormula₂ t₁ t₂).Realize v xs ↔ RelMap R ![t₁.realize (Sum.elim v xs), t₂.realize (Sum.elim v xs)] :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_sup : (φ ⊔ ψ).Realize v xs ↔ φ.Realize v xs ∨ ψ.Realize v xs :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_foldr_sup (l : List (L.BoundedFormula α n)) (v : α → M) (xs : Fin n → M) : (l.foldr (· ⊔ ·) ⊥).Realize v xs ↔ ∃ φ ∈ l, BoundedFormula.Realize φ v xs :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_ex : θ.ex.Realize v xs ↔ ∃ a : M, θ.Realize v (Fin.snoc xs a) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_iff : (φ.iff ψ).Realize v xs ↔ (φ.Realize v xs ↔ ψ.Realize v xs) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_castLE_of_eq {m n : ℕ} (h : m = n) {h' : m ≤ n} {φ : L.BoundedFormula α m} {v : α → M} {xs : Fin n → M} : (φ.castLE h').Realize v xs ↔ φ.Realize v (xs ∘ cast h) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_mapTermRel_id [L'.Structure M] {ft : ∀ n, L.Term (Sum α (Fin n)) → L'.Term (Sum β (Fin n))} {fr : ∀ n, L.Relations n → L'.Relations n} {n} {φ : L.BoundedFormula α n} {v : α → M} {v' : β → M} {xs : Fin n → M} (h1 : ∀ (n) (t : L.Term (Sum α (Fin n))) (xs : Fin n → M), (ft n t).realize (Sum.elim v' xs) = t.realize (Sum.elim v xs)) (h2 : ∀ (n) (R : L.Relations n) (x : Fin n → M), RelMap (fr n R) x = RelMap R x) : (φ.mapTermRel ft fr fun _ => id).Realize v' xs ↔ φ.Realize v xs :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_mapTermRel_add_castLe [L'.Structure M] {k : ℕ} {ft : ∀ n, L.Term (Sum α (Fin n)) → L'.Term (Sum β (Fin (k + n)))} {fr : ∀ n, L.Relations n → L'.Relations n} {n} {φ : L.BoundedFormula α n} (v : ∀ {n}, (Fin (k + n) → M) → α → M) {v' : β → M} (xs : Fin (k + n) → M) (h1 : ∀ (n) (t : L.Term (Sum α (Fin n))) (xs' : Fin (k + n) → M), (ft n t).realize (Sum.elim v' xs') = t.realize (Sum.elim (v xs') (xs' ∘ Fin.natAdd _))) (h2 : ∀ (n) (R : L.Relations n) (x : Fin n → M), RelMap (fr n R) x = RelMap R x) (hv : ∀ (n) (xs : Fin (k + n) → M) (x : M), @v (n + 1) (snoc xs x : Fin _ → M) = v xs) : (φ.mapTermRel ft fr fun n => castLE (add_assoc _ _ _).symm.le).Realize v' xs ↔ φ.Realize (v xs) (xs ∘ Fin.natAdd _) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_relabel {m n : ℕ} {φ : L.BoundedFormula α n} {g : α → Sum β (Fin m)} {v : β → M} {xs : Fin (m + n) → M} : (φ.relabel g).Realize v xs ↔ φ.Realize (Sum.elim v (xs ∘ Fin.castAdd n) ∘ g) (xs ∘ Fin.natAdd m) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_liftAt {n n' m : ℕ} {φ : L.BoundedFormula α n} {v : α → M} {xs : Fin (n + n') → M} (hmn : m + n' ≤ n + 1) : (φ.liftAt n' m).Realize v xs ↔ φ.Realize v (xs ∘ fun i => if ↑i < m then Fin.castAdd n' i else Fin.addNat i n') :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_liftAt_one {n m : ℕ} {φ : L.BoundedFormula α n} {v : α → M} {xs : Fin (n + 1) → M} (hmn : m ≤ n) : (φ.liftAt 1 m).Realize v xs ↔ φ.Realize v (xs ∘ fun i => if ↑i < m then castSucc i else i.succ) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_liftAt_one_self {n : ℕ} {φ : L.BoundedFormula α n} {v : α → M} {xs : Fin (n + 1) → M} : (φ.liftAt 1 n).Realize v xs ↔ φ.Realize v (xs ∘ castSucc) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_subst {φ : L.BoundedFormula α n} {tf : α → L.Term β} {v : β → M} {xs : Fin n → M} : (φ.subst tf).Realize v xs ↔ φ.Realize (fun a => (tf a).realize v) xs :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_restrictFreeVar [DecidableEq α] {n : ℕ} {φ : L.BoundedFormula α n} {s : Set α} (h : ↑φ.freeVarFinset ⊆ s) {v : α → M} {xs : Fin n → M} : (φ.restrictFreeVar (Set.inclusion h)).Realize (v ∘ (↑)) xs ↔ φ.Realize v xs :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_constantsVarsEquiv [L[[α]].Structure M] [(lhomWithConstants L α).IsExpansionOn M] {n} {φ : L[[α]].BoundedFormula β n} {v : β → M} {xs : Fin n → M} : (constantsVarsEquiv φ).Realize (Sum.elim (fun a => ↑(L.con a)) v) xs ↔ φ.Realize v xs :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_relabelEquiv {g : α ≃ β} {k} {φ : L.BoundedFormula α k} {v : β → M} {xs : Fin k → M} : (relabelEquiv g φ).Realize v xs ↔ φ.Realize (v ∘ g) xs :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_all_liftAt_one_self {n : ℕ} {φ : L.BoundedFormula α n} {v : α → M} {xs : Fin n → M} : (φ.liftAt 1 n).all.Realize v xs ↔ φ.Realize v xs :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_toPrenexImpRight {φ ψ : L.BoundedFormula α n} (hφ : IsQF φ) (hψ : IsPrenex ψ) {v : α → M} {xs : Fin n → M} : (φ.toPrenexImpRight ψ).Realize v xs ↔ (φ.imp ψ).Realize v xs :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_toPrenexImp {φ ψ : L.BoundedFormula α n} (hφ : IsPrenex φ) (hψ : IsPrenex ψ) {v : α → M} {xs : Fin n → M} : (φ.toPrenexImp ψ).Realize v xs ↔ (φ.imp ψ).Realize v xs :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_toPrenex (φ : L.BoundedFormula α n) {v : α → M} : ∀ {xs : Fin n → M}, φ.toPrenex.Realize v xs ↔ φ.Realize v xs :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_onBoundedFormula [L'.Structure M] (φ : L →ᴸ L') [φ.IsExpansionOn M] {n : ℕ} (ψ : L.BoundedFormula α n) {v : α → M} {xs : Fin n → M} : (φ.onBoundedFormula ψ).Realize v xs ↔ ψ.Realize v xs :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_rel {k : ℕ} {R : L.Relations k} {ts : Fin k → L.Term α} : (R.formula ts).Realize v ↔ RelMap R fun i => (ts i).realize v :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_rel₁ {R : L.Relations 1} {t : L.Term _} : (R.formula₁ t).Realize v ↔ RelMap R ![t.realize v] :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_rel₂ {R : L.Relations 2} {t₁ t₂ : L.Term _} : (R.formula₂ t₁ t₂).Realize v ↔ RelMap R ![t₁.realize v, t₂.realize v] :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_relabel {φ : L.Formula α} {g : α → β} {v : β → M} : (φ.relabel g).Realize v ↔ φ.Realize (v ∘ g) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_relabel_sum_inr (φ : L.Formula (Fin n)) {v : Empty → M} {x : Fin n → M} : (BoundedFormula.relabel Sum.inr φ).Realize v x ↔ φ.Realize x :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_equal {t₁ t₂ : L.Term α} {x : α → M} : (t₁.equal t₂).Realize x ↔ t₁.realize x = t₂.realize x :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_graph {f : L.Functions n} {x : Fin n → M} {y : M} : (Formula.graph f).Realize (Fin.cons y x : _ → M) ↔ funMap f x = y :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem LHom.setOf_realize_onFormula [L'.Structure M] (φ : L →ᴸ L') [φ.IsExpansionOn M] (ψ : L.Formula α) : (setOf (φ.onFormula ψ).Realize : Set (α → M)) = setOf ψ.Realize :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_equivSentence_symm_con [L[[α]].Structure M] [(L.lhomWithConstants α).IsExpansionOn M] (φ : L[[α]].Sentence) : ((equivSentence.symm φ).Realize fun a => (L.con a : M)) ↔ φ.Realize M :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_equivSentence [L[[α]].Structure M] [(L.lhomWithConstants α).IsExpansionOn M] (φ : L.Formula α) : (equivSentence φ).Realize M ↔ φ.Realize fun a => (L.con a : M) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem elementarilyEquivalent_iff : M ≅[L] N ↔ ∀ φ : L.Sentence, M ⊨ φ ↔ N ⊨ φ :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem LHom.onTheory_model [L'.Structure M] (φ : L →ᴸ L') [φ.IsExpansionOn M] (T : L.Theory) : M ⊨ φ.onTheory T ↔ M ⊨ T :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem Model.union {T' : L.Theory} (h : M ⊨ T) (h' : M ⊨ T') : M ⊨ T ∪ T' :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem model_singleton_iff {φ : L.Sentence} : M ⊨ ({φ} : L.Theory) ↔ M ⊨ φ :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_iff_of_model_completeTheory [N ⊨ L.completeTheory M] (φ : L.Sentence) : N ⊨ φ ↔ M ⊨ φ :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_alls {φ : L.BoundedFormula α n} {v : α → M} : φ.alls.Realize v ↔ ∀ xs : Fin n → M, φ.Realize v xs :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_exs {φ : L.BoundedFormula α n} {v : α → M} : φ.exs.Realize v ↔ ∃ xs : Fin n → M, φ.Realize v xs :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem _root_.FirstOrder.Language.Formula.realize_iAlls [Finite γ] {f : α → β ⊕ γ} {φ : L.Formula α} {v : β → M} : (φ.iAlls f).Realize v ↔ ∀ (i : γ → M), φ.Realize (fun a => Sum.elim v i (f a)) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_iAlls [Finite γ] {f : α → β ⊕ γ} {φ : L.Formula α} {v : β → M} {v' : Fin 0 → M} : BoundedFormula.Realize (φ.iAlls f) v v' ↔ ∀ (i : γ → M), φ.Realize (fun a => Sum.elim v i (f a)) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem _root_.FirstOrder.Language.Formula.realize_iExs [Finite γ] {f : α → β ⊕ γ} {φ : L.Formula α} {v : β → M} : (φ.iExs f).Realize v ↔ ∃ (i : γ → M), φ.Realize (fun a => Sum.elim v i (f a)) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_iExs [Finite γ] {f : α → β ⊕ γ} {φ : L.Formula α} {v : β → M} {v' : Fin 0 → M} : BoundedFormula.Realize (φ.iExs f) v v' ↔ ∃ (i : γ → M), φ.Realize (fun a => Sum.elim v i (f a)) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_toFormula (φ : L.BoundedFormula α n) (v : Sum α (Fin n) → M) : φ.toFormula.Realize v ↔ φ.Realize (v ∘ Sum.inl) (v ∘ Sum.inr) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_iSup (s : Finset β) (f : β → L.BoundedFormula α n) (v : α → M) (v' : Fin n → M) : (iSup s f).Realize v v' ↔ ∃ b ∈ s, (f b).Realize v v' :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_iInf (s : Finset β) (f : β → L.BoundedFormula α n) (v : α → M) (v' : Fin n → M) : (iInf s f).Realize v v' ↔ ∀ b ∈ s, (f b).Realize v v' :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_boundedFormula (g : M ≃[L] N) (φ : L.BoundedFormula α n) {v : α → M} {xs : Fin n → M} : φ.Realize (g ∘ v) (g ∘ xs) ↔ φ.Realize v xs :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_formula (g : M ≃[L] N) (φ : L.Formula α) {v : α → M} : φ.Realize (g ∘ v) ↔ φ.Realize v :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_sentence (g : M ≃[L] N) (φ : L.Sentence) : M ⊨ φ ↔ N ⊨ φ :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem Sentence.realize_cardGe (n) : M ⊨ Sentence.cardGe L n ↔ ↑n ≤ #M :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem model_infiniteTheory_iff : M ⊨ L.infiniteTheory ↔ Infinite M :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem model_nonemptyTheory_iff : M ⊨ L.nonemptyTheory ↔ Nonempty M :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem model_distinctConstantsTheory {M : Type w} [L[[α]].Structure M] (s : Set α) : M ⊨ L.distinctConstantsTheory s ↔ Set.InjOn (fun i : α => (L.con i : M)) s :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem theory_model_iff (h : M ≅[L] N) : M ⊨ T ↔ N ⊨ T :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem funMap_cast {n : ℕ} (f : L.Functions n) (x : Fin n → ∀ a, M a) : (funMap f fun i => (x i : (u : Filter α).Product M)) = (fun a => funMap f fun i => x i a : (u : Filter α).Product M) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem term_realize_cast {β : Type*} (x : β → ∀ a, M a) (t : L.Term β) : (t.realize fun i => (x i : (u : Filter α).Product M)) = (fun a => t.realize fun i => x i a : (u : Filter α).Product M) :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem boundedFormula_realize_cast {β : Type*} {n : ℕ} (φ : L.BoundedFormula β n) (x : β → ∀ a, M a) (v : Fin n → ∀ a, M a) : (φ.Realize (fun i : β => (x i : (u : Filter α).Product M)) (fun i => (v i : (u : Filter α).Product M))) ↔ ∀ᶠ a : α in u, φ.Realize (fun i : β => x i a) fun i => v i a :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem realize_formula_cast {β : Type*} (φ : L.Formula β) (x : β → ∀ a, M a) : (φ.Realize fun i => (x i : (u : Filter α).Product M)) ↔ ∀ᶠ a : α in u, φ.Realize fun i => x i a :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem sentence_realize (φ : L.Sentence) : (u : Filter α).Product M ⊨ φ ↔ ∀ᶠ a : α in u, M a ⊨ φ :=", "area": "ModelTheory"} {"task": "t8", "statement": "theorem mem_iff_one_sub_mem {t : ℝ} : t ∈ I ↔ 1 - t ∈ I :=", "area": "Topology"} {"task": "t8", "statement": "theorem symm_zero : σ 0 = 1 :=", "area": "Topology"} {"task": "t8", "statement": "theorem symm_one : σ 1 = 0 :=", "area": "Topology"} {"task": "t8", "statement": "theorem symm_symm (x : I) : σ (σ x) = x :=", "area": "Topology"} {"task": "t8", "statement": "theorem continuous_symm : Continuous σ :=", "area": "Topology"} {"task": "t8", "statement": "theorem half_le_symm_iff (t : I) : 1 / 2 ≤ (σ t : ℝ) ↔ (t : ℝ) ≤ 1 / 2 :=", "area": "Topology"} {"task": "t8", "statement": "theorem one_minus_nonneg (x : I) : 0 ≤ 1 - (x : ℝ) :=", "area": "Topology"} {"task": "t8", "statement": "theorem one_minus_le_one (x : I) : 1 - (x : ℝ) ≤ 1 :=", "area": "Topology"} {"task": "t8", "statement": "theorem mul_pos_mem_iff {a t : ℝ} (ha : 0 < a) : a * t ∈ I ↔ t ∈ Set.Icc (0 : ℝ) (1 / a) :=", "area": "Topology"} {"task": "t8", "statement": "theorem two_mul_sub_one_mem_iff {t : ℝ} : 2 * t - 1 ∈ I ↔ t ∈ Set.Icc (1 / 2 : ℝ) 1 :=", "area": "Topology"} {"task": "t8", "statement": "lemma _root_.Set.abs_projIcc_sub_projIcc : (|projIcc a b h c - projIcc a b h d| : α) ≤ |c - d| :=", "area": "Topology"} {"task": "t8", "statement": "lemma addNSMul_zero : addNSMul h δ 0 = a :=", "area": "Topology"} {"task": "t8", "statement": "lemma addNSMul_eq_right [Archimedean α] (hδ : 0 < δ) : ∃ m, ∀ n ≥ m, addNSMul h δ n = b :=", "area": "Topology"} {"task": "t8", "statement": "lemma abs_sub_addNSMul_le (hδ : 0 ≤ δ) {t : Icc a b} (n : ℕ) (ht : t ∈ Icc (addNSMul h δ n) (addNSMul h δ (n+1))) : (|t - addNSMul h δ n| : α) ≤ δ :=", "area": "Topology"} {"task": "t8", "statement": "lemma exists_monotone_Icc_subset_open_cover_Icc {ι} {a b : ℝ} (h : a ≤ b) {c : ι → Set (Icc a b)} (hc₁ : ∀ i, IsOpen (c i)) (hc₂ : univ ⊆ ⋃ i, c i) : ∃ t : ℕ → Icc a b, t 0 = a ∧ Monotone t ∧ (∃ m, ∀ n ≥ m, t n = b) ∧ ∀ n, ∃ i, Icc (t n) (t (n + 1)) ⊆ c i :=", "area": "Topology"} {"task": "t8", "statement": "lemma exists_monotone_Icc_subset_open_cover_unitInterval {ι} {c : ι → Set I} (hc₁ : ∀ i, IsOpen (c i)) (hc₂ : univ ⊆ ⋃ i, c i) : ∃ t : ℕ → I, t 0 = 0 ∧ Monotone t ∧ (∃ n, ∀ m ≥ n, t m = 1) ∧ ∀ n, ∃ i, Icc (t n) (t (n + 1)) ⊆ c i :=", "area": "Topology"} {"task": "t8", "statement": "lemma exists_monotone_Icc_subset_open_cover_unitInterval_prod_self {ι} {c : ι → Set (I × I)} (hc₁ : ∀ i, IsOpen (c i)) (hc₂ : univ ⊆ ⋃ i, c i) : ∃ t : ℕ → I, t 0 = 0 ∧ Monotone t ∧ (∃ n, ∀ m ≥ n, t m = 1) ∧ ∀ n m, ∃ i, Icc (t n) (t (n + 1)) ×ˢ Icc (t m) (t (m + 1)) ⊆ c i :=", "area": "Topology"} {"task": "t8", "statement": "theorem affineHomeomorph_image_I (a b : 𝕜) (h : 0 < a) : affineHomeomorph a b h.ne.symm '' Set.Icc 0 1 = Set.Icc b (a + b) :=", "area": "Topology"} {"task": "t8", "statement": "theorem Inducing.comp (hg : Inducing g) (hf : Inducing f) : Inducing (g ∘ f) :=", "area": "Topology"} {"task": "t8", "statement": "theorem Inducing.of_comp_iff (hg : Inducing g) : Inducing (g ∘ f) ↔ Inducing f :=", "area": "Topology"} {"task": "t8", "statement": "theorem inducing_of_inducing_compose (hf : Continuous f) (hg : Continuous g) (hgf : Inducing (g ∘ f)) : Inducing f :=", "area": "Topology"} {"task": "t8", "statement": "theorem nhdsSet_eq_comap (hf : Inducing f) (s : Set X) : 𝓝ˢ s = comap f (𝓝ˢ (f '' s)) :=", "area": "Topology"} {"task": "t8", "statement": "theorem mapClusterPt_iff (hf : Inducing f) {x : X} {l : Filter X} : MapClusterPt (f x) l f ↔ ClusterPt x l :=", "area": "Topology"} {"task": "t8", "statement": "theorem tendsto_nhds_iff {f : ι → Y} {l : Filter ι} {y : Y} (hg : Inducing g) : Tendsto f l (𝓝 y) ↔ Tendsto (g ∘ f) l (𝓝 (g y)) :=", "area": "Topology"} {"task": "t8", "statement": "theorem continuous_iff (hg : Inducing g) : Continuous f ↔ Continuous (g ∘ f) :=", "area": "Topology"} {"task": "t8", "statement": "theorem continuousAt_iff' (hf : Inducing f) {x : X} (h : range f ∈ 𝓝 (f x)) : ContinuousAt (g ∘ f) x ↔ ContinuousAt g (f x) :=", "area": "Topology"} {"task": "t8", "statement": "theorem closure_eq_preimage_closure_image (hf : Inducing f) (s : Set X) : closure s = f ⁻¹' closure (f '' s) :=", "area": "Topology"} {"task": "t8", "statement": "theorem isClosed_iff (hf : Inducing f) {s : Set X} : IsClosed s ↔ ∃ t, IsClosed t ∧ f ⁻¹' t = s :=", "area": "Topology"} {"task": "t8", "statement": "theorem isClosed_iff' (hf : Inducing f) {s : Set X} : IsClosed s ↔ ∀ x, f x ∈ closure (f '' s) → x ∈ s :=", "area": "Topology"} {"task": "t8", "statement": "theorem isOpen_iff (hf : Inducing f) {s : Set X} : IsOpen s ↔ ∃ t, IsOpen t ∧ f ⁻¹' t = s :=", "area": "Topology"} {"task": "t8", "statement": "theorem dense_iff (hf : Inducing f) {s : Set X} : Dense s ↔ ∀ x, f x ∈ closure (f '' s) :=", "area": "Topology"} {"task": "t8", "statement": "theorem Embedding.of_comp_iff (hg : Embedding g) : Embedding (g ∘ f) ↔ Embedding f :=", "area": "Topology"} {"task": "t8", "statement": "theorem embedding_of_embedding_compose (hf : Continuous f) (hg : Continuous g) (hgf : Embedding (g ∘ f)) : Embedding f :=", "area": "Topology"} {"task": "t8", "statement": "theorem quotientMap_iff_closed : QuotientMap f ↔ Surjective f ∧ ∀ s : Set Y, IsClosed s ↔ IsClosed (f ⁻¹' s) :=", "area": "Topology"} {"task": "t8", "statement": "theorem comp (hg : QuotientMap g) (hf : QuotientMap f) : QuotientMap (g ∘ f) :=", "area": "Topology"} {"task": "t8", "statement": "theorem of_quotientMap_compose (hf : Continuous f) (hg : Continuous g) (hgf : QuotientMap (g ∘ f)) : QuotientMap g :=", "area": "Topology"} {"task": "t8", "statement": "theorem continuous_iff (hf : QuotientMap f) : Continuous g ↔ Continuous (g ∘ f) :=", "area": "Topology"} {"task": "t8", "statement": "theorem id : IsOpenMap (@id X) :=", "area": "Topology"} {"task": "t8", "statement": "theorem comp (hg : IsOpenMap g) (hf : IsOpenMap f) : IsOpenMap (g ∘ f) :=", "area": "Topology"} {"task": "t8", "statement": "theorem isOpen_range (hf : IsOpenMap f) : IsOpen (range f) :=", "area": "Topology"} {"task": "t8", "statement": "theorem of_sections (h : ∀ x, ∃ g : Y → X, ContinuousAt g (f x) ∧ g (f x) = x ∧ RightInverse g f) : IsOpenMap f :=", "area": "Topology"} {"task": "t8", "statement": "theorem preimage_closure_subset_closure_preimage (hf : IsOpenMap f) {s : Set Y} : f ⁻¹' closure s ⊆ closure (f ⁻¹' s) :=", "area": "Topology"} {"task": "t8", "statement": "theorem preimage_frontier_subset_frontier_preimage (hf : IsOpenMap f) {s : Set Y} : f ⁻¹' frontier s ⊆ frontier (f ⁻¹' s) :=", "area": "Topology"} {"task": "t8", "statement": "theorem preimage_frontier_eq_frontier_preimage (hf : IsOpenMap f) (hfc : Continuous f) (s : Set Y) : f ⁻¹' frontier s = frontier (f ⁻¹' s) :=", "area": "Topology"} {"task": "t8", "statement": "theorem isOpenMap_iff_interior : IsOpenMap f ↔ ∀ s, f '' interior s ⊆ interior (f '' s) :=", "area": "Topology"} {"task": "t8", "statement": "theorem id : IsClosedMap (@id X) :=", "area": "Topology"} {"task": "t8", "statement": "theorem comp (hg : IsClosedMap g) (hf : IsClosedMap f) : IsClosedMap (g ∘ f) :=", "area": "Topology"} {"task": "t8", "statement": "theorem of_inverse {f' : Y → X} (h : Continuous f') (l_inv : LeftInverse f f') (r_inv : RightInverse f f') : IsClosedMap f :=", "area": "Topology"} {"task": "t8", "statement": "theorem of_nonempty (h : ∀ s, IsClosed s → s.Nonempty → IsClosed (f '' s)) : IsClosedMap f :=", "area": "Topology"} {"task": "t8", "statement": "theorem Inducing.isClosedMap (hf : Inducing f) (h : IsClosed (range f)) : IsClosedMap f :=", "area": "Topology"} {"task": "t8", "statement": "theorem isClosedMap_iff_closure_image : IsClosedMap f ↔ ∀ s, closure (f '' s) ⊆ f '' closure s :=", "area": "Topology"} {"task": "t8", "statement": "theorem isClosedMap_iff_clusterPt : IsClosedMap f ↔ ∀ s y, MapClusterPt y (𝓟 s) f → ∃ x, f x = y ∧ ClusterPt x (𝓟 s) :=", "area": "Topology"} {"task": "t8", "statement": "theorem IsClosedMap.lift'_closure_map_eq (f_closed : IsClosedMap f) (f_cont : Continuous f) (F : Filter X) : (map f F).lift' closure = map f (F.lift' closure) :=", "area": "Topology"} {"task": "t8", "statement": "theorem IsClosedMap.mapClusterPt_iff_lift'_closure {F : Filter X} (f_closed : IsClosedMap f) (f_cont : Continuous f) {y : Y} : MapClusterPt y F f ↔ ((F.lift' closure) ⊓ 𝓟 (f ⁻¹' {y})).NeBot :=", "area": "Topology"} {"task": "t8", "statement": "theorem OpenEmbedding.open_iff_image_open (hf : OpenEmbedding f) {s : Set X} : IsOpen s ↔ IsOpen (f '' s) :=", "area": "Topology"} {"task": "t8", "statement": "theorem OpenEmbedding.tendsto_nhds_iff' (hf : OpenEmbedding f) {l : Filter Z} {x : X} : Tendsto (g ∘ f) (𝓝 x) l ↔ Tendsto g (𝓝 (f x)) l :=", "area": "Topology"} {"task": "t8", "statement": "theorem OpenEmbedding.open_iff_preimage_open (hf : OpenEmbedding f) {s : Set Y} (hs : s ⊆ range f) : IsOpen s ↔ IsOpen (f ⁻¹' s) :=", "area": "Topology"} {"task": "t8", "statement": "theorem openEmbedding_of_continuous_injective_open (h₁ : Continuous f) (h₂ : Injective f) (h₃ : IsOpenMap f) : OpenEmbedding f :=", "area": "Topology"} {"task": "t8", "statement": "theorem isOpenMap_iff (hg : OpenEmbedding g) : IsOpenMap f ↔ IsOpenMap (g ∘ f) :=", "area": "Topology"} {"task": "t8", "statement": "theorem of_comp_iff (f : X → Y) (hg : OpenEmbedding g) : OpenEmbedding (g ∘ f) ↔ OpenEmbedding f :=", "area": "Topology"} {"task": "t8", "statement": "theorem closed_iff_image_closed (hf : ClosedEmbedding f) {s : Set X} : IsClosed s ↔ IsClosed (f '' s) :=", "area": "Topology"} {"task": "t8", "statement": "theorem closed_iff_preimage_closed (hf : ClosedEmbedding f) {s : Set Y} (hs : s ⊆ range f) : IsClosed s ↔ IsClosed (f ⁻¹' s) :=", "area": "Topology"} {"task": "t8", "statement": "theorem _root_.closedEmbedding_of_continuous_injective_closed (h₁ : Continuous f) (h₂ : Injective f) (h₃ : IsClosedMap f) : ClosedEmbedding f :=", "area": "Topology"} {"task": "t8", "statement": "theorem of_comp_iff (hg : ClosedEmbedding g) : ClosedEmbedding (g ∘ f) ↔ ClosedEmbedding f :=", "area": "Topology"} {"task": "t8", "statement": "theorem isClopen_iff_frontier_eq_empty : IsClopen s ↔ frontier s = ∅ :=", "area": "Topology"} {"task": "t8", "statement": "theorem isClopen_inter_of_disjoint_cover_clopen {s a b : Set X} (h : IsClopen s) (cover : s ⊆ a ∪ b) (ha : IsOpen a) (hb : IsOpen b) (hab : Disjoint a b) : IsClopen (s ∩ a) :=", "area": "Topology"} {"task": "t8", "statement": "theorem continuous_boolIndicator_iff_isClopen (U : Set X) : Continuous U.boolIndicator ↔ IsClopen U :=", "area": "Topology"} {"task": "t8", "statement": "theorem continuousOn_boolIndicator_iff_isClopen (s U : Set X) : ContinuousOn U.boolIndicator s ↔ IsClopen (((↑) : s → X) ⁻¹' U) :=", "area": "Topology"} {"task": "t8", "statement": "theorem nhds_list (as : List α) : 𝓝 as = traverse 𝓝 as :=", "area": "Topology"} {"task": "t8", "statement": "theorem nhds_nil : 𝓝 ([] : List α) = pure [] :=", "area": "Topology"} {"task": "t8", "statement": "theorem nhds_cons (a : α) (l : List α) : 𝓝 (a::l) = List.cons <$> 𝓝 a <*> 𝓝 l :=", "area": "Topology"} {"task": "t8", "statement": "theorem List.tendsto_cons {a : α} {l : List α} : Tendsto (fun p : α × List α => List.cons p.1 p.2) (𝓝 a ×ˢ 𝓝 l) (𝓝 (a::l)) :=", "area": "Topology"} {"task": "t8", "statement": "theorem tendsto_cons_iff {β : Type*} {f : List α → β} {b : Filter β} {a : α} {l : List α} : Tendsto f (𝓝 (a::l)) b ↔ Tendsto (fun p : α × List α => f (p.1::p.2)) (𝓝 a ×ˢ 𝓝 l) b :=", "area": "Topology"} {"task": "t8", "statement": "theorem tendsto_nhds {β : Type*} {f : List α → β} {r : List α → Filter β} (h_nil : Tendsto f (pure []) (r [])) (h_cons : ∀ l a, Tendsto f (𝓝 l) (r l) → Tendsto (fun p : α × List α => f (p.1::p.2)) (𝓝 a ×ˢ 𝓝 l) (r (a::l))) : ∀ l, Tendsto f (𝓝 l) (r l)", "area": "Topology"} {"task": "t8", "statement": "theorem continuousAt_length : ∀ l : List α, ContinuousAt List.length l :=", "area": "Topology"} {"task": "t8", "statement": "theorem tendsto_insertNth' {a : α} : ∀ {n : ℕ} {l : List α}, Tendsto (fun p : α × List α => insertNth n p.1 p.2) (𝓝 a ×ˢ 𝓝 l) (𝓝 (insertNth n a l))", "area": "Topology"} {"task": "t8", "statement": "theorem continuous_insertNth {n : ℕ} : Continuous fun p : α × List α => insertNth n p.1 p.2 :=", "area": "Topology"} {"task": "t8", "statement": "theorem tendsto_eraseIdx : ∀ {n : ℕ} {l : List α}, Tendsto (eraseIdx · n) (𝓝 l) (𝓝 (eraseIdx l n))", "area": "Topology"} {"task": "t8", "statement": "theorem tendsto_prod [Monoid α] [ContinuousMul α] {l : List α} : Tendsto List.prod (𝓝 l) (𝓝 l.prod) :=", "area": "Topology"} {"task": "t8", "statement": "theorem tendsto_cons {n : ℕ} {a : α} {l : Vector α n} : Tendsto (fun p : α × Vector α n => p.1 ::ᵥ p.2) (𝓝 a ×ˢ 𝓝 l) (𝓝 (a ::ᵥ l)) :=", "area": "Topology"} {"task": "t8", "statement": "theorem tendsto_insertNth {n : ℕ} {i : Fin (n + 1)} {a : α} : ∀ {l : Vector α n}, Tendsto (fun p : α × Vector α n => insertNth p.1 i p.2) (𝓝 a ×ˢ 𝓝 l) (𝓝 (insertNth a i l))", "area": "Topology"} {"task": "t8", "statement": "theorem continuous_insertNth' {n : ℕ} {i : Fin (n + 1)} : Continuous fun p : α × Vector α n => insertNth p.1 i p.2 :=", "area": "Topology"} {"task": "t8", "statement": "theorem continuousAt_eraseIdx {n : ℕ} {i : Fin (n + 1)} : ∀ {l : Vector α (n + 1)}, ContinuousAt (eraseIdx i) l", "area": "Topology"} {"task": "t8", "statement": "lemma IsProperMap.isClosedMap (h : IsProperMap f) : IsClosedMap f :=", "area": "Topology"} {"task": "t8", "statement": "lemma isProperMap_iff_ultrafilter : IsProperMap f ↔ Continuous f ∧ ∀ ⦃𝒰 : Ultrafilter X⦄, ∀ ⦃y : Y⦄, Tendsto f 𝒰 (𝓝 y) → ∃ x, f x = y ∧ 𝒰 ≤ 𝓝 x :=", "area": "Topology"} {"task": "t8", "statement": "lemma IsProperMap.comp (hf : IsProperMap f) (hg : IsProperMap g) : IsProperMap (g ∘ f) :=", "area": "Topology"} {"task": "t8", "statement": "lemma isProperMap_of_comp_of_surj (hf : Continuous f) (hg : Continuous g) (hgf : IsProperMap (g ∘ f)) (f_surj : f.Surjective) : IsProperMap g :=", "area": "Topology"} {"task": "t8", "statement": "lemma isProperMap_of_comp_of_inj {f : X → Y} {g : Y → Z} (hf : Continuous f) (hg : Continuous g) (hgf : IsProperMap (g ∘ f)) (g_inj : g.Injective) : IsProperMap f :=", "area": "Topology"} {"task": "t8", "statement": "lemma isProperMap_of_comp_of_t2 [T2Space Y] (hf : Continuous f) (hg : Continuous g) (hgf : IsProperMap (g ∘ f)) : IsProperMap f :=", "area": "Topology"} {"task": "t8", "statement": "lemma IsProperMap.prod_map {g : Z → W} (hf : IsProperMap f) (hg : IsProperMap g) : IsProperMap (Prod.map f g) :=", "area": "Topology"} {"task": "t8", "statement": "lemma IsProperMap.pi_map {X Y : ι → Type*} [∀ i, TopologicalSpace (X i)] [∀ i, TopologicalSpace (Y i)] {f : (i : ι) → X i → Y i} (h : ∀ i, IsProperMap (f i)) : IsProperMap (fun (x : ∀ i, X i) i ↦ f i (x i)) :=", "area": "Topology"} {"task": "t8", "statement": "lemma IsProperMap.isCompact_preimage (h : IsProperMap f) {K : Set Y} (hK : IsCompact K) : IsCompact (f ⁻¹' K) :=", "area": "Topology"} {"task": "t8", "statement": "theorem isProperMap_iff_isClosedMap_and_compact_fibers : IsProperMap f ↔ Continuous f ∧ IsClosedMap f ∧ ∀ y, IsCompact (f ⁻¹' {y}) :=", "area": "Topology"} {"task": "t8", "statement": "lemma isProperMap_iff_isClosedMap_of_inj (f_cont : Continuous f) (f_inj : f.Injective) : IsProperMap f ↔ IsClosedMap f :=", "area": "Topology"} {"task": "t8", "statement": "lemma isProperMap_iff_isClosedMap_and_tendsto_cofinite [T1Space Y] : IsProperMap f ↔ Continuous f ∧ IsClosedMap f ∧ Tendsto f (cocompact X) cofinite :=", "area": "Topology"} {"task": "t8", "statement": "theorem Continuous.isProperMap [CompactSpace X] [T2Space Y] (hf : Continuous f) : IsProperMap f :=", "area": "Topology"} {"task": "t8", "statement": "theorem isProperMap_iff_isCompact_preimage [T2Space Y] [WeaklyLocallyCompactSpace Y] : IsProperMap f ↔ Continuous f ∧ ∀ ⦃K⦄, IsCompact K → IsCompact (f ⁻¹' K) :=", "area": "Topology"} {"task": "t8", "statement": "lemma isProperMap_iff_tendsto_cocompact [T2Space Y] [WeaklyLocallyCompactSpace Y] : IsProperMap f ↔ Continuous f ∧ Tendsto f (cocompact X) (cocompact Y) :=", "area": "Topology"} {"task": "t8", "statement": "theorem isProperMap_iff_isClosedMap_filter {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} : IsProperMap f ↔ Continuous f ∧ IsClosedMap (Prod.map f id : X × Filter X → Y × Filter X) :=", "area": "Topology"} {"task": "t8", "statement": "theorem isProperMap_iff_isClosedMap_ultrafilter {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} : IsProperMap f ↔ Continuous f ∧ IsClosedMap (Prod.map f id : X × Ultrafilter X → Y × Ultrafilter X) :=", "area": "Topology"} {"task": "t8", "statement": "theorem isProperMap_iff_universally_closed {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} : IsProperMap f ↔ Continuous f ∧ ∀ (Z : Type u) [TopologicalSpace Z], IsClosedMap (Prod.map f id : X × Z → Y × Z) :=", "area": "Topology"} {"task": "t8", "statement": "theorem embedding_toPullbackDiag (f : X → Y) : Embedding (toPullbackDiag f) :=", "area": "Topology"} {"task": "t8", "statement": "lemma Continuous.mapPullback {X₁ X₂ Y₁ Y₂ Z₁ Z₂} [TopologicalSpace X₁] [TopologicalSpace X₂] [TopologicalSpace Z₁] [TopologicalSpace Z₂] {f₁ : X₁ → Y₁} {g₁ : Z₁ → Y₁} {f₂ : X₂ → Y₂} {g₂ : Z₂ → Y₂} {mapX : X₁ → X₂} (contX : Continuous mapX) {mapY : Y₁ → Y₂} {mapZ : Z₁ → Z₂} (contZ : Continuous mapZ) {commX : f₂ ∘ mapX = mapY ∘ f₁} {commZ : g₂ ∘ mapZ = mapY ∘ g₁} : Continuous (Function.mapPullback mapX mapY mapZ commX commZ) :=", "area": "Topology"} {"task": "t8", "statement": "lemma isSeparatedMap_iff_disjoint_nhds {f : X → Y} : IsSeparatedMap f ↔ ∀ x₁ x₂, f x₁ = f x₂ → x₁ ≠ x₂ → Disjoint (𝓝 x₁) (𝓝 x₂) :=", "area": "Topology"} {"task": "t8", "statement": "lemma isSeparatedMap_iff_nhds {f : X → Y} : IsSeparatedMap f ↔ ∀ x₁ x₂, f x₁ = f x₂ → x₁ ≠ x₂ → ∃ s₁ ∈ 𝓝 x₁, ∃ s₂ ∈ 𝓝 x₂, Disjoint s₁ s₂ :=", "area": "Topology"} {"task": "t8", "statement": "theorem isSeparatedMap_iff_isClosed_diagonal {f : X → Y} : IsSeparatedMap f ↔ IsClosed f.pullbackDiagonal :=", "area": "Topology"} {"task": "t8", "statement": "theorem isSeparatedMap_iff_closedEmbedding {f : X → Y} : IsSeparatedMap f ↔ ClosedEmbedding (toPullbackDiag f) :=", "area": "Topology"} {"task": "t8", "statement": "theorem IsSeparatedMap.pullback {f : X → Y} (sep : IsSeparatedMap f) (g : A → Y) : IsSeparatedMap (@snd X Y A f g) :=", "area": "Topology"} {"task": "t8", "statement": "theorem IsSeparatedMap.comp_right {f : X → Y} (sep : IsSeparatedMap f) {g : A → X} (cont : Continuous g) (inj : g.Injective) : IsSeparatedMap (f ∘ g) :=", "area": "Topology"} {"task": "t8", "statement": "lemma isLocallyInjective_iff_nhds {f : X → Y} : IsLocallyInjective f ↔ ∀ x : X, ∃ U ∈ 𝓝 x, U.InjOn f :=", "area": "Topology"} {"task": "t8", "statement": "theorem isLocallyInjective_iff_isOpen_diagonal {f : X → Y} : IsLocallyInjective f ↔ IsOpen f.pullbackDiagonal :=", "area": "Topology"} {"task": "t8", "statement": "theorem IsLocallyInjective_iff_openEmbedding {f : X → Y} : IsLocallyInjective f ↔ OpenEmbedding (toPullbackDiag f) :=", "area": "Topology"} {"task": "t8", "statement": "theorem discreteTopology_iff_locallyInjective (y : Y) : DiscreteTopology X ↔ IsLocallyInjective fun _ : X ↦ y :=", "area": "Topology"} {"task": "t8", "statement": "theorem IsLocallyInjective.comp_right {f : X → Y} (hf : IsLocallyInjective f) {g : A → X} (cont : Continuous g) (hg : g.Injective) : IsLocallyInjective (f ∘ g) :=", "area": "Topology"} {"task": "t8", "statement": "theorem IsSeparatedMap.isClosed_eqLocus (he : f ∘ g₁ = f ∘ g₂) : IsClosed {a | g₁ a = g₂ a} :=", "area": "Topology"} {"task": "t8", "statement": "theorem IsLocallyInjective.isOpen_eqLocus (he : f ∘ g₁ = f ∘ g₂) : IsOpen {a | g₁ a = g₂ a} :=", "area": "Topology"} {"task": "t8", "statement": "theorem eq_of_comp_eq [PreconnectedSpace A] (h₁ : Continuous g₁) (h₂ : Continuous g₂) (he : p ∘ g₁ = p ∘ g₂) (a : A) (ha : g₁ a = g₂ a) : g₁ = g₂ :=", "area": "Topology"} {"task": "t8", "statement": "theorem eqOn_of_comp_eqOn (h₁ : ContinuousOn g₁ s) (h₂ : ContinuousOn g₂ s) (he : s.EqOn (p ∘ g₁) (p ∘ g₂)) {a : A} (has : a ∈ s) (ha : g₁ a = g₂ a) : s.EqOn g₁ g₂ :=", "area": "Topology"} {"task": "t8", "statement": "@[simp] lemma dirSupInacc_compl : DirSupInacc sᶜ ↔ DirSupClosed s :=", "area": "Topology"} {"task": "t8", "statement": "@[simp] lemma dirSupClosed_compl : DirSupClosed sᶜ ↔ DirSupInacc s :=", "area": "Topology"} {"task": "t8", "statement": "lemma DirSupInacc.union (hs : DirSupInacc s) (ht : DirSupInacc t) : DirSupInacc (s ∪ t) :=", "area": "Topology"} {"task": "t8", "statement": "lemma dirSupInacc_iff_forall_sSup : DirSupInacc s ↔ ∀ ⦃d⦄, d.Nonempty → DirectedOn (· ≤ ·) d → sSup d ∈ s → (d ∩ s).Nonempty :=", "area": "Topology"} {"task": "t8", "statement": "lemma dirSupClosed_iff_forall_sSup : DirSupClosed s ↔ ∀ ⦃d⦄, d.Nonempty → DirectedOn (· ≤ ·) d → d ⊆ s → sSup d ∈ s :=", "area": "Topology"} {"task": "t8", "statement": "lemma isOpen_iff : IsOpen s ↔ ∀ ⦃d : Set α⦄, d.Nonempty → DirectedOn (· ≤ ·) d → ∀ ⦃a : α⦄, IsLUB d a → a ∈ s → ∃ b ∈ d, Ici b ∩ d ⊆ s :=", "area": "Topology"} {"task": "t8", "statement": "lemma dirSupInacc_of_isOpen (h : IsOpen s) : DirSupInacc s :=", "area": "Topology"} {"task": "t8", "statement": "lemma isOpen_iff_isUpperSet_and_scottHausdorff_open : IsOpen s ↔ IsUpperSet s ∧ IsOpen[scottHausdorff α] s :=", "area": "Topology"} {"task": "t8", "statement": "lemma isOpen_iff_isUpperSet_and_dirSupInacc : IsOpen s ↔ IsUpperSet s ∧ DirSupInacc s :=", "area": "Topology"} {"task": "t8", "statement": "lemma isClosed_iff_isLowerSet_and_dirSupClosed : IsClosed s ↔ IsLowerSet s ∧ DirSupClosed s :=", "area": "Topology"} {"task": "t8", "statement": "lemma lowerClosure_subset_closure : ↑(lowerClosure s) ⊆ closure s :=", "area": "Topology"} {"task": "t8", "statement": "@[simp] lemma closure_singleton : closure {a} = Iic a :=", "area": "Topology"} {"task": "t8", "statement": "lemma monotone_of_continuous (hf : Continuous f) : Monotone f :=", "area": "Topology"} {"task": "t8", "statement": "@[simp] lemma scottContinuous_iff_continuous : ScottContinuous f ↔ Continuous f :=", "area": "Topology"} {"task": "t8", "statement": "lemma IsScott.scottHausdorff_le [IsScott α] : scottHausdorff α ≤ ‹TopologicalSpace α› :=", "area": "Topology"} {"task": "t8", "statement": "lemma isOpen_iff_isUpperSet : IsOpen s ↔ IsUpperSet s :=", "area": "Topology"} {"task": "t8", "statement": "lemma isClosed_iff_isLower : IsClosed s ↔ IsLowerSet s :=", "area": "Topology"} {"task": "t8", "statement": "lemma closure_eq_lowerClosure {s : Set α} : closure s = lowerClosure s :=", "area": "Topology"} {"task": "t8", "statement": "@[simp] lemma closure_singleton {a : α} : closure {a} = Iic a :=", "area": "Topology"} {"task": "t8", "statement": "protected lemma monotone_iff_continuous [TopologicalSpace α] [TopologicalSpace β] [Topology.IsUpperSet α] [Topology.IsUpperSet β] {f : α → β} : Monotone f ↔ Continuous f :=", "area": "Topology"} {"task": "t8", "statement": "lemma monotone_to_upperTopology_continuous [TopologicalSpace α] [TopologicalSpace β] [Topology.IsUpperSet α] [IsUpper β] {f : α → β} (hf : Monotone f) : Continuous f :=", "area": "Topology"} {"task": "t8", "statement": "lemma upperSet_le_upper {t₁ t₂ : TopologicalSpace α} [@Topology.IsUpperSet α t₁ _] [@Topology.IsUpper α t₂ _] : t₁ ≤ t₂ :=", "area": "Topology"} {"task": "t8", "statement": "lemma isOpen_iff_isLowerSet : IsOpen s ↔ IsLowerSet s :=", "area": "Topology"} {"task": "t8", "statement": "lemma isClosed_iff_isUpper : IsClosed s ↔ IsUpperSet s :=", "area": "Topology"} {"task": "t8", "statement": "@[simp] lemma closure_singleton {a : α} : closure {a} = Ici a :=", "area": "Topology"} {"task": "t8", "statement": "protected lemma monotone_iff_continuous [TopologicalSpace α] [TopologicalSpace β] [Topology.IsLowerSet α] [Topology.IsLowerSet β] {f : α → β} : Monotone f ↔ Continuous f :=", "area": "Topology"} {"task": "t8", "statement": "lemma lowerSet_le_lower {t₁ t₂ : TopologicalSpace α} [@Topology.IsLowerSet α t₁ _] [@IsLower α t₂ _] : t₁ ≤ t₂ :=", "area": "Topology"} {"task": "t8", "statement": "lemma isUpperSet_orderDual [Preorder α] [TopologicalSpace α] : Topology.IsUpperSet αᵒᵈ ↔ Topology.IsLowerSet α :=", "area": "Topology"} {"task": "t8", "statement": "@[simp] lemma toUpperSet_specializes_toUpperSet {a b : α} : toUpperSet a ⤳ toUpperSet b ↔ b ≤ a :=", "area": "Topology"} {"task": "t8", "statement": "@[simp] lemma toLowerSet_specializes_toLowerSet {a b : α} : toLowerSet a ⤳ toLowerSet b ↔ a ≤ b :=", "area": "Topology"} {"task": "t8", "statement": "theorem isTopologicalBasis : TopologicalSpace.IsTopologicalBasis (lawsonBasis α) :=", "area": "Topology"} {"task": "t8", "statement": "lemma isLawson_le_isScott : L ≤ S :=", "area": "Topology"} {"task": "t8", "statement": "lemma scottHausdorff_le_isLawson : scottHausdorff α ≤ L :=", "area": "Topology"} {"task": "t8", "statement": "lemma lawsonOpen_iff_scottOpen_of_isUpperSet' (s : Set α) (h : IsUpperSet s) : IsOpen[L] s ↔ IsOpen[S] s :=", "area": "Topology"} {"task": "t8", "statement": "lemma lawsonClosed_iff_scottClosed_of_isLowerSet (s : Set α) (h : IsLowerSet s) : IsClosed[L] s ↔ IsClosed[S] s :=", "area": "Topology"} {"task": "t8", "statement": "lemma lawsonClosed_iff_dirSupClosed_of_isLowerSet (s : Set α) (h : IsLowerSet s) : IsClosed[L] s ↔ DirSupClosed s :=", "area": "Topology"} {"task": "t8", "statement": "lemma singleton_isClosed (a : α) : IsClosed ({a} : Set α) :=", "area": "Topology"} {"task": "t8", "statement": "theorem exists_isClopen_upper_or_lower_of_ne (h : x ≠ y) : ∃ U : Set α, IsClopen U ∧ (IsUpperSet U ∨ IsLowerSet U) ∧ x ∈ U ∧ y ∉ U :=", "area": "Topology"} {"task": "t8", "statement": "theorem continuous_proj : Continuous (Proj J : (I → Bool) → (I → Bool)) :=", "area": "Topology"} {"task": "t8", "statement": "theorem proj_eq_self {x : I → Bool} (h : ∀ i, x i ≠ false → J i) : Proj J x = x :=", "area": "Topology"} {"task": "t8", "statement": "theorem proj_prop_eq_self (hh : ∀ i x, x ∈ C → x i ≠ false → J i) : π C J = C :=", "area": "Topology"} {"task": "t8", "statement": "theorem proj_comp_of_subset (h : ∀ i, J i → K i) : (Proj J ∘ Proj K) = (Proj J : (I → Bool) → (I → Bool)) :=", "area": "Topology"} {"task": "t8", "statement": "theorem proj_eq_of_subset (h : ∀ i, J i → K i) : π (π C K) J = π C J :=", "area": "Topology"} {"task": "t8", "statement": "theorem projRestricts_eq_id : ProjRestricts C (fun i (h : J i) ↦ h) = id :=", "area": "Topology"} {"task": "t8", "statement": "theorem projRestricts_eq_comp (hJK : ∀ i, J i → K i) (hKL : ∀ i, K i → L i) : ProjRestricts C hJK ∘ ProjRestricts C hKL = ProjRestricts C (fun i ↦ hKL i ∘ hJK i) :=", "area": "Topology"} {"task": "t8", "statement": "theorem projRestricts_comp_projRestrict (h : ∀ i, J i → K i) : ProjRestricts C h ∘ ProjRestrict C K = ProjRestrict C J :=", "area": "Topology"} {"task": "t8", "statement": "lemma iso_map_bijective : Function.Bijective (iso_map C J) :=", "area": "Topology"} {"task": "t8", "statement": "theorem lt_iff_lex_lt (l m : Products I) : l < m ↔ List.Lex (·<·) l.val m.val :=", "area": "Topology"} {"task": "t8", "statement": "theorem injective : Function.Injective (eval C) :=", "area": "Topology"} {"task": "t8", "statement": "theorem linearIndependent_iff_range : LinearIndependent ℤ (GoodProducts.eval C) ↔ LinearIndependent ℤ (fun (p : range C) ↦ p.1) :=", "area": "Topology"} {"task": "t8", "statement": "theorem eval_eq (l : Products I) (x : C) : l.eval C x = if ∀ i, i ∈ l.val → (x.val i = true) then 1 else 0 :=", "area": "Topology"} {"task": "t8", "statement": "theorem evalFacProp {l : Products I} (J : I → Prop) (h : ∀ a, a ∈ l.val → J a) [∀ j, Decidable (J j)] : l.eval (π C J) ∘ ProjRestrict C J = l.eval C :=", "area": "Topology"} {"task": "t8", "statement": "theorem evalFacProps {l : Products I} (J K : I → Prop) (h : ∀ a, a ∈ l.val → J a) [∀ j, Decidable (J j)] [∀ j, Decidable (K j)] (hJK : ∀ i, J i → K i) : l.eval (π C J) ∘ ProjRestricts C hJK = l.eval (π C K) :=", "area": "Topology"} {"task": "t8", "statement": "theorem prop_of_isGood {l : Products I} (J : I → Prop) [∀ j, Decidable (J j)] (h : l.isGood (π C J)) : ∀ a, a ∈ l.val → J a :=", "area": "Topology"} {"task": "t8", "statement": "theorem GoodProducts.span_iff_products : ⊤ ≤ span ℤ (Set.range (eval C)) ↔ ⊤ ≤ span ℤ (Set.range (Products.eval C)) :=", "area": "Topology"} {"task": "t8", "statement": "theorem eval_eq_πJ (l : Products I) (hl : l.isGood (π C (· ∈ s))) : l.eval C = πJ C s (l.eval (π C (· ∈ s))) :=", "area": "Topology"} {"task": "t8", "statement": "theorem spanFinBasis.span : ⊤ ≤ Submodule.span ℤ (Set.range (spanFinBasis C s)) :=", "area": "Topology"} {"task": "t8", "statement": "theorem list_prod_apply (x : C) (l : List (LocallyConstant C ℤ)) : l.prod x = (l.map (LocallyConstant.evalMonoidHom x)).prod :=", "area": "Topology"} {"task": "t8", "statement": "theorem factors_prod_eq_basis_of_eq {x y : (π C fun x ↦ x ∈ s)} (h : y = x) : (factors C s x).prod y = 1 :=", "area": "Topology"} {"task": "t8", "statement": "theorem e_mem_of_eq_true {x : (π C (· ∈ s))} {a : I} (hx : x.val a = true) : e (π C (· ∈ s)) a ∈ factors C s x :=", "area": "Topology"} {"task": "t8", "statement": "theorem one_sub_e_mem_of_false {x y : (π C (· ∈ s))} {a : I} (ha : y.val a = true) (hx : x.val a = false) : 1 - e (π C (· ∈ s)) a ∈ factors C s x :=", "area": "Topology"} {"task": "t8", "statement": "theorem factors_prod_eq_basis_of_ne {x y : (π C (· ∈ s))} (h : y ≠ x) : (factors C s x).prod y = 0 :=", "area": "Topology"} {"task": "t8", "statement": "theorem factors_prod_eq_basis (x : π C (· ∈ s)) : (factors C s x).prod = spanFinBasis C s x :=", "area": "Topology"} {"task": "t8", "statement": "theorem GoodProducts.finsupp_sum_mem_span_eval {a : I} {as : List I} (ha : List.Chain' (· > ·) (a :: as)) {c : Products I →₀ ℤ} (hc : (c.support : Set (Products I)) ⊆ {m | m.val ≤ as}) : (Finsupp.sum c fun a_1 b ↦ e (π C (· ∈ s)) a * b • Products.eval (π C (· ∈ s)) a_1) ∈ Submodule.span ℤ (Products.eval (π C (· ∈ s)) '' {m | m.val ≤ a :: as}) :=", "area": "Topology"} {"task": "t8", "statement": "theorem GoodProducts.spanFin : ⊤ ≤ Submodule.span ℤ (Set.range (eval (π C (· ∈ s)))) :=", "area": "Topology"} {"task": "t8", "statement": "theorem fin_comap_jointlySurjective (hC : IsClosed C) (f : LocallyConstant C ℤ) : ∃ (s : Finset I) (g : LocallyConstant (π C (· ∈ s)) ℤ), f = g.comap ⟨(ProjRestrict C (· ∈ s)), continuous_projRestrict _ _⟩ :=", "area": "Topology"} {"task": "t8", "statement": "theorem GoodProducts.span (hC : IsClosed C) : ⊤ ≤ Submodule.span ℤ (Set.range (eval C)) :=", "area": "Topology"} {"task": "t8", "statement": "theorem term_ord_aux {i : I} (ho : ord I i < Ordinal.type ((·<·) : I → I → Prop)) : term I ho = i :=", "area": "Topology"} {"task": "t8", "statement": "theorem ord_term_aux {o : Ordinal} (ho : o < Ordinal.type ((·<·) : I → I → Prop)) : ord I (term I ho) = o :=", "area": "Topology"} {"task": "t8", "statement": "theorem ord_term {o : Ordinal} (ho : o < Ordinal.type ((·<·) : I → I → Prop)) (i : I) : ord I i = o ↔ term I ho = i :=", "area": "Topology"} {"task": "t8", "statement": "theorem Products.prop_of_isGood_of_contained {l : Products I} (o : Ordinal) (h : l.isGood C) (hsC : contained C o) (i : I) (hi : i ∈ l.val) : ord I i < o :=", "area": "Topology"} {"task": "t8", "statement": "theorem Products.lt_nil_empty : { m : Products I | m < Products.nil } = ∅ :=", "area": "Topology"} {"task": "t8", "statement": "theorem Products.isGood_nil : Products.isGood ({fun _ ↦ false} : Set (I → Bool)) Products.nil :=", "area": "Topology"} {"task": "t8", "statement": "theorem Products.span_nil_eq_top : Submodule.span ℤ (eval ({fun _ ↦ false} : Set (I → Bool)) '' {nil}) = ⊤ :=", "area": "Topology"} {"task": "t8", "statement": "theorem GoodProducts.linearIndependentSingleton : LinearIndependent ℤ (eval ({fun _ ↦ false} : Set (I → Bool))) :=", "area": "Topology"} {"task": "t8", "statement": "theorem contained_eq_proj (o : Ordinal) (h : contained C o) : C = π C (ord I · < o) :=", "area": "Topology"} {"task": "t8", "statement": "theorem contained_proj (o : Ordinal) : contained (π C (ord I · < o)) o :=", "area": "Topology"} {"task": "t8", "statement": "theorem coe_πs (o : Ordinal) (f : LocallyConstant (π C (ord I · < o)) ℤ) : πs C o f = f ∘ ProjRestrict C (ord I · < o) :=", "area": "Topology"} {"task": "t8", "statement": "theorem coe_πs' {o₁ o₂ : Ordinal} (h : o₁ ≤ o₂) (f : LocallyConstant (π C (ord I · < o₁)) ℤ) : (πs' C h f).toFun = f.toFun ∘ (ProjRestricts C (fun _ hh ↦ lt_of_lt_of_le hh h)) :=", "area": "Topology"} {"task": "t8", "statement": "theorem eval_πs {l : Products I} {o : Ordinal} (hlt : ∀ i ∈ l.val, ord I i < o) : πs C o (l.eval (π C (ord I · < o))) = l.eval C :=", "area": "Topology"} {"task": "t8", "statement": "theorem eval_πs' {l : Products I} {o₁ o₂ : Ordinal} (h : o₁ ≤ o₂) (hlt : ∀ i ∈ l.val, ord I i < o₁) : πs' C h (l.eval (π C (ord I · < o₁))) = l.eval (π C (ord I · < o₂)) :=", "area": "Topology"} {"task": "t8", "statement": "theorem eval_πs_image {l : Products I} {o : Ordinal} (hl : ∀ i ∈ l.val, ord I i < o) : eval C '' { m | m < l } = (πs C o) '' (eval (π C (ord I · < o)) '' { m | m < l }) :=", "area": "Topology"} {"task": "t8", "statement": "theorem eval_πs_image' {l : Products I} {o₁ o₂ : Ordinal} (h : o₁ ≤ o₂) (hl : ∀ i ∈ l.val, ord I i < o₁) : eval (π C (ord I · < o₂)) '' { m | m < l } = (πs' C h) '' (eval (π C (ord I · < o₁)) '' { m | m < l }) :=", "area": "Topology"} {"task": "t8", "statement": "theorem isGood_mono {l : Products I} {o₁ o₂ : Ordinal} (h : o₁ ≤ o₂) (hl : l.isGood (π C (ord I · < o₁))) : l.isGood (π C (ord I · < o₂)) :=", "area": "Topology"} {"task": "t8", "statement": "theorem range_equiv_smaller_toFun_bijective (o : Ordinal) : Function.Bijective (range_equiv_smaller_toFun C o) :=", "area": "Topology"} {"task": "t8", "statement": "theorem smaller_factorization (o : Ordinal) : (fun (p : smaller C o) ↦ p.1) ∘ (range_equiv_smaller C o).toFun = (πs C o) ∘ (fun (p : range (π C (ord I · < o))) ↦ p.1) :=", "area": "Topology"} {"task": "t8", "statement": "theorem linearIndependent_iff_smaller (o : Ordinal) : LinearIndependent ℤ (GoodProducts.eval (π C (ord I · < o))) ↔ LinearIndependent ℤ (fun (p : smaller C o) ↦ p.1) :=", "area": "Topology"} {"task": "t8", "statement": "theorem smaller_mono {o₁ o₂ : Ordinal} (h : o₁ ≤ o₂) : smaller C o₁ ⊆ smaller C o₂ :=", "area": "Topology"} {"task": "t8", "statement": "theorem Products.limitOrdinal (l : Products I) : l.isGood (π C (ord I · < o)) ↔ ∃ (o' : Ordinal), o' < o ∧ l.isGood (π C (ord I · < o')) :=", "area": "Topology"} {"task": "t8", "statement": "theorem GoodProducts.union : range C = ⋃ (e : {o' // o' < o}), (smaller C e.val) :=", "area": "Topology"} {"task": "t8", "statement": "theorem GoodProducts.linearIndependent_iff_union_smaller {o : Ordinal} (ho : o.IsLimit) (hsC : contained C o) : LinearIndependent ℤ (GoodProducts.eval C) ↔ LinearIndependent ℤ (fun (p : ⋃ (e : {o' // o' < o}), (smaller C e.val)) ↦ p.1) :=", "area": "Topology"} {"task": "t8", "statement": "theorem isClosed_C0 : IsClosed (C0 C ho) :=", "area": "Topology"} {"task": "t8", "statement": "theorem isClosed_C1 : IsClosed (C1 C ho) :=", "area": "Topology"} {"task": "t8", "statement": "theorem union_C0C1_eq : (C0 C ho) ∪ (C1 C ho) = C :=", "area": "Topology"} {"task": "t8", "statement": "theorem continuous_swapTrue : Continuous (SwapTrue o : (I → Bool) → I → Bool) :=", "area": "Topology"} {"task": "t8", "statement": "theorem swapTrue_mem_C1 (f : π (C1 C ho) (ord I · < o)) : SwapTrue o f.val ∈ C1 C ho :=", "area": "Topology"} {"task": "t8", "statement": "theorem CC_comp_zero : ∀ y, (Linear_CC' C hsC ho) ((πs C o) y) = 0 :=", "area": "Topology"} {"task": "t8", "statement": "theorem C0_projOrd {x : I → Bool} (hx : x ∈ C0 C ho) : Proj (ord I · < o) x = x :=", "area": "Topology"} {"task": "t8", "statement": "theorem C1_projOrd {x : I → Bool} (hx : x ∈ C1 C ho) : SwapTrue o (Proj (ord I · < o) x) = x :=", "area": "Topology"} {"task": "t8", "statement": "theorem CC_exact {f : LocallyConstant C ℤ} (hf : Linear_CC' C hsC ho f = 0) : ∃ y, πs C o y = f :=", "area": "Topology"} {"task": "t8", "statement": "theorem succ_mono : CategoryTheory.Mono (ModuleCat.ofHom (πs C o)) :=", "area": "Topology"} {"task": "t8", "statement": "theorem succ_exact : (ShortComplex.mk (ModuleCat.ofHom (πs C o)) (ModuleCat.ofHom (Linear_CC' C hsC ho)) (by ext; apply CC_comp_zero)).Exact :=", "area": "Topology"} {"task": "t8", "statement": "theorem union_succ : GoodProducts C = GoodProducts (π C (ord I · < o)) ∪ MaxProducts C ho :=", "area": "Topology"} {"task": "t8", "statement": "theorem injective_sum_to : Function.Injective (sum_to C ho) :=", "area": "Topology"} {"task": "t8", "statement": "theorem sum_to_range : Set.range (sum_to C ho) = GoodProducts (π C (ord I · < o)) ∪ MaxProducts C ho :=", "area": "Topology"} {"task": "t8", "statement": "theorem sum_equiv_comp_eval_eq_elim : eval C ∘ (sum_equiv C hsC ho).toFun = (Sum.elim (fun (l : GoodProducts (π C (ord I · < o))) ↦ Products.eval C l.1) (fun (l : MaxProducts C ho) ↦ Products.eval C l.1)) :=", "area": "Topology"} {"task": "t8", "statement": "theorem linearIndependent_iff_sum : LinearIndependent ℤ (eval C) ↔ LinearIndependent ℤ (SumEval C ho) :=", "area": "Topology"} {"task": "t8", "statement": "theorem span_sum : Set.range (eval C) = Set.range (Sum.elim (fun (l : GoodProducts (π C (ord I · < o))) ↦ Products.eval C l.1) (fun (l : MaxProducts C ho) ↦ Products.eval C l.1)) :=", "area": "Topology"} {"task": "t8", "statement": "theorem square_commutes : SumEval C ho ∘ Sum.inl = ModuleCat.ofHom (πs C o) ∘ eval (π C (ord I · < o)) :=", "area": "Topology"} {"task": "t8", "statement": "theorem swapTrue_eq_true (x : I → Bool) : SwapTrue o x (term I ho) = true :=", "area": "Topology"} {"task": "t8", "statement": "theorem mem_C'_eq_false : ∀ x, x ∈ C' C ho → x (term I ho) = false :=", "area": "Topology"} {"task": "t8", "statement": "theorem Products.max_eq_o_cons_tail [Inhabited I] (l : Products I) (hl : l.val ≠ []) (hlh : l.val.head! = term I ho) : l.val = term I ho :: l.Tail.val :=", "area": "Topology"} {"task": "t8", "statement": "theorem Products.max_eq_o_cons_tail' [Inhabited I] (l : Products I) (hl : l.val ≠ []) (hlh : l.val.head! = term I ho) (hlc : List.Chain' (·>·) (term I ho :: l.Tail.val)) : l = ⟨term I ho :: l.Tail.val, hlc⟩ :=", "area": "Topology"} {"task": "t8", "statement": "theorem GoodProducts.head!_eq_o_of_maxProducts [Inhabited I] (l : ↑(MaxProducts C ho)) : l.val.val.head! = term I ho :=", "area": "Topology"} {"task": "t8", "statement": "theorem Products.evalCons {l : List I} {a : I} (hla : (a::l).Chain' (·>·)) : Products.eval C ⟨a::l,hla⟩ = (e C a) * Products.eval C ⟨l,List.Chain'.sublist hla (List.tail_sublist (a::l))⟩ :=", "area": "Topology"} {"task": "t8", "statement": "theorem Products.max_eq_eval [Inhabited I] (l : Products I) (hl : l.val ≠ []) (hlh : l.val.head! = term I ho) : Linear_CC' C hsC ho (l.eval C) = l.Tail.eval (C' C ho) :=", "area": "Topology"} {"task": "t8", "statement": "theorem max_eq_eval_unapply : (Linear_CC' C hsC ho) ∘ (fun (l : MaxProducts C ho) ↦ Products.eval C l.val) = (fun l ↦ l.val.Tail.eval (C' C ho)) :=", "area": "Topology"} {"task": "t8", "statement": "theorem chain'_cons_of_lt (l : MaxProducts C ho) (q : Products I) (hq : q < l.val.Tail) : List.Chain' (fun x x_1 ↦ x > x_1) (term I ho :: q.val) :=", "area": "Topology"} {"task": "t8", "statement": "theorem good_lt_maxProducts (q : GoodProducts (π C (ord I · < o))) (l : MaxProducts C ho) : List.Lex (·<·) q.val.val l.val.val :=", "area": "Topology"} {"task": "t8", "statement": "theorem maxTail_isGood (l : MaxProducts C ho) (h₁: ⊤ ≤ Submodule.span ℤ (Set.range (eval (π C (ord I · < o))))) : l.val.Tail.isGood (C' C ho) :=", "area": "Topology"} {"task": "t8", "statement": "theorem maxToGood_injective (h₁: ⊤ ≤ Submodule.span ℤ (Set.range (eval (π C (ord I · < o))))) : (MaxToGood C hC hsC ho h₁).Injective :=", "area": "Topology"} {"task": "t8", "statement": "theorem linearIndependent_comp_of_eval (h₁: ⊤ ≤ Submodule.span ℤ (Set.range (eval (π C (ord I · < o))))) : LinearIndependent ℤ (eval (C' C ho)) → LinearIndependent ℤ (ModuleCat.ofHom (Linear_CC' C hsC ho) ∘ SumEval C ho ∘ Sum.inr) :=", "area": "Topology"} {"task": "t8", "statement": "theorem GoodProducts.P0 : P I 0 :=", "area": "Topology"} {"task": "t8", "statement": "theorem GoodProducts.Plimit (o : Ordinal) (ho : Ordinal.IsLimit o) : (∀ (o' : Ordinal), o' < o → P I o') → P I o :=", "area": "Topology"} {"task": "t8", "statement": "theorem GoodProducts.linearIndependentAux (μ : Ordinal) : P I μ :=", "area": "Topology"} {"task": "t8", "statement": "theorem Nobeling.embedding : ClosedEmbedding (Nobeling.ι S) :=", "area": "Topology"} {"task": "t8", "statement": "theorem Perfect.small_diam_aux (ε_pos : 0 < ε) {x : α} (xC : x ∈ C) : let D := closure (EMetric.ball x (ε / 2) ∩ C) Perfect D ∧ D.Nonempty ∧ D ⊆ C ∧ EMetric.diam D ≤ ε :=", "area": "Topology"} {"task": "t8", "statement": "theorem Perfect.small_diam_splitting (ε_pos : 0 < ε) : ∃ C₀ C₁ : Set α, (Perfect C₀ ∧ C₀.Nonempty ∧ C₀ ⊆ C ∧ EMetric.diam C₀ ≤ ε) ∧ (Perfect C₁ ∧ C₁.Nonempty ∧ C₁ ⊆ C ∧ EMetric.diam C₁ ≤ ε) ∧ Disjoint C₀ C₁ :=", "area": "Topology"} {"task": "t8", "statement": "theorem Perfect.exists_nat_bool_injection [CompleteSpace α] : ∃ f : (ℕ → Bool) → α, range f ⊆ C ∧ Continuous f ∧ Injective f :=", "area": "Topology"} {"task": "t8", "statement": "theorem IsClosed.exists_nat_bool_injection_of_not_countable {α : Type*} [TopologicalSpace α] [PolishSpace α] {C : Set α} (hC : IsClosed C) (hunc : ¬C.Countable) : ∃ f : (ℕ → Bool) → α, range f ⊆ C ∧ Continuous f ∧ Function.Injective f :=", "area": "Topology"} {"task": "t8", "statement": "theorem embeddingOfSubset_dist_le (a b : α) : dist (embeddingOfSubset x a) (embeddingOfSubset x b) ≤ dist a b :=", "area": "Topology"} {"task": "t8", "statement": "theorem embeddingOfSubset_isometry (H : DenseRange x) : Isometry (embeddingOfSubset x) :=", "area": "Topology"} {"task": "t8", "statement": "theorem exists_isometric_embedding (α : Type u) [MetricSpace α] [SeparableSpace α] : ∃ f : α → ℓ^∞(ℕ), Isometry f :=", "area": "Topology"} {"task": "t8", "statement": "theorem LipschitzOnWith.extend_lp_infty [PseudoMetricSpace α] {s : Set α} {ι : Type*} {f : α → ℓ^∞(ι)} {K : ℝ≥0} (hfl : LipschitzOnWith K f s) : ∃ g : α → ℓ^∞(ι), LipschitzWith K g ∧ EqOn f g s :=", "area": "Topology"} {"task": "t8", "statement": "theorem glueDist_glued_points [Nonempty Z] (Φ : Z → X) (Ψ : Z → Y) (ε : ℝ) (p : Z) : glueDist Φ Ψ ε (.inl (Φ p)) (.inr (Ψ p)) = ε :=", "area": "Topology"} {"task": "t8", "statement": "theorem glueDist_swap (Φ : Z → X) (Ψ : Z → Y) (ε : ℝ) : ∀ x y, glueDist Ψ Φ ε x.swap y.swap = glueDist Φ Ψ ε x y", "area": "Topology"} {"task": "t8", "statement": "theorem le_glueDist_inr_inl (Φ : Z → X) (Ψ : Z → Y) (ε : ℝ) (x y) : ε ≤ glueDist Φ Ψ ε (.inr x) (.inl y) :=", "area": "Topology"} {"task": "t8", "statement": "theorem glueDist_triangle_inl_inr_inr (Φ : Z → X) (Ψ : Z → Y) (ε : ℝ) (x : X) (y z : Y) : glueDist Φ Ψ ε (.inl x) (.inr z) ≤ glueDist Φ Ψ ε (.inl x) (.inr y) + glueDist Φ Ψ ε (.inr y) (.inr z) :=", "area": "Topology"} {"task": "t8", "statement": "theorem glueDist_triangle_inl_inr_inl (Φ : Z → X) (Ψ : Z → Y) (ε : ℝ) (H : ∀ p q, |dist (Φ p) (Φ q) - dist (Ψ p) (Ψ q)| ≤ 2 * ε) (x : X) (y : Y) (z : X) : glueDist Φ Ψ ε (.inl x) (.inl z) ≤ glueDist Φ Ψ ε (.inl x) (.inr y) + glueDist Φ Ψ ε (.inr y) (.inl z) :=", "area": "Topology"} {"task": "t8", "statement": "theorem glueDist_triangle (Φ : Z → X) (Ψ : Z → Y) (ε : ℝ) (H : ∀ p q, |dist (Φ p) (Φ q) - dist (Ψ p) (Ψ q)| ≤ 2 * ε) : ∀ x y z, glueDist Φ Ψ ε x z ≤ glueDist Φ Ψ ε x y + glueDist Φ Ψ ε y z", "area": "Topology"} {"task": "t8", "statement": "theorem eq_of_glueDist_eq_zero (Φ : Z → X) (Ψ : Z → Y) (ε : ℝ) (ε0 : 0 < ε) : ∀ p q : Sum X Y, glueDist Φ Ψ ε p q = 0 → p = q", "area": "Topology"} {"task": "t8", "statement": "theorem Sum.mem_uniformity_iff_glueDist (hε : 0 < ε) (s : Set ((X ⊕ Y) × (X ⊕ Y))) : s ∈ 𝓤 (X ⊕ Y) ↔ ∃ δ > 0, ∀ a b, glueDist Φ Ψ ε a b < δ → (a, b) ∈ s :=", "area": "Topology"} {"task": "t8", "statement": "theorem Sum.dist_eq_glueDist {p q : X ⊕ Y} (x : X) (y : Y) : Sum.dist p q = glueDist (fun _ : Unit => Nonempty.some ⟨x⟩) (fun _ : Unit => Nonempty.some ⟨y⟩) 1 p q :=", "area": "Topology"} {"task": "t8", "statement": "theorem Sum.dist_comm (x y : X ⊕ Y) : Sum.dist x y = Sum.dist y x :=", "area": "Topology"} {"task": "t8", "statement": "theorem Sum.one_le_dist_inr_inl {x : X} {y : Y} : 1 ≤ Sum.dist (.inr y) (.inl x) :=", "area": "Topology"} {"task": "t8", "statement": "theorem Sum.mem_uniformity (s : Set (Sum X Y × Sum X Y)) : s ∈ 𝓤 (X ⊕ Y) ↔ ∃ ε > 0, ∀ a b, Sum.dist a b < ε → (a, b) ∈ s :=", "area": "Topology"} {"task": "t8", "statement": "theorem dist_same (i : ι) (x y : E i) : dist (Sigma.mk i x) ⟨i, y⟩ = dist x y :=", "area": "Topology"} {"task": "t8", "statement": "theorem one_le_dist_of_ne {i j : ι} (h : i ≠ j) (x : E i) (y : E j) : 1 ≤ dist (⟨i, x⟩ : Σk, E k) ⟨j, y⟩ :=", "area": "Topology"} {"task": "t8", "statement": "theorem fst_eq_of_dist_lt_one (x y : Σi, E i) (h : dist x y < 1) : x.1 = y.1 :=", "area": "Topology"} {"task": "t8", "statement": "theorem dist_triangle (x y z : Σi, E i) : dist x z ≤ dist x y + dist y z :=", "area": "Topology"} {"task": "t8", "statement": "theorem isOpen_iff (s : Set (Σi, E i)) : IsOpen s ↔ ∀ x ∈ s, ∃ ε > 0, ∀ y, dist x y < ε → y ∈ s :=", "area": "Topology"} {"task": "t8", "statement": "theorem isometry_mk (i : ι) : Isometry (Sigma.mk i : E i → Σk, E k) :=", "area": "Topology"} {"task": "t8", "statement": "theorem completeSpace [∀ i, CompleteSpace (E i)] : CompleteSpace (Σi, E i) :=", "area": "Topology"} {"task": "t8", "statement": "theorem toGlue_commute (hΦ : Isometry Φ) (hΨ : Isometry Ψ) : toGlueL hΦ hΨ ∘ Φ = toGlueR hΦ hΨ ∘ Ψ :=", "area": "Topology"} {"task": "t8", "statement": "theorem inductiveLimitDist_eq_dist (I : ∀ n, Isometry (f n)) (x y : Σn, X n) : ∀ m (hx : x.1 ≤ m) (hy : y.1 ≤ m), inductiveLimitDist f x y = dist (leRecOn hx (f _) x.2 : X m) (leRecOn hy (f _) y.2 : X m)", "area": "Topology"} {"task": "t8", "statement": "theorem toInductiveLimit_isometry (I : ∀ n, Isometry (f n)) (n : ℕ) : Isometry (toInductiveLimit I n) :=", "area": "Topology"} {"task": "t8", "statement": "theorem toInductiveLimit_commute (I : ∀ n, Isometry (f n)) (n : ℕ) : toInductiveLimit I n.succ ∘ f n = toInductiveLimit I n :=", "area": "Topology"} {"task": "t8", "statement": "theorem dist_self (x : Completion α) : dist x x = 0 :=", "area": "Topology"} {"task": "t8", "statement": "theorem dist_comm (x y : Completion α) : dist x y = dist y x :=", "area": "Topology"} {"task": "t8", "statement": "theorem dist_triangle (x y z : Completion α) : dist x z ≤ dist x y + dist y z :=", "area": "Topology"} {"task": "t8", "statement": "theorem mem_uniformity_dist (s : Set (Completion α × Completion α)) : s ∈ 𝓤 (Completion α) ↔ ∃ ε > 0, ∀ {a b}, dist a b < ε → (a, b) ∈ s :=", "area": "Topology"} {"task": "t8", "statement": "theorem uniformity_dist' : 𝓤 (Completion α) = ⨅ ε : { ε : ℝ // 0 < ε }, 𝓟 { p | dist p.1 p.2 < ε.val } :=", "area": "Topology"} {"task": "t8", "statement": "theorem uniformity_dist : 𝓤 (Completion α) = ⨅ ε > 0, 𝓟 { p | dist p.1 p.2 < ε } :=", "area": "Topology"} {"task": "t8", "statement": "theorem LipschitzWith.completion_extension [MetricSpace β] [CompleteSpace β] {f : α → β} {K : ℝ≥0} (h : LipschitzWith K f) : LipschitzWith K (Completion.extension f) :=", "area": "Topology"} {"task": "t8", "statement": "theorem Isometry.completion_extension [MetricSpace β] [CompleteSpace β] {f : α → β} (h : Isometry f) : Isometry (Completion.extension f) :=", "area": "Topology"} {"task": "t8", "statement": "theorem one_le_maxVar : 1 ≤ maxVar X Y :=", "area": "Topology"} {"task": "t8", "statement": "theorem maxVar_bound : dist x y ≤ maxVar X Y :=", "area": "Topology"} {"task": "t8", "statement": "theorem candidates_nonneg (fA : f ∈ candidates X Y) : 0 ≤ f (x, y) :=", "area": "Topology"} {"task": "t8", "statement": "theorem candidates_dist_bound (fA : f ∈ candidates X Y) : ∀ {x y : X ⊕ Y}, f (x, y) ≤ maxVar X Y * dist x y", "area": "Topology"} {"task": "t8", "statement": "theorem candidates_lipschitz_aux (fA : f ∈ candidates X Y) : f (x, y) - f (z, t) ≤ 2 * maxVar X Y * dist (x, y) (z, t) :=", "area": "Topology"} {"task": "t8", "statement": "theorem candidates_lipschitz (fA : f ∈ candidates X Y) : LipschitzWith (2 * maxVar X Y) f :=", "area": "Topology"} {"task": "t8", "statement": "theorem dist_mem_candidates : (fun p : (X ⊕ Y) × (X ⊕ Y) => dist p.1 p.2) ∈ candidates X Y :=", "area": "Topology"} {"task": "t8", "statement": "theorem closed_candidatesB : IsClosed (candidatesB X Y) :=", "area": "Topology"} {"task": "t8", "statement": "theorem isCompact_candidatesB : IsCompact (candidatesB X Y) :=", "area": "Topology"} {"task": "t8", "statement": "theorem HD_bound_aux1 (f : Cb X Y) (C : ℝ) : BddAbove (range fun x : X => ⨅ y, f (inl x, inr y) + C) :=", "area": "Topology"} {"task": "t8", "statement": "theorem HD_bound_aux2 (f : Cb X Y) (C : ℝ) : BddAbove (range fun y : Y => ⨅ x, f (inl x, inr y) + C) :=", "area": "Topology"} {"task": "t8", "statement": "theorem HD_candidatesBDist_le : HD (candidatesBDist X Y) ≤ diam (univ : Set X) + 1 + diam (univ : Set Y) :=", "area": "Topology"} {"task": "t8", "statement": "theorem HD_lipschitz_aux1 (f g : Cb X Y) : (⨆ x, ⨅ y, f (inl x, inr y)) ≤ (⨆ x, ⨅ y, g (inl x, inr y)) + dist f g :=", "area": "Topology"} {"task": "t8", "statement": "theorem HD_lipschitz_aux2 (f g : Cb X Y) : (⨆ y, ⨅ x, f (inl x, inr y)) ≤ (⨆ y, ⨅ x, g (inl x, inr y)) + dist f g :=", "area": "Topology"} {"task": "t8", "statement": "theorem optimalGHDist_mem_candidatesB : optimalGHDist X Y ∈ candidatesB X Y :=", "area": "Topology"} {"task": "t8", "statement": "theorem hausdorffDist_optimal_le_HD {f} (h : f ∈ candidatesB X Y) : hausdorffDist (range (optimalGHInjl X Y)) (range (optimalGHInjr X Y)) ≤ HD f :=", "area": "Topology"} {"task": "t8", "statement": "lemma NNReal.nndist_eq (a b : ℝ≥0) : nndist a b = max (a - b) (b - a) :=", "area": "Topology"} {"task": "t8", "statement": "@[simp] lemma NNReal.nndist_zero_eq_val (z : ℝ≥0) : nndist 0 z = z :=", "area": "Topology"} {"task": "t8", "statement": "@[simp] lemma NNReal.nndist_zero_eq_val' (z : ℝ≥0) : nndist z 0 = z :=", "area": "Topology"} {"task": "t8", "statement": "lemma NNReal.le_add_nndist (a b : ℝ≥0) : a ≤ b + nndist a b :=", "area": "Topology"} {"task": "t8", "statement": "lemma NNReal.ball_zero_eq_Ico' (c : ℝ≥0) : Metric.ball (0 : ℝ≥0) c.toReal = Set.Ico 0 c :=", "area": "Topology"} {"task": "t8", "statement": "lemma NNReal.ball_zero_eq_Ico (c : ℝ) : Metric.ball (0 : ℝ≥0) c = Set.Ico 0 c.toNNReal :=", "area": "Topology"} {"task": "t8", "statement": "lemma NNReal.closedBall_zero_eq_Icc' (c : ℝ≥0) : Metric.closedBall (0 : ℝ≥0) c.toReal = Set.Icc 0 c :=", "area": "Topology"} {"task": "t8", "statement": "lemma NNReal.closedBall_zero_eq_Icc {c : ℝ} (c_nn : 0 ≤ c) : Metric.closedBall (0 : ℝ≥0) c = Set.Icc 0 c.toNNReal :=", "area": "Topology"} {"task": "t8", "statement": "@[simp] lemma dist_prod_same_left {x : α} {y₁ y₂ : β} : dist (x, y₁) (x, y₂) = dist y₁ y₂ :=", "area": "Topology"} {"task": "t8", "statement": "@[simp] lemma dist_prod_same_right {x₁ x₂ : α} {y : β} : dist (x₁, y) (x₂, y) = dist x₁ x₂ :=", "area": "Topology"} {"task": "t8", "statement": "lemma ball_prod_same (x : α) (y : β) (r : ℝ) : ball x r ×ˢ ball y r = ball (x, y) r :=", "area": "Topology"} {"task": "t8", "statement": "lemma closedBall_prod_same (x : α) (y : β) (r : ℝ) : closedBall x r ×ˢ closedBall y r = closedBall (x, y) r :=", "area": "Topology"} {"task": "t8", "statement": "lemma sphere_prod (x : α × β) (r : ℝ) : sphere x r = sphere x.1 r ×ˢ closedBall x.2 r ∪ closedBall x.1 r ×ˢ sphere x.2 r :=", "area": "Topology"} {"task": "t8", "statement": "lemma nndist_pi_le_iff {f g : ∀ b, π b} {r : ℝ≥0} : nndist f g ≤ r ↔ ∀ b, nndist (f b) (g b) ≤ r :=", "area": "Topology"} {"task": "t8", "statement": "lemma nndist_pi_lt_iff {f g : ∀ b, π b} {r : ℝ≥0} (hr : 0 < r) : nndist f g < r ↔ ∀ b, nndist (f b) (g b) < r :=", "area": "Topology"} {"task": "t8", "statement": "lemma nndist_pi_eq_iff {f g : ∀ b, π b} {r : ℝ≥0} (hr : 0 < r) : nndist f g = r ↔ (∃ i, nndist (f i) (g i) = r) ∧ ∀ b, nndist (f b) (g b) ≤ r :=", "area": "Topology"} {"task": "t8", "statement": "lemma dist_pi_lt_iff {f g : ∀ b, π b} {r : ℝ} (hr : 0 < r) : dist f g < r ↔ ∀ b, dist (f b) (g b) < r :=", "area": "Topology"} {"task": "t8", "statement": "lemma dist_pi_le_iff {f g : ∀ b, π b} {r : ℝ} (hr : 0 ≤ r) : dist f g ≤ r ↔ ∀ b, dist (f b) (g b) ≤ r :=", "area": "Topology"} {"task": "t8", "statement": "lemma dist_pi_eq_iff {f g : ∀ b, π b} {r : ℝ} (hr : 0 < r) : dist f g = r ↔ (∃ i, dist (f i) (g i) = r) ∧ ∀ b, dist (f b) (g b) ≤ r :=", "area": "Topology"} {"task": "t8", "statement": "lemma dist_pi_le_iff' [Nonempty β] {f g : ∀ b, π b} {r : ℝ} : dist f g ≤ r ↔ ∀ b, dist (f b) (g b) ≤ r :=", "area": "Topology"} {"task": "t8", "statement": "@[simp] lemma dist_pi_const [Nonempty β] (a b : α) : (dist (fun _ : β => a) fun _ => b) = dist a b :=", "area": "Topology"} {"task": "t8", "statement": "lemma nndist_le_pi_nndist (f g : ∀ b, π b) (b : β) : nndist (f b) (g b) ≤ nndist f g :=", "area": "Topology"} {"task": "t8", "statement": "lemma dist_le_pi_dist (f g : ∀ b, π b) (b : β) : dist (f b) (g b) ≤ dist f g :=", "area": "Topology"} {"task": "t8", "statement": "lemma ball_pi (x : ∀ b, π b) {r : ℝ} (hr : 0 < r) : ball x r = Set.pi univ fun b => ball (x b) r :=", "area": "Topology"} {"task": "t8", "statement": "lemma ball_pi' [Nonempty β] (x : ∀ b, π b) (r : ℝ) : ball x r = Set.pi univ fun b => ball (x b) r :=", "area": "Topology"} {"task": "t8", "statement": "lemma closedBall_pi (x : ∀ b, π b) {r : ℝ} (hr : 0 ≤ r) : closedBall x r = Set.pi univ fun b => closedBall (x b) r :=", "area": "Topology"} {"task": "t8", "statement": "lemma closedBall_pi' [Nonempty β] (x : ∀ b, π b) (r : ℝ) : closedBall x r = Set.pi univ fun b => closedBall (x b) r :=", "area": "Topology"} {"task": "t8", "statement": "lemma sphere_pi (x : ∀ b, π b) {r : ℝ} (h : 0 < r ∨ Nonempty β) : sphere x r = (⋃ i : β, Function.eval i ⁻¹' sphere (x i) r) ∩ closedBall x r :=", "area": "Topology"} {"task": "t8", "statement": "@[simp] lemma Fin.nndist_insertNth_insertNth {n : ℕ} {α : Fin (n + 1) → Type*} [∀ i, PseudoMetricSpace (α i)] (i : Fin (n + 1)) (x y : α i) (f g : ∀ j, α (i.succAbove j)) : nndist (i.insertNth x f) (i.insertNth y g) = max (nndist x y) (nndist f g) :=", "area": "Topology"} {"task": "t8", "statement": "@[simp] lemma Fin.dist_insertNth_insertNth {n : ℕ} {α : Fin (n + 1) → Type*} [∀ i, PseudoMetricSpace (α i)] (i : Fin (n + 1)) (x y : α i) (f g : ∀ j, α (i.succAbove j)) : dist (i.insertNth x f) (i.insertNth y g) = max (dist x y) (dist f g) :=", "area": "Topology"} {"task": "t8", "statement": "theorem coe_linearMapAt (e : Pretrivialization F (π F E)) [e.IsLinear R] (b : B) : ⇑(e.linearMapAt R b) = fun y => if b ∈ e.baseSet then (e ⟨b, y⟩).2 else 0 :=", "area": "Topology"} {"task": "t8", "statement": "theorem coe_linearMapAt_of_mem (e : Pretrivialization F (π F E)) [e.IsLinear R] {b : B} (hb : b ∈ e.baseSet) : ⇑(e.linearMapAt R b) = fun y => (e ⟨b, y⟩).2 :=", "area": "Topology"} {"task": "t8", "statement": "theorem linearMapAt_apply (e : Pretrivialization F (π F E)) [e.IsLinear R] {b : B} (y : E b) : e.linearMapAt R b y = if b ∈ e.baseSet then (e ⟨b, y⟩).2 else 0 :=", "area": "Topology"} {"task": "t8", "statement": "theorem symmₗ_linearMapAt (e : Pretrivialization F (π F E)) [e.IsLinear R] {b : B} (hb : b ∈ e.baseSet) (y : E b) : e.symmₗ R b (e.linearMapAt R b y) = y :=", "area": "Topology"} {"task": "t8", "statement": "theorem linearMapAt_symmₗ (e : Pretrivialization F (π F E)) [e.IsLinear R] {b : B} (hb : b ∈ e.baseSet) (y : F) : e.linearMapAt R b (e.symmₗ R b y) = y :=", "area": "Topology"} {"task": "t8", "statement": "theorem coe_linearMapAt_of_mem (e : Trivialization F (π F E)) [e.IsLinear R] {b : B} (hb : b ∈ e.baseSet) : ⇑(e.linearMapAt R b) = fun y => (e ⟨b, y⟩).2 :=", "area": "Topology"} {"task": "t8", "statement": "theorem linearMapAt_apply (e : Trivialization F (π F E)) [e.IsLinear R] {b : B} (y : E b) : e.linearMapAt R b y = if b ∈ e.baseSet then (e ⟨b, y⟩).2 else 0 :=", "area": "Topology"} {"task": "t8", "statement": "theorem symm_coordChangeL (e e' : Trivialization F (π F E)) [e.IsLinear R] [e'.IsLinear R] {b : B} (hb : b ∈ e'.baseSet ∩ e.baseSet) : (e.coordChangeL R e' b).symm = e'.coordChangeL R e b :=", "area": "Topology"} {"task": "t8", "statement": "theorem mk_coordChangeL (e e' : Trivialization F (π F E)) [e.IsLinear R] [e'.IsLinear R] {b : B} (hb : b ∈ e.baseSet ∩ e'.baseSet) (y : F) : (b, coordChangeL R e e' b y) = e' ⟨b, e.symm b y⟩ :=", "area": "Topology"} {"task": "t8", "statement": "theorem apply_symm_apply_eq_coordChangeL (e e' : Trivialization F (π F E)) [e.IsLinear R] [e'.IsLinear R] {b : B} (hb : b ∈ e.baseSet ∩ e'.baseSet) (v : F) : e' (e.toPartialHomeomorph.symm (b, v)) = (b, e.coordChangeL R e' b v) :=", "area": "Topology"} {"task": "t8", "statement": "theorem coordChangeL_apply' (e e' : Trivialization F (π F E)) [e.IsLinear R] [e'.IsLinear R] {b : B} (hb : b ∈ e.baseSet ∩ e'.baseSet) (y : F) : coordChangeL R e e' b y = (e' (e.toPartialHomeomorph.symm (b, y))).2 :=", "area": "Topology"} {"task": "t8", "statement": "theorem apply_eq_prod_continuousLinearEquivAt (e : Trivialization F (π F E)) [e.IsLinear R] (b : B) (hb : b ∈ e.baseSet) (z : E b) : e ⟨b, z⟩ = (b, e.continuousLinearEquivAt R b hb z) :=", "area": "Topology"} {"task": "t8", "statement": "theorem zeroSection (e : Trivialization F (π F E)) [e.IsLinear R] {x : B} (hx : x ∈ e.baseSet) : e (zeroSection F E x) = (x, 0) :=", "area": "Topology"} {"task": "t8", "statement": "theorem symm_apply_eq_mk_continuousLinearEquivAt_symm (e : Trivialization F (π F E)) [e.IsLinear R] (b : B) (hb : b ∈ e.baseSet) (z : F) : e.toPartialHomeomorph.symm ⟨b, z⟩ = ⟨b, (e.continuousLinearEquivAt R b hb).symm z⟩ :=", "area": "Topology"} {"task": "t8", "statement": "theorem comp_continuousLinearEquivAt_eq_coord_change (e e' : Trivialization F (π F E)) [e.IsLinear R] [e'.IsLinear R] {b : B} (hb : b ∈ e.baseSet ∩ e'.baseSet) : (e.continuousLinearEquivAt R b hb.1).symm.trans (e'.continuousLinearEquivAt R b hb.2) = coordChangeL R e e' b :=", "area": "Topology"} {"task": "t8", "statement": "theorem coordChange_linear_comp (i j k : ι) : ∀ x ∈ Z.baseSet i ∩ Z.baseSet j ∩ Z.baseSet k, (Z.coordChange j k x).comp (Z.coordChange i j x) = Z.coordChange i k x :=", "area": "Topology"} {"task": "t8", "statement": "theorem localTriv_symm_apply {b : B} (hb : b ∈ Z.baseSet i) (v : F) : (Z.localTriv i).symm b v = Z.coordChange i (Z.indexAt b) b v :=", "area": "Topology"} {"task": "t8", "statement": "theorem localTriv_coordChange_eq {b : B} (hb : b ∈ Z.baseSet i ∩ Z.baseSet j) (v : F) : (Z.localTriv i).coordChangeL R (Z.localTriv j) b v = Z.coordChange i j b v :=", "area": "Topology"} {"task": "t8", "statement": "theorem mem_source_at : (⟨b, a⟩ : Z.TotalSpace) ∈ (Z.localTrivAt b).source :=", "area": "Topology"} {"task": "t8", "statement": "theorem localTriv_continuousLinearMapAt {b : B} (hb : b ∈ Z.baseSet i) : (Z.localTriv i).continuousLinearMapAt R b = Z.coordChange (Z.indexAt b) i b :=", "area": "Topology"} {"task": "t8", "statement": "theorem localTriv_symmL {b : B} (hb : b ∈ Z.baseSet i) : (Z.localTriv i).symmL R b = Z.coordChange i (Z.indexAt b) b :=", "area": "Topology"} {"task": "t8", "statement": "theorem mk_coordChange (a : VectorPrebundle R F E) {e e' : Pretrivialization F (π F E)} (he : e ∈ a.pretrivializationAtlas) (he' : e' ∈ a.pretrivializationAtlas) {b : B} (hb : b ∈ e.baseSet ∩ e'.baseSet) (v : F) : (b, a.coordChange he he' b v) = e' ⟨b, e.symm b v⟩ :=", "area": "Topology"} {"task": "t8", "statement": "theorem toVectorBundle : @VectorBundle R _ F E _ _ _ _ _ _ a.totalSpaceTopology _ a.toFiberBundle :=", "area": "Topology"} {"task": "t8", "statement": "theorem inCoordinates_eq (x₀ x : B) (y₀ y : B') (ϕ : E x →SL[σ] E' y) (hx : x ∈ (trivializationAt F E x₀).baseSet) (hy : y ∈ (trivializationAt F' E' y₀).baseSet) : inCoordinates F E F' E' x₀ x y₀ y ϕ = ((trivializationAt F' E' y₀).continuousLinearEquivAt 𝕜₂ y hy : E' y →L[𝕜₂] F').comp (ϕ.comp <| (((trivializationAt F E x₀).continuousLinearEquivAt 𝕜₁ x hx).symm : F →L[𝕜₁] E x)) :=", "area": "Topology"} {"task": "t8", "statement": "theorem _root_.VectorBundleCore.inCoordinates_eq {ι ι'} (Z : VectorBundleCore 𝕜₁ B F ι) (Z' : VectorBundleCore 𝕜₂ B' F' ι') {x₀ x : B} {y₀ y : B'} (ϕ : F →SL[σ] F') (hx : x ∈ Z.baseSet (Z.indexAt x₀)) (hy : y ∈ Z'.baseSet (Z'.indexAt y₀)) : inCoordinates F Z.Fiber F' Z'.Fiber x₀ x y₀ y ϕ = (Z'.coordChange (Z'.indexAt y) (Z'.indexAt y₀) y).comp (ϕ.comp <| Z.coordChange (Z.indexAt x₀) (Z.indexAt x) x) :=", "area": "Topology"} {"task": "t8", "statement": "theorem Equicontinuous.comap_uniformFun_eq [CompactSpace X] (F_eqcont : Equicontinuous F) : (UniformFun.uniformSpace X α).comap F = (Pi.uniformSpace _).comap F :=", "area": "Topology"} {"task": "t8", "statement": "lemma Equicontinuous.uniformInducing_uniformFun_iff_pi [UniformSpace ι] [CompactSpace X] (F_eqcont : Equicontinuous F) : UniformInducing (UniformFun.ofFun ∘ F) ↔ UniformInducing F :=", "area": "Topology"} {"task": "t8", "statement": "lemma Equicontinuous.inducing_uniformFun_iff_pi [TopologicalSpace ι] [CompactSpace X] (F_eqcont : Equicontinuous F) : Inducing (UniformFun.ofFun ∘ F) ↔ Inducing F :=", "area": "Topology"} {"task": "t8", "statement": "theorem Equicontinuous.tendsto_uniformFun_iff_pi [CompactSpace X] (F_eqcont : Equicontinuous F) (ℱ : Filter ι) (f : X → α) : Tendsto (UniformFun.ofFun ∘ F) ℱ (𝓝 <| UniformFun.ofFun f) ↔ Tendsto F ℱ (𝓝 f) :=", "area": "Topology"} {"task": "t8", "statement": "theorem EquicontinuousOn.comap_uniformOnFun_eq {𝔖 : Set (Set X)} (𝔖_compact : ∀ K ∈ 𝔖, IsCompact K) (F_eqcont : ∀ K ∈ 𝔖, EquicontinuousOn F K) : (UniformOnFun.uniformSpace X α 𝔖).comap F = (Pi.uniformSpace _).comap ((⋃₀ 𝔖).restrict ∘ F) :=", "area": "Topology"} {"task": "t8", "statement": "lemma EquicontinuousOn.uniformInducing_uniformOnFun_iff_pi' [UniformSpace ι] {𝔖 : Set (Set X)} (𝔖_compact : ∀ K ∈ 𝔖, IsCompact K) (F_eqcont : ∀ K ∈ 𝔖, EquicontinuousOn F K) : UniformInducing (UniformOnFun.ofFun 𝔖 ∘ F) ↔ UniformInducing ((⋃₀ 𝔖).restrict ∘ F) :=", "area": "Topology"} {"task": "t8", "statement": "lemma EquicontinuousOn.uniformInducing_uniformOnFun_iff_pi [UniformSpace ι] {𝔖 : Set (Set X)} (𝔖_covers : ⋃₀ 𝔖 = univ) (𝔖_compact : ∀ K ∈ 𝔖, IsCompact K) (F_eqcont : ∀ K ∈ 𝔖, EquicontinuousOn F K) : UniformInducing (UniformOnFun.ofFun 𝔖 ∘ F) ↔ UniformInducing F :=", "area": "Topology"} {"task": "t8", "statement": "lemma EquicontinuousOn.inducing_uniformOnFun_iff_pi' [TopologicalSpace ι] {𝔖 : Set (Set X)} (𝔖_compact : ∀ K ∈ 𝔖, IsCompact K) (F_eqcont : ∀ K ∈ 𝔖, EquicontinuousOn F K) : Inducing (UniformOnFun.ofFun 𝔖 ∘ F) ↔ Inducing ((⋃₀ 𝔖).restrict ∘ F) :=", "area": "Topology"} {"task": "t8", "statement": "lemma EquicontinuousOn.inducing_uniformOnFun_iff_pi [TopologicalSpace ι] {𝔖 : Set (Set X)} (𝔖_covers : ⋃₀ 𝔖 = univ) (𝔖_compact : ∀ K ∈ 𝔖, IsCompact K) (F_eqcont : ∀ K ∈ 𝔖, EquicontinuousOn F K) : Inducing (UniformOnFun.ofFun 𝔖 ∘ F) ↔ Inducing F :=", "area": "Topology"} {"task": "t8", "statement": "theorem EquicontinuousOn.tendsto_uniformOnFun_iff_pi' {𝔖 : Set (Set X)} (𝔖_compact : ∀ K ∈ 𝔖, IsCompact K) (F_eqcont : ∀ K ∈ 𝔖, EquicontinuousOn F K) (ℱ : Filter ι) (f : X → α) : Tendsto (UniformOnFun.ofFun 𝔖 ∘ F) ℱ (𝓝 <| UniformOnFun.ofFun 𝔖 f) ↔ Tendsto ((⋃₀ 𝔖).restrict ∘ F) ℱ (𝓝 <| (⋃₀ 𝔖).restrict f) :=", "area": "Topology"} {"task": "t8", "statement": "theorem EquicontinuousOn.tendsto_uniformOnFun_iff_pi {𝔖 : Set (Set X)} (𝔖_compact : ∀ K ∈ 𝔖, IsCompact K) (𝔖_covers : ⋃₀ 𝔖 = univ) (F_eqcont : ∀ K ∈ 𝔖, EquicontinuousOn F K) (ℱ : Filter ι) (f : X → α) : Tendsto (UniformOnFun.ofFun 𝔖 ∘ F) ℱ (𝓝 <| UniformOnFun.ofFun 𝔖 f) ↔ Tendsto F ℱ (𝓝 f) :=", "area": "Topology"} {"task": "t8", "statement": "theorem EquicontinuousOn.isClosed_range_pi_of_uniformOnFun' {𝔖 : Set (Set X)} (𝔖_compact : ∀ K ∈ 𝔖, IsCompact K) (F_eqcont : ∀ K ∈ 𝔖, EquicontinuousOn F K) (H : IsClosed (range <| UniformOnFun.ofFun 𝔖 ∘ F)) : IsClosed (range <| (⋃₀ 𝔖).restrict ∘ F) :=", "area": "Topology"} {"task": "t8", "statement": "theorem EquicontinuousOn.isClosed_range_uniformOnFun_iff_pi {𝔖 : Set (Set X)} (𝔖_compact : ∀ K ∈ 𝔖, IsCompact K) (𝔖_covers : ⋃₀ 𝔖 = univ) (F_eqcont : ∀ K ∈ 𝔖, EquicontinuousOn F K) : IsClosed (range <| UniformOnFun.ofFun 𝔖 ∘ F) ↔ IsClosed (range F) :=", "area": "Topology"} {"task": "t8", "statement": "theorem ArzelaAscoli.compactSpace_of_closed_inducing' [TopologicalSpace ι] {𝔖 : Set (Set X)} (𝔖_compact : ∀ K ∈ 𝔖, IsCompact K) (F_ind : Inducing (UniformOnFun.ofFun 𝔖 ∘ F)) (F_cl : IsClosed <| range <| UniformOnFun.ofFun 𝔖 ∘ F) (F_eqcont : ∀ K ∈ 𝔖, EquicontinuousOn F K) (F_pointwiseCompact : ∀ K ∈ 𝔖, ∀ x ∈ K, ∃ Q, IsCompact Q ∧ ∀ i, F i x ∈ Q) : CompactSpace ι :=", "area": "Topology"} {"task": "t8", "statement": "theorem ArzelaAscoli.isCompact_closure_of_closedEmbedding [TopologicalSpace ι] [T2Space α] {𝔖 : Set (Set X)} (𝔖_compact : ∀ K ∈ 𝔖, IsCompact K) (F_clemb : ClosedEmbedding (UniformOnFun.ofFun 𝔖 ∘ F)) {s : Set ι} (s_eqcont : ∀ K ∈ 𝔖, EquicontinuousOn (F ∘ ((↑) : s → ι)) K) (s_pointwiseCompact : ∀ K ∈ 𝔖, ∀ x ∈ K, ∃ Q, IsCompact Q ∧ ∀ i ∈ s, F i x ∈ Q) : IsCompact (closure s) :=", "area": "Topology"} {"task": "t8", "statement": "theorem ArzelaAscoli.isCompact_of_equicontinuous (S : Set C(X, α)) (hS1 : IsCompact (ContinuousMap.toFun '' S)) (hS2 : Equicontinuous ((↑) : S → X → α)) : IsCompact S :=", "area": "Topology"} {"task": "t8", "statement": "theorem totalSpaceMk_closedEmbedding [T1Space B] (x : B) : ClosedEmbedding (@TotalSpace.mk B F E x) :=", "area": "Topology"} {"task": "t8", "statement": "theorem FiberBundle.exists_trivialization_Icc_subset [ConditionallyCompleteLinearOrder B] [OrderTopology B] [FiberBundle F E] (a b : B) : ∃ e : Trivialization F (π F E), Icc a b ⊆ e.baseSet :=", "area": "Topology"} {"task": "t8", "statement": "theorem mem_trivChange_source (i j : ι) (p : B × F) : p ∈ (Z.trivChange i j).source ↔ p.1 ∈ Z.baseSet i ∩ Z.baseSet j :=", "area": "Topology"} {"task": "t8", "statement": "theorem mem_localTrivAsPartialEquiv_target (p : B × F) : p ∈ (Z.localTrivAsPartialEquiv i).target ↔ p.1 ∈ Z.baseSet i :=", "area": "Topology"} {"task": "t8", "statement": "theorem localTrivAsPartialEquiv_trans (i j : ι) : (Z.localTrivAsPartialEquiv i).symm.trans (Z.localTrivAsPartialEquiv j) ≈ (Z.trivChange i j).toPartialEquiv :=", "area": "Topology"} {"task": "t8", "statement": "theorem open_source' (i : ι) : IsOpen (Z.localTrivAsPartialEquiv i).source :=", "area": "Topology"} {"task": "t8", "statement": "theorem continuous_const_section (v : F) (h : ∀ i j, ∀ x ∈ Z.baseSet i ∩ Z.baseSet j, Z.coordChange i j x v = v) : Continuous (show B → Z.TotalSpace from fun x => ⟨x, v⟩) :=", "area": "Topology"} {"task": "t8", "statement": "theorem localTrivAt_apply (p : Z.TotalSpace) : (Z.localTrivAt p.1) p = ⟨p.1, p.2⟩ :=", "area": "Topology"} {"task": "t8", "statement": "theorem mem_localTrivAt_baseSet (b : B) : b ∈ (Z.localTrivAt b).baseSet :=", "area": "Topology"} {"task": "t8", "statement": "theorem mk_mem_localTrivAt_source : (⟨b, a⟩ : Z.TotalSpace) ∈ (Z.localTrivAt b).source :=", "area": "Topology"} {"task": "t8", "statement": "theorem continuous_symm_of_mem_pretrivializationAtlas (he : e ∈ a.pretrivializationAtlas) : @ContinuousOn _ _ _ a.totalSpaceTopology e.toPartialEquiv.symm e.target :=", "area": "Topology"} {"task": "t8", "statement": "theorem isOpen_source (e : Pretrivialization F (π F E)) : IsOpen[a.totalSpaceTopology] e.source :=", "area": "Topology"} {"task": "t8", "statement": "theorem isOpen_target_of_mem_pretrivializationAtlas_inter (e e' : Pretrivialization F (π F E)) (he' : e' ∈ a.pretrivializationAtlas) : IsOpen (e'.toPartialEquiv.target ∩ e'.toPartialEquiv.symm ⁻¹' e.source) :=", "area": "Topology"} {"task": "t8", "statement": "theorem mem_pretrivializationAt_source (b : B) (x : E b) : ⟨b, x⟩ ∈ (a.pretrivializationAt b).source :=", "area": "Topology"} {"task": "t8", "statement": "theorem continuous_totalSpaceMk (b : B) : Continuous[_, a.totalSpaceTopology] (TotalSpace.mk b) :=", "area": "Topology"} {"task": "t8", "statement": "theorem inducing_totalSpaceMk_of_inducing_comp (b : B) (h : Inducing (a.pretrivializationAt b ∘ TotalSpace.mk b)) : @Inducing _ _ _ a.totalSpaceTopology (TotalSpace.mk b) :=", "area": "Topology"} {"task": "t8", "statement": "theorem continuous_proj : @Continuous _ _ a.totalSpaceTopology _ (π F E) :=", "area": "Topology"} {"task": "t8", "statement": "theorem continuousOn_of_comp_right {X : Type*} [TopologicalSpace X] {f : TotalSpace F E → X} {s : Set B} (hs : IsOpen s) (hf : ∀ b ∈ s, ContinuousOn (f ∘ (a.pretrivializationAt b).toPartialEquiv.symm) ((s ∩ (a.pretrivializationAt b).baseSet) ×ˢ (Set.univ : Set F))) : @ContinuousOn _ _ a.totalSpaceTopology _ f (π F E ⁻¹' s) :=", "area": "Topology"} {"task": "t8", "statement": "theorem idealOfSet_closed [T2Space R] (s : Set X) : IsClosed (idealOfSet R s : Set C(X, R)) :=", "area": "Topology"} {"task": "t8", "statement": "theorem mem_idealOfSet {s : Set X} {f : C(X, R)} : f ∈ idealOfSet R s ↔ ∀ ⦃x : X⦄, x ∈ sᶜ → f x = 0 :=", "area": "Topology"} {"task": "t8", "statement": "theorem not_mem_idealOfSet {s : Set X} {f : C(X, R)} : f ∉ idealOfSet R s ↔ ∃ x ∈ sᶜ, f x ≠ 0 :=", "area": "Topology"} {"task": "t8", "statement": "theorem not_mem_setOfIdeal {I : Ideal C(X, R)} {x : X} : x ∉ setOfIdeal I ↔ ∀ ⦃f : C(X, R)⦄, f ∈ I → f x = 0 :=", "area": "Topology"} {"task": "t8", "statement": "theorem mem_setOfIdeal {I : Ideal C(X, R)} {x : X} : x ∈ setOfIdeal I ↔ ∃ f ∈ I, (f : C(X, R)) x ≠ 0 :=", "area": "Topology"} {"task": "t8", "statement": "theorem setOfIdeal_open [T2Space R] (I : Ideal C(X, R)) : IsOpen (setOfIdeal I) :=", "area": "Topology"} {"task": "t8", "statement": "theorem idealOfEmpty_eq_bot : idealOfSet R (∅ : Set X) = ⊥ :=", "area": "Topology"} {"task": "t8", "statement": "theorem mem_idealOfSet_compl_singleton (x : X) (f : C(X, R)) : f ∈ idealOfSet R ({x}ᶜ : Set X) ↔ f x = 0 :=", "area": "Topology"} {"task": "t8", "statement": "theorem ideal_gc : GaloisConnection (setOfIdeal : Ideal C(X, R) → Set X) (idealOfSet R) :=", "area": "Topology"} {"task": "t8", "statement": "theorem exists_mul_le_one_eqOn_ge (f : C(X, ℝ≥0)) {c : ℝ≥0} (hc : 0 < c) : ∃ g : C(X, ℝ≥0), (∀ x : X, (g * f) x ≤ 1) ∧ {x : X | c ≤ f x}.EqOn (g * f) 1 :=", "area": "Topology"} {"task": "t8", "statement": "theorem idealOfSet_ofIdeal_eq_closure (I : Ideal C(X, 𝕜)) : idealOfSet 𝕜 (setOfIdeal I) = I.closure :=", "area": "Topology"} {"task": "t8", "statement": "theorem setOfIdeal_ofSet_eq_interior (s : Set X) : setOfIdeal (idealOfSet 𝕜 s) = interior s :=", "area": "Topology"} {"task": "t8", "statement": "theorem idealOfSet_isMaximal_iff (s : Opens X) : (idealOfSet 𝕜 (s : Set X)).IsMaximal ↔ IsCoatom s :=", "area": "Topology"} {"task": "t8", "statement": "theorem setOfIdeal_eq_compl_singleton (I : Ideal C(X, 𝕜)) [hI : I.IsMaximal] : ∃ x : X, setOfIdeal I = {x}ᶜ :=", "area": "Topology"} {"task": "t8", "statement": "theorem ideal_isMaximal_iff (I : Ideal C(X, 𝕜)) [hI : IsClosed (I : Set C(X, 𝕜))] : I.IsMaximal ↔ ∃ x : X, idealOfSet 𝕜 {x}ᶜ = I :=", "area": "Topology"} {"task": "t8", "statement": "theorem continuousMapEval_bijective : Bijective (continuousMapEval X 𝕜) :=", "area": "Topology"} {"task": "t8", "statement": "lemma toContinuousMap_X_eq_id : X.toContinuousMap = .id R :=", "area": "Topology"} {"task": "t8", "statement": "lemma toContinuousMapOn_X_eq_restrict_id (s : Set R) : X.toContinuousMapOn s = restrict s (.id R) :=", "area": "Topology"} {"task": "t8", "statement": "theorem aeval_continuousMap_apply (g : R[X]) (f : C(α, R)) (x : α) : ((Polynomial.aeval f) g) x = g.eval (f x) :=", "area": "Topology"} {"task": "t8", "statement": "theorem polynomialFunctions_coe (X : Set R) : (polynomialFunctions X : Set C(X, R)) = Set.range (Polynomial.toContinuousMapOnAlgHom X) :=", "area": "Topology"} {"task": "t8", "statement": "theorem polynomialFunctions_separatesPoints (X : Set R) : (polynomialFunctions X).SeparatesPoints :=", "area": "Topology"} {"task": "t8", "statement": "theorem polynomialFunctions.comap_compRightAlgHom_iccHomeoI (a b : ℝ) (h : a < b) : (polynomialFunctions I).comap (compRightAlgHom ℝ ℝ (iccHomeoI a b h).symm.toContinuousMap) = polynomialFunctions (Set.Icc a b) :=", "area": "Topology"} {"task": "t8", "statement": "theorem polynomialFunctions.eq_adjoin_X (s : Set R) : polynomialFunctions s = Algebra.adjoin R {toContinuousMapOnAlgHom s X} :=", "area": "Topology"} {"task": "t8", "statement": "theorem polynomialFunctions.le_equalizer {A : Type*} [Semiring A] [Algebra R A] (s : Set R) (φ ψ : C(s, R) →ₐ[R] A) (h : φ (toContinuousMapOnAlgHom s X) = ψ (toContinuousMapOnAlgHom s X)) : polynomialFunctions s ≤ φ.equalizer ψ :=", "area": "Topology"} {"task": "t8", "statement": "theorem polynomialFunctions.starClosure_eq_adjoin_X [StarRing R] [ContinuousStar R] (s : Set R) : (polynomialFunctions s).starClosure = adjoin R {toContinuousMapOnAlgHom s X} :=", "area": "Topology"} {"task": "t8", "statement": "theorem polynomialFunctions.starClosure_le_equalizer {A : Type*} [StarRing R] [ContinuousStar R] [Semiring A] [StarRing A] [Algebra R A] (s : Set R) (φ ψ : C(s, R) →⋆ₐ[R] A) (h : φ (toContinuousMapOnAlgHom s X) = ψ (toContinuousMapOnAlgHom s X)) : (polynomialFunctions s).starClosure ≤ StarAlgHom.equalizer φ ψ :=", "area": "Topology"} {"task": "t8", "statement": "theorem dist_eq' (m n : ℤ) : dist m n = |m - n| :=", "area": "Topology"} {"task": "t8", "statement": "theorem pairwise_one_le_dist : Pairwise fun m n : ℤ => 1 ≤ dist m n :=", "area": "Topology"} {"task": "t8", "statement": "theorem ball_eq_Ioo (x : ℤ) (r : ℝ) : ball x r = Ioo ⌊↑x - r⌋ ⌈↑x + r⌉ :=", "area": "Topology"} {"task": "t8", "statement": "theorem closedBall_eq_Icc (x : ℤ) (r : ℝ) : closedBall x r = Icc ⌈↑x - r⌉ ⌊↑x + r⌋ :=", "area": "Topology"} {"task": "t8", "statement": "theorem cobounded_eq : Bornology.cobounded ℤ = atBot ⊔ atTop :=", "area": "Topology"} {"task": "t8", "statement": "theorem cofinite_eq : (cofinite : Filter ℤ) = atBot ⊔ atTop :=", "area": "Topology"} {"task": "t8", "statement": "theorem exists_compact_superset [WeaklyLocallyCompactSpace X] {K : Set X} (hK : IsCompact K) : ∃ K', IsCompact K' ∧ K ⊆ interior K' :=", "area": "Topology"} {"task": "t8", "statement": "theorem compact_basis_nhds [LocallyCompactSpace X] (x : X) : (𝓝 x).HasBasis (fun s => s ∈ 𝓝 x ∧ IsCompact s) fun s => s :=", "area": "Topology"} {"task": "t8", "statement": "theorem exists_compact_subset [LocallyCompactSpace X] {x : X} {U : Set X} (hU : IsOpen U) (hx : x ∈ U) : ∃ K : Set X, IsCompact K ∧ x ∈ interior K ∧ K ⊆ U :=", "area": "Topology"} {"task": "t8", "statement": "lemma exists_mem_nhdsSet_isCompact_mapsTo [LocallyCompactPair X Y] {f : X → Y} {K : Set X} {U : Set Y} (hf : Continuous f) (hK : IsCompact K) (hU : IsOpen U) (hKU : MapsTo f K U) : ∃ L ∈ 𝓝ˢ K, IsCompact L ∧ MapsTo f L U :=", "area": "Topology"} {"task": "t8", "statement": "theorem ClosedEmbedding.locallyCompactSpace [LocallyCompactSpace Y] {f : X → Y} (hf : ClosedEmbedding f) : LocallyCompactSpace X :=", "area": "Topology"} {"task": "t8", "statement": "theorem OpenEmbedding.locallyCompactSpace [LocallyCompactSpace Y] {f : X → Y} (hf : OpenEmbedding f) : LocallyCompactSpace X :=", "area": "Topology"} {"task": "t8", "statement": "theorem equicontinuous_of_equicontinuousAt_one {ι G M hom : Type*} [TopologicalSpace G] [UniformSpace M] [Group G] [Group M] [TopologicalGroup G] [UniformGroup M] [FunLike hom G M] [MonoidHomClass hom G M] (F : ι → hom) (hf : EquicontinuousAt ((↑) ∘ F) (1 : G)) : Equicontinuous ((↑) ∘ F) :=", "area": "Topology"} {"task": "t8", "statement": "theorem uniformEquicontinuous_of_equicontinuousAt_one {ι G M hom : Type*} [UniformSpace G] [UniformSpace M] [Group G] [Group M] [UniformGroup G] [UniformGroup M] [FunLike hom G M] [MonoidHomClass hom G M] (F : ι → hom) (hf : EquicontinuousAt ((↑) ∘ F) (1 : G)) : UniformEquicontinuous ((↑) ∘ F) :=", "area": "Topology"} {"task": "t8", "statement": "theorem norm_nonneg (x : L) : 0 ≤ norm x :=", "area": "Topology"} {"task": "t8", "statement": "theorem norm_add_le (x y : L) : norm (x + y) ≤ max (norm x) (norm y) :=", "area": "Topology"} {"task": "t8", "statement": "theorem norm_eq_zero {x : L} (hx : norm x = 0) : x = 0 :=", "area": "Topology"} {"task": "t8", "statement": "theorem continuous_hatInv [CompletableTopField K] {x : hat K} (h : x ≠ 0) : ContinuousAt hatInv x :=", "area": "Topology"} {"task": "t8", "statement": "theorem coe_inv (x : K) : (x : hat K)⁻¹ = ((x⁻¹ : K) : hat K) :=", "area": "Topology"} {"task": "t8", "statement": "theorem mul_hatInv_cancel {x : hat K} (x_ne : x ≠ 0) : x * hatInv x = 1 :=", "area": "Topology"} {"task": "t8", "statement": "lemma CompactIccSpace.mk' [TopologicalSpace α] [Preorder α] (h : ∀ {a b : α}, a ≤ b → IsCompact (Icc a b)) : CompactIccSpace α where", "area": "Topology"} {"task": "t8", "statement": "lemma CompactIccSpace.mk'' [TopologicalSpace α] [PartialOrder α] (h : ∀ {a b : α}, a < b → IsCompact (Icc a b)) : CompactIccSpace α :=", "area": "Topology"} {"task": "t8", "statement": "theorem IsCompact.exists_isLeast [ClosedIicTopology α] {s : Set α} (hs : IsCompact s) (ne_s : s.Nonempty) : ∃ x, IsLeast s x :=", "area": "Topology"} {"task": "t8", "statement": "theorem cocompact_le_atBot_atTop [CompactIccSpace α] : cocompact α ≤ atBot ⊔ atTop :=", "area": "Topology"} {"task": "t8", "statement": "theorem cocompact_le_atBot [OrderTop α] [CompactIccSpace α] : cocompact α ≤ atBot :=", "area": "Topology"} {"task": "t8", "statement": "theorem atBot_le_cocompact [NoMinOrder α] [ClosedIicTopology α] : atBot ≤ cocompact α :=", "area": "Topology"} {"task": "t8", "statement": "theorem IsCompact.exists_isMinOn [ClosedIicTopology α] {s : Set β} (hs : IsCompact s) (ne_s : s.Nonempty) {f : β → α} (hf : ContinuousOn f s) : ∃ x ∈ s, IsMinOn f s x :=", "area": "Topology"} {"task": "t8", "statement": "theorem IsCompact.exists_forall_le' [ClosedIicTopology α] [NoMaxOrder α] {f : β → α} {s : Set β} (hs : IsCompact s) (hf : ContinuousOn f s) {a : α} (hf' : ∀ b ∈ s, a < f b) : ∃ a', a < a' ∧ ∀ b ∈ s, a' ≤ f b :=", "area": "Topology"} {"task": "t8", "statement": "theorem ContinuousOn.exists_isMinOn' [ClosedIicTopology α] {s : Set β} {f : β → α} (hf : ContinuousOn f s) (hsc : IsClosed s) {x₀ : β} (h₀ : x₀ ∈ s) (hc : ∀ᶠ x in cocompact β ⊓ 𝓟 s, f x₀ ≤ f x) : ∃ x ∈ s, IsMinOn f s x :=", "area": "Topology"} {"task": "t8", "statement": "theorem Continuous.exists_forall_le' [ClosedIicTopology α] {f : β → α} (hf : Continuous f) (x₀ : β) (h : ∀ᶠ x in cocompact β, f x₀ ≤ f x) : ∃ x : β, ∀ y : β, f x ≤ f y :=", "area": "Topology"} {"task": "t8", "statement": "theorem Continuous.exists_forall_le [ClosedIicTopology α] [Nonempty β] {f : β → α} (hf : Continuous f) (hlim : Tendsto f (cocompact β) atTop) : ∃ x, ∀ y, f x ≤ f y :=", "area": "Topology"} {"task": "t8", "statement": "theorem Continuous.exists_forall_le_of_hasCompactMulSupport [ClosedIicTopology α] [Nonempty β] [One α] {f : β → α} (hf : Continuous f) (h : HasCompactMulSupport f) : ∃ x : β, ∀ y : β, f x ≤ f y :=", "area": "Topology"} {"task": "t8", "statement": "theorem IsCompact.bddBelow [ClosedIicTopology α] [Nonempty α] {s : Set α} (hs : IsCompact s) : BddBelow s :=", "area": "Topology"} {"task": "t8", "statement": "theorem IsCompact.sSup_lt_iff_of_continuous [ClosedIciTopology α] {f : β → α} {K : Set β} (hK : IsCompact K) (h0K : K.Nonempty) (hf : ContinuousOn f K) (y : α) : sSup (f '' K) < y ↔ ∀ x ∈ K, f x < y :=", "area": "Topology"} {"task": "t8", "statement": "theorem IsCompact.continuous_sSup {f : γ → β → α} {K : Set β} (hK : IsCompact K) (hf : Continuous ↿f) : Continuous fun x => sSup (f x '' K) :=", "area": "Topology"} {"task": "t8", "statement": "theorem image_uIcc (h : ContinuousOn f <| [[a, b]]) : f '' [[a, b]] = [[sInf (f '' [[a, b]]), sSup (f '' [[a, b]])]] :=", "area": "Topology"} {"task": "t8", "statement": "theorem sInf_image_Icc_le (h : ContinuousOn f <| Icc a b) (hc : c ∈ Icc a b) : sInf (f '' Icc a b) ≤ f c :=", "area": "Topology"} {"task": "t8", "statement": "theorem le_sSup_image_Icc (h : ContinuousOn f <| Icc a b) (hc : c ∈ Icc a b) : f c ≤ sSup (f '' Icc a b) :=", "area": "Topology"} {"task": "t8", "statement": "lemma UniformFun.continuousSMul_induced_of_range_bounded (φ : hom) (hφ : Inducing (ofFun ∘ φ)) (h : ∀ u : H, Bornology.IsVonNBounded 𝕜 (Set.range (φ u))) : ContinuousSMul 𝕜 H :=", "area": "Topology"} {"task": "t8", "statement": "theorem UniformOnFun.continuousSMul_induced_of_image_bounded (φ : hom) (hφ : Inducing (ofFun 𝔖 ∘ φ)) (h : ∀ u : H, ∀ s ∈ 𝔖, Bornology.IsVonNBounded 𝕜 ((φ u : α → E) '' s)) : ContinuousSMul 𝕜 H :=", "area": "Topology"} {"task": "t8", "statement": "theorem of_comm {A ι : Type*} [CommRing A] (B : ι → AddSubgroup A) (inter : ∀ i j, ∃ k, B k ≤ B i ⊓ B j) (mul : ∀ i, ∃ j, (B j : Set A) * B j ⊆ B i) (leftMul : ∀ x : A, ∀ i, ∃ j, (B j : Set A) ⊆ (fun y : A => x * y) ⁻¹' B i) : RingSubgroupsBasis B :=", "area": "Topology"} {"task": "t8", "statement": "theorem hasBasis_nhds_zero : HasBasis (@nhds A hB.topology 0) (fun _ => True) fun i => B i :=", "area": "Topology"} {"task": "t8", "statement": "theorem hasBasis_nhds (a : A) : HasBasis (@nhds A hB.topology a) (fun _ => True) fun i => { b | b - a ∈ B i } :=", "area": "Topology"} {"task": "t8", "statement": "theorem nonarchimedean : @NonarchimedeanRing A _ hB.topology :=", "area": "Topology"} {"task": "t8", "statement": "theorem toRing_subgroups_basis (hB : SubmodulesRingBasis B) : RingSubgroupsBasis fun i => (B i).toAddSubgroup :=", "area": "Topology"} {"task": "t8", "statement": "theorem nonarchimedean (hB : SubmodulesBasis B) : @NonarchimedeanAddGroup M _ hB.topology :=", "area": "Topology"} {"task": "t8", "statement": "theorem RingFilterBasis.submodulesBasisIsBasis (BR : RingFilterBasis R) {B : ι → Submodule R M} (hB : BR.SubmodulesBasis B) : @_root_.SubmodulesBasis ι R _ M _ _ BR.topology B :=", "area": "Topology"} {"task": "t8", "statement": "theorem isSheaf_of_isTerminal_of_indiscrete {X : TopCat.{w}} (hind : X.str = ⊤) (F : Presheaf C X) (it : IsTerminal <| F.obj <| op ⊥) : F.IsSheaf :=", "area": "Topology"} {"task": "t8", "statement": "theorem isGluing_iff_pairwise {sf s} : IsGluing F U sf s ↔ ∀ i, (F.mapCone (Pairwise.cocone U).op).π.app i s = objPairwiseOfFamily sf i :=", "area": "Topology"} {"task": "t8", "statement": "theorem isSheaf_iff_isSheafUniqueGluing_types : F.IsSheaf ↔ F.IsSheafUniqueGluing :=", "area": "Topology"} {"task": "t8", "statement": "theorem existsUnique_gluing' (V : Opens X) (iUV : ∀ i : ι, U i ⟶ V) (hcover : V ≤ iSup U) (sf : ∀ i : ι, F.1.obj (op (U i))) (h : IsCompatible F.1 U sf) : ∃! s : F.1.obj (op V), ∀ i : ι, F.1.map (iUV i).op s = sf i :=", "area": "Topology"} {"task": "t8", "statement": "theorem eq_of_locally_eq (s t : F.1.obj (op (iSup U))) (h : ∀ i, F.1.map (Opens.leSupr U i).op s = F.1.map (Opens.leSupr U i).op t) : s = t :=", "area": "Topology"} {"task": "t8", "statement": "theorem eq_of_locally_eq' (V : Opens X) (iUV : ∀ i : ι, U i ⟶ V) (hcover : V ≤ iSup U) (s t : F.1.obj (op V)) (h : ∀ i, F.1.map (iUV i).op s = F.1.map (iUV i).op t) : s = t :=", "area": "Topology"} {"task": "t8", "statement": "theorem eq_of_locally_eq₂ {U₁ U₂ V : Opens X} (i₁ : U₁ ⟶ V) (i₂ : U₂ ⟶ V) (hcover : V ≤ U₁ ⊔ U₂) (s t : F.1.obj (op V)) (h₁ : F.1.map i₁.op s = F.1.map i₁.op t) (h₂ : F.1.map i₂.op s = F.1.map i₂.op t) : s = t :=", "area": "Topology"} {"task": "t8", "statement": "theorem objSupIsoProdEqLocus_inv_eq_iff {X : TopCat.{u}} (F : X.Sheaf CommRingCat.{u}) {U V W UW VW : Opens X} (e : W ≤ U ⊔ V) (x) (y : F.1.obj (op W)) (h₁ : UW = U ⊓ W) (h₂ : VW = V ⊓ W) : F.1.map (homOfLE e).op ((F.objSupIsoProdEqLocus U V).inv x) = y ↔ F.1.map (homOfLE (h₁ ▸ inf_le_left : UW ≤ U)).op x.1.1 = F.1.map (homOfLE <| h₁ ▸ inf_le_right).op y ∧ F.1.map (homOfLE (h₂ ▸ inf_le_left : VW ≤ V)).op x.1.2 = F.1.map (homOfLE <| h₂ ▸ inf_le_right).op y :=", "area": "Topology"} {"task": "t8", "statement": "theorem ae_empty_or_univ_of_forall_vadd_ae_eq_self {s : Set <| AddCircle T} (hs : NullMeasurableSet s volume) {ι : Type*} {l : Filter ι} [l.NeBot] {u : ι → AddCircle T} (hu₁ : ∀ i, (u i +ᵥ s : Set _) =ᵐ[volume] s) (hu₂ : Tendsto (addOrderOf ∘ u) l atTop) : s =ᵐ[volume] (∅ : Set <| AddCircle T) ∨ s =ᵐ[volume] univ :=", "area": "Dynamics"} {"task": "t8", "statement": "theorem ergodic_zsmul {n : ℤ} (hn : 1 < |n|) : Ergodic fun y : AddCircle T => n • y :=", "area": "Dynamics"} {"task": "t8", "statement": "theorem ergodic_nsmul {n : ℕ} (hn : 1 < n) : Ergodic fun y : AddCircle T => n • y :=", "area": "Dynamics"} {"task": "t8", "statement": "theorem ergodic_zsmul_add (x : AddCircle T) {n : ℤ} (h : 1 < |n|) : Ergodic fun y => n • y + x :=", "area": "Dynamics"} {"task": "t8", "statement": "theorem ergodic_nsmul_add (x : AddCircle T) {n : ℕ} (h : 1 < n) : Ergodic fun y => n • y + x :=", "area": "Dynamics"} {"task": "t8", "statement": "theorem nonempty_monotone_mem {s : Set α} (hs : s.Nonempty) : Nonempty { u // Monotone u ∧ ∀ i : ℕ, u i ∈ s } :=", "area": "Analysis"} {"task": "t8", "statement": "theorem eq_of_edist_zero_on {f f' : α → E} {s : Set α} (h : ∀ ⦃x⦄, x ∈ s → edist (f x) (f' x) = 0) : eVariationOn f s = eVariationOn f' s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem eq_of_eqOn {f f' : α → E} {s : Set α} (h : EqOn f f' s) : eVariationOn f s = eVariationOn f' s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem sum_le_of_monotoneOn_Icc (f : α → E) {s : Set α} {m n : ℕ} {u : ℕ → α} (hu : MonotoneOn u (Icc m n)) (us : ∀ i ∈ Icc m n, u i ∈ s) : (∑ i ∈ Finset.Ico m n, edist (f (u (i + 1))) (f (u i))) ≤ eVariationOn f s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem sum_le_of_monotoneOn_Iic (f : α → E) {s : Set α} {n : ℕ} {u : ℕ → α} (hu : MonotoneOn u (Iic n)) (us : ∀ i ≤ n, u i ∈ s) : (∑ i ∈ Finset.range n, edist (f (u (i + 1))) (f (u i))) ≤ eVariationOn f s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem mono (f : α → E) {s t : Set α} (hst : t ⊆ s) : eVariationOn f t ≤ eVariationOn f s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem edist_le (f : α → E) {s : Set α} {x y : α} (hx : x ∈ s) (hy : y ∈ s) : edist (f x) (f y) ≤ eVariationOn f s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem eq_zero_iff (f : α → E) {s : Set α} : eVariationOn f s = 0 ↔ ∀ x ∈ s, ∀ y ∈ s, edist (f x) (f y) = 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem constant_on {f : α → E} {s : Set α} (hf : (f '' s).Subsingleton) : eVariationOn f s = 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem lowerSemicontinuous_aux {ι : Type*} {F : ι → α → E} {p : Filter ι} {f : α → E} {s : Set α} (Ffs : ∀ x ∈ s, Tendsto (fun i => F i x) p (𝓝 (f x))) {v : ℝ≥0∞} (hv : v < eVariationOn f s) : ∀ᶠ n : ι in p, v < eVariationOn (F n) s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem lowerSemicontinuous (s : Set α) : LowerSemicontinuous fun f : α →ᵤ[s.image singleton] E => eVariationOn f s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem lowerSemicontinuous_uniformOn (s : Set α) : LowerSemicontinuous fun f : α →ᵤ[{s}] E => eVariationOn f s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem _root_.BoundedVariationOn.dist_le {E : Type*} [PseudoMetricSpace E] {f : α → E} {s : Set α} (h : BoundedVariationOn f s) {x y : α} (hx : x ∈ s) (hy : y ∈ s) : dist (f x) (f y) ≤ (eVariationOn f s).toReal :=", "area": "Analysis"} {"task": "t8", "statement": "theorem _root_.BoundedVariationOn.sub_le {f : α → ℝ} {s : Set α} (h : BoundedVariationOn f s) {x y : α} (hx : x ∈ s) (hy : y ∈ s) : f x - f y ≤ (eVariationOn f s).toReal :=", "area": "Analysis"} {"task": "t8", "statement": "theorem add_point (f : α → E) {s : Set α} {x : α} (hx : x ∈ s) (u : ℕ → α) (hu : Monotone u) (us : ∀ i, u i ∈ s) (n : ℕ) : ∃ (v : ℕ → α) (m : ℕ), Monotone v ∧ (∀ i, v i ∈ s) ∧ x ∈ v '' Iio m ∧ (∑ i ∈ Finset.range n, edist (f (u (i + 1))) (f (u i))) ≤ ∑ j ∈ Finset.range m, edist (f (v (j + 1))) (f (v j)) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem add_le_union (f : α → E) {s t : Set α} (h : ∀ x ∈ s, ∀ y ∈ t, x ≤ y) : eVariationOn f s + eVariationOn f t ≤ eVariationOn f (s ∪ t) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem union (f : α → E) {s t : Set α} {x : α} (hs : IsGreatest s x) (ht : IsLeast t x) : eVariationOn f (s ∪ t) = eVariationOn f s + eVariationOn f t :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Icc_add_Icc (f : α → E) {s : Set α} {a b c : α} (hab : a ≤ b) (hbc : b ≤ c) (hb : b ∈ s) : eVariationOn f (s ∩ Icc a b) + eVariationOn f (s ∩ Icc b c) = eVariationOn f (s ∩ Icc a c) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem comp_le_of_antitoneOn (f : α → E) {s : Set α} {t : Set β} (φ : β → α) (hφ : AntitoneOn φ t) (φst : MapsTo φ t s) : eVariationOn (f ∘ φ) t ≤ eVariationOn f s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem comp_eq_of_monotoneOn (f : α → E) {t : Set β} (φ : β → α) (hφ : MonotoneOn φ t) : eVariationOn (f ∘ φ) t = eVariationOn f (φ '' t) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem comp_inter_Icc_eq_of_monotoneOn (f : α → E) {t : Set β} (φ : β → α) (hφ : MonotoneOn φ t) {x y : β} (hx : x ∈ t) (hy : y ∈ t) : eVariationOn (f ∘ φ) (t ∩ Icc x y) = eVariationOn f (φ '' t ∩ Icc (φ x) (φ y)) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem comp_eq_of_antitoneOn (f : α → E) {t : Set β} (φ : β → α) (hφ : AntitoneOn φ t) : eVariationOn (f ∘ φ) t = eVariationOn f (φ '' t) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem comp_ofDual (f : α → E) (s : Set α) : eVariationOn (f ∘ ofDual) (ofDual ⁻¹' s) = eVariationOn f s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem MonotoneOn.eVariationOn_le {f : α → ℝ} {s : Set α} (hf : MonotoneOn f s) {a b : α} (as : a ∈ s) (bs : b ∈ s) : eVariationOn f (s ∩ Icc a b) ≤ ENNReal.ofReal (f b - f a) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem self (a : α) : variationOnFromTo f s a a = 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem nonneg_of_le {a b : α} (h : a ≤ b) : 0 ≤ variationOnFromTo f s a b :=", "area": "Analysis"} {"task": "t8", "statement": "theorem eq_neg_swap (a b : α) : variationOnFromTo f s a b = -variationOnFromTo f s b a :=", "area": "Analysis"} {"task": "t8", "statement": "theorem nonpos_of_ge {a b : α} (h : b ≤ a) : variationOnFromTo f s a b ≤ 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem eq_of_ge {a b : α} (h : b ≤ a) : variationOnFromTo f s a b = -(eVariationOn f (s ∩ Icc b a)).toReal :=", "area": "Analysis"} {"task": "t8", "statement": "theorem add {f : α → E} {s : Set α} (hf : LocallyBoundedVariationOn f s) {a b c : α} (ha : a ∈ s) (hb : b ∈ s) (hc : c ∈ s) : variationOnFromTo f s a b + variationOnFromTo f s b c = variationOnFromTo f s a c :=", "area": "Analysis"} {"task": "t8", "statement": "theorem edist_zero_of_eq_zero {f : α → E} {s : Set α} (hf : LocallyBoundedVariationOn f s) {a b : α} (ha : a ∈ s) (hb : b ∈ s) (h : variationOnFromTo f s a b = 0) : edist (f a) (f b) = 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem eq_left_iff {f : α → E} {s : Set α} (hf : LocallyBoundedVariationOn f s) {a b c : α} (ha : a ∈ s) (hb : b ∈ s) (hc : c ∈ s) : variationOnFromTo f s a b = variationOnFromTo f s a c ↔ variationOnFromTo f s b c = 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem eq_zero_iff_of_le {f : α → E} {s : Set α} (hf : LocallyBoundedVariationOn f s) {a b : α} (ha : a ∈ s) (hb : b ∈ s) (ab : a ≤ b) : variationOnFromTo f s a b = 0 ↔ ∀ ⦃x⦄ (_hx : x ∈ s ∩ Icc a b) ⦃y⦄ (_hy : y ∈ s ∩ Icc a b), edist (f x) (f y) = 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem eq_zero_iff_of_ge {f : α → E} {s : Set α} (hf : LocallyBoundedVariationOn f s) {a b : α} (ha : a ∈ s) (hb : b ∈ s) (ba : b ≤ a) : variationOnFromTo f s a b = 0 ↔ ∀ ⦃x⦄ (_hx : x ∈ s ∩ Icc b a) ⦃y⦄ (_hy : y ∈ s ∩ Icc b a), edist (f x) (f y) = 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem eq_zero_iff {f : α → E} {s : Set α} (hf : LocallyBoundedVariationOn f s) {a b : α} (ha : a ∈ s) (hb : b ∈ s) : variationOnFromTo f s a b = 0 ↔ ∀ ⦃x⦄ (_hx : x ∈ s ∩ uIcc a b) ⦃y⦄ (_hy : y ∈ s ∩ uIcc a b), edist (f x) (f y) = 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem monotoneOn (hf : LocallyBoundedVariationOn f s) {a : α} (as : a ∈ s) : MonotoneOn (variationOnFromTo f s a) s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem antitoneOn (hf : LocallyBoundedVariationOn f s) {b : α} (bs : b ∈ s) : AntitoneOn (fun a => variationOnFromTo f s a b) s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem sub_self_monotoneOn {f : α → ℝ} {s : Set α} (hf : LocallyBoundedVariationOn f s) {a : α} (as : a ∈ s) : MonotoneOn (variationOnFromTo f s a - f) s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem comp_eq_of_monotoneOn {β : Type*} [LinearOrder β] (f : α → E) {t : Set β} (φ : β → α) (hφ : MonotoneOn φ t) {x y : β} (hx : x ∈ t) (hy : y ∈ t) : variationOnFromTo (f ∘ φ) t x y = variationOnFromTo f (φ '' t) (φ x) (φ y) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem LocallyBoundedVariationOn.exists_monotoneOn_sub_monotoneOn {f : α → ℝ} {s : Set α} (h : LocallyBoundedVariationOn f s) : ∃ p q : α → ℝ, MonotoneOn p s ∧ MonotoneOn q s ∧ f = p - q :=", "area": "Analysis"} {"task": "t8", "statement": "theorem LipschitzOnWith.comp_eVariationOn_le {f : E → F} {C : ℝ≥0} {t : Set E} (h : LipschitzOnWith C f t) {g : α → E} {s : Set α} (hg : MapsTo g s t) : eVariationOn (f ∘ g) s ≤ C * eVariationOn g s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ae_differentiableWithinAt_of_mem_real {f : ℝ → ℝ} {s : Set ℝ} (h : LocallyBoundedVariationOn f s) : ∀ᵐ x, x ∈ s → DifferentiableWithinAt ℝ f s x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ae_differentiableWithinAt_of_mem_pi {ι : Type*} [Fintype ι] {f : ℝ → ι → ℝ} {s : Set ℝ} (h : LocallyBoundedVariationOn f s) : ∀ᵐ x, x ∈ s → DifferentiableWithinAt ℝ f s x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ae_differentiableWithinAt_of_mem {f : ℝ → V} {s : Set ℝ} (h : LocallyBoundedVariationOn f s) : ∀ᵐ x, x ∈ s → DifferentiableWithinAt ℝ f s x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ae_differentiableWithinAt {f : ℝ → V} {s : Set ℝ} (h : LocallyBoundedVariationOn f s) (hs : MeasurableSet s) : ∀ᵐ x ∂volume.restrict s, DifferentiableWithinAt ℝ f s x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ae_differentiableAt {f : ℝ → V} (h : LocallyBoundedVariationOn f univ) : ∀ᵐ x, DifferentiableAt ℝ f x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem EuclideanSpace.norm_eq {𝕜 : Type*} [RCLike 𝕜] {n : Type*} [Fintype n] (x : EuclideanSpace 𝕜 n) : ‖x‖ = √(∑ i, ‖x i‖ ^ 2) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem EuclideanSpace.ball_zero_eq {n : Type*} [Fintype n] (r : ℝ) (hr : 0 ≤ r) : Metric.ball (0 : EuclideanSpace ℝ n) r = {x | ∑ i, x i ^ 2 < r ^ 2} :=", "area": "Analysis"} {"task": "t8", "statement": "theorem EuclideanSpace.closedBall_zero_eq {n : Type*} [Fintype n] (r : ℝ) (hr : 0 ≤ r) : Metric.closedBall (0 : EuclideanSpace ℝ n) r = {x | ∑ i, x i ^ 2 ≤ r ^ 2} :=", "area": "Analysis"} {"task": "t8", "statement": "theorem EuclideanSpace.sphere_zero_eq {n : Type*} [Fintype n] (r : ℝ) (hr : 0 ≤ r) : Metric.sphere (0 : EuclideanSpace ℝ n) r = {x | ∑ i, x i ^ 2 = r ^ 2} :=", "area": "Analysis"} {"task": "t8", "statement": "theorem finrank_euclideanSpace : FiniteDimensional.finrank 𝕜 (EuclideanSpace 𝕜 ι) = Fintype.card ι :=", "area": "Analysis"} {"task": "t8", "statement": "theorem finrank_euclideanSpace_fin {n : ℕ} : FiniteDimensional.finrank 𝕜 (EuclideanSpace 𝕜 (Fin n)) = n :=", "area": "Analysis"} {"task": "t8", "statement": "theorem DirectSum.IsInternal.isometryL2OfOrthogonalFamily_symm_apply [DecidableEq ι] {V : ι → Submodule 𝕜 E} (hV : DirectSum.IsInternal V) (hV' : OrthogonalFamily 𝕜 (fun i => V i) fun i => (V i).subtypeₗᵢ) (w : PiLp 2 fun i => V i) : (hV.isometryL2OfOrthogonalFamily hV').symm w = ∑ i, (w i : E) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem EuclideanSpace.single_apply (i : ι) (a : 𝕜) (j : ι) : (EuclideanSpace.single i a) j = ite (j = i) a 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem EuclideanSpace.inner_single_left (i : ι) (a : 𝕜) (v : EuclideanSpace 𝕜 ι) : ⟪EuclideanSpace.single i (a : 𝕜), v⟫ = conj a * v i :=", "area": "Analysis"} {"task": "t8", "statement": "theorem EuclideanSpace.inner_single_right (i : ι) (a : 𝕜) (v : EuclideanSpace 𝕜 ι) : ⟪v, EuclideanSpace.single i (a : 𝕜)⟫ = a * conj (v i) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem EuclideanSpace.orthonormal_single : Orthonormal 𝕜 fun i : ι => EuclideanSpace.single i (1 : 𝕜) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem repr_injective : Injective (repr : OrthonormalBasis ι 𝕜 E → E ≃ₗᵢ[𝕜] EuclideanSpace 𝕜 ι) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem coe_ofRepr [DecidableEq ι] (e : E ≃ₗᵢ[𝕜] EuclideanSpace 𝕜 ι) : ⇑(OrthonormalBasis.ofRepr e) = fun i => e.symm (EuclideanSpace.single i (1 : 𝕜)) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem repr_symm_single [DecidableEq ι] (b : OrthonormalBasis ι 𝕜 E) (i : ι) : b.repr.symm (EuclideanSpace.single i (1 : 𝕜)) = b i :=", "area": "Analysis"} {"task": "t8", "statement": "theorem repr_self [DecidableEq ι] (b : OrthonormalBasis ι 𝕜 E) (i : ι) : b.repr (b i) = EuclideanSpace.single i (1 : 𝕜) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem repr_apply_apply (b : OrthonormalBasis ι 𝕜 E) (v : E) (i : ι) : b.repr v i = ⟪b i, v⟫ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem orthonormal (b : OrthonormalBasis ι 𝕜 E) : Orthonormal 𝕜 b :=", "area": "Analysis"} {"task": "t8", "statement": "theorem coe_toBasis (b : OrthonormalBasis ι 𝕜 E) : (⇑b.toBasis : ι → E) = ⇑b :=", "area": "Analysis"} {"task": "t8", "statement": "theorem coe_toBasis_repr_apply (b : OrthonormalBasis ι 𝕜 E) (x : E) (i : ι) : b.toBasis.repr x i = b.repr x i :=", "area": "Analysis"} {"task": "t8", "statement": "theorem sum_repr (b : OrthonormalBasis ι 𝕜 E) (x : E) : ∑ i, b.repr x i • b i = x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem sum_repr_symm (b : OrthonormalBasis ι 𝕜 E) (v : EuclideanSpace 𝕜 ι) : ∑ i, v i • b i = b.repr.symm v :=", "area": "Analysis"} {"task": "t8", "statement": "theorem sum_inner_mul_inner (b : OrthonormalBasis ι 𝕜 E) (x y : E) : ∑ i, ⟪x, b i⟫ * ⟪b i, y⟫ = ⟪x, y⟫ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem orthogonalProjection_eq_sum {U : Submodule 𝕜 E} [CompleteSpace U] (b : OrthonormalBasis ι 𝕜 U) (x : E) : orthogonalProjection U x = ∑ i, ⟪(b i : E), x⟫ • b i :=", "area": "Analysis"} {"task": "t8", "statement": "theorem _root_.Basis.toBasis_toOrthonormalBasis (v : Basis ι 𝕜 E) (hv : Orthonormal 𝕜 v) : (v.toOrthonormalBasis hv).toBasis = v :=", "area": "Analysis"} {"task": "t8", "statement": "theorem _root_.Basis.coe_toOrthonormalBasis (v : Basis ι 𝕜 E) (hv : Orthonormal 𝕜 v) : (v.toOrthonormalBasis hv : ι → E) = (v : ι → E) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem _root_.Pi.orthonormalBasis.toBasis {η : Type*} [Fintype η] {ι : η → Type*} [∀ i, Fintype (ι i)] {𝕜 : Type*} [RCLike 𝕜] {E : η → Type*} [∀ i, NormedAddCommGroup (E i)] [∀ i, InnerProductSpace 𝕜 (E i)] (B : ∀ i, OrthonormalBasis (ι i) 𝕜 (E i)) : (Pi.orthonormalBasis B).toBasis = ((Pi.basis fun i : η ↦ (B i).toBasis).map (WithLp.linearEquiv 2 _ _).symm) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem _root_.Pi.orthonormalBasis_apply {η : Type*} [Fintype η] [DecidableEq η] {ι : η → Type*} [∀ i, Fintype (ι i)] {𝕜 : Type*} [RCLike 𝕜] {E : η → Type*} [∀ i, NormedAddCommGroup (E i)] [∀ i, InnerProductSpace 𝕜 (E i)] (B : ∀ i, OrthonormalBasis (ι i) 𝕜 (E i)) (j : (i : η) × (ι i)) : Pi.orthonormalBasis B j = (WithLp.equiv _ _).symm (Pi.single _ (B j.fst j.snd)) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem coe_mk (hon : Orthonormal 𝕜 v) (hsp : ⊤ ≤ Submodule.span 𝕜 (Set.range v)) : ⇑(OrthonormalBasis.mk hon hsp) = v :=", "area": "Analysis"} {"task": "t8", "statement": "theorem span_apply [DecidableEq E] {v' : ι' → E} (h : Orthonormal 𝕜 v') (s : Finset ι') (i : s) : (OrthonormalBasis.span h s i : E) = v' i :=", "area": "Analysis"} {"task": "t8", "statement": "theorem reindex_apply (b : OrthonormalBasis ι 𝕜 E) (e : ι ≃ ι') (i' : ι') : (b.reindex e) i' = b (e.symm i') :=", "area": "Analysis"} {"task": "t8", "statement": "theorem repr_reindex (b : OrthonormalBasis ι 𝕜 E) (e : ι ≃ ι') (x : E) (i' : ι') : (b.reindex e).repr x i' = b.repr x (e.symm i') :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Complex.coe_orthonormalBasisOneI : (Complex.orthonormalBasisOneI : Fin 2 → ℂ) = ![1, I] :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Complex.map_isometryOfOrthonormal (v : OrthonormalBasis (Fin 2) ℝ F) (f : F ≃ₗᵢ[ℝ] F') : Complex.isometryOfOrthonormal (v.map f) = (Complex.isometryOfOrthonormal v).trans f :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Complex.isometryOfOrthonormal_symm_apply (v : OrthonormalBasis (Fin 2) ℝ F) (f : F) : (Complex.isometryOfOrthonormal v).symm f = (v.toBasis.coord 0 f : ℂ) + (v.toBasis.coord 1 f : ℂ) * I :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Complex.isometryOfOrthonormal_apply (v : OrthonormalBasis (Fin 2) ℝ F) (z : ℂ) : Complex.isometryOfOrthonormal v z = z.re • v 0 + z.im • v 1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem OrthonormalBasis.toMatrix_orthonormalBasis_mem_unitary : a.toBasis.toMatrix b ∈ Matrix.unitaryGroup ι 𝕜 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem OrthonormalBasis.det_to_matrix_orthonormalBasis : ‖a.toBasis.det b‖ = 1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem OrthonormalBasis.det_to_matrix_orthonormalBasis_real : a.toBasis.det b = 1 ∨ a.toBasis.det b = -1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem DirectSum.IsInternal.collectedOrthonormalBasis_mem [DecidableEq ι] (h : DirectSum.IsInternal A) {α : ι → Type*} [∀ i, Fintype (α i)] (hV : OrthogonalFamily 𝕜 (fun i => A i) fun i => (A i).subtypeₗᵢ) (v : ∀ i, OrthonormalBasis (α i) 𝕜 (A i)) (a : Σi, α i) : h.collectedOrthonormalBasis hV v a ∈ A a.1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Orthonormal.exists_orthonormalBasis_extension (hv : Orthonormal 𝕜 ((↑) : v → E)) : ∃ (u : Finset E) (b : OrthonormalBasis u 𝕜 E), v ⊆ u ∧ ⇑b = ((↑) : u → E) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Orthonormal.exists_orthonormalBasis_extension_of_card_eq {ι : Type*} [Fintype ι] (card_ι : finrank 𝕜 E = Fintype.card ι) {v : ι → E} {s : Set ι} (hv : Orthonormal 𝕜 (s.restrict v)) : ∃ b : OrthonormalBasis ι 𝕜 E, ∀ i ∈ s, b i = v i :=", "area": "Analysis"} {"task": "t8", "statement": "theorem orthonormalBasis_one_dim (b : OrthonormalBasis ι ℝ ℝ) : (⇑b = fun _ => (1 : ℝ)) ∨ ⇑b = fun _ => (-1 : ℝ) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem DirectSum.IsInternal.subordinateOrthonormalBasis_subordinate (a : Fin n) (hV' : OrthogonalFamily 𝕜 (fun i => V i) fun i => (V i).subtypeₗᵢ) : hV.subordinateOrthonormalBasis hn hV' a ∈ V (hV.subordinateOrthonormalBasisIndex hn a hV') :=", "area": "Analysis"} {"task": "t8", "statement": "theorem LinearIsometry.extend_apply (L : S →ₗᵢ[𝕜] V) (s : S) : L.extend s = L s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem inner_matrix_row_row [Fintype n] (A B : Matrix m n 𝕜) (i j : m) : ⟪A i, B j⟫ₑ = (B * Aᴴ) j i :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ext_inner_left_basis {ι : Type*} {x y : E} (b : Basis ι 𝕜 E) (h : ∀ i : ι, ⟪b i, x⟫ = ⟪b i, y⟫) : x = y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ext_inner_right_basis {ι : Type*} {x y : E} (b : Basis ι 𝕜 E) (h : ∀ i : ι, ⟪x, b i⟫ = ⟪y, b i⟫) : x = y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem toDual_symm_apply {x : E} {y : NormedSpace.Dual 𝕜 E} : ⟪(toDual 𝕜 E).symm y, x⟫ = y x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem continuousLinearMapOfBilin_apply (v w : E) : ⟪B♯ v, w⟫ = B v w :=", "area": "Analysis"} {"task": "t8", "statement": "theorem unique_continuousLinearMapOfBilin {v f : E} (is_lax_milgram : ∀ w, ⟪f, w⟫ = B v w) : f = B♯ v :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rotation_trans (a b : circle) : (rotation a).trans (rotation b) = rotation (b * a) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rotation_ne_conjLIE (a : circle) : rotation a ≠ conjLIE :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rotationOf_rotation (a : circle) : rotationOf (rotation a) = a :=", "area": "Analysis"} {"task": "t8", "statement": "theorem LinearIsometry.re_apply_eq_re_of_add_conj_eq (f : ℂ →ₗᵢ[ℝ] ℂ) (h₃ : ∀ z, z + conj z = f z + conj (f z)) (z : ℂ) : (f z).re = z.re :=", "area": "Analysis"} {"task": "t8", "statement": "theorem LinearIsometry.im_apply_eq_im_or_neg_of_re_apply_eq_re {f : ℂ →ₗᵢ[ℝ] ℂ} (h₂ : ∀ z, (f z).re = z.re) (z : ℂ) : (f z).im = z.im ∨ (f z).im = -z.im :=", "area": "Analysis"} {"task": "t8", "statement": "theorem LinearIsometry.im_apply_eq_im {f : ℂ →ₗᵢ[ℝ] ℂ} (h : f 1 = 1) (z : ℂ) : z + conj z = f z + conj (f z) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem LinearIsometry.re_apply_eq_re {f : ℂ →ₗᵢ[ℝ] ℂ} (h : f 1 = 1) (z : ℂ) : (f z).re = z.re :=", "area": "Analysis"} {"task": "t8", "statement": "theorem linear_isometry_complex_aux {f : ℂ ≃ₗᵢ[ℝ] ℂ} (h : f 1 = 1) : f = LinearIsometryEquiv.refl ℝ ℂ ∨ f = conjLIE :=", "area": "Analysis"} {"task": "t8", "statement": "theorem linear_isometry_complex (f : ℂ ≃ₗᵢ[ℝ] ℂ) : ∃ a : circle, f = rotation a ∨ f = conjLIE.trans (rotation a) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem toMatrix_rotation (a : circle) : LinearMap.toMatrix basisOneI basisOneI (rotation a).toLinearEquiv = Matrix.planeConformalMatrix (re a) (im a) (by simp [pow_two, ← normSq_apply]) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem det_rotation (a : circle) : LinearMap.det ((rotation a).toLinearEquiv : ℂ →ₗ[ℝ] ℂ) = 1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem linearEquiv_det_rotation (a : circle) : LinearEquiv.det (rotation a).toLinearEquiv = 1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem IsEquivalent.isBigO_symm (h : u ~[l] v) : v =O[l] u :=", "area": "Analysis"} {"task": "t8", "statement": "theorem IsEquivalent.refl : u ~[l] u :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isEquivalent_zero_iff_eventually_zero : u ~[l] 0 ↔ u =ᶠ[l] 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isEquivalent_zero_iff_isBigO_zero : u ~[l] 0 ↔ u =O[l] (0 : α → β) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isEquivalent_const_iff_tendsto {c : β} (h : c ≠ 0) : u ~[l] const _ c ↔ Tendsto u l (𝓝 c) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem IsEquivalent.tendsto_const {c : β} (hu : u ~[l] const _ c) : Tendsto u l (𝓝 c) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem IsEquivalent.tendsto_nhds {c : β} (huv : u ~[l] v) (hu : Tendsto u l (𝓝 c)) : Tendsto v l (𝓝 c) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem IsEquivalent.add_isLittleO (huv : u ~[l] v) (hwv : w =o[l] v) : u + w ~[l] v :=", "area": "Analysis"} {"task": "t8", "statement": "theorem IsEquivalent.sub_isLittleO (huv : u ~[l] v) (hwv : w =o[l] v) : u - w ~[l] v :=", "area": "Analysis"} {"task": "t8", "statement": "theorem IsEquivalent.neg (huv : u ~[l] v) : (fun x ↦ -u x) ~[l] fun x ↦ -v x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isEquivalent_iff_exists_eq_mul : u ~[l] v ↔ ∃ (φ : α → β) (_ : Tendsto φ l (𝓝 1)), u =ᶠ[l] φ * v :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isEquivalent_of_tendsto_one (hz : ∀ᶠ x in l, v x = 0 → u x = 0) (huv : Tendsto (u / v) l (𝓝 1)) : u ~[l] v :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isEquivalent_iff_tendsto_one (hz : ∀ᶠ x in l, v x ≠ 0) : u ~[l] v ↔ Tendsto (u / v) l (𝓝 1) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem IsEquivalent.smul {α E 𝕜 : Type*} [NormedField 𝕜] [NormedAddCommGroup E] [NormedSpace 𝕜 E] {a b : α → 𝕜} {u v : α → E} {l : Filter α} (hab : a ~[l] b) (huv : u ~[l] v) : (fun x ↦ a x • u x) ~[l] fun x ↦ b x • v x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem IsEquivalent.inv (huv : u ~[l] v) : (fun x ↦ (u x)⁻¹) ~[l] fun x ↦ (v x)⁻¹ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem IsEquivalent.div (htu : t ~[l] u) (hvw : v ~[l] w) : (fun x ↦ t x / v x) ~[l] fun x ↦ u x / w x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem IsEquivalent.tendsto_atBot [OrderTopology β] (huv : u ~[l] v) (hu : Tendsto u l atBot) : Tendsto v l atBot :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Real.fourierCoeff_tsum_comp_add {f : C(ℝ, ℂ)} (hf : ∀ K : Compacts ℝ, Summable fun n : ℤ => ‖(f.comp (ContinuousMap.addRight n)).restrict K‖) (m : ℤ) : fourierCoeff (Periodic.lift <| f.periodic_tsum_comp_add_zsmul 1) m = 𝓕 f m :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Real.tsum_eq_tsum_fourierIntegral {f : C(ℝ, ℂ)} (h_norm : ∀ K : Compacts ℝ, Summable fun n : ℤ => ‖(f.comp <| ContinuousMap.addRight n).restrict K‖) (h_sum : Summable fun n : ℤ => 𝓕 f n) (x : ℝ) : ∑' n : ℤ, f (x + n) = ∑' n : ℤ, 𝓕 f n * fourier n (x : UnitAddCircle) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isBigO_norm_Icc_restrict_atTop {f : C(ℝ, E)} {b : ℝ} (hb : 0 < b) (hf : f =O[atTop] fun x : ℝ => |x| ^ (-b)) (R S : ℝ) : (fun x : ℝ => ‖f.restrict (Icc (x + R) (x + S))‖) =O[atTop] fun x : ℝ => |x| ^ (-b) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isBigO_norm_Icc_restrict_atBot {f : C(ℝ, E)} {b : ℝ} (hb : 0 < b) (hf : f =O[atBot] fun x : ℝ => |x| ^ (-b)) (R S : ℝ) : (fun x : ℝ => ‖f.restrict (Icc (x + R) (x + S))‖) =O[atBot] fun x : ℝ => |x| ^ (-b) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isBigO_norm_restrict_cocompact (f : C(ℝ, E)) {b : ℝ} (hb : 0 < b) (hf : f =O[cocompact ℝ] fun x : ℝ => |x| ^ (-b)) (K : Compacts ℝ) : (fun x => ‖(f.comp (ContinuousMap.addRight x)).restrict K‖) =O[cocompact ℝ] (|·| ^ (-b)) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem SchwartzMap.tsum_eq_tsum_fourierIntegral (f g : SchwartzMap ℝ ℂ) (hfg : 𝓕 ⇑f = ⇑g) (x : ℝ) : ∑' n : ℤ, f (x + n) = (∑' n : ℤ, g n * fourier n (x : UnitAddCircle)) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem decay (f : 𝓢(E, F)) (k n : ℕ) : ∃ C : ℝ, 0 < C ∧ ∀ x, ‖x‖ ^ k * ‖iteratedFDeriv ℝ n f x‖ ≤ C :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isBigO_cocompact_zpow_neg_nat (k : ℕ) : f =O[cocompact E] fun x => ‖x‖ ^ (-k : ℤ) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isBigO_cocompact_rpow [ProperSpace E] (s : ℝ) : f =O[cocompact E] fun x => ‖x‖ ^ s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isBigO_cocompact_zpow [ProperSpace E] (k : ℤ) : f =O[cocompact E] fun x => ‖x‖ ^ k :=", "area": "Analysis"} {"task": "t8", "statement": "theorem decay_add_le_aux (k n : ℕ) (f g : 𝓢(E, F)) (x : E) : ‖x‖ ^ k * ‖iteratedFDeriv ℝ n ((f : E → F) + (g : E → F)) x‖ ≤ ‖x‖ ^ k * ‖iteratedFDeriv ℝ n f x‖ + ‖x‖ ^ k * ‖iteratedFDeriv ℝ n g x‖ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem decay_neg_aux (k n : ℕ) (f : 𝓢(E, F)) (x : E) : ‖x‖ ^ k * ‖iteratedFDeriv ℝ n (-f : E → F) x‖ = ‖x‖ ^ k * ‖iteratedFDeriv ℝ n f x‖ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem decay_smul_aux (k n : ℕ) (f : 𝓢(E, F)) (c : 𝕜) (x : E) : ‖x‖ ^ k * ‖iteratedFDeriv ℝ n (c • (f : E → F)) x‖ = ‖c‖ * ‖x‖ ^ k * ‖iteratedFDeriv ℝ n f x‖ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem seminormAux_smul_le (k n : ℕ) (c : 𝕜) (f : 𝓢(E, F)) : (c • f).seminormAux k n ≤ ‖c‖ * f.seminormAux k n :=", "area": "Analysis"} {"task": "t8", "statement": "theorem seminormAux_zero (k n : ℕ) : (0 : 𝓢(E, F)).seminormAux k n = 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem coeHom_injective : Function.Injective (coeHom E F) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem seminorm_le_bound' (k n : ℕ) (f : 𝓢(ℝ, F)) {M : ℝ} (hMp : 0 ≤ M) (hM : ∀ x, |x| ^ k * ‖iteratedDeriv n f x‖ ≤ M) : SchwartzMap.seminorm 𝕜 k n f ≤ M :=", "area": "Analysis"} {"task": "t8", "statement": "theorem le_seminorm' (k n : ℕ) (f : 𝓢(ℝ, F)) (x : ℝ) : |x| ^ k * ‖iteratedDeriv n f x‖ ≤ SchwartzMap.seminorm 𝕜 k n f :=", "area": "Analysis"} {"task": "t8", "statement": "theorem norm_iteratedFDeriv_le_seminorm (f : 𝓢(E, F)) (n : ℕ) (x₀ : E) : ‖iteratedFDeriv ℝ n f x₀‖ ≤ (SchwartzMap.seminorm 𝕜 0 n) f :=", "area": "Analysis"} {"task": "t8", "statement": "theorem norm_pow_mul_le_seminorm (f : 𝓢(E, F)) (k : ℕ) (x₀ : E) : ‖x₀‖ ^ k * ‖f x₀‖ ≤ (SchwartzMap.seminorm 𝕜 k 0) f :=", "area": "Analysis"} {"task": "t8", "statement": "theorem norm_le_seminorm (f : 𝓢(E, F)) (x₀ : E) : ‖f x₀‖ ≤ (SchwartzMap.seminorm 𝕜 0 0) f :=", "area": "Analysis"} {"task": "t8", "statement": "theorem one_add_le_sup_seminorm_apply {m : ℕ × ℕ} {k n : ℕ} (hk : k ≤ m.1) (hn : n ≤ m.2) (f : 𝓢(E, F)) (x : E) : (1 + ‖x‖) ^ k * ‖iteratedFDeriv ℝ n f x‖ ≤ 2 ^ m.1 * (Finset.Iic m).sup (fun m => SchwartzMap.seminorm 𝕜 m.1 m.2) f :=", "area": "Analysis"} {"task": "t8", "statement": "theorem _root_.schwartz_withSeminorms : WithSeminorms (schwartzSeminormFamily 𝕜 E F) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem _root_.Function.HasTemperateGrowth.norm_iteratedFDeriv_le_uniform_aux {f : E → F} (hf_temperate : f.HasTemperateGrowth) (n : ℕ) : ∃ (k : ℕ) (C : ℝ), 0 ≤ C ∧ ∀ N ≤ n, ∀ x : E, ‖iteratedFDeriv ℝ N f x‖ ≤ C * (1 + ‖x‖) ^ k :=", "area": "Analysis"} {"task": "t8", "statement": "lemma _root_.Function.HasTemperateGrowth.of_fderiv {f : E → F} (h'f : Function.HasTemperateGrowth (fderiv ℝ f)) (hf : Differentiable ℝ f) {k : ℕ} {C : ℝ} (h : ∀ x, ‖f x‖ ≤ C * (1 + ‖x‖) ^ k) : Function.HasTemperateGrowth f :=", "area": "Analysis"} {"task": "t8", "statement": "lemma _root_.Function.HasTemperateGrowth.zero : Function.HasTemperateGrowth (fun _ : E ↦ (0 : F)) :=", "area": "Analysis"} {"task": "t8", "statement": "lemma _root_.Function.HasTemperateGrowth.const (c : F) : Function.HasTemperateGrowth (fun _ : E ↦ c) :=", "area": "Analysis"} {"task": "t8", "statement": "lemma _root_.ContinuousLinearMap.hasTemperateGrowth (f : E →L[ℝ] F) : Function.HasTemperateGrowth f :=", "area": "Analysis"} {"task": "t8", "statement": "lemma integrable_pow_neg_integrablePower (μ : Measure D) [h : μ.HasTemperateGrowth] : Integrable (fun x ↦ (1 + ‖x‖) ^ (- (μ.integrablePower : ℝ))) μ :=", "area": "Analysis"} {"task": "t8", "statement": "lemma pow_mul_le_of_le_of_pow_mul_le {C₁ C₂ : ℝ} {k l : ℕ} {x f : ℝ} (hx : 0 ≤ x) (hf : 0 ≤ f) (h₁ : f ≤ C₁) (h₂ : x ^ (k + l) * f ≤ C₂) : x ^ k * f ≤ 2 ^ l * (C₁ + C₂) * (1 + x) ^ (- (l : ℝ)) :=", "area": "Analysis"} {"task": "t8", "statement": "lemma integrable_of_le_of_pow_mul_le {μ : Measure D} [μ.HasTemperateGrowth] {f : D → E} {C₁ C₂ : ℝ} {k : ℕ} (hf : ∀ x, ‖f x‖ ≤ C₁) (h'f : ∀ x, ‖x‖ ^ (k + μ.integrablePower) * ‖f x‖ ≤ C₂) (h''f : AEStronglyMeasurable f μ) : Integrable (fun x ↦ ‖x‖ ^ k * ‖f x‖) μ :=", "area": "Analysis"} {"task": "t8", "statement": "lemma integral_pow_mul_le_of_le_of_pow_mul_le {μ : Measure D} [μ.HasTemperateGrowth] {f : D → E} {C₁ C₂ : ℝ} {k : ℕ} (hf : ∀ x, ‖f x‖ ≤ C₁) (h'f : ∀ x, ‖x‖ ^ (k + μ.integrablePower) * ‖f x‖ ≤ C₂) : ∫ x, ‖x‖ ^ k * ‖f x‖ ∂μ ≤ 2 ^ μ.integrablePower * (∫ x, (1 + ‖x‖) ^ (- (μ.integrablePower : ℝ)) ∂μ) * (C₁ + C₂) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem pderivCLM_eq_lineDeriv (m : E) (f : 𝓢(E, F)) (x : E) : pderivCLM 𝕜 m f x = lineDeriv ℝ f x m :=", "area": "Analysis"} {"task": "t8", "statement": "theorem iteratedPDeriv_succ_right {n : ℕ} (m : Fin (n + 1) → E) (f : 𝓢(E, F)) : iteratedPDeriv 𝕜 m f = iteratedPDeriv 𝕜 (Fin.init m) (pderivCLM 𝕜 (m (Fin.last n)) f) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem iteratedPDeriv_eq_iteratedFDeriv {n : ℕ} {m : Fin n → E} {f : 𝓢(E, F)} {x : E} : iteratedPDeriv 𝕜 m f x = iteratedFDeriv ℝ n f x m :=", "area": "Analysis"} {"task": "t8", "statement": "lemma integrable_pow_mul (f : 𝓢(D, V)) (k : ℕ) : Integrable (fun x ↦ ‖x‖ ^ k * ‖f x‖) μ :=", "area": "Analysis"} {"task": "t8", "statement": "lemma integrable (f : 𝓢(D, V)) : Integrable f μ :=", "area": "Analysis"} {"task": "t8", "statement": "@[simp] lemma integralCLM_apply (f : 𝓢(D, V)) : integralCLM 𝕜 μ f = ∫ x, f x ∂μ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem integralCLM_dirac_eq_delta (x : E) : integralCLM 𝕜 (dirac x) = delta 𝕜 F x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Sbtw.dist_lt_max_dist (p : P) {p₁ p₂ p₃ : P} (h : Sbtw ℝ p₁ p₂ p₃) : dist p₂ p < max (dist p₁ p) (dist p₃ p) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Wbtw.dist_le_max_dist (p : P) {p₁ p₂ p₃ : P} (h : Wbtw ℝ p₁ p₂ p₃) : dist p₂ p ≤ max (dist p₁ p) (dist p₃ p) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Collinear.wbtw_of_dist_eq_of_dist_le {p p₁ p₂ p₃ : P} {r : ℝ} (h : Collinear ℝ ({p₁, p₂, p₃} : Set P)) (hp₁ : dist p₁ p = r) (hp₂ : dist p₂ p ≤ r) (hp₃ : dist p₃ p = r) (hp₁p₃ : p₁ ≠ p₃) : Wbtw ℝ p₁ p₂ p₃ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Collinear.sbtw_of_dist_eq_of_dist_lt {p p₁ p₂ p₃ : P} {r : ℝ} (h : Collinear ℝ ({p₁, p₂, p₃} : Set P)) (hp₁ : dist p₁ p = r) (hp₂ : dist p₂ p < r) (hp₃ : dist p₃ p = r) (hp₁p₃ : p₁ ≠ p₃) : Sbtw ℝ p₁ p₂ p₃ :=", "area": "Analysis"} {"task": "t8", "statement": "lemma dist_add_dist_eq_iff : dist a b + dist b c = dist a c ↔ Wbtw ℝ a b c :=", "area": "Analysis"} {"task": "t8", "statement": "lemma eq_lineMap_of_dist_eq_mul_of_dist_eq_mul (hxy : dist x y = r * dist x z) (hyz : dist y z = (1 - r) * dist x z) : y = AffineMap.lineMap x z r :=", "area": "Analysis"} {"task": "t8", "statement": "lemma eq_midpoint_of_dist_eq_half (hx : dist x y = dist x z / 2) (hy : dist y z = dist x z / 2) : y = midpoint ℝ x z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem QuasiconvexOn.sup [SemilatticeSup β] (hf : QuasiconvexOn 𝕜 s f) (hg : QuasiconvexOn 𝕜 s g) : QuasiconvexOn 𝕜 s (f ⊔ g) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem quasilinearOn_iff_mem_uIcc : QuasilinearOn 𝕜 s f ↔ Convex 𝕜 s ∧ ∀ ⦃x⦄, x ∈ s → ∀ ⦃y⦄, y ∈ s → ∀ ⦃a b : 𝕜⦄, 0 ≤ a → 0 ≤ b → a + b = 1 → f (a • x + b • y) ∈ uIcc (f x) (f y) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem QuasiconvexOn.convex_lt (hf : QuasiconvexOn 𝕜 s f) (r : β) : Convex 𝕜 ({ x ∈ s | f x < r }) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem QuasilinearOn.monotoneOn_or_antitoneOn [LinearOrder β] (hf : QuasilinearOn 𝕜 s f) : MonotoneOn f s ∨ AntitoneOn f s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem convexOn_id {s : Set β} (hs : Convex 𝕜 s) : ConvexOn 𝕜 s _root_.id :=", "area": "Analysis"} {"task": "t8", "statement": "theorem concaveOn_id {s : Set β} (hs : Convex 𝕜 s) : ConcaveOn 𝕜 s _root_.id :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ConvexOn.add (hf : ConvexOn 𝕜 s f) (hg : ConvexOn 𝕜 s g) : ConvexOn 𝕜 s (f + g) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ConvexOn.convex_le (hf : ConvexOn 𝕜 s f) (r : β) : Convex 𝕜 ({ x ∈ s | f x ≤ r }) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ConvexOn.convex_epigraph (hf : ConvexOn 𝕜 s f) : Convex 𝕜 { p : E × β | p.1 ∈ s ∧ f p.1 ≤ p.2 } :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ConvexOn.translate_right (hf : ConvexOn 𝕜 s f) (c : E) : ConvexOn 𝕜 ((fun z => c + z) ⁻¹' s) (f ∘ fun z => c + z) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ConvexOn.translate_left (hf : ConvexOn 𝕜 s f) (c : E) : ConvexOn 𝕜 ((fun z => c + z) ⁻¹' s) (f ∘ fun z => z + c) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem convexOn_iff_forall_pos {s : Set E} {f : E → β} : ConvexOn 𝕜 s f ↔ Convex 𝕜 s ∧ ∀ ⦃x⦄, x ∈ s → ∀ ⦃y⦄, y ∈ s → ∀ ⦃a b : 𝕜⦄, 0 < a → 0 < b → a + b = 1 → f (a • x + b • y) ≤ a • f x + b • f y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem convexOn_iff_pairwise_pos {s : Set E} {f : E → β} : ConvexOn 𝕜 s f ↔ Convex 𝕜 s ∧ s.Pairwise fun x y => ∀ ⦃a b : 𝕜⦄, 0 < a → 0 < b → a + b = 1 → f (a • x + b • y) ≤ a • f x + b • f y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem LinearMap.convexOn (f : E →ₗ[𝕜] β) {s : Set E} (hs : Convex 𝕜 s) : ConvexOn 𝕜 s f :=", "area": "Analysis"} {"task": "t8", "statement": "theorem LinearMap.concaveOn (f : E →ₗ[𝕜] β) {s : Set E} (hs : Convex 𝕜 s) : ConcaveOn 𝕜 s f :=", "area": "Analysis"} {"task": "t8", "statement": "theorem StrictConvexOn.convex_lt (hf : StrictConvexOn 𝕜 s f) (r : β) : Convex 𝕜 ({ x ∈ s | f x < r }) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem LinearOrder.convexOn_of_lt (hs : Convex 𝕜 s) (hf : ∀ ⦃x⦄, x ∈ s → ∀ ⦃y⦄, y ∈ s → x < y → ∀ ⦃a b : 𝕜⦄, 0 < a → 0 < b → a + b = 1 → f (a • x + b • y) ≤ a • f x + b • f y) : ConvexOn 𝕜 s f :=", "area": "Analysis"} {"task": "t8", "statement": "theorem LinearOrder.strictConvexOn_of_lt (hs : Convex 𝕜 s) (hf : ∀ ⦃x⦄, x ∈ s → ∀ ⦃y⦄, y ∈ s → x < y → ∀ ⦃a b : 𝕜⦄, 0 < a → 0 < b → a + b = 1 → f (a • x + b • y) < a • f x + b • f y) : StrictConvexOn 𝕜 s f :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ConvexOn.comp_linearMap {f : F → β} {s : Set F} (hf : ConvexOn 𝕜 s f) (g : E →ₗ[𝕜] F) : ConvexOn 𝕜 (g ⁻¹' s) (f ∘ g) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem StrictConvexOn.add_convexOn (hf : StrictConvexOn 𝕜 s f) (hg : ConvexOn 𝕜 s g) : StrictConvexOn 𝕜 s (f + g) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem StrictConvexOn.add (hf : StrictConvexOn 𝕜 s f) (hg : StrictConvexOn 𝕜 s g) : StrictConvexOn 𝕜 s (f + g) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ConvexOn.openSegment_subset_strict_epigraph (hf : ConvexOn 𝕜 s f) (p q : E × β) (hp : p.1 ∈ s ∧ f p.1 < p.2) (hq : q.1 ∈ s ∧ f q.1 ≤ q.2) : openSegment 𝕜 p q ⊆ { p : E × β | p.1 ∈ s ∧ f p.1 < p.2 } :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ConvexOn.sup (hf : ConvexOn 𝕜 s f) (hg : ConvexOn 𝕜 s g) : ConvexOn 𝕜 s (f ⊔ g) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem StrictConvexOn.sup (hf : StrictConvexOn 𝕜 s f) (hg : StrictConvexOn 𝕜 s g) : StrictConvexOn 𝕜 s (f ⊔ g) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ConvexOn.le_on_segment' (hf : ConvexOn 𝕜 s f) {x y : E} (hx : x ∈ s) (hy : y ∈ s) {a b : 𝕜} (ha : 0 ≤ a) (hb : 0 ≤ b) (hab : a + b = 1) : f (a • x + b • y) ≤ max (f x) (f y) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem StrictConvexOn.lt_on_open_segment' (hf : StrictConvexOn 𝕜 s f) {x y : E} (hx : x ∈ s) (hy : y ∈ s) (hxy : x ≠ y) {a b : 𝕜} (ha : 0 < a) (hb : 0 < b) (hab : a + b = 1) : f (a • x + b • y) < max (f x) (f y) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ConvexOn.le_right_of_left_le' (hf : ConvexOn 𝕜 s f) {x y : E} {a b : 𝕜} (hx : x ∈ s) (hy : y ∈ s) (ha : 0 ≤ a) (hb : 0 < b) (hab : a + b = 1) (hfx : f x ≤ f (a • x + b • y)) : f (a • x + b • y) ≤ f y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ConvexOn.le_left_of_right_le (hf : ConvexOn 𝕜 s f) {x y z : E} (hx : x ∈ s) (hy : y ∈ s) (hz : z ∈ openSegment 𝕜 x y) (hyz : f y ≤ f z) : f z ≤ f x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ConvexOn.le_right_of_left_le (hf : ConvexOn 𝕜 s f) {x y z : E} (hx : x ∈ s) (hy : y ∈ s) (hz : z ∈ openSegment 𝕜 x y) (hxz : f x ≤ f z) : f z ≤ f y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ConvexOn.lt_right_of_left_lt' (hf : ConvexOn 𝕜 s f) {x y : E} {a b : 𝕜} (hx : x ∈ s) (hy : y ∈ s) (ha : 0 < a) (hb : 0 < b) (hab : a + b = 1) (hfx : f x < f (a • x + b • y)) : f (a • x + b • y) < f y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ConvexOn.lt_left_of_right_lt (hf : ConvexOn 𝕜 s f) {x y z : E} (hx : x ∈ s) (hy : y ∈ s) (hz : z ∈ openSegment 𝕜 x y) (hyz : f y < f z) : f z < f x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ConvexOn.lt_right_of_left_lt (hf : ConvexOn 𝕜 s f) {x y z : E} (hx : x ∈ s) (hy : y ∈ s) (hz : z ∈ openSegment 𝕜 x y) (hxz : f x < f z) : f z < f y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem neg_convexOn_iff : ConvexOn 𝕜 s (-f) ↔ ConcaveOn 𝕜 s f :=", "area": "Analysis"} {"task": "t8", "statement": "theorem neg_concaveOn_iff : ConcaveOn 𝕜 s (-f) ↔ ConvexOn 𝕜 s f :=", "area": "Analysis"} {"task": "t8", "statement": "theorem neg_strictConvexOn_iff : StrictConvexOn 𝕜 s (-f) ↔ StrictConcaveOn 𝕜 s f :=", "area": "Analysis"} {"task": "t8", "statement": "theorem neg_strictConcaveOn_iff : StrictConcaveOn 𝕜 s (-f) ↔ StrictConvexOn 𝕜 s f :=", "area": "Analysis"} {"task": "t8", "statement": "theorem StrictConvexOn.translate_right (hf : StrictConvexOn 𝕜 s f) (c : E) : StrictConvexOn 𝕜 ((fun z => c + z) ⁻¹' s) (f ∘ fun z => c + z) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem StrictConvexOn.translate_left (hf : StrictConvexOn 𝕜 s f) (c : E) : StrictConvexOn 𝕜 ((fun z => c + z) ⁻¹' s) (f ∘ fun z => z + c) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem StrictConcaveOn.translate_left (hf : StrictConcaveOn 𝕜 s f) (c : E) : StrictConcaveOn 𝕜 ((fun z => c + z) ⁻¹' s) (f ∘ fun z => z + c) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ConvexOn.smul {c : 𝕜} (hc : 0 ≤ c) (hf : ConvexOn 𝕜 s f) : ConvexOn 𝕜 s fun x => c • f x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ConvexOn.comp_affineMap {f : F → β} (g : E →ᵃ[𝕜] F) {s : Set F} (hf : ConvexOn 𝕜 s f) : ConvexOn 𝕜 (g ⁻¹' s) (f ∘ g) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem convexOn_iff_div {f : E → β} : ConvexOn 𝕜 s f ↔ Convex 𝕜 s ∧ ∀ ⦃x⦄, x ∈ s → ∀ ⦃y⦄, y ∈ s → ∀ ⦃a b : 𝕜⦄, 0 ≤ a → 0 ≤ b → 0 < a + b → f ((a / (a + b)) • x + (b / (a + b)) • y) ≤ (a / (a + b)) • f x + (b / (a + b)) • f y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem strictConvexOn_iff_div {f : E → β} : StrictConvexOn 𝕜 s f ↔ Convex 𝕜 s ∧ ∀ ⦃x⦄, x ∈ s → ∀ ⦃y⦄, y ∈ s → x ≠ y → ∀ ⦃a b : 𝕜⦄, 0 < a → 0 < b → f ((a / (a + b)) • x + (b / (a + b)) • y) < (a / (a + b)) • f x + (b / (a + b)) • f y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem OrderIso.strictConvexOn_symm (f : α ≃o β) (hf : StrictConcaveOn 𝕜 univ f) : StrictConvexOn 𝕜 univ f.symm :=", "area": "Analysis"} {"task": "t8", "statement": "theorem OrderIso.convexOn_symm (f : α ≃o β) (hf : ConcaveOn 𝕜 univ f) : ConvexOn 𝕜 univ f.symm :=", "area": "Analysis"} {"task": "t8", "statement": "theorem OrderIso.strictConcaveOn_symm (f : α ≃o β) (hf : StrictConvexOn 𝕜 univ f) : StrictConcaveOn 𝕜 univ f.symm :=", "area": "Analysis"} {"task": "t8", "statement": "theorem OrderIso.concaveOn_symm (f : α ≃o β) (hf : ConvexOn 𝕜 univ f) : ConcaveOn 𝕜 univ f.symm :=", "area": "Analysis"} {"task": "t8", "statement": "lemma StrictConvexOn.eq_of_isMinOn (hf : StrictConvexOn 𝕜 s f) (hfx : IsMinOn f s x) (hfy : IsMinOn f s y) (hx : x ∈ s) (hy : y ∈ s) : x = y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem WSameSide.map {s : AffineSubspace R P} {x y : P} (h : s.WSameSide x y) (f : P →ᵃ[R] P') : (s.map f).WSameSide (f x) (f y) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem _root_.Function.Injective.wSameSide_map_iff {s : AffineSubspace R P} {x y : P} {f : P →ᵃ[R] P'} (hf : Function.Injective f) : (s.map f).WSameSide (f x) (f y) ↔ s.WSameSide x y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem _root_.Function.Injective.sSameSide_map_iff {s : AffineSubspace R P} {x y : P} {f : P →ᵃ[R] P'} (hf : Function.Injective f) : (s.map f).SSameSide (f x) (f y) ↔ s.SSameSide x y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem WOppSide.map {s : AffineSubspace R P} {x y : P} (h : s.WOppSide x y) (f : P →ᵃ[R] P') : (s.map f).WOppSide (f x) (f y) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem _root_.Function.Injective.wOppSide_map_iff {s : AffineSubspace R P} {x y : P} {f : P →ᵃ[R] P'} (hf : Function.Injective f) : (s.map f).WOppSide (f x) (f y) ↔ s.WOppSide x y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem _root_.Function.Injective.sOppSide_map_iff {s : AffineSubspace R P} {x y : P} {f : P →ᵃ[R] P'} (hf : Function.Injective f) : (s.map f).SOppSide (f x) (f y) ↔ s.SOppSide x y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem sSameSide_comm {s : AffineSubspace R P} {x y : P} : s.SSameSide x y ↔ s.SSameSide y x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem wOppSide_comm {s : AffineSubspace R P} {x y : P} : s.WOppSide x y ↔ s.WOppSide y x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem sOppSide_comm {s : AffineSubspace R P} {x y : P} : s.SOppSide x y ↔ s.SOppSide y x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem wSameSide_of_left_mem {s : AffineSubspace R P} {x : P} (y : P) (hx : x ∈ s) : s.WSameSide x y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem wOppSide_of_left_mem {s : AffineSubspace R P} {x : P} (y : P) (hx : x ∈ s) : s.WOppSide x y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem wSameSide_vadd_left_iff {s : AffineSubspace R P} {x y : P} {v : V} (hv : v ∈ s.direction) : s.WSameSide (v +ᵥ x) y ↔ s.WSameSide x y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem wSameSide_vadd_right_iff {s : AffineSubspace R P} {x y : P} {v : V} (hv : v ∈ s.direction) : s.WSameSide x (v +ᵥ y) ↔ s.WSameSide x y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem sSameSide_vadd_left_iff {s : AffineSubspace R P} {x y : P} {v : V} (hv : v ∈ s.direction) : s.SSameSide (v +ᵥ x) y ↔ s.SSameSide x y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem sSameSide_vadd_right_iff {s : AffineSubspace R P} {x y : P} {v : V} (hv : v ∈ s.direction) : s.SSameSide x (v +ᵥ y) ↔ s.SSameSide x y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem wOppSide_vadd_left_iff {s : AffineSubspace R P} {x y : P} {v : V} (hv : v ∈ s.direction) : s.WOppSide (v +ᵥ x) y ↔ s.WOppSide x y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem wOppSide_vadd_right_iff {s : AffineSubspace R P} {x y : P} {v : V} (hv : v ∈ s.direction) : s.WOppSide x (v +ᵥ y) ↔ s.WOppSide x y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem sOppSide_vadd_left_iff {s : AffineSubspace R P} {x y : P} {v : V} (hv : v ∈ s.direction) : s.SOppSide (v +ᵥ x) y ↔ s.SOppSide x y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem sOppSide_vadd_right_iff {s : AffineSubspace R P} {x y : P} {v : V} (hv : v ∈ s.direction) : s.SOppSide x (v +ᵥ y) ↔ s.SOppSide x y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem wSameSide_smul_vsub_vadd_left {s : AffineSubspace R P} {p₁ p₂ : P} (x : P) (hp₁ : p₁ ∈ s) (hp₂ : p₂ ∈ s) {t : R} (ht : 0 ≤ t) : s.WSameSide (t • (x -ᵥ p₁) +ᵥ p₂) x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem wOppSide_smul_vsub_vadd_left {s : AffineSubspace R P} {p₁ p₂ : P} (x : P) (hp₁ : p₁ ∈ s) (hp₂ : p₂ ∈ s) {t : R} (ht : t ≤ 0) : s.WOppSide (t • (x -ᵥ p₁) +ᵥ p₂) x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem _root_.Wbtw.wSameSide₂₃ {s : AffineSubspace R P} {x y z : P} (h : Wbtw R x y z) (hx : x ∈ s) : s.WSameSide y z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem _root_.Wbtw.wOppSide₁₃ {s : AffineSubspace R P} {x y z : P} (h : Wbtw R x y z) (hy : y ∈ s) : s.WOppSide x z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem wOppSide_self_iff {s : AffineSubspace R P} {x : P} : s.WOppSide x x ↔ x ∈ s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem not_sOppSide_self (s : AffineSubspace R P) (x : P) : ¬s.SOppSide x x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem wSameSide_iff_exists_left {s : AffineSubspace R P} {x y p₁ : P} (h : p₁ ∈ s) : s.WSameSide x y ↔ x ∈ s ∨ ∃ p₂ ∈ s, SameRay R (x -ᵥ p₁) (y -ᵥ p₂) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem wSameSide_iff_exists_right {s : AffineSubspace R P} {x y p₂ : P} (h : p₂ ∈ s) : s.WSameSide x y ↔ y ∈ s ∨ ∃ p₁ ∈ s, SameRay R (x -ᵥ p₁) (y -ᵥ p₂) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem sSameSide_iff_exists_left {s : AffineSubspace R P} {x y p₁ : P} (h : p₁ ∈ s) : s.SSameSide x y ↔ x ∉ s ∧ y ∉ s ∧ ∃ p₂ ∈ s, SameRay R (x -ᵥ p₁) (y -ᵥ p₂) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem sSameSide_iff_exists_right {s : AffineSubspace R P} {x y p₂ : P} (h : p₂ ∈ s) : s.SSameSide x y ↔ x ∉ s ∧ y ∉ s ∧ ∃ p₁ ∈ s, SameRay R (x -ᵥ p₁) (y -ᵥ p₂) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem wOppSide_iff_exists_left {s : AffineSubspace R P} {x y p₁ : P} (h : p₁ ∈ s) : s.WOppSide x y ↔ x ∈ s ∨ ∃ p₂ ∈ s, SameRay R (x -ᵥ p₁) (p₂ -ᵥ y) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem wOppSide_iff_exists_right {s : AffineSubspace R P} {x y p₂ : P} (h : p₂ ∈ s) : s.WOppSide x y ↔ y ∈ s ∨ ∃ p₁ ∈ s, SameRay R (x -ᵥ p₁) (p₂ -ᵥ y) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem sOppSide_iff_exists_left {s : AffineSubspace R P} {x y p₁ : P} (h : p₁ ∈ s) : s.SOppSide x y ↔ x ∉ s ∧ y ∉ s ∧ ∃ p₂ ∈ s, SameRay R (x -ᵥ p₁) (p₂ -ᵥ y) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem sOppSide_iff_exists_right {s : AffineSubspace R P} {x y p₂ : P} (h : p₂ ∈ s) : s.SOppSide x y ↔ x ∉ s ∧ y ∉ s ∧ ∃ p₁ ∈ s, SameRay R (x -ᵥ p₁) (p₂ -ᵥ y) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem WSameSide.trans {s : AffineSubspace R P} {x y z : P} (hxy : s.WSameSide x y) (hyz : s.WSameSide y z) (hy : y ∉ s) : s.WSameSide x z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem WSameSide.trans_wOppSide {s : AffineSubspace R P} {x y z : P} (hxy : s.WSameSide x y) (hyz : s.WOppSide y z) (hy : y ∉ s) : s.WOppSide x z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem WOppSide.trans {s : AffineSubspace R P} {x y z : P} (hxy : s.WOppSide x y) (hyz : s.WOppSide y z) (hy : y ∉ s) : s.WSameSide x z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem wSameSide_and_wOppSide_iff {s : AffineSubspace R P} {x y : P} : s.WSameSide x y ∧ s.WOppSide x y ↔ x ∈ s ∨ y ∈ s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem WSameSide.not_sOppSide {s : AffineSubspace R P} {x y : P} (h : s.WSameSide x y) : ¬s.SOppSide x y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem SSameSide.not_wOppSide {s : AffineSubspace R P} {x y : P} (h : s.SSameSide x y) : ¬s.WOppSide x y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem wOppSide_iff_exists_wbtw {s : AffineSubspace R P} {x y : P} : s.WOppSide x y ↔ ∃ p ∈ s, Wbtw R x p y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem SOppSide.exists_sbtw {s : AffineSubspace R P} {x y : P} (h : s.SOppSide x y) : ∃ p ∈ s, Sbtw R x p y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem _root_.Sbtw.sOppSide_of_not_mem_of_mem {s : AffineSubspace R P} {x y z : P} (h : Sbtw R x y z) (hx : x ∉ s) (hy : y ∈ s) : s.SOppSide x z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem sSameSide_smul_vsub_vadd_left {s : AffineSubspace R P} {x p₁ p₂ : P} (hx : x ∉ s) (hp₁ : p₁ ∈ s) (hp₂ : p₂ ∈ s) {t : R} (ht : 0 < t) : s.SSameSide (t • (x -ᵥ p₁) +ᵥ p₂) x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem sOppSide_smul_vsub_vadd_left {s : AffineSubspace R P} {x p₁ p₂ : P} (hx : x ∉ s) (hp₁ : p₁ ∈ s) (hp₂ : p₂ ∈ s) {t : R} (ht : t < 0) : s.SOppSide (t • (x -ᵥ p₁) +ᵥ p₂) x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem setOf_wSameSide_eq_image2 {s : AffineSubspace R P} {x p : P} (hx : x ∉ s) (hp : p ∈ s) : { y | s.WSameSide x y } = Set.image2 (fun (t : R) q => t • (x -ᵥ p) +ᵥ q) (Set.Ici 0) s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem setOf_sSameSide_eq_image2 {s : AffineSubspace R P} {x p : P} (hx : x ∉ s) (hp : p ∈ s) : { y | s.SSameSide x y } = Set.image2 (fun (t : R) q => t • (x -ᵥ p) +ᵥ q) (Set.Ioi 0) s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem setOf_wOppSide_eq_image2 {s : AffineSubspace R P} {x p : P} (hx : x ∉ s) (hp : p ∈ s) : { y | s.WOppSide x y } = Set.image2 (fun (t : R) q => t • (x -ᵥ p) +ᵥ q) (Set.Iic 0) s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem setOf_sOppSide_eq_image2 {s : AffineSubspace R P} {x p : P} (hx : x ∉ s) (hp : p ∈ s) : { y | s.SOppSide x y } = Set.image2 (fun (t : R) q => t • (x -ᵥ p) +ᵥ q) (Set.Iio 0) s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem sOppSide_pointReflection {s : AffineSubspace R P} {x y : P} (hx : x ∈ s) (hy : y ∉ s) : s.SOppSide y (pointReflection R x y) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isConnected_setOf_wSameSide {s : AffineSubspace ℝ P} (x : P) (h : (s : Set P).Nonempty) : IsConnected { y | s.WSameSide x y } :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isPreconnected_setOf_wSameSide (s : AffineSubspace ℝ P) (x : P) : IsPreconnected { y | s.WSameSide x y } :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isConnected_setOf_sSameSide {s : AffineSubspace ℝ P} {x : P} (hx : x ∉ s) (h : (s : Set P).Nonempty) : IsConnected { y | s.SSameSide x y } :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isPreconnected_setOf_sSameSide (s : AffineSubspace ℝ P) (x : P) : IsPreconnected { y | s.SSameSide x y } :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isConnected_setOf_wOppSide {s : AffineSubspace ℝ P} (x : P) (h : (s : Set P).Nonempty) : IsConnected { y | s.WOppSide x y } :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isPreconnected_setOf_wOppSide (s : AffineSubspace ℝ P) (x : P) : IsPreconnected { y | s.WOppSide x y } :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isConnected_setOf_sOppSide {s : AffineSubspace ℝ P} {x : P} (hx : x ∉ s) (h : (s : Set P).Nonempty) : IsConnected { y | s.SOppSide x y } :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isPreconnected_setOf_sOppSide (s : AffineSubspace ℝ P) (x : P) : IsPreconnected { y | s.SOppSide x y } :=", "area": "Analysis"} {"task": "t8", "statement": "theorem convexHull_eq_iInter : convexHull 𝕜 s = ⋂ (t : Set E) (_ : s ⊆ t) (_ : Convex 𝕜 t), t :=", "area": "Analysis"} {"task": "t8", "statement": "theorem mem_convexHull_iff : x ∈ convexHull 𝕜 s ↔ ∀ t, s ⊆ t → Convex 𝕜 t → x ∈ t :=", "area": "Analysis"} {"task": "t8", "statement": "theorem convexHull_empty_iff : convexHull 𝕜 s = ∅ ↔ s = ∅ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem convexHull_nonempty_iff : (convexHull 𝕜 s).Nonempty ↔ s.Nonempty :=", "area": "Analysis"} {"task": "t8", "statement": "theorem convexHull_pair (x y : E) : convexHull 𝕜 {x, y} = segment 𝕜 x y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Convex.convex_remove_iff_not_mem_convexHull_remove {s : Set E} (hs : Convex 𝕜 s) (x : E) : Convex 𝕜 (s \\ {x}) ↔ x ∉ convexHull 𝕜 (s \\ {x}) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem AffineMap.image_convexHull (f : E →ᵃ[𝕜] F) (s : Set E) : f '' convexHull 𝕜 s = convexHull 𝕜 (f '' s) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem affineSpan_convexHull (s : Set E) : affineSpan 𝕜 (convexHull 𝕜 s) = affineSpan 𝕜 s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem convexHull_neg (s : Set E) : -convexHull 𝕜 s = convexHull 𝕜 (-s) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_def' : gauge s x = sInf {r ∈ Set.Ioi (0 : ℝ) | r⁻¹ • x ∈ s} :=", "area": "Analysis"} {"task": "t8", "statement": "theorem exists_lt_of_gauge_lt (absorbs : Absorbent ℝ s) (h : gauge s x < a) : ∃ b, 0 < b ∧ b < a ∧ x ∈ b • s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_zero : gauge s 0 = 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_zero' : gauge (0 : Set E) = 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_empty : gauge (∅ : Set E) = 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_of_subset_zero (h : s ⊆ 0) : gauge s = 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_neg (symmetric : ∀ x ∈ s, -x ∈ s) (x : E) : gauge s (-x) = gauge s x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_neg_set_neg (x : E) : gauge (-s) (-x) = gauge s x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_neg_set_eq_gauge_neg (x : E) : gauge (-s) x = gauge s (-x) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_le_of_mem (ha : 0 ≤ a) (hx : x ∈ a • s) : gauge s x ≤ a :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_le_eq (hs₁ : Convex ℝ s) (hs₀ : (0 : E) ∈ s) (hs₂ : Absorbent ℝ s) (ha : 0 ≤ a) : { x | gauge s x ≤ a } = ⋂ (r : ℝ) (_ : a < r), r • s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_lt_eq' (absorbs : Absorbent ℝ s) (a : ℝ) : { x | gauge s x < a } = ⋃ (r : ℝ) (_ : 0 < r) (_ : r < a), r • s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_lt_eq (absorbs : Absorbent ℝ s) (a : ℝ) : { x | gauge s x < a } = ⋃ r ∈ Set.Ioo 0 (a : ℝ), r • s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem mem_openSegment_of_gauge_lt_one (absorbs : Absorbent ℝ s) (hgauge : gauge s x < 1) : ∃ y ∈ s, x ∈ openSegment ℝ 0 y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_le_one_of_mem {x : E} (hx : x ∈ s) : gauge s x ≤ 1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_add_le (hs : Convex ℝ s) (absorbs : Absorbent ℝ s) (x y : E) : gauge s (x + y) ≤ gauge s x + gauge s y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Convex.gauge_le (hs : Convex ℝ s) (h₀ : (0 : E) ∈ s) (absorbs : Absorbent ℝ s) (a : ℝ) : Convex ℝ { x | gauge s x ≤ a } :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Balanced.starConvex (hs : Balanced ℝ s) : StarConvex ℝ 0 s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem le_gauge_of_not_mem (hs₀ : StarConvex ℝ 0 s) (hs₂ : Absorbs ℝ s {x}) (hx : x ∉ a • s) : a ≤ gauge s x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem one_le_gauge_of_not_mem (hs₁ : StarConvex ℝ 0 s) (hs₂ : Absorbs ℝ s {x}) (hx : x ∉ s) : 1 ≤ gauge s x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_smul_of_nonneg [MulActionWithZero α E] [IsScalarTower α ℝ (Set E)] {s : Set E} {a : α} (ha : 0 ≤ a) (x : E) : gauge s (a • x) = a • gauge s x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_smul_left_of_nonneg [MulActionWithZero α E] [SMulCommClass α ℝ ℝ] [IsScalarTower α ℝ ℝ] [IsScalarTower α ℝ E] {s : Set E} {a : α} (ha : 0 ≤ a) : gauge (a • s) = a⁻¹ • gauge s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_smul_left [Module α E] [SMulCommClass α ℝ ℝ] [IsScalarTower α ℝ ℝ] [IsScalarTower α ℝ E] {s : Set E} (symmetric : ∀ x ∈ s, -x ∈ s) (a : α) : gauge (a • s) = |a|⁻¹ • gauge s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_norm_smul (hs : Balanced 𝕜 s) (r : 𝕜) (x : E) : gauge s (‖r‖ • x) = gauge s (r • x) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_smul (hs : Balanced 𝕜 s) (r : 𝕜) (x : E) : gauge s (r • x) = ‖r‖ * gauge s x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem comap_gauge_nhds_zero_le (ha : Absorbent ℝ s) (hb : Bornology.IsVonNBounded ℝ s) : comap (gauge s) (𝓝 0) ≤ 𝓝 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_eq_zero (hs : Absorbent ℝ s) (hb : Bornology.IsVonNBounded ℝ s) : gauge s x = 0 ↔ x = 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_pos (hs : Absorbent ℝ s) (hb : Bornology.IsVonNBounded ℝ s) : 0 < gauge s x ↔ x ≠ 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem interior_subset_gauge_lt_one (s : Set E) : interior s ⊆ { x | gauge s x < 1 } :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_lt_one_eq_self_of_isOpen (hs₁ : Convex ℝ s) (hs₀ : (0 : E) ∈ s) (hs₂ : IsOpen s) : { x | gauge s x < 1 } = s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_lt_one_of_mem_of_isOpen (hs₂ : IsOpen s) {x : E} (hx : x ∈ s) : gauge s x < 1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_lt_of_mem_smul (x : E) (ε : ℝ) (hε : 0 < ε) (hs₂ : IsOpen s) (hx : x ∈ ε • s) : gauge s x < ε :=", "area": "Analysis"} {"task": "t8", "statement": "theorem mem_closure_of_gauge_le_one (hc : Convex ℝ s) (hs₀ : 0 ∈ s) (ha : Absorbent ℝ s) (h : gauge s x ≤ 1) : x ∈ closure s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem tendsto_gauge_nhds_zero' (hs : s ∈ 𝓝 0) : Tendsto (gauge s) (𝓝 0) (𝓝[≥] 0) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem continuousAt_gauge_zero (hs : s ∈ 𝓝 0) : ContinuousAt (gauge s) 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem continuousAt_gauge (hc : Convex ℝ s) (hs₀ : s ∈ 𝓝 0) : ContinuousAt (gauge s) x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_lt_one_eq_interior (hc : Convex ℝ s) (hs₀ : s ∈ 𝓝 0) : { x | gauge s x < 1 } = interior s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_eq_one_iff_mem_frontier (hc : Convex ℝ s) (hs₀ : s ∈ 𝓝 0) : gauge s x = 1 ↔ x ∈ frontier s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gaugeSeminorm_ball_one (hs : IsOpen s) : (gaugeSeminorm hs₀ hs₁ hs₂).ball 0 1 = s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Seminorm.gauge_ball (p : Seminorm ℝ E) : gauge (p.ball 0 1) = p :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_unit_ball (x : E) : gauge (ball (0 : E) 1) x = ‖x‖ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_ball (hr : 0 ≤ r) (x : E) : gauge (ball (0 : E) r) x = ‖x‖ / r :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_closure_zero : gauge (closure (0 : Set E)) = 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem gauge_closedBall (hr : 0 ≤ r) (x : E) : gauge (closedBall (0 : E) r) x = ‖x‖ / r :=", "area": "Analysis"} {"task": "t8", "statement": "theorem mul_gauge_le_norm (hs : Metric.ball (0 : E) r ⊆ s) : r * gauge s x ≤ ‖x‖ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Convex.lipschitzWith_gauge {r : ℝ≥0} (hc : Convex ℝ s) (hr : 0 < r) (hs : Metric.ball (0 : E) r ⊆ s) : LipschitzWith r⁻¹ (gauge s) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem le_gauge_of_subset_closedBall (hs : Absorbent ℝ s) (hr : 0 ≤ r) (hsr : s ⊆ closedBall 0 r) : ‖x‖ / r ≤ gauge s x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem not_integrableOn_of_tendsto_norm_atTop_of_deriv_isBigO_filter_aux [CompleteSpace E] {f : ℝ → E} {g : ℝ → F} {k : Set ℝ} (l : Filter ℝ) [NeBot l] [TendstoIxxClass Icc l l] (hl : k ∈ l) (hd : ∀ᶠ x in l, DifferentiableAt ℝ f x) (hf : Tendsto (fun x => ‖f x‖) l atTop) (hfg : deriv f =O[l] g) : ¬IntegrableOn g k :=", "area": "Analysis"} {"task": "t8", "statement": "theorem not_integrableOn_of_tendsto_norm_atTop_of_deriv_isBigO_filter {f : ℝ → E} {g : ℝ → F} {k : Set ℝ} (l : Filter ℝ) [NeBot l] [TendstoIxxClass Icc l l] (hl : k ∈ l) (hd : ∀ᶠ x in l, DifferentiableAt ℝ f x) (hf : Tendsto (fun x => ‖f x‖) l atTop) (hfg : deriv f =O[l] g) : ¬IntegrableOn g k :=", "area": "Analysis"} {"task": "t8", "statement": "theorem not_intervalIntegrable_of_tendsto_norm_atTop_of_deriv_isBigO_filter {f : ℝ → E} {g : ℝ → F} {a b : ℝ} (l : Filter ℝ) [NeBot l] [TendstoIxxClass Icc l l] (hl : [[a, b]] ∈ l) (hd : ∀ᶠ x in l, DifferentiableAt ℝ f x) (hf : Tendsto (fun x => ‖f x‖) l atTop) (hfg : deriv f =O[l] g) : ¬IntervalIntegrable g volume a b :=", "area": "Analysis"} {"task": "t8", "statement": "theorem not_intervalIntegrable_of_tendsto_norm_atTop_of_deriv_isBigO_within_diff_singleton {f : ℝ → E} {g : ℝ → F} {a b c : ℝ} (hne : a ≠ b) (hc : c ∈ [[a, b]]) (h_deriv : ∀ᶠ x in 𝓝[[[a, b]] \\ {c}] c, DifferentiableAt ℝ f x) (h_infty : Tendsto (fun x => ‖f x‖) (𝓝[[[a, b]] \\ {c}] c) atTop) (hg : deriv f =O[𝓝[[[a, b]] \\ {c}] c] g) : ¬IntervalIntegrable g volume a b :=", "area": "Analysis"} {"task": "t8", "statement": "theorem not_intervalIntegrable_of_sub_inv_isBigO_punctured {f : ℝ → F} {a b c : ℝ} (hf : (fun x => (x - c)⁻¹) =O[𝓝[≠] c] f) (hne : a ≠ b) (hc : c ∈ [[a, b]]) : ¬IntervalIntegrable f volume a b :=", "area": "Analysis"} {"task": "t8", "statement": "theorem intervalIntegrable_sub_inv_iff {a b c : ℝ} : IntervalIntegrable (fun x => (x - c)⁻¹) volume a b ↔ a = b ∨ c ∉ [[a, b]] :=", "area": "Analysis"} {"task": "t8", "statement": "theorem intervalIntegrable_inv_iff {a b : ℝ} : IntervalIntegrable (fun x => x⁻¹) volume a b ↔ a = b ∨ (0 : ℝ) ∉ [[a, b]] :=", "area": "Analysis"} {"task": "t8", "statement": "theorem not_IntegrableOn_Ici_inv {a : ℝ} : ¬ IntegrableOn (fun x => x⁻¹) (Ici a) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem not_IntegrableOn_Ioi_inv {a : ℝ} : ¬ IntegrableOn (·⁻¹) (Ioi a) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem betaIntegral_convergent_left {u : ℂ} (hu : 0 < re u) (v : ℂ) : IntervalIntegrable (fun x => (x : ℂ) ^ (u - 1) * (1 - (x : ℂ)) ^ (v - 1) : ℝ → ℂ) volume 0 (1 / 2) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem betaIntegral_convergent {u v : ℂ} (hu : 0 < re u) (hv : 0 < re v) : IntervalIntegrable (fun x => (x : ℂ) ^ (u - 1) * (1 - (x : ℂ)) ^ (v - 1) : ℝ → ℂ) volume 0 1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem betaIntegral_symm (u v : ℂ) : betaIntegral v u = betaIntegral u v :=", "area": "Analysis"} {"task": "t8", "statement": "theorem betaIntegral_eval_one_right {u : ℂ} (hu : 0 < re u) : betaIntegral u 1 = 1 / u :=", "area": "Analysis"} {"task": "t8", "statement": "theorem betaIntegral_scaled (s t : ℂ) {a : ℝ} (ha : 0 < a) : ∫ x in (0)..a, (x : ℂ) ^ (s - 1) * ((a : ℂ) - x) ^ (t - 1) = (a : ℂ) ^ (s + t - 1) * betaIntegral s t :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Gamma_mul_Gamma_eq_betaIntegral {s t : ℂ} (hs : 0 < re s) (ht : 0 < re t) : Gamma s * Gamma t = Gamma (s + t) * betaIntegral s t :=", "area": "Analysis"} {"task": "t8", "statement": "theorem betaIntegral_recurrence {u v : ℂ} (hu : 0 < re u) (hv : 0 < re v) : u * betaIntegral u (v + 1) = v * betaIntegral (u + 1) v :=", "area": "Analysis"} {"task": "t8", "statement": "theorem betaIntegral_eval_nat_add_one_right {u : ℂ} (hu : 0 < re u) (n : ℕ) : betaIntegral u (n + 1) = n ! / ∏ j ∈ Finset.range (n + 1), (u + j) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem GammaSeq_eq_betaIntegral_of_re_pos {s : ℂ} (hs : 0 < re s) (n : ℕ) : GammaSeq s n = (n : ℂ) ^ s * betaIntegral s (n + 1) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem GammaSeq_add_one_left (s : ℂ) {n : ℕ} (hn : n ≠ 0) : GammaSeq (s + 1) n / s = n / (n + 1 + s) * GammaSeq s n :=", "area": "Analysis"} {"task": "t8", "statement": "theorem GammaSeq_eq_approx_Gamma_integral {s : ℂ} (hs : 0 < re s) {n : ℕ} (hn : n ≠ 0) : GammaSeq s n = ∫ x : ℝ in (0)..n, ↑((1 - x / n) ^ n) * (x : ℂ) ^ (s - 1) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem approx_Gamma_integral_tendsto_Gamma_integral {s : ℂ} (hs : 0 < re s) : Tendsto (fun n : ℕ => ∫ x : ℝ in (0)..n, ((1 - x / n) ^ n : ℝ) * (x : ℂ) ^ (s - 1)) atTop (𝓝 <| Gamma s) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem GammaSeq_tendsto_Gamma (s : ℂ) : Tendsto (GammaSeq s) atTop (𝓝 <| Gamma s) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem GammaSeq_mul (z : ℂ) {n : ℕ} (hn : n ≠ 0) : GammaSeq z n * GammaSeq (1 - z) n = n / (n + ↑1 - z) * (↑1 / (z * ∏ j ∈ Finset.range n, (↑1 - z ^ 2 / ((j : ℂ) + 1) ^ 2))) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Gamma_mul_Gamma_one_sub (z : ℂ) : Gamma z * Gamma (1 - z) = π / sin (π * z) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Gamma_ne_zero {s : ℂ} (hs : ∀ m : ℕ, s ≠ -m) : Gamma s ≠ 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Gamma_eq_zero_iff (s : ℂ) : Gamma s = 0 ↔ ∃ m : ℕ, s = -m :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Gamma_ne_zero_of_re_pos {s : ℂ} (hs : 0 < re s) : Gamma s ≠ 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem GammaSeq_tendsto_Gamma (s : ℝ) : Tendsto (GammaSeq s) atTop (𝓝 <| Gamma s) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Gamma_mul_Gamma_one_sub (s : ℝ) : Gamma s * Gamma (1 - s) = π / sin (π * s) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem one_div_Gamma_eq_self_mul_one_div_Gamma_add_one (s : ℂ) : (Gamma s)⁻¹ = s * (Gamma (s + 1))⁻¹ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem differentiable_one_div_Gamma : Differentiable ℂ fun s : ℂ => (Gamma s)⁻¹ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Gamma_mul_Gamma_add_half (s : ℂ) : Gamma s * Gamma (s + 1 / 2) = Gamma (2 * s) * (2 : ℂ) ^ (1 - 2 * s) * ↑(√π) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Gamma_mul_Gamma_add_half (s : ℝ) : Gamma s * Gamma (s + 1 / 2) = Gamma (2 * s) * (2 : ℝ) ^ (1 - 2 * s) * √π :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ConvexOn.congr [SMul 𝕜 β] (hf : ConvexOn 𝕜 s f) (hfg : EqOn f g s) : ConvexOn 𝕜 s g :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ConcaveOn.congr [SMul 𝕜 β] (hf : ConcaveOn 𝕜 s f) (hfg : EqOn f g s) : ConcaveOn 𝕜 s g :=", "area": "Analysis"} {"task": "t8", "statement": "theorem StrictConvexOn.congr [SMul 𝕜 β] (hf : StrictConvexOn 𝕜 s f) (hfg : EqOn f g s) : StrictConvexOn 𝕜 s g :=", "area": "Analysis"} {"task": "t8", "statement": "theorem StrictConcaveOn.congr [SMul 𝕜 β] (hf : StrictConcaveOn 𝕜 s f) (hfg : EqOn f g s) : StrictConcaveOn 𝕜 s g :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Gamma_mul_add_mul_le_rpow_Gamma_mul_rpow_Gamma {s t a b : ℝ} (hs : 0 < s) (ht : 0 < t) (ha : 0 < a) (hb : 0 < b) (hab : a + b = 1) : Gamma (a * s + b * t) ≤ Gamma s ^ a * Gamma t ^ b :=", "area": "Analysis"} {"task": "t8", "statement": "theorem convexOn_log_Gamma : ConvexOn ℝ (Ioi 0) (log ∘ Gamma) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem convexOn_Gamma : ConvexOn ℝ (Ioi 0) Gamma :=", "area": "Analysis"} {"task": "t8", "statement": "theorem f_nat_eq (hf_feq : ∀ {y : ℝ}, 0 < y → f (y + 1) = f y + log y) (hn : n ≠ 0) : f n = f 1 + log (n - 1)! :=", "area": "Analysis"} {"task": "t8", "statement": "theorem f_add_nat_eq (hf_feq : ∀ {y : ℝ}, 0 < y → f (y + 1) = f y + log y) (hx : 0 < x) (n : ℕ) : f (x + n) = f x + ∑ m ∈ Finset.range n, log (x + m) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem f_add_nat_le (hf_conv : ConvexOn ℝ (Ioi 0) f) (hf_feq : ∀ {y : ℝ}, 0 < y → f (y + 1) = f y + log y) (hn : n ≠ 0) (hx : 0 < x) (hx' : x ≤ 1) : f (n + x) ≤ f n + x * log n :=", "area": "Analysis"} {"task": "t8", "statement": "theorem f_add_nat_ge (hf_conv : ConvexOn ℝ (Ioi 0) f) (hf_feq : ∀ {y : ℝ}, 0 < y → f (y + 1) = f y + log y) (hn : 2 ≤ n) (hx : 0 < x) : f n + x * log (n - 1) ≤ f (n + x) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem logGammaSeq_add_one (x : ℝ) (n : ℕ) : logGammaSeq (x + 1) n = logGammaSeq x (n + 1) + log x - (x + 1) * (log (n + 1) - log n) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem le_logGammaSeq (hf_conv : ConvexOn ℝ (Ioi 0) f) (hf_feq : ∀ {y : ℝ}, 0 < y → f (y + 1) = f y + log y) (hx : 0 < x) (hx' : x ≤ 1) (n : ℕ) : f x ≤ f 1 + x * log (n + 1) - x * log n + logGammaSeq x n :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ge_logGammaSeq (hf_conv : ConvexOn ℝ (Ioi 0) f) (hf_feq : ∀ {y : ℝ}, 0 < y → f (y + 1) = f y + log y) (hx : 0 < x) (hn : n ≠ 0) : f 1 + logGammaSeq x n ≤ f x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem tendsto_logGammaSeq_of_le_one (hf_conv : ConvexOn ℝ (Ioi 0) f) (hf_feq : ∀ {y : ℝ}, 0 < y → f (y + 1) = f y + log y) (hx : 0 < x) (hx' : x ≤ 1) : Tendsto (logGammaSeq x) atTop (𝓝 <| f x - f 1) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem tendsto_logGammaSeq (hf_conv : ConvexOn ℝ (Ioi 0) f) (hf_feq : ∀ {y : ℝ}, 0 < y → f (y + 1) = f y + log y) (hx : 0 < x) : Tendsto (logGammaSeq x) atTop (𝓝 <| f x - f 1) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem tendsto_log_gamma {x : ℝ} (hx : 0 < x) : Tendsto (logGammaSeq x) atTop (𝓝 <| log (Gamma x)) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem eq_Gamma_of_log_convex {f : ℝ → ℝ} (hf_conv : ConvexOn ℝ (Ioi 0) (log ∘ f)) (hf_feq : ∀ {y : ℝ}, 0 < y → f (y + 1) = y * f y) (hf_pos : ∀ {y : ℝ}, 0 < y → 0 < f y) (hf_one : f 1 = 1) : EqOn f Gamma (Ioi (0 : ℝ)) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Gamma_two : Gamma 2 = 1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Gamma_three_div_two_lt_one : Gamma (3 / 2) < 1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Gamma_strictMonoOn_Ici : StrictMonoOn Gamma (Ici 2) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem doublingGamma_add_one (s : ℝ) (hs : s ≠ 0) : doublingGamma (s + 1) = s * doublingGamma s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem doublingGamma_one : doublingGamma 1 = 1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem log_doublingGamma_eq : EqOn (log ∘ doublingGamma) (fun s => log (Gamma (s / 2)) + log (Gamma (s / 2 + 1 / 2)) + s * log 2 - log (2 * √π)) (Ioi 0) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem doublingGamma_log_convex_Ioi : ConvexOn ℝ (Ioi (0 : ℝ)) (log ∘ doublingGamma) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem doublingGamma_eq_Gamma {s : ℝ} (hs : 0 < s) : doublingGamma s = Gamma s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Gamma_mul_Gamma_add_half_of_pos {s : ℝ} (hs : 0 < s) : Gamma s * Gamma (s + 1 / 2) = Gamma (2 * s) * 2 ^ (1 - 2 * s) * √π :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_def_of_nonneg {x : ℝ} (hx : 0 ≤ x) (y : ℝ) : x ^ y = if x = 0 then if y = 0 then 1 else 0 else exp (log x * y) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_def_of_pos {x : ℝ} (hx : 0 < x) (y : ℝ) : x ^ y = exp (log x * y) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem exp_mul (x y : ℝ) : exp (x * y) = exp x ^ y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_intCast (x : ℝ) (n : ℤ) : x ^ (n : ℝ) = x ^ n :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_natCast (x : ℝ) (n : ℕ) : x ^ (n : ℝ) = x ^ n :=", "area": "Analysis"} {"task": "t8", "statement": "theorem exp_one_rpow (x : ℝ) : exp 1 ^ x = exp x :=", "area": "Analysis"} {"task": "t8", "statement": "@[simp] lemma exp_one_pow (n : ℕ) : exp 1 ^ n = exp n :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_eq_zero_iff_of_nonneg (hx : 0 ≤ x) : x ^ y = 0 ↔ x = 0 ∧ y ≠ 0 :=", "area": "Analysis"} {"task": "t8", "statement": "@[simp] lemma rpow_eq_zero (hx : 0 ≤ x) (hy : y ≠ 0) : x ^ y = 0 ↔ x = 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_def_of_neg {x : ℝ} (hx : x < 0) (y : ℝ) : x ^ y = exp (log x * y) * cos (y * π) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_def_of_nonpos {x : ℝ} (hx : x ≤ 0) (y : ℝ) : x ^ y = if x = 0 then if y = 0 then 1 else 0 else exp (log x * y) * cos (y * π) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_pos_of_pos {x : ℝ} (hx : 0 < x) (y : ℝ) : 0 < x ^ y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_zero (x : ℝ) : x ^ (0 : ℝ) = 1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_zero_pos (x : ℝ) : 0 < x ^ (0 : ℝ) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem zero_rpow {x : ℝ} (h : x ≠ 0) : (0 : ℝ) ^ x = 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem zero_rpow_eq_iff {x : ℝ} {a : ℝ} : 0 ^ x = a ↔ x ≠ 0 ∧ a = 0 ∨ x = 0 ∧ a = 1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem eq_zero_rpow_iff {x : ℝ} {a : ℝ} : a = 0 ^ x ↔ x ≠ 0 ∧ a = 0 ∨ x = 0 ∧ a = 1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_one (x : ℝ) : x ^ (1 : ℝ) = x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem one_rpow (x : ℝ) : (1 : ℝ) ^ x = 1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem zero_rpow_le_one (x : ℝ) : (0 : ℝ) ^ x ≤ 1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem zero_rpow_nonneg (x : ℝ) : 0 ≤ (0 : ℝ) ^ x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_nonneg {x : ℝ} (hx : 0 ≤ x) (y : ℝ) : 0 ≤ x ^ y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem abs_rpow_of_nonneg {x y : ℝ} (hx_nonneg : 0 ≤ x) : |x ^ y| = |x| ^ y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem abs_rpow_le_abs_rpow (x y : ℝ) : |x ^ y| ≤ |x| ^ y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem abs_rpow_le_exp_log_mul (x y : ℝ) : |x ^ y| ≤ exp (log x * y) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem norm_rpow_of_nonneg {x y : ℝ} (hx_nonneg : 0 ≤ x) : ‖x ^ y‖ = ‖x‖ ^ y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_add (hx : 0 < x) (y z : ℝ) : x ^ (y + z) = x ^ y * x ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_add' (hx : 0 ≤ x) (h : y + z ≠ 0) : x ^ (y + z) = x ^ y * x ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "lemma rpow_of_add_eq (hx : 0 ≤ x) (hw : w ≠ 0) (h : y + z = w) : x ^ w = x ^ y * x ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_add_of_nonneg (hx : 0 ≤ x) (hy : 0 ≤ y) (hz : 0 ≤ z) : x ^ (y + z) = x ^ y * x ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem le_rpow_add {x : ℝ} (hx : 0 ≤ x) (y z : ℝ) : x ^ y * x ^ z ≤ x ^ (y + z) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_sum_of_nonneg {ι : Type*} {a : ℝ} (ha : 0 ≤ a) {s : Finset ι} {f : ι → ℝ} (h : ∀ x ∈ s, 0 ≤ f x) : (a ^ ∑ x ∈ s, f x) = ∏ x ∈ s, a ^ f x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_neg {x : ℝ} (hx : 0 ≤ x) (y : ℝ) : x ^ (-y) = (x ^ y)⁻¹ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_sub {x : ℝ} (hx : 0 < x) (y z : ℝ) : x ^ (y - z) = x ^ y / x ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_sub' {x : ℝ} (hx : 0 ≤ x) {y z : ℝ} (h : y - z ≠ 0) : x ^ (y - z) = x ^ y / x ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ofReal_cpow {x : ℝ} (hx : 0 ≤ x) (y : ℝ) : ((x ^ y : ℝ) : ℂ) = (x : ℂ) ^ (y : ℂ) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ofReal_cpow_of_nonpos {x : ℝ} (hx : x ≤ 0) (y : ℂ) : (x : ℂ) ^ y = (-x : ℂ) ^ y * exp (π * I * y) :=", "area": "Analysis"} {"task": "t8", "statement": "lemma cpow_ofReal (x : ℂ) (y : ℝ) : x ^ (y : ℂ) = ↑(abs x ^ y) * (Real.cos (arg x * y) + Real.sin (arg x * y) * I) :=", "area": "Analysis"} {"task": "t8", "statement": "lemma cpow_ofReal_re (x : ℂ) (y : ℝ) : (x ^ (y : ℂ)).re = (abs x) ^ y * Real.cos (arg x * y) :=", "area": "Analysis"} {"task": "t8", "statement": "lemma cpow_ofReal_im (x : ℂ) (y : ℝ) : (x ^ (y : ℂ)).im = (abs x) ^ y * Real.sin (arg x * y) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem abs_cpow_of_ne_zero {z : ℂ} (hz : z ≠ 0) (w : ℂ) : abs (z ^ w) = abs z ^ w.re / Real.exp (arg z * im w) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem abs_cpow_of_imp {z w : ℂ} (h : z = 0 → w.re = 0 → w = 0) : abs (z ^ w) = abs z ^ w.re / Real.exp (arg z * im w) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem abs_cpow_le (z w : ℂ) : abs (z ^ w) ≤ abs z ^ w.re / Real.exp (arg z * im w) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem abs_cpow_real (x : ℂ) (y : ℝ) : abs (x ^ (y : ℂ)) = Complex.abs x ^ y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem abs_cpow_inv_nat (x : ℂ) (n : ℕ) : abs (x ^ (n⁻¹ : ℂ)) = Complex.abs x ^ (n⁻¹ : ℝ) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem abs_cpow_eq_rpow_re_of_pos {x : ℝ} (hx : 0 < x) (y : ℂ) : abs (x ^ y) = x ^ y.re :=", "area": "Analysis"} {"task": "t8", "statement": "theorem abs_cpow_eq_rpow_re_of_nonneg {x : ℝ} (hx : 0 ≤ x) {y : ℂ} (hy : re y ≠ 0) : abs (x ^ y) = x ^ re y :=", "area": "Analysis"} {"task": "t8", "statement": "lemma norm_natCast_cpow_of_re_ne_zero (n : ℕ) {s : ℂ} (hs : s.re ≠ 0) : ‖(n : ℂ) ^ s‖ = (n : ℝ) ^ (s.re) :=", "area": "Analysis"} {"task": "t8", "statement": "lemma norm_natCast_cpow_of_pos {n : ℕ} (hn : 0 < n) (s : ℂ) : ‖(n : ℂ) ^ s‖ = (n : ℝ) ^ (s.re) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem cpow_mul_ofReal_nonneg {x : ℝ} (hx : 0 ≤ x) (y : ℝ) (z : ℂ) : (x : ℂ) ^ (↑y * z) = (↑(x ^ y) : ℂ) ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_mul {x : ℝ} (hx : 0 ≤ x) (y z : ℝ) : x ^ (y * z) = (x ^ y) ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_add_int {x : ℝ} (hx : x ≠ 0) (y : ℝ) (n : ℤ) : x ^ (y + n) = x ^ y * x ^ n :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_add_nat {x : ℝ} (hx : x ≠ 0) (y : ℝ) (n : ℕ) : x ^ (y + n) = x ^ y * x ^ n :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_sub_int {x : ℝ} (hx : x ≠ 0) (y : ℝ) (n : ℕ) : x ^ (y - n) = x ^ y / x ^ n :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_sub_nat {x : ℝ} (hx : x ≠ 0) (y : ℝ) (n : ℕ) : x ^ (y - n) = x ^ y / x ^ n :=", "area": "Analysis"} {"task": "t8", "statement": "lemma rpow_add_int' (hx : 0 ≤ x) {n : ℤ} (h : y + n ≠ 0) : x ^ (y + n) = x ^ y * x ^ n :=", "area": "Analysis"} {"task": "t8", "statement": "lemma rpow_add_nat' (hx : 0 ≤ x) (h : y + n ≠ 0) : x ^ (y + n) = x ^ y * x ^ n :=", "area": "Analysis"} {"task": "t8", "statement": "lemma rpow_sub_int' (hx : 0 ≤ x) {n : ℤ} (h : y - n ≠ 0) : x ^ (y - n) = x ^ y / x ^ n :=", "area": "Analysis"} {"task": "t8", "statement": "lemma rpow_sub_nat' (hx : 0 ≤ x) (h : y - n ≠ 0) : x ^ (y - n) = x ^ y / x ^ n :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_add_one {x : ℝ} (hx : x ≠ 0) (y : ℝ) : x ^ (y + 1) = x ^ y * x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_sub_one {x : ℝ} (hx : x ≠ 0) (y : ℝ) : x ^ (y - 1) = x ^ y / x :=", "area": "Analysis"} {"task": "t8", "statement": "lemma rpow_add_one' (hx : 0 ≤ x) (h : y + 1 ≠ 0) : x ^ (y + 1) = x ^ y * x :=", "area": "Analysis"} {"task": "t8", "statement": "lemma rpow_one_add' (hx : 0 ≤ x) (h : 1 + y ≠ 0) : x ^ (1 + y) = x * x ^ y :=", "area": "Analysis"} {"task": "t8", "statement": "lemma rpow_sub_one' (hx : 0 ≤ x) (h : y - 1 ≠ 0) : x ^ (y - 1) = x ^ y / x :=", "area": "Analysis"} {"task": "t8", "statement": "lemma rpow_one_sub' (hx : 0 ≤ x) (h : 1 - y ≠ 0) : x ^ (1 - y) = x / x ^ y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_two (x : ℝ) : x ^ (2 : ℝ) = x ^ 2 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_neg_one (x : ℝ) : x ^ (-1 : ℝ) = x⁻¹ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem mul_rpow (hx : 0 ≤ x) (hy : 0 ≤ y) : (x * y) ^ z = x ^ z * y ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem inv_rpow (hx : 0 ≤ x) (y : ℝ) : x⁻¹ ^ y = (x ^ y)⁻¹ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem div_rpow (hx : 0 ≤ x) (hy : 0 ≤ y) (z : ℝ) : (x / y) ^ z = x ^ z / y ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem log_rpow {x : ℝ} (hx : 0 < x) (y : ℝ) : log (x ^ y) = y * log x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem mul_log_eq_log_iff {x y z : ℝ} (hx : 0 < x) (hz : 0 < z) : y * log x = log z ↔ x ^ y = z :=", "area": "Analysis"} {"task": "t8", "statement": "@[simp] lemma rpow_rpow_inv (hx : 0 ≤ x) (hy : y ≠ 0) : (x ^ y) ^ y⁻¹ = x :=", "area": "Analysis"} {"task": "t8", "statement": "@[simp] lemma rpow_inv_rpow (hx : 0 ≤ x) (hy : y ≠ 0) : (x ^ y⁻¹) ^ y = x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem pow_rpow_inv_natCast (hx : 0 ≤ x) (hn : n ≠ 0) : (x ^ n) ^ (n⁻¹ : ℝ) = x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_inv_natCast_pow (hx : 0 ≤ x) (hn : n ≠ 0) : (x ^ (n⁻¹ : ℝ)) ^ n = x :=", "area": "Analysis"} {"task": "t8", "statement": "lemma rpow_natCast_mul (hx : 0 ≤ x) (n : ℕ) (z : ℝ) : x ^ (n * z) = (x ^ n) ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "lemma rpow_mul_natCast (hx : 0 ≤ x) (y : ℝ) (n : ℕ) : x ^ (y * n) = (x ^ y) ^ n :=", "area": "Analysis"} {"task": "t8", "statement": "lemma rpow_intCast_mul (hx : 0 ≤ x) (n : ℤ) (z : ℝ) : x ^ (n * z) = (x ^ n) ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "lemma rpow_mul_intCast (hx : 0 ≤ x) (y : ℝ) (n : ℤ) : x ^ (y * n) = (x ^ y) ^ n :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_lt_rpow (hx : 0 ≤ x) (hxy : x < y) (hz : 0 < z) : x ^ z < y ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_le_rpow {x y z : ℝ} (h : 0 ≤ x) (h₁ : x ≤ y) (h₂ : 0 ≤ z) : x ^ z ≤ y ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "lemma rpow_lt_rpow_of_neg (hx : 0 < x) (hxy : x < y) (hz : z < 0) : y ^ z < x ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "lemma rpow_le_rpow_of_nonpos (hx : 0 < x) (hxy : x ≤ y) (hz : z ≤ 0) : y ^ z ≤ x ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "lemma le_rpow_inv_iff_of_pos (hx : 0 ≤ x) (hy : 0 ≤ y) (hz : 0 < z) : x ≤ y ^ z⁻¹ ↔ x ^ z ≤ y :=", "area": "Analysis"} {"task": "t8", "statement": "lemma rpow_inv_le_iff_of_pos (hx : 0 ≤ x) (hy : 0 ≤ y) (hz : 0 < z) : x ^ z⁻¹ ≤ y ↔ x ≤ y ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem le_rpow_inv_iff_of_neg (hx : 0 < x) (hy : 0 < y) (hz : z < 0) : x ≤ y ^ z⁻¹ ↔ y ≤ x ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem lt_rpow_inv_iff_of_neg (hx : 0 < x) (hy : 0 < y) (hz : z < 0) : x < y ^ z⁻¹ ↔ y < x ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_inv_lt_iff_of_neg (hx : 0 < x) (hy : 0 < y) (hz : z < 0) : x ^ z⁻¹ < y ↔ y ^ z < x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_inv_le_iff_of_neg (hx : 0 < x) (hy : 0 < y) (hz : z < 0) : x ^ z⁻¹ ≤ y ↔ y ^ z ≤ x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_lt_rpow_of_exponent_lt (hx : 1 < x) (hyz : y < z) : x ^ y < x ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_le_rpow_of_exponent_le (hx : 1 ≤ x) (hyz : y ≤ z) : x ^ y ≤ x ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_lt_rpow_of_exponent_neg {x y z : ℝ} (hy : 0 < y) (hxy : y < x) (hz : z < 0) : x ^ z < y ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_le_rpow_of_exponent_nonpos {x y : ℝ} (hy : 0 < y) (hxy : y ≤ x) (hz : z ≤ 0) : x ^ z ≤ y ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_le_rpow_left_iff (hx : 1 < x) : x ^ y ≤ x ^ z ↔ y ≤ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_lt_rpow_left_iff (hx : 1 < x) : x ^ y < x ^ z ↔ y < z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_lt_rpow_of_exponent_gt (hx0 : 0 < x) (hx1 : x < 1) (hyz : z < y) : x ^ y < x ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_le_rpow_of_exponent_ge (hx0 : 0 < x) (hx1 : x ≤ 1) (hyz : z ≤ y) : x ^ y ≤ x ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_le_rpow_left_iff_of_base_lt_one (hx0 : 0 < x) (hx1 : x < 1) : x ^ y ≤ x ^ z ↔ z ≤ y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_lt_rpow_left_iff_of_base_lt_one (hx0 : 0 < x) (hx1 : x < 1) : x ^ y < x ^ z ↔ z < y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_lt_one {x z : ℝ} (hx1 : 0 ≤ x) (hx2 : x < 1) (hz : 0 < z) : x ^ z < 1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_le_one {x z : ℝ} (hx1 : 0 ≤ x) (hx2 : x ≤ 1) (hz : 0 ≤ z) : x ^ z ≤ 1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_lt_one_of_one_lt_of_neg {x z : ℝ} (hx : 1 < x) (hz : z < 0) : x ^ z < 1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_le_one_of_one_le_of_nonpos {x z : ℝ} (hx : 1 ≤ x) (hz : z ≤ 0) : x ^ z ≤ 1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem one_lt_rpow {x z : ℝ} (hx : 1 < x) (hz : 0 < z) : 1 < x ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem one_le_rpow {x z : ℝ} (hx : 1 ≤ x) (hz : 0 ≤ z) : 1 ≤ x ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem one_lt_rpow_of_pos_of_lt_one_of_neg (hx1 : 0 < x) (hx2 : x < 1) (hz : z < 0) : 1 < x ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem one_le_rpow_of_pos_of_le_one_of_nonpos (hx1 : 0 < x) (hx2 : x ≤ 1) (hz : z ≤ 0) : 1 ≤ x ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_lt_one_iff_of_pos (hx : 0 < x) : x ^ y < 1 ↔ 1 < x ∧ y < 0 ∨ x < 1 ∧ 0 < y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_lt_one_iff (hx : 0 ≤ x) : x ^ y < 1 ↔ x = 0 ∧ y ≠ 0 ∨ 1 < x ∧ y < 0 ∨ x < 1 ∧ 0 < y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_lt_one_iff' {x y : ℝ} (hx : 0 ≤ x) (hy : 0 < y) : x ^ y < 1 ↔ x < 1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem one_lt_rpow_iff_of_pos (hx : 0 < x) : 1 < x ^ y ↔ 1 < x ∧ 0 < y ∨ x < 1 ∧ y < 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem one_lt_rpow_iff (hx : 0 ≤ x) : 1 < x ^ y ↔ 1 < x ∧ 0 < y ∨ 0 < x ∧ x < 1 ∧ y < 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_le_rpow_of_exponent_ge' (hx0 : 0 ≤ x) (hx1 : x ≤ 1) (hz : 0 ≤ z) (hyz : z ≤ y) : x ^ y ≤ x ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_left_injOn {x : ℝ} (hx : x ≠ 0) : InjOn (fun y : ℝ => y ^ x) { y : ℝ | 0 ≤ y } :=", "area": "Analysis"} {"task": "t8", "statement": "lemma rpow_inv_eq (hx : 0 ≤ x) (hy : 0 ≤ y) (hz : z ≠ 0) : x ^ z⁻¹ = y ↔ x = y ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "lemma eq_rpow_inv (hx : 0 ≤ x) (hy : 0 ≤ y) (hz : z ≠ 0) : x = y ^ z⁻¹ ↔ x ^ z = y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem le_rpow_iff_log_le (hx : 0 < x) (hy : 0 < y) : x ≤ y ^ z ↔ Real.log x ≤ z * Real.log y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem le_rpow_of_log_le (hx : 0 ≤ x) (hy : 0 < y) (h : Real.log x ≤ z * Real.log y) : x ≤ y ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem lt_rpow_iff_log_lt (hx : 0 < x) (hy : 0 < y) : x < y ^ z ↔ Real.log x < z * Real.log y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem lt_rpow_of_log_lt (hx : 0 ≤ x) (hy : 0 < y) (h : Real.log x < z * Real.log y) : x < y ^ z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_le_one_iff_of_pos (hx : 0 < x) : x ^ y ≤ 1 ↔ 1 ≤ x ∧ y ≤ 0 ∨ x ≤ 1 ∧ 0 ≤ y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem abs_log_mul_self_rpow_lt (x t : ℝ) (h1 : 0 < x) (h2 : x ≤ 1) (ht : 0 < t) : |log x * x ^ t| < 1 / t :=", "area": "Analysis"} {"task": "t8", "statement": "lemma log_le_rpow_div {x ε : ℝ} (hx : 0 ≤ x) (hε : 0 < ε) : log x ≤ x ^ ε / ε :=", "area": "Analysis"} {"task": "t8", "statement": "lemma strictMono_rpow_of_base_gt_one {b : ℝ} (hb : 1 < b) : StrictMono (b ^ · : ℝ → ℝ) :=", "area": "Analysis"} {"task": "t8", "statement": "lemma monotone_rpow_of_base_ge_one {b : ℝ} (hb : 1 ≤ b) : Monotone (b ^ · : ℝ → ℝ) :=", "area": "Analysis"} {"task": "t8", "statement": "lemma strictAnti_rpow_of_base_lt_one {b : ℝ} (hb₀ : 0 < b) (hb₁ : b < 1) : StrictAnti (b ^ · : ℝ → ℝ) :=", "area": "Analysis"} {"task": "t8", "statement": "lemma antitone_rpow_of_base_le_one {b : ℝ} (hb₀ : 0 < b) (hb₁ : b ≤ 1) : Antitone (b ^ · : ℝ → ℝ) :=", "area": "Analysis"} {"task": "t8", "statement": "lemma norm_prime_cpow_le_one_half (p : Nat.Primes) {s : ℂ} (hs : 1 < s.re) : ‖(p : ℂ) ^ (-s)‖ ≤ 1 / 2 :=", "area": "Analysis"} {"task": "t8", "statement": "lemma one_sub_prime_cpow_ne_zero {p : ℕ} (hp : p.Prime) {s : ℂ} (hs : 1 < s.re) : 1 - (p : ℂ) ^ (-s) ≠ 0 :=", "area": "Analysis"} {"task": "t8", "statement": "lemma norm_natCast_cpow_le_norm_natCast_cpow_of_pos {n : ℕ} (hn : 0 < n) {w z : ℂ} (h : w.re ≤ z.re) : ‖(n : ℂ) ^ w‖ ≤ ‖(n : ℂ) ^ z‖ :=", "area": "Analysis"} {"task": "t8", "statement": "lemma norm_natCast_cpow_le_norm_natCast_cpow_iff {n : ℕ} (hn : 1 < n) {w z : ℂ} : ‖(n : ℂ) ^ w‖ ≤ ‖(n : ℂ) ^ z‖ ↔ w.re ≤ z.re :=", "area": "Analysis"} {"task": "t8", "statement": "lemma norm_log_natCast_le_rpow_div (n : ℕ) {ε : ℝ} (hε : 0 < ε) : ‖log n‖ ≤ n ^ ε / ε :=", "area": "Analysis"} {"task": "t8", "statement": "theorem sqrt_eq_rpow (x : ℝ) : √x = x ^ (1 / (2 : ℝ)) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem rpow_div_two_eq_sqrt {x : ℝ} (r : ℝ) (hx : 0 ≤ x) : x ^ (r / 2) = √x ^ r :=", "area": "Analysis"} {"task": "t8", "statement": "theorem exists_rat_pow_btwn_rat_aux (hn : n ≠ 0) (x y : ℝ) (h : x < y) (hy : 0 < y) : ∃ q : ℚ, 0 < q ∧ x < (q : ℝ) ^ n ∧ (q : ℝ) ^ n < y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem exists_rat_pow_btwn_rat (hn : n ≠ 0) {x y : ℚ} (h : x < y) (hy : 0 < y) : ∃ q : ℚ, 0 < q ∧ x < q ^ n ∧ q ^ n < y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem exists_rat_pow_btwn {α : Type*} [LinearOrderedField α] [Archimedean α] (hn : n ≠ 0) {x y : α} (h : x < y) (hy : 0 < y) : ∃ q : ℚ, 0 < q ∧ x < (q : α) ^ n ∧ (q : α) ^ n < y :=", "area": "Analysis"} {"task": "t8", "statement": "lemma cpow_inv_two_re (x : ℂ) : (x ^ (2⁻¹ : ℂ)).re = sqrt ((abs x + x.re) / 2) :=", "area": "Analysis"} {"task": "t8", "statement": "lemma cpow_inv_two_im_eq_sqrt {x : ℂ} (hx : 0 ≤ x.im) : (x ^ (2⁻¹ : ℂ)).im = sqrt ((abs x - x.re) / 2) :=", "area": "Analysis"} {"task": "t8", "statement": "lemma cpow_inv_two_im_eq_neg_sqrt {x : ℂ} (hx : x.im < 0) : (x ^ (2⁻¹ : ℂ)).im = -sqrt ((abs x - x.re) / 2) :=", "area": "Analysis"} {"task": "t8", "statement": "lemma abs_cpow_inv_two_im (x : ℂ) : |(x ^ (2⁻¹ : ℂ)).im| = sqrt ((abs x - x.re) / 2) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isNat_rpow_pos {a b : ℝ} {nb ne : ℕ} (pb : IsNat b nb) (pe' : IsNat (a ^ nb) ne) : IsNat (a ^ b) ne :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isNat_rpow_neg {a b : ℝ} {nb ne : ℕ} (pb : IsInt b (Int.negOfNat nb)) (pe' : IsNat (a ^ (Int.negOfNat nb)) ne) : IsNat (a ^ b) ne :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isInt_rpow_pos {a b : ℝ} {nb ne : ℕ} (pb : IsNat b nb) (pe' : IsInt (a ^ nb) (Int.negOfNat ne)) : IsInt (a ^ b) (Int.negOfNat ne) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isInt_rpow_neg {a b : ℝ} {nb ne : ℕ} (pb : IsInt b (Int.negOfNat nb)) (pe' : IsInt (a ^ (Int.negOfNat nb)) (Int.negOfNat ne)) : IsInt (a ^ b) (Int.negOfNat ne) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isRat_rpow_pos {a b : ℝ} {nb : ℕ} {num : ℤ} {den : ℕ} (pb : IsNat b nb) (pe' : IsRat (a ^ nb) num den) : IsRat (a ^ b) num den :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isRat_rpow_neg {a b : ℝ} {nb : ℕ} {num : ℤ} {den : ℕ} (pb : IsInt b (Int.negOfNat nb)) (pe' : IsRat (a ^ (Int.negOfNat nb)) num den) : IsRat (a ^ b) num den :=", "area": "Analysis"} {"task": "t8", "statement": "theorem log_re (x : ℂ) : x.log.re = x.abs.log :=", "area": "Analysis"} {"task": "t8", "statement": "theorem log_im (x : ℂ) : x.log.im = x.arg :=", "area": "Analysis"} {"task": "t8", "statement": "theorem neg_pi_lt_log_im (x : ℂ) : -π < (log x).im :=", "area": "Analysis"} {"task": "t8", "statement": "theorem log_im_le_pi (x : ℂ) : (log x).im ≤ π :=", "area": "Analysis"} {"task": "t8", "statement": "theorem exp_log {x : ℂ} (hx : x ≠ 0) : exp (log x) = x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem range_exp : Set.range exp = {0}ᶜ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem log_exp {x : ℂ} (hx₁ : -π < x.im) (hx₂ : x.im ≤ π) : log (exp x) = x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem exp_inj_of_neg_pi_lt_of_le_pi {x y : ℂ} (hx₁ : -π < x.im) (hx₂ : x.im ≤ π) (hy₁ : -π < y.im) (hy₂ : y.im ≤ π) (hxy : exp x = exp y) : x = y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem ofReal_log {x : ℝ} (hx : 0 ≤ x) : (x.log : ℂ) = log x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem log_ofReal_re (x : ℝ) : (log (x : ℂ)).re = Real.log x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem log_ofReal_mul {r : ℝ} (hr : 0 < r) {x : ℂ} (hx : x ≠ 0) : log (r * x) = Real.log r + log x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem log_mul_ofReal (r : ℝ) (hr : 0 < r) (x : ℂ) (hx : x ≠ 0) : log (x * r) = Real.log r + log x :=", "area": "Analysis"} {"task": "t8", "statement": "lemma log_mul_eq_add_log_iff {x y : ℂ} (hx₀ : x ≠ 0) (hy₀ : y ≠ 0) : log (x * y) = log x + log y ↔ arg x + arg y ∈ Set.Ioc (-π) π :=", "area": "Analysis"} {"task": "t8", "statement": "theorem log_zero : log 0 = 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem log_one : log 1 = 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem log_neg_one : log (-1) = π * I :=", "area": "Analysis"} {"task": "t8", "statement": "theorem log_I : log I = π / 2 * I :=", "area": "Analysis"} {"task": "t8", "statement": "theorem log_neg_I : log (-I) = -(π / 2) * I :=", "area": "Analysis"} {"task": "t8", "statement": "theorem log_conj_eq_ite (x : ℂ) : log (conj x) = if x.arg = π then log x else conj (log x) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem log_conj (x : ℂ) (h : x.arg ≠ π) : log (conj x) = conj (log x) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem log_inv_eq_ite (x : ℂ) : log x⁻¹ = if x.arg = π then -conj (log x) else -log x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem log_inv (x : ℂ) (hx : x.arg ≠ π) : log x⁻¹ = -log x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem two_pi_I_ne_zero : (2 * π * I : ℂ) ≠ 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem exp_eq_one_iff {x : ℂ} : exp x = 1 ↔ ∃ n : ℤ, x = n * (2 * π * I) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem exp_eq_exp_iff_exp_sub_eq_one {x y : ℂ} : exp x = exp y ↔ exp (x - y) = 1 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem exp_eq_exp_iff_exists_int {x y : ℂ} : exp x = exp y ↔ ∃ n : ℤ, x = y + n * (2 * π * I) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem countable_preimage_exp {s : Set ℂ} : (exp ⁻¹' s).Countable ↔ s.Countable :=", "area": "Analysis"} {"task": "t8", "statement": "theorem tendsto_log_nhdsWithin_im_neg_of_re_neg_of_im_zero {z : ℂ} (hre : z.re < 0) (him : z.im = 0) : Tendsto log (𝓝[{ z : ℂ | z.im < 0 }] z) (𝓝 <| Real.log (abs z) - π * I) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem continuousWithinAt_log_of_re_neg_of_im_zero {z : ℂ} (hre : z.re < 0) (him : z.im = 0) : ContinuousWithinAt log { z : ℂ | 0 ≤ z.im } z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem tendsto_log_nhdsWithin_im_nonneg_of_re_neg_of_im_zero {z : ℂ} (hre : z.re < 0) (him : z.im = 0) : Tendsto log (𝓝[{ z : ℂ | 0 ≤ z.im }] z) (𝓝 <| Real.log (abs z) + π * I) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem map_exp_comap_re_atBot : map exp (comap re atBot) = 𝓝[≠] 0 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem map_exp_comap_re_atTop : map exp (comap re atTop) = cobounded ℂ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem continuousAt_clog {x : ℂ} (h : x ∈ slitPlane) : ContinuousAt log x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem mem_iUnion : x ∈ π.iUnion ↔ ∃ J ∈ π, x ∈ J :=", "area": "Analysis"} {"task": "t8", "statement": "theorem tag_biUnionTagged (π : Prepartition I) {πi : ∀ J, TaggedPrepartition J} (hJ : J ∈ π) {J'} (hJ' : J' ∈ πi J) : (π.biUnionTagged πi).tag J' = (πi J).tag J' :=", "area": "Analysis"} {"task": "t8", "statement": "theorem forall_biUnionTagged (p : (ι → ℝ) → Box ι → Prop) (π : Prepartition I) (πi : ∀ J, TaggedPrepartition J) : (∀ J ∈ π.biUnionTagged πi, p ((π.biUnionTagged πi).tag J) J) ↔ ∀ J ∈ π, ∀ J' ∈ πi J, p ((πi J).tag J') J' :=", "area": "Analysis"} {"task": "t8", "statement": "theorem mem_infPrepartition_comm : J ∈ π₁.infPrepartition π₂.toPrepartition ↔ J ∈ π₂.infPrepartition π₁.toPrepartition :=", "area": "Analysis"} {"task": "t8", "statement": "theorem IsHenstock.card_filter_tag_eq_le [Fintype ι] (h : π.IsHenstock) (x : ι → ℝ) : (π.boxes.filter fun J => π.tag J = x).card ≤ 2 ^ Fintype.card ι :=", "area": "Analysis"} {"task": "t8", "statement": "theorem forall_mem_single (p : (ι → ℝ) → Box ι → Prop) (hJ : J ≤ I) (h : x ∈ Box.Icc I) : (∀ J' ∈ single I J hJ x h, p ((single I J hJ x h).tag J') J') ↔ p x J :=", "area": "Analysis"} {"task": "t8", "statement": "theorem IsSubordinate.disjUnion [Fintype ι] (h₁ : IsSubordinate π₁ r) (h₂ : IsSubordinate π₂ r) (h : Disjoint π₁.iUnion π₂.iUnion) : IsSubordinate (π₁.disjUnion π₂ h) r :=", "area": "Analysis"} {"task": "t8", "statement": "theorem IsHenstock.disjUnion (h₁ : IsHenstock π₁) (h₂ : IsHenstock π₂) (h : Disjoint π₁.iUnion π₂.iUnion) : IsHenstock (π₁.disjUnion π₂ h) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem linear_eq_linearIsometry : f.linear = f.linearIsometry.toLinearMap :=", "area": "Analysis"} {"task": "t8", "statement": "theorem coe_toAffineMap : ⇑f.toAffineMap = f :=", "area": "Analysis"} {"task": "t8", "statement": "theorem toAffineMap_injective : Injective (toAffineMap : (P →ᵃⁱ[𝕜] P₂) → P →ᵃ[𝕜] P₂) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem toAffineIsometry_linearIsometry : f.toAffineIsometry.linearIsometry = f :=", "area": "Analysis"} {"task": "t8", "statement": "theorem dist_map (x y : P) : dist (f x) (f y) = dist x y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem nndist_map (x y : P) : nndist (f x) (f y) = nndist x y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem edist_map (x y : P) : edist (f x) (f y) = edist x y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem linear_eq_linear_isometry : e.linear = e.linearIsometryEquiv.toLinearEquiv :=", "area": "Analysis"} {"task": "t8", "statement": "theorem linearIsometryEquiv_mk' (e : P₁ → P₂) (e' : V₁ ≃ₗᵢ[𝕜] V₂) (p h) : (mk' e e' p h).linearIsometryEquiv = e' :=", "area": "Analysis"} {"task": "t8", "statement": "theorem coe_toAffineIsometryEquiv : ⇑(e.toAffineIsometryEquiv : V ≃ᵃⁱ[𝕜] V₂) = e :=", "area": "Analysis"} {"task": "t8", "statement": "theorem toAffineIsometryEquiv_linearIsometryEquiv : e.toAffineIsometryEquiv.linearIsometryEquiv = e :=", "area": "Analysis"} {"task": "t8", "statement": "theorem range_eq_univ (e : P ≃ᵃⁱ[𝕜] P₂) : Set.range e = Set.univ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem symm_constVSub (p : P) : (constVSub 𝕜 p).symm = (LinearIsometryEquiv.neg 𝕜).toAffineIsometryEquiv.trans (vaddConst 𝕜 p) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem vadd_vsub {f : P → P₂} (hf : Isometry f) {p : P} {g : V → V₂} (hg : ∀ v, g v = f (v +ᵥ p) -ᵥ f p) : Isometry g :=", "area": "Analysis"} {"task": "t8", "statement": "theorem dist_pointReflection_fixed (x y : P) : dist (pointReflection 𝕜 x y) x = dist y x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem dist_pointReflection_self' (x y : P) : dist (pointReflection 𝕜 x y) y = ‖bit0 (x -ᵥ y)‖ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem dist_pointReflection_self (x y : P) : dist (pointReflection 𝕜 x y) y = ‖(2 : 𝕜)‖ * dist x y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem dist_pointReflection_self_real (x y : P) : dist (pointReflection ℝ x y) y = 2 * dist x y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem AffineMap.continuous_linear_iff {f : P →ᵃ[𝕜] P₂} : Continuous f.linear ↔ Continuous f :=", "area": "Analysis"} {"task": "t8", "statement": "theorem AffineMap.isOpenMap_linear_iff {f : P →ᵃ[𝕜] P₂} : IsOpenMap f.linear ↔ IsOpenMap f :=", "area": "Analysis"} {"task": "t8", "statement": "theorem dual_norm_topology_le_weak_dual_topology : (UniformSpace.toTopologicalSpace : TopologicalSpace (Dual 𝕜 E)) ≤ (WeakDual.instTopologicalSpace : TopologicalSpace (WeakDual 𝕜 E)) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isClosed_polar (s : Set E) : IsClosed (polar 𝕜 s) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem riesz_lemma {F : Subspace 𝕜 E} (hFc : IsClosed (F : Set E)) (hF : ∃ x : E, x ∉ F) {r : ℝ} (hr : r < 1) : ∃ x₀ : E, x₀ ∉ F ∧ ∀ y ∈ F, r * ‖x₀‖ ≤ ‖x₀ - y‖ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem riesz_lemma_of_norm_lt {c : 𝕜} (hc : 1 < ‖c‖) {R : ℝ} (hR : ‖c‖ < R) {F : Subspace 𝕜 E} (hFc : IsClosed (F : Set E)) (hF : ∃ x : E, x ∉ F) : ∃ x₀ : E, ‖x₀‖ ≤ R ∧ ∀ y ∈ F, 1 ≤ ‖x₀ - y‖ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Metric.closedBall_infDist_compl_subset_closure {x : F} {s : Set F} (hx : x ∈ s) : closedBall x (infDist x sᶜ) ⊆ closure s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem tendstoUniformlyOn_tsum {f : α → β → F} (hu : Summable u) {s : Set β} (hfu : ∀ n x, x ∈ s → ‖f n x‖ ≤ u n) : TendstoUniformlyOn (fun t : Finset α => fun x => ∑ n ∈ t, f n x) (fun x => ∑' n, f n x) atTop s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem tendstoUniformly_tsum {f : α → β → F} (hu : Summable u) (hfu : ∀ n x, ‖f n x‖ ≤ u n) : TendstoUniformly (fun t : Finset α => fun x => ∑ n ∈ t, f n x) (fun x => ∑' n, f n x) atTop :=", "area": "Analysis"} {"task": "t8", "statement": "theorem continuousOn_tsum [TopologicalSpace β] {f : α → β → F} {s : Set β} (hf : ∀ i, ContinuousOn (f i) s) (hu : Summable u) (hfu : ∀ n x, x ∈ s → ‖f n x‖ ≤ u n) : ContinuousOn (fun x => ∑' n, f n x) s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem continuous_tsum [TopologicalSpace β] {f : α → β → F} (hf : ∀ i, Continuous (f i)) (hu : Summable u) (hfu : ∀ n x, ‖f n x‖ ≤ u n) : Continuous fun x => ∑' n, f n x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem AffineBasis.interior_convexHull {ι E : Type*} [Finite ι] [NormedAddCommGroup E] [NormedSpace ℝ E] (b : AffineBasis ι ℝ E) : interior (convexHull ℝ (range b)) = {x | ∀ i, 0 < b.coord i x} :=", "area": "Analysis"} {"task": "t8", "statement": "theorem IsOpen.exists_between_affineIndependent_span_eq_top {s u : Set P} (hu : IsOpen u) (hsu : s ⊆ u) (hne : s.Nonempty) (h : AffineIndependent ℝ ((↑) : s → P)) : ∃ t : Set P, s ⊆ t ∧ t ⊆ u ∧ AffineIndependent ℝ ((↑) : t → P) ∧ affineSpan ℝ t = ⊤ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem IsOpen.exists_subset_affineIndependent_span_eq_top {u : Set P} (hu : IsOpen u) (hne : u.Nonempty) : ∃ s ⊆ u, AffineIndependent ℝ ((↑) : s → P) ∧ affineSpan ℝ s = ⊤ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem AffineBasis.centroid_mem_interior_convexHull {ι} [Fintype ι] (b : AffineBasis ι ℝ V) : Finset.univ.centroid ℝ b ∈ interior (convexHull ℝ (range b)) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem interior_convexHull_nonempty_iff_affineSpan_eq_top [FiniteDimensional ℝ V] {s : Set V} : (interior (convexHull ℝ s)).Nonempty ↔ affineSpan ℝ s = ⊤ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Convex.interior_nonempty_iff_affineSpan_eq_top [FiniteDimensional ℝ V] {s : Set V} (hs : Convex ℝ s) : (interior s).Nonempty ↔ affineSpan ℝ s = ⊤ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem norm_indicator_le_of_subset (h : s ⊆ t) (f : α → E) (a : α) : ‖indicator s f a‖ ≤ ‖indicator t f a‖ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem norm_indicator_le_norm_self : ‖indicator s f a‖ ≤ ‖f a‖ :=", "area": "Analysis"} {"task": "t8", "statement": "lemma absorbs_iff_norm : Absorbs 𝕜 A B ↔ ∃ r, ∀ c : 𝕜, r ≤ ‖c‖ → B ⊆ c • A :=", "area": "Analysis"} {"task": "t8", "statement": "theorem balanced_iff_closedBall_smul : Balanced 𝕜 s ↔ Metric.closedBall (0 : 𝕜) 1 • s ⊆ s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem balanced_empty : Balanced 𝕜 (∅ : Set E) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Balanced.neg_mem_iff [NormOneClass 𝕜] (h : Balanced 𝕜 s) {x : E} : -x ∈ s ↔ x ∈ s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Balanced.sub (hs : Balanced 𝕜 s) (ht : Balanced 𝕜 t) : Balanced 𝕜 (s - t) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem absorbs_iff_eventually_nhdsWithin_zero : Absorbs 𝕜 s t ↔ ∀ᶠ c : 𝕜 in 𝓝[≠] 0, MapsTo (c • ·) t s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem absorbent_iff_eventually_nhdsWithin_zero : Absorbent 𝕜 s ↔ ∀ x : E, ∀ᶠ c : 𝕜 in 𝓝[≠] 0, c • x ∈ s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem absorbs_iff_eventually_nhds_zero (h₀ : 0 ∈ s) : Absorbs 𝕜 s t ↔ ∀ᶠ c : 𝕜 in 𝓝 0, MapsTo (c • ·) t s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Balanced.smul_mono (hs : Balanced 𝕝 s) {a : 𝕝} {b : 𝕜} (h : ‖a‖ ≤ ‖b‖) : a • s ⊆ b • s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Balanced.smul_mem_mono [SMulCommClass 𝕝 𝕜 E] (hs : Balanced 𝕝 s) {a : 𝕜} {b : 𝕝} (ha : a • x ∈ s) (hba : ‖b‖ ≤ ‖a‖) : b • x ∈ s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Balanced.subset_smul (hA : Balanced 𝕜 A) (ha : 1 ≤ ‖a‖) : A ⊆ a • A :=", "area": "Analysis"} {"task": "t8", "statement": "theorem absorbent_nhds_zero (hA : A ∈ 𝓝 (0 : E)) : Absorbent 𝕜 A :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Balanced.zero_insert_interior (hA : Balanced 𝕜 A) : Balanced 𝕜 (insert 0 (interior A)) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Balanced.interior (hA : Balanced 𝕜 A) (h : (0 : E) ∈ interior A) : Balanced 𝕜 (interior A) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Balanced.convexHull (hs : Balanced 𝕜 s) : Balanced 𝕜 (convexHull ℝ s) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem balanced_iff_neg_mem (hs : Convex ℝ s) : Balanced ℝ s ↔ ∀ ⦃x⦄, x ∈ s → -x ∈ s :=", "area": "Analysis"} {"task": "t8", "statement": "theorem summable_of_summable_hasFDerivAt_of_isPreconnected (hu : Summable u) (hs : IsOpen s) (h's : IsPreconnected s) (hf : ∀ n x, x ∈ s → HasFDerivAt (f n) (f' n x) x) (hf' : ∀ n x, x ∈ s → ‖f' n x‖ ≤ u n) (hx₀ : x₀ ∈ s) (hf0 : Summable (f · x₀)) (hx : x ∈ s) : Summable fun n => f n x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem summable_of_summable_hasDerivAt_of_isPreconnected (hu : Summable u) (ht : IsOpen t) (h't : IsPreconnected t) (hg : ∀ n y, y ∈ t → HasDerivAt (g n) (g' n y) y) (hg' : ∀ n y, y ∈ t → ‖g' n y‖ ≤ u n) (hy₀ : y₀ ∈ t) (hg0 : Summable (g · y₀)) (hy : y ∈ t) : Summable fun n => g n y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem hasFDerivAt_tsum_of_isPreconnected (hu : Summable u) (hs : IsOpen s) (h's : IsPreconnected s) (hf : ∀ n x, x ∈ s → HasFDerivAt (f n) (f' n x) x) (hf' : ∀ n x, x ∈ s → ‖f' n x‖ ≤ u n) (hx₀ : x₀ ∈ s) (hf0 : Summable fun n => f n x₀) (hx : x ∈ s) : HasFDerivAt (fun y => ∑' n, f n y) (∑' n, f' n x) x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem hasDerivAt_tsum_of_isPreconnected (hu : Summable u) (ht : IsOpen t) (h't : IsPreconnected t) (hg : ∀ n y, y ∈ t → HasDerivAt (g n) (g' n y) y) (hg' : ∀ n y, y ∈ t → ‖g' n y‖ ≤ u n) (hy₀ : y₀ ∈ t) (hg0 : Summable fun n => g n y₀) (hy : y ∈ t) : HasDerivAt (fun z => ∑' n, g n z) (∑' n, g' n y) y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem summable_of_summable_hasFDerivAt (hu : Summable u) (hf : ∀ n x, HasFDerivAt (f n) (f' n x) x) (hf' : ∀ n x, ‖f' n x‖ ≤ u n) (hf0 : Summable fun n => f n x₀) (x : E) : Summable fun n => f n x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem summable_of_summable_hasDerivAt (hu : Summable u) (hg : ∀ n y, HasDerivAt (g n) (g' n y) y) (hg' : ∀ n y, ‖g' n y‖ ≤ u n) (hg0 : Summable fun n => g n y₀) (y : 𝕜) : Summable fun n => g n y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem hasFDerivAt_tsum (hu : Summable u) (hf : ∀ n x, HasFDerivAt (f n) (f' n x) x) (hf' : ∀ n x, ‖f' n x‖ ≤ u n) (hf0 : Summable fun n => f n x₀) (x : E) : HasFDerivAt (fun y => ∑' n, f n y) (∑' n, f' n x) x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem hasDerivAt_tsum (hu : Summable u) (hg : ∀ n y, HasDerivAt (g n) (g' n y) y) (hg' : ∀ n y, ‖g' n y‖ ≤ u n) (hg0 : Summable fun n => g n y₀) (y : 𝕜) : HasDerivAt (fun z => ∑' n, g n z) (∑' n, g' n y) y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem differentiable_tsum (hu : Summable u) (hf : ∀ n x, HasFDerivAt (f n) (f' n x) x) (hf' : ∀ n x, ‖f' n x‖ ≤ u n) : Differentiable 𝕜 fun y => ∑' n, f n y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem differentiable_tsum' (hu : Summable u) (hg : ∀ n y, HasDerivAt (g n) (g' n y) y) (hg' : ∀ n y, ‖g' n y‖ ≤ u n) : Differentiable 𝕜 fun z => ∑' n, g n z :=", "area": "Analysis"} {"task": "t8", "statement": "theorem fderiv_tsum (hu : Summable u) (hf : ∀ n, Differentiable 𝕜 (f n)) (hf' : ∀ n x, ‖fderiv 𝕜 (f n) x‖ ≤ u n) (hf0 : Summable fun n => f n x₀) : (fderiv 𝕜 fun y => ∑' n, f n y) = fun x => ∑' n, fderiv 𝕜 (f n) x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem deriv_tsum (hu : Summable u) (hg : ∀ n, Differentiable 𝕜 (g n)) (hg' : ∀ n y, ‖deriv (g n) y‖ ≤ u n) (hg0 : Summable fun n => g n y₀) : (deriv fun y => ∑' n, g n y) = fun y => ∑' n, deriv (g n) y :=", "area": "Analysis"} {"task": "t8", "statement": "theorem iteratedFDeriv_tsum (hf : ∀ i, ContDiff 𝕜 N (f i)) (hv : ∀ k : ℕ, (k : ℕ∞) ≤ N → Summable (v k)) (h'f : ∀ (k : ℕ) (i : α) (x : E), (k : ℕ∞) ≤ N → ‖iteratedFDeriv 𝕜 k (f i) x‖ ≤ v k i) {k : ℕ} (hk : (k : ℕ∞) ≤ N) : (iteratedFDeriv 𝕜 k fun y => ∑' n, f n y) = fun x => ∑' n, iteratedFDeriv 𝕜 k (f n) x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem iteratedFDeriv_tsum_apply (hf : ∀ i, ContDiff 𝕜 N (f i)) (hv : ∀ k : ℕ, (k : ℕ∞) ≤ N → Summable (v k)) (h'f : ∀ (k : ℕ) (i : α) (x : E), (k : ℕ∞) ≤ N → ‖iteratedFDeriv 𝕜 k (f i) x‖ ≤ v k i) {k : ℕ} (hk : (k : ℕ∞) ≤ N) (x : E) : iteratedFDeriv 𝕜 k (fun y => ∑' n, f n y) x = ∑' n, iteratedFDeriv 𝕜 k (f n) x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem contDiff_tsum (hf : ∀ i, ContDiff 𝕜 N (f i)) (hv : ∀ k : ℕ, (k : ℕ∞) ≤ N → Summable (v k)) (h'f : ∀ (k : ℕ) (i : α) (x : E), (k : ℕ∞) ≤ N → ‖iteratedFDeriv 𝕜 k (f i) x‖ ≤ v k i) : ContDiff 𝕜 N fun x => ∑' i, f i x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem contDiff_tsum_of_eventually (hf : ∀ i, ContDiff 𝕜 N (f i)) (hv : ∀ k : ℕ, (k : ℕ∞) ≤ N → Summable (v k)) (h'f : ∀ k : ℕ, (k : ℕ∞) ≤ N → ∀ᶠ i in (Filter.cofinite : Filter α), ∀ x : E, ‖iteratedFDeriv 𝕜 k (f i) x‖ ≤ v k i) : ContDiff 𝕜 N fun x => ∑' i, f i x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem continuousOn_ball [NormedSpace ℝ E] {x : E} {r : ℝ} (h : DiffContOnCl 𝕜 f (ball x r)) : ContinuousOn f (closedBall x r) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem hasFDerivAt_integral_of_dominated_loc_of_lip {F : H → ℝ → E} {F' : ℝ → H →L[𝕜] E} {x₀ : H} (ε_pos : 0 < ε) (hF_meas : ∀ᶠ x in 𝓝 x₀, AEStronglyMeasurable (F x) (μ.restrict (Ι a b))) (hF_int : IntervalIntegrable (F x₀) μ a b) (hF'_meas : AEStronglyMeasurable F' (μ.restrict (Ι a b))) (h_lip : ∀ᵐ t ∂μ, t ∈ Ι a b → LipschitzOnWith (Real.nnabs <| bound t) (fun x => F x t) (ball x₀ ε)) (bound_integrable : IntervalIntegrable bound μ a b) (h_diff : ∀ᵐ t ∂μ, t ∈ Ι a b → HasFDerivAt (fun x => F x t) (F' t) x₀) : IntervalIntegrable F' μ a b ∧ HasFDerivAt (fun x => ∫ t in a..b, F x t ∂μ) (∫ t in a..b, F' t ∂μ) x₀ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem hasFDerivAt_integral_of_dominated_of_fderiv_le {F : H → ℝ → E} {F' : H → ℝ → H →L[𝕜] E} {x₀ : H} (ε_pos : 0 < ε) (hF_meas : ∀ᶠ x in 𝓝 x₀, AEStronglyMeasurable (F x) (μ.restrict (Ι a b))) (hF_int : IntervalIntegrable (F x₀) μ a b) (hF'_meas : AEStronglyMeasurable (F' x₀) (μ.restrict (Ι a b))) (h_bound : ∀ᵐ t ∂μ, t ∈ Ι a b → ∀ x ∈ ball x₀ ε, ‖F' x t‖ ≤ bound t) (bound_integrable : IntervalIntegrable bound μ a b) (h_diff : ∀ᵐ t ∂μ, t ∈ Ι a b → ∀ x ∈ ball x₀ ε, HasFDerivAt (fun x => F x t) (F' x t) x) : HasFDerivAt (fun x => ∫ t in a..b, F x t ∂μ) (∫ t in a..b, F' x₀ t ∂μ) x₀ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem hasDerivAt_integral_of_dominated_loc_of_lip {F : 𝕜 → ℝ → E} {F' : ℝ → E} {x₀ : 𝕜} (ε_pos : 0 < ε) (hF_meas : ∀ᶠ x in 𝓝 x₀, AEStronglyMeasurable (F x) (μ.restrict (Ι a b))) (hF_int : IntervalIntegrable (F x₀) μ a b) (hF'_meas : AEStronglyMeasurable F' (μ.restrict (Ι a b))) (h_lipsch : ∀ᵐ t ∂μ, t ∈ Ι a b → LipschitzOnWith (Real.nnabs <| bound t) (fun x => F x t) (ball x₀ ε)) (bound_integrable : IntervalIntegrable (bound : ℝ → ℝ) μ a b) (h_diff : ∀ᵐ t ∂μ, t ∈ Ι a b → HasDerivAt (fun x => F x t) (F' t) x₀) : IntervalIntegrable F' μ a b ∧ HasDerivAt (fun x => ∫ t in a..b, F x t ∂μ) (∫ t in a..b, F' t ∂μ) x₀ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem hasDerivAt_integral_of_dominated_loc_of_deriv_le {F : 𝕜 → ℝ → E} {F' : 𝕜 → ℝ → E} {x₀ : 𝕜} (ε_pos : 0 < ε) (hF_meas : ∀ᶠ x in 𝓝 x₀, AEStronglyMeasurable (F x) (μ.restrict (Ι a b))) (hF_int : IntervalIntegrable (F x₀) μ a b) (hF'_meas : AEStronglyMeasurable (F' x₀) (μ.restrict (Ι a b))) (h_bound : ∀ᵐ t ∂μ, t ∈ Ι a b → ∀ x ∈ ball x₀ ε, ‖F' x t‖ ≤ bound t) (bound_integrable : IntervalIntegrable bound μ a b) (h_diff : ∀ᵐ t ∂μ, t ∈ Ι a b → ∀ x ∈ ball x₀ ε, HasDerivAt (fun x => F x t) (F' x t) x) : IntervalIntegrable (F' x₀) μ a b ∧ HasDerivAt (fun x => ∫ t in a..b, F x t ∂μ) (∫ t in a..b, F' x₀ t ∂μ) x₀ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem IsBoundedBilinearMap.hasStrictFDerivAt (h : IsBoundedBilinearMap 𝕜 b) (p : E × F) : HasStrictFDerivAt b (h.deriv p) p :=", "area": "Analysis"} {"task": "t8", "statement": "theorem IsBoundedBilinearMap.fderivWithin (h : IsBoundedBilinearMap 𝕜 b) (p : E × F) (hxs : UniqueDiffWithinAt 𝕜 u p) : fderivWithin 𝕜 b u p = h.deriv p :=", "area": "Analysis"} {"task": "t8", "statement": "theorem HasFDerivAtFilter.comp {g : F → G} {g' : F →L[𝕜] G} {L' : Filter F} (hg : HasFDerivAtFilter g g' (f x) L') (hf : HasFDerivAtFilter f f' x L) (hL : Tendsto f L L') : HasFDerivAtFilter (g ∘ f) (g'.comp f') x L :=", "area": "Analysis"} {"task": "t8", "statement": "theorem fderivWithin_fderivWithin {g : F → G} {f : E → F} {x : E} {y : F} {s : Set E} {t : Set F} (hg : DifferentiableWithinAt 𝕜 g t y) (hf : DifferentiableWithinAt 𝕜 f s x) (h : MapsTo f s t) (hxs : UniqueDiffWithinAt 𝕜 s x) (hy : f x = y) (v : E) : fderivWithin 𝕜 g t y (fderivWithin 𝕜 f s x v) = fderivWithin 𝕜 (g ∘ f) s x v :=", "area": "Analysis"} {"task": "t8", "statement": "theorem fderivWithin.comp₃ {g' : G → G'} {g : F → G} {t : Set F} {u : Set G} {y : F} {y' : G} (hg' : DifferentiableWithinAt 𝕜 g' u y') (hg : DifferentiableWithinAt 𝕜 g t y) (hf : DifferentiableWithinAt 𝕜 f s x) (h2g : MapsTo g t u) (h2f : MapsTo f s t) (h3g : g y = y') (h3f : f x = y) (hxs : UniqueDiffWithinAt 𝕜 s x) : fderivWithin 𝕜 (g' ∘ g ∘ f) s x = (fderivWithin 𝕜 g' u y').comp ((fderivWithin 𝕜 g t y).comp (fderivWithin 𝕜 f s x)) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem HasStrictFDerivAt.comp {g : F → G} {g' : F →L[𝕜] G} (hg : HasStrictFDerivAt g g' (f x)) (hf : HasStrictFDerivAt f f' x) : HasStrictFDerivAt (fun x => g (f x)) (g'.comp f') x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem HasFDerivAtFilter.iterate {f : E → E} {f' : E →L[𝕜] E} (hf : HasFDerivAtFilter f f' x L) (hL : Tendsto f L L) (hx : f x = x) (n : ℕ) : HasFDerivAtFilter f^[n] (f' ^ n) x L :=", "area": "Analysis"} {"task": "t8", "statement": "theorem HasFDerivAt.iterate {f : E → E} {f' : E →L[𝕜] E} (hf : HasFDerivAt f f' x) (hx : f x = x) (n : ℕ) : HasFDerivAt f^[n] (f' ^ n) x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem HasFDerivWithinAt.iterate {f : E → E} {f' : E →L[𝕜] E} (hf : HasFDerivWithinAt f f' s x) (hx : f x = x) (hs : MapsTo f s s) (n : ℕ) : HasFDerivWithinAt f^[n] (f' ^ n) s x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem HasStrictFDerivAt.iterate {f : E → E} {f' : E →L[𝕜] E} (hf : HasStrictFDerivAt f f' x) (hx : f x = x) (n : ℕ) : HasStrictFDerivAt f^[n] (f' ^ n) x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isOpen_A (L : E →L[𝕜] F) (r ε : ℝ) : IsOpen (A f L r ε) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isOpen_B {K : Set (E →L[𝕜] F)} {r s ε : ℝ} : IsOpen (B f K r s ε) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem A_mono (L : E →L[𝕜] F) (r : ℝ) {ε δ : ℝ} (h : ε ≤ δ) : A f L r ε ⊆ A f L r δ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem le_of_mem_A {r ε : ℝ} {L : E →L[𝕜] F} {x : E} (hx : x ∈ A f L r ε) {y z : E} (hy : y ∈ closedBall x (r / 2)) (hz : z ∈ closedBall x (r / 2)) : ‖f z - f y - L (z - y)‖ ≤ ε * r :=", "area": "Analysis"} {"task": "t8", "statement": "theorem mem_A_of_differentiable {ε : ℝ} (hε : 0 < ε) {x : E} (hx : DifferentiableAt 𝕜 f x) : ∃ R > 0, ∀ r ∈ Ioo (0 : ℝ) R, x ∈ A f (fderiv 𝕜 f x) r ε :=", "area": "Analysis"} {"task": "t8", "statement": "theorem norm_sub_le_of_mem_A {c : 𝕜} (hc : 1 < ‖c‖) {r ε : ℝ} (hε : 0 < ε) (hr : 0 < r) {x : E} {L₁ L₂ : E →L[𝕜] F} (h₁ : x ∈ A f L₁ r ε) (h₂ : x ∈ A f L₂ r ε) : ‖L₁ - L₂‖ ≤ 4 * ‖c‖ * ε :=", "area": "Analysis"} {"task": "t8", "statement": "theorem differentiable_set_subset_D : { x | DifferentiableAt 𝕜 f x ∧ fderiv 𝕜 f x ∈ K } ⊆ D f K :=", "area": "Analysis"} {"task": "t8", "statement": "theorem D_subset_differentiable_set {K : Set (E →L[𝕜] F)} (hK : IsComplete K) : D f K ⊆ { x | DifferentiableAt 𝕜 f x ∧ fderiv 𝕜 f x ∈ K } :=", "area": "Analysis"} {"task": "t8", "statement": "theorem measurableSet_of_differentiableAt_of_isComplete {K : Set (E →L[𝕜] F)} (hK : IsComplete K) : MeasurableSet { x | DifferentiableAt 𝕜 f x ∧ fderiv 𝕜 f x ∈ K } :=", "area": "Analysis"} {"task": "t8", "statement": "theorem measurableSet_of_differentiableAt : MeasurableSet { x | DifferentiableAt 𝕜 f x } :=", "area": "Analysis"} {"task": "t8", "statement": "theorem measurable_fderiv : Measurable (fderiv 𝕜 f) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem measurable_deriv [MeasurableSpace 𝕜] [OpensMeasurableSpace 𝕜] [MeasurableSpace F] [BorelSpace F] (f : 𝕜 → F) : Measurable (deriv f) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem stronglyMeasurable_deriv [MeasurableSpace 𝕜] [OpensMeasurableSpace 𝕜] [h : SecondCountableTopologyEither 𝕜 F] (f : 𝕜 → F) : StronglyMeasurable (deriv f) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem A_mem_nhdsWithin_Ioi {L : F} {r ε x : ℝ} (hx : x ∈ A f L r ε) : A f L r ε ∈ 𝓝[>] x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem B_mem_nhdsWithin_Ioi {K : Set F} {r s ε x : ℝ} (hx : x ∈ B f K r s ε) : B f K r s ε ∈ 𝓝[>] x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem A_mono (L : F) (r : ℝ) {ε δ : ℝ} (h : ε ≤ δ) : A f L r ε ⊆ A f L r δ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem le_of_mem_A {r ε : ℝ} {L : F} {x : ℝ} (hx : x ∈ A f L r ε) {y z : ℝ} (hy : y ∈ Icc x (x + r / 2)) (hz : z ∈ Icc x (x + r / 2)) : ‖f z - f y - (z - y) • L‖ ≤ ε * r :=", "area": "Analysis"} {"task": "t8", "statement": "theorem mem_A_of_differentiable {ε : ℝ} (hε : 0 < ε) {x : ℝ} (hx : DifferentiableWithinAt ℝ f (Ici x) x) : ∃ R > 0, ∀ r ∈ Ioo (0 : ℝ) R, x ∈ A f (derivWithin f (Ici x) x) r ε :=", "area": "Analysis"} {"task": "t8", "statement": "theorem norm_sub_le_of_mem_A {r x : ℝ} (hr : 0 < r) (ε : ℝ) {L₁ L₂ : F} (h₁ : x ∈ A f L₁ r ε) (h₂ : x ∈ A f L₂ r ε) : ‖L₁ - L₂‖ ≤ 4 * ε :=", "area": "Analysis"} {"task": "t8", "statement": "theorem differentiable_set_subset_D : { x | DifferentiableWithinAt ℝ f (Ici x) x ∧ derivWithin f (Ici x) x ∈ K } ⊆ D f K :=", "area": "Analysis"} {"task": "t8", "statement": "theorem D_subset_differentiable_set {K : Set F} (hK : IsComplete K) : D f K ⊆ { x | DifferentiableWithinAt ℝ f (Ici x) x ∧ derivWithin f (Ici x) x ∈ K } :=", "area": "Analysis"} {"task": "t8", "statement": "theorem measurableSet_of_differentiableWithinAt_Ici_of_isComplete {K : Set F} (hK : IsComplete K) : MeasurableSet { x | DifferentiableWithinAt ℝ f (Ici x) x ∧ derivWithin f (Ici x) x ∈ K } :=", "area": "Analysis"} {"task": "t8", "statement": "theorem measurableSet_of_differentiableWithinAt_Ici : MeasurableSet { x | DifferentiableWithinAt ℝ f (Ici x) x } :=", "area": "Analysis"} {"task": "t8", "statement": "theorem measurable_derivWithin_Ici [MeasurableSpace F] [BorelSpace F] : Measurable fun x => derivWithin f (Ici x) x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem stronglyMeasurable_derivWithin_Ici : StronglyMeasurable (fun x ↦ derivWithin f (Ici x) x) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem measurableSet_of_differentiableWithinAt_Ioi : MeasurableSet { x | DifferentiableWithinAt ℝ f (Ioi x) x } :=", "area": "Analysis"} {"task": "t8", "statement": "theorem measurable_derivWithin_Ioi [MeasurableSpace F] [BorelSpace F] : Measurable fun x => derivWithin f (Ioi x) x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem stronglyMeasurable_derivWithin_Ioi : StronglyMeasurable (fun x ↦ derivWithin f (Ioi x) x) :=", "area": "Analysis"} {"task": "t8", "statement": "lemma isOpen_A_with_param {r s : ℝ} (hf : Continuous f.uncurry) (L : E →L[𝕜] F) : IsOpen {p : α × E | p.2 ∈ A (f p.1) L r s} :=", "area": "Analysis"} {"task": "t8", "statement": "lemma isOpen_B_with_param {r s t : ℝ} (hf : Continuous f.uncurry) (K : Set (E →L[𝕜] F)) : IsOpen {p : α × E | p.2 ∈ B (f p.1) K r s t} :=", "area": "Analysis"} {"task": "t8", "statement": "theorem measurableSet_of_differentiableAt_of_isComplete_with_param (hf : Continuous f.uncurry) {K : Set (E →L[𝕜] F)} (hK : IsComplete K) : MeasurableSet {p : α × E | DifferentiableAt 𝕜 (f p.1) p.2 ∧ fderiv 𝕜 (f p.1) p.2 ∈ K} :=", "area": "Analysis"} {"task": "t8", "statement": "theorem measurableSet_of_differentiableAt_with_param (hf : Continuous f.uncurry) : MeasurableSet {p : α × E | DifferentiableAt 𝕜 (f p.1) p.2} :=", "area": "Analysis"} {"task": "t8", "statement": "theorem measurable_fderiv_with_param (hf : Continuous f.uncurry) : Measurable (fun (p : α × E) ↦ fderiv 𝕜 (f p.1) p.2) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem measurable_deriv_with_param [LocallyCompactSpace 𝕜] [MeasurableSpace 𝕜] [OpensMeasurableSpace 𝕜] [MeasurableSpace F] [BorelSpace F] {f : α → 𝕜 → F} (hf : Continuous f.uncurry) : Measurable (fun (p : α × 𝕜) ↦ deriv (f p.1) p.2) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem stronglyMeasurable_deriv_with_param [LocallyCompactSpace 𝕜] [MeasurableSpace 𝕜] [OpensMeasurableSpace 𝕜] [h : SecondCountableTopologyEither α F] {f : α → 𝕜 → F} (hf : Continuous f.uncurry) : StronglyMeasurable (fun (p : α × 𝕜) ↦ deriv (f p.1) p.2) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem HasDerivAtFilter.add (hf : HasDerivAtFilter f f' x L) (hg : HasDerivAtFilter g g' x L) : HasDerivAtFilter (fun y => f y + g y) (f' + g') x L :=", "area": "Analysis"} {"task": "t8", "statement": "theorem HasStrictDerivAt.add (hf : HasStrictDerivAt f f' x) (hg : HasStrictDerivAt g g' x) : HasStrictDerivAt (fun y => f y + g y) (f' + g') x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem derivWithin_add_const (hxs : UniqueDiffWithinAt 𝕜 s x) (c : F) : derivWithin (fun y => f y + c) s x = derivWithin f s x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem deriv_add_const (c : F) : deriv (fun y => f y + c) x = deriv f x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem derivWithin_const_add (hxs : UniqueDiffWithinAt 𝕜 s x) (c : F) : derivWithin (fun y => c + f y) s x = derivWithin f s x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem deriv_const_add (c : F) : deriv (fun y => c + f y) x = deriv f x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem HasDerivAtFilter.sum (h : ∀ i ∈ u, HasDerivAtFilter (A i) (A' i) x L) : HasDerivAtFilter (fun y => ∑ i ∈ u, A i y) (∑ i ∈ u, A' i) x L :=", "area": "Analysis"} {"task": "t8", "statement": "theorem HasStrictDerivAt.sum (h : ∀ i ∈ u, HasStrictDerivAt (A i) (A' i) x) : HasStrictDerivAt (fun y => ∑ i ∈ u, A i y) (∑ i ∈ u, A' i) x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem HasDerivAtFilter.neg (h : HasDerivAtFilter f f' x L) : HasDerivAtFilter (fun x => -f x) (-f') x L :=", "area": "Analysis"} {"task": "t8", "statement": "theorem HasStrictDerivAt.neg (h : HasStrictDerivAt f f' x) : HasStrictDerivAt (fun x => -f x) (-f') x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem derivWithin.neg (hxs : UniqueDiffWithinAt 𝕜 s x) : derivWithin (fun y => -f y) s x = -derivWithin f s x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem deriv.neg : deriv (fun y => -f y) x = -deriv f x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem not_differentiableAt_abs_zero : ¬ DifferentiableAt ℝ (abs : ℝ → ℝ) 0 :=", "area": "Analysis"} {"task": "t8", "statement": "lemma differentiableAt_comp_neg_iff {a : 𝕜} : DifferentiableAt 𝕜 f (-a) ↔ DifferentiableAt 𝕜 (fun x ↦ f (-x)) a :=", "area": "Analysis"} {"task": "t8", "statement": "theorem HasDerivAtFilter.sub (hf : HasDerivAtFilter f f' x L) (hg : HasDerivAtFilter g g' x L) : HasDerivAtFilter (fun x => f x - g x) (f' - g') x L :=", "area": "Analysis"} {"task": "t8", "statement": "theorem HasStrictDerivAt.sub (hf : HasStrictDerivAt f f' x) (hg : HasStrictDerivAt g g' x) : HasStrictDerivAt (fun x => f x - g x) (f' - g') x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem HasDerivAtFilter.sub_const (hf : HasDerivAtFilter f f' x L) (c : F) : HasDerivAtFilter (fun x => f x - c) f' x L :=", "area": "Analysis"} {"task": "t8", "statement": "theorem derivWithin_sub_const (hxs : UniqueDiffWithinAt 𝕜 s x) (c : F) : derivWithin (fun y => f y - c) s x = derivWithin f s x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem deriv_sub_const (c : F) : deriv (fun y => f y - c) x = deriv f x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem HasDerivAtFilter.const_sub (c : F) (hf : HasDerivAtFilter f f' x L) : HasDerivAtFilter (fun x => c - f x) (-f') x L :=", "area": "Analysis"} {"task": "t8", "statement": "theorem HasStrictDerivAt.const_sub (c : F) (hf : HasStrictDerivAt f f' x) : HasStrictDerivAt (fun x => c - f x) (-f') x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem derivWithin_const_sub (hxs : UniqueDiffWithinAt 𝕜 s x) (c : F) : derivWithin (fun y => c - f y) s x = -derivWithin f s x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem deriv_const_sub (c : F) : deriv (fun y => c - f y) x = -deriv f x :=", "area": "Analysis"} {"task": "t8", "statement": "theorem hasDerivAtFilter_iff_tendsto_slope {x : 𝕜} {L : Filter 𝕜} : HasDerivAtFilter f f' x L ↔ Tendsto (slope f x) (L ⊓ 𝓟 {x}ᶜ) (𝓝 f') :=", "area": "Analysis"} {"task": "t8", "statement": "theorem hasDerivWithinAt_iff_tendsto_slope : HasDerivWithinAt f f' s x ↔ Tendsto (slope f x) (𝓝[s \\ {x}] x) (𝓝 f') :=", "area": "Analysis"} {"task": "t8", "statement": "theorem hasDerivWithinAt_iff_tendsto_slope' (hs : x ∉ s) : HasDerivWithinAt f f' s x ↔ Tendsto (slope f x) (𝓝[s] x) (𝓝 f') :=", "area": "Analysis"} {"task": "t8", "statement": "theorem hasDerivAt_iff_tendsto_slope_zero : HasDerivAt f f' x ↔ Tendsto (fun t ↦ t⁻¹ • (f (x + t) - f x)) (𝓝[≠] 0) (𝓝 f') :=", "area": "Analysis"} {"task": "t8", "statement": "theorem range_derivWithin_subset_closure_span_image (f : 𝕜 → F) {s t : Set 𝕜} (h : s ⊆ closure (s ∩ t)) : range (derivWithin f s) ⊆ closure (Submodule.span 𝕜 (f '' t)) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem range_deriv_subset_closure_span_image (f : 𝕜 → F) {t : Set 𝕜} (h : Dense t) : range (deriv f) ⊆ closure (Submodule.span 𝕜 (f '' t)) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isSeparable_range_derivWithin [SeparableSpace 𝕜] (f : 𝕜 → F) (s : Set 𝕜) : IsSeparable (range (derivWithin f s)) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem isSeparable_range_deriv [SeparableSpace 𝕜] (f : 𝕜 → F) : IsSeparable (range (deriv f)) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem HasDerivWithinAt.limsup_norm_slope_le (hf : HasDerivWithinAt f f' s x) (hr : ‖f'‖ < r) : ∀ᶠ z in 𝓝[s] x, ‖z - x‖⁻¹ * ‖f z - f x‖ < r :=", "area": "Analysis"} {"task": "t8", "statement": "theorem HasDerivWithinAt.limsup_slope_norm_le (hf : HasDerivWithinAt f f' s x) (hr : ‖f'‖ < r) : ∀ᶠ z in 𝓝[s] x, ‖z - x‖⁻¹ * (‖f z‖ - ‖f x‖) < r :=", "area": "Analysis"} {"task": "t8", "statement": "theorem HasDerivWithinAt.liminf_right_slope_norm_le (hf : HasDerivWithinAt f f' (Ici x) x) (hr : ‖f'‖ < r) : ∃ᶠ z in 𝓝[>] x, (z - x)⁻¹ * (‖f z‖ - ‖f x‖) < r :=", "area": "Analysis"} {"task": "t8", "statement": "theorem norm_natCast (n : ℕ) : ‖(n : ℤ)‖ = n :=", "area": "Analysis"} {"task": "t8", "statement": "theorem _root_.NNReal.natCast_natAbs (n : ℤ) : (n.natAbs : ℝ≥0) = ‖n‖₊ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem abs_le_floor_nnreal_iff (z : ℤ) (c : ℝ≥0) : |z| ≤ ⌊c⌋₊ ↔ ‖z‖₊ ≤ c :=", "area": "Analysis"} {"task": "t8", "statement": "theorem norm_zpow_le_mul_norm (n : ℤ) (a : α) : ‖a ^ n‖ ≤ ‖n‖ * ‖a‖ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem nnnorm_zpow_le_mul_norm (n : ℤ) (a : α) : ‖a ^ n‖₊ ≤ ‖n‖₊ * ‖a‖₊ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Summable.mul_of_nonneg {f : ι → ℝ} {g : ι' → ℝ} (hf : Summable f) (hg : Summable g) (hf' : 0 ≤ f) (hg' : 0 ≤ g) : Summable fun x : ι × ι' => f x.1 * g x.2 :=", "area": "Analysis"} {"task": "t8", "statement": "theorem summable_norm_sum_mul_antidiagonal_of_summable_norm {f g : ℕ → R} (hf : Summable fun x => ‖f x‖) (hg : Summable fun x => ‖g x‖) : Summable fun n => ‖∑ kl ∈ antidiagonal n, f kl.1 * g kl.2‖ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem summable_norm_sum_mul_range_of_summable_norm {f g : ℕ → R} (hf : Summable fun x => ‖f x‖) (hg : Summable fun x => ‖g x‖) : Summable fun n => ‖∑ k ∈ range (n + 1), f k * g (n - k)‖ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem tsum_mul_tsum_eq_tsum_sum_range_of_summable_norm [CompleteSpace R] {f g : ℕ → R} (hf : Summable fun x => ‖f x‖) (hg : Summable fun x => ‖g x‖) : ((∑' n, f n) * ∑' n, g n) = ∑' n, ∑ k ∈ range (n + 1), f k * g (n - k) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem unitSphereToUnits_injective [NormedDivisionRing 𝕜] : Function.Injective (unitSphereToUnits 𝕜) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem NormOneClass.nontrivial (α : Type*) [SeminormedAddCommGroup α] [One α] [NormOneClass α] : Nontrivial α :=", "area": "Analysis"} {"task": "t8", "statement": "theorem nnnorm_mul_le (a b : α) : ‖a * b‖₊ ≤ ‖a‖₊ * ‖b‖₊ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem one_le_norm_one (β) [NormedRing β] [Nontrivial β] : 1 ≤ ‖(1 : β)‖ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem mulRight_bound (x : α) : ∀ y : α, ‖AddMonoidHom.mulRight x y‖ ≤ ‖x‖ * ‖y‖ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Nat.norm_cast_le : ∀ n : ℕ, ‖(n : α)‖ ≤ n * ‖(1 : α)‖", "area": "Analysis"} {"task": "t8", "statement": "theorem List.norm_prod_le' : ∀ {l : List α}, l ≠ [] → ‖l.prod‖ ≤ (l.map norm).prod", "area": "Analysis"} {"task": "t8", "statement": "theorem List.nnnorm_prod_le' {l : List α} (hl : l ≠ []) : ‖l.prod‖₊ ≤ (l.map nnnorm).prod :=", "area": "Analysis"} {"task": "t8", "statement": "theorem List.norm_prod_le [NormOneClass α] : ∀ l : List α, ‖l.prod‖ ≤ (l.map norm).prod", "area": "Analysis"} {"task": "t8", "statement": "theorem List.nnnorm_prod_le [NormOneClass α] (l : List α) : ‖l.prod‖₊ ≤ (l.map nnnorm).prod :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Finset.norm_prod_le' {α : Type*} [NormedCommRing α] (s : Finset ι) (hs : s.Nonempty) (f : ι → α) : ‖∏ i ∈ s, f i‖ ≤ ∏ i ∈ s, ‖f i‖ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Finset.nnnorm_prod_le' {α : Type*} [NormedCommRing α] (s : Finset ι) (hs : s.Nonempty) (f : ι → α) : ‖∏ i ∈ s, f i‖₊ ≤ ∏ i ∈ s, ‖f i‖₊ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Finset.norm_prod_le {α : Type*} [NormedCommRing α] [NormOneClass α] (s : Finset ι) (f : ι → α) : ‖∏ i ∈ s, f i‖ ≤ ∏ i ∈ s, ‖f i‖ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem Finset.nnnorm_prod_le {α : Type*} [NormedCommRing α] [NormOneClass α] (s : Finset ι) (f : ι → α) : ‖∏ i ∈ s, f i‖₊ ≤ ∏ i ∈ s, ‖f i‖₊ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem nnnorm_pow_le' (a : α) : ∀ {n : ℕ}, 0 < n → ‖a ^ n‖₊ ≤ ‖a‖₊ ^ n", "area": "Analysis"} {"task": "t8", "statement": "theorem nnnorm_pow_le [NormOneClass α] (a : α) (n : ℕ) : ‖a ^ n‖₊ ≤ ‖a‖₊ ^ n :=", "area": "Analysis"} {"task": "t8", "statement": "theorem norm_pow_le' (a : α) {n : ℕ} (h : 0 < n) : ‖a ^ n‖ ≤ ‖a‖ ^ n :=", "area": "Analysis"} {"task": "t8", "statement": "theorem norm_pow_le [NormOneClass α] (a : α) (n : ℕ) : ‖a ^ n‖ ≤ ‖a‖ ^ n :=", "area": "Analysis"} {"task": "t8", "statement": "theorem nnnorm_inv (a : α) : ‖a⁻¹‖₊ = ‖a‖₊⁻¹ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem dist_inv_inv₀ {z w : α} (hz : z ≠ 0) (hw : w ≠ 0) : dist z⁻¹ w⁻¹ = dist z w / (‖z‖ * ‖w‖) :=", "area": "Analysis"} {"task": "t8", "statement": "lemma antilipschitzWith_mul_left {a : α} (ha : a ≠ 0) : AntilipschitzWith (‖a‖₊⁻¹) (a * ·) :=", "area": "Analysis"} {"task": "t8", "statement": "lemma antilipschitzWith_mul_right {a : α} (ha : a ≠ 0) : AntilipschitzWith (‖a‖₊⁻¹) (· * a) :=", "area": "Analysis"} {"task": "t8", "statement": "@[simp] lemma inv_cobounded₀ : (cobounded α)⁻¹ = 𝓝[≠] 0 :=", "area": "Analysis"} {"task": "t8", "statement": "@[simp] lemma inv_nhdsWithin_ne_zero : (𝓝[≠] (0 : α))⁻¹ = cobounded α :=", "area": "Analysis"} {"task": "t8", "statement": "theorem exists_lt_norm (r : ℝ) : ∃ x : α, r < ‖x‖ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem exists_norm_lt {r : ℝ} (hr : 0 < r) : ∃ x : α, 0 < ‖x‖ ∧ ‖x‖ < r :=", "area": "Analysis"} {"task": "t8", "statement": "theorem punctured_nhds_neBot (x : α) : NeBot (𝓝[≠] x) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem nhdsWithin_isUnit_neBot : NeBot (𝓝[{ x : α | IsUnit x }] 0) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem toNNReal_mul_nnnorm {x : ℝ} (y : ℝ) (hx : 0 ≤ x) : x.toNNReal * ‖y‖₊ = ‖x * y‖₊ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem nnnorm_mul_toNNReal (x : ℝ) {y : ℝ} (hy : 0 ≤ y) : ‖x‖₊ * y.toNNReal = ‖x * y‖₊ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem norm_eq (x : ℝ≥0) : ‖(x : ℝ)‖ = x :=", "area": "Analysis"} {"task": "t8", "statement": "lemma lipschitzWith_sub : LipschitzWith 2 (fun (p : ℝ≥0 × ℝ≥0) ↦ p.1 - p.2) :=", "area": "Analysis"} {"task": "t8", "statement": "theorem nnnorm_norm [SeminormedAddCommGroup α] (a : α) : ‖‖a‖‖₊ = ‖a‖₊ :=", "area": "Analysis"} {"task": "t8", "statement": "theorem NormedAddCommGroup.tendsto_atTop [Nonempty α] [SemilatticeSup α] {β : Type*} [SeminormedAddCommGroup β] {f : α → β} {b : β} : Tendsto f atTop (𝓝 b) ↔ ∀ ε, 0 < ε → ∃ N, ∀ n, N ≤ n → ‖f n - b‖ < ε :=", "area": "Analysis"} {"task": "t8", "statement": "theorem NormedAddCommGroup.tendsto_atTop' [Nonempty α] [SemilatticeSup α] [NoMaxOrder α] {β : Type*} [SeminormedAddCommGroup β] {f : α → β} {b : β} : Tendsto f atTop (𝓝 b) ↔ ∀ ε, 0 < ε → ∃ N, ∀ n, N < n → ‖f n - b‖ < ε :=", "area": "Analysis"} {"task": "t8", "statement": "lemma lintegral_Iic_eq_lintegral_Iio_add_Icc {y z : ℝ} (f : ℝ → ℝ≥0∞) (hzy : z ≤ y) : ∫⁻ x in Iic y, f x = (∫⁻ x in Iio z, f x) + ∫⁻ x in Icc z y, f x :=", "area": "Probability"} {"task": "t8", "statement": "lemma gammaPDF_of_neg {a r x : ℝ} (hx : x < 0) : gammaPDF a r x = 0 :=", "area": "Probability"} {"task": "t8", "statement": "lemma gammaPDF_of_nonneg {a r x : ℝ} (hx : 0 ≤ x) : gammaPDF a r x = ENNReal.ofReal (r ^ a / (Gamma a) * x ^ (a-1) * exp (-(r * x))) :=", "area": "Probability"} {"task": "t8", "statement": "lemma lintegral_gammaPDF_of_nonpos {x a r : ℝ} (hx : x ≤ 0) : ∫⁻ y in Iio x, gammaPDF a r y = 0 :=", "area": "Probability"} {"task": "t8", "statement": "lemma gammaPDFReal_pos {x a r : ℝ} (ha : 0 < a) (hr : 0 < r) (hx : 0 < x) : 0 < gammaPDFReal a r x :=", "area": "Probability"} {"task": "t8", "statement": "lemma gammaPDFReal_nonneg {a r : ℝ} (ha : 0 < a) (hr : 0 < r) (x : ℝ) : 0 ≤ gammaPDFReal a r x :=", "area": "Probability"} {"task": "t8", "statement": "@[simp] lemma lintegral_gammaPDF_eq_one {a r : ℝ} (ha : 0 < a) (hr : 0 < r) : ∫⁻ x, gammaPDF a r x = 1 :=", "area": "Probability"} {"task": "t8", "statement": "lemma isProbabilityMeasureGamma {a r : ℝ} (ha : 0 < a) (hr : 0 < r) : IsProbabilityMeasure (gammaMeasure a r) where", "area": "Probability"} {"task": "t8", "statement": "lemma gammaCDFReal_eq_integral {a r : ℝ} (ha : 0 < a) (hr : 0 < r) (x : ℝ) : gammaCDFReal a r x = ∫ x in Iic x, gammaPDFReal a r x :=", "area": "Probability"} {"task": "t8", "statement": "lemma gammaCDFReal_eq_lintegral {a r : ℝ} (ha : 0 < a) (hr : 0 < r) (x : ℝ) : gammaCDFReal a r x = ENNReal.toReal (∫⁻ x in Iic x, gammaPDF a r x) :=", "area": "Probability"} {"task": "t8", "statement": "lemma isRatStieltjesPoint_unit_prod_iff (f : α → ℚ → ℝ) (a : α) : IsRatStieltjesPoint (fun p : Unit × α ↦ f p.2) ((), a) ↔ IsRatStieltjesPoint f a :=", "area": "Probability"} {"task": "t8", "statement": "lemma measurableSet_isRatStieltjesPoint (hf : Measurable f) : MeasurableSet {a | IsRatStieltjesPoint f a} :=", "area": "Probability"} {"task": "t8", "statement": "lemma IsRatStieltjesPoint.ite {f g : α → ℚ → ℝ} {a : α} (p : α → Prop) [DecidablePred p] (hf : p a → IsRatStieltjesPoint f a) (hg : ¬ p a → IsRatStieltjesPoint g a): IsRatStieltjesPoint (fun a ↦ if p a then f a else g a) a where", "area": "Probability"} {"task": "t8", "statement": "lemma monotone_defaultRatCDF : Monotone defaultRatCDF :=", "area": "Probability"} {"task": "t8", "statement": "lemma defaultRatCDF_nonneg (q : ℚ) : 0 ≤ defaultRatCDF q :=", "area": "Probability"} {"task": "t8", "statement": "lemma defaultRatCDF_le_one (q : ℚ) : defaultRatCDF q ≤ 1 :=", "area": "Probability"} {"task": "t8", "statement": "lemma tendsto_defaultRatCDF_atTop : Tendsto defaultRatCDF atTop (𝓝 1) :=", "area": "Probability"} {"task": "t8", "statement": "lemma tendsto_defaultRatCDF_atBot : Tendsto defaultRatCDF atBot (𝓝 0) :=", "area": "Probability"} {"task": "t8", "statement": "lemma iInf_rat_gt_defaultRatCDF (t : ℚ) : ⨅ r : Ioi t, defaultRatCDF r = defaultRatCDF t :=", "area": "Probability"} {"task": "t8", "statement": "lemma toRatCDF_of_isRatStieltjesPoint {a : α} (h : IsRatStieltjesPoint f a) (q : ℚ) : toRatCDF f a q = f a q :=", "area": "Probability"} {"task": "t8", "statement": "lemma isMeasurableRatCDF_toRatCDF (hf : Measurable f) : IsMeasurableRatCDF (toRatCDF f) where", "area": "Probability"} {"task": "t8", "statement": "lemma toRatCDF_unit_prod (a : α) : toRatCDF (fun (p : Unit × α) ↦ f p.2) ((), a) = toRatCDF f a :=", "area": "Probability"} {"task": "t8", "statement": "lemma IsMeasurableRatCDF.stieltjesFunctionAux_def' (f : α → ℚ → ℝ) (a : α) : IsMeasurableRatCDF.stieltjesFunctionAux f a = fun (t : ℝ) ↦ ⨅ r : { r' : ℚ // t < r' }, f a r :=", "area": "Probability"} {"task": "t8", "statement": "lemma IsMeasurableRatCDF.stieltjesFunctionAux_unit_prod {f : α → ℚ → ℝ} (a : α) : IsMeasurableRatCDF.stieltjesFunctionAux (fun (p : Unit × α) ↦ f p.2) ((), a) = IsMeasurableRatCDF.stieltjesFunctionAux f a :=", "area": "Probability"} {"task": "t8", "statement": "lemma IsMeasurableRatCDF.stieltjesFunctionAux_eq (a : α) (r : ℚ) : IsMeasurableRatCDF.stieltjesFunctionAux f a r = f a r :=", "area": "Probability"} {"task": "t8", "statement": "lemma IsMeasurableRatCDF.stieltjesFunctionAux_nonneg (a : α) (r : ℝ) : 0 ≤ IsMeasurableRatCDF.stieltjesFunctionAux f a r :=", "area": "Probability"} {"task": "t8", "statement": "lemma IsMeasurableRatCDF.monotone_stieltjesFunctionAux (a : α) : Monotone (IsMeasurableRatCDF.stieltjesFunctionAux f a) :=", "area": "Probability"} {"task": "t8", "statement": "lemma IsMeasurableRatCDF.continuousWithinAt_stieltjesFunctionAux_Ici (a : α) (x : ℝ) : ContinuousWithinAt (IsMeasurableRatCDF.stieltjesFunctionAux f a) (Ici x) x :=", "area": "Probability"} {"task": "t8", "statement": "lemma IsMeasurableRatCDF.stieltjesFunction_le_one (a : α) (x : ℝ) : hf.stieltjesFunction a x ≤ 1 :=", "area": "Probability"} {"task": "t8", "statement": "lemma IsMeasurableRatCDF.tendsto_stieltjesFunction_atBot (a : α) : Tendsto (hf.stieltjesFunction a) atBot (𝓝 0) :=", "area": "Probability"} {"task": "t8", "statement": "lemma IsMeasurableRatCDF.tendsto_stieltjesFunction_atTop (a : α) : Tendsto (hf.stieltjesFunction a) atTop (𝓝 1) :=", "area": "Probability"} {"task": "t8", "statement": "lemma IsMeasurableRatCDF.measurable_stieltjesFunction (x : ℝ) : Measurable fun a ↦ hf.stieltjesFunction a x :=", "area": "Probability"} {"task": "t8", "statement": "lemma IsMeasurableRatCDF.measure_stieltjesFunction_Iic (a : α) (x : ℝ) : (hf.stieltjesFunction a).measure (Iic x) = ENNReal.ofReal (hf.stieltjesFunction a x) :=", "area": "Probability"} {"task": "t8", "statement": "lemma IsMeasurableRatCDF.measure_stieltjesFunction_univ (a : α) : (hf.stieltjesFunction a).measure univ = 1 :=", "area": "Probability"} {"task": "t8", "statement": "lemma IsMeasurableRatCDF.measurable_measure_stieltjesFunction : Measurable fun a ↦ (hf.stieltjesFunction a).measure :=", "area": "Probability"} {"task": "t8", "statement": "lemma stieltjesOfMeasurableRat_unit_prod (hf : Measurable f) (a : α) : stieltjesOfMeasurableRat (fun (p : Unit × α) ↦ f p.2) (hf.comp measurable_snd) ((), a) = stieltjesOfMeasurableRat f hf a :=", "area": "Probability"} {"task": "t8", "statement": "lemma measurable_densityProcess_countableFiltration_aux (κ : kernel α (γ × β)) (ν : kernel α γ) (n : ℕ) {s : Set β} (hs : MeasurableSet s) : Measurable[mα.prod (countableFiltration γ n)] (fun (p : α × γ) ↦ κ p.1 (countablePartitionSet n p.2 ×ˢ s) / ν p.1 (countablePartitionSet n p.2)) :=", "area": "Probability"} {"task": "t8", "statement": "lemma measurable_densityProcess_aux (κ : kernel α (γ × β)) (ν : kernel α γ) (n : ℕ) {s : Set β} (hs : MeasurableSet s) : Measurable (fun (p : α × γ) ↦ κ p.1 (countablePartitionSet n p.2 ×ˢ s) / ν p.1 (countablePartitionSet n p.2)) :=", "area": "Probability"} {"task": "t8", "statement": "lemma measurable_countableFiltration_densityProcess (κ : kernel α (γ × β)) (ν : kernel α γ) (n : ℕ) (a : α) {s : Set β} (hs : MeasurableSet s) : Measurable[countableFiltration γ n] (fun x ↦ densityProcess κ ν n a x s) :=", "area": "Probability"} {"task": "t8", "statement": "lemma meas_countablePartitionSet_le_of_fst_le (hκν : fst κ ≤ ν) (n : ℕ) (a : α) (x : γ) (s : Set β) : κ a (countablePartitionSet n x ×ˢ s) ≤ ν a (countablePartitionSet n x) :=", "area": "Probability"} {"task": "t8", "statement": "lemma densityProcess_le_one (hκν : fst κ ≤ ν) (n : ℕ) (a : α) (x : γ) (s : Set β) : densityProcess κ ν n a x s ≤ 1 :=", "area": "Probability"} {"task": "t8", "statement": "lemma snorm_densityProcess_le (hκν : fst κ ≤ ν) (n : ℕ) (a : α) (s : Set β) : snorm (fun x ↦ densityProcess κ ν n a x s) 1 (ν a) ≤ ν a univ :=", "area": "Probability"} {"task": "t8", "statement": "lemma integrable_densityProcess (hκν : fst κ ≤ ν) [IsFiniteKernel ν] (n : ℕ) (a : α) {s : Set β} (hs : MeasurableSet s) : Integrable (fun x ↦ densityProcess κ ν n a x s) (ν a) :=", "area": "Probability"} {"task": "t8", "statement": "lemma setIntegral_densityProcess_of_mem (hκν : fst κ ≤ ν) [hν : IsFiniteKernel ν] (n : ℕ) (a : α) {s : Set β} (hs : MeasurableSet s) {u : Set γ} (hu : u ∈ countablePartition γ n) : ∫ x in u, densityProcess κ ν n a x s ∂(ν a) = (κ a (u ×ˢ s)).toReal :=", "area": "Probability"} {"task": "t8", "statement": "lemma setIntegral_densityProcess (hκν : fst κ ≤ ν) [IsFiniteKernel ν] (n : ℕ) (a : α) {s : Set β} (hs : MeasurableSet s) {A : Set γ} (hA : MeasurableSet[countableFiltration γ n] A) : ∫ x in A, densityProcess κ ν n a x s ∂(ν a) = (κ a (A ×ˢ s)).toReal :=", "area": "Probability"} {"task": "t8", "statement": "lemma integral_densityProcess (hκν : fst κ ≤ ν) [IsFiniteKernel ν] (n : ℕ) (a : α) {s : Set β} (hs : MeasurableSet s) : ∫ x, densityProcess κ ν n a x s ∂(ν a) = (κ a (univ ×ˢ s)).toReal :=", "area": "Probability"} {"task": "t8", "statement": "lemma condexp_densityProcess (hκν : fst κ ≤ ν) [IsFiniteKernel ν] {i j : ℕ} (hij : i ≤ j) (a : α) {s : Set β} (hs : MeasurableSet s) : (ν a)[fun x ↦ densityProcess κ ν j a x s | countableFiltration γ i] =ᵐ[ν a] fun x ↦ densityProcess κ ν i a x s :=", "area": "Probability"} {"task": "t8", "statement": "lemma densityProcess_mono_set (hκν : fst κ ≤ ν) (n : ℕ) (a : α) (x : γ) {s s' : Set β} (h : s ⊆ s') : densityProcess κ ν n a x s ≤ densityProcess κ ν n a x s' :=", "area": "Probability"} {"task": "t8", "statement": "lemma densityProcess_mono_kernel_left {κ' : kernel α (γ × β)} (hκκ' : κ ≤ κ') (hκ'ν : fst κ' ≤ ν) (n : ℕ) (a : α) (x : γ) (s : Set β) : densityProcess κ ν n a x s ≤ densityProcess κ' ν n a x s :=", "area": "Probability"} {"task": "t8", "statement": "lemma densityProcess_antitone_kernel_right {ν' : kernel α γ} (hνν' : ν ≤ ν') (hκν : fst κ ≤ ν) (n : ℕ) (a : α) (x : γ) (s : Set β) : densityProcess κ ν' n a x s ≤ densityProcess κ ν n a x s :=", "area": "Probability"} {"task": "t8", "statement": "@[simp] lemma densityProcess_empty (κ : kernel α (γ × β)) (ν : kernel α γ) (n : ℕ) (a : α) (x : γ) : densityProcess κ ν n a x ∅ = 0 :=", "area": "Probability"} {"task": "t8", "statement": "lemma tendsto_densityProcess_atTop_empty_of_antitone (κ : kernel α (γ × β)) (ν : kernel α γ) [IsFiniteKernel κ] (n : ℕ) (a : α) (x : γ) (seq : ℕ → Set β) (hseq : Antitone seq) (hseq_iInter : ⋂ i, seq i = ∅) (hseq_meas : ∀ m, MeasurableSet (seq m)) : Tendsto (fun m ↦ densityProcess κ ν n a x (seq m)) atTop (𝓝 (densityProcess κ ν n a x ∅)) :=", "area": "Probability"} {"task": "t8", "statement": "lemma tendsto_densityProcess_atTop_of_antitone (κ : kernel α (γ × β)) (ν : kernel α γ) [IsFiniteKernel κ] (n : ℕ) (a : α) (x : γ) (seq : ℕ → Set β) (hseq : Antitone seq) (hseq_iInter : ⋂ i, seq i = ∅) (hseq_meas : ∀ m, MeasurableSet (seq m)) : Tendsto (fun m ↦ densityProcess κ ν n a x (seq m)) atTop (𝓝 0) :=", "area": "Probability"} {"task": "t8", "statement": "lemma tendsto_densityProcess_limitProcess (hκν : fst κ ≤ ν) [IsFiniteKernel ν] (a : α) {s : Set β} (hs : MeasurableSet s) : ∀ᵐ x ∂(ν a), Tendsto (fun n ↦ densityProcess κ ν n a x s) atTop (𝓝 ((countableFiltration γ).limitProcess (fun n x ↦ densityProcess κ ν n a x s) (ν a) x)) :=", "area": "Probability"} {"task": "t8", "statement": "lemma memL1_limitProcess_densityProcess (hκν : fst κ ≤ ν) [IsFiniteKernel ν] (a : α) {s : Set β} (hs : MeasurableSet s) : Memℒp ((countableFiltration γ).limitProcess (fun n x ↦ densityProcess κ ν n a x s) (ν a)) 1 (ν a) :=", "area": "Probability"} {"task": "t8", "statement": "lemma tendsto_snorm_one_densityProcess_limitProcess (hκν : fst κ ≤ ν) [IsFiniteKernel ν] (a : α) {s : Set β} (hs : MeasurableSet s) : Tendsto (fun n ↦ snorm ((fun x ↦ densityProcess κ ν n a x s) - (countableFiltration γ).limitProcess (fun n x ↦ densityProcess κ ν n a x s) (ν a)) 1 (ν a)) atTop (𝓝 0) :=", "area": "Probability"} {"task": "t8", "statement": "lemma density_ae_eq_limitProcess (hκν : fst κ ≤ ν) [IsFiniteKernel ν] (a : α) {s : Set β} (hs : MeasurableSet s) : (fun x ↦ density κ ν a x s) =ᵐ[ν a] (countableFiltration γ).limitProcess (fun n x ↦ densityProcess κ ν n a x s) (ν a) :=", "area": "Probability"} {"task": "t8", "statement": "lemma tendsto_m_density (hκν : fst κ ≤ ν) (a : α) [IsFiniteKernel ν] {s : Set β} (hs : MeasurableSet s) : ∀ᵐ x ∂(ν a), Tendsto (fun n ↦ densityProcess κ ν n a x s) atTop (𝓝 (density κ ν a x s)) :=", "area": "Probability"} {"task": "t8", "statement": "lemma measurable_density_left (κ : kernel α (γ × β)) (ν : kernel α γ) (x : γ) {s : Set β} (hs : MeasurableSet s) : Measurable (fun a ↦ density κ ν a x s) :=", "area": "Probability"} {"task": "t8", "statement": "lemma measurable_density_right (κ : kernel α (γ × β)) (ν : kernel α γ) {s : Set β} (hs : MeasurableSet s) (a : α) : Measurable (fun x ↦ density κ ν a x s) :=", "area": "Probability"} {"task": "t8", "statement": "lemma density_mono_set (hκν : fst κ ≤ ν) (a : α) (x : γ) {s s' : Set β} (h : s ⊆ s') : density κ ν a x s ≤ density κ ν a x s' :=", "area": "Probability"} {"task": "t8", "statement": "lemma density_nonneg (hκν : fst κ ≤ ν) (a : α) (x : γ) (s : Set β) : 0 ≤ density κ ν a x s :=", "area": "Probability"} {"task": "t8", "statement": "lemma density_le_one (hκν : fst κ ≤ ν) (a : α) (x : γ) (s : Set β) : density κ ν a x s ≤ 1 :=", "area": "Probability"} {"task": "t8", "statement": "lemma snorm_density_le (hκν : fst κ ≤ ν) (a : α) (s : Set β) : snorm (fun x ↦ density κ ν a x s) 1 (ν a) ≤ ν a univ :=", "area": "Probability"} {"task": "t8", "statement": "lemma integrable_density (hκν : fst κ ≤ ν) [IsFiniteKernel ν] (a : α) {s : Set β} (hs : MeasurableSet s) : Integrable (fun x ↦ density κ ν a x s) (ν a) :=", "area": "Probability"} {"task": "t8", "statement": "lemma tendsto_setIntegral_densityProcess (hκν : fst κ ≤ ν) [IsFiniteKernel ν] (a : α) {s : Set β} (hs : MeasurableSet s) (A : Set γ) : Tendsto (fun i ↦ ∫ x in A, densityProcess κ ν i a x s ∂(ν a)) atTop (𝓝 (∫ x in A, density κ ν a x s ∂(ν a))) :=", "area": "Probability"} {"task": "t8", "statement": "lemma setIntegral_density_of_measurableSet (hκν : fst κ ≤ ν) [IsFiniteKernel ν] (n : ℕ) (a : α) {s : Set β} (hs : MeasurableSet s) {A : Set γ} (hA : MeasurableSet[countableFiltration γ n] A) : ∫ x in A, density κ ν a x s ∂(ν a) = (κ a (A ×ˢ s)).toReal :=", "area": "Probability"} {"task": "t8", "statement": "lemma integral_density (hκν : fst κ ≤ ν) [IsFiniteKernel ν] (a : α) {s : Set β} (hs : MeasurableSet s) : ∫ x, density κ ν a x s ∂(ν a) = (κ a (univ ×ˢ s)).toReal :=", "area": "Probability"} {"task": "t8", "statement": "lemma setIntegral_density (hκν : fst κ ≤ ν) [IsFiniteKernel ν] (a : α) {s : Set β} (hs : MeasurableSet s) {A : Set γ} (hA : MeasurableSet A) : ∫ x in A, density κ ν a x s ∂(ν a) = (κ a (A ×ˢ s)).toReal :=", "area": "Probability"} {"task": "t8", "statement": "lemma setLIntegral_density (hκν : fst κ ≤ ν) [IsFiniteKernel ν] (a : α) {s : Set β} (hs : MeasurableSet s) {A : Set γ} (hA : MeasurableSet A) : ∫⁻ x in A, ENNReal.ofReal (density κ ν a x s) ∂(ν a) = κ a (A ×ˢ s) :=", "area": "Probability"} {"task": "t8", "statement": "lemma lintegral_density (hκν : fst κ ≤ ν) [IsFiniteKernel ν] (a : α) {s : Set β} (hs : MeasurableSet s) : ∫⁻ x, ENNReal.ofReal (density κ ν a x s) ∂(ν a) = κ a (univ ×ˢ s) :=", "area": "Probability"} {"task": "t8", "statement": "lemma tendsto_integral_density_of_monotone (hκν : fst κ ≤ ν) [IsFiniteKernel ν] (a : α) (seq : ℕ → Set β) (hseq : Monotone seq) (hseq_iUnion : ⋃ i, seq i = univ) (hseq_meas : ∀ m, MeasurableSet (seq m)) : Tendsto (fun m ↦ ∫ x, density κ ν a x (seq m) ∂(ν a)) atTop (𝓝 (κ a univ).toReal) :=", "area": "Probability"} {"task": "t8", "statement": "lemma tendsto_integral_density_of_antitone (hκν : fst κ ≤ ν) [IsFiniteKernel ν] (a : α) (seq : ℕ → Set β) (hseq : Antitone seq) (hseq_iInter : ⋂ i, seq i = ∅) (hseq_meas : ∀ m, MeasurableSet (seq m)) : Tendsto (fun m ↦ ∫ x, density κ ν a x (seq m) ∂(ν a)) atTop (𝓝 0) :=", "area": "Probability"} {"task": "t8", "statement": "lemma tendsto_density_atTop_ae_of_antitone (hκν : fst κ ≤ ν) [IsFiniteKernel ν] (a : α) (seq : ℕ → Set β) (hseq : Antitone seq) (hseq_iInter : ⋂ i, seq i = ∅) (hseq_meas : ∀ m, MeasurableSet (seq m)) : ∀ᵐ x ∂(ν a), Tendsto (fun m ↦ density κ ν a x (seq m)) atTop (𝓝 0) :=", "area": "Probability"} {"task": "t8", "statement": "lemma densityProcess_fst_univ [IsFiniteKernel κ] (n : ℕ) (a : α) (x : γ) : densityProcess κ (fst κ) n a x univ = if fst κ a (countablePartitionSet n x) = 0 then 0 else 1 :=", "area": "Probability"} {"task": "t8", "statement": "lemma densityProcess_fst_univ_ae (κ : kernel α (γ × β)) [IsFiniteKernel κ] (n : ℕ) (a : α) : ∀ᵐ x ∂(fst κ a), densityProcess κ (fst κ) n a x univ = 1 :=", "area": "Probability"} {"task": "t8", "statement": "lemma tendsto_densityProcess_fst_atTop_univ_of_monotone (κ : kernel α (γ × β)) (n : ℕ) (a : α) (x : γ) (seq : ℕ → Set β) (hseq : Monotone seq) (hseq_iUnion : ⋃ i, seq i = univ) : Tendsto (fun m ↦ densityProcess κ (fst κ) n a x (seq m)) atTop (𝓝 (densityProcess κ (fst κ) n a x univ)) :=", "area": "Probability"} {"task": "t8", "statement": "lemma tendsto_densityProcess_fst_atTop_ae_of_monotone (κ : kernel α (γ × β)) [IsFiniteKernel κ] (n : ℕ) (a : α) (seq : ℕ → Set β) (hseq : Monotone seq) (hseq_iUnion : ⋃ i, seq i = univ) : ∀ᵐ x ∂(fst κ a), Tendsto (fun m ↦ densityProcess κ (fst κ) n a x (seq m)) atTop (𝓝 1) :=", "area": "Probability"} {"task": "t8", "statement": "lemma density_fst_univ (κ : kernel α (γ × β)) [IsFiniteKernel κ] (a : α) : ∀ᵐ x ∂(fst κ a), density κ (fst κ) a x univ = 1 :=", "area": "Probability"} {"task": "t8", "statement": "lemma tendsto_density_fst_atTop_ae_of_monotone [IsFiniteKernel κ] (a : α) (seq : ℕ → Set β) (hseq : Monotone seq) (hseq_iUnion : ⋃ i, seq i = univ) (hseq_meas : ∀ m, MeasurableSet (seq m)) : ∀ᵐ x ∂(fst κ a), Tendsto (fun m ↦ density κ (fst κ) a x (seq m)) atTop (𝓝 1) :=", "area": "Probability"} {"task": "t8", "statement": "theorem wilsons_lemma : ((p - 1)! : ZMod p) = -1 :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem prod_Ico_one_prime : ∏ x ∈ Ico 1 p, (x : ZMod p) = -1 :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem prime_of_fac_equiv_neg_one (h : ((n - 1)! : ZMod n) = -1) (h1 : n ≠ 1) : Prime n :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem prime_iff_fac_equiv_neg_one (h : n ≠ 1) : Prime n ↔ ((n - 1)! : ZMod n) = -1 :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem ramificationIdx_eq_zero (h : ∀ n : ℕ, ∃ k, map f p ≤ P ^ k ∧ n < k) : ramificationIdx f p P = 0 :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem ramificationIdx_spec {n : ℕ} (hle : map f p ≤ P ^ n) (hgt : ¬map f p ≤ P ^ (n + 1)) : ramificationIdx f p P = n :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem ramificationIdx_lt {n : ℕ} (hgt : ¬map f p ≤ P ^ n) : ramificationIdx f p P < n :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem ramificationIdx_bot : ramificationIdx f ⊥ P = 0 :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem ramificationIdx_of_not_le (h : ¬map f p ≤ P) : ramificationIdx f p P = 0 :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem ramificationIdx_ne_zero {e : ℕ} (he : e ≠ 0) (hle : map f p ≤ P ^ e) (hnle : ¬map f p ≤ P ^ (e + 1)) : ramificationIdx f p P ≠ 0 :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem le_pow_of_le_ramificationIdx {n : ℕ} (hn : n ≤ ramificationIdx f p P) : map f p ≤ P ^ n :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem ramificationIdx_eq_normalizedFactors_count (hp0 : map f p ≠ ⊥) (hP : P.IsPrime) (hP0 : P ≠ ⊥) : ramificationIdx f p P = (normalizedFactors (map f p)).count P :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem ramificationIdx_eq_factors_count (hp0 : map f p ≠ ⊥) (hP : P.IsPrime) (hP0 : P ≠ ⊥) : ramificationIdx f p P = (factors (map f p)).count P :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem ramificationIdx_ne_zero (hp0 : map f p ≠ ⊥) (hP : P.IsPrime) (le : map f p ≤ P) : ramificationIdx f p P ≠ 0 :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem inertiaDeg_of_subsingleton [hp : p.IsMaximal] [hQ : Subsingleton (S ⧸ P)] : inertiaDeg f p P = 0 :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem inertiaDeg_algebraMap [Algebra R S] [Algebra (R ⧸ p) (S ⧸ P)] [IsScalarTower R (R ⧸ p) (S ⧸ P)] [hp : p.IsMaximal] : inertiaDeg (algebraMap R S) p P = finrank (R ⧸ p) (S ⧸ P) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem FinrankQuotientMap.linearIndependent_of_nontrivial [IsDedekindDomain R] (hRS : RingHom.ker (algebraMap R S) ≠ ⊤) (f : V'' →ₗ[R] V) (hf : Function.Injective f) (f' : V'' →ₗ[R] V') {ι : Type*} {b : ι → V''} (hb' : LinearIndependent S (f' ∘ b)) : LinearIndependent K (f ∘ b) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem FinrankQuotientMap.span_eq_top [IsDomain R] [IsDomain S] [Algebra K L] [IsNoetherian R S] [Algebra R L] [IsScalarTower R S L] [IsScalarTower R K L] [IsIntegralClosure S R L] [NoZeroSMulDivisors R K] (hp : p ≠ ⊤) (b : Set S) (hb' : Submodule.span R b ⊔ (p.map (algebraMap R S)).restrictScalars R = ⊤) : Submodule.span K (algebraMap S L '' b) = ⊤ :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem finrank_quotient_map [IsDomain S] [IsDedekindDomain R] [Algebra K L] [Algebra R L] [IsScalarTower R K L] [IsScalarTower R S L] [IsIntegralClosure S R L] [hp : p.IsMaximal] [IsNoetherian R S] : finrank (R ⧸ p) (S ⧸ map (algebraMap R S) p) = finrank K L :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem powQuotSuccInclusion_injective (i : ℕ) : Function.Injective (powQuotSuccInclusion f p P i) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem quotientToQuotientRangePowQuotSuccAux_mk {i : ℕ} {a : S} (a_mem : a ∈ P ^ i) (x : S) : quotientToQuotientRangePowQuotSuccAux f p P a_mem (Submodule.Quotient.mk x) = Submodule.Quotient.mk ⟨_, Ideal.mem_map_of_mem _ (Ideal.mul_mem_right x _ a_mem)⟩ :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem quotientToQuotientRangePowQuotSucc_injective [IsDedekindDomain S] [P.IsPrime] {i : ℕ} (hi : i < e) {a : S} (a_mem : a ∈ P ^ i) (a_not_mem : a ∉ P ^ (i + 1)) : Function.Injective (quotientToQuotientRangePowQuotSucc f p P a_mem) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem quotientToQuotientRangePowQuotSucc_surjective [IsDedekindDomain S] (hP0 : P ≠ ⊥) [hP : P.IsPrime] {i : ℕ} (hi : i < e) {a : S} (a_mem : a ∈ P ^ i) (a_not_mem : a ∉ P ^ (i + 1)) : Function.Surjective (quotientToQuotientRangePowQuotSucc f p P a_mem) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem rank_pow_quot_aux [IsDedekindDomain S] [p.IsMaximal] [P.IsPrime] (hP0 : P ≠ ⊥) {i : ℕ} (hi : i < e) : Module.rank (R ⧸ p) (Ideal.map (Ideal.Quotient.mk (P ^ e)) (P ^ i)) = Module.rank (R ⧸ p) (S ⧸ P) + Module.rank (R ⧸ p) (Ideal.map (Ideal.Quotient.mk (P ^ e)) (P ^ (i + 1))) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem rank_pow_quot [IsDedekindDomain S] [p.IsMaximal] [P.IsPrime] (hP0 : P ≠ ⊥) (i : ℕ) (hi : i ≤ e) : Module.rank (R ⧸ p) (Ideal.map (Ideal.Quotient.mk (P ^ e)) (P ^ i)) = (e - i) • Module.rank (R ⧸ p) (S ⧸ P) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem rank_prime_pow_ramificationIdx [IsDedekindDomain S] [p.IsMaximal] [P.IsPrime] (hP0 : P ≠ ⊥) (he : e ≠ 0) : Module.rank (R ⧸ p) (S ⧸ P ^ e) = e • @Module.rank (R ⧸ p) (S ⧸ P) _ _ (@Algebra.toModule _ _ _ _ <| @Quotient.algebraQuotientOfRamificationIdxNeZero _ _ _ _ _ _ _ ⟨he⟩) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem finrank_prime_pow_ramificationIdx [IsDedekindDomain S] (hP0 : P ≠ ⊥) [p.IsMaximal] [P.IsPrime] (he : e ≠ 0) : finrank (R ⧸ p) (S ⧸ P ^ e) = e * @finrank (R ⧸ p) (S ⧸ P) _ _ (@Algebra.toModule _ _ _ _ <| @Quotient.algebraQuotientOfRamificationIdxNeZero _ _ _ _ _ _ _ ⟨he⟩) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem Factors.finrank_pow_ramificationIdx [p.IsMaximal] (P : (factors (map (algebraMap R S) p)).toFinset) : finrank (R ⧸ p) (S ⧸ (P : Ideal S) ^ ramificationIdx (algebraMap R S) p P) = ramificationIdx (algebraMap R S) p P * inertiaDeg (algebraMap R S) p P :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem Factors.inertiaDeg_ne_zero [IsNoetherian R S] [p.IsMaximal] (P : (factors (map (algebraMap R S) p)).toFinset) : inertiaDeg (algebraMap R S) p P ≠ 0 :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem sum_ramification_inertia (K L : Type*) [Field K] [Field L] [IsDedekindDomain R] [Algebra R K] [IsFractionRing R K] [Algebra S L] [IsFractionRing S L] [Algebra K L] [Algebra R L] [IsScalarTower R S L] [IsScalarTower R K L] [IsNoetherian R S] [IsIntegralClosure S R L] [p.IsMaximal] (hp0 : p ≠ ⊥) : (∑ P ∈ (factors (map (algebraMap R S) p)).toFinset, ramificationIdx (algebraMap R S) p P * inertiaDeg (algebraMap R S) p P) = finrank K L :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem setOf_liouvilleWith_subset_aux : { x : ℝ | ∃ p > 2, LiouvilleWith p x } ⊆ ⋃ m : ℤ, (· + (m : ℝ)) ⁻¹' ⋃ n > (0 : ℕ), { x : ℝ | ∃ᶠ b : ℕ in atTop, ∃ a ∈ Finset.Icc (0 : ℤ) b, |x - (a : ℤ) / b| < 1 / (b : ℝ) ^ (2 + 1 / n : ℝ) } :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem volume_iUnion_setOf_liouvilleWith : volume (⋃ (p : ℝ) (_hp : 2 < p), { x : ℝ | LiouvilleWith p x }) = 0 :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem ae_not_liouvilleWith : ∀ᵐ x, ∀ p > (2 : ℝ), ¬LiouvilleWith p x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem ae_not_liouville : ∀ᵐ x, ¬Liouville x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem volume_setOf_liouville : volume { x : ℝ | Liouville x } = 0 :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem liouvilleWith_one (x : ℝ) : LiouvilleWith 1 x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem exists_pos (h : LiouvilleWith p x) : ∃ (C : ℝ) (_h₀ : 0 < C), ∃ᶠ n : ℕ in atTop, 1 ≤ n ∧ ∃ m : ℤ, x ≠ m / n ∧ |x - m / n| < C / n ^ p :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem mono (h : LiouvilleWith p x) (hle : q ≤ p) : LiouvilleWith q x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem frequently_lt_rpow_neg (h : LiouvilleWith p x) (hlt : q < p) : ∃ᶠ n : ℕ in atTop, ∃ m : ℤ, x ≠ m / n ∧ |x - m / n| < n ^ (-q) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem mul_rat (h : LiouvilleWith p x) (hr : r ≠ 0) : LiouvilleWith p (x * r) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem mul_rat_iff (hr : r ≠ 0) : LiouvilleWith p (x * r) ↔ LiouvilleWith p x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem rat_mul_iff (hr : r ≠ 0) : LiouvilleWith p (r * x) ↔ LiouvilleWith p x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem mul_int_iff (hm : m ≠ 0) : LiouvilleWith p (x * m) ↔ LiouvilleWith p x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem int_mul_iff (hm : m ≠ 0) : LiouvilleWith p (m * x) ↔ LiouvilleWith p x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem mul_nat_iff (hn : n ≠ 0) : LiouvilleWith p (x * n) ↔ LiouvilleWith p x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem nat_mul_iff (hn : n ≠ 0) : LiouvilleWith p (n * x) ↔ LiouvilleWith p x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem nat_mul (h : LiouvilleWith p x) (hn : n ≠ 0) : LiouvilleWith p (n * x) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem add_rat (h : LiouvilleWith p x) (r : ℚ) : LiouvilleWith p (x + r) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem add_rat_iff : LiouvilleWith p (x + r) ↔ LiouvilleWith p x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem rat_add_iff : LiouvilleWith p (r + x) ↔ LiouvilleWith p x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem add_int_iff : LiouvilleWith p (x + m) ↔ LiouvilleWith p x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem int_add_iff : LiouvilleWith p (m + x) ↔ LiouvilleWith p x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem add_nat_iff : LiouvilleWith p (x + n) ↔ LiouvilleWith p x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem nat_add_iff : LiouvilleWith p (n + x) ↔ LiouvilleWith p x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem neg (h : LiouvilleWith p x) : LiouvilleWith p (-x) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem sub_rat_iff : LiouvilleWith p (x - r) ↔ LiouvilleWith p x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem sub_int_iff : LiouvilleWith p (x - m) ↔ LiouvilleWith p x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem sub_nat_iff : LiouvilleWith p (x - n) ↔ LiouvilleWith p x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem rat_sub_iff : LiouvilleWith p (r - x) ↔ LiouvilleWith p x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem int_sub_iff : LiouvilleWith p (m - x) ↔ LiouvilleWith p x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem nat_sub_iff : LiouvilleWith p (n - x) ↔ LiouvilleWith p x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem ne_cast_int (h : LiouvilleWith p x) (hp : 1 < p) (m : ℤ) : x ≠ m :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem irrational (h : LiouvilleWith p x) (hp : 1 < p) : Irrational x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem frequently_exists_num (hx : Liouville x) (n : ℕ) : ∃ᶠ b : ℕ in atTop, ∃ a : ℤ, x ≠ a / b ∧ |x - a / b| < 1 / (b : ℝ) ^ n :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem liouvilleWith (hx : Liouville x) (p : ℝ) : LiouvilleWith p x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem forall_liouvilleWith_iff {x : ℝ} : (∀ p, LiouvilleWith p x) ↔ Liouville x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem Gamma_mem (N : ℕ) (γ : SL(2, ℤ)) : γ ∈ Gamma N ↔ ((↑ₘγ 0 0 : ℤ) : ZMod N) = 1 ∧ ((↑ₘγ 0 1 : ℤ) : ZMod N) = 0 ∧ ((↑ₘγ 1 0 : ℤ) : ZMod N) = 0 ∧ ((↑ₘγ 1 1 : ℤ) : ZMod N) = 1 :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem Gamma_one_top : Gamma 1 = ⊤ :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem Gamma_zero_bot : Gamma 0 = ⊥ :=", "area": "NumberTheory"} {"task": "t8", "statement": "lemma ModularGroup_T_pow_mem_Gamma (N M : ℤ) (hNM : N ∣ M) : (ModularGroup.T ^ M) ∈ _root_.Gamma (Int.natAbs N) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem Gamma0_det (N : ℕ) (A : Gamma0 N) : (A.1.1.det : ZMod N) = 1 :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem Gamma1_to_Gamma0_mem (N : ℕ) (A : Gamma0 N) : A ∈ Gamma1' N ↔ ((↑ₘA 0 0 : ℤ) : ZMod N) = 1 ∧ ((↑ₘA 1 1 : ℤ) : ZMod N) = 1 ∧ ((↑ₘA 1 0 : ℤ) : ZMod N) = 0 :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem Gamma1_mem (N : ℕ) (A : SL(2, ℤ)) : A ∈ Gamma1 N ↔ ((↑ₘA 0 0 : ℤ) : ZMod N) = 1 ∧ ((↑ₘA 1 1 : ℤ) : ZMod N) = 1 ∧ ((↑ₘA 1 0 : ℤ) : ZMod N) = 0 :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem Gamma1_in_Gamma0 (N : ℕ) : Gamma1 N ≤ Gamma0 N :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem isCongruenceSubgroup_trans (H K : Subgroup SL(2, ℤ)) (h : H ≤ K) (h2 : IsCongruenceSubgroup H) : IsCongruenceSubgroup K :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem Gamma_is_cong_sub (N : ℕ+) : IsCongruenceSubgroup (Gamma N) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem Gamma1_is_congruence (N : ℕ+) : IsCongruenceSubgroup (Gamma1 N) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem Gamma_cong_eq_self (N : ℕ) (g : ConjAct SL(2, ℤ)) : g • Gamma N = Gamma N :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem conj_cong_is_cong (g : ConjAct SL(2, ℤ)) (Γ : Subgroup SL(2, ℤ)) (h : IsCongruenceSubgroup Γ) : IsCongruenceSubgroup (g • Γ) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem vAdd_width_periodic (N : ℕ) (k n : ℤ) (f : SlashInvariantForm (Gamma N) k) (z : ℍ) : f (((N * n) : ℝ) +ᵥ z) = f z :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem T_zpow_width_invariant (N : ℕ) (k n : ℤ) (f : SlashInvariantForm (Gamma N) k) (z : ℍ) : f (((ModularGroup.T ^ (N * n))) • z) = f z :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem normBound_pos : 0 < normBound abv bS :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem norm_le (a : S) {y : ℤ} (hy : ∀ k, abv (bS.repr a k) ≤ y) : abv (Algebra.norm R a) ≤ normBound abv bS * y ^ Fintype.card ι :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem norm_lt {T : Type*} [LinearOrderedRing T] (a : S) {y : T} (hy : ∀ k, (abv (bS.repr a k) : T) < y) : (abv (Algebra.norm R a) : T) < normBound abv bS * y ^ Fintype.card ι :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem exists_min (I : (Ideal S)⁰) : ∃ b ∈ (I : Ideal S), b ≠ 0 ∧ ∀ c ∈ (I : Ideal S), abv (Algebra.norm R c) < abv (Algebra.norm R b) → c = (0 : S) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem mem_finsetApprox {x : R} : x ∈ finsetApprox bS adm ↔ ∃ i j, i ≠ j ∧ distinctElems bS adm i - distinctElems bS adm j = x :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem exists_mem_finsetApprox (a : S) {b} (hb : b ≠ (0 : R)) : ∃ q : S, ∃ r ∈ finsetApprox bS adm, abv (Algebra.norm R (r • a - b • q)) < abv (Algebra.norm R (algebraMap R S b)) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem exists_mem_finset_approx' [Algebra.IsAlgebraic R L] (a : S) {b : S} (hb : b ≠ 0) : ∃ q : S, ∃ r ∈ finsetApprox bS adm, abv (Algebra.norm R (r • a - q * b)) < abv (Algebra.norm R b) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem prod_finsetApprox_ne_zero : algebraMap R S (∏ m ∈ finsetApprox bS adm, m) ≠ 0 :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem exists_mk0_eq_mk0 [IsDedekindDomain S] [Algebra.IsAlgebraic R L] (I : (Ideal S)⁰) : ∃ J : (Ideal S)⁰, ClassGroup.mk0 I = ClassGroup.mk0 J ∧ algebraMap _ _ (∏ m ∈ finsetApprox bS adm, m) ∈ (J : Ideal S) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem mkMMem_surjective [IsDedekindDomain S] [Algebra.IsAlgebraic R L] : Function.Surjective (ClassGroup.mkMMem bS adm) :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem exists_partition {ι : Type*} [Finite ι] {ε : ℝ} (hε : 0 < ε) {b : R} (hb : b ≠ 0) (A : ι → R) (h : abv.IsAdmissible) : ∃ t : ι → Fin (h.card ε), ∀ i₀ i₁, t i₀ = t i₁ → (abv (A i₁ % b - A i₀ % b) : ℝ) < abv b • ε :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem exists_approx_aux (n : ℕ) (h : abv.IsAdmissible) : ∀ {ε : ℝ} (_hε : 0 < ε) {b : R} (_hb : b ≠ 0) (A : Fin (h.card ε ^ n).succ → Fin n → R), ∃ i₀ i₁, i₀ ≠ i₁ ∧ ∀ k, (abv (A i₁ k % b - A i₀ k % b) : ℝ) < abv b • ε :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem exists_approx {ι : Type*} [Fintype ι] {ε : ℝ} (hε : 0 < ε) {b : R} (hb : b ≠ 0) (h : abv.IsAdmissible) (A : Fin (h.card ε ^ Fintype.card ι).succ → ι → R) : ∃ i₀ i₁, i₀ ≠ i₁ ∧ ∀ k, (abv (A i₁ k % b - A i₀ k % b) : ℝ) < abv b • ε :=", "area": "NumberTheory"} {"task": "t8", "statement": "lemma fermatLastTheoremFor_zero : FermatLastTheoremFor 0 :=", "area": "NumberTheory"} {"task": "t8", "statement": "lemma not_fermatLastTheoremFor_one : ¬ FermatLastTheoremFor 1 :=", "area": "NumberTheory"} {"task": "t8", "statement": "lemma not_fermatLastTheoremFor_two : ¬ FermatLastTheoremFor 2 :=", "area": "NumberTheory"} {"task": "t8", "statement": "lemma FermatLastTheoremWith.mono (hmn : m ∣ n) (hm : FermatLastTheoremWith α m) : FermatLastTheoremWith α n :=", "area": "NumberTheory"} {"task": "t8", "statement": "lemma FermatLastTheoremFor.mono (hmn : m ∣ n) (hm : FermatLastTheoremFor m) : FermatLastTheoremFor n :=", "area": "NumberTheory"} {"task": "t8", "statement": "lemma fermatLastTheoremWith_nat_int_rat_tfae (n : ℕ) : TFAE [FermatLastTheoremWith ℕ n, FermatLastTheoremWith ℤ n, FermatLastTheoremWith ℚ n] :=", "area": "NumberTheory"} {"task": "t8", "statement": "lemma fermatLastTheoremWith_of_fermatLastTheoremWith_coprime {n : ℕ} {R : Type*} [CommSemiring R] [IsDomain R] [DecidableEq R] [NormalizedGCDMonoid R] (hn : ∀ a b c : R, a ≠ 0 → b ≠ 0 → c ≠ 0 → ({a, b, c} : Finset R).gcd id = 1 → a ^ n + b ^ n ≠ c ^ n) : FermatLastTheoremWith R n :=", "area": "NumberTheory"} {"task": "t8", "statement": "lemma dvd_c_of_prime_of_dvd_a_of_dvd_b_of_FLT {n : ℕ} {p : ℤ} (hp : Prime p) {a b c : ℤ} (hpa : p ∣ a) (hpb : p ∣ b) (HF : a ^ n + b ^ n + c ^ n = 0) : p ∣ c :=", "area": "NumberTheory"} {"task": "t8", "statement": "lemma isCoprime_of_gcd_eq_one_of_FLT {n : ℕ} {a b c : ℤ} (Hgcd: Finset.gcd {a, b, c} id = 1) (HF : a ^ n + b ^ n + c ^ n = 0) : IsCoprime a b :=", "area": "NumberTheory"} {"task": "t8", "statement": "theorem mul_aux_left (x1 x2 y : ℕ × K) (H : R K p x1 x2) : mk K p (x1.1 + y.1, (frobenius K p)^[y.1] x1.2 * (frobenius K p)^[x1.1] y.2) = mk K p (x2.1 + y.1, (frobenius K p)^[y.1] x2.2 * (frobenius K p)^[x2.1] y.2) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem mul_aux_right (x y1 y2 : ℕ × K) (H : R K p y1 y2) : mk K p (x.1 + y1.1, (frobenius K p)^[y1.1] x.2 * (frobenius K p)^[x.1] y1.2) = mk K p (x.1 + y2.1, (frobenius K p)^[y2.1] x.2 * (frobenius K p)^[x.1] y2.2) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem add_aux_left (x1 x2 y : ℕ × K) (H : R K p x1 x2) : mk K p (x1.1 + y.1, (frobenius K p)^[y.1] x1.2 + (frobenius K p)^[x1.1] y.2) = mk K p (x2.1 + y.1, (frobenius K p)^[y.1] x2.2 + (frobenius K p)^[x2.1] y.2) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem add_aux_right (x y1 y2 : ℕ × K) (H : R K p y1 y2) : mk K p (x.1 + y1.1, (frobenius K p)^[y1.1] x.2 + (frobenius K p)^[x.1] y1.2) = mk K p (x.1 + y2.1, (frobenius K p)^[y2.1] x.2 + (frobenius K p)^[x.1] y2.2) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem mk_zero (n : ℕ) : mk K p (n, 0) = 0 :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem R.sound (m n : ℕ) (x y : K) (H : (frobenius K p)^[m] x = y) : mk K p (n, x) = mk K p (m + n, y) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem mk_eq_iff (x y : ℕ × K) : mk K p x = mk K p y ↔ ∃ z, (frobenius K p)^[y.1 + z] x.2 = (frobenius K p)^[x.1 + z] y.2 :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem mk_pow (x : ℕ × K) (n : ℕ) : mk K p x ^ n = mk K p (x.1, x.2 ^ n) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem natCast (n x : ℕ) : (x : PerfectClosure K p) = mk K p (n, x) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem intCast (x : ℤ) : (x : PerfectClosure K p) = mk K p (0, x) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem natCast_eq_iff (x y : ℕ) : (x : PerfectClosure K p) = y ↔ (x : K) = y :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem frobenius_mk (x : ℕ × K) : (frobenius (PerfectClosure K p) p : PerfectClosure K p → PerfectClosure K p) (mk K p x) = mk _ _ (x.1, x.2 ^ p) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem iterate_frobenius_mk (n : ℕ) (x : K) : (frobenius (PerfectClosure K p) p)^[n] (mk K p ⟨n, x⟩) = of K p x :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem eq_iff [CommRing K] [IsReduced K] (p : ℕ) [Fact p.Prime] [CharP K p] (x y : ℕ × K) : mk K p x = mk K p y ↔ (frobenius K p)^[y.1] x.2 = (frobenius K p)^[x.1] y.2 :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem ext {σ τ : p.Gal} (h : ∀ x ∈ p.rootSet p.SplittingField, σ x = τ x) : σ = τ :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem mapRoots_bijective [h : Fact (p.Splits (algebraMap F E))] : Function.Bijective (mapRoots p E) :=", "area": "FieldTheory"} {"task": "t8", "statement": "lemma galAction_isPretransitive [Fact (p.Splits (algebraMap F E))] (hp : Irreducible p) : MulAction.IsPretransitive p.Gal (p.rootSet E) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem restrict_smul [Fact (p.Splits (algebraMap F E))] (ϕ : E ≃ₐ[F] E) (x : rootSet p E) : ↑(restrict p E ϕ • x) = ϕ x :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem galActionHom_injective [Fact (p.Splits (algebraMap F E))] : Function.Injective (galActionHom p E) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem restrictDvd_def [Decidable (q = 0)] (hpq : p ∣ q) : restrictDvd hpq = if hq : q = 0 then 1 else @restrict F _ p _ _ _ ⟨splits_of_splits_of_dvd (algebraMap F q.SplittingField) hq (SplittingField.splits q) hpq⟩ :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem restrictDvd_surjective (hpq : p ∣ q) (hq : q ≠ 0) : Function.Surjective (restrictDvd hpq) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem restrictProd_injective : Function.Injective (restrictProd p q) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem mul_splits_in_splittingField_of_mul {p₁ q₁ p₂ q₂ : F[X]} (hq₁ : q₁ ≠ 0) (hq₂ : q₂ ≠ 0) (h₁ : p₁.Splits (algebraMap F q₁.SplittingField)) (h₂ : p₂.Splits (algebraMap F q₂.SplittingField)) : (p₁ * p₂).Splits (algebraMap F (q₁ * q₂).SplittingField) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem splits_in_splittingField_of_comp (hq : q.natDegree ≠ 0) : p.Splits (algebraMap F (p.comp q).SplittingField) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem restrictComp_surjective (hq : q.natDegree ≠ 0) : Function.Surjective (restrictComp p q hq) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem prime_degree_dvd_card [CharZero F] (p_irr : Irreducible p) (p_deg : p.natDegree.Prime) : p.natDegree ∣ Fintype.card p.Gal :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem degree_le_of_ne_zero {p : A[X]} (pnz : p ≠ 0) (hp : Polynomial.aeval x p = 0) : degree (minpoly A x) ≤ degree p :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem unique {p : A[X]} (pmonic : p.Monic) (hp : Polynomial.aeval x p = 0) (pmin : ∀ q : A[X], q.Monic → Polynomial.aeval x q = 0 → degree p ≤ degree q) : p = minpoly A x :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem dvd {p : A[X]} (hp : Polynomial.aeval x p = 0) : minpoly A x ∣ p :=", "area": "FieldTheory"} {"task": "t8", "statement": "lemma dvd_iff {p : A[X]} : minpoly A x ∣ p ↔ Polynomial.aeval x p = 0 :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem isRadical [IsReduced B] : IsRadical (minpoly A x) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem dvd_map_of_isScalarTower (A K : Type*) {R : Type*} [CommRing A] [Field K] [CommRing R] [Algebra A K] [Algebra A R] [Algebra K R] [IsScalarTower A K R] (x : R) : minpoly K x ∣ (minpoly A x).map (algebraMap A K) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem dvd_map_of_isScalarTower' (R : Type*) {S : Type*} (K L : Type*) [CommRing R] [CommRing S] [Field K] [CommRing L] [Algebra R S] [Algebra R K] [Algebra S L] [Algebra K L] [Algebra R L] [IsScalarTower R K L] [IsScalarTower R S L] (s : S) : minpoly K (algebraMap S L s) ∣ map (algebraMap R K) (minpoly R s) :=", "area": "FieldTheory"} {"task": "t8", "statement": "@[simp] lemma ker_aeval_eq_span_minpoly : RingHom.ker (Polynomial.aeval x) = A[X] ∙ minpoly A x :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem eq_of_irreducible [Nontrivial B] {p : A[X]} (hp1 : Irreducible p) (hp2 : Polynomial.aeval x p = 0) : p * C p.leadingCoeff⁻¹ = minpoly A x :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem add_algebraMap {B : Type*} [CommRing B] [Algebra A B] {x : B} (hx : IsIntegral A x) (a : A) : minpoly A (x + algebraMap A B a) = (minpoly A x).comp (X - C a) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem sub_algebraMap {B : Type*} [CommRing B] [Algebra A B] {x : B} (hx : IsIntegral A x) (a : A) : minpoly A (x - algebraMap A B a) = (minpoly A x).comp (X + C a) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem aux_inj_roots_of_min_poly : Injective (rootsOfMinPolyPiType F E K) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem zero : minpoly A (0 : B) = X :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem one : minpoly A (1 : B) = X - 1 :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem prime (hx : IsIntegral A x) : Prime (minpoly A x) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem root {x : B} (hx : IsIntegral A x) {y : A} (h : IsRoot (minpoly A x) y) : algebraMap A B y = x :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem coeff_zero_eq_zero (hx : IsIntegral A x) : coeff (minpoly A x) 0 = 0 ↔ x = 0 :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem coeff_zero_ne_zero (hx : IsIntegral A x) (h : x ≠ 0) : coeff (minpoly A x) 0 ≠ 0 :=", "area": "FieldTheory"} {"task": "t8", "statement": "lemma minpoly_algEquiv_toLinearMap (σ : L ≃ₐ[K] L) (hσ : IsOfFinOrder σ) : minpoly K σ.toLinearMap = X ^ (orderOf σ) - C 1 :=", "area": "FieldTheory"} {"task": "t8", "statement": "lemma minpoly_algHom_toLinearMap (σ : L →ₐ[K] L) (hσ : IsOfFinOrder σ) : minpoly K σ.toLinearMap = X ^ (orderOf σ) - C 1 :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem monic (hx : IsIntegral A x) : Monic (minpoly A x) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem algHom_eq (f : B →ₐ[A] B') (hf : Function.Injective f) (x : B) : minpoly A (f x) = minpoly A x :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem aeval : aeval x (minpoly A x) = 0 :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem aeval_algHom (f : B →ₐ[A] B') (x : B) : (Polynomial.aeval (f x)) (minpoly A x) = 0 :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem ne_one [Nontrivial B] : minpoly A x ≠ 1 :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem map_ne_one [Nontrivial B] {R : Type*} [Semiring R] [Nontrivial R] (f : A →+* R) : (minpoly A x).map f ≠ 1 :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem not_isUnit [Nontrivial B] : ¬IsUnit (minpoly A x) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem mem_range_of_degree_eq_one (hx : (minpoly A x).degree = 1) : x ∈ (algebraMap A B).range :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem min {p : A[X]} (pmonic : p.Monic) (hp : Polynomial.aeval x p = 0) : degree (minpoly A x) ≤ degree p :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem unique' {p : A[X]} (hm : p.Monic) (hp : Polynomial.aeval x p = 0) (hl : ∀ q : A[X], degree q < degree p → q = 0 ∨ Polynomial.aeval x q ≠ 0) : p = minpoly A x :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem subsingleton [Subsingleton B] : minpoly A x = 1 :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem natDegree_pos [Nontrivial B] (hx : IsIntegral A x) : 0 < natDegree (minpoly A x) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem degree_eq_one_iff : (minpoly A x).degree = 1 ↔ x ∈ (algebraMap A B).range :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem natDegree_eq_one_iff : (minpoly A x).natDegree = 1 ↔ x ∈ (algebraMap A B).range :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem two_le_natDegree_iff (int : IsIntegral A x) : 2 ≤ (minpoly A x).natDegree ↔ x ∉ (algebraMap A B).range :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem two_le_natDegree_subalgebra {B} [CommRing B] [Algebra A B] [Nontrivial B] {S : Subalgebra A B} {x : B} (int : IsIntegral S x) : 2 ≤ (minpoly S x).natDegree ↔ x ∉ S :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem eq_X_sub_C_of_algebraMap_inj (a : A) (hf : Function.Injective (algebraMap A B)) : minpoly A (algebraMap A B a) = X - C a :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem aeval_ne_zero_of_dvdNotUnit_minpoly {a : A[X]} (hx : IsIntegral A x) (hamonic : a.Monic) (hdvd : DvdNotUnit a (minpoly A x)) : Polynomial.aeval x a ≠ 0 :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem irreducible (hx : IsIntegral A x) : Irreducible (minpoly A x) :=", "area": "FieldTheory"} {"task": "t8", "statement": "theorem Spec.sheafedSpaceMap_id {R : CommRingCat.{u}} : Spec.sheafedSpaceMap (𝟙 R) = 𝟙 (Spec.sheafedSpaceObj R) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "theorem Spec.sheafedSpaceMap_comp {R S T : CommRingCat.{u}} (f : R ⟶ S) (g : S ⟶ T) : Spec.sheafedSpaceMap (f ≫ g) = Spec.sheafedSpaceMap g ≫ Spec.sheafedSpaceMap f :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "theorem Spec.basicOpen_hom_ext {X : RingedSpace.{u}} {R : CommRingCat.{u}} {α β : X ⟶ Spec.sheafedSpaceObj R} (w : α.base = β.base) (h : ∀ r : R, let U := PrimeSpectrum.basicOpen r (toOpen R U ≫ α.c.app (op U)) ≫ X.presheaf.map (eqToHom (by rw [w])) = toOpen R U ≫ β.c.app (op U)) : α = β :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "theorem stalkMap_toStalk {R S : CommRingCat.{u}} (f : R ⟶ S) (p : PrimeSpectrum S) : toStalk R (PrimeSpectrum.comap f p) ≫ PresheafedSpace.stalkMap (Spec.sheafedSpaceMap f) p = f ≫ toStalk S p :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "theorem localRingHom_comp_stalkIso {R S : CommRingCat.{u}} (f : R ⟶ S) (p : PrimeSpectrum S) : (stalkIso R (PrimeSpectrum.comap f p)).hom ≫ @CategoryStruct.comp _ _ (CommRingCat.of (Localization.AtPrime (PrimeSpectrum.comap f p).asIdeal)) (CommRingCat.of (Localization.AtPrime p.asIdeal)) _ (Localization.localRingHom (PrimeSpectrum.comap f p).asIdeal p.asIdeal f rfl) (stalkIso S p).inv = PresheafedSpace.stalkMap (Spec.sheafedSpaceMap f) p :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "theorem Spec.locallyRingedSpaceMap_id (R : CommRingCat.{u}) : Spec.locallyRingedSpaceMap (𝟙 R) = 𝟙 (Spec.locallyRingedSpaceObj R) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "theorem Spec.locallyRingedSpaceMap_comp {R S T : CommRingCat.{u}} (f : R ⟶ S) (g : S ⟶ T) : Spec.locallyRingedSpaceMap (f ≫ g) = Spec.locallyRingedSpaceMap g ≫ Spec.locallyRingedSpaceMap f :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "theorem Spec_Γ_naturality {R S : CommRingCat.{u}} (f : R ⟶ S) : f ≫ toSpecΓ S = toSpecΓ R ≫ Γ.map (Spec.toLocallyRingedSpace.map f.op).op :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "theorem Spec_map_localization_isIso (R : CommRingCat.{u}) (M : Submonoid R) (x : PrimeSpectrum (Localization M)) : IsIso (PresheafedSpace.stalkMap (Spec.toPresheafedSpace.map (CommRingCat.ofHom (algebraMap R (Localization M))).op) x) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "theorem toPushforwardStalk_comp : f ≫ StructureSheaf.toPushforwardStalk f p = StructureSheaf.toStalk R p ≫ (TopCat.Presheaf.stalkFunctor _ _).map (Spec.sheafedSpaceMap f).c :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "theorem isLocalizedModule_toPushforwardStalkAlgHom_aux (y) : ∃ x : S × p.asIdeal.primeCompl, x.2 • y = toPushforwardStalkAlgHom R S p x.1 :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma polynomial_eq : W.polynomial = Cubic.toPoly ⟨0, 1, Cubic.toPoly ⟨0, 0, W.a₁, W.a₃⟩, Cubic.toPoly ⟨-1, -W.a₂, -W.a₄, -W.a₆⟩⟩ :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma polynomial_ne_zero [Nontrivial R] : W.polynomial ≠ 0 :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "@[simp] lemma degree_polynomial [Nontrivial R] : W.polynomial.degree = 2 :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "@[simp] lemma natDegree_polynomial [Nontrivial R] : W.polynomial.natDegree = 2 :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma monic_polynomial : W.polynomial.Monic :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma irreducible_polynomial [IsDomain R] : Irreducible W.polynomial :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma evalEval_polynomial (x y : R) : W.polynomial.evalEval x y = y ^ 2 + W.a₁ * x * y + W.a₃ * y - (x ^ 3 + W.a₂ * x ^ 2 + W.a₄ * x + W.a₆) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "@[simp] lemma evalEval_polynomial_zero : W.polynomial.evalEval 0 0 = -W.a₆ :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma equation_iff' (x y : R) : W.Equation x y ↔ y ^ 2 + W.a₁ * x * y + W.a₃ * y - (x ^ 3 + W.a₂ * x ^ 2 + W.a₄ * x + W.a₆) = 0 :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma equation_iff (x y : R) : W.Equation x y ↔ y ^ 2 + W.a₁ * x * y + W.a₃ * y = x ^ 3 + W.a₂ * x ^ 2 + W.a₄ * x + W.a₆ :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "@[simp] lemma equation_zero : W.Equation 0 0 ↔ W.a₆ = 0 :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma equation_iff_variableChange (x y : R) : W.Equation x y ↔ (W.variableChange ⟨1, x, 0, y⟩).toAffine.Equation 0 0 :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma evalEval_polynomialX (x y : R) : W.polynomialX.evalEval x y = W.a₁ * y - (3 * x ^ 2 + 2 * W.a₂ * x + W.a₄) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "@[simp] lemma evalEval_polynomialX_zero : W.polynomialX.evalEval 0 0 = -W.a₄ :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma evalEval_polynomialY (x y : R) : W.polynomialY.evalEval x y = 2 * y + W.a₁ * x + W.a₃ :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "@[simp] lemma evalEval_polynomialY_zero : W.polynomialY.evalEval 0 0 = W.a₃ :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma nonsingular_iff' (x y : R) : W.Nonsingular x y ↔ W.Equation x y ∧ (W.a₁ * y - (3 * x ^ 2 + 2 * W.a₂ * x + W.a₄) ≠ 0 ∨ 2 * y + W.a₁ * x + W.a₃ ≠ 0) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma nonsingular_iff (x y : R) : W.Nonsingular x y ↔ W.Equation x y ∧ (W.a₁ * y ≠ 3 * x ^ 2 + 2 * W.a₂ * x + W.a₄ ∨ y ≠ -y - W.a₁ * x - W.a₃) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "@[simp] lemma nonsingular_zero : W.Nonsingular 0 0 ↔ W.a₆ = 0 ∧ (W.a₃ ≠ 0 ∨ W.a₄ ≠ 0) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma nonsingular_iff_variableChange (x y : R) : W.Nonsingular x y ↔ (W.variableChange ⟨1, x, 0, y⟩).toAffine.Nonsingular 0 0 :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma nonsingular_zero_of_Δ_ne_zero (h : W.Equation 0 0) (hΔ : W.Δ ≠ 0) : W.Nonsingular 0 0 :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma nonsingular_of_Δ_ne_zero {x y : R} (h : W.Equation x y) (hΔ : W.Δ ≠ 0) : W.Nonsingular x y :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma Y_sub_polynomialY : Y - W.polynomialY = W.negPolynomial :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma Y_sub_negPolynomial : Y - W.negPolynomial = W.polynomialY :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma negY_negY (x y : R) : W.negY x (W.negY x y) = y :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma eval_negPolynomial (x y : R) : W.negPolynomial.evalEval x y = W.negY x y :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma C_addPolynomial (x y L : R) : C (W.addPolynomial x y L) = (Y - C (linePolynomial x y L)) * (W.negPolynomial - C (linePolynomial x y L)) + W.polynomial :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma addPolynomial_eq (x y L : R) : W.addPolynomial x y L = -Cubic.toPoly ⟨1, -L ^ 2 - W.a₁ * L + W.a₂, 2 * x * L ^ 2 + (W.a₁ * x - 2 * y - W.a₃) * L + (-W.a₁ * y + W.a₄), -x ^ 2 * L ^ 2 + (2 * x * y + W.a₃ * x) * L - (y ^ 2 + W.a₃ * y - W.a₆)⟩ :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma equation_neg_iff (x y : R) : W.Equation x (W.negY x y) ↔ W.Equation x y :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma nonsingular_neg_iff (x y : R) : W.Nonsingular x (W.negY x y) ↔ W.Nonsingular x y :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma equation_add_iff (x₁ x₂ y₁ L : R) : W.Equation (W.addX x₁ x₂ L) (W.negAddY x₁ x₂ y₁ L) ↔ (W.addPolynomial x₁ y₁ L).eval (W.addX x₁ x₂ L) = 0 :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma nonsingular_negAdd_of_eval_derivative_ne_zero {x₁ x₂ y₁ L : R} (hx' : W.Equation (W.addX x₁ x₂ L) (W.negAddY x₁ x₂ y₁ L)) (hx : (W.addPolynomial x₁ y₁ L).derivative.eval (W.addX x₁ x₂ L) ≠ 0) : W.Nonsingular (W.addX x₁ x₂ L) (W.negAddY x₁ x₂ y₁ L) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "@[simp] lemma slope_of_Y_eq {x₁ x₂ y₁ y₂ : F} (hx : x₁ = x₂) (hy : y₁ = W.negY x₂ y₂) : W.slope x₁ x₂ y₁ y₂ = 0 :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "@[simp] lemma slope_of_Y_ne {x₁ x₂ y₁ y₂ : F} (hx : x₁ = x₂) (hy : y₁ ≠ W.negY x₂ y₂) : W.slope x₁ x₂ y₁ y₂ = (3 * x₁ ^ 2 + 2 * W.a₂ * x₁ + W.a₄ - W.a₁ * y₁) / (y₁ - W.negY x₁ y₁) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "@[simp] lemma slope_of_X_ne {x₁ x₂ y₁ y₂ : F} (hx : x₁ ≠ x₂) : W.slope x₁ x₂ y₁ y₂ = (y₁ - y₂) / (x₁ - x₂) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma slope_of_Y_ne_eq_eval {x₁ x₂ y₁ y₂ : F} (hx : x₁ = x₂) (hy : y₁ ≠ W.negY x₂ y₂) : W.slope x₁ x₂ y₁ y₂ = -W.polynomialX.evalEval x₁ y₁ / W.polynomialY.evalEval x₁ y₁ :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma Y_eq_of_X_eq {x₁ x₂ y₁ y₂ : F} (h₁ : W.Equation x₁ y₁) (h₂ : W.Equation x₂ y₂) (hx : x₁ = x₂) : y₁ = y₂ ∨ y₁ = W.negY x₂ y₂ :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma addPolynomial_slope {x₁ x₂ y₁ y₂ : F} (h₁ : W.Equation x₁ y₁) (h₂ : W.Equation x₂ y₂) (hxy : x₁ = x₂ → y₁ ≠ W.negY x₂ y₂) : W.addPolynomial x₁ y₁ (W.slope x₁ x₂ y₁ y₂) = -((X - C x₁) * (X - C x₂) * (X - C (W.addX x₁ x₂ <| W.slope x₁ x₂ y₁ y₂))) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma equation_negAdd {x₁ x₂ y₁ y₂ : F} (h₁ : W.Equation x₁ y₁) (h₂ : W.Equation x₂ y₂) (hxy : x₁ = x₂ → y₁ ≠ W.negY x₂ y₂) : W.Equation (W.addX x₁ x₂ <| W.slope x₁ x₂ y₁ y₂) (W.negAddY x₁ x₂ y₁ <| W.slope x₁ x₂ y₁ y₂) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma derivative_addPolynomial_slope {x₁ x₂ y₁ y₂ : F} (h₁ : W.Equation x₁ y₁) (h₂ : W.Equation x₂ y₂) (hxy : x₁ = x₂ → y₁ ≠ W.negY x₂ y₂) : derivative (W.addPolynomial x₁ y₁ <| W.slope x₁ x₂ y₁ y₂) = -((X - C x₁) * (X - C x₂) + (X - C x₁) * (X - C (W.addX x₁ x₂ <| W.slope x₁ x₂ y₁ y₂)) + (X - C x₂) * (X - C (W.addX x₁ x₂ <| W.slope x₁ x₂ y₁ y₂))) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma nonsingular_negAdd {x₁ x₂ y₁ y₂ : F} (h₁ : W.Nonsingular x₁ y₁) (h₂ : W.Nonsingular x₂ y₂) (hxy : x₁ = x₂ → y₁ ≠ W.negY x₂ y₂) : W.Nonsingular (W.addX x₁ x₂ <| W.slope x₁ x₂ y₁ y₂) (W.negAddY x₁ x₂ y₁ <| W.slope x₁ x₂ y₁ y₂) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma addX_eq_addX_negY_sub : W.addX x₁ x₂ (W.slope x₁ x₂ y₁ y₂) = W.addX x₁ x₂ (W.slope x₁ x₂ y₁ (W.negY x₂ y₂)) - (y₁ - W.negY x₁ y₁) * (y₂ - W.negY x₂ y₂) / (x₂ - x₁) ^ 2 :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma cyclic_sum_Y_mul_X_sub_X : letI x₃ := W.addX x₁ x₂ (W.slope x₁ x₂ y₁ y₂) y₁ * (x₂ - x₃) + y₂ * (x₃ - x₁) + W.negAddY x₁ x₂ y₁ (W.slope x₁ x₂ y₁ y₂) * (x₁ - x₂) = 0 :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma addY_sub_negY_addY : letI x₃ := W.addX x₁ x₂ (W.slope x₁ x₂ y₁ y₂) letI y₃ := W.addY x₁ x₂ y₁ (W.slope x₁ x₂ y₁ y₂) y₃ - W.negY x₃ y₃ = ((y₂ - W.negY x₂ y₂) * (x₁ - x₃) - (y₁ - W.negY x₁ y₁) * (x₂ - x₃)) / (x₂ - x₁) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma some_ne_zero {x y : R} (h : W.Nonsingular x y) : some h ≠ 0 :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "@[simp] lemma add_of_Y_eq {x₁ x₂ y₁ y₂ : F} {h₁ : W.Nonsingular x₁ y₁} {h₂ : W.Nonsingular x₂ y₂} (hx : x₁ = x₂) (hy : y₁ = W.negY x₂ y₂) : some h₁ + some h₂ = 0 :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma map_polynomial : (W.map f).toAffine.polynomial = W.polynomial.map (mapRingHom f) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma evalEval_baseChange_polynomial_X_Y : (W.baseChange R[X][Y]).toAffine.polynomial.evalEval (C X) Y = W.polynomial :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma Equation.map {x y : R} (h : W.Equation x y) : Equation (W.map f) (f x) (f y) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma map_equation (hf : Function.Injective f) (x y : R) : (W.map f).toAffine.Equation (f x) (f y) ↔ W.Equation x y :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma map_polynomialX : (W.map f).toAffine.polynomialX = W.polynomialX.map (mapRingHom f) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma map_polynomialY : (W.map f).toAffine.polynomialY = W.polynomialY.map (mapRingHom f) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma map_nonsingular (hf : Function.Injective f) (x y : R) : (W.map f).toAffine.Nonsingular (f x) (f y) ↔ W.Nonsingular x y :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma map_negPolynomial : (W.map f).toAffine.negPolynomial = W.negPolynomial.map (mapRingHom f) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma map_negY (x y : R) : (W.map f).toAffine.negY (f x) (f y) = f (W.negY x y) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma map_linePolynomial (x y L : R) : linePolynomial (f x) (f y) (f L) = (linePolynomial x y L).map f :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma map_addPolynomial (x y L : R) : (W.map f).toAffine.addPolynomial (f x) (f y) (f L) = (W.addPolynomial x y L).map f :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma map_addX (x₁ x₂ L : R) : (W.map f).toAffine.addX (f x₁) (f x₂) (f L) = f (W.addX x₁ x₂ L) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma map_negAddY (x₁ x₂ y₁ L : R) : (W.map f).toAffine.negAddY (f x₁) (f x₂) (f y₁) (f L) = f (W.negAddY x₁ x₂ y₁ L) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma map_addY (x₁ x₂ y₁ L : R) : (W.map f).toAffine.addY (f x₁) (f x₂) (f y₁) (f L) = f (W.toAffine.addY x₁ x₂ y₁ L) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma map_slope {F : Type u} [Field F] (W : Affine F) {K : Type v} [Field K] (f : F →+* K) (x₁ x₂ y₁ y₂ : F) : (W.map f).toAffine.slope (f x₁) (f x₂) (f y₁) (f y₂) = f (W.slope x₁ x₂ y₁ y₂) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma baseChange_polynomial : (W.baseChange B).toAffine.polynomial = (W.baseChange A).toAffine.polynomial.map (mapRingHom f) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma baseChange_equation (hf : Function.Injective f) (x y : A) : (W.baseChange B).toAffine.Equation (f x) (f y) ↔ (W.baseChange A).toAffine.Equation x y :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma baseChange_polynomialX : (W.baseChange B).toAffine.polynomialX = (W.baseChange A).toAffine.polynomialX.map (mapRingHom f) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma baseChange_polynomialY : (W.baseChange B).toAffine.polynomialY = (W.baseChange A).toAffine.polynomialY.map (mapRingHom f) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma baseChange_nonsingular (hf : Function.Injective f) (x y : A) : (W.baseChange B).toAffine.Nonsingular (f x) (f y) ↔ (W.baseChange A).toAffine.Nonsingular x y :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma baseChange_negPolynomial : (W.baseChange B).toAffine.negPolynomial = (W.baseChange A).toAffine.negPolynomial.map (mapRingHom f) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma baseChange_negY (x y : A) : (W.baseChange B).toAffine.negY (f x) (f y) = f ((W.baseChange A).toAffine.negY x y) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma baseChange_addPolynomial (x y L : A) : (W.baseChange B).toAffine.addPolynomial (f x) (f y) (f L) = ((W.baseChange A).toAffine.addPolynomial x y L).map f :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma baseChange_addX (x₁ x₂ L : A) : (W.baseChange B).toAffine.addX (f x₁) (f x₂) (f L) = f ((W.baseChange A).toAffine.addX x₁ x₂ L) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma baseChange_negAddY (x₁ x₂ y₁ L : A) : (W.baseChange B).toAffine.negAddY (f x₁) (f x₂) (f y₁) (f L) = f ((W.baseChange A).toAffine.negAddY x₁ x₂ y₁ L) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma baseChange_addY (x₁ x₂ y₁ L : A) : (W.baseChange B).toAffine.addY (f x₁) (f x₂) (f y₁) (f L) = f ((W.baseChange A).toAffine.addY x₁ x₂ y₁ L) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma baseChange_slope (x₁ x₂ y₁ y₂ : F) : (W.baseChange K).toAffine.slope (f x₁) (f x₂) (f y₁) (f y₂) = f ((W.baseChange F).toAffine.slope x₁ x₂ y₁ y₂) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma map_id (P : W⟮F⟯) : map W (Algebra.ofId F F) P = P :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma map_map (P : W⟮F⟯) : map W g (map W f P) = map W (g.comp f) P :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma map_injective : Function.Injective <| map W f :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma map_baseChange [Algebra F K] [IsScalarTower R F K] [Algebra F L] [IsScalarTower R F L] (f : K →ₐ[F] L) (P : W⟮F⟯) : map W f (baseChange W F K P) = baseChange W F L P :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma zariskiTopology_openCover {Y : Scheme.{u}} (U : OpenCover.{v} Y) : zariskiTopology Y (Sieve.generate (Presieve.ofArrows U.obj U.map)) :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "lemma subcanonical_zariskiTopology : Sheaf.Subcanonical zariskiTopology :=", "area": "AlgebraicGeometry"} {"task": "t8", "statement": "theorem ρ_one {G : MonCat.{u}} (A : Action V G) : A.ρ 1 = 𝟙 A.V :=", "area": "RepresentationTheory"} {"task": "t8", "statement": "theorem Iso.conj_ρ {M N : Action V G} (f : M ≅ N) (g : G) : N.ρ g = ((forget V G).mapIso f).conj (M.ρ g) :=", "area": "RepresentationTheory"} {"task": "t8", "statement": "theorem Function.Embedding.toEquivRange_symm_apply_self (a : α) : f.toEquivRange.symm ⟨f a, Set.mem_range_self a⟩ = a :=", "area": "Logic"} {"task": "t8", "statement": "theorem Function.Embedding.toEquivRange_eq_ofInjective : f.toEquivRange = Equiv.ofInjective f f.injective :=", "area": "Logic"} {"task": "t8", "statement": "theorem Equiv.Perm.viaFintypeEmbedding_apply_image (a : α) : e.viaFintypeEmbedding f (f a) = f (e a) :=", "area": "Logic"} {"task": "t8", "statement": "theorem Equiv.Perm.viaFintypeEmbedding_apply_mem_range {b : β} (h : b ∈ Set.range f) : e.viaFintypeEmbedding f b = f (e (f.invOfMemRange ⟨b, h⟩)) :=", "area": "Logic"} {"task": "t8", "statement": "theorem Equiv.Perm.viaFintypeEmbedding_apply_not_mem_range {b : β} (h : b ∉ Set.range f) : e.viaFintypeEmbedding f b = b :=", "area": "Logic"} {"task": "t8", "statement": "theorem Equiv.Perm.viaFintypeEmbedding_sign [DecidableEq α] [Fintype β] : Equiv.Perm.sign (e.viaFintypeEmbedding f) = Equiv.Perm.sign e :=", "area": "Logic"} {"task": "t8", "statement": "theorem extendSubtype_apply_of_mem (e : { x // p x } ≃ { x // q x }) (x) (hx : p x) : e.extendSubtype x = e ⟨x, hx⟩ :=", "area": "Logic"} {"task": "t8", "statement": "theorem extendSubtype_mem (e : { x // p x } ≃ { x // q x }) (x) (hx : p x) : q (e.extendSubtype x) :=", "area": "Logic"} {"task": "t8", "statement": "theorem extendSubtype_apply_of_not_mem (e : { x // p x } ≃ { x // q x }) (x) (hx : ¬p x) : e.extendSubtype x = e.toCompl ⟨x, hx⟩ :=", "area": "Logic"} {"task": "t8", "statement": "theorem extendSubtype_not_mem (e : { x // p x } ≃ { x // q x }) (x) (hx : ¬p x) : ¬q (e.extendSubtype x) :=", "area": "Logic"} {"task": "t8", "statement": "theorem eq_symm_apply {x : α} {y : β} (hx : x ∈ e.source) (hy : y ∈ e.target) : x = e.symm y ↔ e x = y :=", "area": "Logic"} {"task": "t8", "statement": "theorem copy_eq (e : PartialEquiv α β) (f : α → β) (hf : ⇑e = f) (g : β → α) (hg : ⇑e.symm = g) (s : Set α) (hs : e.source = s) (t : Set β) (ht : e.target = t) : e.copy f hf g hg s hs t ht = e :=", "area": "Logic"} {"task": "t8", "statement": "theorem symm_symm : e.symm.symm = e :=", "area": "Logic"} {"task": "t8", "statement": "theorem forall_mem_target {p : β → Prop} : (∀ y ∈ e.target, p y) ↔ ∀ x ∈ e.source, p (e x) :=", "area": "Logic"} {"task": "t8", "statement": "theorem exists_mem_target {p : β → Prop} : (∃ y ∈ e.target, p y) ↔ ∃ x ∈ e.source, p (e x) :=", "area": "Logic"} {"task": "t8", "statement": "theorem symm_apply_mem_iff (h : e.IsImage s t) : ∀ ⦃y⦄, y ∈ e.target → (e.symm y ∈ s ↔ y ∈ t) :=", "area": "Logic"} {"task": "t8", "statement": "theorem iff_preimage_eq : e.IsImage s t ↔ e.source ∩ e ⁻¹' t = e.source ∩ s :=", "area": "Logic"} {"task": "t8", "statement": "theorem leftInvOn_piecewise {e' : PartialEquiv α β} [∀ i, Decidable (i ∈ s)] [∀ i, Decidable (i ∈ t)] (h : e.IsImage s t) (h' : e'.IsImage s t) : LeftInvOn (t.piecewise e.symm e'.symm) (s.piecewise e e') (s.ite e.source e'.source) :=", "area": "Logic"} {"task": "t8", "statement": "theorem inter_eq_of_inter_eq_of_eqOn {e' : PartialEquiv α β} (h : e.IsImage s t) (h' : e'.IsImage s t) (hs : e.source ∩ s = e'.source ∩ s) (heq : EqOn e e' (e.source ∩ s)) : e.target ∩ t = e'.target ∩ t :=", "area": "Logic"} {"task": "t8", "statement": "theorem symm_eq_on_of_inter_eq_of_eqOn {e' : PartialEquiv α β} (h : e.IsImage s t) (hs : e.source ∩ s = e'.source ∩ s) (heq : EqOn e e' (e.source ∩ s)) : EqOn e.symm e'.symm (e.target ∩ t) :=", "area": "Logic"} {"task": "t8", "statement": "theorem isImage_source_target : e.IsImage e.source e.target :=", "area": "Logic"} {"task": "t8", "statement": "theorem isImage_source_target_of_disjoint (e' : PartialEquiv α β) (hs : Disjoint e.source e'.source) (ht : Disjoint e.target e'.target) : e.IsImage e'.source e'.target :=", "area": "Logic"} {"task": "t8", "statement": "theorem image_source_inter_eq' (s : Set α) : e '' (e.source ∩ s) = e.target ∩ e.symm ⁻¹' s :=", "area": "Logic"} {"task": "t8", "statement": "theorem image_source_inter_eq (s : Set α) : e '' (e.source ∩ s) = e.target ∩ e.symm ⁻¹' (e.source ∩ s) :=", "area": "Logic"} {"task": "t8", "statement": "theorem image_eq_target_inter_inv_preimage {s : Set α} (h : s ⊆ e.source) : e '' s = e.target ∩ e.symm ⁻¹' s :=", "area": "Logic"} {"task": "t8", "statement": "theorem source_inter_preimage_inv_preimage (s : Set α) : e.source ∩ e ⁻¹' (e.symm ⁻¹' s) = e.source ∩ s :=", "area": "Logic"} {"task": "t8", "statement": "theorem ext {e e' : PartialEquiv α β} (h : ∀ x, e x = e' x) (hsymm : ∀ x, e.symm x = e'.symm x) (hs : e.source = e'.source) : e = e' :=", "area": "Logic"} {"task": "t8", "statement": "theorem restr_eq_of_source_subset {e : PartialEquiv α β} {s : Set α} (h : e.source ⊆ s) : e.restr s = e :=", "area": "Logic"} {"task": "t8", "statement": "theorem refl_restr_source (s : Set α) : ((PartialEquiv.refl α).restr s).source = s :=", "area": "Logic"} {"task": "t8", "statement": "theorem refl_restr_target (s : Set α) : ((PartialEquiv.refl α).restr s).target = s :=", "area": "Logic"} {"task": "t8", "statement": "theorem trans_symm_eq_symm_trans_symm : (e.trans e').symm = e'.symm.trans e.symm :=", "area": "Logic"} {"task": "t8", "statement": "theorem trans_source' : (e.trans e').source = e.source ∩ e ⁻¹' (e.target ∩ e'.source) :=", "area": "Logic"} {"task": "t8", "statement": "theorem trans_source'' : (e.trans e').source = e.symm '' (e.target ∩ e'.source) :=", "area": "Logic"} {"task": "t8", "statement": "theorem trans_assoc (e'' : PartialEquiv γ δ) : (e.trans e').trans e'' = e.trans (e'.trans e'') :=", "area": "Logic"} {"task": "t8", "statement": "theorem trans_refl : e.trans (PartialEquiv.refl β) = e :=", "area": "Logic"} {"task": "t8", "statement": "theorem refl_trans : (PartialEquiv.refl α).trans e = e :=", "area": "Logic"} {"task": "t8", "statement": "theorem trans_refl_restr (s : Set β) : e.trans ((PartialEquiv.refl β).restr s) = e.restr (e ⁻¹' s) :=", "area": "Logic"} {"task": "t8", "statement": "theorem trans_refl_restr' (s : Set β) : e.trans ((PartialEquiv.refl β).restr s) = e.restr (e.source ∩ e ⁻¹' s) :=", "area": "Logic"} {"task": "t8", "statement": "theorem restr_trans (s : Set α) : (e.restr s).trans e' = (e.trans e').restr s :=", "area": "Logic"} {"task": "t8", "statement": "theorem mem_symm_trans_source {e' : PartialEquiv α γ} {x : α} (he : x ∈ e.source) (he' : x ∈ e'.source) : e x ∈ (e.symm.trans e').source :=", "area": "Logic"} {"task": "t8", "statement": "theorem EqOnSource.target_eq {e e' : PartialEquiv α β} (h : e ≈ e') : e.target = e'.target :=", "area": "Logic"} {"task": "t8", "statement": "theorem EqOnSource.symm' {e e' : PartialEquiv α β} (h : e ≈ e') : e.symm ≈ e'.symm :=", "area": "Logic"} {"task": "t8", "statement": "theorem EqOnSource.trans' {e e' : PartialEquiv α β} {f f' : PartialEquiv β γ} (he : e ≈ e') (hf : f ≈ f') : e.trans f ≈ e'.trans f' :=", "area": "Logic"} {"task": "t8", "statement": "theorem EqOnSource.restr {e e' : PartialEquiv α β} (he : e ≈ e') (s : Set α) : e.restr s ≈ e'.restr s :=", "area": "Logic"} {"task": "t8", "statement": "theorem EqOnSource.source_inter_preimage_eq {e e' : PartialEquiv α β} (he : e ≈ e') (s : Set β) : e.source ∩ e ⁻¹' s = e'.source ∩ e' ⁻¹' s :=", "area": "Logic"} {"task": "t8", "statement": "theorem self_trans_symm : e.trans e.symm ≈ ofSet e.source :=", "area": "Logic"} {"task": "t8", "statement": "theorem eq_of_eqOnSource_univ (e e' : PartialEquiv α β) (h : e ≈ e') (s : e.source = univ) (t : e.target = univ) : e = e' :=", "area": "Logic"} {"task": "t8", "statement": "theorem prod_symm (e : PartialEquiv α β) (e' : PartialEquiv γ δ) : (e.prod e').symm = e.symm.prod e'.symm :=", "area": "Logic"} {"task": "t8", "statement": "theorem refl_prod_refl : (PartialEquiv.refl α).prod (PartialEquiv.refl β) = PartialEquiv.refl (α × β) :=", "area": "Logic"} {"task": "t8", "statement": "theorem prod_trans {η : Type*} {ε : Type*} (e : PartialEquiv α β) (f : PartialEquiv β γ) (e' : PartialEquiv δ η) (f' : PartialEquiv η ε) : (e.prod e').trans (f.prod f') = (e.trans f).prod (e'.trans f') :=", "area": "Logic"} {"task": "t8", "statement": "theorem pi_refl : (PartialEquiv.pi fun i ↦ PartialEquiv.refl (αi i)) = .refl (∀ i, αi i) :=", "area": "Logic"} {"task": "t8", "statement": "theorem pi_trans (ei : ∀ i, PartialEquiv (αi i) (βi i)) (ei' : ∀ i, PartialEquiv (βi i) (γi i)) : (PartialEquiv.pi ei).trans (PartialEquiv.pi ei') = .pi fun i ↦ (ei i).trans (ei' i) :=", "area": "Logic"} {"task": "t8", "statement": "theorem trans_toPartialEquiv : (e.trans e').toPartialEquiv = e.toPartialEquiv.trans e'.toPartialEquiv :=", "area": "Logic"} {"task": "t8", "statement": "theorem transPartialEquiv_trans (e : α ≃ β) (f' : PartialEquiv β γ) (f'' : PartialEquiv γ δ) : (e.transPartialEquiv f').trans f'' = e.transPartialEquiv (f'.trans f'') :=", "area": "Logic"} {"task": "t8", "statement": "theorem trans_transPartialEquiv (e : α ≃ β) (e' : β ≃ γ) (f'' : PartialEquiv γ δ) : (e.trans e').transPartialEquiv f'' = e.transPartialEquiv (e'.transPartialEquiv f'') :=", "area": "Logic"} {"task": "t8", "statement": "theorem transEquiv_transEquiv (e : PartialEquiv α β) (f' : β ≃ γ) (f'' : γ ≃ δ) : (e.transEquiv f').transEquiv f'' = e.transEquiv (f'.trans f'') :=", "area": "Logic"} {"task": "t8", "statement": "theorem trans_transEquiv (e : PartialEquiv α β) (e' : PartialEquiv β γ) (f'' : γ ≃ δ) : (e.trans e').transEquiv f'' = e.trans (e'.transEquiv f'') :=", "area": "Logic"} {"task": "t8", "statement": "theorem sumCongr_trans (e : α₁ ≃ β₁) (f : α₂ ≃ β₂) (g : β₁ ≃ γ₁) (h : β₂ ≃ γ₂) : (Equiv.sumCongr e f).trans (Equiv.sumCongr g h) = Equiv.sumCongr (e.trans g) (f.trans h) :=", "area": "Logic"} {"task": "t8", "statement": "theorem sumCongr_refl : Equiv.sumCongr (Equiv.refl α) (Equiv.refl β) = Equiv.refl (Sum α β) :=", "area": "Logic"} {"task": "t8", "statement": "theorem Perm.subtypeCongr.apply (a : ε) : ep.subtypeCongr en a = if h : p a then (ep ⟨a, h⟩ : ε) else en ⟨a, h⟩ :=", "area": "Logic"} {"task": "t8", "statement": "theorem Perm.subtypeCongr.left_apply {a : ε} (h : p a) : ep.subtypeCongr en a = ep ⟨a, h⟩ :=", "area": "Logic"} {"task": "t8", "statement": "theorem Perm.subtypeCongr.right_apply {a : ε} (h : ¬p a) : ep.subtypeCongr en a = en ⟨a, h⟩ :=", "area": "Logic"} {"task": "t8", "statement": "theorem Perm.subtypeCongr.refl : Perm.subtypeCongr (Equiv.refl { a // p a }) (Equiv.refl { a // ¬p a }) = Equiv.refl ε :=", "area": "Logic"} {"task": "t8", "statement": "theorem Perm.subtypeCongr.symm : (ep.subtypeCongr en).symm = Perm.subtypeCongr ep.symm en.symm :=", "area": "Logic"} {"task": "t8", "statement": "theorem Perm.subtypeCongr.trans : (ep.subtypeCongr en).trans (ep'.subtypeCongr en') = Perm.subtypeCongr (ep.trans ep') (en.trans en') :=", "area": "Logic"} {"task": "t8", "statement": "theorem prodCongr_refl_right (e : β₁ ≃ β₂) : prodCongr e (Equiv.refl α₁) = prodCongrLeft fun _ => e :=", "area": "Logic"} {"task": "t8", "statement": "theorem prodCongr_refl_left (e : β₁ ≃ β₂) : prodCongr (Equiv.refl α₁) e = prodCongrRight fun _ => e :=", "area": "Logic"} {"task": "t8", "statement": "theorem prodCongrLeft_trans_prodComm : (prodCongrLeft e).trans (prodComm _ _) = (prodComm _ _).trans (prodCongrRight e) :=", "area": "Logic"} {"task": "t8", "statement": "theorem prodCongrRight_trans_prodComm : (prodCongrRight e).trans (prodComm _ _) = (prodComm _ _).trans (prodCongrLeft e) :=", "area": "Logic"} {"task": "t8", "statement": "theorem sigmaCongrRight_sigmaEquivProd : (sigmaCongrRight e).trans (sigmaEquivProd α₁ β₂) = (sigmaEquivProd α₁ β₁).trans (prodCongrRight e) :=", "area": "Logic"} {"task": "t8", "statement": "theorem sigmaEquivProd_sigmaCongrRight : (sigmaEquivProd α₁ β₁).symm.trans (sigmaCongrRight e) = (prodCongrRight e).trans (sigmaEquivProd α₁ β₂).symm :=", "area": "Logic"} {"task": "t8", "statement": "theorem eq_of_prodExtendRight_ne {e : Perm β₁} {a a' : α₁} {b : β₁} (h : prodExtendRight a e (a', b) ≠ (a', b)) : a' = a :=", "area": "Logic"} {"task": "t8", "statement": "theorem fst_prodExtendRight (ab : α₁ × β₁) : (prodExtendRight a e ab).fst = ab.fst :=", "area": "Logic"} {"task": "t8", "statement": "theorem subtypeEquiv_refl {p : α → Prop} (h : ∀ a, p a ↔ p (Equiv.refl _ a) := fun a => Iff.rfl) : (Equiv.refl α).subtypeEquiv h = Equiv.refl { a : α // p a } :=", "area": "Logic"} {"task": "t8", "statement": "theorem subtypeEquiv_symm {p : α → Prop} {q : β → Prop} (e : α ≃ β) (h : ∀ a : α, p a ↔ q (e a)) : (e.subtypeEquiv h).symm = e.symm.subtypeEquiv fun a => by convert (h <| e.symm a).symm exact (e.apply_symm_apply a).symm :=", "area": "Logic"} {"task": "t8", "statement": "theorem coe_subtypeEquivCodomain_symm (f : { x' // x' ≠ x } → Y) : ((subtypeEquivCodomain f).symm : Y → _) = fun y => ⟨fun x' => if h : x' ≠ x then f ⟨x', h⟩ else y, by funext x' simp only [ne_eq, dite_not, comp_apply, Subtype.coe_eta, dite_eq_ite, ite_eq_right_iff] intro w exfalso exact x'.property w⟩ :=", "area": "Logic"} {"task": "t8", "statement": "theorem Perm.extendDomain_apply_image (a : α') : e.extendDomain f (f a) = f (e a) :=", "area": "Logic"} {"task": "t8", "statement": "theorem Perm.extendDomain_apply_subtype {b : β'} (h : p b) : e.extendDomain f b = f (e (f.symm ⟨b, h⟩)) :=", "area": "Logic"} {"task": "t8", "statement": "theorem Perm.extendDomain_apply_not_subtype {b : β'} (h : ¬p b) : e.extendDomain f b = b :=", "area": "Logic"} {"task": "t8", "statement": "theorem Perm.extendDomain_refl : Perm.extendDomain (Equiv.refl _) f = Equiv.refl _ :=", "area": "Logic"} {"task": "t8", "statement": "theorem Perm.extendDomain_trans (e e' : Perm α') : (e.extendDomain f).trans (e'.extendDomain f) = Perm.extendDomain (e.trans e') f :=", "area": "Logic"} {"task": "t8", "statement": "theorem swapCore_self (r a : α) : swapCore a a r = r :=", "area": "Logic"} {"task": "t8", "statement": "theorem swapCore_swapCore (r a b : α) : swapCore a b (swapCore a b r) = r :=", "area": "Logic"} {"task": "t8", "statement": "theorem swapCore_comm (r a b : α) : swapCore a b r = swapCore b a r :=", "area": "Logic"} {"task": "t8", "statement": "theorem swap_apply_right (a b : α) : swap a b b = a :=", "area": "Logic"} {"task": "t8", "statement": "theorem swap_apply_of_ne_of_ne {a b x : α} : x ≠ a → x ≠ b → swap a b x = x :=", "area": "Logic"} {"task": "t8", "statement": "theorem eq_or_eq_of_swap_apply_ne_self {a b x : α} (h : swap a b x ≠ x) : x = a ∨ x = b :=", "area": "Logic"} {"task": "t8", "statement": "theorem swap_eq_refl_iff {x y : α} : swap x y = Equiv.refl _ ↔ x = y :=", "area": "Logic"} {"task": "t8", "statement": "theorem swap_comp_apply {a b x : α} (π : Perm α) : π.trans (swap a b) x = if π x = a then b else if π x = b then a else π x :=", "area": "Logic"} {"task": "t8", "statement": "theorem swap_eq_update (i j : α) : (Equiv.swap i j : α → α) = update (update id j i) i j :=", "area": "Logic"} {"task": "t8", "statement": "theorem comp_swap_eq_update (i j : α) (f : α → β) : f ∘ Equiv.swap i j = update (update f j (f i)) i (f j) :=", "area": "Logic"} {"task": "t8", "statement": "theorem symm_trans_swap_trans [DecidableEq β] (a b : α) (e : α ≃ β) : (e.symm.trans (swap a b)).trans e = swap (e a) (e b) :=", "area": "Logic"} {"task": "t8", "statement": "theorem swap_apply_self (i j a : α) : swap i j (swap i j a) = a :=", "area": "Logic"} {"task": "t8", "statement": "theorem apply_swap_eq_self {v : α → β} {i j : α} (hv : v i = v j) (k : α) : v (swap i j k) = v k :=", "area": "Logic"} {"task": "t8", "statement": "theorem swap_apply_eq_iff {x y z w : α} : swap x y z = w ↔ z = swap x y w :=", "area": "Logic"} {"task": "t8", "statement": "theorem swap_apply_ne_self_iff {a b x : α} : swap a b x ≠ x ↔ a ≠ b ∧ (x = a ∨ x = b) :=", "area": "Logic"} {"task": "t8", "statement": "theorem sumCongr_swap_refl {α β : Sort _} [DecidableEq α] [DecidableEq β] (i j : α) : Equiv.Perm.sumCongr (Equiv.swap i j) (Equiv.refl β) = Equiv.swap (Sum.inl i) (Sum.inl j) :=", "area": "Logic"} {"task": "t8", "statement": "theorem sumCongr_refl_swap {α β : Sort _} [DecidableEq α] [DecidableEq β] (i j : β) : Equiv.Perm.sumCongr (Equiv.refl α) (Equiv.swap i j) = Equiv.swap (Sum.inr i) (Sum.inr j) :=", "area": "Logic"} {"task": "t8", "statement": "theorem setValue_eq (f : α ≃ β) (a : α) (b : β) : setValue f a b a = b :=", "area": "Logic"} {"task": "t8", "statement": "theorem Function.Injective.map_swap [DecidableEq α] [DecidableEq β] {f : α → β} (hf : Function.Injective f) (x y z : α) : f (Equiv.swap x y z) = Equiv.swap (f x) (f y) (f z) :=", "area": "Logic"} {"task": "t8", "statement": "theorem piCongrLeft'_symm (P : Sort*) (e : α ≃ β) : (piCongrLeft' (fun _ => P) e).symm = piCongrLeft' _ e.symm :=", "area": "Logic"} {"task": "t8", "statement": "lemma piCongrLeft'_symm_apply_apply (P : α → Sort*) (e : α ≃ β) (g : ∀ b, P (e.symm b)) (b : β) : (piCongrLeft' P e).symm g (e.symm b) = g b :=", "area": "Logic"} {"task": "t8", "statement": "theorem piCongrLeft_sum_inl (π : ι'' → Type*) (e : ι ⊕ ι' ≃ ι'') (f : ∀ i, π (e (inl i))) (g : ∀ i, π (e (inr i))) (i : ι) : piCongrLeft π e (sumPiEquivProdPi (fun x => π (e x)) |>.symm (f, g)) (e (inl i)) = f i :=", "area": "Logic"} {"task": "t8", "statement": "theorem piCongrLeft_sum_inr (π : ι'' → Type*) (e : ι ⊕ ι' ≃ ι'') (f : ∀ i, π (e (inl i))) (g : ∀ i, π (e (inr i))) (j : ι') : piCongrLeft π e (sumPiEquivProdPi (fun x => π (e x)) |>.symm (f, g)) (e (inr j)) = g j :=", "area": "Logic"} {"task": "t8", "statement": "theorem piCongr_apply_apply (f : ∀ a, W a) (a : α) : h₁.piCongr h₂ f (h₁ a) = h₂ a (f a) :=", "area": "Logic"} {"task": "t8", "statement": "theorem piCongr'_symm_apply_symm_apply (f : ∀ b, Z b) (b : β) : (h₁.piCongr' h₂).symm f (h₁.symm b) = (h₂ b).symm (f b) :=", "area": "Logic"} {"task": "t8", "statement": "theorem semiconj_conj (f : α₁ → α₁) : Semiconj e f (e.conj f) :=", "area": "Logic"} {"task": "t8", "statement": "theorem semiconj₂_conj : Semiconj₂ e f (e.arrowCongr e.conj f) :=", "area": "Logic"} {"task": "t8", "statement": "theorem Function.Injective.swap_apply [DecidableEq α] [DecidableEq β] {f : α → β} (hf : Function.Injective f) (x y z : α) : Equiv.swap (f x) (f y) (f z) = f (Equiv.swap x y z) :=", "area": "Logic"} {"task": "t8", "statement": "theorem update_comp_equiv [DecidableEq α'] [DecidableEq α] (f : α → β) (g : α' ≃ α) (a : α) (v : β) : update f a v ∘ g = update (f ∘ g) (g.symm a) v :=", "area": "Logic"} {"task": "t8", "statement": "theorem piCongrLeft'_update [DecidableEq α] [DecidableEq β] (P : α → Sort*) (e : α ≃ β) (f : ∀ a, P a) (b : β) (x : P (e.symm b)) : e.piCongrLeft' P (update f (e.symm b) x) = update (e.piCongrLeft' P f) b x :=", "area": "Logic"} {"task": "t8", "statement": "theorem piCongrLeft'_symm_update [DecidableEq α] [DecidableEq β] (P : α → Sort*) (e : α ≃ β) (f : ∀ b, P (e.symm b)) (b : β) (x : P (e.symm b)) : (e.piCongrLeft' P).symm (update f b x) = update ((e.piCongrLeft' P).symm f) (e.symm b) x :=", "area": "Logic"} {"task": "t8", "statement": "theorem Equiv.asEmbedding_range {α β : Sort _} {p : β → Prop} (e : α ≃ Subtype p) : Set.range e.asEmbedding = setOf p :=", "area": "Logic"} {"task": "t8", "statement": "theorem iterate_id (n : ℕ) : (id : α → α)^[n] = id :=", "area": "Logic"} {"task": "t8", "statement": "theorem iterate_add (m : ℕ) : ∀ n : ℕ, f^[m + n] = f^[m] ∘ f^[n]", "area": "Logic"} {"task": "t8", "statement": "theorem iterate_add_apply (m n : ℕ) (x : α) : f^[m + n] x = f^[m] (f^[n] x) :=", "area": "Logic"} {"task": "t8", "statement": "theorem iterate_mul (m : ℕ) : ∀ n, f^[m * n] = f^[m]^[n]", "area": "Logic"} {"task": "t8", "statement": "theorem iterate_fixed {x} (h : f x = x) (n : ℕ) : f^[n] x = x :=", "area": "Logic"} {"task": "t8", "statement": "theorem iterate_left {g : ℕ → α → α} (H : ∀ n, Semiconj f (g n) (g <| n + 1)) (n k : ℕ) : Semiconj f^[n] (g k) (g <| n + k) :=", "area": "Logic"} {"task": "t8", "statement": "theorem iterate_eq_of_map_eq (h : Commute f g) (n : ℕ) {x} (hx : f x = g x) : f^[n] x = g^[n] x :=", "area": "Logic"} {"task": "t8", "statement": "theorem comp_iterate (h : Commute f g) (n : ℕ) : (f ∘ g)^[n] = f^[n] ∘ g^[n] :=", "area": "Logic"} {"task": "t8", "statement": "theorem iterate_succ' (n : ℕ) : f^[n.succ] = f ∘ f^[n] :=", "area": "Logic"} {"task": "t8", "statement": "theorem iterate_succ_apply' (n : ℕ) (x : α) : f^[n.succ] x = f (f^[n] x) :=", "area": "Logic"} {"task": "t8", "statement": "theorem iterate_pred_comp_of_pos {n : ℕ} (hn : 0 < n) : f^[n.pred] ∘ f = f^[n] :=", "area": "Logic"} {"task": "t8", "statement": "theorem comp_iterate_pred_of_pos {n : ℕ} (hn : 0 < n) : f ∘ f^[n.pred] = f^[n] :=", "area": "Logic"} {"task": "t8", "statement": "theorem LeftInverse.iterate {g : α → α} (hg : LeftInverse g f) (n : ℕ) : LeftInverse g^[n] f^[n] :=", "area": "Logic"} {"task": "t8", "statement": "theorem iterate_comm (f : α → α) (m n : ℕ) : f^[n]^[m] = f^[m]^[n] :=", "area": "Logic"} {"task": "t8", "statement": "lemma iterate_add_eq_iterate (hf : Injective f) : f^[m + n] a = f^[n] a ↔ f^[m] a = a :=", "area": "Logic"} {"task": "t8", "statement": "lemma iterate_cancel (hf : Injective f) (ha : f^[m] a = f^[n] a) : f^[m - n] a = a :=", "area": "Logic"} {"task": "t8", "statement": "theorem foldl_const (f : α → α) (a : α) (l : List β) : l.foldl (fun b _ ↦ f b) a = f^[l.length] a :=", "area": "Logic"} {"task": "t8", "statement": "theorem foldr_const (f : β → β) (b : β) : ∀ l : List α, l.foldr (fun _ ↦ f) b = f^[l.length] b", "area": "Logic"} {"task": "t8", "statement": "theorem punit_ext' (F G : C ⥤ Discrete PUnit.{w + 1}) : F = G :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem equiv_punit_iff_unique : Nonempty (C ≌ Discrete PUnit.{w + 1}) ↔ Nonempty C ∧ ∀ x y : C, Nonempty <| Unique (x ⟶ y) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma Functor.map_comp_assoc {C : Type u₁} [Category C] {D : Type u₂} [Category D] (F : C ⥤ D) {X Y Z : C} (f : X ⟶ Y) (g : Y ⟶ Z) {W : D} (h : F.obj Z ⟶ W) : (F.map (f ≫ g)) ≫ h = F.map f ≫ F.map g ≫ h :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem comp_id (F : C ⥤ D) : F ⋙ 𝟭 D = F :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem id_comp (F : C ⥤ D) : 𝟭 C ⋙ F = F :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem map_dite (F : C ⥤ D) {X Y : C} {P : Prop} [Decidable P] (f : P → (X ⟶ Y)) (g : ¬P → (X ⟶ Y)) : F.map (if h : P then f h else g h) = if h : P then F.map (f h) else F.map (g h) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "@[ext] lemma tensorObj_ext {A : C} {j : I} (f g : tensorObj X₁ X₂ j ⟶ A) (h : ∀ (i₁ i₂ : I) (hi : i₁ + i₂ = j), ιTensorObj X₁ X₂ i₁ i₂ j hi ≫ f = ιTensorObj X₁ X₂ i₁ i₂ j hi ≫ g) : f = g :=", "area": "CategoryTheory"} {"task": "t8", "statement": "@[reassoc (attr := simp)] lemma ι_tensorObjDesc {A : C} {k : I} (f : ∀ (i₁ i₂ : I) (_ : i₁ + i₂ = k), X₁ i₁ ⊗ X₂ i₂ ⟶ A) (i₁ i₂ : I) (hi : i₁ + i₂ = k) : ιTensorObj X₁ X₂ i₁ i₂ k hi ≫ tensorObjDesc f = f i₁ i₂ hi :=", "area": "CategoryTheory"} {"task": "t8", "statement": "@[reassoc (attr := simp)] lemma ι_tensorHom {X₁ X₂ Y₁ Y₂ : GradedObject I C} (f : X₁ ⟶ X₂) (g : Y₁ ⟶ Y₂) [HasTensor X₁ Y₁] [HasTensor X₂ Y₂] (i₁ i₂ i₁₂ : I) (h : i₁ + i₂ = i₁₂) : ιTensorObj X₁ Y₁ i₁ i₂ i₁₂ h ≫ tensorHom f g i₁₂ = (f i₁ ⊗ g i₂) ≫ ιTensorObj X₂ Y₂ i₁ i₂ i₁₂ h :=", "area": "CategoryTheory"} {"task": "t8", "statement": "@[simp] lemma tensor_id (X Y : GradedObject I C) [HasTensor X Y] : tensorHom (𝟙 X) (𝟙 Y) = 𝟙 _ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "@[reassoc] lemma tensor_comp {X₁ X₂ X₃ Y₁ Y₂ Y₃ : GradedObject I C} (f₁ : X₁ ⟶ X₂) (f₂ : X₂ ⟶ X₃) (g₁ : Y₁ ⟶ Y₂) (g₂ : Y₂ ⟶ Y₃) [HasTensor X₁ Y₁] [HasTensor X₂ Y₂] [HasTensor X₃ Y₃] : tensorHom (f₁ ≫ f₂) (g₁ ≫ g₂) = tensorHom f₁ g₁ ≫ tensorHom f₂ g₂ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma tensorHom_def {X₁ X₂ Y₁ Y₂ : GradedObject I C} (f : X₁ ⟶ X₂) (g : Y₁ ⟶ Y₂) [HasTensor X₁ Y₁] [HasTensor X₂ Y₂] [HasTensor X₂ Y₁] : tensorHom f g = whiskerRight f Y₁ ≫ whiskerLeft X₂ g :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem id_apply_self (M : Mat_ C) (i : M.ι) : (𝟙 M : Hom M M) i i = 𝟙 _ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem id_apply_of_ne (M : Mat_ C) (i j : M.ι) (h : i ≠ j) : (𝟙 M : Hom M M) i j = 0 :=", "area": "CategoryTheory"} {"task": "t8", "statement": "@[reassoc (attr := simp)] lemma additiveObjIsoBiproduct_hom_π (F : Mat_ C ⥤ D) [Functor.Additive F] (M : Mat_ C) (i : M.ι) : (additiveObjIsoBiproduct F M).hom ≫ biproduct.π _ i = F.map (M.isoBiproductEmbedding.hom ≫ biproduct.π _ i) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "@[reassoc (attr := simp)] lemma ι_additiveObjIsoBiproduct_inv (F : Mat_ C ⥤ D) [Functor.Additive F] (M : Mat_ C) (i : M.ι) : biproduct.ι _ i ≫ (additiveObjIsoBiproduct F M).inv = F.map (biproduct.ι _ i ≫ M.isoBiproductEmbedding.inv) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem additiveObjIsoBiproduct_naturality (F : Mat_ C ⥤ D) [Functor.Additive F] {M N : Mat_ C} (f : M ⟶ N) : F.map f ≫ (additiveObjIsoBiproduct F N).hom = (additiveObjIsoBiproduct F M).hom ≫ biproduct.matrix fun i j => F.map ((embedding C).map (f i j)) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem additiveObjIsoBiproduct_naturality' (F : Mat_ C ⥤ D) [Functor.Additive F] {M N : Mat_ C} (f : M ⟶ N) : (additiveObjIsoBiproduct F M).inv ≫ F.map f = biproduct.matrix (fun i j => F.map ((embedding C).map (f i j)) : _) ≫ (additiveObjIsoBiproduct F N).inv :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem id_apply_self (M : Mat R) (i : M) : (𝟙 M : Matrix M M R) i i = 1 :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem id_apply_of_ne (M : Mat R) (i j : M) (h : i ≠ j) : (𝟙 M : Matrix M M R) i j = 0 :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem projective_iff_preservesEpimorphisms_preadditiveCoyoneda_obj (P : C) : Projective P ↔ (preadditiveCoyoneda.obj (op P)).PreservesEpimorphisms :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem projective_iff_preservesEpimorphisms_preadditiveCoyoneda_obj' (P : C) : Projective P ↔ (preadditiveCoyoneda.obj (op P)).PreservesEpimorphisms :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem map_id_comp (F : C × D ⥤ E) (W : C) {X Y Z : D} (f : X ⟶ Y) (g : Y ⟶ Z) : F.map ((𝟙 W, f ≫ g) : (W, X) ⟶ (W, Z)) = F.map ((𝟙 W, f) : (W, X) ⟶ (W, Y)) ≫ F.map ((𝟙 W, g) : (W, Y) ⟶ (W, Z)) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem map_comp_id (F : C × D ⥤ E) (X Y Z : C) (W : D) (f : X ⟶ Y) (g : Y ⟶ Z) : F.map ((f ≫ g, 𝟙 W) : (X, W) ⟶ (Z, W)) = F.map ((f, 𝟙 W) : (X, W) ⟶ (Y, W)) ≫ F.map ((g, 𝟙 W) : (Y, W) ⟶ (Z, W)) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem diagonal (F : C × D ⥤ E) (X X' : C) (f : X ⟶ X') (Y Y' : D) (g : Y ⟶ Y') : F.map ((𝟙 X, g) : (X, Y) ⟶ (X, Y')) ≫ F.map ((f, 𝟙 Y') : (X, Y') ⟶ (X', Y')) = F.map ((f, g) : (X, Y) ⟶ (X', Y')) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem diagonal' (F : C × D ⥤ E) (X X' : C) (f : X ⟶ X') (Y Y' : D) (g : Y ⟶ Y') : F.map ((f, 𝟙 Y) : (X, Y) ⟶ (X', Y)) ≫ F.map ((𝟙 X', g) : (X', Y) ⟶ (X', Y')) = F.map ((f, g) : (X, Y) ⟶ (X', Y')) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem rel_id_apply₂ (X : RelCat) (x y : X) : (𝟙 X) x y ↔ x = y :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem rel_comp_apply₂ {X Y Z : RelCat} (f : X ⟶ Y) (g : Y ⟶ Z) (x : X) (z : Z) : (f ≫ g) x z ↔ ∃ y, f x y ∧ g y z :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem rel_iso_iff {X Y : RelCat} (r : X ⟶ Y) : IsIso (C := RelCat) r ↔ ∃ f : (Iso (C := Type) X Y), graphFunctor.map f.hom = r :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma leftUnitor_hom_app {B C : Cat} (F : B ⟶ C) (X : B) : (λ_ F).hom.app X = eqToHom (by simp) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma leftUnitor_inv_app {B C : Cat} (F : B ⟶ C) (X : B) : (λ_ F).inv.app X = eqToHom (by simp) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma rightUnitor_hom_app {B C : Cat} (F : B ⟶ C) (X : B) : (ρ_ F).hom.app X = eqToHom (by simp) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma rightUnitor_inv_app {B C : Cat} (F : B ⟶ C) (X : B) : (ρ_ F).inv.app X = eqToHom (by simp) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma associator_hom_app {B C D E : Cat} (F : B ⟶ C) (G : C ⟶ D) (H : D ⟶ E) (X : B) : (α_ F G H).hom.app X = eqToHom (by simp) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma associator_inv_app {B C D E : Cat} (F : B ⟶ C) (G : C ⟶ D) (H : D ⟶ E) (X : B) : (α_ F G H).inv.app X = eqToHom (by simp) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem isThin_iff : Quiver.IsThin C ↔ ∀ c : C, Subsingleton (c ⟶ c) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem IsFiltered.iff_nonempty_limit : IsFiltered C ↔ ∀ {J : Type v} [SmallCategory J] [FinCategory J] (F : J ⥤ C), ∃ (X : C), Nonempty (limit (F.op ⋙ yoneda.obj X)) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem IsCofiltered.iff_nonempty_limit : IsCofiltered C ↔ ∀ {J : Type v} [SmallCategory J] [FinCategory J] (F : J ⥤ C), ∃ (X : C), Nonempty (limit (F ⋙ coyoneda.obj (op X))) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem limitObjIsoLimitCompEvaluation_hom_π [HasLimitsOfShape J C] (F : J ⥤ K ⥤ C) (j : J) (k : K) : (limitObjIsoLimitCompEvaluation F k).hom ≫ limit.π (F ⋙ (evaluation K C).obj k) j = (limit.π F j).app k :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem limitObjIsoLimitCompEvaluation_inv_π_app [HasLimitsOfShape J C] (F : J ⥤ K ⥤ C) (j : J) (k : K) : (limitObjIsoLimitCompEvaluation F k).inv ≫ (limit.π F j).app k = limit.π (F ⋙ (evaluation K C).obj k) j :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem limit_map_limitObjIsoLimitCompEvaluation_hom [HasLimitsOfShape J C] {i j : K} (F : J ⥤ K ⥤ C) (f : i ⟶ j) : (limit F).map f ≫ (limitObjIsoLimitCompEvaluation _ _).hom = (limitObjIsoLimitCompEvaluation _ _).hom ≫ limMap (whiskerLeft _ ((evaluation _ _).map f)) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem limitObjIsoLimitCompEvaluation_inv_limit_map [HasLimitsOfShape J C] {i j : K} (F : J ⥤ K ⥤ C) (f : i ⟶ j) : (limitObjIsoLimitCompEvaluation _ _).inv ≫ (limit F).map f = limMap (whiskerLeft _ ((evaluation _ _).map f)) ≫ (limitObjIsoLimitCompEvaluation _ _).inv :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem limit_obj_ext {H : J ⥤ K ⥤ C} [HasLimitsOfShape J C] {k : K} {W : C} {f g : W ⟶ (limit H).obj k} (w : ∀ j, f ≫ (Limits.limit.π H j).app k = g ≫ (Limits.limit.π H j).app k) : f = g :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem colimitObjIsoColimitCompEvaluation_ι_inv [HasColimitsOfShape J C] (F : J ⥤ K ⥤ C) (j : J) (k : K) : colimit.ι (F ⋙ (evaluation K C).obj k) j ≫ (colimitObjIsoColimitCompEvaluation F k).inv = (colimit.ι F j).app k :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem colimitObjIsoColimitCompEvaluation_ι_app_hom [HasColimitsOfShape J C] (F : J ⥤ K ⥤ C) (j : J) (k : K) : (colimit.ι F j).app k ≫ (colimitObjIsoColimitCompEvaluation F k).hom = colimit.ι (F ⋙ (evaluation K C).obj k) j :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem colimitObjIsoColimitCompEvaluation_inv_colimit_map [HasColimitsOfShape J C] (F : J ⥤ K ⥤ C) {i j : K} (f : i ⟶ j) : (colimitObjIsoColimitCompEvaluation _ _).inv ≫ (colimit F).map f = colimMap (whiskerLeft _ ((evaluation _ _).map f)) ≫ (colimitObjIsoColimitCompEvaluation _ _).inv :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem colimit_map_colimitObjIsoColimitCompEvaluation_hom [HasColimitsOfShape J C] (F : J ⥤ K ⥤ C) {i j : K} (f : i ⟶ j) : (colimit F).map f ≫ (colimitObjIsoColimitCompEvaluation _ _).hom = (colimitObjIsoColimitCompEvaluation _ _).hom ≫ colimMap (whiskerLeft _ ((evaluation _ _).map f)) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem colimit_obj_ext {H : J ⥤ K ⥤ C} [HasColimitsOfShape J C] {k : K} {W : C} {f g : (colimit H).obj k ⟶ W} (w : ∀ j, (colimit.ι H j).app k ≫ f = (colimit.ι H j).app k ≫ g) : f = g :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma Types.Quot.Rel.iff_orbitRel (x y : J.obj (SingleObj.star G)) : Types.Quot.Rel J ⟨SingleObj.star G, x⟩ ⟨SingleObj.star G, y⟩ ↔ Setoid.Rel (MulAction.orbitRel G (J.obj (SingleObj.star G))) x y :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem PreservesPullback.iso_hom_fst : (PreservesPullback.iso G f g).hom ≫ pullback.fst = G.map pullback.fst :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem PreservesPullback.iso_hom_snd : (PreservesPullback.iso G f g).hom ≫ pullback.snd = G.map pullback.snd :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem PreservesPullback.iso_inv_fst : (PreservesPullback.iso G f g).inv ≫ G.map pullback.fst = pullback.fst :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem PreservesPullback.iso_inv_snd : (PreservesPullback.iso G f g).inv ≫ G.map pullback.snd = pullback.snd :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem PreservesPushout.inl_iso_hom : pushout.inl ≫ (PreservesPushout.iso G f g).hom = G.map pushout.inl :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem PreservesPushout.inr_iso_hom : pushout.inr ≫ (PreservesPushout.iso G f g).hom = G.map pushout.inr :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem PreservesPushout.inl_iso_inv : G.map pushout.inl ≫ (PreservesPushout.iso G f g).inv = pushout.inl :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem PreservesPushout.inr_iso_inv : G.map pushout.inr ≫ (PreservesPushout.iso G f g).inv = pushout.inr :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma map_isZero (F : C ⥤ D) [PreservesZeroMorphisms F] {X : C} (hX : IsZero X) : IsZero (F.obj X) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem map_eq_zero_iff (F : C ⥤ D) [PreservesZeroMorphisms F] [Faithful F] {X Y : C} {f : X ⟶ Y} : F.map f = 0 ↔ f = 0 :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma preservesZeroMorphisms_of_iso {F₁ F₂ : C ⥤ D} [F₁.PreservesZeroMorphisms] (e : F₁ ≅ F₂) : F₂.PreservesZeroMorphisms where", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem preservesZeroMorphisms_of_map_zero_object (i : F.obj 0 ≅ 0) : PreservesZeroMorphisms F where", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem uncurry_id_eq_ev (A X : C) [Exponentiable A] : uncurry (𝟙 (A ⟹ X)) = (exp.ev A).app X :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem curry_id_eq_coev (A X : C) [Exponentiable A] : curry (𝟙 _) = (exp.coev A).app X :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem uncurry_pre (f : B ⟶ A) [Exponentiable B] (X : C) : CartesianClosed.uncurry ((pre f).app X) = Limits.prod.map f (𝟙 _) ≫ (exp.ev A).app X :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem pre_id (A : C) [Exponentiable A] : pre (𝟙 A) = 𝟙 _ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem pre_map {A₁ A₂ A₃ : C} [Exponentiable A₁] [Exponentiable A₂] [Exponentiable A₃] (f : A₁ ⟶ A₂) (g : A₂ ⟶ A₃) : pre (f ≫ g) = pre g ≫ pre f :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem strict_initial {I : C} (t : IsInitial I) (f : A ⟶ I) : IsIso f :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem initial_mono {I : C} (B : C) (t : IsInitial I) [CartesianClosed C] : Mono (t.to B) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem ExponentialIdeal.mk' (h : ∀ (B : D) (A : C), (A ⟹ i.obj B) ∈ i.essImage) : ExponentialIdeal i :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem ExponentialIdeal.mk_of_iso [Reflective i] (h : ∀ A : C, i ⋙ exp A ⋙ reflector i ⋙ i ≅ i ⋙ exp A) : ExponentialIdeal i :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem bijection_symm_apply_id (A B : C) : (bijection i A B _).symm (𝟙 _) = prodComparison _ _ _ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem bijection_natural (A B : C) (X X' : D) (f : (reflector i).obj (A ⨯ B) ⟶ X) (g : X ⟶ X') : bijection i _ _ _ (f ≫ g) = bijection i _ _ _ f ≫ g :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem prodComparison_iso (A B : C) : IsIso (prodComparison (reflector i) A B) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem isSheafFor_bind (P : Cᵒᵖ ⥤ Type v) (U : Sieve X) (B : ∀ ⦃Y⦄ ⦃f : Y ⟶ X⦄, U f → Sieve Y) (hU : Presieve.IsSheafFor P (U : Presieve X)) (hB : ∀ ⦃Y⦄ ⦃f : Y ⟶ X⦄ (hf : U f), Presieve.IsSheafFor P (B hf : Presieve Y)) (hB' : ∀ ⦃Y⦄ ⦃f : Y ⟶ X⦄ (h : U f) ⦃Z⦄ (g : Z ⟶ Y), Presieve.IsSeparatedFor P (((B h).pullback g) : Presieve Z)) : Presieve.IsSheafFor P (Sieve.bind (U : Presieve X) B : Presieve X) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem isSheafFor_trans (P : Cᵒᵖ ⥤ Type v) (R S : Sieve X) (hR : Presieve.IsSheafFor P (R : Presieve X)) (hR' : ∀ ⦃Y⦄ ⦃f : Y ⟶ X⦄ (_ : S f), Presieve.IsSeparatedFor P (R.pullback f : Presieve Y)) (hS : ∀ ⦃Y⦄ ⦃f : Y ⟶ X⦄ (_ : R f), Presieve.IsSheafFor P (S.pullback f : Presieve Y)) : Presieve.IsSheafFor P (S : Presieve X) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem sheaf_for_finestTopology (Ps : Set (Cᵒᵖ ⥤ Type v)) (h : P ∈ Ps) : Presieve.IsSheaf (finestTopology Ps) P :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem le_finestTopology (Ps : Set (Cᵒᵖ ⥤ Type v)) (J : GrothendieckTopology C) (hJ : ∀ P ∈ Ps, Presieve.IsSheaf J P) : J ≤ finestTopology Ps :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem of_yoneda_isSheaf (J : GrothendieckTopology C) (h : ∀ X, Presieve.IsSheaf J (yoneda.obj X)) : Subcanonical J :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem liftToPlusObjLimitObj_fac {K : Type max v u} [SmallCategory K] [FinCategory K] [HasLimitsOfShape K D] [PreservesLimitsOfShape K (forget D)] [ReflectsLimitsOfShape K (forget D)] (F : K ⥤ Cᵒᵖ ⥤ D) (X : C) (S : Cone (F ⋙ J.plusFunctor D ⋙ (evaluation Cᵒᵖ D).obj (op X))) (k) : liftToPlusObjLimitObj.{w, v, u} F X S ≫ (J.plusMap (limit.π F k)).app (op X) = S.π.app k :=", "area": "CategoryTheory"} {"task": "t8", "statement": "@[reassoc (attr := simp)] lemma toSheafify_plusPlusIsoSheafify_hom (P : Cᵒᵖ ⥤ D) : J.toSheafify P ≫ (plusPlusIsoSheafify J D P).hom = toSheafify J P :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem mem_sieves_of_hasEffectiveEpi (S : Sieve X) : (∃ (Y : C) (π : Y ⟶ X), EffectiveEpi π ∧ S.arrows π) → (S ∈ (regularTopology C).sieves X) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem mem_sieves_iff_hasEffectiveEpi (S : Sieve X) : (S ∈ (regularTopology C).sieves X) ↔ ∃ (Y : C) (π : Y ⟶ X), EffectiveEpi π ∧ (S.arrows π) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem exact_iff_image_eq_kernel : Exact f g ↔ imageSubobject f = kernelSubobject g :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem exact_iff : Exact f g ↔ f ≫ g = 0 ∧ kernel.ι g ≫ cokernel.π f = 0 :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem exact_iff' {cg : KernelFork g} (hg : IsLimit cg) {cf : CokernelCofork f} (hf : IsColimit cf) : Exact f g ↔ f ≫ g = 0 ∧ cg.ι ≫ cf.π = 0 :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem exact_tfae : TFAE [Exact f g, f ≫ g = 0 ∧ kernel.ι g ≫ cokernel.π f = 0, imageSubobject f = kernelSubobject g] :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem IsEquivalence.exact_iff {D : Type u₁} [Category.{v₁} D] [Abelian D] (F : C ⥤ D) [F.IsEquivalence] : Exact (F.map f) (F.map g) ↔ Exact f g :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem exact_epi_comp_iff {W : C} (h : W ⟶ X) [Epi h] : Exact (h ≫ f) g ↔ Exact f g :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem exact_cokernel : Exact f (cokernel.π f) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma mono_cokernel_desc_of_exact (h : Exact f g) : Mono (cokernel.desc f g h.w) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem cokernel.desc.inv [Epi g] (ex : Exact f g) : have := isIso_cokernel_desc_of_exact_of_epi _ _ ex g ≫ inv (cokernel.desc _ _ ex.w) = cokernel.π _ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem kernel.lift.inv [Mono f] (ex : Exact f g) : have := isIso_kernel_lift_of_exact_of_mono _ _ ex inv (kernel.lift _ _ ex.w) ≫ f = kernel.ι g :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem exact_of_is_cokernel (w : f ≫ g = 0) (h : IsColimit (CokernelCofork.ofπ _ w)) : Exact f g :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem exact_of_is_kernel (w : f ≫ g = 0) (h : IsLimit (KernelFork.ofι _ w)) : Exact f g :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem exact_iff_exact_image_ι : Exact f g ↔ Exact (Abelian.image.ι f) g :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem exact_iff_exact_coimage_π : Exact f g ↔ Exact f (coimage.π g) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem tfae_mono : TFAE [Mono f, kernel.ι f = 0, Exact (0 : Z ⟶ X) f] :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem tfae_epi : TFAE [Epi f, cokernel.π f = 0, Exact f (0 : Y ⟶ Z)] :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem Exact.op (h : Exact f g) : Exact g.op f.op :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem Exact.op_iff : Exact g.op f.op ↔ Exact f g :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem Exact.unop {X Y Z : Cᵒᵖ} (g : X ⟶ Y) (f : Y ⟶ Z) (h : Exact g f) : Exact f.unop g.unop :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem Exact.unop_iff {X Y Z : Cᵒᵖ} (g : X ⟶ Y) (f : Y ⟶ Z) : Exact f.unop g.unop ↔ Exact g f :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem map_exact {X Y Z : A} (f : X ⟶ Y) (g : Y ⟶ Z) (e1 : Exact f g) : Exact (L.map f) (L.map g) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem preservesZeroMorphisms_of_map_exact : L.PreservesZeroMorphisms :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem preservesMonomorphisms_of_map_exact : L.PreservesMonomorphisms where", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem preservesEpimorphisms_of_map_exact : L.PreservesEpimorphisms where", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem assoc_flip : (A.X ◁ M.act) ≫ M.act = (α_ A.X A.X M.X).inv ≫ (A.mul ▷ M.X) ≫ M.act :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem id_hom' (M : Mod_ A) : (𝟙 M : M ⟶ M).hom = 𝟙 M.X :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma autGaloisSystem_map_surjective ⦃A B : PointedGaloisObject F⦄ (f : A ⟶ B) : Function.Surjective ((autGaloisSystem F).map f) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem AutGalois.π_surjective (A : PointedGaloisObject F) : Function.Surjective (AutGalois.π F A) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma AutGalois.ext {f g : AutGalois F} (h : ∀ (A : PointedGaloisObject F), AutGalois.π F A f = AutGalois.π F A g) : f = g :=", "area": "CategoryTheory"} {"task": "t8", "statement": "@[simp] lemma endEquivSectionsFibers_π (f : End F) (A : PointedGaloisObject F) : (endEquivSectionsFibers F f).val A = f.app A A.pt :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma endEquivAutGalois_π (f : End F) (A : PointedGaloisObject F) : F.map (AutGalois.π F A (endEquivAutGalois F f)).hom A.pt = f.app A A.pt :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem endEquivAutGalois_mul (f g : End F) : (endEquivAutGalois F) (g ≫ f) = (endEquivAutGalois F g) * (endEquivAutGalois F f) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma autMulEquivAutGalois_π (f : Aut F) (A : C) [IsGalois A] (a : F.obj A) : F.map (AutGalois.π F { obj := A, pt := a } (autMulEquivAutGalois F f).unop).hom a = f.hom.app A a :=", "area": "CategoryTheory"} {"task": "t8", "statement": "@[simp] lemma autMulEquivAutGalois_symm_app (x : AutGalois F) (A : C) [IsGalois A] (a : F.obj A) : ((autMulEquivAutGalois F).symm ⟨x⟩).hom.app A a = F.map (AutGalois.π F ⟨A, a, inferInstance⟩ x).hom a :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem FiberFunctor.isPretransitive_of_isGalois (X : C) [IsGalois X] : MulAction.IsPretransitive (Aut F) (F.obj X) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem comp_distTriang_mor_zero₁₂ (T) (H : T ∈ (distTriang C)) : T.mor₁ ≫ T.mor₂ = 0 :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem comp_distTriang_mor_zero₃₁ (T : Triangle C) (H : T ∈ distTriang C) : T.mor₃ ≫ T.mor₁⟦1⟧' = 0 :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma distinguished_cocone_triangle₁ {Y Z : C} (g : Y ⟶ Z) : ∃ (X : C) (f : X ⟶ Y) (h : Z ⟶ X⟦(1 : ℤ)⟧), Triangle.mk f g h ∈ distTriang C :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma distinguished_cocone_triangle₂ {Z X : C} (h : Z ⟶ X⟦(1 : ℤ)⟧) : ∃ (Y : C) (f : X ⟶ Y) (g : Y ⟶ Z), Triangle.mk f g h ∈ distTriang C :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma complete_distinguished_triangle_morphism₁ (T₁ T₂ : Triangle C) (hT₁ : T₁ ∈ distTriang C) (hT₂ : T₂ ∈ distTriang C) (b : T₁.obj₂ ⟶ T₂.obj₂) (c : T₁.obj₃ ⟶ T₂.obj₃) (comm : T₁.mor₂ ≫ c = b ≫ T₂.mor₂) : ∃ (a : T₁.obj₁ ⟶ T₂.obj₁), T₁.mor₁ ≫ b = a ≫ T₂.mor₁ ∧ T₁.mor₃ ≫ a⟦(1 : ℤ)⟧' = c ≫ T₂.mor₃ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma complete_distinguished_triangle_morphism₂ (T₁ T₂ : Triangle C) (hT₁ : T₁ ∈ distTriang C) (hT₂ : T₂ ∈ distTriang C) (a : T₁.obj₁ ⟶ T₂.obj₁) (c : T₁.obj₃ ⟶ T₂.obj₃) (comm : T₁.mor₃ ≫ a⟦(1 : ℤ)⟧' = c ≫ T₂.mor₃) : ∃ (b : T₁.obj₂ ⟶ T₂.obj₂), T₁.mor₁ ≫ b = a ≫ T₂.mor₁ ∧ T₁.mor₂ ≫ c = b ≫ T₂.mor₂ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma contractible_distinguished₁ (X : C) : Triangle.mk (0 : 0 ⟶ X) (𝟙 X) 0 ∈ distTriang C :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma contractible_distinguished₂ (X : C) : Triangle.mk (0 : X ⟶ 0) 0 (𝟙 (X⟦1⟧)) ∈ distTriang C :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma yoneda_exact₂ {X : C} (f : T.obj₂ ⟶ X) (hf : T.mor₁ ≫ f = 0) : ∃ (g : T.obj₃ ⟶ X), f = T.mor₂ ≫ g :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma coyoneda_exact₂ {X : C} (f : X ⟶ T.obj₂) (hf : f ≫ T.mor₂ = 0) : ∃ (g : X ⟶ T.obj₁), f = g ≫ T.mor₁ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma coyoneda_exact₁ {X : C} (f : X ⟶ T.obj₁⟦(1 : ℤ)⟧) (hf : f ≫ T.mor₁⟦1⟧' = 0) : ∃ (g : X ⟶ T.obj₃), f = g ≫ T.mor₃ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma mor₃_eq_zero_iff_epi₂ : T.mor₃ = 0 ↔ Epi T.mor₂ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma mor₂_eq_zero_iff_epi₁ : T.mor₂ = 0 ↔ Epi T.mor₁ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma mor₁_eq_zero_iff_epi₃ : T.mor₁ = 0 ↔ Epi T.mor₃ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma mor₁_eq_zero_iff_mono₂ : T.mor₁ = 0 ↔ Mono T.mor₂ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma mor₃_eq_zero_iff_mono₁ : T.mor₃ = 0 ↔ Mono T.mor₁ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma isZero₂_iff : IsZero T.obj₂ ↔ (T.mor₁ = 0 ∧ T.mor₂ = 0) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma isZero₁_iff : IsZero T.obj₁ ↔ (T.mor₁ = 0 ∧ T.mor₃ = 0) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma isZero₃_iff : IsZero T.obj₃ ↔ (T.mor₂ = 0 ∧ T.mor₃ = 0) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma isZero₁_of_isZero₂₃ (h₂ : IsZero T.obj₂) (h₃ : IsZero T.obj₃) : IsZero T.obj₁ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma isZero₂_of_isZero₁₃ (h₁ : IsZero T.obj₁) (h₃ : IsZero T.obj₃) : IsZero T.obj₂ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma isZero₃_of_isZero₁₂ (h₁ : IsZero T.obj₁) (h₂ : IsZero T.obj₂) : IsZero T.obj₃ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma isZero₁_iff_isIso₂ : IsZero T.obj₁ ↔ IsIso T.mor₂ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma isZero₃_iff_isIso₁ : IsZero T.obj₃ ↔ IsIso T.mor₁ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma shift_distinguished (n : ℤ) : (CategoryTheory.shiftFunctor (Triangle C) n).obj T ∈ distTriang C :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma isIso₂_of_isIso₁₃ {T T' : Triangle C} (φ : T ⟶ T') (hT : T ∈ distTriang C) (hT' : T' ∈ distTriang C) (h₁ : IsIso φ.hom₁) (h₃ : IsIso φ.hom₃) : IsIso φ.hom₂ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma isIso₃_of_isIso₁₂ {T T' : Triangle C} (φ : T ⟶ T') (hT : T ∈ distTriang C) (hT' : T' ∈ distTriang C) (h₁ : IsIso φ.hom₁) (h₂ : IsIso φ.hom₂) : IsIso φ.hom₃ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma isIso₁_of_isIso₂₃ {T T' : Triangle C} (φ : T ⟶ T') (hT : T ∈ distTriang C) (hT' : T' ∈ distTriang C) (h₂ : IsIso φ.hom₂) (h₃ : IsIso φ.hom₃) : IsIso φ.hom₁ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma exists_iso_binaryBiproduct_of_distTriang (T : Triangle C) (hT : T ∈ distTriang C) (zero : T.mor₃ = 0) : ∃ (e : T.obj₂ ≅ T.obj₁ ⊞ T.obj₃), T.mor₁ ≫ e.hom = biprod.inl ∧ T.mor₂ = e.hom ≫ biprod.snd :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma binaryBiproductTriangle_distinguished (X₁ X₂ : C) : binaryBiproductTriangle X₁ X₂ ∈ distTriang C :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma productTriangle_distinguished {J : Type*} (T : J → Triangle C) (hT : ∀ j, T j ∈ distTriang C) [HasProduct (fun j => (T j).obj₁)] [HasProduct (fun j => (T j).obj₂)] [HasProduct (fun j => (T j).obj₃)] [HasProduct (fun j => (T j).obj₁⟦(1 : ℤ)⟧)] : productTriangle T ∈ distTriang C :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma exists_iso_of_arrow_iso (T₁ T₂ : Triangle C) (hT₁ : T₁ ∈ distTriang C) (hT₂ : T₂ ∈ distTriang C) (e : Arrow.mk T₁.mor₁ ≅ Arrow.mk T₂.mor₁) : ∃ (e' : T₁ ≅ T₂), e'.hom.hom₁ = e.hom.left ∧ e'.hom.hom₂ = e.hom.right :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma isTriangulated_of_essSurj_mapComposableArrows_two (F : C ⥤ D) [F.CommShift ℤ] [F.IsTriangulated] [(F.mapComposableArrows 2).EssSurj] [IsTriangulated C] : IsTriangulated D :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem underlyingIso_top_hom {B : C} : (underlyingIso (𝟙 B)).hom = (⊤ : Subobject B).arrow :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem isIso_iff_mk_eq_top {X Y : C} (f : X ⟶ Y) [Mono f] : IsIso f ↔ mk f = ⊤ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem isIso_arrow_iff_eq_top {Y : C} (P : Subobject Y) : IsIso P.arrow ↔ P = ⊤ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem bot_eq_zero {B : C} : (⊥ : Subobject B) = Subobject.mk (0 : 0 ⟶ B) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem bot_factors_iff_zero {A B : C} (f : A ⟶ B) : (⊥ : Subobject B).Factors f ↔ f = 0 :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem mk_eq_bot_iff_zero {f : X ⟶ Y} [Mono f] : Subobject.mk f = ⊥ ↔ f = 0 :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem le_inf {A : C} (h f g : Subobject A) : h ≤ f → h ≤ g → h ≤ (inf.obj f).obj g :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem inf_factors {A B : C} {X Y : Subobject B} (f : A ⟶ B) : (X ⊓ Y).Factors f ↔ X.Factors f ∧ Y.Factors f :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem inf_arrow_factors_left {B : C} (X Y : Subobject B) : X.Factors (X ⊓ Y).arrow :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem inf_arrow_factors_right {B : C} (X Y : Subobject B) : Y.Factors (X ⊓ Y).arrow :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem finset_inf_factors {I : Type*} {A B : C} {s : Finset I} {P : I → Subobject B} (f : A ⟶ B) : (s.inf P).Factors f ↔ ∀ i ∈ s, (P i).Factors f :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem finset_inf_arrow_factors {I : Type*} {B : C} (s : Finset I) (P : I → Subobject B) (i : I) (m : i ∈ s) : (P i).Factors (s.inf P).arrow :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem inf_eq_map_pullback' {A : C} (f₁ : MonoOver A) (f₂ : Subobject A) : (Subobject.inf.obj (Quotient.mk'' f₁)).obj f₂ = (Subobject.map f₁.arrow).obj ((Subobject.pullback f₁.arrow).obj f₂) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem prod_eq_inf {A : C} {f₁ f₂ : Subobject A} [HasBinaryProduct f₁ f₂] : (f₁ ⨯ f₂) = f₁ ⊓ f₂ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem inf_pullback {X Y : C} (g : X ⟶ Y) (f₁ f₂) : (pullback g).obj (f₁ ⊓ f₂) = (pullback g).obj f₁ ⊓ (pullback g).obj f₂ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem inf_map {X Y : C} (g : Y ⟶ X) [Mono g] (f₁ f₂) : (map g).obj (f₁ ⊓ f₂) = (map g).obj f₁ ⊓ (map g).obj f₂ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem finset_sup_factors {I : Type*} {A B : C} {s : Finset I} {P : I → Subobject B} {f : A ⟶ B} (h : ∃ i ∈ s, (P i).Factors f) : (s.sup P).Factors f :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem sInf_le {A : C} (s : Set (Subobject A)) (f) (hf : f ∈ s) : sInf s ≤ f :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem le_sInf {A : C} (s : Set (Subobject A)) (f : Subobject A) (k : ∀ g ∈ s, f ≤ g) : f ≤ sInf s :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem le_sSup {A : C} (s : Set (Subobject A)) (f) (hf : f ∈ s) : f ≤ sSup s :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem symm_apply_mem_iff_mem_image {α β : Type*} (e : α ≃ β) (s : Set α) (x : β) : e.symm x ∈ s ↔ x ∈ e '' s :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem sSup_le {A : C} (s : Set (Subobject A)) (f : Subobject A) (k : ∀ g ∈ s, g ≤ f) : sSup s ≤ f :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem IsLocalization.mk' (h₁ : Localization.StrictUniversalPropertyFixedTarget L W D) (h₂ : Localization.StrictUniversalPropertyFixedTarget L W W.Localization) : IsLocalization L W :=", "area": "CategoryTheory"} {"task": "t8", "statement": "@[simp] lemma isoOfHom_id_inv (X : C) (hX : W (𝟙 X)) : (isoOfHom L W (𝟙 X) hX).inv = 𝟙 _ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem natTrans_ext {F₁ F₂ : D ⥤ E} (τ τ' : F₁ ⟶ F₂) (h : ∀ X : C, τ.app (L.obj X) = τ'.app (L.obj X)) : τ = τ' :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem comp_liftNatTrans (F₁ F₂ F₃ : C ⥤ E) (F₁' F₂' F₃' : D ⥤ E) [h₁ : Lifting L W F₁ F₁'] [h₂ : Lifting L W F₂ F₂'] [h₃ : Lifting L W F₃ F₃'] (τ : F₁ ⟶ F₂) (τ' : F₂ ⟶ F₃) : liftNatTrans L W F₁ F₂ F₁' F₂' τ ≫ liftNatTrans L W F₂ F₃ F₂' F₃' τ' = liftNatTrans L W F₁ F₃ F₁' F₃' (τ ≫ τ') :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem liftNatTrans_id (F : C ⥤ E) (F' : D ⥤ E) [h : Lifting L W F F'] : liftNatTrans L W F F F' F' (𝟙 F) = 𝟙 F' :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem of_iso {L₁ L₂ : C ⥤ D} (e : L₁ ≅ L₂) [L₁.IsLocalization W] : L₂.IsLocalization W :=", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem of_equivalence_target {E : Type*} [Category E] (L' : C ⥤ E) (eq : D ≌ E) [L.IsLocalization W] (e : L ⋙ eq.functor ≅ L') : L'.IsLocalization W :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma of_isEquivalence (L : C ⥤ D) (W : MorphismProperty C) (hW : W ≤ MorphismProperty.isomorphisms C) [IsEquivalence L] : L.IsLocalization W :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma areEqualizedByLocalization_iff [L.IsLocalization W]: AreEqualizedByLocalization W f g ↔ L.map f = L.map g :=", "area": "CategoryTheory"} {"task": "t8", "statement": "@[reassoc (attr := simp)] lemma map_comp_map_s (φ : W.LeftFraction X Y) (L : C ⥤ D) (hL : W.IsInvertedBy L) : φ.map L hL ≫ L.map φ.s = L.map φ.f :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma map_ofHom (f : X ⟶ Y) (L : C ⥤ D) (hL : W.IsInvertedBy L) [W.ContainsIdentities] : (ofHom W f).map L hL = L.map f :=", "area": "CategoryTheory"} {"task": "t8", "statement": "@[reassoc (attr := simp)] lemma map_ofInv_hom_id (s : Y ⟶ X) (hs : W s) (L : C ⥤ D) (hL : W.IsInvertedBy L) : (ofInv s hs).map L hL ≫ L.map s = 𝟙 _ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "@[reassoc (attr := simp)] lemma map_hom_ofInv_id (s : Y ⟶ X) (hs : W s) (L : C ⥤ D) (hL : W.IsInvertedBy L) : L.map s ≫ (ofInv s hs).map L hL = 𝟙 _ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "@[reassoc (attr := simp)] lemma map_s_comp_map (φ : W.RightFraction X Y) (L : C ⥤ D) (hL : W.IsInvertedBy L) : L.map φ.s ≫ φ.map L hL = L.map φ.f :=", "area": "CategoryTheory"} {"task": "t8", "statement": "@[simp] lemma map_ofHom (f : X ⟶ Y) (L : C ⥤ D) (hL : W.IsInvertedBy L) [W.ContainsIdentities] : (ofHom W f).map L hL = L.map f :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma refl {X Y : C} (z : W.LeftFraction X Y) : LeftFractionRel z z :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma symm {X Y : C} {z₁ z₂ : W.LeftFraction X Y} (h : LeftFractionRel z₁ z₂) : LeftFractionRel z₂ z₁ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma trans {X Y : C} {z₁ z₂ z₃ : W.LeftFraction X Y} [HasLeftCalculusOfFractions W] (h₁₂ : LeftFractionRel z₁ z₂) (h₂₃ : LeftFractionRel z₂ z₃) : LeftFractionRel z₁ z₃ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma comp₀_rel {X Y Z : C} (z₁ : W.LeftFraction X Y) (z₂ : W.LeftFraction Y Z) (z₃ z₃' : W.LeftFraction z₁.Y' z₂.Y') (h₃ : z₂.f ≫ z₃.s = z₁.s ≫ z₃.f) (h₃' : z₂.f ≫ z₃'.s = z₁.s ≫ z₃'.f) : LeftFractionRel (z₁.comp₀ z₂ z₃) (z₁.comp₀ z₂ z₃') :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma Localization.Hom.mk_surjective {X Y : C} (f : Localization.Hom W X Y) : ∃ (z : W.LeftFraction X Y), f = mk z :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma homMk_comp_homMk {X Y Z : C} (z₁ : W.LeftFraction X Y) (z₂ : W.LeftFraction Y Z) (z₃ : W.LeftFraction z₁.Y' z₂.Y') (h₃ : z₂.f ≫ z₃.s = z₁.s ≫ z₃.f) : homMk z₁ ≫ homMk z₂ = homMk (z₁.comp₀ z₂ z₃) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma Q_map_comp_Qinv {X Y Y' : C} (f : X ⟶ Y') (s : Y ⟶ Y') (hs : W s) : (Q W).map f ≫ Qinv s hs = homMk (mk f s hs) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma fac (F : C ⥤ E) (hF : W.IsInvertedBy F) : Q W ⋙ lift F hF = F :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma uniq (F₁ F₂ : Localization W ⥤ E) (h : Q W ⋙ F₁ = Q W ⋙ F₂) : F₁ = F₂ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma homMk_eq {X Y : C} (f : LeftFraction W X Y) : homMk f = f.map (Q W) (Localization.inverts _ W) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma map_eq_iff {X Y : C} (f g : LeftFraction W X Y) : f.map (LeftFraction.Localization.Q W) (Localization.inverts _ _) = g.map (LeftFraction.Localization.Q W) (Localization.inverts _ _) ↔ LeftFractionRel f g :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma map_compatibility {X Y : C} (φ : W.LeftFraction X Y) {E : Type*} [Category E] (L₁ : C ⥤ D) (L₂ : C ⥤ E) [L₁.IsLocalization W] [L₂.IsLocalization W] : (Localization.uniq L₁ L₂ W).functor.map (φ.map L₁ (Localization.inverts L₁ W)) = (Localization.compUniqFunctor L₁ L₂ W).hom.app X ≫ φ.map L₂ (Localization.inverts L₂ W) ≫ (Localization.compUniqFunctor L₁ L₂ W).inv.app Y :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma map_eq_of_map_eq {X Y : C} (φ₁ φ₂ : W.LeftFraction X Y) {E : Type*} [Category E] (L₁ : C ⥤ D) (L₂ : C ⥤ E) [L₁.IsLocalization W] [L₂.IsLocalization W] (h : φ₁.map L₁ (Localization.inverts L₁ W) = φ₂.map L₁ (Localization.inverts L₁ W)) : φ₁.map L₂ (Localization.inverts L₂ W) = φ₂.map L₂ (Localization.inverts L₂ W) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma map_comp_map_eq_map {X Y Z : C} (z₁ : W.LeftFraction X Y) (z₂ : W.LeftFraction Y Z) (z₃ : W.LeftFraction z₁.Y' z₂.Y') (h₃ : z₂.f ≫ z₃.s = z₁.s ≫ z₃.f) (L : C ⥤ D) [L.IsLocalization W] : z₁.map L (Localization.inverts L W) ≫ z₂.map L (Localization.inverts L W) = (z₁.comp₀ z₂ z₃).map L (Localization.inverts L W) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma Localization.exists_leftFraction {X Y : C} (f : L.obj X ⟶ L.obj Y) : ∃ (φ : W.LeftFraction X Y), f = φ.map L (Localization.inverts L W) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma MorphismProperty.LeftFraction.map_eq_iff {X Y : C} (φ ψ : W.LeftFraction X Y) : φ.map L (Localization.inverts _ _) = ψ.map L (Localization.inverts _ _) ↔ LeftFractionRel φ ψ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma MorphismProperty.map_eq_iff_postcomp {X Y : C} (f₁ f₂ : X ⟶ Y) : L.map f₁ = L.map f₂ ↔ ∃ (Z : C) (s : Y ⟶ Z) (_ : W s), f₁ ≫ s = f₂ ≫ s :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma Localization.essSurj_mapArrow : L.mapArrow.EssSurj where", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma RightFraction.op_map {X Y : C} (φ : W.RightFraction X Y) (L : C ⥤ D) (hL : W.IsInvertedBy L) : (φ.map L hL).op = φ.op.map L.op hL.op :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma LeftFraction.op_map {X Y : C} (φ : W.LeftFraction X Y) (L : C ⥤ D) (hL : W.IsInvertedBy L) : (φ.map L hL).op = φ.op.map L.op hL.op :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma RightFractionRel.op {X Y : C} {z₁ z₂ : W.RightFraction X Y} (h : RightFractionRel z₁ z₂) : LeftFractionRel z₁.op z₂.op :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma RightFractionRel.unop {W : MorphismProperty Cᵒᵖ} {X Y : Cᵒᵖ} {z₁ z₂ : W.RightFraction X Y} (h : RightFractionRel z₁ z₂) : LeftFractionRel z₁.unop z₂.unop :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma LeftFractionRel.op {X Y : C} {z₁ z₂ : W.LeftFraction X Y} (h : LeftFractionRel z₁ z₂) : RightFractionRel z₁.op z₂.op :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma LeftFractionRel.unop {W : MorphismProperty Cᵒᵖ} {X Y : Cᵒᵖ} {z₁ z₂ : W.LeftFraction X Y} (h : LeftFractionRel z₁ z₂) : RightFractionRel z₁.unop z₂.unop :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma Localization.exists_rightFraction {X Y : C} (f : L.obj X ⟶ L.obj Y) : ∃ (φ : W.RightFraction X Y), f = φ.map L (Localization.inverts L W) :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma MorphismProperty.RightFraction.map_eq_iff {X Y : C} (φ ψ : W.RightFraction X Y) : φ.map L (Localization.inverts _ _) = ψ.map L (Localization.inverts _ _) ↔ RightFractionRel φ ψ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma MorphismProperty.map_eq_iff_precomp {Y Z : C} (f₁ f₂ : Y ⟶ Z) : L.map f₁ = L.map f₂ ↔ ∃ (X : C) (s : X ⟶ Y) (_ : W s), s ≫ f₁ = s ≫ f₂ :=", "area": "CategoryTheory"} {"task": "t8", "statement": "lemma Localization.essSurj_mapArrow_of_hasRightCalculusOfFractions : L.mapArrow.EssSurj where", "area": "CategoryTheory"} {"task": "t8", "statement": "theorem Submonoid.fg_iff (P : Submonoid M) : Submonoid.FG P ↔ ∃ S : Set M, Submonoid.closure S = P ∧ S.Finite :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem Submonoid.fg_iff_add_fg (P : Submonoid M) : P.FG ↔ P.toAddSubmonoid.FG :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem AddSubmonoid.fg_iff_mul_fg (P : AddSubmonoid N) : P.FG ↔ P.toSubmonoid.FG :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem Submonoid.FG.map {M' : Type*} [Monoid M'] {P : Submonoid M} (h : P.FG) (e : M →* M') : (P.map e).FG :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem Submonoid.FG.map_injective {M' : Type*} [Monoid M'] {P : Submonoid M} (e : M →* M') (he : Function.Injective e) (h : (P.map e).FG) : P.FG :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem Monoid.fg_iff_submonoid_fg (N : Submonoid M) : Monoid.FG N ↔ N.FG :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem Monoid.fg_of_surjective {M' : Type*} [Monoid M'] [Monoid.FG M] (f : M →* M') (hf : Function.Surjective f) : Monoid.FG M' :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem Subgroup.fg_iff (P : Subgroup G) : Subgroup.FG P ↔ ∃ S : Set G, Subgroup.closure S = P ∧ S.Finite :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem Subgroup.fg_iff_submonoid_fg (P : Subgroup G) : P.FG ↔ P.toSubmonoid.FG :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem Subgroup.fg_iff_add_fg (P : Subgroup G) : P.FG ↔ P.toAddSubgroup.FG :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem AddSubgroup.fg_iff_mul_fg (P : AddSubgroup H) : P.FG ↔ P.toSubgroup.FG :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem Group.rank_le_of_surjective [Group.FG G] [Group.FG G'] (f : G →* G') (hf : Function.Surjective f) : Group.rank G' ≤ Group.rank G :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem rank_congr {H K : Subgroup G} [Group.FG H] [Group.FG K] (h : H = K) : Group.rank H = Group.rank K :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem rank_closure_finset_le_card (s : Finset G) : Group.rank (closure (s : Set G)) ≤ s.card :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem rank_closure_finite_le_nat_card (s : Set G) [Finite s] : Group.rank (closure s) ≤ Nat.card s :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem refl (H : Subgroup G) : Commensurable H H :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem commensurable_inv (H : Subgroup G) (g : ConjAct G) : Commensurable (g • H) H ↔ Commensurable H (g⁻¹ • H) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem isReflection_simple (i : B) : cs.IsReflection (s i) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem pow_two : t ^ 2 = 1 :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem mul_self : t * t = 1 :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem inv : t⁻¹ = t :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem isReflection_inv : cs.IsReflection t⁻¹ :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem odd_length : Odd (ℓ t) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem length_mul_left_ne (w : W) : ℓ (w * t) ≠ ℓ w :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem length_mul_right_ne (w : W) : ℓ (t * w) ≠ ℓ w :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem conj (w : W) : cs.IsReflection (w * t * w⁻¹) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem isReflection_conj_iff (w t : W) : cs.IsReflection (w * t * w⁻¹) ↔ cs.IsReflection t :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem isRightInversion_inv_iff {w t : W} : cs.IsRightInversion w⁻¹ t ↔ cs.IsLeftInversion w t :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem isLeftInversion_inv_iff {w t : W} : cs.IsLeftInversion w⁻¹ t ↔ cs.IsRightInversion w t :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem isRightInversion_mul_left_iff {w : W} : cs.IsRightInversion (w * t) t ↔ ¬cs.IsRightInversion w t :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem isLeftInversion_mul_right_iff {w : W} : cs.IsLeftInversion (t * w) t ↔ ¬cs.IsLeftInversion w t :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem isRightInversion_simple_iff_isRightDescent (w : W) (i : B) : cs.IsRightInversion w (s i) ↔ cs.IsRightDescent w i :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem isLeftInversion_simple_iff_isLeftDescent (w : W) (i : B) : cs.IsLeftInversion w (s i) ↔ cs.IsLeftDescent w i :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem rightInvSeq_singleton (i : B) : ris [i] = [s i] :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem rightInvSeq_concat (ω : List B) (i : B) : ris (ω.concat i) = (List.map (MulAut.conj (s i)) (ris ω)).concat (s i) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem leftInvSeq_eq_reverse_rightInvSeq_reverse (ω : List B) : lis ω = (ris ω.reverse).reverse :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem leftInvSeq_concat (ω : List B) (i : B) : lis (ω.concat i) = (lis ω).concat ((π ω) * (s i) * (π ω)⁻¹) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem rightInvSeq_reverse (ω : List B) : ris (ω.reverse) = (lis ω).reverse :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem leftInvSeq_reverse (ω : List B) : lis (ω.reverse) = (ris ω).reverse :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem length_rightInvSeq (ω : List B) : (ris ω).length = ω.length :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem length_leftInvSeq (ω : List B) : (lis ω).length = ω.length :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem getD_rightInvSeq (ω : List B) (j : ℕ) : (ris ω).getD j 1 = (π (ω.drop (j + 1)))⁻¹ * (Option.map (cs.simple) (ω.get? j)).getD 1 * π (ω.drop (j + 1)) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem getD_leftInvSeq (ω : List B) (j : ℕ) : (lis ω).getD j 1 = π (ω.take j) * (Option.map (cs.simple) (ω.get? j)).getD 1 * (π (ω.take j))⁻¹ :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem getD_rightInvSeq_mul_self (ω : List B) (j : ℕ) : ((ris ω).getD j 1) * ((ris ω).getD j 1) = 1 :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem getD_leftInvSeq_mul_self (ω : List B) (j : ℕ) : ((lis ω).getD j 1) * ((lis ω).getD j 1) = 1 :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem rightInvSeq_drop (ω : List B) (j : ℕ) : ris (ω.drop j) = (ris ω).drop j :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem leftInvSeq_take (ω : List B) (j : ℕ) : lis (ω.take j) = (lis ω).take j :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem isReflection_of_mem_rightInvSeq (ω : List B) {t : W} (ht : t ∈ ris ω) : cs.IsReflection t :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem isReflection_of_mem_leftInvSeq (ω : List B) {t : W} (ht : t ∈ lis ω) : cs.IsReflection t :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem wordProd_mul_getD_rightInvSeq (ω : List B) (j : ℕ) : π ω * ((ris ω).getD j 1) = π (ω.eraseIdx j) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem getD_leftInvSeq_mul_wordProd (ω : List B) (j : ℕ) : ((lis ω).getD j 1) * π ω = π (ω.eraseIdx j) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem isRightInversion_of_mem_rightInvSeq {ω : List B} (hω : cs.IsReduced ω) {t : W} (ht : t ∈ ris ω) : cs.IsRightInversion (π ω) t :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem isLeftInversion_of_mem_leftInvSeq {ω : List B} (hω : cs.IsReduced ω) {t : W} (ht : t ∈ lis ω) : cs.IsLeftInversion (π ω) t :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem prod_rightInvSeq (ω : List B) : prod (ris ω) = (π ω)⁻¹ :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem prod_leftInvSeq (ω : List B) : prod (lis ω) = (π ω)⁻¹ :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem IsReduced.nodup_rightInvSeq {ω : List B} (rω : cs.IsReduced ω) : List.Nodup (ris ω) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem IsReduced.nodup_leftInvSeq {ω : List B} (rω : cs.IsReduced ω) : List.Nodup (lis ω) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem inv_smul_smul (c : α) (x : β) : c⁻¹ • c • x = x :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem smul_inv_smul (c : α) (x : β) : c • c⁻¹ • x = x :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem smul_inv [Group β] [SMulCommClass α β β] [IsScalarTower α β β] (c : α) (x : β) : (c • x)⁻¹ = c⁻¹ • x⁻¹ :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem smul_zpow [Group β] [SMulCommClass α β β] [IsScalarTower α β β] (c : α) (x : β) (p : ℤ) : (c • x) ^ p = c ^ p • x ^ p :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem Commute.smul_left_iff [Mul β] [SMulCommClass α β β] [IsScalarTower α β β] {a b : β} (r : α) : Commute (r • a) b ↔ Commute a b :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem inv_smul_eq_iff₀ {a : α} (ha : a ≠ 0) {x y : β} : a⁻¹ • x = y ↔ x = a • y :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem smul_eq_zero_iff_eq (a : α) {x : β} : a • x = 0 ↔ x = 0 :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem IsUnit.smul_sub_iff_sub_inv_smul [AddGroup β] [DistribMulAction α β] [IsScalarTower α β β] [SMulCommClass α β β] (r : α) (a : β) : IsUnit (r • (1 : β) - a) ↔ IsUnit (1 - r⁻¹ • a) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem fixedPoints_eq_center : fixedPoints (ConjAct G) G = center G :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem mem_orbit_conjAct {g h : G} : g ∈ orbit (ConjAct G) h ↔ IsConj g h :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem orbitRel_conjAct : (orbitRel (ConjAct G) G).Rel = IsConj :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem orbit_eq_carrier_conjClasses (g : G) : orbit (ConjAct G) g = (ConjClasses.mk g).carrier :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem _root_.MulAut.conjNormal_symm_apply {H : Subgroup G} [H.Normal] (g : G) (h : H) : ↑((MulAut.conjNormal g).symm h) = g⁻¹ * h * g :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem mem_orbit_self (a : α) : a ∈ orbit M a :=", "area": "GroupTheory"} {"task": "t8", "statement": "@[to_additive] lemma orbit_submonoid_subset (S : Submonoid M) (a : α) : orbit S a ⊆ orbit M a :=", "area": "GroupTheory"} {"task": "t8", "statement": "@[to_additive] lemma fst_mem_orbit_of_mem_orbit {x y : α × β} (h : x ∈ MulAction.orbit M y) : x.1 ∈ MulAction.orbit M y.1 :=", "area": "GroupTheory"} {"task": "t8", "statement": "@[to_additive] lemma snd_mem_orbit_of_mem_orbit {x y : α × β} (h : x ∈ MulAction.orbit M y) : x.2 ∈ MulAction.orbit M y.2 :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem mem_fixedPoints_iff_card_orbit_eq_one {a : α} [Fintype (orbit M a)] : a ∈ fixedPoints M α ↔ Fintype.card (orbit M a) = 1 :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem smul_cancel_of_non_zero_divisor {M R : Type*} [Monoid M] [NonUnitalNonAssocRing R] [DistribMulAction M R] (k : M) (h : ∀ x : R, k • x = 0 → x = 0) {a b : R} (h' : k • a = k • b) : a = b :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem orbit_smul (g : G) (a : α) : orbit G (g • a) = orbit G a :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem mem_orbit_smul (g : G) (a : α) : a ∈ orbit G (g • a) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem smul_mem_orbit_smul (g h : G) (a : α) : g • a ∈ orbit G (h • a) :=", "area": "GroupTheory"} {"task": "t8", "statement": "@[to_additive] lemma mem_orbit_symm {a₁ a₂ : α} : a₁ ∈ orbit G a₂ ↔ a₂ ∈ orbit G a₁ :=", "area": "GroupTheory"} {"task": "t8", "statement": "@[to_additive] lemma mem_subgroup_orbit_iff {H : Subgroup G} {x : α} {a b : orbit G x} : a ∈ MulAction.orbit H b ↔ (a : α) ∈ MulAction.orbit H (b : α) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem quotient_preimage_image_eq_union_mul (U : Set α) : letI := orbitRel G α Quotient.mk' ⁻¹' (Quotient.mk' '' U) = ⋃ g : G, (g • ·) '' U :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem disjoint_image_image_iff {U V : Set α} : letI := orbitRel G α Disjoint (Quotient.mk' '' U) (Quotient.mk' '' V) ↔ ∀ x ∈ U, ∀ g : G, g • x ∉ V :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem pretransitive_iff_subsingleton_quotient : IsPretransitive G α ↔ Subsingleton (orbitRel.Quotient G α) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem pretransitive_iff_unique_quotient_of_nonempty [Nonempty α] : IsPretransitive G α ↔ Nonempty (Unique <| orbitRel.Quotient G α) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem orbitRel.Quotient.mem_orbit {a : α} {x : orbitRel.Quotient G α} : a ∈ x.orbit ↔ Quotient.mk'' a = x :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem orbitRel.Quotient.orbit_eq_orbit_out (x : orbitRel.Quotient G α) {φ : orbitRel.Quotient G α → α} (hφ : letI := orbitRel G α; RightInverse φ Quotient.mk') : orbitRel.Quotient.orbit x = MulAction.orbit G (φ x) :=", "area": "GroupTheory"} {"task": "t8", "statement": "@[to_additive] lemma orbitRel.Quotient.orbit_injective : Injective (orbitRel.Quotient.orbit : orbitRel.Quotient G α → Set α) :=", "area": "GroupTheory"} {"task": "t8", "statement": "@[to_additive] lemma orbitRel.quotient_eq_of_quotient_subgroup_eq {H : Subgroup G} {a b : α} (h : (⟦a⟧ : orbitRel.Quotient H α) = ⟦b⟧) : (⟦a⟧ : orbitRel.Quotient G α) = ⟦b⟧ :=", "area": "GroupTheory"} {"task": "t8", "statement": "@[to_additive] nonrec lemma orbitRel.Quotient.orbit_nonempty (x : orbitRel.Quotient G α) : Set.Nonempty x.orbit :=", "area": "GroupTheory"} {"task": "t8", "statement": "@[to_additive] nonrec lemma orbitRel.Quotient.mapsTo_smul_orbit (g : G) (x : orbitRel.Quotient G α) : Set.MapsTo (g • ·) x.orbit x.orbit :=", "area": "GroupTheory"} {"task": "t8", "statement": "@[to_additive (attr := norm_cast, simp)] lemma orbitRel.Quotient.mem_subgroup_orbit_iff {H : Subgroup G} {x : orbitRel.Quotient G α} {a b : x.orbit} : (a : α) ∈ MulAction.orbit H (b : α) ↔ a ∈ MulAction.orbit H b :=", "area": "GroupTheory"} {"task": "t8", "statement": "@[to_additive] lemma orbitRel.Quotient.subgroup_quotient_eq_iff {H : Subgroup G} {x : orbitRel.Quotient G α} {a b : x.orbit} : (⟦a⟧ : orbitRel.Quotient H x.orbit) = ⟦b⟧ ↔ (⟦↑a⟧ : orbitRel.Quotient H α) = ⟦↑b⟧ :=", "area": "GroupTheory"} {"task": "t8", "statement": "@[to_additive] lemma orbitRel.Quotient.mem_subgroup_orbit_iff' {H : Subgroup G} {x : orbitRel.Quotient G α} {a b : x.orbit} {c : α} (h : (⟦a⟧ : orbitRel.Quotient H x.orbit) = ⟦b⟧) : (a : α) ∈ MulAction.orbit H c ↔ (b : α) ∈ MulAction.orbit H c :=", "area": "GroupTheory"} {"task": "t8", "statement": "@[to_additive] lemma le_stabilizer_smul_left [SMul α β] [IsScalarTower G α β] (a : α) (b : β) : stabilizer G a ≤ stabilizer G (a • b) :=", "area": "GroupTheory"} {"task": "t8", "statement": "@[to_additive] lemma le_stabilizer_smul_right [SMul α β] [SMulCommClass G α β] (a : α) (b : β) : stabilizer G b ≤ stabilizer G (a • b) :=", "area": "GroupTheory"} {"task": "t8", "statement": "@[to_additive (attr := simp)] lemma stabilizer_smul_eq_left [SMul α β] [IsScalarTower G α β] (a : α) (b : β) (h : Injective (· • b : α → β)) : stabilizer G (a • b) = stabilizer G a :=", "area": "GroupTheory"} {"task": "t8", "statement": "@[to_additive (attr := simp)] lemma stabilizer_smul_eq_right [Group α] [MulAction α β] [SMulCommClass G α β] (a : α) (b : β) : stabilizer G (a • b) = stabilizer G b :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem stabilizer_smul_eq_stabilizer_map_conj (g : G) (a : α) : stabilizer G (g • a) = (stabilizer G a).map (MulAut.conj g).toMonoidHom :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem stabilizer_vadd_eq_stabilizer_map_conj (g : G) (a : α) : stabilizer G (g +ᵥ a) = (stabilizer G a).map (AddAut.conj g).toAddMonoidHom :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem Equiv.swap_mem_stabilizer {α : Type*} [DecidableEq α] {S : Set α} {a b : α} : Equiv.swap a b ∈ MulAction.stabilizer (Equiv.Perm α) S ↔ (a ∈ S ↔ b ∈ S) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem le_stabilizer_iff_smul_le (s : Set α) (H : Subgroup G) : H ≤ stabilizer G s ↔ ∀ g ∈ H, g • s ⊆ s :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem mem_stabilizer_of_finite_iff_smul_le (s : Set α) (hs : s.Finite) (g : G) : g ∈ stabilizer G s ↔ g • s ⊆ s :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem mem_stabilizer_of_finite_iff_le_smul (s : Set α) (hs : s.Finite) (g : G) : g ∈ stabilizer G s ↔ s ⊆ g • s :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem list_prod {ι M : Type*} [Monoid M] (c : Con M) {l : List ι} {f g : ι → M} (h : ∀ x ∈ l, c (f x) (g x)) : c (l.map f).prod (l.map g).prod :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem multiset_prod {ι M : Type*} [CommMonoid M] (c : Con M) {s : Multiset ι} {f g : ι → M} (h : ∀ x ∈ s, c (f x) (g x)) : c (s.map f).prod (s.map g).prod :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem ext {c d : Con M} (H : ∀ x y, c x y ↔ d x y) : c = d :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem sInf_toSetoid (S : Set (Con M)) : (sInf S).toSetoid = sInf (toSetoid '' S) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem coe_sInf (S : Set (Con M)) : ⇑(sInf S) = sInf ((⇑) '' S) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem coe_iInf {ι : Sort*} (f : ι → Con M) : ⇑(iInf f) = ⨅ i, ⇑(f i) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem conGen_eq (r : M → M → Prop) : conGen r = sInf { s : Con M | ∀ x y, r x y → s x y } :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem conGen_le {r : M → M → Prop} {c : Con M} (h : ∀ x y, r x y → c x y) : conGen r ≤ c :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem conGen_of_con (c : Con M) : conGen c = c :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem sup_eq_conGen (c d : Con M) : c ⊔ d = conGen fun x y => c x y ∨ d x y :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem sup_def {c d : Con M} : c ⊔ d = conGen (⇑c ⊔ ⇑d) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem sSup_eq_conGen (S : Set (Con M)) : sSup S = conGen fun x y => ∃ c : Con M, c ∈ S ∧ c x y :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem sSup_def {S : Set (Con M)} : sSup S = conGen (sSup ((⇑) '' S)) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem mapOfSurjective_eq_mapGen {c : Con M} {f : M → N} (H : ∀ x y, f (x * y) = f x * f y) (h : mulKer f H ≤ c) (hf : Surjective f) : c.mapGen f = c.mapOfSurjective f H h hf :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem comap_eq {f : N →* M} : comap f f.map_mul c = ker (c.mk'.comp f) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem lift_comp_mk' (H : c ≤ ker f) : (c.lift f H).comp c.mk' = f :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem lift_apply_mk' (f : c.Quotient →* P) : (c.lift (f.comp c.mk') fun x y h => show f ↑x = f ↑y by rw [c.eq.2 h]) = f :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem lift_funext (f g : c.Quotient →* P) (h : ∀ a : M, f a = g a) : f = g :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem lift_unique (H : c ≤ ker f) (g : c.Quotient →* P) (Hg : g.comp c.mk' = f) : g = c.lift f H :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem lift_range (H : c ≤ ker f) : MonoidHom.mrange (c.lift f H) = MonoidHom.mrange f :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem pow {M : Type*} [Monoid M] (c : Con M) : ∀ (n : ℕ) {w x}, c w x → c (w ^ n) (x ^ n)", "area": "GroupTheory"} {"task": "t8", "statement": "theorem smul {α M : Type*} [MulOneClass M] [SMul α M] [IsScalarTower α M M] (c : Con M) (a : α) {w x : M} (h : c w x) : c (a • w) (a • x) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem map_of_mul_left_rel_one [Monoid M] (c : Con M) (f : M → M) (hf : ∀ x, c (f x * x) 1) {x y} (h : c x y) : c (f x) (f y) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem inv {x y} (h : c x y) : c x⁻¹ y⁻¹ :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem div : ∀ {w x y z}, c w x → c y z → c (w / y) (x / z) :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem zpow : ∀ (n : ℤ) {w x}, c w x → c (w ^ n) (x ^ n)", "area": "GroupTheory"} {"task": "t8", "statement": "theorem induction_on_units {p : Units c.Quotient → Prop} (u : Units c.Quotient) (H : ∀ (x y : M) (hxy : c (x * y) 1) (hyx : c (y * x) 1), p ⟨x, y, c.eq.2 hxy, c.eq.2 hyx⟩) : p u :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem isSimpleGroup_of_surjective {H : Type*} [Group H] [IsSimpleGroup G] [Nontrivial H] (f : G →* H) (hf : Function.Surjective f) : IsSimpleGroup H :=", "area": "GroupTheory"} {"task": "t8", "statement": "theorem heq_path_of_eq_image : HEq ((πₘ f).map ⟦p⟧) ((πₘ g).map ⟦q⟧) :=", "area": "AlgebraicTopology"} {"task": "t8", "statement": "theorem start_path : f x₀ = g x₂ :=", "area": "AlgebraicTopology"} {"task": "t8", "statement": "theorem end_path : f x₁ = g x₃ :=", "area": "AlgebraicTopology"} {"task": "t8", "statement": "theorem eq_path_of_eq_image : (πₘ f).map ⟦p⟧ = hcast (start_path hfg) ≫ (πₘ g).map ⟦q⟧ ≫ hcast (end_path hfg).symm :=", "area": "AlgebraicTopology"} {"task": "t8", "statement": "theorem apply_zero_path : (πₘ f).map p = hcast (H.apply_zero x₀).symm ≫ (πₘ H.uliftMap).map (prodToProdTopI (𝟙 (@fromTop (TopCat.of _) (ULift.up 0))) p) ≫ hcast (H.apply_zero x₁) :=", "area": "AlgebraicTopology"} {"task": "t8", "statement": "theorem apply_one_path : (πₘ g).map p = hcast (H.apply_one x₀).symm ≫ (πₘ H.uliftMap).map (prodToProdTopI (𝟙 (@fromTop (TopCat.of _) (ULift.up 1))) p) ≫ hcast (H.apply_one x₁) :=", "area": "AlgebraicTopology"} {"task": "t8", "statement": "theorem evalAt_eq (x : X) : ⟦H.evalAt x⟧ = hcast (H.apply_zero x).symm ≫ (πₘ H.uliftMap).map (prodToProdTopI uhpath01 (𝟙 (fromTop x))) ≫ hcast (H.apply_one x).symm.symm :=", "area": "AlgebraicTopology"} {"task": "t8", "statement": "theorem eq_diag_path : (πₘ f).map p ≫ ⟦H.evalAt x₁⟧ = H.diagonalPath' p ∧ (⟦H.evalAt x₀⟧ ≫ (πₘ g).map p : fromTop (f x₀) ⟶ fromTop (g x₁)) = H.diagonalPath' p :=", "area": "AlgebraicTopology"} {"task": "t8", "statement": "theorem Algebra.leftMulMatrix_complex (z : ℂ) : Algebra.leftMulMatrix Complex.basisOneI z = !![z.re, -z.im; z.im, z.re] :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Algebra.trace_complex_apply (z : ℂ) : Algebra.trace ℝ ℂ z = 2 * z.re :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Algebra.norm_complex_apply (z : ℂ) : Algebra.norm ℝ z = Complex.normSq z :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem left_div_gcd_ne_zero {p q : R} (hp : p ≠ 0) : p / GCDMonoid.gcd p q ≠ 0 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem right_div_gcd_ne_zero {p q : R} (hq : q ≠ 0) : q / GCDMonoid.gcd p q ≠ 0 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Subalgebra.isAlgebraic_iff (S : Subalgebra R A) : S.IsAlgebraic ↔ @Algebra.IsAlgebraic R S _ _ S.algebra :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Algebra.isAlgebraic_iff : Algebra.IsAlgebraic R A ↔ (⊤ : Subalgebra R A).IsAlgebraic :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem isAlgebraic_iff_not_injective {x : A} : IsAlgebraic R x ↔ ¬Function.Injective (Polynomial.aeval x : R[X] →ₐ[R] A) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem isAlgebraic_algebraMap [Nontrivial R] (x : R) : IsAlgebraic R (algebraMap R A x) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem isAlgebraic_one [Nontrivial R] : IsAlgebraic R (1 : A) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem isAlgebraic_nat [Nontrivial R] (n : ℕ) : IsAlgebraic R (n : A) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem isAlgebraic_int [Nontrivial R] (n : ℤ) : IsAlgebraic R (n : A) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem isAlgebraic_rat (R : Type u) {A : Type v} [DivisionRing A] [Field R] [Algebra R A] (n : ℚ) : IsAlgebraic R (n : A) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem IsAlgebraic.algebraMap {a : S} : IsAlgebraic R a → IsAlgebraic R (algebraMap S A a) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem IsAlgebraic.algHom (f : A →ₐ[R] B) {a : A} (h : IsAlgebraic R a) : IsAlgebraic R (f a) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem isAlgebraic_algHom_iff (f : A →ₐ[R] B) (hf : Function.Injective f) {a : A} : IsAlgebraic R (f a) ↔ IsAlgebraic R a :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem IsAlgebraic.of_pow {r : A} {n : ℕ} (hn : 0 < n) (ht : IsAlgebraic R (r ^ n)) : IsAlgebraic R r :=", "area": "RingTheory"} {"task": "t8", "statement": "lemma IsAlgebraic.invOf {x : S} [Invertible x] (h : IsAlgebraic R x) : IsAlgebraic R (⅟ x) :=", "area": "RingTheory"} {"task": "t8", "statement": "lemma IsAlgebraic.inv_iff {K} [Field K] [Algebra R K] {x : K} : IsAlgebraic R (x⁻¹) ↔ IsAlgebraic R x :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem isAlgebraic_iff_isIntegral {x : A} : IsAlgebraic K x ↔ IsIntegral K x :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Algebra.isAlgebraic_iff_isIntegral : Algebra.IsAlgebraic K A ↔ Algebra.IsIntegral K A :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem IsAlgebraic.tower_top_of_injective (hinj : Function.Injective (algebraMap R S)) {x : A} (A_alg : IsAlgebraic R x) : IsAlgebraic S x :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Algebra.IsAlgebraic.trans [L_alg : Algebra.IsAlgebraic K L] [A_alg : Algebra.IsAlgebraic L A] : Algebra.IsAlgebraic K A :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem algHom_bijective [Algebra.IsAlgebraic K L] (f : L →ₐ[K] L) : Function.Bijective f :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem exists_integral_multiple [Algebra R S] {z : S} (hz : IsAlgebraic R z) (inj : ∀ x, algebraMap R S x = 0 → x = 0) : ∃ᵉ (x : integralClosure R S) (y ≠ (0 : R)), z * algebraMap R S y = x :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem IsIntegralClosure.exists_smul_eq_mul {L : Type*} [Field L] [Algebra R S] [Algebra S L] [Algebra R L] [IsScalarTower R S L] [IsIntegralClosure S R L] [Algebra.IsAlgebraic R L] (inj : Function.Injective (algebraMap R L)) (a : S) {b : S} (hb : b ≠ 0) : ∃ᵉ (c : S) (d ≠ (0 : R)), d • a = b * c :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem inv_eq_of_aeval_divX_ne_zero {x : L} {p : K[X]} (aeval_ne : aeval x (divX p) ≠ 0) : x⁻¹ = aeval x (divX p) / (aeval x p - algebraMap _ _ (p.coeff 0)) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem inv_eq_of_root_of_coeff_zero_ne_zero {x : L} {p : K[X]} (aeval_eq : aeval x p = 0) (coeff_zero_ne : p.coeff 0 ≠ 0) : x⁻¹ = -(aeval x (divX p) / algebraMap _ _ (p.coeff 0)) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Subalgebra.inv_mem_of_root_of_coeff_zero_ne_zero {x : A} {p : K[X]} (aeval_eq : aeval x p = 0) (coeff_zero_ne : p.coeff 0 ≠ 0) : (x⁻¹ : L) ∈ A :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Subalgebra.inv_mem_of_algebraic {x : A} (hx : _root_.IsAlgebraic K (x : L)) : (x⁻¹ : L) ∈ A :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Subalgebra.isField_of_algebraic [Algebra.IsAlgebraic K L] : IsField A :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem isArtinian_of_range_eq_ker [IsArtinian R M] [IsArtinian R P] (f : M →ₗ[R] N) (g : N →ₗ[R] P) (hf : Function.Injective f) (hg : Function.Surjective g) (h : LinearMap.range f = LinearMap.ker g) : IsArtinian R N :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem IsArtinian.finite_of_linearIndependent [Nontrivial R] [IsArtinian R M] {s : Set M} (hs : LinearIndependent R ((↑) : s → M)) : s.Finite :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem set_has_minimal_iff_artinian : (∀ a : Set <| Submodule R M, a.Nonempty → ∃ M' ∈ a, ∀ I ∈ a, ¬I < M') ↔ IsArtinian R M :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem monotone_stabilizes_iff_artinian : (∀ f : ℕ →o (Submodule R M)ᵒᵈ, ∃ n, ∀ m, n ≤ m → f n = f m) ↔ IsArtinian R M :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem eventuallyConst_of_isArtinian (f : ℕ →o (Submodule R M)ᵒᵈ) : atTop.EventuallyConst f :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem eventually_codisjoint_ker_pow_range_pow (f : M →ₗ[R] M) : ∀ᶠ n in atTop, Codisjoint (LinearMap.ker (f ^ n)) (LinearMap.range (f ^ n)) :=", "area": "RingTheory"} {"task": "t8", "statement": "lemma eventually_iInf_range_pow_eq (f : Module.End R M) : ∀ᶠ n in atTop, ⨅ m, LinearMap.range (f ^ m) = LinearMap.range (f ^ n) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem eventually_isCompl_ker_pow_range_pow [IsNoetherian R M] (f : M →ₗ[R] M) : ∀ᶠ n in atTop, IsCompl (LinearMap.ker (f ^ n)) (LinearMap.range (f ^ n)) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem isCompl_iSup_ker_pow_iInf_range_pow [IsNoetherian R M] (f : M →ₗ[R] M) : IsCompl (⨆ n, LinearMap.ker (f ^ n)) (⨅ n, LinearMap.range (f ^ n)) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem surjective_of_injective_endomorphism (f : M →ₗ[R] M) (s : Injective f) : Surjective f :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem disjoint_partial_infs_eventually_top (f : ℕ → Submodule R M) (h : ∀ n, Disjoint (partialSups (OrderDual.toDual ∘ f) n) (OrderDual.toDual (f (n + 1)))) : ∃ n : ℕ, ∀ m, n ≤ m → f m = ⊤ :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem range_smul_pow_stabilizes (r : R) : ∃ n : ℕ, ∀ m, n ≤ m → LinearMap.range (r ^ n • LinearMap.id : M →ₗ[R] M) = LinearMap.range (r ^ m • LinearMap.id : M →ₗ[R] M) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem exists_pow_succ_smul_dvd (r : R) (x : M) : ∃ (n : ℕ) (y : M), r ^ n.succ • y = r ^ n • x :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem isArtinian_of_tower (R) {S M} [CommRing R] [Ring S] [AddCommGroup M] [Algebra R S] [Module S M] [Module R M] [IsScalarTower R S M] (h : IsArtinian R M) : IsArtinian S M :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem isArtinian_of_fg_of_artinian {R M} [Ring R] [AddCommGroup M] [Module R M] (N : Submodule R M) [IsArtinianRing R] (hN : N.FG) : IsArtinian R N :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Function.Surjective.isArtinianRing {R} [Ring R] {S} [Ring S] {F} [FunLike F R S] [RingHomClass F R S] {f : F} (hf : Function.Surjective f) [H : IsArtinianRing R] : IsArtinianRing S :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem isNilpotent_jacobson_bot : IsNilpotent (Ideal.jacobson (⊥ : Ideal R)) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem localization_surjective : Function.Surjective (algebraMap R L) :=", "area": "RingTheory"} {"task": "t8", "statement": "lemma primeSpectrum_finite : {I : Ideal R | I.IsPrime}.Finite :=", "area": "RingTheory"} {"task": "t8", "statement": "lemma maximal_ideals_finite : {I : Ideal R | I.IsMaximal}.Finite :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem wittPolyProd_vars (n : ℕ) : (wittPolyProd p n).vars ⊆ univ ×ˢ range (n + 1) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem wittPolyProdRemainder_vars (n : ℕ) : (wittPolyProdRemainder p n).vars ⊆ univ ×ˢ range n :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem remainder_vars (n : ℕ) : (remainder p n).vars ⊆ univ ×ˢ range (n + 1) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem mul_polyOfInterest_aux1 (n : ℕ) : ∑ i ∈ range (n + 1), (p : 𝕄) ^ i * wittMul p i ^ p ^ (n - i) = wittPolyProd p n :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem mul_polyOfInterest_aux2 (n : ℕ) : (p : 𝕄) ^ n * wittMul p n + wittPolyProdRemainder p n = wittPolyProd p n :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem mul_polyOfInterest_aux3 (n : ℕ) : wittPolyProd p (n + 1) = -((p : 𝕄) ^ (n + 1) * X (0, n + 1)) * ((p : 𝕄) ^ (n + 1) * X (1, n + 1)) + (p : 𝕄) ^ (n + 1) * X (0, n + 1) * rename (Prod.mk (1 : Fin 2)) (wittPolynomial p ℤ (n + 1)) + (p : 𝕄) ^ (n + 1) * X (1, n + 1) * rename (Prod.mk (0 : Fin 2)) (wittPolynomial p ℤ (n + 1)) + remainder p n :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem mul_polyOfInterest_aux4 (n : ℕ) : (p : 𝕄) ^ (n + 1) * wittMul p (n + 1) = -((p : 𝕄) ^ (n + 1) * X (0, n + 1)) * ((p : 𝕄) ^ (n + 1) * X (1, n + 1)) + (p : 𝕄) ^ (n + 1) * X (0, n + 1) * rename (Prod.mk (1 : Fin 2)) (wittPolynomial p ℤ (n + 1)) + (p : 𝕄) ^ (n + 1) * X (1, n + 1) * rename (Prod.mk (0 : Fin 2)) (wittPolynomial p ℤ (n + 1)) + (remainder p n - wittPolyProdRemainder p (n + 1)) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem mul_polyOfInterest_aux5 (n : ℕ) : (p : 𝕄) ^ (n + 1) * polyOfInterest p n = remainder p n - wittPolyProdRemainder p (n + 1) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem mul_polyOfInterest_vars (n : ℕ) : ((p : 𝕄) ^ (n + 1) * polyOfInterest p n).vars ⊆ univ ×ˢ range (n + 1) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem polyOfInterest_vars_eq (n : ℕ) : (polyOfInterest p n).vars = ((p : 𝕄) ^ (n + 1) * (wittMul p (n + 1) + (p : 𝕄) ^ (n + 1) * X (0, n + 1) * X (1, n + 1) - X (0, n + 1) * rename (Prod.mk (1 : Fin 2)) (wittPolynomial p ℤ (n + 1)) - X (1, n + 1) * rename (Prod.mk (0 : Fin 2)) (wittPolynomial p ℤ (n + 1)))).vars :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem polyOfInterest_vars (n : ℕ) : (polyOfInterest p n).vars ⊆ univ ×ˢ range (n + 1) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem peval_polyOfInterest (n : ℕ) (x y : 𝕎 k) : peval (polyOfInterest p n) ![fun i => x.coeff i, fun i => y.coeff i] = (x * y).coeff (n + 1) + p ^ (n + 1) * x.coeff (n + 1) * y.coeff (n + 1) - y.coeff (n + 1) * ∑ i ∈ range (n + 1 + 1), p ^ i * x.coeff i ^ p ^ (n + 1 - i) - x.coeff (n + 1) * ∑ i ∈ range (n + 1 + 1), p ^ i * y.coeff i ^ p ^ (n + 1 - i) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem peval_polyOfInterest' (n : ℕ) (x y : 𝕎 k) : peval (polyOfInterest p n) ![fun i => x.coeff i, fun i => y.coeff i] = (x * y).coeff (n + 1) - y.coeff (n + 1) * x.coeff 0 ^ p ^ (n + 1) - x.coeff (n + 1) * y.coeff 0 ^ p ^ (n + 1) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem nth_mul_coeff' (n : ℕ) : ∃ f : TruncatedWittVector p (n + 1) k → TruncatedWittVector p (n + 1) k → k, ∀ x y : 𝕎 k, f (truncateFun (n + 1) x) (truncateFun (n + 1) y) = (x * y).coeff (n + 1) - y.coeff (n + 1) * x.coeff 0 ^ p ^ (n + 1) - x.coeff (n + 1) * y.coeff 0 ^ p ^ (n + 1) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem nth_mul_coeff (n : ℕ) : ∃ f : TruncatedWittVector p (n + 1) k → TruncatedWittVector p (n + 1) k → k, ∀ x y : 𝕎 k, (x * y).coeff (n + 1) = x.coeff (n + 1) * y.coeff 0 ^ p ^ (n + 1) + y.coeff (n + 1) * x.coeff 0 ^ p ^ (n + 1) + f (truncateFun (n + 1) x) (truncateFun (n + 1) y) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem wittPolynomial_eq_sum_C_mul_X_pow (n : ℕ) : wittPolynomial p R n = ∑ i ∈ range (n + 1), C ((p : R) ^ i) * X i ^ p ^ (n - i) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem map_wittPolynomial (f : R →+* S) (n : ℕ) : map f (W n) = W n :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem constantCoeff_wittPolynomial [hp : Fact p.Prime] (n : ℕ) : constantCoeff (wittPolynomial p R n) = 0 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem wittPolynomial_zero : wittPolynomial p R 0 = X 0 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem wittPolynomial_one : wittPolynomial p R 1 = C (p : R) * X 1 + X 0 ^ p :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem aeval_wittPolynomial {A : Type*} [CommRing A] [Algebra R A] (f : ℕ → A) (n : ℕ) : aeval f (W_ R n) = ∑ i ∈ range (n + 1), (p : A) ^ i * f i ^ p ^ (n - i) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem wittPolynomial_zmod_self (n : ℕ) : W_ (ZMod (p ^ (n + 1))) (n + 1) = expand p (W_ (ZMod (p ^ (n + 1))) n) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem wittPolynomial_vars [CharZero R] (n : ℕ) : (wittPolynomial p R n).vars = range (n + 1) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem wittPolynomial_vars_subset (n : ℕ) : (wittPolynomial p R n).vars ⊆ range (n + 1) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem xInTermsOfW_eq [Invertible (p : R)] {n : ℕ} : xInTermsOfW p R n = (X n - ∑ i ∈ range n, C ((p: R) ^ i) * xInTermsOfW p R i ^ p ^ (n - i)) * C ((⅟p : R) ^ n) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem constantCoeff_xInTermsOfW [hp : Fact p.Prime] [Invertible (p : R)] (n : ℕ) : constantCoeff (xInTermsOfW p R n) = 0 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem xInTermsOfW_zero [Invertible (p : R)] : xInTermsOfW p R 0 = X 0 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem xInTermsOfW_vars_aux (n : ℕ) : n ∈ (xInTermsOfW p ℚ n).vars ∧ (xInTermsOfW p ℚ n).vars ⊆ range (n + 1) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem xInTermsOfW_aux [Invertible (p : R)] (n : ℕ) : xInTermsOfW p R n * C ((p : R) ^ n) = X n - ∑ i ∈ range n, C ((p : R) ^ i) * xInTermsOfW p R i ^ p ^ (n - i) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem bind₁_xInTermsOfW_wittPolynomial [Invertible (p : R)] (k : ℕ) : bind₁ (xInTermsOfW p R) (W_ R k) = X k :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem bind₁_wittPolynomial_xInTermsOfW [Invertible (p : R)] (n : ℕ) : bind₁ (W_ R) (xInTermsOfW p R n) = X n :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem succNthDefiningPoly_degree [IsDomain k] (n : ℕ) (a₁ a₂ : 𝕎 k) (bs : Fin (n + 1) → k) (ha₁ : a₁.coeff 0 ≠ 0) (ha₂ : a₂.coeff 0 ≠ 0) : (succNthDefiningPoly p n a₁ a₂ bs).degree = p :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem root_exists (n : ℕ) (a₁ a₂ : 𝕎 k) (bs : Fin (n + 1) → k) (ha₁ : a₁.coeff 0 ≠ 0) (ha₂ : a₂.coeff 0 ≠ 0) : ∃ b : k, (succNthDefiningPoly p n a₁ a₂ bs).IsRoot b :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem succNthVal_spec' (n : ℕ) (a₁ a₂ : 𝕎 k) (bs : Fin (n + 1) → k) (ha₁ : a₁.coeff 0 ≠ 0) (ha₂ : a₂.coeff 0 ≠ 0) : succNthVal p n a₁ a₂ bs ha₁ ha₂ ^ p * a₁.coeff 0 ^ p ^ (n + 1) + a₁.coeff (n + 1) * (bs 0 ^ p) ^ p ^ (n + 1) + nthRemainder p n (fun v => bs v ^ p) (truncateFun (n + 1) a₁) = succNthVal p n a₁ a₂ bs ha₁ ha₂ * a₂.coeff 0 ^ p ^ (n + 1) + a₂.coeff (n + 1) * bs 0 ^ p ^ (n + 1) + nthRemainder p n bs (truncateFun (n + 1) a₂) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem solution_nonzero {a₁ a₂ : 𝕎 k} (ha₁ : a₁.coeff 0 ≠ 0) (ha₂ : a₂.coeff 0 ≠ 0) : solution p a₁ a₂ ≠ 0 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem solution_spec' {a₁ : 𝕎 k} (ha₁ : a₁.coeff 0 ≠ 0) (a₂ : 𝕎 k) : solution p a₁ a₂ ^ p * a₁.coeff 0 = solution p a₁ a₂ * a₂.coeff 0 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem frobeniusRotation_nonzero {a₁ a₂ : 𝕎 k} (ha₁ : a₁.coeff 0 ≠ 0) (ha₂ : a₂.coeff 0 ≠ 0) : frobeniusRotation p ha₁ ha₂ ≠ 0 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem frobenius_frobeniusRotation {a₁ a₂ : 𝕎 k} (ha₁ : a₁.coeff 0 ≠ 0) (ha₂ : a₂.coeff 0 ≠ 0) : frobenius (frobeniusRotation p ha₁ ha₂) * a₁ = frobeniusRotation p ha₁ ha₂ * a₂ :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem exists_frobenius_solution_fractionRing_aux (m n : ℕ) (r' q' : 𝕎 k) (hr' : r'.coeff 0 ≠ 0) (hq' : q'.coeff 0 ≠ 0) (hq : (p : 𝕎 k) ^ n * q' ∈ nonZeroDivisors (𝕎 k)) : let b : 𝕎 k := frobeniusRotation p hr' hq' IsFractionRing.fieldEquivOfRingEquiv (frobeniusEquiv p k) (algebraMap (𝕎 k) (FractionRing (𝕎 k)) b) * Localization.mk ((p : 𝕎 k) ^ m * r') ⟨(p : 𝕎 k) ^ n * q', hq⟩ = (p : Localization (nonZeroDivisors (𝕎 k))) ^ (m - n : ℤ) * algebraMap (𝕎 k) (FractionRing (𝕎 k)) b :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem exists_frobenius_solution_fractionRing {a : FractionRing (𝕎 k)} (ha : a ≠ 0) : ∃ᵉ (b ≠ 0) (m : ℤ), φ b * a = (p : FractionRing (𝕎 k)) ^ m * b :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Ideal.IsHomogeneous.mem_iff {I} (hI : Ideal.IsHomogeneous 𝒜 I) {x} : x ∈ I ↔ ∀ i, (decompose 𝒜 x i : A) ∈ I :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem HomogeneousIdeal.toIdeal_injective : Function.Injective (HomogeneousIdeal.toIdeal : HomogeneousIdeal 𝒜 → Ideal A) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem HomogeneousIdeal.ext' {I J : HomogeneousIdeal 𝒜} (h : ∀ i, ∀ x ∈ 𝒜 i, x ∈ I ↔ x ∈ J) : I = J :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Ideal.mul_homogeneous_element_mem_of_mem {I : Ideal A} (r x : A) (hx₁ : Homogeneous 𝒜 x) (hx₂ : x ∈ I) (j : ι) : GradedRing.proj 𝒜 j (r * x) ∈ I :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Ideal.homogeneous_span (s : Set A) (h : ∀ x ∈ s, Homogeneous 𝒜 x) : (Ideal.span s).IsHomogeneous 𝒜 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Ideal.IsHomogeneous.toIdeal_homogeneousCore_eq_self (h : I.IsHomogeneous 𝒜) : (I.homogeneousCore 𝒜).toIdeal = I :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem HomogeneousIdeal.toIdeal_homogeneousCore_eq_self (I : HomogeneousIdeal 𝒜) : I.toIdeal.homogeneousCore 𝒜 = I :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Ideal.IsHomogeneous.iff_exists : I.IsHomogeneous 𝒜 ↔ ∃ S : Set (homogeneousSubmonoid 𝒜), I = Ideal.span ((↑) '' S) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem bot : Ideal.IsHomogeneous 𝒜 ⊥ :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem top : Ideal.IsHomogeneous 𝒜 ⊤ :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem sup {I J : Ideal A} (HI : I.IsHomogeneous 𝒜) (HJ : J.IsHomogeneous 𝒜) : (I ⊔ J).IsHomogeneous 𝒜 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem iSup {κ : Sort*} {f : κ → Ideal A} (h : ∀ i, (f i).IsHomogeneous 𝒜) : (⨆ i, f i).IsHomogeneous 𝒜 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem iInf {κ : Sort*} {f : κ → Ideal A} (h : ∀ i, (f i).IsHomogeneous 𝒜) : (⨅ i, f i).IsHomogeneous 𝒜 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem sSup {ℐ : Set (Ideal A)} (h : ∀ I ∈ ℐ, Ideal.IsHomogeneous 𝒜 I) : (sSup ℐ).IsHomogeneous 𝒜 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem sInf {ℐ : Set (Ideal A)} (h : ∀ I ∈ ℐ, Ideal.IsHomogeneous 𝒜 I) : (sInf ℐ).IsHomogeneous 𝒜 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem toIdeal_iSup {κ : Sort*} (s : κ → HomogeneousIdeal 𝒜) : (⨆ i, s i).toIdeal = ⨆ i, (s i).toIdeal :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem toIdeal_iInf {κ : Sort*} (s : κ → HomogeneousIdeal 𝒜) : (⨅ i, s i).toIdeal = ⨅ i, (s i).toIdeal :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem toIdeal_iSup₂ {κ : Sort*} {κ' : κ → Sort*} (s : ∀ i, κ' i → HomogeneousIdeal 𝒜) : (⨆ (i) (j), s i j).toIdeal = ⨆ (i) (j), (s i j).toIdeal :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem toIdeal_iInf₂ {κ : Sort*} {κ' : κ → Sort*} (s : ∀ i, κ' i → HomogeneousIdeal 𝒜) : (⨅ (i) (j), s i j).toIdeal = ⨅ (i) (j), (s i j).toIdeal :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Ideal.IsHomogeneous.mul {I J : Ideal A} (HI : I.IsHomogeneous 𝒜) (HJ : J.IsHomogeneous 𝒜) : (I * J).IsHomogeneous 𝒜 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Ideal.homogeneousCore'_eq_sSup : I.homogeneousCore' 𝒜 = sSup { J : Ideal A | J.IsHomogeneous 𝒜 ∧ J ≤ I } :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Ideal.le_toIdeal_homogeneousHull : I ≤ (Ideal.homogeneousHull 𝒜 I).toIdeal :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Ideal.homogeneousHull_mono : Monotone (Ideal.homogeneousHull 𝒜) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Ideal.IsHomogeneous.toIdeal_homogeneousHull_eq_self (h : I.IsHomogeneous 𝒜) : (Ideal.homogeneousHull 𝒜 I).toIdeal = I :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Ideal.toIdeal_homogeneousHull_eq_iSup : (I.homogeneousHull 𝒜).toIdeal = ⨆ i, Ideal.span (GradedRing.proj 𝒜 i '' I) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Ideal.homogeneousHull_eq_iSup : I.homogeneousHull 𝒜 = ⨆ i, ⟨Ideal.span (GradedRing.proj 𝒜 i '' I), Ideal.homogeneous_span 𝒜 _ (by rintro _ ⟨x, -, rfl⟩ apply SetLike.homogeneous_coe)⟩ :=", "area": "RingTheory"} {"task": "t8", "statement": "lemma isLocalization_C_mk' (a : R) (m : M) : C (IsLocalization.mk' S a m) = IsLocalization.mk' (MvPolynomial σ S) (C (σ := σ) a) ⟨C m, Submonoid.mem_map_of_mem C m.property⟩ :=", "area": "RingTheory"} {"task": "t8", "statement": "private lemma auxHom_auxInv : (auxHom S r).toRingHom.comp (auxInv S r) = RingHom.id S :=", "area": "RingTheory"} {"task": "t8", "statement": "private lemma auxInv_auxHom : (auxInv S r).comp (auxHom (S := S) r).toRingHom = RingHom.id _ :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem eq_top_of_unit_mem (x y : α) (hx : x ∈ I) (h : y * x = 1) : I = ⊤ :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem eq_top_iff_one : I = ⊤ ↔ (1 : α) ∈ I :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem unit_mul_mem_iff_mem {x y : α} (hy : IsUnit y) : y * x ∈ I ↔ x ∈ I :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem isCompactElement_top : CompleteLattice.IsCompactElement (⊤ : Ideal α) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem span_singleton_mul_left_unit {a : α} (h2 : IsUnit a) (x : α) : span ({a * x} : Set α) = span {x} :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem span_zero : span (0 : Set α) = ⊥ :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem span_one : span (1 : Set α) = ⊤ :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem span_eq_top_iff_finite (s : Set α) : span s = ⊤ ↔ ∃ s' : Finset α, ↑s' ⊆ s ∧ span (s' : Set α) = ⊤ :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem mem_span_singleton_sup {S : Type*} [CommSemiring S] {x y : S} {I : Ideal S} : x ∈ Ideal.span {y} ⊔ I ↔ ∃ a : S, ∃ b ∈ I, a * y + b = x :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem IsPrime.mem_of_pow_mem {I : Ideal α} (hI : I.IsPrime) {r : α} (n : ℕ) (H : r ^ n ∈ I) : r ∈ I :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem not_isPrime_iff {I : Ideal α} : ¬I.IsPrime ↔ I = ⊤ ∨ ∃ (x : α) (_hx : x ∉ I) (y : α) (_hy : y ∉ I), x * y ∈ I :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem bot_prime [IsDomain α] : (⊥ : Ideal α).IsPrime :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem isMaximal_iff {I : Ideal α} : I.IsMaximal ↔ (1 : α) ∉ I ∧ ∀ (J : Ideal α) (x), I ≤ J → x ∉ I → x ∈ J → (1 : α) ∈ J :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem IsMaximal.coprime_of_ne {M M' : Ideal α} (hM : M.IsMaximal) (hM' : M'.IsMaximal) (hne : M ≠ M') : M ⊔ M' = ⊤ :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem maximal_of_no_maximal {P : Ideal α} (hmax : ∀ m : Ideal α, P < m → ¬IsMaximal m) (J : Ideal α) (hPJ : P < J) : J = ⊤ :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem span_pair_comm {x y : α} : (span {x, y} : Ideal α) = span {y, x} :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem span_pair_add_mul_left {R : Type u} [CommRing R] {x y : R} (z : R) : (span {x + y * z, y} : Ideal R) = span {x, y} :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem span_pair_add_mul_right {R : Type u} [CommRing R] {x y : R} (z : R) : (span {x, y + x * z} : Ideal R) = span {x, y} :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem IsMaximal.exists_inv {I : Ideal α} (hI : I.IsMaximal) {x} (hx : x ∉ I) : ∃ y, ∃ i ∈ I, y * x + i = 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem sInf_isPrime_of_isChain {s : Set (Ideal α)} (hs : s.Nonempty) (hs' : IsChain (· ≤ ·) s) (H : ∀ p ∈ s, Ideal.IsPrime p) : (sInf s).IsPrime :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem mem_span_singleton {x y : α} : x ∈ span ({y} : Set α) ↔ y ∣ x :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem span_singleton_eq_span_singleton {α : Type u} [CommRing α] [IsDomain α] {x y : α} : span ({x} : Set α) = span ({y} : Set α) ↔ Associated x y :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem span_singleton_mul_right_unit {a : α} (h2 : IsUnit a) (x : α) : span ({x * a} : Set α) = span {x} :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem span_singleton_eq_top {x} : span ({x} : Set α) = ⊤ ↔ IsUnit x :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem span_singleton_prime {p : α} (hp : p ≠ 0) : IsPrime (span ({p} : Set α)) ↔ Prime p :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem IsMaximal.isPrime {I : Ideal α} (H : I.IsMaximal) : I.IsPrime :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem span_singleton_lt_span_singleton [IsDomain α] {x y : α} : span ({x} : Set α) < span ({y} : Set α) ↔ DvdNotUnit y x :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem factors_decreasing [IsDomain α] (b₁ b₂ : α) (h₁ : b₁ ≠ 0) (h₂ : ¬IsUnit b₂) : span ({b₁ * b₂} : Set α) < span {b₁} :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem pow_mem_of_mem (ha : a ∈ I) (n : ℕ) (hn : 0 < n) : a ^ n ∈ I :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem pow_mem_of_pow_mem {m n : ℕ} (ha : a ^ m ∈ I) (h : m ≤ n) : a ^ n ∈ I :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem add_pow_mem_of_pow_mem_of_le {m n k : ℕ} (ha : a ^ m ∈ I) (hb : b ^ n ∈ I) (hk : m + n ≤ k + 1) : (a + b) ^ k ∈ I :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem add_pow_add_pred_mem_of_pow_mem {m n : ℕ} (ha : a ^ m ∈ I) (hb : b ^ n ∈ I) : (a + b) ^ (m + n - 1) ∈ I :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem IsPrime.mul_mem_iff_mem_or_mem {I : Ideal α} (hI : I.IsPrime) : ∀ {x y : α}, x * y ∈ I ↔ x ∈ I ∨ y ∈ I :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem pow_multiset_sum_mem_span_pow [DecidableEq α] (s : Multiset α) (n : ℕ) : s.sum ^ (Multiset.card s * n + 1) ∈ span ((s.map fun (x:α) ↦ x ^ (n + 1)).toFinset : Set α) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem sum_pow_mem_span_pow {ι} (s : Finset ι) (f : ι → α) (n : ℕ) : (∑ i ∈ s, f i) ^ (s.card * n + 1) ∈ span ((fun i => f i ^ (n + 1)) '' s) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem span_pow_eq_top (s : Set α) (hs : span s = ⊤) (n : ℕ) : span ((fun (x : α) => x ^ n) '' s) = ⊤ :=", "area": "RingTheory"} {"task": "t8", "statement": "lemma isPrime_of_maximally_disjoint (I : Ideal α) (S : Submonoid α) (disjoint : Disjoint (I : Set α) S) (maximally_disjoint : ∀ (J : Ideal α), I < J → ¬ Disjoint (J : Set α) S) : I.IsPrime where", "area": "RingTheory"} {"task": "t8", "statement": "theorem span_singleton_neg (x : α) : (span {-x} : Ideal α) = span {x} :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem eq_bot_or_top : I = ⊥ ∨ I = ⊤ :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem bot_isMaximal : IsMaximal (⊥ : Ideal K) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem mul_sub_mul_mem {R : Type*} [CommRing R] (I : Ideal R) {a b c d : R} (h1 : a - b ∈ I) (h2 : c - d ∈ I) : a * c - b * d ∈ I :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem exists_not_isUnit_of_not_isField [Nontrivial R] (hf : ¬IsField R) : ∃ (x : R) (_hx : x ≠ (0 : R)), ¬IsUnit x :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem not_isField_iff_exists_ideal_bot_lt_and_lt_top [Nontrivial R] : ¬IsField R ↔ ∃ I : Ideal R, ⊥ < I ∧ I < ⊤ :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem isField_iff_isSimpleOrder_ideal : IsField R ↔ IsSimpleOrder (Ideal R) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem ne_bot_of_isMaximal_of_not_isField [Nontrivial R] {M : Ideal R} (max : M.IsMaximal) (not_field : ¬IsField R) : M ≠ ⊥ :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem bot_lt_of_maximal (M : Ideal R) [hm : M.IsMaximal] (non_field : ¬IsField R) : ⊥ < M :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem exists_max_ideal_of_mem_nonunits [CommSemiring α] (h : a ∈ nonunits α) : ∃ I : Ideal α, I.IsMaximal ∧ a ∈ I :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem associatesEquivIsPrincipal_mul (x y : Associates R) : (associatesEquivIsPrincipal R (x * y) : Ideal R) = (associatesEquivIsPrincipal R x) * (associatesEquivIsPrincipal R y) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem associatesEquivIsPrincipal_map_zero : (associatesEquivIsPrincipal R 0 : Ideal R) = 0 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem associatesEquivIsPrincipal_map_one : (associatesEquivIsPrincipal R 1 : Ideal R) = 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem exists_maximalIdeal_pow_eq_of_principal [IsNoetherianRing R] [LocalRing R] [IsDomain R] (h' : (maximalIdeal R).IsPrincipal) (I : Ideal R) (hI : I ≠ ⊥) : ∃ n : ℕ, I = maximalIdeal R ^ n :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem maximalIdeal_isPrincipal_of_isDedekindDomain [LocalRing R] [IsDomain R] [IsDedekindDomain R] : (maximalIdeal R).IsPrincipal :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem tfae_of_isNoetherianRing_of_localRing_of_isDomain [IsNoetherianRing R] [LocalRing R] [IsDomain R] : List.TFAE [IsPrincipalIdealRing R, ValuationRing R, IsDedekindDomain R, IsIntegrallyClosed R ∧ ∀ P : Ideal R, P ≠ ⊥ → P.IsPrime → P = maximalIdeal R, (maximalIdeal R).IsPrincipal, finrank (ResidueField R) (CotangentSpace R) ≤ 1, ∀ (I) (_ : I ≠ ⊥), ∃ n : ℕ, I = maximalIdeal R ^ n] :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem DiscreteValuationRing.TFAE [IsNoetherianRing R] [LocalRing R] [IsDomain R] (h : ¬IsField R) : List.TFAE [DiscreteValuationRing R, ValuationRing R, IsDedekindDomain R, IsIntegrallyClosed R ∧ ∃! P : Ideal R, P ≠ ⊥ ∧ P.IsPrime, (maximalIdeal R).IsPrincipal, finrank (ResidueField R) (CotangentSpace R) = 1, ∀ (I) (_ : I ≠ ⊥), ∃ n : ℕ, I = maximalIdeal R ^ n] :=", "area": "RingTheory"} {"task": "t8", "statement": "lemma LocalRing.finrank_CotangentSpace_eq_one_iff [IsNoetherianRing R] [LocalRing R] [IsDomain R] : finrank (ResidueField R) (CotangentSpace R) = 1 ↔ DiscreteValuationRing R :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem adjoin_restrictScalars (C D E : Type*) [CommSemiring C] [CommSemiring D] [CommSemiring E] [Algebra C D] [Algebra C E] [Algebra D E] [IsScalarTower C D E] (S : Set E) : (Algebra.adjoin D S).restrictScalars C = (Algebra.adjoin ((⊤ : Subalgebra C D).map (IsScalarTower.toAlgHom C D E)) S).restrictScalars C :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem adjoin_res_eq_adjoin_res (C D E F : Type*) [CommSemiring C] [CommSemiring D] [CommSemiring E] [CommSemiring F] [Algebra C D] [Algebra C E] [Algebra C F] [Algebra D F] [Algebra E F] [IsScalarTower C D F] [IsScalarTower C E F] {S : Set D} {T : Set E} (hS : Algebra.adjoin C S = ⊤) (hT : Algebra.adjoin C T = ⊤) : (Algebra.adjoin E (algebraMap D F '' S)).restrictScalars C = (Algebra.adjoin D (algebraMap E F '' T)).restrictScalars C :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Algebra.fg_trans' {R S A : Type*} [CommSemiring R] [CommSemiring S] [Semiring A] [Algebra R S] [Algebra S A] [Algebra R A] [IsScalarTower R S A] (hRS : (⊤ : Subalgebra R S).FG) (hSA : (⊤ : Subalgebra S A).FG) : (⊤ : Subalgebra R A).FG :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem exists_subalgebra_of_fg (hAC : (⊤ : Subalgebra A C).FG) (hBC : (⊤ : Submodule B C).FG) : ∃ B₀ : Subalgebra A B, B₀.FG ∧ (⊤ : Submodule B₀ C).FG :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem gcd_eq_one_iff_coprime {a b : ℤ} : Int.gcd a b = 1 ↔ IsCoprime a b :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem coprime_iff_nat_coprime {a b : ℤ} : IsCoprime a b ↔ Nat.Coprime a.natAbs b.natAbs :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem gcd_ne_one_iff_gcd_mul_right_ne_one {a : ℤ} {m n : ℕ} : a.gcd (m * n) ≠ 1 ↔ a.gcd m ≠ 1 ∨ a.gcd n ≠ 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem sq_of_gcd_eq_one {a b c : ℤ} (h : Int.gcd a b = 1) (heq : a * b = c ^ 2) : ∃ a0 : ℤ, a = a0 ^ 2 ∨ a = -a0 ^ 2 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem natAbs_euclideanDomain_gcd (a b : ℤ) : Int.natAbs (EuclideanDomain.gcd a b) = Int.gcd a b :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Int.Prime.dvd_mul {m n : ℤ} {p : ℕ} (hp : Nat.Prime p) (h : (p : ℤ) ∣ m * n) : p ∣ m.natAbs ∨ p ∣ n.natAbs :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Int.Prime.dvd_mul' {m n : ℤ} {p : ℕ} (hp : Nat.Prime p) (h : (p : ℤ) ∣ m * n) : (p : ℤ) ∣ m ∨ (p : ℤ) ∣ n :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Int.Prime.dvd_pow {n : ℤ} {k p : ℕ} (hp : Nat.Prime p) (h : (p : ℤ) ∣ n ^ k) : p ∣ n.natAbs :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Int.Prime.dvd_pow' {n : ℤ} {k p : ℕ} (hp : Nat.Prime p) (h : (p : ℤ) ∣ n ^ k) : (p : ℤ) ∣ n :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem prime_two_or_dvd_of_dvd_two_mul_pow_self_two {m : ℤ} {p : ℕ} (hp : Nat.Prime p) (h : (p : ℤ) ∣ 2 * m ^ 2) : p = 2 ∨ p ∣ Int.natAbs m :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Int.exists_prime_and_dvd {n : ℤ} (hn : n.natAbs ≠ 1) : ∃ p, Prime p ∧ p ∣ n :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem span_natAbs (a : ℤ) : Ideal.span ({(a.natAbs : ℤ)} : Set ℤ) = Ideal.span {a} :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem eq_pow_of_mul_eq_pow_bit1_left {a b c : ℤ} (hab : IsCoprime a b) {k : ℕ} (h : a * b = c ^ bit1 k) : ∃ d, a = d ^ bit1 k :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem eq_pow_of_mul_eq_pow_bit1_right {a b c : ℤ} (hab : IsCoprime a b) {k : ℕ} (h : a * b = c ^ bit1 k) : ∃ d, b = d ^ bit1 k :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Polynomial.Monic.irreducible_of_irreducible_map_of_isPrime_nilradical {R S : Type*} [CommRing R] [(nilradical R).IsPrime] [CommRing S] [IsDomain S] (φ : R →+* S) (f : R[X]) (hm : f.Monic) (hi : Irreducible (f.map φ)) : Irreducible f :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem integralClosure.mem_lifts_of_monic_of_dvd_map {f : R[X]} (hf : f.Monic) {g : K[X]} (hg : g.Monic) (hd : g ∣ f.map (algebraMap R K)) : g ∈ lifts (algebraMap (integralClosure R K) K) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem IsIntegrallyClosed.eq_map_mul_C_of_dvd [IsIntegrallyClosed R] {f : R[X]} (hf : f.Monic) {g : K[X]} (hg : g ∣ f.map (algebraMap R K)) : ∃ g' : R[X], g'.map (algebraMap R K) * (C <| leadingCoeff g) = g :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem IsPrimitive.isUnit_iff_isUnit_map_of_injective : IsUnit f ↔ IsUnit (map φ f) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem IsPrimitive.irreducible_of_irreducible_map_of_injective (h_irr : Irreducible (map φ f)) : Irreducible f :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Monic.irreducible_iff_irreducible_map_fraction_map [IsIntegrallyClosed R] {p : R[X]} (h : p.Monic) : Irreducible p ↔ Irreducible (p.map <| algebraMap R K) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem isIntegrallyClosed_iff' : IsIntegrallyClosed R ↔ ∀ p : R[X], p.Monic → (Irreducible p ↔ Irreducible (p.map <| algebraMap R K)) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem Monic.dvd_of_fraction_map_dvd_fraction_map [IsIntegrallyClosed R] {p q : R[X]} (hp : p.Monic) (hq : q.Monic) (h : q.map (algebraMap R K) ∣ p.map (algebraMap R K)) : q ∣ p :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem isUnit_or_eq_zero_of_isUnit_integerNormalization_primPart {p : K[X]} (h0 : p ≠ 0) (h : IsUnit (integerNormalization R⁰ p).primPart) : IsUnit p :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem IsPrimitive.irreducible_iff_irreducible_map_fraction_map {p : R[X]} (hp : p.IsPrimitive) : Irreducible p ↔ Irreducible (p.map (algebraMap R K)) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem IsPrimitive.dvd_of_fraction_map_dvd_fraction_map {p q : R[X]} (hp : p.IsPrimitive) (hq : q.IsPrimitive) (h_dvd : p.map (algebraMap R K) ∣ q.map (algebraMap R K)) : p ∣ q :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem cyclotomic'_zero (R : Type*) [CommRing R] [IsDomain R] : cyclotomic' 0 R = 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem cyclotomic'_one (R : Type*) [CommRing R] [IsDomain R] : cyclotomic' 1 R = X - 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem cyclotomic'_two (R : Type*) [CommRing R] [IsDomain R] (p : ℕ) [CharP R p] (hp : p ≠ 2) : cyclotomic' 2 R = X + 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem natDegree_cyclotomic' {ζ : R} {n : ℕ} (h : IsPrimitiveRoot ζ n) : (cyclotomic' n R).natDegree = Nat.totient n :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem degree_cyclotomic' {ζ : R} {n : ℕ} (h : IsPrimitiveRoot ζ n) : (cyclotomic' n R).degree = Nat.totient n :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem roots_of_cyclotomic (n : ℕ) (R : Type*) [CommRing R] [IsDomain R] : (cyclotomic' n R).roots = (primitiveRoots n R).val :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem X_pow_sub_one_eq_prod {ζ : R} {n : ℕ} (hpos : 0 < n) (h : IsPrimitiveRoot ζ n) : X ^ n - 1 = ∏ ζ ∈ nthRootsFinset n R, (X - C ζ) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem cyclotomic'_splits (n : ℕ) : Splits (RingHom.id K) (cyclotomic' n K) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem X_pow_sub_one_splits {ζ : K} {n : ℕ} (h : IsPrimitiveRoot ζ n) : Splits (RingHom.id K) (X ^ n - C (1 : K)) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem prod_cyclotomic'_eq_X_pow_sub_one {K : Type*} [CommRing K] [IsDomain K] {ζ : K} {n : ℕ} (hpos : 0 < n) (h : IsPrimitiveRoot ζ n) : ∏ i ∈ Nat.divisors n, cyclotomic' i K = X ^ n - 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem cyclotomic'_eq_X_pow_sub_one_div {K : Type*} [CommRing K] [IsDomain K] {ζ : K} {n : ℕ} (hpos : 0 < n) (h : IsPrimitiveRoot ζ n) : cyclotomic' n K = (X ^ n - 1) /ₘ ∏ i ∈ Nat.properDivisors n, cyclotomic' i K :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem int_coeff_of_cyclotomic' {K : Type*} [CommRing K] [IsDomain K] {ζ : K} {n : ℕ} (h : IsPrimitiveRoot ζ n) : ∃ P : ℤ[X], map (Int.castRingHom K) P = cyclotomic' n K ∧ P.degree = (cyclotomic' n K).degree ∧ P.Monic :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem unique_int_coeff_of_cycl {K : Type*} [CommRing K] [IsDomain K] [CharZero K] {ζ : K} {n : ℕ+} (h : IsPrimitiveRoot ζ n) : ∃! P : ℤ[X], map (Int.castRingHom K) P = cyclotomic' n K :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem int_cyclotomic_rw {n : ℕ} (h : n ≠ 0) : cyclotomic n ℤ = (int_coeff_of_cyclotomic' (Complex.isPrimitiveRoot_exp n h)).choose :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem map_cyclotomic_int (n : ℕ) (R : Type*) [Ring R] : map (Int.castRingHom R) (cyclotomic n ℤ) = cyclotomic n R :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem int_cyclotomic_spec (n : ℕ) : map (Int.castRingHom ℂ) (cyclotomic n ℤ) = cyclotomic' n ℂ ∧ (cyclotomic n ℤ).degree = (cyclotomic' n ℂ).degree ∧ (cyclotomic n ℤ).Monic :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem int_cyclotomic_unique {n : ℕ} {P : ℤ[X]} (h : map (Int.castRingHom ℂ) P = cyclotomic' n ℂ) : P = cyclotomic n ℤ :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem map_cyclotomic (n : ℕ) {R S : Type*} [Ring R] [Ring S] (f : R →+* S) : map f (cyclotomic n R) = cyclotomic n S :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem cyclotomic.eval_apply {R S : Type*} (q : R) (n : ℕ) [Ring R] [Ring S] (f : R →+* S) : eval (f q) (cyclotomic n S) = f (eval q (cyclotomic n R)) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem cyclotomic_zero (R : Type*) [Ring R] : cyclotomic 0 R = 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem cyclotomic_one (R : Type*) [Ring R] : cyclotomic 1 R = X - 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem cyclotomic.monic (n : ℕ) (R : Type*) [Ring R] : (cyclotomic n R).Monic :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem degree_cyclotomic (n : ℕ) (R : Type*) [Ring R] [Nontrivial R] : (cyclotomic n R).degree = Nat.totient n :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem natDegree_cyclotomic (n : ℕ) (R : Type*) [Ring R] [Nontrivial R] : (cyclotomic n R).natDegree = Nat.totient n :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem degree_cyclotomic_pos (n : ℕ) (R : Type*) (hpos : 0 < n) [Ring R] [Nontrivial R] : 0 < (cyclotomic n R).degree :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem prod_cyclotomic_eq_X_pow_sub_one {n : ℕ} (hpos : 0 < n) (R : Type*) [CommRing R] : ∏ i ∈ Nat.divisors n, cyclotomic i R = X ^ n - 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem cyclotomic.dvd_X_pow_sub_one (n : ℕ) (R : Type*) [Ring R] : cyclotomic n R ∣ X ^ n - 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem prod_cyclotomic_eq_geom_sum {n : ℕ} (h : 0 < n) (R) [CommRing R] : ∏ i ∈ n.divisors.erase 1, cyclotomic i R = ∑ i ∈ Finset.range n, X ^ i :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem cyclotomic_prime (R : Type*) [Ring R] (p : ℕ) [hp : Fact p.Prime] : cyclotomic p R = ∑ i ∈ Finset.range p, X ^ i :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem cyclotomic_prime_mul_X_sub_one (R : Type*) [Ring R] (p : ℕ) [hn : Fact (Nat.Prime p)] : cyclotomic p R * (X - 1) = X ^ p - 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem cyclotomic_two (R : Type*) [Ring R] : cyclotomic 2 R = X + 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem cyclotomic_three (R : Type*) [Ring R] : cyclotomic 3 R = X ^ 2 + X + 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem cyclotomic_dvd_geom_sum_of_dvd (R) [Ring R] {d n : ℕ} (hdn : d ∣ n) (hd : d ≠ 1) : cyclotomic d R ∣ ∑ i ∈ Finset.range n, X ^ i :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem X_pow_sub_one_mul_prod_cyclotomic_eq_X_pow_sub_one_of_dvd (R) [CommRing R] {d n : ℕ} (h : d ∈ n.properDivisors) : ((X ^ d - 1) * ∏ x ∈ n.divisors \\ d.divisors, cyclotomic x R) = X ^ n - 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem X_pow_sub_one_mul_cyclotomic_dvd_X_pow_sub_one_of_dvd (R) [CommRing R] {d n : ℕ} (h : d ∈ n.properDivisors) : (X ^ d - 1) * cyclotomic n R ∣ X ^ n - 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem cyclotomic_eq_prod_X_pow_sub_one_pow_moebius {n : ℕ} (R : Type*) [CommRing R] [IsDomain R] : algebraMap _ (RatFunc R) (cyclotomic n R) = ∏ i ∈ n.divisorsAntidiagonal, algebraMap R[X] _ (X ^ i.snd - 1) ^ μ i.fst :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem cyclotomic_eq_X_pow_sub_one_div {R : Type*} [CommRing R] {n : ℕ} (hpos : 0 < n) : cyclotomic n R = (X ^ n - 1) /ₘ ∏ i ∈ Nat.properDivisors n, cyclotomic i R :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem X_pow_sub_one_dvd_prod_cyclotomic (R : Type*) [CommRing R] {n m : ℕ} (hpos : 0 < n) (hm : m ∣ n) (hdiff : m ≠ n) : X ^ m - 1 ∣ ∏ i ∈ Nat.properDivisors n, cyclotomic i R :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem cyclotomic_eq_prod_X_sub_primitiveRoots {K : Type*} [CommRing K] [IsDomain K] {ζ : K} {n : ℕ} (hz : IsPrimitiveRoot ζ n) : cyclotomic n K = ∏ μ ∈ primitiveRoots n K, (X - C μ) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem eq_cyclotomic_iff {R : Type*} [CommRing R] {n : ℕ} (hpos : 0 < n) (P : R[X]) : P = cyclotomic n R ↔ (P * ∏ i ∈ Nat.properDivisors n, Polynomial.cyclotomic i R) = X ^ n - 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem cyclotomic_prime_pow_eq_geom_sum {R : Type*} [CommRing R] {p n : ℕ} (hp : p.Prime) : cyclotomic (p ^ (n + 1)) R = ∑ i ∈ Finset.range p, (X ^ p ^ n) ^ i :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem cyclotomic_prime_pow_mul_X_pow_sub_one (R : Type*) [CommRing R] (p k : ℕ) [hn : Fact (Nat.Prime p)] : cyclotomic (p ^ (k + 1)) R * (X ^ p ^ k - 1) = X ^ p ^ (k + 1) - 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem cyclotomic_coeff_zero (R : Type*) [CommRing R] {n : ℕ} (hn : 1 < n) : (cyclotomic n R).coeff 0 = 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem coprime_of_root_cyclotomic {n : ℕ} (hpos : 0 < n) {p : ℕ} [hprime : Fact p.Prime] {a : ℕ} (hroot : IsRoot (cyclotomic n (ZMod p)) (Nat.castRingHom (ZMod p) a)) : a.Coprime p :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem orderOf_root_cyclotomic_dvd {n : ℕ} (hpos : 0 < n) {p : ℕ} [Fact p.Prime] {a : ℕ} (hroot : IsRoot (cyclotomic n (ZMod p)) (Nat.castRingHom (ZMod p) a)) : orderOf (ZMod.unitOfCoprime a (coprime_of_root_cyclotomic hpos hroot)) ∣ n :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem hermite_succ (n : ℕ) : hermite (n + 1) = X * hermite n - derivative (hermite n) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem hermite_eq_iterate (n : ℕ) : hermite n = (fun p => X * p - derivative p)^[n] 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem hermite_one : hermite 1 = X :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem coeff_hermite_succ_zero (n : ℕ) : coeff (hermite (n + 1)) 0 = -coeff (hermite n) 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem coeff_hermite_succ_succ (n k : ℕ) : coeff (hermite (n + 1)) (k + 1) = coeff (hermite n) k - (k + 2) * coeff (hermite n) (k + 2) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem coeff_hermite_of_lt {n k : ℕ} (hnk : n < k) : coeff (hermite n) k = 0 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem coeff_hermite_self (n : ℕ) : coeff (hermite n) n = 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem degree_hermite (n : ℕ) : (hermite n).degree = n :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem leadingCoeff_hermite (n : ℕ) : (hermite n).leadingCoeff = 1 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem coeff_hermite_of_odd_add {n k : ℕ} (hnk : Odd (n + k)) : coeff (hermite n) k = 0 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem coeff_hermite_explicit : ∀ n k : ℕ, coeff (hermite (2 * n + k)) k = (-1) ^ n * (2 * n - 1)‼ * Nat.choose (2 * n + k) k", "area": "RingTheory"} {"task": "t8", "statement": "theorem coeff_hermite_of_even_add {n k : ℕ} (hnk : Even (n + k)) : coeff (hermite n) k = (-1) ^ ((n - k) / 2) * (n - k - 1)‼ * Nat.choose n k :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem coeff_hermite (n k : ℕ) : coeff (hermite n) k = if Even (n + k) then (-1 : ℤ) ^ ((n - k) / 2) * (n - k - 1)‼ * Nat.choose n k else 0 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem coeffIntegerNormalization_of_not_mem_support (p : S[X]) (i : ℕ) (h : coeff p i = 0) : coeffIntegerNormalization M p i = 0 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem coeffIntegerNormalization_mem_support (p : S[X]) (i : ℕ) (h : coeffIntegerNormalization M p i ≠ 0) : i ∈ p.support :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem integerNormalization_coeff (p : S[X]) (i : ℕ) : (integerNormalization M p).coeff i = coeffIntegerNormalization M p i :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem integerNormalization_spec (p : S[X]) : ∃ b : M, ∀ i, algebraMap R S ((integerNormalization M p).coeff i) = (b : R) • p.coeff i :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem integerNormalization_map_to_map (p : S[X]) : ∃ b : M, (integerNormalization M p).map (algebraMap R S) = (b : R) • p :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem integerNormalization_eval₂_eq_zero (g : S →+* R') (p : S[X]) {x : R'} (hx : eval₂ g x p = 0) : eval₂ (g.comp (algebraMap R S)) x (integerNormalization M p) = 0 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem integerNormalization_aeval_eq_zero [Algebra R R'] [Algebra S R'] [IsScalarTower R S R'] (p : S[X]) {x : R'} (hx : aeval x p = 0) : aeval x (integerNormalization M p) = 0 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem integerNormalization_eq_zero_iff {p : K[X]} : integerNormalization (nonZeroDivisors A) p = 0 ↔ p = 0 :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem isAlgebraic_iff [Algebra A C] [Algebra K C] [IsScalarTower A K C] {x : C} : IsAlgebraic A x ↔ IsAlgebraic K x :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem RingHom.isIntegralElem_localization_at_leadingCoeff {R S : Type*} [CommRing R] [CommRing S] (f : R →+* S) (x : S) (p : R[X]) (hf : p.eval₂ f x = 0) (M : Submonoid R) (hM : p.leadingCoeff ∈ M) {Rₘ Sₘ : Type*} [CommRing Rₘ] [CommRing Sₘ] [Algebra R Rₘ] [IsLocalization M Rₘ] [Algebra S Sₘ] [IsLocalization (M.map f : Submonoid S) Sₘ] : (map Sₘ f M.le_comap_map : Rₘ →+* _).IsIntegralElem (algebraMap S Sₘ x) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem isIntegral_localization [Algebra.IsIntegral R S] : (map Sₘ (algebraMap R S) (show _ ≤ (Algebra.algebraMapSubmonoid S M).comap _ from M.le_comap_map) : Rₘ →+* _).IsIntegral :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem IsLocalization.scaleRoots_commonDenom_mem_lifts (p : Rₘ[X]) (hp : p.leadingCoeff ∈ (algebraMap R Rₘ).range) : p.scaleRoots (algebraMap R Rₘ <| IsLocalization.commonDenom M p.support p.coeff) ∈ Polynomial.lifts (algebraMap R Rₘ) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem IsIntegral.exists_multiple_integral_of_isLocalization [Algebra Rₘ S] [IsScalarTower R Rₘ S] (x : S) (hx : IsIntegral Rₘ x) : ∃ m : M, IsIntegral R (m • x) :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem isFractionRing_of_algebraic [Algebra.IsAlgebraic A L] (inj : ∀ x, algebraMap A L x = 0 → x = 0) : IsFractionRing C L :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem isAlgebraic_iff' [Field K] [IsDomain R] [IsDomain S] [Algebra R K] [Algebra S K] [NoZeroSMulDivisors R K] [IsFractionRing S K] [IsScalarTower R S K] : Algebra.IsAlgebraic R S ↔ Algebra.IsAlgebraic R K :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem ideal_span_singleton_map_subset {L : Type*} [IsDomain R] [IsDomain S] [Field K] [Field L] [Algebra R K] [Algebra R L] [Algebra S L] [IsIntegralClosure S R L] [IsFractionRing S L] [Algebra K L] [IsScalarTower R S L] [IsScalarTower R K L] {a : S} {b : Set S} [Algebra.IsAlgebraic R L] (inj : Function.Injective (algebraMap R L)) (h : (Ideal.span ({a} : Set S) : Set S) ⊆ Submodule.span R b) : (Ideal.span ({algebraMap S L a} : Set L) : Set L) ⊆ Submodule.span K (algebraMap S L '' b) :=", "area": "RingTheory"} {"task": "t8", "statement": "lemma isAlgebraic_of_isLocalization {R} [CommRing R] (M : Submonoid R) (S) [CommRing S] [Nontrivial R] [Algebra R S] [IsLocalization M S] : Algebra.IsAlgebraic R S :=", "area": "RingTheory"} {"task": "t8", "statement": "lemma isAlgebraic_of_isFractionRing {R S} (K L) [CommRing R] [CommRing S] [Field K] [CommRing L] [Algebra R S] [Algebra R K] [Algebra R L] [Algebra S L] [Algebra K L] [IsScalarTower R S L] [IsScalarTower R K L] [IsFractionRing S L] [Algebra.IsIntegral R S] : Algebra.IsAlgebraic K L :=", "area": "RingTheory"} {"task": "t8", "statement": "theorem measurable_measure_mul_right (hs : MeasurableSet s) : Measurable fun x => μ ((fun y => y * x) ⁻¹' s) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measurePreserving_mul_prod_inv [IsMulLeftInvariant ν] : MeasurePreserving (fun z : G × G => (z.2 * z.1, z.1⁻¹)) (μ.prod ν) (μ.prod ν) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem quasiMeasurePreserving_inv : QuasiMeasurePreserving (Inv.inv : G → G) μ μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measure_inv_null : μ s⁻¹ = 0 ↔ μ s = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem absolutelyContinuous_inv : μ ≪ μ.inv :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem lintegral_lintegral_mul_inv [IsMulLeftInvariant ν] (f : G → G → ℝ≥0∞) (hf : AEMeasurable (uncurry f) (μ.prod ν)) : (∫⁻ x, ∫⁻ y, f (y * x) x⁻¹ ∂ν ∂μ) = ∫⁻ x, ∫⁻ y, f x y ∂ν ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measure_mul_right_null (y : G) : μ ((fun x => x * y) ⁻¹' s) = 0 ↔ μ s = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem absolutelyContinuous_map_mul_right (g : G) : μ ≪ map (· * g) μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem absolutelyContinuous_map_div_left (g : G) : μ ≪ map (fun h => g / h) μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measure_mul_lintegral_eq [IsMulLeftInvariant ν] (sm : MeasurableSet s) (f : G → ℝ≥0∞) (hf : Measurable f) : (μ s * ∫⁻ y, f y ∂ν) = ∫⁻ x, ν ((fun z => z * x) ⁻¹' s) * f x⁻¹ ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem absolutelyContinuous_of_isMulLeftInvariant [IsMulLeftInvariant ν] (hν : ν ≠ 0) : μ ≪ ν :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem ae_measure_preimage_mul_right_lt_top [IsMulLeftInvariant ν] (sm : MeasurableSet s) (hμs : μ s ≠ ∞) : ∀ᵐ x ∂μ, ν ((fun y => y * x) ⁻¹' s) < ∞ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem ae_measure_preimage_mul_right_lt_top_of_ne_zero [IsMulLeftInvariant ν] (sm : MeasurableSet s) (h2s : ν s ≠ 0) (h3s : ν s ≠ ∞) : ∀ᵐ x ∂μ, ν ((fun y => y * x) ⁻¹' s) < ∞ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measure_lintegral_div_measure [IsMulLeftInvariant ν] (sm : MeasurableSet s) (h2s : ν s ≠ 0) (h3s : ν s ≠ ∞) (f : G → ℝ≥0∞) (hf : Measurable f) : (μ s * ∫⁻ y, f y⁻¹ / ν ((fun x => x * y⁻¹) ⁻¹' s) ∂ν) = ∫⁻ x, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measure_mul_measure_eq [IsMulLeftInvariant ν] {s t : Set G} (hs : MeasurableSet s) (ht : MeasurableSet t) (h2s : ν s ≠ 0) (h3s : ν s ≠ ∞) : μ s * ν t = ν s * μ t :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measure_eq_div_smul [IsMulLeftInvariant ν] (hs : MeasurableSet s) (h2s : ν s ≠ 0) (h3s : ν s ≠ ∞) : μ = (μ s / ν s) • ν :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measurePreserving_mul_prod [IsMulRightInvariant μ] : MeasurePreserving (fun z : G × G => (z.1 * z.2, z.2)) (μ.prod ν) (μ.prod ν) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measurePreserving_div_prod [IsMulRightInvariant μ] : MeasurePreserving (fun z : G × G => (z.1 / z.2, z.2)) (μ.prod ν) (μ.prod ν) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measurePreserving_mul_prod_inv_right [IsMulRightInvariant μ] [IsMulRightInvariant ν] : MeasurePreserving (fun z : G × G => (z.1 * z.2, z.1⁻¹)) (μ.prod ν) (μ.prod ν) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem quasiMeasurePreserving_inv_of_right_invariant [IsMulRightInvariant μ] : QuasiMeasurePreserving (Inv.inv : G → G) μ μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem quasiMeasurePreserving_div_left [IsMulLeftInvariant μ] (g : G) : QuasiMeasurePreserving (fun h : G => g / h) μ μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem quasiMeasurePreserving_div_left_of_right_invariant [IsMulRightInvariant μ] (g : G) : QuasiMeasurePreserving (fun h : G => g / h) μ μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem quasiMeasurePreserving_div_of_right_invariant [IsMulRightInvariant μ] : QuasiMeasurePreserving (fun p : G × G => p.1 / p.2) (μ.prod ν) μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem quasiMeasurePreserving_mul_right [IsMulLeftInvariant μ] (g : G) : QuasiMeasurePreserving (fun h : G => h * g) μ μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem quasiMeasurePreserving_mul_left [IsMulRightInvariant μ] (g : G) : QuasiMeasurePreserving (fun h : G => g * h) μ μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measurable_div_const' {G : Type*} [DivInvMonoid G] [MeasurableSpace G] [MeasurableMul G] (g : G) : Measurable fun h => h / g :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measurableSet_eq_fun {m : MeasurableSpace α} {E} [MeasurableSpace E] [AddGroup E] [MeasurableSingletonClass E] [MeasurableSub₂ E] {f g : α → E} (hf : Measurable f) (hg : Measurable g) : MeasurableSet { x | f x = g x } :=", "area": "MeasureTheory"} {"task": "t8", "statement": "@[measurability] lemma measurableSet_eq_fun' {β : Type*} [CanonicallyOrderedAddCommMonoid β] [Sub β] [OrderedSub β] {_ : MeasurableSpace β} [MeasurableSub₂ β] [MeasurableSingletonClass β] {f g : α → β} (hf : Measurable f) (hg : Measurable g) : MeasurableSet {x | f x = g x} :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem nullMeasurableSet_eq_fun {E} [MeasurableSpace E] [AddGroup E] [MeasurableSingletonClass E] [MeasurableSub₂ E] {f g : α → E} (hf : AEMeasurable f μ) (hg : AEMeasurable g μ) : NullMeasurableSet { x | f x = g x } μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measurableSet_eq_fun_of_countable {m : MeasurableSpace α} {E} [MeasurableSpace E] [MeasurableSingletonClass E] [Countable E] {f g : α → E} (hf : Measurable f) (hg : Measurable g) : MeasurableSet { x | f x = g x } :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem ae_eq_trim_of_measurable {α E} {m m0 : MeasurableSpace α} {μ : Measure α} [MeasurableSpace E] [AddGroup E] [MeasurableSingletonClass E] [MeasurableSub₂ E] (hm : m ≤ m0) {f g : α → E} (hf : Measurable[m] f) (hg : Measurable[m] g) (hfg : f =ᵐ[μ] g) : f =ᵐ[μ.trim hm] g :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measurable_inv_iff {G : Type*} [Group G] [MeasurableSpace G] [MeasurableInv G] {f : α → G} : (Measurable fun x => (f x)⁻¹) ↔ Measurable f :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem aemeasurable_inv_iff {G : Type*} [Group G] [MeasurableSpace G] [MeasurableInv G] {f : α → G} : AEMeasurable (fun x => (f x)⁻¹) μ ↔ AEMeasurable f μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measurable_inv_iff₀ {G₀ : Type*} [GroupWithZero G₀] [MeasurableSpace G₀] [MeasurableInv G₀] {f : α → G₀} : (Measurable fun x => (f x)⁻¹) ↔ Measurable f :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem aemeasurable_inv_iff₀ {G₀ : Type*} [GroupWithZero G₀] [MeasurableSpace G₀] [MeasurableInv G₀] {f : α → G₀} : AEMeasurable (fun x => (f x)⁻¹) μ ↔ AEMeasurable f μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Measurable.mul_iff_right {G : Type*} [MeasurableSpace G] [MeasurableSpace α] [CommGroup G] [MeasurableMul₂ G] [MeasurableInv G] {f g : α → G} (hf : Measurable f) : Measurable (f * g) ↔ Measurable g :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem AEMeasurable.mul_iff_right {G : Type*} [MeasurableSpace G] [MeasurableSpace α] [CommGroup G] [MeasurableMul₂ G] [MeasurableInv G] {μ : Measure α} {f g : α → G} (hf : AEMeasurable f μ) : AEMeasurable (f * g) μ ↔ AEMeasurable g μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measurable_const_smul_iff (c : G) : (Measurable fun x => c • f x) ↔ Measurable f :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem aemeasurable_const_smul_iff (c : G) : AEMeasurable (fun x => c • f x) μ ↔ AEMeasurable f μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem List.measurable_prod' (l : List (α → M)) (hl : ∀ f ∈ l, Measurable f) : Measurable l.prod :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem List.aemeasurable_prod' (l : List (α → M)) (hl : ∀ f ∈ l, AEMeasurable f μ) : AEMeasurable l.prod μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem List.measurable_prod (l : List (α → M)) (hl : ∀ f ∈ l, Measurable f) : Measurable fun x => (l.map fun f : α → M => f x).prod :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem List.aemeasurable_prod (l : List (α → M)) (hl : ∀ f ∈ l, AEMeasurable f μ) : AEMeasurable (fun x => (l.map fun f : α → M => f x).prod) μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Multiset.measurable_prod' (l : Multiset (α → M)) (hl : ∀ f ∈ l, Measurable f) : Measurable l.prod :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Multiset.aemeasurable_prod' (l : Multiset (α → M)) (hl : ∀ f ∈ l, AEMeasurable f μ) : AEMeasurable l.prod μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Multiset.measurable_prod (s : Multiset (α → M)) (hs : ∀ f ∈ s, Measurable f) : Measurable fun x => (s.map fun f : α → M => f x).prod :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Multiset.aemeasurable_prod (s : Multiset (α → M)) (hs : ∀ f ∈ s, AEMeasurable f μ) : AEMeasurable (fun x => (s.map fun f : α → M => f x).prod) μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Finset.measurable_prod (s : Finset ι) (hf : ∀ i ∈ s, Measurable (f i)) : Measurable fun a => ∏ i ∈ s, f i a :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Finset.aemeasurable_prod (s : Finset ι) (hf : ∀ i ∈ s, AEMeasurable (f i) μ) : AEMeasurable (fun a => ∏ i ∈ s, f i a) μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem borel_eq_generateFrom_Iio : borel α = .generateFrom (range Iio) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem borel_eq_generateFrom_Ioi : borel α = .generateFrom (range Ioi) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem borel_eq_generateFrom_Iic : borel α = MeasurableSpace.generateFrom (range Iic) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Set.OrdConnected.measurableSet (h : OrdConnected s) : MeasurableSet s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem generateFrom_Ico_mem_le_borel {α : Type*} [TopologicalSpace α] [LinearOrder α] [OrderClosedTopology α] (s t : Set α) : MeasurableSpace.generateFrom { S | ∃ l ∈ s, ∃ u ∈ t, l < u ∧ Ico l u = S } ≤ borel α :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Dense.borel_eq_generateFrom_Ico_mem_aux {α : Type*} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] [SecondCountableTopology α] {s : Set α} (hd : Dense s) (hbot : ∀ x, IsBot x → x ∈ s) (hIoo : ∀ x y : α, x < y → Ioo x y = ∅ → y ∈ s) : borel α = .generateFrom { S : Set α | ∃ l ∈ s, ∃ u ∈ s, l < u ∧ Ico l u = S } :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Dense.borel_eq_generateFrom_Ico_mem {α : Type*} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] [SecondCountableTopology α] [DenselyOrdered α] [NoMinOrder α] {s : Set α} (hd : Dense s) : borel α = .generateFrom { S : Set α | ∃ l ∈ s, ∃ u ∈ s, l < u ∧ Ico l u = S } :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem borel_eq_generateFrom_Ico (α : Type*) [TopologicalSpace α] [SecondCountableTopology α] [LinearOrder α] [OrderTopology α] : borel α = .generateFrom { S : Set α | ∃ (l u : α), l < u ∧ Ico l u = S } :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Dense.borel_eq_generateFrom_Ioc_mem_aux {α : Type*} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] [SecondCountableTopology α] {s : Set α} (hd : Dense s) (hbot : ∀ x, IsTop x → x ∈ s) (hIoo : ∀ x y : α, x < y → Ioo x y = ∅ → x ∈ s) : borel α = .generateFrom { S : Set α | ∃ l ∈ s, ∃ u ∈ s, l < u ∧ Ioc l u = S } :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Dense.borel_eq_generateFrom_Ioc_mem {α : Type*} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] [SecondCountableTopology α] [DenselyOrdered α] [NoMaxOrder α] {s : Set α} (hd : Dense s) : borel α = .generateFrom { S : Set α | ∃ l ∈ s, ∃ u ∈ s, l < u ∧ Ioc l u = S } :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem borel_eq_generateFrom_Ioc (α : Type*) [TopologicalSpace α] [SecondCountableTopology α] [LinearOrder α] [OrderTopology α] : borel α = .generateFrom { S : Set α | ∃ l u, l < u ∧ Ioc l u = S } :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem ext_of_Ico_finite {α : Type*} [TopologicalSpace α] {m : MeasurableSpace α} [SecondCountableTopology α] [LinearOrder α] [OrderTopology α] [BorelSpace α] (μ ν : Measure α) [IsFiniteMeasure μ] (hμν : μ univ = ν univ) (h : ∀ ⦃a b⦄, a < b → μ (Ico a b) = ν (Ico a b)) : μ = ν :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem ext_of_Ioc_finite {α : Type*} [TopologicalSpace α] {m : MeasurableSpace α} [SecondCountableTopology α] [LinearOrder α] [OrderTopology α] [BorelSpace α] (μ ν : Measure α) [IsFiniteMeasure μ] (hμν : μ univ = ν univ) (h : ∀ ⦃a b⦄, a < b → μ (Ioc a b) = ν (Ioc a b)) : μ = ν :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem ext_of_Ico' {α : Type*} [TopologicalSpace α] {m : MeasurableSpace α} [SecondCountableTopology α] [LinearOrder α] [OrderTopology α] [BorelSpace α] [NoMaxOrder α] (μ ν : Measure α) (hμ : ∀ ⦃a b⦄, a < b → μ (Ico a b) ≠ ∞) (h : ∀ ⦃a b⦄, a < b → μ (Ico a b) = ν (Ico a b)) : μ = ν :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem ext_of_Ioc' {α : Type*} [TopologicalSpace α] {m : MeasurableSpace α} [SecondCountableTopology α] [LinearOrder α] [OrderTopology α] [BorelSpace α] [NoMinOrder α] (μ ν : Measure α) (hμ : ∀ ⦃a b⦄, a < b → μ (Ioc a b) ≠ ∞) (h : ∀ ⦃a b⦄, a < b → μ (Ioc a b) = ν (Ioc a b)) : μ = ν :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem ext_of_Iic {α : Type*} [TopologicalSpace α] {m : MeasurableSpace α} [SecondCountableTopology α] [LinearOrder α] [OrderTopology α] [BorelSpace α] (μ ν : Measure α) [IsFiniteMeasure μ] (h : ∀ a, μ (Iic a) = ν (Iic a)) : μ = ν :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Measurable.max {f g : δ → α} (hf : Measurable f) (hg : Measurable g) : Measurable fun a => max (f a) (g a) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Measurable.min {f g : δ → α} (hf : Measurable f) (hg : Measurable g) : Measurable fun a => min (f a) (g a) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measurable_of_Iio {f : δ → α} (hf : ∀ x, MeasurableSet (f ⁻¹' Iio x)) : Measurable f :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measurable_of_Ioi {f : δ → α} (hf : ∀ x, MeasurableSet (f ⁻¹' Ioi x)) : Measurable f :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measurable_of_Iic {f : δ → α} (hf : ∀ x, MeasurableSet (f ⁻¹' Iic x)) : Measurable f :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measurable_of_Ici {f : δ → α} (hf : ∀ x, MeasurableSet (f ⁻¹' Ici x)) : Measurable f :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Measurable.isLUB {ι} [Countable ι] {f : ι → δ → α} {g : δ → α} (hf : ∀ i, Measurable (f i)) (hg : ∀ b, IsLUB { a | ∃ i, f i b = a } (g b)) : Measurable g :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Measurable.isLUB_of_mem {ι} [Countable ι] {f : ι → δ → α} {g g' : δ → α} (hf : ∀ i, Measurable (f i)) {s : Set δ} (hs : MeasurableSet s) (hg : ∀ b ∈ s, IsLUB { a | ∃ i, f i b = a } (g b)) (hg' : EqOn g g' sᶜ) (g'_meas : Measurable g') : Measurable g :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem AEMeasurable.isLUB {ι} {μ : Measure δ} [Countable ι] {f : ι → δ → α} {g : δ → α} (hf : ∀ i, AEMeasurable (f i) μ) (hg : ∀ᵐ b ∂μ, IsLUB { a | ∃ i, f i b = a } (g b)) : AEMeasurable g μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measurableSet_of_mem_nhdsWithin_Ioi_aux {s : Set α} (h : ∀ x ∈ s, s ∈ 𝓝[>] x) (h' : ∀ x ∈ s, ∃ y, x < y) : MeasurableSet s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measurableSet_of_mem_nhdsWithin_Ioi {s : Set α} (h : ∀ x ∈ s, s ∈ 𝓝[>] x) : MeasurableSet s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma measurableSet_bddAbove_range {ι} [Countable ι] {f : ι → δ → α} (hf : ∀ i, Measurable (f i)) : MeasurableSet {b | BddAbove (range (fun i ↦ f i b))} :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Measurable.iSup_Prop {α} [MeasurableSpace α] [ConditionallyCompleteLattice α] (p : Prop) {f : δ → α} (hf : Measurable f) : Measurable fun b => ⨆ _ : p, f b :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Measurable.iInf_Prop {α} [MeasurableSpace α] [ConditionallyCompleteLattice α] (p : Prop) {f : δ → α} (hf : Measurable f) : Measurable fun b => ⨅ _ : p, f b :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measurable_iSup {ι} [Countable ι] {f : ι → δ → α} (hf : ∀ i, Measurable (f i)) : Measurable (fun b ↦ ⨆ i, f i b) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem aemeasurable_iSup {ι} {μ : Measure δ} [Countable ι] {f : ι → δ → α} (hf : ∀ i, AEMeasurable (f i) μ) : AEMeasurable (fun b => ⨆ i, f i b) μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measurable_sSup {ι} {f : ι → δ → α} {s : Set ι} (hs : s.Countable) (hf : ∀ i ∈ s, Measurable (f i)) : Measurable fun x => sSup ((fun i => f i x) '' s) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measurable_biSup {ι} (s : Set ι) {f : ι → δ → α} (hs : s.Countable) (hf : ∀ i ∈ s, Measurable (f i)) : Measurable fun b => ⨆ i ∈ s, f i b :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem aemeasurable_biSup {ι} {μ : Measure δ} (s : Set ι) {f : ι → δ → α} (hs : s.Countable) (hf : ∀ i ∈ s, AEMeasurable (f i) μ) : AEMeasurable (fun b => ⨆ i ∈ s, f i b) μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measurable_liminf' {ι ι'} {f : ι → δ → α} {v : Filter ι} (hf : ∀ i, Measurable (f i)) {p : ι' → Prop} {s : ι' → Set ι} (hv : v.HasCountableBasis p s) (hs : ∀ j, (s j).Countable) : Measurable fun x => liminf (f · x) v :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem IsFiniteMeasureOnCompacts.map (μ : Measure α) [IsFiniteMeasureOnCompacts μ] (f : α ≃ₜ β) : IsFiniteMeasureOnCompacts (Measure.map f μ) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measure_eq_measure_preimage_add_measure_tsum_Ico_zpow {α : Type*} [MeasurableSpace α] (μ : Measure α) {f : α → ℝ≥0∞} (hf : Measurable f) {s : Set α} (hs : MeasurableSet s) {t : ℝ≥0} (ht : 1 < t) : μ s = μ (s ∩ f ⁻¹' {0}) + μ (s ∩ f ⁻¹' {∞}) + ∑' n : ℤ, μ (s ∩ f ⁻¹' Ico ((t : ℝ≥0∞) ^ n) ((t : ℝ≥0∞) ^ (n + 1))) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Int.measurable_floor [OpensMeasurableSpace R] : Measurable (Int.floor : R → ℤ) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Int.measurable_ceil [OpensMeasurableSpace R] : Measurable (Int.ceil : R → ℤ) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measurable_fract [BorelSpace R] : Measurable (Int.fract : R → R) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem MeasurableSet.image_fract [BorelSpace R] {s : Set R} (hs : MeasurableSet s) : MeasurableSet (Int.fract '' s) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Nat.measurable_floor : Measurable (Nat.floor : R → ℕ) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Nat.measurable_ceil : Measurable (Nat.ceil : R → ℕ) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Memℒp.finStronglyMeasurable_of_stronglyMeasurable (hf : Memℒp f p μ) (hf_meas : StronglyMeasurable f) (hp_ne_zero : p ≠ 0) (hp_ne_top : p ≠ ∞) : FinStronglyMeasurable f μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_eq_snorm' (hp_ne_zero : p ≠ 0) (hp_ne_top : p ≠ ∞) {f : α → F} : snorm f p μ = snorm' f (ENNReal.toReal p) μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma snorm_nnreal_eq_snorm' {f : α → F} {p : ℝ≥0} (hp : p ≠ 0) : snorm f p μ = snorm' f p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_eq_lintegral_rpow_nnnorm (hp_ne_zero : p ≠ 0) (hp_ne_top : p ≠ ∞) {f : α → F} : snorm f p μ = (∫⁻ x, (‖f x‖₊ : ℝ≥0∞) ^ p.toReal ∂μ) ^ (1 / p.toReal) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_one_eq_lintegral_nnnorm {f : α → F} : snorm f 1 μ = ∫⁻ x, ‖f x‖₊ ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_exponent_top {f : α → F} : snorm f ∞ μ = snormEssSup f μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem lintegral_rpow_nnnorm_eq_rpow_snorm' {f : α → F} (hq0_lt : 0 < q) : ∫⁻ a, (‖f a‖₊ : ℝ≥0∞) ^ q ∂μ = snorm' f q μ ^ q :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma snorm_nnreal_pow_eq_lintegral {f : α → F} {p : ℝ≥0} (hp : p ≠ 0) : snorm f p μ ^ (p : ℝ) = ∫⁻ x, ‖f x‖₊ ^ (p : ℝ) ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem lintegral_rpow_nnnorm_lt_top_of_snorm'_lt_top {f : α → F} (hq0_lt : 0 < q) (hfq : snorm' f q μ < ∞) : (∫⁻ a, (‖f a‖₊ : ℝ≥0∞) ^ q ∂μ) < ∞ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem lintegral_rpow_nnnorm_lt_top_of_snorm_lt_top {f : α → F} (hp_ne_zero : p ≠ 0) (hp_ne_top : p ≠ ∞) (hfp : snorm f p μ < ∞) : (∫⁻ a, (‖f a‖₊ : ℝ≥0∞) ^ p.toReal ∂μ) < ∞ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_lt_top_iff_lintegral_rpow_nnnorm_lt_top {f : α → F} (hp_ne_zero : p ≠ 0) (hp_ne_top : p ≠ ∞) : snorm f p μ < ∞ ↔ (∫⁻ a, (‖f a‖₊ : ℝ≥0∞) ^ p.toReal ∂μ) < ∞ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm'_exponent_zero {f : α → F} : snorm' f 0 μ = 1 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_exponent_zero {f : α → F} : snorm f 0 μ = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem memℒp_zero_iff_aestronglyMeasurable {f : α → E} : Memℒp f 0 μ ↔ AEStronglyMeasurable f μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm'_zero (hp0_lt : 0 < q) : snorm' (0 : α → F) q μ = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm'_zero' (hq0_ne : q ≠ 0) (hμ : μ ≠ 0) : snorm' (0 : α → F) q μ = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snormEssSup_zero : snormEssSup (0 : α → F) μ = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_zero : snorm (0 : α → F) p μ = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_zero' : snorm (fun _ : α => (0 : F)) p μ = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem zero_memℒp : Memℒp (0 : α → E) p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm'_measure_zero_of_pos {f : α → F} (hq_pos : 0 < q) : snorm' f q (0 : Measure α) = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm'_measure_zero_of_exponent_zero {f : α → F} : snorm' f 0 (0 : Measure α) = 1 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm'_measure_zero_of_neg {f : α → F} (hq_neg : q < 0) : snorm' f q (0 : Measure α) = ∞ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snormEssSup_measure_zero {f : α → F} : snormEssSup f (0 : Measure α) = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_measure_zero {f : α → F} : snorm f p (0 : Measure α) = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm'_neg {f : α → F} : snorm' (-f) q μ = snorm' f q μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_neg {f : α → F} : snorm (-f) p μ = snorm f p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Memℒp.neg {f : α → E} (hf : Memℒp f p μ) : Memℒp (-f) p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm'_const (c : F) (hq_pos : 0 < q) : snorm' (fun _ : α => c) q μ = (‖c‖₊ : ℝ≥0∞) * μ Set.univ ^ (1 / q) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm'_const' [IsFiniteMeasure μ] (c : F) (hc_ne_zero : c ≠ 0) (hq_ne_zero : q ≠ 0) : snorm' (fun _ : α => c) q μ = (‖c‖₊ : ℝ≥0∞) * μ Set.univ ^ (1 / q) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snormEssSup_const (c : F) (hμ : μ ≠ 0) : snormEssSup (fun _ : α => c) μ = (‖c‖₊ : ℝ≥0∞) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm'_const_of_isProbabilityMeasure (c : F) (hq_pos : 0 < q) [IsProbabilityMeasure μ] : snorm' (fun _ : α => c) q μ = (‖c‖₊ : ℝ≥0∞) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_const (c : F) (h0 : p ≠ 0) (hμ : μ ≠ 0) : snorm (fun _ : α => c) p μ = (‖c‖₊ : ℝ≥0∞) * μ Set.univ ^ (1 / ENNReal.toReal p) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_const' (c : F) (h0 : p ≠ 0) (h_top : p ≠ ∞) : snorm (fun _ : α => c) p μ = (‖c‖₊ : ℝ≥0∞) * μ Set.univ ^ (1 / ENNReal.toReal p) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_const_lt_top_iff {p : ℝ≥0∞} {c : F} (hp_ne_zero : p ≠ 0) (hp_ne_top : p ≠ ∞) : snorm (fun _ : α => c) p μ < ∞ ↔ c = 0 ∨ μ Set.univ < ∞ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem memℒp_const (c : E) [IsFiniteMeasure μ] : Memℒp (fun _ : α => c) p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem memℒp_top_const (c : E) : Memℒp (fun _ : α => c) ∞ μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem memℒp_const_iff {p : ℝ≥0∞} {c : E} (hp_ne_zero : p ≠ 0) (hp_ne_top : p ≠ ∞) : Memℒp (fun _ : α => c) p μ ↔ c = 0 ∨ μ Set.univ < ∞ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm'_mono_nnnorm_ae {f : α → F} {g : α → G} (hq : 0 ≤ q) (h : ∀ᵐ x ∂μ, ‖f x‖₊ ≤ ‖g x‖₊) : snorm' f q μ ≤ snorm' g q μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm'_congr_nnnorm_ae {f g : α → F} (hfg : ∀ᵐ x ∂μ, ‖f x‖₊ = ‖g x‖₊) : snorm' f q μ = snorm' g q μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_mono_nnnorm_ae {f : α → F} {g : α → G} (h : ∀ᵐ x ∂μ, ‖f x‖₊ ≤ ‖g x‖₊) : snorm f p μ ≤ snorm g p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_le_of_ae_nnnorm_bound {f : α → F} {C : ℝ≥0} (hfC : ∀ᵐ x ∂μ, ‖f x‖₊ ≤ C) : snorm f p μ ≤ C • μ Set.univ ^ p.toReal⁻¹ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_le_of_ae_bound {f : α → F} {C : ℝ} (hfC : ∀ᵐ x ∂μ, ‖f x‖ ≤ C) : snorm f p μ ≤ μ Set.univ ^ p.toReal⁻¹ * ENNReal.ofReal C :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_indicator_sub_indicator (s t : Set α) (f : α → E) : snorm (s.indicator f - t.indicator f) p μ = snorm ((s ∆ t).indicator f) p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm'_norm {f : α → F} : snorm' (fun a => ‖f a‖) q μ = snorm' f q μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm'_norm_rpow (f : α → F) (p q : ℝ) (hq_pos : 0 < q) : snorm' (fun x => ‖f x‖ ^ q) p μ = snorm' f (p * q) μ ^ q :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_norm_rpow (f : α → F) (hq_pos : 0 < q) : snorm (fun x => ‖f x‖ ^ q) p μ = snorm f (p * ENNReal.ofReal q) μ ^ q :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem memℒp_congr_ae {f g : α → E} (hfg : f =ᵐ[μ] g) : Memℒp f p μ ↔ Memℒp g p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem memℒp_top_of_bound {f : α → E} (hf : AEStronglyMeasurable f μ) (C : ℝ) (hfC : ∀ᵐ x ∂μ, ‖f x‖ ≤ C) : Memℒp f ∞ μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm'_mono_measure (f : α → F) (hμν : ν ≤ μ) (hq : 0 ≤ q) : snorm' f q ν ≤ snorm' f q μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snormEssSup_mono_measure (f : α → F) (hμν : ν ≪ μ) : snormEssSup f ν ≤ snormEssSup f μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_mono_measure (f : α → F) (hμν : ν ≤ μ) : snorm f p ν ≤ snorm f p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_restrict_eq_of_support_subset {s : Set α} {f : α → F} (hsf : f.support ⊆ s) : snorm f p (μ.restrict s) = snorm f p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm'_smul_measure {p : ℝ} (hp : 0 ≤ p) {f : α → F} (c : ℝ≥0∞) : snorm' f p (c • μ) = c ^ (1 / p) * snorm' f p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snormEssSup_smul_measure {f : α → F} {c : ℝ≥0∞} (hc : c ≠ 0) : snormEssSup f (c • μ) = snormEssSup f μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_smul_measure_of_ne_zero_of_ne_top {p : ℝ≥0∞} (hp_ne_zero : p ≠ 0) (hp_ne_top : p ≠ ∞) {f : α → F} (c : ℝ≥0∞) : snorm f p (c • μ) = c ^ (1 / p).toReal • snorm f p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_smul_measure_of_ne_zero {p : ℝ≥0∞} {f : α → F} {c : ℝ≥0∞} (hc : c ≠ 0) : snorm f p (c • μ) = c ^ (1 / p).toReal • snorm f p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_smul_measure_of_ne_top {p : ℝ≥0∞} (hp_ne_top : p ≠ ∞) {f : α → F} (c : ℝ≥0∞) : snorm f p (c • μ) = c ^ (1 / p).toReal • snorm f p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_one_smul_measure {f : α → F} (c : ℝ≥0∞) : snorm f 1 (c • μ) = c * snorm f 1 μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Memℒp.of_measure_le_smul {μ' : Measure α} (c : ℝ≥0∞) (hc : c ≠ ∞) (hμ'_le : μ' ≤ c • μ) {f : α → E} (hf : Memℒp f p μ) : Memℒp f p μ' :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_one_add_measure (f : α → F) (μ ν : Measure α) : snorm f 1 (μ + ν) = snorm f 1 μ + snorm f 1 ν :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Memℒp.norm {f : α → E} (h : Memℒp f p μ) : Memℒp (fun x => ‖f x‖) p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem memℒp_norm_iff {f : α → E} (hf : AEStronglyMeasurable f μ) : Memℒp (fun x => ‖f x‖) p μ ↔ Memℒp f p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm'_eq_zero_of_ae_zero {f : α → F} (hq0_lt : 0 < q) (hf_zero : f =ᵐ[μ] 0) : snorm' f q μ = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm'_eq_zero_of_ae_zero' (hq0_ne : q ≠ 0) (hμ : μ ≠ 0) {f : α → F} (hf_zero : f =ᵐ[μ] 0) : snorm' f q μ = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem ae_eq_zero_of_snorm'_eq_zero {f : α → E} (hq0 : 0 ≤ q) (hf : AEStronglyMeasurable f μ) (h : snorm' f q μ = 0) : f =ᵐ[μ] 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snormEssSup_eq_zero_iff {f : α → F} : snormEssSup f μ = 0 ↔ f =ᵐ[μ] 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_eq_zero_iff {f : α → E} (hf : AEStronglyMeasurable f μ) (h0 : p ≠ 0) : snorm f p μ = 0 ↔ f =ᵐ[μ] 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma snormEssSup_piecewise {s : Set α} (f g : α → E) [DecidablePred (· ∈ s)] (hs : MeasurableSet s) : snormEssSup (Set.piecewise s f g) μ = max (snormEssSup f (μ.restrict s)) (snormEssSup g (μ.restrict sᶜ)) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_map_measure (hg : AEStronglyMeasurable g (Measure.map f μ)) (hf : AEMeasurable f μ) : snorm g p (Measure.map f μ) = snorm (g ∘ f) p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem memℒp_map_measure_iff (hg : AEStronglyMeasurable g (Measure.map f μ)) (hf : AEMeasurable f μ) : Memℒp g p (Measure.map f μ) ↔ Memℒp (g ∘ f) p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem AEEqFun.snorm_compMeasurePreserving {ν : MeasureTheory.Measure β} (g : β →ₘ[ν] E) (hf : MeasurePreserving f μ ν) : snorm (g.compMeasurePreserving f hf) p μ = snorm g p ν :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem _root_.MeasurableEmbedding.snorm_map_measure {g : β → F} (hf : MeasurableEmbedding f) : snorm g p (Measure.map f μ) = snorm (g ∘ f) p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem _root_.MeasurableEmbedding.memℒp_map_measure_iff {g : β → F} (hf : MeasurableEmbedding f) : Memℒp g p (Measure.map f μ) ↔ Memℒp (g ∘ f) p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm'_le_nnreal_smul_snorm'_of_ae_le_mul {f : α → F} {g : α → G} {c : ℝ≥0} (h : ∀ᵐ x ∂μ, ‖f x‖₊ ≤ c * ‖g x‖₊) {p : ℝ} (hp : 0 < p) : snorm' f p μ ≤ c • snorm' g p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snormEssSup_le_nnreal_smul_snormEssSup_of_ae_le_mul {f : α → F} {g : α → G} {c : ℝ≥0} (h : ∀ᵐ x ∂μ, ‖f x‖₊ ≤ c * ‖g x‖₊) : snormEssSup f μ ≤ c • snormEssSup g μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_le_nnreal_smul_snorm_of_ae_le_mul {f : α → F} {g : α → G} {c : ℝ≥0} (h : ∀ᵐ x ∂μ, ‖f x‖₊ ≤ c * ‖g x‖₊) (p : ℝ≥0∞) : snorm f p μ ≤ c • snorm g p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem le_mul_iff_eq_zero_of_nonneg_of_neg_of_nonneg {α} [LinearOrderedSemiring α] {a b c : α} (ha : 0 ≤ a) (hb : b < 0) (hc : 0 ≤ c) : a ≤ b * c ↔ a = 0 ∧ c = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_eq_zero_and_zero_of_ae_le_mul_neg {f : α → F} {g : α → G} {c : ℝ} (h : ∀ᵐ x ∂μ, ‖f x‖ ≤ c * ‖g x‖) (hc : c < 0) (p : ℝ≥0∞) : snorm f p μ = 0 ∧ snorm g p μ = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snormEssSup_const_smul_le (c : 𝕜) (f : α → F) : snormEssSup (c • f) μ ≤ ‖c‖₊ • snormEssSup f μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_const_smul_le (c : 𝕜) (f : α → F) : snorm (c • f) p μ ≤ ‖c‖₊ • snorm f p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm'_const_smul {f : α → F} (c : 𝕜) (hq_pos : 0 < q) : snorm' (c • f) q μ = ‖c‖₊ • snorm' f q μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snormEssSup_const_smul (c : 𝕜) (f : α → F) : snormEssSup (c • f) μ = (‖c‖₊ : ℝ≥0∞) * snormEssSup f μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snorm_const_smul (c : 𝕜) (f : α → F) : snorm (c • f) p μ = (‖c‖₊ : ℝ≥0∞) * snorm f p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem le_snorm_of_bddBelow (hp : p ≠ 0) (hp' : p ≠ ∞) {f : α → F} (C : ℝ≥0) {s : Set α} (hs : MeasurableSet s) (hf : ∀ᵐ x ∂μ, x ∈ s → C ≤ ‖f x‖₊) : C • μ s ^ (1 / p.toReal) ≤ snorm f p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Memℒp.re (hf : Memℒp f p μ) : Memℒp (fun x => RCLike.re (f x)) p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Memℒp.im (hf : Memℒp f p μ) : Memℒp (fun x => RCLike.im (f x)) p μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem ae_bdd_liminf_atTop_rpow_of_snorm_bdd {p : ℝ≥0∞} {f : ℕ → α → E} (hfmeas : ∀ n, Measurable (f n)) (hbdd : ∀ n, snorm (f n) p μ ≤ R) : ∀ᵐ x ∂μ, liminf (fun n => ((‖f n x‖₊ : ℝ≥0∞) ^ p.toReal : ℝ≥0∞)) atTop < ∞ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem ae_bdd_liminf_atTop_of_snorm_bdd {p : ℝ≥0∞} (hp : p ≠ 0) {f : ℕ → α → E} (hfmeas : ∀ n, Measurable (f n)) (hbdd : ∀ n, snorm (f n) p μ ≤ R) : ∀ᵐ x ∂μ, liminf (fun n => (‖f n x‖₊ : ℝ≥0∞)) atTop < ∞ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem _root_.Continuous.memℒp_top_of_hasCompactSupport {X : Type*} [TopologicalSpace X] [MeasurableSpace X] [OpensMeasurableSpace X] {f : X → E} (hf : Continuous f) (h'f : HasCompactSupport f) (μ : Measure X) : Memℒp f ⊤ μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma toFiniteAux_apply (μ : Measure α) [SFinite μ] (s : Set α) : μ.toFiniteAux s = ∑' n, (2 ^ (n + 1) * sFiniteSeq μ n Set.univ)⁻¹ * sFiniteSeq μ n s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma toFinite_apply (μ : Measure α) [SFinite μ] (s : Set α) : μ.toFinite s = (μ.toFiniteAux Set.univ)⁻¹ * μ.toFiniteAux s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma toFiniteAux_zero : Measure.toFiniteAux (0 : Measure α) = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "@[simp] lemma toFinite_zero : Measure.toFinite (0 : Measure α) = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma toFiniteAux_eq_zero_iff [SFinite μ] : μ.toFiniteAux = 0 ↔ μ = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma toFiniteAux_univ_le_one (μ : Measure α) [SFinite μ] : μ.toFiniteAux Set.univ ≤ 1 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "@[simp] lemma toFinite_eq_zero_iff [SFinite μ] : μ.toFinite = 0 ↔ μ = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma sFiniteSeq_absolutelyContinuous_toFiniteAux (μ : Measure α) [SFinite μ] (n : ℕ) : sFiniteSeq μ n ≪ μ.toFiniteAux :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma absolutelyContinuous_toFinite (μ : Measure α) [SFinite μ] : μ ≪ μ.toFinite :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma toFinite_absolutelyContinuous (μ : Measure α) [SFinite μ] : μ.toFinite ≪ μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem withDensity_densitytoFinite (μ : Measure α) [SFinite μ] : μ.toFinite.withDensity μ.densityToFinite = μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma densityToFinite_ae_lt_top (μ : Measure α) [SigmaFinite μ] : ∀ᵐ x ∂μ, μ.densityToFinite x < ∞ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma restrict_compl_sigmaFiniteSet [SFinite μ] : μ.restrict μ.sigmaFiniteSetᶜ = ∞ • μ.toFinite.restrict μ.sigmaFiniteSetᶜ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma restrict_compl_sigmaFiniteSet_eq_zero_or_top (μ : Measure α) [SFinite μ] (s : Set α) : μ.restrict μ.sigmaFiniteSetᶜ s = 0 ∨ μ.restrict μ.sigmaFiniteSetᶜ s = ∞ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma measure_eq_zero_or_top_of_subset_compl_sigmaFiniteSet [SFinite μ] (ht_subset : t ⊆ μ.sigmaFiniteSetᶜ) : μ t = 0 ∨ μ t = ∞ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma toFinite_withDensity_restrict_sigmaFiniteSet (μ : Measure α) [SFinite μ] : (μ.toFinite.withDensity (fun x ↦ if μ.densityToFinite x ≠ ∞ then μ.densityToFinite x else 1)).restrict μ.sigmaFiniteSet = μ.restrict μ.sigmaFiniteSet :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma sigmaFinite_of_measure_compl_sigmaFiniteSet_eq_zero [SFinite μ] (h : μ μ.sigmaFiniteSetᶜ = 0) : SigmaFinite μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem finset_iUnion_of_pairwise_separated (hm : IsMetric μ) {I : Finset ι} {s : ι → Set X} (hI : ∀ i ∈ I, ∀ j ∈ I, i ≠ j → IsMetricSeparated (s i) (s j)) : μ (⋃ i ∈ I, s i) = ∑ i ∈ I, μ (s i) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem borel_le_caratheodory (hm : IsMetric μ) : borel X ≤ μ.caratheodory :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem le_caratheodory [MeasurableSpace X] [BorelSpace X] (hm : IsMetric μ) : ‹MeasurableSpace X› ≤ μ.caratheodory :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem le_pre : μ ≤ pre m r ↔ ∀ s : Set X, diam s ≤ r → μ s ≤ m s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem mono_pre_nat (m : Set X → ℝ≥0∞) : Monotone fun k : ℕ => pre m k⁻¹ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem tendsto_pre (m : Set X → ℝ≥0∞) (s : Set X) : Tendsto (fun r => pre m r s) (𝓝[>] 0) (𝓝 <| mkMetric' m s) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem tendsto_pre_nat (m : Set X → ℝ≥0∞) (s : Set X) : Tendsto (fun n : ℕ => pre m n⁻¹ s) atTop (𝓝 <| mkMetric' m s) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem eq_iSup_nat (m : Set X → ℝ≥0∞) : mkMetric' m = ⨆ n : ℕ, mkMetric'.pre m n⁻¹ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem trim_pre [MeasurableSpace X] [OpensMeasurableSpace X] (m : Set X → ℝ≥0∞) (hcl : ∀ s, m (closure s) = m s) (r : ℝ≥0∞) : (pre m r).trim = pre m r :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem mkMetric'_isMetric (m : Set X → ℝ≥0∞) : (mkMetric' m).IsMetric :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem mkMetric_mono_smul {m₁ m₂ : ℝ≥0∞ → ℝ≥0∞} {c : ℝ≥0∞} (hc : c ≠ ∞) (h0 : c ≠ 0) (hle : m₁ ≤ᶠ[𝓝[≥] 0] c • m₂) : (mkMetric m₁ : OuterMeasure X) ≤ c • mkMetric m₂ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem mkMetric_top : (mkMetric (fun _ => ∞ : ℝ≥0∞ → ℝ≥0∞) : OuterMeasure X) = ⊤ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem mkMetric_mono {m₁ m₂ : ℝ≥0∞ → ℝ≥0∞} (hle : m₁ ≤ᶠ[𝓝[≥] 0] m₂) : (mkMetric m₁ : OuterMeasure X) ≤ mkMetric m₂ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem isometry_comap_mkMetric (m : ℝ≥0∞ → ℝ≥0∞) {f : X → Y} (hf : Isometry f) (H : Monotone m ∨ Surjective f) : comap f (mkMetric m) = mkMetric m :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem mkMetric_smul (m : ℝ≥0∞ → ℝ≥0∞) {c : ℝ≥0∞} (hc : c ≠ ∞) (hc' : c ≠ 0) : (mkMetric (c • m) : OuterMeasure X) = c • mkMetric m :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem mkMetric_nnreal_smul (m : ℝ≥0∞ → ℝ≥0∞) {c : ℝ≥0} (hc : c ≠ 0) : (mkMetric (c • m) : OuterMeasure X) = c • mkMetric m :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem isometry_map_mkMetric (m : ℝ≥0∞ → ℝ≥0∞) {f : X → Y} (hf : Isometry f) (H : Monotone m ∨ Surjective f) : map f (mkMetric m) = restrict (range f) (mkMetric m) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem isometryEquiv_map_mkMetric (m : ℝ≥0∞ → ℝ≥0∞) (f : X ≃ᵢ Y) : map f (mkMetric m) = mkMetric m :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem trim_mkMetric [MeasurableSpace X] [BorelSpace X] (m : ℝ≥0∞ → ℝ≥0∞) : (mkMetric m : OuterMeasure X).trim = mkMetric m :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem OuterMeasure.coe_mkMetric [MeasurableSpace X] [BorelSpace X] (m : ℝ≥0∞ → ℝ≥0∞) : ⇑(OuterMeasure.mkMetric m : OuterMeasure X) = Measure.mkMetric m :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem mkMetric_mono_smul {m₁ m₂ : ℝ≥0∞ → ℝ≥0∞} {c : ℝ≥0∞} (hc : c ≠ ∞) (h0 : c ≠ 0) (hle : m₁ ≤ᶠ[𝓝[≥] 0] c • m₂) : (mkMetric m₁ : Measure X) ≤ c • mkMetric m₂ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem mkMetric_top : (mkMetric (fun _ => ∞ : ℝ≥0∞ → ℝ≥0∞) : Measure X) = ⊤ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem mkMetric_mono {m₁ m₂ : ℝ≥0∞ → ℝ≥0∞} (hle : m₁ ≤ᶠ[𝓝[≥] 0] m₂) : (mkMetric m₁ : Measure X) ≤ mkMetric m₂ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem mkMetric_apply (m : ℝ≥0∞ → ℝ≥0∞) (s : Set X) : mkMetric m s = ⨆ (r : ℝ≥0∞) (_ : 0 < r), ⨅ (t : ℕ → Set X) (_ : s ⊆ iUnion t) (_ : ∀ n, diam (t n) ≤ r), ∑' n, ⨆ _ : (t n).Nonempty, m (diam (t n)) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem le_mkMetric (m : ℝ≥0∞ → ℝ≥0∞) (μ : Measure X) (ε : ℝ≥0∞) (h₀ : 0 < ε) (h : ∀ s : Set X, diam s ≤ ε → μ s ≤ m (diam s)) : μ ≤ mkMetric m :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem mkMetric_le_liminf_tsum {β : Type*} {ι : β → Type*} [∀ n, Countable (ι n)] (s : Set X) {l : Filter β} (r : β → ℝ≥0∞) (hr : Tendsto r l (𝓝 0)) (t : ∀ n : β, ι n → Set X) (ht : ∀ᶠ n in l, ∀ i, diam (t n i) ≤ r n) (hst : ∀ᶠ n in l, s ⊆ ⋃ i, t n i) (m : ℝ≥0∞ → ℝ≥0∞) : mkMetric m s ≤ liminf (fun n => ∑' i, m (diam (t n i))) l :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem mkMetric_le_liminf_sum {β : Type*} {ι : β → Type*} [hι : ∀ n, Fintype (ι n)] (s : Set X) {l : Filter β} (r : β → ℝ≥0∞) (hr : Tendsto r l (𝓝 0)) (t : ∀ n : β, ι n → Set X) (ht : ∀ᶠ n in l, ∀ i, diam (t n i) ≤ r n) (hst : ∀ᶠ n in l, s ⊆ ⋃ i, t n i) (m : ℝ≥0∞ → ℝ≥0∞) : mkMetric m s ≤ liminf (fun n => ∑ i, m (diam (t n i))) l :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem hausdorffMeasure_zero_or_top {d₁ d₂ : ℝ} (h : d₁ < d₂) (s : Set X) : μH[d₂] s = 0 ∨ μH[d₁] s = ∞ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem hausdorffMeasure_mono {d₁ d₂ : ℝ} (h : d₁ ≤ d₂) (s : Set X) : μH[d₂] s ≤ μH[d₁] s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem noAtoms_hausdorff {d : ℝ} (hd : 0 < d) : NoAtoms (hausdorffMeasure d : Measure X) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem hausdorffMeasure_zero_singleton (x : X) : μH[0] ({x} : Set X) = 1 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem one_le_hausdorffMeasure_zero_of_nonempty {s : Set X} (h : s.Nonempty) : 1 ≤ μH[0] s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem hausdorffMeasure_le_one_of_subsingleton {s : Set X} (hs : s.Subsingleton) {d : ℝ} (hd : 0 ≤ d) : μH[d] s ≤ 1 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem hausdorffMeasure_image_le (h : HolderOnWith C r f s) (hr : 0 < r) {d : ℝ} (hd : 0 ≤ d) : μH[d] (f '' s) ≤ (C : ℝ≥0∞) ^ d * μH[r * d] s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem hausdorffMeasure_image_le (h : LipschitzOnWith K f s) {d : ℝ} (hd : 0 ≤ d) : μH[d] (f '' s) ≤ (K : ℝ≥0∞) ^ d * μH[d] s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem MeasureTheory.Measure.hausdorffMeasure_smul₀ {𝕜 E : Type*} [NormedAddCommGroup E] [NormedField 𝕜] [NormedSpace 𝕜 E] [MeasurableSpace E] [BorelSpace E] {d : ℝ} (hd : 0 ≤ d) {r : 𝕜} (hr : r ≠ 0) (s : Set E) : μH[d] (r • s) = ‖r‖₊ ^ d • μH[d] s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem hausdorffMeasure_preimage_le (hf : AntilipschitzWith K f) (hd : 0 ≤ d) (s : Set Y) : μH[d] (f ⁻¹' s) ≤ (K : ℝ≥0∞) ^ d * μH[d] s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem hausdorffMeasure_image (hf : Isometry f) (hd : 0 ≤ d ∨ Surjective f) (s : Set X) : μH[d] (f '' s) = μH[d] s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem hausdorffMeasure_preimage (hf : Isometry f) (hd : 0 ≤ d ∨ Surjective f) (s : Set Y) : μH[d] (f ⁻¹' s) = μH[d] (s ∩ range f) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem map_hausdorffMeasure (hf : Isometry f) (hd : 0 ≤ d ∨ Surjective f) : Measure.map f μH[d] = μH[d].restrict (range f) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem hausdorffMeasure_preimage (e : X ≃ᵢ Y) (d : ℝ) (s : Set Y) : μH[d] (e ⁻¹' s) = μH[d] s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem map_hausdorffMeasure (e : X ≃ᵢ Y) (d : ℝ) : Measure.map e μH[d] = μH[d] :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem hausdorffMeasure_pi_real {ι : Type*} [Fintype ι] : (μH[Fintype.card ι] : Measure (ι → ℝ)) = volume :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem hausdorffMeasure_real : (μH[1] : Measure ℝ) = volume :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem hausdorffMeasure_prod_real : (μH[2] : Measure (ℝ × ℝ)) = volume :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem hausdorffMeasure_smul_right_image [NormedAddCommGroup E] [NormedSpace ℝ E] [MeasurableSpace E] [BorelSpace E] (v : E) (s : Set ℝ) : μH[1] ((fun r => r • v) '' s) = ‖v‖₊ • μH[1] s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem hausdorffMeasure_homothety_image {d : ℝ} (hd : 0 ≤ d) (x : P) {c : 𝕜} (hc : c ≠ 0) (s : Set P) : μH[d] (AffineMap.homothety x c '' s) = ‖c‖₊ ^ d • μH[d] s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem hausdorffMeasure_homothety_preimage {d : ℝ} (hd : 0 ≤ d) (x : P) {c : 𝕜} (hc : c ≠ 0) (s : Set P) : μH[d] (AffineMap.homothety x c ⁻¹' s) = ‖c‖₊⁻¹ ^ d • μH[d] s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem hausdorffMeasure_lineMap_image (x y : P) (s : Set ℝ) : μH[1] (AffineMap.lineMap x y '' s) = nndist x y • μH[1] s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem hausdorffMeasure_affineSegment (x y : P) : μH[1] (affineSegment ℝ x y) = edist x y :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem hausdorffMeasure_segment {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [MeasurableSpace E] [BorelSpace E] (x y : E) : μH[1] (segment ℝ x y) = edist x y :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem apply_mono (μ : FiniteMeasure Ω) {s₁ s₂ : Set Ω} (h : s₁ ⊆ s₂) : μ s₁ ≤ μ s₂ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem apply_le_mass (μ : FiniteMeasure Ω) (s : Set Ω) : μ s ≤ μ.mass :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem mass_zero_iff (μ : FiniteMeasure Ω) : μ.mass = 0 ↔ μ = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem mass_nonzero_iff (μ : FiniteMeasure Ω) : μ.mass ≠ 0 ↔ μ ≠ 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem eq_of_forall_toMeasure_apply_eq (μ ν : FiniteMeasure Ω) (h : ∀ s : Set Ω, MeasurableSet s → (μ : Measure Ω) s = (ν : Measure Ω) s) : μ = ν :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem eq_of_forall_apply_eq (μ ν : FiniteMeasure Ω) (h : ∀ s : Set Ω, MeasurableSet s → μ s = ν s) : μ = ν :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem coeFn_add (μ ν : FiniteMeasure Ω) : (⇑(μ + ν) : Set Ω → ℝ≥0) = (⇑μ + ⇑ν : Set Ω → ℝ≥0) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem coeFn_smul [IsScalarTower R ℝ≥0 ℝ≥0] (c : R) (μ : FiniteMeasure Ω) : (⇑(c • μ) : Set Ω → ℝ≥0) = c • (⇑μ : Set Ω → ℝ≥0) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem smul_apply [IsScalarTower R ℝ≥0 ℝ≥0] (c : R) (μ : FiniteMeasure Ω) (s : Set Ω) : (c • μ) s = c • μ s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem restrict_apply (μ : FiniteMeasure Ω) (A : Set Ω) {s : Set Ω} (s_mble : MeasurableSet s) : (μ.restrict A) s = μ (s ∩ A) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem restrict_mass (μ : FiniteMeasure Ω) (A : Set Ω) : (μ.restrict A).mass = μ A :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem restrict_eq_zero_iff (μ : FiniteMeasure Ω) (A : Set Ω) : μ.restrict A = 0 ↔ μ A = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem restrict_nonzero_iff (μ : FiniteMeasure Ω) (A : Set Ω) : μ.restrict A ≠ 0 ↔ μ A ≠ 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem ext_of_forall_lintegral_eq [HasOuterApproxClosed Ω] [BorelSpace Ω] {μ ν : FiniteMeasure Ω} (h : ∀ (f : Ω →ᵇ ℝ≥0), ∫⁻ x, f x ∂μ = ∫⁻ x, f x ∂ν) : μ = ν :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem testAgainstNN_const (μ : FiniteMeasure Ω) (c : ℝ≥0) : μ.testAgainstNN (BoundedContinuousFunction.const Ω c) = c * μ.mass :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem testAgainstNN_mono (μ : FiniteMeasure Ω) {f g : Ω →ᵇ ℝ≥0} (f_le_g : (f : Ω → ℝ≥0) ≤ g) : μ.testAgainstNN f ≤ μ.testAgainstNN g :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem testAgainstNN_zero (μ : FiniteMeasure Ω) : μ.testAgainstNN 0 = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem testAgainstNN_one (μ : FiniteMeasure Ω) : μ.testAgainstNN 1 = μ.mass :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem zero_testAgainstNN_apply (f : Ω →ᵇ ℝ≥0) : (0 : FiniteMeasure Ω).testAgainstNN f = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem zero_testAgainstNN : (0 : FiniteMeasure Ω).testAgainstNN = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem smul_testAgainstNN_apply (c : ℝ≥0) (μ : FiniteMeasure Ω) (f : Ω →ᵇ ℝ≥0) : (c • μ).testAgainstNN f = c • μ.testAgainstNN f :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem testAgainstNN_add (μ : FiniteMeasure Ω) (f₁ f₂ : Ω →ᵇ ℝ≥0) : μ.testAgainstNN (f₁ + f₂) = μ.testAgainstNN f₁ + μ.testAgainstNN f₂ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem testAgainstNN_smul [IsScalarTower R ℝ≥0 ℝ≥0] [PseudoMetricSpace R] [Zero R] [BoundedSMul R ℝ≥0] (μ : FiniteMeasure Ω) (c : R) (f : Ω →ᵇ ℝ≥0) : μ.testAgainstNN (c • f) = c • μ.testAgainstNN f :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem testAgainstNN_lipschitz_estimate (μ : FiniteMeasure Ω) (f g : Ω →ᵇ ℝ≥0) : μ.testAgainstNN f ≤ μ.testAgainstNN g + nndist f g * μ.mass :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem testAgainstNN_lipschitz (μ : FiniteMeasure Ω) : LipschitzWith μ.mass fun f : Ω →ᵇ ℝ≥0 => μ.testAgainstNN f :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem continuous_testAgainstNN_eval (f : Ω →ᵇ ℝ≥0) : Continuous fun μ : FiniteMeasure Ω => μ.testAgainstNN f :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem continuous_mass : Continuous fun μ : FiniteMeasure Ω => μ.mass :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem tendsto_iff_forall_toWeakDualBCNN_tendsto {γ : Type*} {F : Filter γ} {μs : γ → FiniteMeasure Ω} {μ : FiniteMeasure Ω} : Tendsto μs F (𝓝 μ) ↔ ∀ f : Ω →ᵇ ℝ≥0, Tendsto (fun i => (μs i).toWeakDualBCNN f) F (𝓝 (μ.toWeakDualBCNN f)) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem tendsto_iff_forall_testAgainstNN_tendsto {γ : Type*} {F : Filter γ} {μs : γ → FiniteMeasure Ω} {μ : FiniteMeasure Ω} : Tendsto μs F (𝓝 μ) ↔ ∀ f : Ω →ᵇ ℝ≥0, Tendsto (fun i => (μs i).testAgainstNN f) F (𝓝 (μ.testAgainstNN f)) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem tendsto_zero_testAgainstNN_of_tendsto_zero_mass {γ : Type*} {F : Filter γ} {μs : γ → FiniteMeasure Ω} (mass_lim : Tendsto (fun i => (μs i).mass) F (𝓝 0)) (f : Ω →ᵇ ℝ≥0) : Tendsto (fun i => (μs i).testAgainstNN f) F (𝓝 0) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem tendsto_zero_of_tendsto_zero_mass {γ : Type*} {F : Filter γ} {μs : γ → FiniteMeasure Ω} (mass_lim : Tendsto (fun i => (μs i).mass) F (𝓝 0)) : Tendsto μs F (𝓝 0) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem tendsto_iff_forall_lintegral_tendsto {γ : Type*} {F : Filter γ} {μs : γ → FiniteMeasure Ω} {μ : FiniteMeasure Ω} : Tendsto μs F (𝓝 μ) ↔ ∀ f : Ω →ᵇ ℝ≥0, Tendsto (fun i => ∫⁻ x, f x ∂(μs i : Measure Ω)) F (𝓝 (∫⁻ x, f x ∂(μ : Measure Ω))) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma injective_toWeakDualBCNN : Injective (toWeakDualBCNN : FiniteMeasure Ω → WeakDual ℝ≥0 (Ω →ᵇ ℝ≥0)) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem tendsto_testAgainstNN_filter_of_le_const {ι : Type*} {L : Filter ι} [L.IsCountablyGenerated] {μ : FiniteMeasure Ω} {fs : ι → Ω →ᵇ ℝ≥0} {c : ℝ≥0} (fs_le_const : ∀ᶠ i in L, ∀ᵐ ω : Ω ∂(μ : Measure Ω), fs i ω ≤ c) {f : Ω →ᵇ ℝ≥0} (fs_lim : ∀ᵐ ω : Ω ∂(μ : Measure Ω), Tendsto (fun i => fs i ω) L (𝓝 (f ω))) : Tendsto (fun i => μ.testAgainstNN (fs i)) L (𝓝 (μ.testAgainstNN f)) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem tendsto_of_forall_integral_tendsto {γ : Type*} {F : Filter γ} {μs : γ → FiniteMeasure Ω} {μ : FiniteMeasure Ω} (h : ∀ f : Ω →ᵇ ℝ, Tendsto (fun i => ∫ x, f x ∂(μs i : Measure Ω)) F (𝓝 (∫ x, f x ∂(μ : Measure Ω)))) : Tendsto μs F (𝓝 μ) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem tendsto_iff_forall_integral_tendsto {γ : Type*} {F : Filter γ} {μs : γ → FiniteMeasure Ω} {μ : FiniteMeasure Ω} : Tendsto μs F (𝓝 μ) ↔ ∀ f : Ω →ᵇ ℝ, Tendsto (fun i => ∫ x, f x ∂(μs i : Measure Ω)) F (𝓝 (∫ x, f x ∂(μ : Measure Ω))) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma map_apply_of_aemeasurable (ν : FiniteMeasure Ω) {f : Ω → Ω'} (f_aemble : AEMeasurable f ν) {A : Set Ω'} (A_mble : MeasurableSet A) : ν.map f A = ν (f ⁻¹' A) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "@[simp] lemma map_add {f : Ω → Ω'} (f_mble : Measurable f) (ν₁ ν₂ : FiniteMeasure Ω) : (ν₁ + ν₂).map f = ν₁.map f + ν₂.map f :=", "area": "MeasureTheory"} {"task": "t8", "statement": "@[simp] lemma map_smul {f : Ω → Ω'} (c : ℝ≥0) (ν : FiniteMeasure Ω) : (c • ν).map f = c • (ν.map f) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma tendsto_map_of_tendsto_of_continuous {ι : Type*} {L : Filter ι} (νs : ι → FiniteMeasure Ω) (ν : FiniteMeasure Ω) (lim : Tendsto νs L (𝓝 ν)) {f : Ω → Ω'} (f_cont : Continuous f) : Tendsto (fun i ↦ (νs i).map f) L (𝓝 (ν.map f)) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma continuous_map {f : Ω → Ω'} (f_cont : Continuous f) : Continuous (fun ν ↦ FiniteMeasure.map ν f) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem LinearMap.exists_map_addHaar_eq_smul_addHaar' (h : Function.Surjective L) : ∃ (c : ℝ≥0∞), 0 < c ∧ c < ∞ ∧ μ.map L = (c * addHaar (univ : Set (LinearMap.ker L))) • ν :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem LinearMap.exists_map_addHaar_eq_smul_addHaar (h : Function.Surjective L) : ∃ (c : ℝ≥0∞), 0 < c ∧ μ.map L = c • ν :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma ae_comp_linearMap_mem_iff (h : Function.Surjective L) {s : Set F} (hs : MeasurableSet s) : (∀ᵐ x ∂μ, L x ∈ s) ↔ ∀ᵐ y ∂ν, y ∈ s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma ae_ae_add_linearMap_mem_iff [LocallyCompactSpace F] {s : Set F} (hs : MeasurableSet s) : (∀ᵐ y ∂ν, ∀ᵐ x ∂μ, y + L x ∈ s) ↔ ∀ᵐ y ∂ν, y ∈ s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem closedBall_mem_vitaliFamily_of_dist_le_mul {K : ℝ} {x y : α} {r : ℝ} (h : dist x y ≤ K * r) (rpos : 0 < r) : closedBall y r ∈ (vitaliFamily μ K).setsAt x :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem tendsto_closedBall_filterAt {K : ℝ} {x : α} {ι : Type*} {l : Filter ι} (w : ι → α) (δ : ι → ℝ) (δlim : Tendsto δ l (𝓝[>] 0)) (xmem : ∀ᶠ j in l, x ∈ closedBall (w j) (K * δ j)) : Tendsto (fun j => closedBall (w j) (δ j)) l ((vitaliFamily μ K).filterAt x) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem ae_tendsto_measure_inter_div (S : Set α) (K : ℝ) : ∀ᵐ x ∂μ.restrict S, ∀ {ι : Type*} {l : Filter ι} (w : ι → α) (δ : ι → ℝ) (δlim : Tendsto δ l (𝓝[>] 0)) (xmem : ∀ᶠ j in l, x ∈ closedBall (w j) (K * δ j)), Tendsto (fun j => μ (S ∩ closedBall (w j) (δ j)) / μ (closedBall (w j) (δ j))) l (𝓝 1) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem ae_tendsto_average_norm_sub {f : α → E} (hf : LocallyIntegrable f μ) (K : ℝ) : ∀ᵐ x ∂μ, ∀ {ι : Type*} {l : Filter ι} (w : ι → α) (δ : ι → ℝ) (δlim : Tendsto δ l (𝓝[>] 0)) (xmem : ∀ᶠ j in l, x ∈ closedBall (w j) (K * δ j)), Tendsto (fun j => ⨍ y in closedBall (w j) (δ j), ‖f y - f x‖ ∂μ) l (𝓝 0) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem ae_tendsto_average [NormedSpace ℝ E] [CompleteSpace E] {f : α → E} (hf : LocallyIntegrable f μ) (K : ℝ) : ∀ᵐ x ∂μ, ∀ {ι : Type*} {l : Filter ι} (w : ι → α) (δ : ι → ℝ) (δlim : Tendsto δ l (𝓝[>] 0)) (xmem : ∀ᶠ j in l, x ∈ closedBall (w j) (K * δ j)), Tendsto (fun j => ⨍ y in closedBall (w j) (δ j), f y ∂μ) l (𝓝 (f x)) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem centerAndRescale_center : a.centerAndRescale.c (last N) = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem centerAndRescale_radius {N : ℕ} {τ : ℝ} (a : SatelliteConfig E N τ) : a.centerAndRescale.r (last N) = 1 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem card_le_of_separated (s : Finset E) (hs : ∀ c ∈ s, ‖c‖ ≤ 2) (h : ∀ c ∈ s, ∀ d ∈ s, c ≠ d → 1 ≤ ‖c - d‖) : s.card ≤ 5 ^ finrank ℝ E :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem multiplicity_le : multiplicity E ≤ 5 ^ finrank ℝ E :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem card_le_multiplicity {s : Finset E} (hs : ∀ c ∈ s, ‖c‖ ≤ 2) (h's : ∀ c ∈ s, ∀ d ∈ s, c ≠ d → 1 ≤ ‖c - d‖) : s.card ≤ multiplicity E :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem exists_goodδ : ∃ δ : ℝ, 0 < δ ∧ δ < 1 ∧ ∀ s : Finset E, (∀ c ∈ s, ‖c‖ ≤ 2) → (∀ c ∈ s, ∀ d ∈ s, c ≠ d → 1 - δ ≤ ‖c - d‖) → s.card ≤ multiplicity E :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem one_lt_goodτ : 1 < goodτ E :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem le_multiplicity_of_δ_of_fin {n : ℕ} (f : Fin n → E) (h : ∀ i, ‖f i‖ ≤ 2) (h' : Pairwise fun i j => 1 - goodδ E ≤ ‖f i - f j‖) : n ≤ multiplicity E :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem exists_normalized_aux1 {N : ℕ} {τ : ℝ} (a : SatelliteConfig E N τ) (lastr : a.r (last N) = 1) (hτ : 1 ≤ τ) (δ : ℝ) (hδ1 : τ ≤ 1 + δ / 4) (hδ2 : δ ≤ 1) (i j : Fin N.succ) (inej : i ≠ j) : 1 - δ ≤ ‖a.c i - a.c j‖ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem exists_normalized_aux2 {N : ℕ} {τ : ℝ} (a : SatelliteConfig E N τ) (lastc : a.c (last N) = 0) (lastr : a.r (last N) = 1) (hτ : 1 ≤ τ) (δ : ℝ) (hδ1 : τ ≤ 1 + δ / 4) (hδ2 : δ ≤ 1) (i j : Fin N.succ) (inej : i ≠ j) (hi : ‖a.c i‖ ≤ 2) (hj : 2 < ‖a.c j‖) : 1 - δ ≤ ‖a.c i - (2 / ‖a.c j‖) • a.c j‖ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem exists_normalized_aux3 {N : ℕ} {τ : ℝ} (a : SatelliteConfig E N τ) (lastc : a.c (last N) = 0) (lastr : a.r (last N) = 1) (hτ : 1 ≤ τ) (δ : ℝ) (hδ1 : τ ≤ 1 + δ / 4) (i j : Fin N.succ) (inej : i ≠ j) (hi : 2 < ‖a.c i‖) (hij : ‖a.c i‖ ≤ ‖a.c j‖) : 1 - δ ≤ ‖(2 / ‖a.c i‖) • a.c i - (2 / ‖a.c j‖) • a.c j‖ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem exists_normalized {N : ℕ} {τ : ℝ} (a : SatelliteConfig E N τ) (lastc : a.c (last N) = 0) (lastr : a.r (last N) = 1) (hτ : 1 ≤ τ) (δ : ℝ) (hδ1 : τ ≤ 1 + δ / 4) (hδ2 : δ ≤ 1) : ∃ c' : Fin N.succ → E, (∀ n, ‖c' n‖ ≤ 2) ∧ Pairwise fun i j => 1 - δ ≤ ‖c' i - c' j‖ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem isEmpty_satelliteConfig_multiplicity : IsEmpty (SatelliteConfig E (multiplicity E) (goodτ E)) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_congr_set_ae (hst : s =ᵐ[μ] t) : ∫ x in s, f x ∂μ = ∫ x in t, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_union_ae (hst : AEDisjoint μ s t) (ht : NullMeasurableSet t μ) (hfs : IntegrableOn f s μ) (hft : IntegrableOn f t μ) : ∫ x in s ∪ t, f x ∂μ = ∫ x in s, f x ∂μ + ∫ x in t, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_diff (ht : MeasurableSet t) (hfs : IntegrableOn f s μ) (hts : t ⊆ s) : ∫ x in s \\ t, f x ∂μ = ∫ x in s, f x ∂μ - ∫ x in t, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_inter_add_diff₀ (ht : NullMeasurableSet t μ) (hfs : IntegrableOn f s μ) : ∫ x in s ∩ t, f x ∂μ + ∫ x in s \\ t, f x ∂μ = ∫ x in s, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_finset_biUnion {ι : Type*} (t : Finset ι) {s : ι → Set X} (hs : ∀ i ∈ t, MeasurableSet (s i)) (h's : Set.Pairwise (↑t) (Disjoint on s)) (hf : ∀ i ∈ t, IntegrableOn f (s i) μ) : ∫ x in ⋃ i ∈ t, s i, f x ∂μ = ∑ i ∈ t, ∫ x in s i, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_fintype_iUnion {ι : Type*} [Fintype ι] {s : ι → Set X} (hs : ∀ i, MeasurableSet (s i)) (h's : Pairwise (Disjoint on s)) (hf : ∀ i, IntegrableOn f (s i) μ) : ∫ x in ⋃ i, s i, f x ∂μ = ∑ i, ∫ x in s i, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_empty : ∫ x in ∅, f x ∂μ = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_univ : ∫ x in univ, f x ∂μ = ∫ x, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_add_compl₀ (hs : NullMeasurableSet s μ) (hfi : Integrable f μ) : ∫ x in s, f x ∂μ + ∫ x in sᶜ, f x ∂μ = ∫ x, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_indicator (hs : MeasurableSet s) : ∫ x, indicator s f x ∂μ = ∫ x in s, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_indicator (ht : MeasurableSet t) : ∫ x in s, t.indicator f x ∂μ = ∫ x in s ∩ t, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem ofReal_setIntegral_one_of_measure_ne_top {X : Type*} {m : MeasurableSpace X} {μ : Measure X} {s : Set X} (hs : μ s ≠ ∞) : ENNReal.ofReal (∫ _ in s, (1 : ℝ) ∂μ) = μ s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_piecewise [DecidablePred (· ∈ s)] (hs : MeasurableSet s) (hf : IntegrableOn f s μ) (hg : IntegrableOn g sᶜ μ) : ∫ x, s.piecewise f g x ∂μ = ∫ x in s, f x ∂μ + ∫ x in sᶜ, g x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem tendsto_setIntegral_of_monotone {ι : Type*} [Countable ι] [SemilatticeSup ι] {s : ι → Set X} (hsm : ∀ i, MeasurableSet (s i)) (h_mono : Monotone s) (hfi : IntegrableOn f (⋃ n, s n) μ) : Tendsto (fun i => ∫ x in s i, f x ∂μ) atTop (𝓝 (∫ x in ⋃ n, s n, f x ∂μ)) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem tendsto_setIntegral_of_antitone {ι : Type*} [Countable ι] [SemilatticeSup ι] {s : ι → Set X} (hsm : ∀ i, MeasurableSet (s i)) (h_anti : Antitone s) (hfi : ∃ i, IntegrableOn f (s i) μ) : Tendsto (fun i ↦ ∫ x in s i, f x ∂μ) atTop (𝓝 (∫ x in ⋂ n, s n, f x ∂μ)) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem hasSum_integral_iUnion_ae {ι : Type*} [Countable ι] {s : ι → Set X} (hm : ∀ i, NullMeasurableSet (s i) μ) (hd : Pairwise (AEDisjoint μ on s)) (hfi : IntegrableOn f (⋃ i, s i) μ) : HasSum (fun n => ∫ x in s n, f x ∂μ) (∫ x in ⋃ n, s n, f x ∂μ) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_eq_zero_of_ae_eq_zero (ht_eq : ∀ᵐ x ∂μ, x ∈ t → f x = 0) : ∫ x in t, f x ∂μ = 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_union_eq_left_of_ae_aux (ht_eq : ∀ᵐ x ∂μ.restrict t, f x = 0) (haux : StronglyMeasurable f) (H : IntegrableOn f (s ∪ t) μ) : ∫ x in s ∪ t, f x ∂μ = ∫ x in s, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_union_eq_left_of_ae (ht_eq : ∀ᵐ x ∂μ.restrict t, f x = 0) : ∫ x in s ∪ t, f x ∂μ = ∫ x in s, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_eq_of_subset_of_ae_diff_eq_zero_aux (hts : s ⊆ t) (h't : ∀ᵐ x ∂μ, x ∈ t \\ s → f x = 0) (haux : StronglyMeasurable f) (h'aux : IntegrableOn f t μ) : ∫ x in t, f x ∂μ = ∫ x in s, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_eq_of_subset_of_ae_diff_eq_zero (ht : NullMeasurableSet t μ) (hts : s ⊆ t) (h't : ∀ᵐ x ∂μ, x ∈ t \\ s → f x = 0) : ∫ x in t, f x ∂μ = ∫ x in s, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_eq_integral_of_ae_compl_eq_zero (h : ∀ᵐ x ∂μ, x ∉ s → f x = 0) : ∫ x in s, f x ∂μ = ∫ x, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_neg_eq_setIntegral_nonpos [LinearOrder E] {f : X → E} (hf : AEStronglyMeasurable f μ) : ∫ x in {x | f x < 0}, f x ∂μ = ∫ x in {x | f x ≤ 0}, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_norm_eq_pos_sub_neg {f : X → ℝ} (hfi : Integrable f μ) : ∫ x, ‖f x‖ ∂μ = ∫ x in {x | 0 ≤ f x}, f x ∂μ - ∫ x in {x | f x ≤ 0}, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_const [CompleteSpace E] (c : E) : ∫ _ in s, c ∂μ = (μ s).toReal • c :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_indicator_const [CompleteSpace E] (e : E) ⦃s : Set X⦄ (s_meas : MeasurableSet s) : ∫ x : X, s.indicator (fun _ : X => e) x ∂μ = (μ s).toReal • e :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_indicatorConstLp [CompleteSpace E] {p : ℝ≥0∞} (hs : MeasurableSet s) (ht : MeasurableSet t) (hμt : μ t ≠ ∞) (e : E) : ∫ x in s, indicatorConstLp p ht hμt e x ∂μ = (μ (t ∩ s)).toReal • e :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_indicatorConstLp [CompleteSpace E] {p : ℝ≥0∞} (ht : MeasurableSet t) (hμt : μ t ≠ ∞) (e : E) : ∫ x, indicatorConstLp p ht hμt e x ∂μ = (μ t).toReal • e :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_map {Y} [MeasurableSpace Y] {g : X → Y} {f : Y → E} {s : Set Y} (hs : MeasurableSet s) (hf : AEStronglyMeasurable f (Measure.map g μ)) (hg : AEMeasurable g μ) : ∫ y in s, f y ∂Measure.map g μ = ∫ x in g ⁻¹' s, f (g x) ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem _root_.MeasurableEmbedding.setIntegral_map {Y} {_ : MeasurableSpace Y} {f : X → Y} (hf : MeasurableEmbedding f) (g : Y → E) (s : Set Y) : ∫ y in s, g y ∂Measure.map f μ = ∫ x in f ⁻¹' s, g (f x) ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem norm_setIntegral_le_of_norm_le_const_ae {C : ℝ} (hs : μ s < ∞) (hC : ∀ᵐ x ∂μ.restrict s, ‖f x‖ ≤ C) : ‖∫ x in s, f x ∂μ‖ ≤ C * (μ s).toReal :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem norm_setIntegral_le_of_norm_le_const_ae' {C : ℝ} (hs : μ s < ∞) (hC : ∀ᵐ x ∂μ, x ∈ s → ‖f x‖ ≤ C) (hfm : AEStronglyMeasurable f (μ.restrict s)) : ‖∫ x in s, f x ∂μ‖ ≤ C * (μ s).toReal :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem norm_setIntegral_le_of_norm_le_const_ae'' {C : ℝ} (hs : μ s < ∞) (hsm : MeasurableSet s) (hC : ∀ᵐ x ∂μ, x ∈ s → ‖f x‖ ≤ C) : ‖∫ x in s, f x ∂μ‖ ≤ C * (μ s).toReal :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_pos_iff_support_of_nonneg_ae {f : X → ℝ} (hf : 0 ≤ᵐ[μ.restrict s] f) (hfi : IntegrableOn f s μ) : (0 < ∫ x in s, f x ∂μ) ↔ 0 < μ (support f ∩ s) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_gt_gt {R : ℝ} {f : X → ℝ} (hR : 0 ≤ R) (hfm : Measurable f) (hfint : IntegrableOn f {x | ↑R < f x} μ) (hμ : μ {x | ↑R < f x} ≠ 0) : (μ {x | ↑R < f x}).toReal * R < ∫ x in {x | ↑R < f x}, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_trim {X} {m m0 : MeasurableSpace X} {μ : Measure X} (hm : m ≤ m0) {f : X → E} (hf_meas : StronglyMeasurable[m] f) {s : Set X} (hs : MeasurableSet[m] s) : ∫ x in s, f x ∂μ = ∫ x in s, f x ∂μ.trim hm :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_Icc_eq_integral_Ioo : ∫ t in Icc x y, f t ∂μ = ∫ t in Ioo x y, f t ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_mono_on (hs : MeasurableSet s) (h : ∀ x ∈ s, f x ≤ g x) : ∫ x in s, f x ∂μ ≤ ∫ x in s, g x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_mono_on_ae (hs : MeasurableSet s) (h : ∀ᵐ x ∂μ, x ∈ s → f x ≤ g x) : ∫ x in s, f x ∂μ ≤ ∫ x in s, g x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_ge_of_const_le {c : ℝ} (hs : MeasurableSet s) (hμs : μ s ≠ ∞) (hf : ∀ x ∈ s, c ≤ f x) (hfint : IntegrableOn (fun x : X => f x) s μ) : c * (μ s).toReal ≤ ∫ x in s, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_nonneg_ae (hs : MeasurableSet s) (hf : ∀ᵐ x ∂μ, x ∈ s → 0 ≤ f x) : 0 ≤ ∫ x in s, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_le_nonneg {s : Set X} (hs : MeasurableSet s) (hf : StronglyMeasurable f) (hfi : Integrable f μ) : ∫ x in s, f x ∂μ ≤ ∫ x in {y | 0 ≤ f y}, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_nonpos_ae (hs : MeasurableSet s) (hf : ∀ᵐ x ∂μ, x ∈ s → f x ≤ 0) : ∫ x in s, f x ∂μ ≤ 0 :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_nonpos_le {s : Set X} (hs : MeasurableSet s) (hf : StronglyMeasurable f) (hfi : Integrable f μ) : ∫ x in {y | f y ≤ 0}, f x ∂μ ≤ ∫ x in s, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma Integrable.measure_le_integral {f : X → ℝ} (f_int : Integrable f μ) (f_nonneg : 0 ≤ᵐ[μ] f) {s : Set X} (hs : ∀ x ∈ s, 1 ≤ f x) : μ s ≤ ENNReal.ofReal (∫ x, f x ∂μ) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma integral_le_measure {f : X → ℝ} {s : Set X} (hs : ∀ x ∈ s, f x ≤ 1) (h's : ∀ x ∈ sᶜ, f x ≤ 0) : ENNReal.ofReal (∫ x, f x ∂μ) ≤ μ s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integrableOn_iUnion_of_summable_integral_norm {f : X → E} {s : ι → Set X} (hs : ∀ i : ι, MeasurableSet (s i)) (hi : ∀ i : ι, IntegrableOn f (s i) μ) (h : Summable fun i : ι => ∫ x : X in s i, ‖f x‖ ∂μ) : IntegrableOn f (iUnion s) μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integrableOn_iUnion_of_summable_norm_restrict {f : C(X, E)} {s : ι → Compacts X} (hf : Summable fun i : ι => ‖f.restrict (s i)‖ * ENNReal.toReal (μ <| s i)) : IntegrableOn f (⋃ i : ι, s i) μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integrable_of_summable_norm_restrict {f : C(X, E)} {s : ι → Compacts X} (hf : Summable fun i : ι => ‖f.restrict (s i)‖ * ENNReal.toReal (μ <| s i)) (hs : ⋃ i : ι, ↑(s i) = (univ : Set X)) : Integrable f μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Lp_toLp_restrict_add (f g : Lp E p μ) (s : Set X) : ((Lp.memℒp (f + g)).restrict s).toLp (⇑(f + g)) = ((Lp.memℒp f).restrict s).toLp f + ((Lp.memℒp g).restrict s).toLp g :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Lp_toLp_restrict_smul (c : 𝕜) (f : Lp F p μ) (s : Set X) : ((Lp.memℒp (c • f)).restrict s).toLp (⇑(c • f)) = c • ((Lp.memℒp f).restrict s).toLp f :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem norm_Lp_toLp_restrict_le (s : Set X) (f : Lp E p μ) : ‖((Lp.memℒp f).restrict s).toLp f‖ ≤ ‖f‖ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem continuous_setIntegral [NormedSpace ℝ E] (s : Set X) : Continuous fun f : X →₁[μ] E => ∫ x in s, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Filter.Tendsto.integral_sub_linear_isLittleO_ae {μ : Measure X} {l : Filter X} [l.IsMeasurablyGenerated] {f : X → E} {b : E} (h : Tendsto f (l ⊓ ae μ) (𝓝 b)) (hfm : StronglyMeasurableAtFilter f l μ) (hμ : μ.FiniteAtFilter l) {s : ι → Set X} {li : Filter ι} (hs : Tendsto s li l.smallSets) (m : ι → ℝ := fun i => (μ (s i)).toReal) (hsμ : (fun i => (μ (s i)).toReal) =ᶠ[li] m := by rfl) : (fun i => (∫ x in s i, f x ∂μ) - m i • b) =o[li] m :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem continuous_integral_comp_L1 (L : E →L[𝕜] F) : Continuous fun φ : X →₁[μ] E => ∫ x : X, L (φ x) ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_comp_comm [CompleteSpace E] (L : E →L[𝕜] F) {φ : X → E} (φ_int : Integrable φ μ) : ∫ x, L (φ x) ∂μ = L (∫ x, φ x ∂μ) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_apply {H : Type*} [NormedAddCommGroup H] [NormedSpace 𝕜 H] {φ : X → H →L[𝕜] E} (φ_int : Integrable φ μ) (v : H) : (∫ x, φ x ∂μ) v = ∫ x, φ x v ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem _root_.ContinuousMultilinearMap.integral_apply {ι : Type*} [Fintype ι] {M : ι → Type*} [∀ i, NormedAddCommGroup (M i)] [∀ i, NormedSpace 𝕜 (M i)] {φ : X → ContinuousMultilinearMap 𝕜 M E} (φ_int : Integrable φ μ) (m : ∀ i, M i) : (∫ x, φ x ∂μ) m = ∫ x, φ x m ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_comp_comm' (L : E →L[𝕜] F) {K} (hL : AntilipschitzWith K L) (φ : X → E) : ∫ x, L (φ x) ∂μ = L (∫ x, φ x ∂μ) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_comp_comm (L : E ≃L[𝕜] F) (φ : X → E) : ∫ x, L (φ x) ∂μ = L (∫ x, φ x ∂μ) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_coe_re_add_coe_im {f : X → 𝕜} (hf : Integrable f μ) : ∫ x, (re (f x) : 𝕜) ∂μ + (∫ x, (im (f x) : 𝕜) ∂μ) * RCLike.I = ∫ x, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_re_add_im {f : X → 𝕜} (hf : Integrable f μ) : ((∫ x, RCLike.re (f x) ∂μ : ℝ) : 𝕜) + (∫ x, RCLike.im (f x) ∂μ : ℝ) * RCLike.I = ∫ x, f x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem fst_integral [CompleteSpace F] {f : X → E × F} (hf : Integrable f μ) : (∫ x, f x ∂μ).1 = ∫ x, (f x).1 ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem snd_integral [CompleteSpace E] {f : X → E × F} (hf : Integrable f μ) : (∫ x, f x ∂μ).2 = ∫ x, (f x).2 ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_smul_const {𝕜 : Type*} [RCLike 𝕜] [NormedSpace 𝕜 E] [CompleteSpace E] (f : X → 𝕜) (c : E) : ∫ x, f x • c ∂μ = (∫ x, f x ∂μ) • c :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_withDensity_eq_integral_smul {f : X → ℝ≥0} (f_meas : Measurable f) (g : X → E) : ∫ x, g x ∂μ.withDensity (fun x => f x) = ∫ x, f x • g x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem integral_withDensity_eq_integral_smul₀ {f : X → ℝ≥0} (hf : AEMeasurable f μ) (g : X → E) : ∫ x, g x ∂μ.withDensity (fun x => f x) = ∫ x, f x • g x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_withDensity_eq_setIntegral_smul {f : X → ℝ≥0} (f_meas : Measurable f) (g : X → E) {s : Set X} (hs : MeasurableSet s) : ∫ x in s, g x ∂μ.withDensity (fun x => f x) = ∫ x in s, f x • g x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_withDensity_eq_setIntegral_smul₀ {f : X → ℝ≥0} {s : Set X} (hf : AEMeasurable f (μ.restrict s)) (g : X → E) (hs : MeasurableSet s) : ∫ x in s, g x ∂μ.withDensity (fun x => f x) = ∫ x in s, f x • g x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem setIntegral_withDensity_eq_setIntegral_smul₀' [SFinite μ] {f : X → ℝ≥0} (s : Set X) (hf : AEMeasurable f (μ.restrict s)) (g : X → E) : ∫ x in s, g x ∂μ.withDensity (fun x => f x) = ∫ x in s, f x • g x ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measure_le_lintegral_thickenedIndicatorAux (μ : Measure X) {E : Set X} (E_mble : MeasurableSet E) (δ : ℝ) : μ E ≤ ∫⁻ x, (thickenedIndicatorAux δ E x : ℝ≥0∞) ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem measure_le_lintegral_thickenedIndicator (μ : Measure X) {E : Set X} (E_mble : MeasurableSet E) {δ : ℝ} (δ_pos : 0 < δ) : μ E ≤ ∫⁻ x, (thickenedIndicator δ_pos E x : ℝ≥0∞) ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Integrable.simpleFunc_mul (g : SimpleFunc X ℝ) (hf : Integrable f μ) : Integrable (⇑g * f) μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem Integrable.simpleFunc_mul' (hm : m ≤ m0) (g : @SimpleFunc X m ℝ) (hf : Integrable f μ) : Integrable (⇑g * f) μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem continuous_parametric_integral_of_continuous [FirstCountableTopology X] [LocallyCompactSpace X] [OpensMeasurableSpace Y] [SecondCountableTopologyEither Y E] [IsLocallyFiniteMeasure μ] {f : X → Y → E} (hf : Continuous f.uncurry) {s : Set Y} (hs : IsCompact s) : Continuous (∫ y in s, f · y ∂μ) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma continuousOn_integral_bilinear_of_locally_integrable_of_compact_support [NormedSpace 𝕜 E] (L : F →L[𝕜] G →L[𝕜] E) {f : X → Y → G} {s : Set X} {k : Set Y} {g : Y → F} (hk : IsCompact k) (hf : ContinuousOn f.uncurry (s ×ˢ univ)) (hfs : ∀ p, ∀ x, p ∈ s → x ∉ k → f p x = 0) (hg : IntegrableOn g k μ) : ContinuousOn (fun x ↦ ∫ y, L (g y) (f x y) ∂μ) s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma continuousOn_integral_of_compact_support {f : X → Y → E} {s : Set X} {k : Set Y} [IsFiniteMeasureOnCompacts μ] (hk : IsCompact k) (hf : ContinuousOn f.uncurry (s ×ˢ univ)) (hfs : ∀ p, ∀ x, p ∈ s → x ∉ k → f p x = 0) : ContinuousOn (fun x ↦ ∫ y, f x y ∂μ) s :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem interval_average_symm (f : ℝ → E) (a b : ℝ) : (⨍ x in a..b, f x) = ⨍ x in b..a, f x :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem interval_average_eq (f : ℝ → E) (a b : ℝ) : (⨍ x in a..b, f x) = (b - a)⁻¹ • ∫ x in a..b, f x :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem interval_average_eq_div (f : ℝ → ℝ) (a b : ℝ) : (⨍ x in a..b, f x) = (∫ x in a..b, f x) / (b - a) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem _root_.Measurable.lmarginal (hf : Measurable f) : Measurable (∫⋯∫⁻_s, f ∂μ) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem lmarginal_empty (f : (∀ i, π i) → ℝ≥0∞) : ∫⋯∫⁻_∅, f ∂μ = f :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem lmarginal_congr {x y : ∀ i, π i} (f : (∀ i, π i) → ℝ≥0∞) (h : ∀ i ∉ s, x i = y i) : (∫⋯∫⁻_s, f ∂μ) x = (∫⋯∫⁻_s, f ∂μ) y :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem lmarginal_update_of_mem {i : δ} (hi : i ∈ s) (f : (∀ i, π i) → ℝ≥0∞) (x : ∀ i, π i) (y : π i) : (∫⋯∫⁻_s, f ∂μ) (Function.update x i y) = (∫⋯∫⁻_s, f ∂μ) x :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem lmarginal_union (f : (∀ i, π i) → ℝ≥0∞) (hf : Measurable f) (hst : Disjoint s t) : ∫⋯∫⁻_s ∪ t, f ∂μ = ∫⋯∫⁻_s, ∫⋯∫⁻_t, f ∂μ ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem lmarginal_union' (f : (∀ i, π i) → ℝ≥0∞) (hf : Measurable f) {s t : Finset δ} (hst : Disjoint s t) : ∫⋯∫⁻_s ∪ t, f ∂μ = ∫⋯∫⁻_t, ∫⋯∫⁻_s, f ∂μ ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem lmarginal_singleton (f : (∀ i, π i) → ℝ≥0∞) (i : δ) : ∫⋯∫⁻_{i}, f ∂μ = fun x => ∫⁻ xᵢ, f (Function.update x i xᵢ) ∂μ i :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem lmarginal_insert (f : (∀ i, π i) → ℝ≥0∞) (hf : Measurable f) {i : δ} (hi : i ∉ s) (x : ∀ i, π i) : (∫⋯∫⁻_insert i s, f ∂μ) x = ∫⁻ xᵢ, (∫⋯∫⁻_s, f ∂μ) (Function.update x i xᵢ) ∂μ i :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem lmarginal_erase (f : (∀ i, π i) → ℝ≥0∞) (hf : Measurable f) {i : δ} (hi : i ∈ s) (x : ∀ i, π i) : (∫⋯∫⁻_s, f ∂μ) x = ∫⁻ xᵢ, (∫⋯∫⁻_(erase s i), f ∂μ) (Function.update x i xᵢ) ∂μ i :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem lmarginal_insert' (f : (∀ i, π i) → ℝ≥0∞) (hf : Measurable f) {i : δ} (hi : i ∉ s) : ∫⋯∫⁻_insert i s, f ∂μ = ∫⋯∫⁻_s, (fun x ↦ ∫⁻ xᵢ, f (Function.update x i xᵢ) ∂μ i) ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem lmarginal_erase' (f : (∀ i, π i) → ℝ≥0∞) (hf : Measurable f) {i : δ} (hi : i ∈ s) : ∫⋯∫⁻_s, f ∂μ = ∫⋯∫⁻_(erase s i), (fun x ↦ ∫⁻ xᵢ, f (Function.update x i xᵢ) ∂μ i) ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem lmarginal_univ [Fintype δ] {f : (∀ i, π i) → ℝ≥0∞} : ∫⋯∫⁻_univ, f ∂μ = fun _ => ∫⁻ x, f x ∂Measure.pi μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem lintegral_eq_lmarginal_univ [Fintype δ] {f : (∀ i, π i) → ℝ≥0∞} (x : ∀ i, π i) : ∫⁻ x, f x ∂Measure.pi μ = (∫⋯∫⁻_univ, f ∂μ) x :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem lmarginal_image [DecidableEq δ'] {e : δ' → δ} (he : Injective e) (s : Finset δ') {f : (∀ i, π (e i)) → ℝ≥0∞} (hf : Measurable f) (x : ∀ i, π i) : (∫⋯∫⁻_s.image e, f ∘ (· ∘' e) ∂μ) x = (∫⋯∫⁻_s, f ∂μ ∘' e) (x ∘' e) :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem lmarginal_update_of_not_mem {i : δ} {f : (∀ i, π i) → ℝ≥0∞} (hf : Measurable f) (hi : i ∉ s) (x : ∀ i, π i) (y : π i) : (∫⋯∫⁻_s, f ∂μ) (Function.update x i y) = (∫⋯∫⁻_s, f ∘ (Function.update · i y) ∂μ) x :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem lmarginal_eq_of_subset {f g : (∀ i, π i) → ℝ≥0∞} (hst : s ⊆ t) (hf : Measurable f) (hg : Measurable g) (hfg : ∫⋯∫⁻_s, f ∂μ = ∫⋯∫⁻_s, g ∂μ) : ∫⋯∫⁻_t, f ∂μ = ∫⋯∫⁻_t, g ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem lmarginal_le_of_subset {f g : (∀ i, π i) → ℝ≥0∞} (hst : s ⊆ t) (hf : Measurable f) (hg : Measurable g) (hfg : ∫⋯∫⁻_s, f ∂μ ≤ ∫⋯∫⁻_s, g ∂μ) : ∫⋯∫⁻_t, f ∂μ ≤ ∫⋯∫⁻_t, g ∂μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem lintegral_eq_of_lmarginal_eq [Fintype δ] (s : Finset δ) {f g : (∀ i, π i) → ℝ≥0∞} (hf : Measurable f) (hg : Measurable g) (hfg : ∫⋯∫⁻_s, f ∂μ = ∫⋯∫⁻_s, g ∂μ) : ∫⁻ x, f x ∂Measure.pi μ = ∫⁻ x, g x ∂Measure.pi μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "theorem lintegral_le_of_lmarginal_le [Fintype δ] (s : Finset δ) {f g : (∀ i, π i) → ℝ≥0∞} (hf : Measurable f) (hg : Measurable g) (hfg : ∫⋯∫⁻_s, f ∂μ ≤ ∫⋯∫⁻_s, g ∂μ) : ∫⁻ x, f x ∂Measure.pi μ ≤ ∫⁻ x, g x ∂Measure.pi μ :=", "area": "MeasureTheory"} {"task": "t8", "statement": "lemma nil_ne_cons (p : Path a b) (e : b ⟶ a) : Path.nil ≠ p.cons e :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma cons_ne_nil (p : Path a b) (e : b ⟶ a) : p.cons e ≠ Path.nil :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma obj_eq_of_cons_eq_cons {p : Path a b} {p' : Path a c} {e : b ⟶ d} {e' : c ⟶ d} (h : p.cons e = p'.cons e') : b = c :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma heq_of_cons_eq_cons {p : Path a b} {p' : Path a c} {e : b ⟶ d} {e' : c ⟶ d} (h : p.cons e = p'.cons e') : HEq p p' :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma hom_heq_of_cons_eq_cons {p : Path a b} {p' : Path a c} {e : b ⟶ d} {e' : c ⟶ d} (h : p.cons e = p'.cons e') : HEq e e' :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem eq_of_length_zero (p : Path a b) (hzero : p.length = 0) : a = b :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem nil_comp {a : V} : ∀ {b} (p : Path a b), Path.nil.comp p = p", "area": "Combinatorics"} {"task": "t8", "statement": "theorem comp_assoc {a b c : V} : ∀ {d} (p : Path a b) (q : Path b c) (r : Path c d), (p.comp q).comp r = p.comp (q.comp r)", "area": "Combinatorics"} {"task": "t8", "statement": "theorem comp_inj {p₁ p₂ : Path a b} {q₁ q₂ : Path b c} (hq : q₁.length = q₂.length) : p₁.comp q₁ = p₂.comp q₂ ↔ p₁ = p₂ ∧ q₁ = q₂ :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem comp_inj' {p₁ p₂ : Path a b} {q₁ q₂ : Path b c} (h : p₁.length = p₂.length) : p₁.comp q₁ = p₂.comp q₂ ↔ p₁ = p₂ ∧ q₁ = q₂ :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem toList_comp (p : Path a b) : ∀ {c} (q : Path b c), (p.comp q).toList = q.toList ++ p.toList", "area": "Combinatorics"} {"task": "t8", "statement": "theorem toList_injective (a : V) : ∀ b, Injective (toList : Path a b → List V)", "area": "Combinatorics"} {"task": "t8", "statement": "theorem mapPath_comp {a b : V} (p : Path a b) : ∀ {c : V} (q : Path b c), F.mapPath (p.comp q) = (F.mapPath p).comp (F.mapPath q)", "area": "Combinatorics"} {"task": "t8", "statement": "theorem Prefunctor.IsCovering.map_injective (hφ : φ.IsCovering) {u v : U} : Injective fun f : u ⟶ v => φ.map f :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem Prefunctor.IsCovering.of_comp_left (hφ : φ.IsCovering) (hφψ : (φ ⋙q ψ).IsCovering) (φsur : Surjective φ.obj) : ψ.IsCovering :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem Prefunctor.symmetrifyStar (u : U) : φ.symmetrify.star u = (Quiver.symmetrifyStar _).symm ∘ Sum.map (φ.star u) (φ.costar u) ∘ Quiver.symmetrifyStar u :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem Prefunctor.symmetrifyCostar (u : U) : φ.symmetrify.costar u = (Quiver.symmetrifyCostar _).symm ∘ Sum.map (φ.costar u) (φ.star u) ∘ Quiver.symmetrifyCostar u :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem Prefunctor.IsCovering.symmetrify (hφ : φ.IsCovering) : φ.symmetrify.IsCovering :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem Prefunctor.pathStar_injective (hφ : ∀ u, Injective (φ.star u)) (u : U) : Injective (φ.pathStar u) :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem Prefunctor.pathStar_surjective (hφ : ∀ u, Surjective (φ.star u)) (u : U) : Surjective (φ.pathStar u) :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem Prefunctor.costar_conj_star (u : U) : φ.costar u = Quiver.starEquivCostar (φ.obj u) ∘ φ.star u ∘ (Quiver.starEquivCostar u).symm :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem Prefunctor.bijective_costar_iff_bijective_star (u : U) : Bijective (φ.costar u) ↔ Bijective (φ.star u) :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem mem_interedges_iff {x : α × β} : x ∈ interedges r s t ↔ x.1 ∈ s ∧ x.2 ∈ t ∧ r x.1 x.2 :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem interedges_empty_left (t : Finset β) : interedges r ∅ t = ∅ :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem interedges_mono (hs : s₂ ⊆ s₁) (ht : t₂ ⊆ t₁) : interedges r s₂ t₂ ⊆ interedges r s₁ t₁ :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem card_interedges_add_card_interedges_compl (s : Finset α) (t : Finset β) : (interedges r s t).card + (interedges (fun x y ↦ ¬r x y) s t).card = s.card * t.card :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem interedges_disjoint_left {s s' : Finset α} (hs : Disjoint s s') (t : Finset β) : Disjoint (interedges r s t) (interedges r s' t) :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem interedges_disjoint_right (s : Finset α) {t t' : Finset β} (ht : Disjoint t t') : Disjoint (interedges r s t) (interedges r s t') :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma interedges_eq_biUnion : interedges r s t = s.biUnion (fun x ↦ (t.filter (r x)).map ⟨(x, ·), Prod.mk.inj_left x⟩) :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem interedges_biUnion_left (s : Finset ι) (t : Finset β) (f : ι → Finset α) : interedges r (s.biUnion f) t = s.biUnion fun a ↦ interedges r (f a) t :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem interedges_biUnion_right (s : Finset α) (t : Finset ι) (f : ι → Finset β) : interedges r s (t.biUnion f) = t.biUnion fun b ↦ interedges r s (f b) :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem interedges_biUnion (s : Finset ι) (t : Finset κ) (f : ι → Finset α) (g : κ → Finset β) : interedges r (s.biUnion f) (t.biUnion g) = (s ×ˢ t).biUnion fun ab ↦ interedges r (f ab.1) (g ab.2) :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem edgeDensity_nonneg (s : Finset α) (t : Finset β) : 0 ≤ edgeDensity r s t :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem edgeDensity_le_one (s : Finset α) (t : Finset β) : edgeDensity r s t ≤ 1 :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem edgeDensity_add_edgeDensity_compl (hs : s.Nonempty) (ht : t.Nonempty) : edgeDensity r s t + edgeDensity (fun x y ↦ ¬r x y) s t = 1 :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem edgeDensity_empty_left (t : Finset β) : edgeDensity r ∅ t = 0 :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem edgeDensity_empty_right (s : Finset α) : edgeDensity r s ∅ = 0 :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem card_interedges_finpartition_left [DecidableEq α] (P : Finpartition s) (t : Finset β) : (interedges r s t).card = ∑ a ∈ P.parts, (interedges r a t).card :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem card_interedges_finpartition_right [DecidableEq β] (s : Finset α) (P : Finpartition t) : (interedges r s t).card = ∑ b ∈ P.parts, (interedges r s b).card :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem card_interedges_finpartition [DecidableEq α] [DecidableEq β] (P : Finpartition s) (Q : Finpartition t) : (interedges r s t).card = ∑ ab ∈ P.parts ×ˢ Q.parts, (interedges r ab.1 ab.2).card :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem mul_edgeDensity_le_edgeDensity (hs : s₂ ⊆ s₁) (ht : t₂ ⊆ t₁) (hs₂ : s₂.Nonempty) (ht₂ : t₂.Nonempty) : (s₂.card : ℚ) / s₁.card * (t₂.card / t₁.card) * edgeDensity r s₂ t₂ ≤ edgeDensity r s₁ t₁ :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem edgeDensity_sub_edgeDensity_le_one_sub_mul (hs : s₂ ⊆ s₁) (ht : t₂ ⊆ t₁) (hs₂ : s₂.Nonempty) (ht₂ : t₂.Nonempty) : edgeDensity r s₂ t₂ - edgeDensity r s₁ t₁ ≤ 1 - s₂.card / s₁.card * (t₂.card / t₁.card) :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem abs_edgeDensity_sub_edgeDensity_le_one_sub_mul (hs : s₂ ⊆ s₁) (ht : t₂ ⊆ t₁) (hs₂ : s₂.Nonempty) (ht₂ : t₂.Nonempty) : |edgeDensity r s₂ t₂ - edgeDensity r s₁ t₁| ≤ 1 - s₂.card / s₁.card * (t₂.card / t₁.card) :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem abs_edgeDensity_sub_edgeDensity_le_two_mul_sub_sq (hs : s₂ ⊆ s₁) (ht : t₂ ⊆ t₁) (hδ₀ : 0 ≤ δ) (hδ₁ : δ < 1) (hs₂ : (1 - δ) * s₁.card ≤ s₂.card) (ht₂ : (1 - δ) * t₁.card ≤ t₂.card) : |(edgeDensity r s₂ t₂ : 𝕜) - edgeDensity r s₁ t₁| ≤ 2 * δ - δ ^ 2 :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem abs_edgeDensity_sub_edgeDensity_le_two_mul (hs : s₂ ⊆ s₁) (ht : t₂ ⊆ t₁) (hδ : 0 ≤ δ) (hscard : (1 - δ) * s₁.card ≤ s₂.card) (htcard : (1 - δ) * t₁.card ≤ t₂.card) : |(edgeDensity r s₂ t₂ : 𝕜) - edgeDensity r s₁ t₁| ≤ 2 * δ :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem swap_mem_interedges_iff {x : α × α} : x.swap ∈ interedges r s t ↔ x ∈ interedges r t s :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem edgeDensity_comm (s t : Finset α) : edgeDensity r s t = edgeDensity r t s :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem card_interedges_add_card_interedges_compl (h : Disjoint s t) : (G.interedges s t).card + (Gᶜ.interedges s t).card = s.card * t.card :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem edgeDensity_add_edgeDensity_compl (hs : s.Nonempty) (ht : t.Nonempty) (h : Disjoint s t) : G.edgeDensity s t + Gᶜ.edgeDensity s t = 1 :=", "area": "Combinatorics"} {"task": "t8", "statement": "private lemma card_interedges_badVertices_le : (Rel.interedges G.Adj (badVertices G ε s t) t).card ≤ (badVertices G ε s t).card * t.card * (G.edgeDensity s t - ε) :=", "area": "Combinatorics"} {"task": "t8", "statement": "private lemma edgeDensity_badVertices_le (hε : 0 ≤ ε) (dst : 2 * ε ≤ G.edgeDensity s t) : G.edgeDensity (badVertices G ε s t) t ≤ G.edgeDensity s t - ε :=", "area": "Combinatorics"} {"task": "t8", "statement": "private lemma card_badVertices_le (dst : 2 * ε ≤ G.edgeDensity s t) (hst : G.IsUniform ε s t) : (badVertices G ε s t).card ≤ s.card * ε :=", "area": "Combinatorics"} {"task": "t8", "statement": "private lemma triangle_split_helper [DecidableEq α] : (s \\ (badVertices G ε s t ∪ badVertices G ε s u)).biUnion (fun x ↦ (G.interedges (t.filter $ G.Adj x) (u.filter $ G.Adj x)).image (x, ·)) ⊆ (s ×ˢ t ×ˢ u).filter (fun (x, y, z) ↦ G.Adj x y ∧ G.Adj x z ∧ G.Adj y z) :=", "area": "Combinatorics"} {"task": "t8", "statement": "private lemma good_vertices_triangle_card [DecidableEq α] (dst : 2 * ε ≤ G.edgeDensity s t) (dsu : 2 * ε ≤ G.edgeDensity s u) (dtu : 2 * ε ≤ G.edgeDensity t u) (utu : G.IsUniform ε t u) (x : α) (hx : x ∈ s \\ (badVertices G ε s t ∪ badVertices G ε s u)) : ε ^ 3 * t.card * u.card ≤ (((t.filter (G.Adj x) ×ˢ u.filter (G.Adj x)).filter fun (y, z) ↦ G.Adj y z).image (x, ·)).card :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma triangle_counting' (dst : 2 * ε ≤ G.edgeDensity s t) (hst : G.IsUniform ε s t) (dsu : 2 * ε ≤ G.edgeDensity s u) (usu : G.IsUniform ε s u) (dtu : 2 * ε ≤ G.edgeDensity t u) (utu : G.IsUniform ε t u) : (1 - 2 * ε) * ε ^ 3 * s.card * t.card * u.card ≤ ((s ×ˢ t ×ˢ u).filter fun (a, b, c) ↦ G.Adj a b ∧ G.Adj a c ∧ G.Adj b c).card :=", "area": "Combinatorics"} {"task": "t8", "statement": "private lemma triple_eq_triple_of_mem (hst : Disjoint s t) (hsu : Disjoint s u) (htu : Disjoint t u) {x₁ x₂ y₁ y₂ z₁ z₂ : α} (h : ({x₁, y₁, z₁} : Finset α) = {x₂, y₂, z₂}) (hx₁ : x₁ ∈ s) (hx₂ : x₂ ∈ s) (hy₁ : y₁ ∈ t) (hy₂ : y₂ ∈ t) (hz₁ : z₁ ∈ u) (hz₂ : z₂ ∈ u) : (x₁, y₁, z₁) = (x₂, y₂, z₂) :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma triangle_counting (dst : 2 * ε ≤ G.edgeDensity s t) (ust : G.IsUniform ε s t) (hst : Disjoint s t) (dsu : 2 * ε ≤ G.edgeDensity s u) (usu : G.IsUniform ε s u) (hsu : Disjoint s u) (dtu : 2 * ε ≤ G.edgeDensity t u) (utu : G.IsUniform ε t u) (htu : Disjoint t u) : (1 - 2 * ε) * ε ^ 3 * s.card * t.card * u.card ≤ (G.cliqueFinset 3).card :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem energy_nonneg : 0 ≤ P.energy G :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem energy_le_one : P.energy G ≤ 1 :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem coe_energy {𝕜 : Type*} [LinearOrderedField 𝕜] : (P.energy G : 𝕜) = (∑ uv ∈ P.parts.offDiag, (G.edgeDensity uv.1 uv.2 : 𝕜) ^ 2) / (P.parts.card : 𝕜) ^ 2 :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem le_stepBound : id ≤ stepBound :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem stepBound_mono : Monotone stepBound :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem stepBound_pos_iff {n : ℕ} : 0 < stepBound n ↔ 0 < n :=", "area": "Combinatorics"} {"task": "t8", "statement": "@[norm_cast] lemma coe_stepBound {α : Type*} [Semiring α] (n : ℕ) : (stepBound n : α) = n * 4 ^ n :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem eps_pos {ε : ℝ} {n : ℕ} (h : 100 ≤ (4 : ℝ) ^ n * ε ^ 5) : 0 < ε :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem m_pos [Nonempty α] (hPα : P.parts.card * 16 ^ P.parts.card ≤ card α) : 0 < m :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem coe_m_add_one_pos : 0 < (m : ℝ) + 1 :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem eps_pow_five_pos (hPε : 100 ≤ (4 : ℝ) ^ P.parts.card * ε ^ 5) : ↑0 < ε ^ 5 :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem eps_pos (hPε : 100 ≤ (4 : ℝ) ^ P.parts.card * ε ^ 5) : 0 < ε :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem hundred_div_ε_pow_five_le_m [Nonempty α] (hPα : P.parts.card * 16 ^ P.parts.card ≤ card α) (hPε : 100 ≤ (4 : ℝ) ^ P.parts.card * ε ^ 5) : 100 / ε ^ 5 ≤ m :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem hundred_le_m [Nonempty α] (hPα : P.parts.card * 16 ^ P.parts.card ≤ card α) (hPε : 100 ≤ (4 : ℝ) ^ P.parts.card * ε ^ 5) (hε : ε ≤ 1) : 100 ≤ m :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem a_add_one_le_four_pow_parts_card : a + 1 ≤ 4 ^ P.parts.card :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem card_aux₁ (hucard : u.card = m * 4 ^ P.parts.card + a) : (4 ^ P.parts.card - a) * m + a * (m + 1) = u.card :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem card_aux₂ (hP : P.IsEquipartition) (hu : u ∈ P.parts) (hucard : ¬u.card = m * 4 ^ P.parts.card + a) : (4 ^ P.parts.card - (a + 1)) * m + (a + 1) * (m + 1) = u.card :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem pow_mul_m_le_card_part (hP : P.IsEquipartition) (hu : u ∈ P.parts) : (4 : ℝ) ^ P.parts.card * m ≤ u.card :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem hundred_lt_pow_initialBound_mul {ε : ℝ} (hε : 0 < ε) (l : ℕ) : 100 < ↑4 ^ initialBound ε l * ε ^ 5 :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem initialBound_le_bound : initialBound ε l ≤ bound ε l :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem add_div_le_sum_sq_div_card (hst : s ⊆ t) (f : ι → 𝕜) (d : 𝕜) (hx : 0 ≤ x) (hs : x ≤ |(∑ i ∈ s, f i) / s.card - (∑ i ∈ t, f i) / t.card|) (ht : d ≤ ((∑ i ∈ t, f i) / t.card) ^ 2) : d + s.card / t.card * x ^ 2 ≤ (∑ i ∈ t, f i ^ 2) / t.card :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem ext {μ : YoungDiagram} {T T' : SemistandardYoungTableau μ} (h : ∀ i j, T i j = T' i j) : T = T' :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem row_weak_of_le {μ : YoungDiagram} (T : SemistandardYoungTableau μ) {i j1 j2 : ℕ} (hj : j1 ≤ j2) (cell : (i, j2) ∈ μ) : T i j1 ≤ T i j2 :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem col_weak {μ : YoungDiagram} (T : SemistandardYoungTableau μ) {i1 i2 j : ℕ} (hi : i1 ≤ i2) (cell : (i2, j) ∈ μ) : T i1 j ≤ T i2 j :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem IsLowerSet.nonMemberSubfamily (h : IsLowerSet (𝒜 : Set (Finset α))) : IsLowerSet (𝒜.nonMemberSubfamily a : Set (Finset α)) :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem IsLowerSet.memberSubfamily (h : IsLowerSet (𝒜 : Set (Finset α))) : IsLowerSet (𝒜.memberSubfamily a : Set (Finset α)) :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem IsLowerSet.memberSubfamily_subset_nonMemberSubfamily (h : IsLowerSet (𝒜 : Set (Finset α))) : 𝒜.memberSubfamily a ⊆ 𝒜.nonMemberSubfamily a :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem IsLowerSet.le_card_inter_finset' (h𝒜 : IsLowerSet (𝒜 : Set (Finset α))) (hℬ : IsLowerSet (ℬ : Set (Finset α))) (h𝒜s : ∀ t ∈ 𝒜, t ⊆ s) (hℬs : ∀ t ∈ ℬ, t ⊆ s) : 𝒜.card * ℬ.card ≤ 2 ^ s.card * (𝒜 ∩ ℬ).card :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem IsUpperSet.card_inter_le_finset (h𝒜 : IsUpperSet (𝒜 : Set (Finset α))) (hℬ : IsLowerSet (ℬ : Set (Finset α))) : 2 ^ Fintype.card α * (𝒜 ∩ ℬ).card ≤ 𝒜.card * ℬ.card :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem IsLowerSet.card_inter_le_finset (h𝒜 : IsLowerSet (𝒜 : Set (Finset α))) (hℬ : IsUpperSet (ℬ : Set (Finset α))) : 2 ^ Fintype.card α * (𝒜 ∩ ℬ).card ≤ 𝒜.card * ℬ.card :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem IsUpperSet.le_card_inter_finset (h𝒜 : IsUpperSet (𝒜 : Set (Finset α))) (hℬ : IsUpperSet (ℬ : Set (Finset α))) : 𝒜.card * ℬ.card ≤ 2 ^ Fintype.card α * (𝒜 ∩ ℬ).card :=", "area": "Combinatorics"} {"task": "t8", "statement": "private lemma binomial_sum_eq (h : n < m) : ∑ i ∈ range (n + 1), (n.choose i * (m - n) / ((m - i) * m.choose i) : ℚ) = 1 :=", "area": "Combinatorics"} {"task": "t8", "statement": "private lemma Fintype.sum_div_mul_card_choose_card : ∑ s : Finset α, (card α / ((card α - s.card) * (card α).choose s.card) : ℚ) = card α * ∑ k ∈ range (card α), (↑k)⁻¹ + 1 :=", "area": "Combinatorics"} {"task": "t8", "statement": "@[simp] lemma truncatedSup_empty (a : α) : truncatedSup ∅ a = ⊤ :=", "area": "Combinatorics"} {"task": "t8", "statement": "@[simp] lemma truncatedSup_singleton (b a : α) : truncatedSup {b} a = if a ≤ b then b else ⊤ :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma le_truncatedSup : a ≤ truncatedSup s a :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma map_truncatedSup (e : α ≃o β) (s : Finset α) (a : α) : e (truncatedSup s a) = truncatedSup (s.map e.toEquiv.toEmbedding) (e a) :=", "area": "Combinatorics"} {"task": "t8", "statement": "private lemma lower_aux : a ∈ lowerClosure ↑(s ∪ t) ↔ a ∈ lowerClosure s ∨ a ∈ lowerClosure t :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma truncatedSup_union (hs : a ∈ lowerClosure s) (ht : a ∈ lowerClosure t) : truncatedSup (s ∪ t) a = truncatedSup s a ⊔ truncatedSup t a :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma truncatedSup_union_left (hs : a ∈ lowerClosure s) (ht : a ∉ lowerClosure t) : truncatedSup (s ∪ t) a = truncatedSup s a :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma truncatedSup_union_right (hs : a ∉ lowerClosure s) (ht : a ∈ lowerClosure t) : truncatedSup (s ∪ t) a = truncatedSup t a :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma truncatedSup_of_isAntichain (hs : IsAntichain (· ≤ ·) (s : Set α)) (ha : a ∈ s) : truncatedSup s a = a :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma truncatedInf_le : truncatedInf s a ≤ a :=", "area": "Combinatorics"} {"task": "t8", "statement": "@[simp] lemma truncatedInf_empty (a : α) : truncatedInf ∅ a = ⊥ :=", "area": "Combinatorics"} {"task": "t8", "statement": "@[simp] lemma truncatedInf_singleton (b a : α) : truncatedInf {b} a = if b ≤ a then b else ⊥ :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma map_truncatedInf (e : α ≃o β) (s : Finset α) (a : α) : e (truncatedInf s a) = truncatedInf (s.map e.toEquiv.toEmbedding) (e a) :=", "area": "Combinatorics"} {"task": "t8", "statement": "private lemma upper_aux : a ∈ upperClosure ↑(s ∪ t) ↔ a ∈ upperClosure s ∨ a ∈ upperClosure t :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma truncatedInf_union (hs : a ∈ upperClosure s) (ht : a ∈ upperClosure t) : truncatedInf (s ∪ t) a = truncatedInf s a ⊓ truncatedInf t a :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma truncatedInf_union_left (hs : a ∈ upperClosure s) (ht : a ∉ upperClosure t) : truncatedInf (s ∪ t) a = truncatedInf s a :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma truncatedInf_union_right (hs : a ∉ upperClosure s) (ht : a ∈ upperClosure t) : truncatedInf (s ∪ t) a = truncatedInf t a :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma truncatedInf_union_of_not_mem (hs : a ∉ upperClosure s) (ht : a ∉ upperClosure t) : truncatedInf (s ∪ t) a = ⊥ :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma truncatedInf_of_isAntichain (hs : IsAntichain (· ≤ ·) (s : Set α)) (ha : a ∈ s) : truncatedInf s a = a :=", "area": "Combinatorics"} {"task": "t8", "statement": "private lemma infs_aux : a ∈ lowerClosure ↑(s ⊼ t) ↔ a ∈ lowerClosure s ∧ a ∈ lowerClosure t :=", "area": "Combinatorics"} {"task": "t8", "statement": "private lemma sups_aux : a ∈ upperClosure ↑(s ⊻ t) ↔ a ∈ upperClosure s ∧ a ∈ upperClosure t :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma truncatedSup_infs (hs : a ∈ lowerClosure s) (ht : a ∈ lowerClosure t) : truncatedSup (s ⊼ t) a = truncatedSup s a ⊓ truncatedSup t a :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma truncatedInf_sups (hs : a ∈ upperClosure s) (ht : a ∈ upperClosure t) : truncatedInf (s ⊻ t) a = truncatedInf s a ⊔ truncatedInf t a :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma truncatedSup_infs_of_not_mem (ha : a ∉ lowerClosure s ⊓ lowerClosure t) : truncatedSup (s ⊼ t) a = ⊤ :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma truncatedInf_sups_of_not_mem (ha : a ∉ upperClosure s ⊔ upperClosure t) : truncatedInf (s ⊻ t) a = ⊥ :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma card_truncatedSup_union_add_card_truncatedSup_infs (𝒜 ℬ : Finset (Finset α)) (s : Finset α) : (truncatedSup (𝒜 ∪ ℬ) s).card + (truncatedSup (𝒜 ⊼ ℬ) s).card = (truncatedSup 𝒜 s).card + (truncatedSup ℬ s).card :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma card_truncatedInf_union_add_card_truncatedInf_sups (𝒜 ℬ : Finset (Finset α)) (s : Finset α) : (truncatedInf (𝒜 ∪ ℬ) s).card + (truncatedInf (𝒜 ⊻ ℬ) s).card = (truncatedInf 𝒜 s).card + (truncatedInf ℬ s).card :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma supSum_union_add_supSum_infs (𝒜 ℬ : Finset (Finset α)) : supSum (𝒜 ∪ ℬ) + supSum (𝒜 ⊼ ℬ) = supSum 𝒜 + supSum ℬ :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma infSum_union_add_infSum_sups (𝒜 ℬ : Finset (Finset α)) : infSum (𝒜 ∪ ℬ) + infSum (𝒜 ⊻ ℬ) = infSum 𝒜 + infSum ℬ :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma IsAntichain.le_infSum (h𝒜 : IsAntichain (· ⊆ ·) (𝒜 : Set (Finset α))) (h𝒜₀ : ∅ ∉ 𝒜) : ∑ s ∈ 𝒜, ((card α).choose s.card : ℚ)⁻¹ ≤ infSum 𝒜 :=", "area": "Combinatorics"} {"task": "t8", "statement": "@[simp] lemma supSum_singleton (hs : s ≠ univ) : supSum ({s} : Finset (Finset α)) = card α * ∑ k ∈ range (card α), (k : ℚ)⁻¹ :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma infSum_compls_add_supSum (𝒜 : Finset (Finset α)) : infSum 𝒜ᶜˢ + supSum 𝒜 = card α * ∑ k ∈ range (card α), (k : ℚ)⁻¹ + 1 :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma supSum_of_not_univ_mem (h𝒜₁ : 𝒜.Nonempty) (h𝒜₂ : univ ∉ 𝒜) : supSum 𝒜 = card α * ∑ k ∈ range (card α), (k : ℚ)⁻¹ :=", "area": "Combinatorics"} {"task": "t8", "statement": "lemma infSum_eq_one (h𝒜₁ : 𝒜.Nonempty) (h𝒜₀ : ∅ ∉ 𝒜) : infSum 𝒜 = 1 :=", "area": "Combinatorics"} {"task": "t8", "statement": "theorem isOrtho_zero_left (B : M₁ →ₛₗ[I₁] M₂ →ₛₗ[I₂] M) (x) : IsOrtho B (0 : M₁) x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem isOrtho_flip {B : M₁ →ₛₗ[I₁] M₁ →ₛₗ[I₁'] M} {x y} : B.IsOrtho x y ↔ B.flip.IsOrtho y x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem isOrthoᵢ_flip (B : M₁ →ₛₗ[I₁] M₁ →ₛₗ[I₁'] M) {v : n → M₁} : B.IsOrthoᵢ v ↔ B.flip.IsOrthoᵢ v :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem ortho_smul_left {B : V₁ →ₛₗ[I₁] V₂ →ₛₗ[I₂] V} {x y} {a : K₁} (ha : a ≠ 0) : IsOrtho B x y ↔ IsOrtho B (a • x) y :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem ortho_smul_right {B : V₁ →ₛₗ[I₁] V₂ →ₛₗ[I₂] V} {x y} {a : K₂} {ha : a ≠ 0} : IsOrtho B x y ↔ IsOrtho B x (a • y) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem linearIndependent_of_isOrthoᵢ {B : V₁ →ₛₗ[I₁] V₁ →ₛₗ[I₁'] V} {v : n → V₁} (hv₁ : B.IsOrthoᵢ v) (hv₂ : ∀ i, ¬B.IsOrtho (v i) (v i)) : LinearIndependent K₁ v :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem domRestrict (H : B.IsRefl) (p : Submodule R₁ M₁) : (B.domRestrict₁₂ p p).IsRefl :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem ker_flip_eq_bot (H : B.IsRefl) (h : LinearMap.ker B = ⊥) : LinearMap.ker B.flip = ⊥ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem ker_eq_bot_iff_ker_flip_eq_bot (H : B.IsRefl) : LinearMap.ker B = ⊥ ↔ LinearMap.ker B.flip = ⊥ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem isRefl (H : B.IsSymm) : B.IsRefl :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem domRestrict (H : B.IsSymm) (p : Submodule R M) : (B.domRestrict₁₂ p p).IsSymm :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem isSymm_iff_eq_flip {B : LinearMap.BilinForm R M} : B.IsSymm ↔ B = B.flip :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem neg (x y : M₁) : -B x y = B y x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem isRefl : B.IsRefl :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem isAlt_iff_eq_neg_flip [NoZeroDivisors R] [CharZero R] {B : M₁ →ₛₗ[I] M₁ →ₛₗ[I] R} : B.IsAlt ↔ B = -B.flip :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem span_singleton_inf_orthogonal_eq_bot (B : V₁ →ₛₗ[J₁] V₁ →ₛₗ[J₁'] V₂) (x : V₁) (hx : ¬B.IsOrtho x x) : (K₁ ∙ x) ⊓ Submodule.orthogonalBilin (K₁ ∙ x) B = ⊥ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem orthogonal_span_singleton_eq_to_lin_ker {B : V →ₗ[K] V →ₛₗ[J] V₂} (x : V) : Submodule.orthogonalBilin (K ∙ x) B = LinearMap.ker (B x) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem span_singleton_sup_orthogonal_eq_top {B : V →ₗ[K] V →ₗ[K] K} {x : V} (hx : ¬B.IsOrtho x x) : (K ∙ x) ⊔ Submodule.orthogonalBilin (N := K ∙ x) (B := B) = ⊤ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem isAdjointPair_iff_comp_eq_compl₂ : IsAdjointPair B B' f g ↔ B'.comp f = B.compl₂ g :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem isAdjointPair_zero : IsAdjointPair B B' 0 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem IsAdjointPair.add (h : IsAdjointPair B B' f g) (h' : IsAdjointPair B B' f' g') : IsAdjointPair B B' (f + f') (g + g') :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem IsAdjointPair.comp {f' : M₁ →ₗ[R] M₂} {g' : M₂ →ₗ[R] M₁} (h : IsAdjointPair B B' f g) (h' : IsAdjointPair B' B'' f' g') : IsAdjointPair B B'' (f'.comp f) (g.comp g') :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem IsAdjointPair.sub (h : IsAdjointPair B B' f g) (h' : IsAdjointPair B B' f' g') : IsAdjointPair B B' (f - f') (g - g') :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem IsAdjointPair.smul (c : R) (h : IsAdjointPair B B' f g) : IsAdjointPair B B' (c • f) (c • g) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem isPairSelfAdjoint_equiv (e : M₁ ≃ₗ[R] M) (f : Module.End R M) : IsPairSelfAdjoint B F f ↔ IsPairSelfAdjoint (B.compl₁₂ ↑e ↑e) (F.compl₁₂ ↑e ↑e) (e.symm.conj f) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem isSkewAdjoint_iff_neg_self_adjoint (f : Module.End R M) : B.IsSkewAdjoint f ↔ IsAdjointPair (-B) B f f :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem mem_skewAdjointSubmodule (f : Module.End R M) : f ∈ B.skewAdjointSubmodule ↔ B.IsSkewAdjoint f :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem SeparatingLeft.congr (h : B.SeparatingLeft) : (e₁.arrowCongr (e₂.arrowCongr (LinearEquiv.refl R M)) B).SeparatingLeft :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem separatingLeft_congr_iff : (e₁.arrowCongr (e₂.arrowCongr (LinearEquiv.refl R M)) B).SeparatingLeft ↔ B.SeparatingLeft :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem flip_separatingLeft {B : M₁ →ₛₗ[I₁] M₂ →ₛₗ[I₂] M} : B.flip.SeparatingLeft ↔ SeparatingRight B :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem separatingLeft_iff_linear_nontrivial {B : M₁ →ₛₗ[I₁] M₂ →ₛₗ[I₂] M} : B.SeparatingLeft ↔ ∀ x : M₁, B x = 0 → x = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem separatingRight_iff_linear_flip_nontrivial {B : M₁ →ₛₗ[I₁] M₂ →ₛₗ[I₂] M} : B.SeparatingRight ↔ ∀ y : M₂, B.flip y = 0 → y = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem separatingRight_iff_flip_ker_eq_bot {B : M₁ →ₛₗ[I₁] M₂ →ₛₗ[I₂] M} : B.SeparatingRight ↔ LinearMap.ker B.flip = ⊥ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem IsRefl.nondegenerate_of_separatingLeft {B : M →ₗ[R] M →ₗ[R] M₁} (hB : B.IsRefl) (hB' : B.SeparatingLeft) : B.Nondegenerate :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem IsRefl.nondegenerate_of_separatingRight {B : M →ₗ[R] M →ₗ[R] M₁} (hB : B.IsRefl) (hB' : B.SeparatingRight) : B.Nondegenerate :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem nondegenerate_restrict_of_disjoint_orthogonal {B : M →ₗ[R] M →ₗ[R] M₁} (hB : B.IsRefl) {W : Submodule R M} (hW : Disjoint W (W.orthogonalBilin B)) : (B.domRestrict₁₂ W W).Nondegenerate :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem IsOrthoᵢ.not_isOrtho_basis_self_of_separatingLeft [Nontrivial R] {B : M →ₛₗ[I] M →ₛₗ[I'] M₁} {v : Basis n R M} (h : B.IsOrthoᵢ v) (hB : B.SeparatingLeft) (i : n) : ¬B.IsOrtho (v i) (v i) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem IsOrthoᵢ.not_isOrtho_basis_self_of_separatingRight [Nontrivial R] {B : M →ₛₗ[I] M →ₛₗ[I'] M₁} {v : Basis n R M} (h : B.IsOrthoᵢ v) (hB : B.SeparatingRight) (i : n) : ¬B.IsOrtho (v i) (v i) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem IsOrthoᵢ.separatingLeft_of_not_isOrtho_basis_self [NoZeroSMulDivisors R M₁] {B : M →ₗ[R] M →ₗ[R] M₁} (v : Basis n R M) (hO : B.IsOrthoᵢ v) (h : ∀ i, ¬B.IsOrtho (v i) (v i)) : B.SeparatingLeft :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem IsOrthoᵢ.separatingRight_iff_not_isOrtho_basis_self [NoZeroSMulDivisors R M₁] {B : M →ₗ[R] M →ₗ[R] M₁} (v : Basis n R M) (hO : B.IsOrthoᵢ v) (h : ∀ i, ¬B.IsOrtho (v i) (v i)) : B.SeparatingRight :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "lemma preReflection_apply : preReflection x f y = y - (f y) • x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "lemma preReflection_apply_self (h : f x = 2) : preReflection x f x = - x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "lemma involutive_preReflection (h : f x = 2) : Involutive (preReflection x f) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "lemma preReflection_preReflection (g : Dual R M) (h : f x = 2) : preReflection (preReflection x f y) (preReflection f (Dual.eval R M x) g) = (preReflection x f) ∘ₗ (preReflection y g) ∘ₗ (preReflection x f) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "lemma Dual.eq_of_preReflection_mapsTo [CharZero R] [NoZeroSMulDivisors R M] {x : M} (hx : x ≠ 0) {Φ : Set M} (hΦ₁ : Φ.Finite) (hΦ₂ : span R Φ = ⊤) {f g : Dual R M} (hf₁ : f x = 2) (hf₂ : MapsTo (preReflection x f) Φ Φ) (hg₁ : g x = 2) (hg₂ : MapsTo (preReflection x g) Φ Φ) : f = g :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "lemma Dual.eq_of_preReflection_mapsTo' [CharZero R] [NoZeroSMulDivisors R M] {x : M} (hx : x ≠ 0) {Φ : Set M} (hΦ₁ : Φ.Finite) (hx' : x ∈ span R Φ) {f g : Dual R M} (hf₁ : f x = 2) (hf₂ : MapsTo (preReflection x f) Φ Φ) (hg₁ : g x = 2) (hg₂ : MapsTo (preReflection x g) Φ Φ) : (span R Φ).subtype.dualMap f = (span R Φ).subtype.dualMap g :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "lemma eq_of_mapsTo_reflection_of_mem [NoZeroSMulDivisors ℤ M] {Φ : Set M} (hΦ : Φ.Finite) (hfx : f x = 2) (hgy : g y = 2) (hgx : g x = 2) (hfy : f y = 2) (hxfΦ : MapsTo (preReflection x f) Φ Φ) (hygΦ : MapsTo (preReflection y g) Φ Φ) (hyΦ : y ∈ Φ) : x = y :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "lemma injOn_dualMap_subtype_span_range_range {ι : Type*} [NoZeroSMulDivisors ℤ M] {r : ι ↪ M} {c : ι → Dual R M} (hfin : (range r).Finite) (h_two : ∀ i, c i (r i) = 2) (h_mapsTo : ∀ i, MapsTo (preReflection (r i) (c i)) (range r) (range r)) : InjOn (span R (range r)).subtype.dualMap (range c) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem mem_unitaryGroup_iff : A ∈ Matrix.unitaryGroup n α ↔ A * star A = 1 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem mem_unitaryGroup_iff' : A ∈ Matrix.unitaryGroup n α ↔ star A * A = 1 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem det_of_mem_unitary {A : Matrix n n α} (hA : A ∈ Matrix.unitaryGroup n α) : A.det ∈ unitary α :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem toGL_one : toGL (1 : unitaryGroup n α) = 1 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem toGL_mul (A B : unitaryGroup n α) : toGL (A * B) = toGL A * toGL B :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem mem_orthogonalGroup_iff {A : Matrix n n β} : A ∈ Matrix.orthogonalGroup n β ↔ A * star A = 1 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem mem_orthogonalGroup_iff' {A : Matrix n n β} : A ∈ Matrix.orthogonalGroup n β ↔ star A * A = 1 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem ker_pi (f : (i : ι) → M₂ →ₗ[R] φ i) : ker (pi f) = ⨅ i : ι, ker (f i) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem pi_eq_zero (f : (i : ι) → M₂ →ₗ[R] φ i) : pi f = 0 ↔ ∀ i, f i = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem pi_zero : pi (fun i => 0 : (i : ι) → M₂ →ₗ[R] φ i) = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem iInf_ker_proj : (⨅ i, ker (proj i : ((i : ι) → φ i) →ₗ[R] φ i) : Submodule R ((i : ι) → φ i)) = ⊥ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem lsum_single {ι R : Type*} [Fintype ι] [DecidableEq ι] [CommRing R] {M : ι → Type*} [(i : ι) → AddCommGroup (M i)] [(i : ι) → Module R (M i)] : LinearMap.lsum R M R LinearMap.single = LinearMap.id :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem pi_ext' (h : ∀ i, f.comp (single i) = g.comp (single i)) : f = g :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem update_apply (f : (i : ι) → M₂ →ₗ[R] φ i) (c : M₂) (i j : ι) (b : M₂ →ₗ[R] φ i) : (update f i b j) c = update (fun i => f i c) i (b c) j :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem pi_apply_eq_sum_univ [Fintype ι] [DecidableEq ι] (f : (ι → R) →ₗ[R] M₂) (x : ι → R) : f x = ∑ i, x i • f fun j => if i = j then 1 else 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem biInf_comap_proj : ⨅ i ∈ I, comap (proj i : ((i : ι) → φ i) →ₗ[R] φ i) (p i) = pi I p :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem iInf_comap_proj : ⨅ i, comap (proj i : ((i : ι) → φ i) →ₗ[R] φ i) (p i) = pi Set.univ p :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem iSup_map_single [DecidableEq ι] [Finite ι] : ⨆ i, map (LinearMap.single i : φ i →ₗ[R] (i : ι) → φ i) (p i) = pi Set.univ p :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem le_comap_single_pi [DecidableEq ι] (p : (i : ι) → Submodule R (φ i)) {i} : p i ≤ Submodule.comap (LinearMap.single i : φ i →ₗ[R] _) (Submodule.pi Set.univ p) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem piRing_symm_apply (f : ι → M) (g : ι → R) : (piRing R M ι S).symm f g = ∑ i, g i • f i :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "lemma _root_.LinearMap.IsSymm.tmul {B₁ : BilinForm A M₁} {B₂ : BilinForm R M₂} (hB₁ : B₁.IsSymm) (hB₂ : B₂.IsSymm) : (B₁.tmul B₂).IsSymm :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem tensorDistribEquiv_toLinearMap : (tensorDistribEquiv R (M₁ := M₁) (M₂ := M₂)).toLinearMap = tensorDistrib R R :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem liftAlternating_ι (f : ∀ i, M [⋀^Fin i]→ₗ[R] N) (m : M) : liftAlternating (R := R) (M := M) (N := N) f (ι R m) = f 1 ![m] :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem liftAlternating_ι_mul (f : ∀ i, M [⋀^Fin i]→ₗ[R] N) (m : M) (x : ExteriorAlgebra R M) : liftAlternating (R := R) (M := M) (N := N) f (ι R m * x) = liftAlternating (R := R) (M := M) (N := N) (fun i => (f i.succ).curryLeft m) x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem liftAlternating_one (f : ∀ i, M [⋀^Fin i]→ₗ[R] N) : liftAlternating (R := R) (M := M) (N := N) f (1 : ExteriorAlgebra R M) = f 0 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem liftAlternating_algebraMap (f : ∀ i, M [⋀^Fin i]→ₗ[R] N) (r : R) : liftAlternating (R := R) (M := M) (N := N) f (algebraMap _ (ExteriorAlgebra R M) r) = r • f 0 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem liftAlternating_apply_ιMulti {n : ℕ} (f : ∀ i, M [⋀^Fin i]→ₗ[R] N) (v : Fin n → M) : liftAlternating (R := R) (M := M) (N := N) f (ιMulti R n v) = f n v :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem liftAlternating_comp (g : N →ₗ[R] N') (f : ∀ i, M [⋀^Fin i]→ₗ[R] N) : (liftAlternating (R := R) (M := M) (N := N') fun i => g.compAlternatingMap (f i)) = g ∘ₗ liftAlternating (R := R) (M := M) (N := N) f :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem liftAlternating_ιMulti : liftAlternating (R := R) (M := M) (N := ExteriorAlgebra R M) (ιMulti R) = (LinearMap.id : ExteriorAlgebra R M →ₗ[R] ExteriorAlgebra R M) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "@[simp] lemma toDirectLimit_tmul_of {i : ι} (g : G i) (m : M) : (toDirectLimit f M <| (of _ _ G f i g) ⊗ₜ m) = (of _ _ _ _ i (g ⊗ₜ m)) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "@[simp] lemma directLimitRight_tmul_of {i : ι} (m : M) (g : G i): directLimitRight f M (m ⊗ₜ of _ _ _ _ _ g) = of _ _ _ _ i (m ⊗ₜ g) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "@[simp] lemma directLimitRight_symm_of_tmul {i : ι} (m : M) (g : G i) : (directLimitRight f M).symm (of _ _ _ _ _ (m ⊗ₜ g)) = m ⊗ₜ of _ _ _ f _ g :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem gradedCommAux_lof_tmul (i j : ι) (a : 𝒜 i) (b : ℬ j) : gradedCommAux R 𝒜 ℬ (lof R _ 𝒜ℬ (i, j) (a ⊗ₜ b)) = (-1 : ℤˣ)^(j * i) • lof R _ ℬ𝒜 (j, i) (b ⊗ₜ a) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem gradedCommAux_comp_gradedCommAux : gradedCommAux R 𝒜 ℬ ∘ₗ gradedCommAux R ℬ 𝒜 = LinearMap.id :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem gradedComm_symm : (gradedComm R 𝒜 ℬ).symm = gradedComm R ℬ 𝒜 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem gradedComm_of_tmul_of (i j : ι) (a : 𝒜 i) (b : ℬ j) : gradedComm R 𝒜 ℬ (lof R _ 𝒜 i a ⊗ₜ lof R _ ℬ j b) = (-1 : ℤˣ)^(j * i) • (lof R _ ℬ _ b ⊗ₜ lof R _ 𝒜 _ a) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem gradedComm_tmul_of_zero (a : ⨁ i, 𝒜 i) (b : ℬ 0) : gradedComm R 𝒜 ℬ (a ⊗ₜ lof R _ ℬ 0 b) = lof R _ ℬ _ b ⊗ₜ a :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem gradedComm_of_zero_tmul (a : 𝒜 0) (b : ⨁ i, ℬ i) : gradedComm R 𝒜 ℬ (lof R _ 𝒜 0 a ⊗ₜ b) = b ⊗ₜ lof R _ 𝒜 _ a :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem tmul_of_gradedMul_of_tmul (j₁ i₂ : ι) (a₁ : ⨁ i, 𝒜 i) (b₁ : ℬ j₁) (a₂ : 𝒜 i₂) (b₂ : ⨁ i, ℬ i) : gradedMul R 𝒜 ℬ (a₁ ⊗ₜ lof R _ ℬ j₁ b₁) (lof R _ 𝒜 i₂ a₂ ⊗ₜ b₂) = (-1 : ℤˣ)^(j₁ * i₂) • ((a₁ * lof R _ 𝒜 _ a₂) ⊗ₜ (lof R _ ℬ _ b₁ * b₂)) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem algebraMap_gradedMul (r : R) (x : (⨁ i, 𝒜 i) ⊗[R] (⨁ i, ℬ i)) : gradedMul R 𝒜 ℬ (algebraMap R _ r ⊗ₜ 1) x = r • x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem one_gradedMul (x : (⨁ i, 𝒜 i) ⊗[R] (⨁ i, ℬ i)) : gradedMul R 𝒜 ℬ 1 x = x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem gradedMul_algebraMap (x : (⨁ i, 𝒜 i) ⊗[R] (⨁ i, ℬ i)) (r : R) : gradedMul R 𝒜 ℬ x (algebraMap R _ r ⊗ₜ 1) = r • x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem gradedMul_one (x : (⨁ i, 𝒜 i) ⊗[R] (⨁ i, ℬ i)) : gradedMul R 𝒜 ℬ x 1 = x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem gradedMul_assoc (x y z : DirectSum _ 𝒜 ⊗[R] DirectSum _ ℬ) : gradedMul R 𝒜 ℬ (gradedMul R 𝒜 ℬ x y) z = gradedMul R 𝒜 ℬ x (gradedMul R 𝒜 ℬ y z) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem gradedComm_gradedMul (x y : DirectSum _ 𝒜 ⊗[R] DirectSum _ ℬ) : gradedComm R 𝒜 ℬ (gradedMul R 𝒜 ℬ x y) = gradedMul R ℬ 𝒜 (gradedComm R 𝒜 ℬ x) (gradedComm R 𝒜 ℬ y) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem auxEquiv_one : auxEquiv R 𝒜 ℬ 1 = 1 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem tmul_coe_mul_coe_tmul {j₁ i₂ : ι} (a₁ : A) (b₁ : ℬ j₁) (a₂ : 𝒜 i₂) (b₂ : B) : (a₁ ᵍ⊗ₜ[R] (b₁ : B) * (a₂ : A) ᵍ⊗ₜ[R] b₂ : 𝒜 ᵍ⊗[R] ℬ) = (-1 : ℤˣ)^(j₁ * i₂) • ((a₁ * a₂ : A) ᵍ⊗ₜ (b₁ * b₂ : B)) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem tmul_zero_coe_mul_coe_tmul {i₂ : ι} (a₁ : A) (b₁ : ℬ 0) (a₂ : 𝒜 i₂) (b₂ : B) : (a₁ ᵍ⊗ₜ[R] (b₁ : B) * (a₂ : A) ᵍ⊗ₜ[R] b₂ : 𝒜 ᵍ⊗[R] ℬ) = ((a₁ * a₂ : A) ᵍ⊗ₜ (b₁ * b₂ : B)) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem tmul_coe_mul_zero_coe_tmul {j₁ : ι} (a₁ : A) (b₁ : ℬ j₁) (a₂ : 𝒜 0) (b₂ : B) : (a₁ ᵍ⊗ₜ[R] (b₁ : B) * (a₂ : A) ᵍ⊗ₜ[R] b₂ : 𝒜 ᵍ⊗[R] ℬ) = ((a₁ * a₂ : A) ᵍ⊗ₜ (b₁ * b₂ : B)) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem tmul_one_mul_coe_tmul {i₂ : ι} (a₁ : A) (a₂ : 𝒜 i₂) (b₂ : B) : (a₁ ᵍ⊗ₜ[R] (1 : B) * (a₂ : A) ᵍ⊗ₜ[R] b₂ : 𝒜 ᵍ⊗[R] ℬ) = (a₁ * a₂ : A) ᵍ⊗ₜ (b₂ : B) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem tmul_coe_mul_one_tmul {j₁ : ι} (a₁ : A) (b₁ : ℬ j₁) (b₂ : B) : (a₁ ᵍ⊗ₜ[R] (b₁ : B) * (1 : A) ᵍ⊗ₜ[R] b₂ : 𝒜 ᵍ⊗[R] ℬ) = (a₁ : A) ᵍ⊗ₜ (b₁ * b₂ : B) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem tmul_one_mul_one_tmul (a₁ : A) (b₂ : B) : (a₁ ᵍ⊗ₜ[R] (1 : B) * (1 : A) ᵍ⊗ₜ[R] b₂ : 𝒜 ᵍ⊗[R] ℬ) = (a₁ : A) ᵍ⊗ₜ (b₂ : B) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "@[simp] lemma comm_coe_tmul_coe {i j : ι} (a : 𝒜 i) (b : ℬ j) : comm 𝒜 ℬ (a ᵍ⊗ₜ b) = (-1 : ℤˣ)^(j * i) • (b ᵍ⊗ₜ a : ℬ ᵍ⊗[R] 𝒜) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem charpoly_toMatrix {ι : Type w} [DecidableEq ι] [Fintype ι] (b : Basis ι R M) : (toMatrix b b f).charpoly = f.charpoly :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "lemma charpoly_prodMap (f₁ : M₁ →ₗ[R] M₁) (f₂ : M₂ →ₗ[R] M₂) : (f₁.prodMap f₂).charpoly = f₁.charpoly * f₂.charpoly :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "@[simp] lemma LinearEquiv.charpoly_conj (e : M₁ ≃ₗ[R] M₂) (φ : Module.End R M₁) : (e.conj φ).charpoly = φ.charpoly :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "lemma Hom.toIsometry_injective (V W : QuadraticModuleCat.{v} R) : Function.Injective (Hom.toIsometry : Hom V W → _) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem polar_add (f g : M → R) (x y : M) : polar (f + g) x y = polar f x y + polar g x y :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem polar_neg (f : M → R) (x y : M) : polar (-f) x y = -polar f x y :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem polar_smul [Monoid S] [DistribMulAction S R] (f : M → R) (s : S) (x y : M) : polar (s • f) x y = s • polar f x y :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem polar_comm (f : M → R) (x y : M) : polar f x y = polar f y x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem polar_add_left_iff {f : M → R} {x x' y : M} : polar f (x + x') y = polar f x y + polar f x' y ↔ f (x + x' + y) + (f x + f x' + f y) = f (x + x') + f (x' + y) + f (y + x) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem polar_comp {F : Type*} [CommRing S] [FunLike F R S] [AddMonoidHomClass F R S] (f : M → R) (g : F) (x y : M) : polar (g ∘ f) x y = g (polar f x y) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem map_add_add_add_map (x y z : M) : Q (x + y + z) + (Q x + Q y + Q z) = Q (x + y) + Q (y + z) + Q (z + x) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem map_add_self (x : M) : Q (x + x) = 4 * Q x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem map_zero : Q 0 = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem map_smul_of_tower [CommSemiring S] [Algebra S R] [Module S M] [IsScalarTower S R M] (a : S) (x : M) : Q (a • x) = (a * a) • Q x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem map_neg (x : M) : Q (-x) = Q x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem map_sub (x y : M) : Q (x - y) = Q (y - x) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem polar_zero_left (y : M) : polar Q 0 y = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem polar_smul_left (a : R) (x y : M) : polar Q (a • x) y = a * polar Q x y :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem polar_neg_left (x y : M) : polar Q (-x) y = -polar Q x y :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem polar_sub_left (x x' y : M) : polar Q (x - x') y = polar Q x y - polar Q x' y :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem polar_zero_right (y : M) : polar Q y 0 = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem polar_add_right (x y y' : M) : polar Q x (y + y') = polar Q x y + polar Q x y' :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem polar_smul_right (a : R) (x y : M) : polar Q x (a • y) = a * polar Q x y :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem polar_neg_right (x y : M) : polar Q x (-y) = -polar Q x y :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem polar_sub_right (x y y' : M) : polar Q x (y - y') = polar Q x y - polar Q x y' :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem polar_self (x : M) : polar Q x x = 2 * Q x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem polar_smul_left_of_tower (a : S) (x y : M) : polar Q (a • x) y = a • polar Q x y :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem polar_smul_right_of_tower (a : S) (x y : M) : polar Q x (a • y) = a • polar Q x y :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem choose_exists_companion : Q.exists_companion.choose = polarBilin Q :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem polar_toQuadraticForm (x y : M) : polar (toQuadraticForm B) x y = B x y + B y x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem _root_.QuadraticForm.toQuadraticForm_polarBilin (Q : QuadraticForm R M) : toQuadraticForm (polarBilin Q) = 2 • Q :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem _root_.QuadraticForm.polarBilin_injective (h : IsUnit (2 : R)) : Function.Injective (polarBilin : QuadraticForm R M → _) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem _root_.QuadraticForm.polarBilin_comp (Q : QuadraticForm R N) (f : M →ₗ[R] N) : polarBilin (Q.comp f) = compl₁₂ (polarBilin Q) f f :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem compQuadraticForm_polar (f : R →ₗ[S] S) (Q : QuadraticForm R M) (x y : M) : polar (f.compQuadraticForm Q) x y = f (polar Q x y) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem two_nsmul_associated : 2 • associatedHom S Q = Q.polarBilin :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem associated_isSymm : (associatedHom S Q).IsSymm :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem associated_comp [AddCommGroup N] [Module R N] (f : N →ₗ[R] M) : associatedHom S (Q.comp f) = (associatedHom S Q).compl₁₂ f f :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem associated_toQuadraticForm (B : BilinForm R M) (x y : M) : associatedHom S B.toQuadraticForm x y = ⅟ 2 * (B x y + B y x) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem associated_left_inverse (h : B₁.IsSymm) : associatedHom S B₁.toQuadraticForm = B₁ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem associated_eq_self_apply (x : M) : associatedHom S Q x x = Q x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem exists_quadraticForm_ne_zero {Q : QuadraticForm R M} (hB₁ : associated' (R := R) Q ≠ 0) : ∃ x, Q x ≠ 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem associated_linMulLin (f g : M →ₗ[R] R) : associated (R := R) (linMulLin f g) = ⅟ (2 : R) • ((mul R R).compl₁₂ f g + (mul R R).compl₁₂ g f) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "@[simp] lemma associated_sq : associated (R := R) sq = mul R R :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem IsOrtho.zero_left (x : M) : IsOrtho Q (0 : M) x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem IsOrtho.zero_right (x : M) : IsOrtho Q x (0 : M) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem isOrtho_comm {x y : M} : IsOrtho Q x y ↔ IsOrtho Q y x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem _root_.LinearMap.BilinForm.toQuadraticForm_isOrtho [IsCancelAdd R] [NoZeroDivisors R] [CharZero R] {B : BilinForm R M} {x y : M} (h : B.IsSymm): B.toQuadraticForm.IsOrtho x y ↔ B.IsOrtho x y :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem isOrtho_polarBilin {x y : M} : Q.polarBilin.IsOrtho x y ↔ IsOrtho Q x y :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem associated_isOrtho [Invertible (2 : R)] {x y : M} : Q.associated.IsOrtho x y ↔ Q.IsOrtho x y :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem not_anisotropic_iff_exists (Q : QuadraticForm R M) : ¬Anisotropic Q ↔ ∃ x, x ≠ 0 ∧ Q x = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem separatingLeft_of_anisotropic [Invertible (2 : R)] (Q : QuadraticForm R M) (hB : Q.Anisotropic) : (QuadraticForm.associated' (R := R) Q).SeparatingLeft :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem PosDef.anisotropic {Q : QuadraticForm R₂ M} (hQ : Q.PosDef) : Q.Anisotropic :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem QuadraticForm.toMatrix'_smul (a : R) (Q : QuadraticForm R (n → R)) : (a • Q).toMatrix' = a • Q.toMatrix' :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem QuadraticForm.isSymm_toMatrix' (Q : QuadraticForm R (n → R)) : Q.toMatrix'.IsSymm :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem toMatrix'_comp (Q : QuadraticForm R (m → R)) (f : (n → R) →ₗ[R] m → R) : (Q.comp f).toMatrix' = (LinearMap.toMatrix' f)ᵀ * Q.toMatrix' * (LinearMap.toMatrix' f) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem discr_smul (a : R) : (a • Q).discr = a ^ Fintype.card n * Q.discr :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem discr_comp (f : (n → R) →ₗ[R] n → R) : (Q.comp f).discr = f.toMatrix'.det * f.toMatrix'.det * Q.discr :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem exists_bilinForm_self_ne_zero [htwo : Invertible (2 : R)] {B : BilinForm R M} (hB₁ : B ≠ 0) (hB₂ : B.IsSymm) : ∃ x, ¬B.IsOrtho x x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem exists_orthogonal_basis [hK : Invertible (2 : K)] {B : BilinForm K V} (hB₂ : B.IsSymm) : ∃ v : Basis (Fin (finrank K V)) K V, B.IsOrthoᵢ v :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem basisRepr_apply [Fintype ι] {v : Basis ι R M} (Q : QuadraticForm R M) (w : ι → R) : Q.basisRepr v w = Q (∑ i : ι, w i • v i) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem basisRepr_eq_of_iIsOrtho {R M} [CommRing R] [AddCommGroup M] [Module R M] [Invertible (2 : R)] (Q : QuadraticForm R M) (v : Basis ι R M) (hv₂ : (associated (R := R) Q).IsOrthoᵢ v) : Q.basisRepr v = weightedSumSquares _ fun i => Q (v i) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem tmul_comp_tensorMap {Q₁ : QuadraticForm R M₁} {Q₂ : QuadraticForm R M₂} {Q₃ : QuadraticForm R M₃} {Q₄ : QuadraticForm R M₄} (f : Q₁ →qᵢ Q₂) (g : Q₃ →qᵢ Q₄) : (Q₂.tmul Q₄).comp (TensorProduct.map f.toLinearMap g.toLinearMap) = Q₁.tmul Q₃ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem tmul_comp_tensorComm (Q₁ : QuadraticForm R M₁) (Q₂ : QuadraticForm R M₂) : (Q₂.tmul Q₁).comp (TensorProduct.comm R M₁ M₂) = Q₁.tmul Q₂ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem tmul_comp_tensorAssoc (Q₁ : QuadraticForm R M₁) (Q₂ : QuadraticForm R M₂) (Q₃ : QuadraticForm R M₃) : (Q₁.tmul (Q₂.tmul Q₃)).comp (TensorProduct.assoc R M₁ M₂ M₃) = (Q₁.tmul Q₂).tmul Q₃ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem comp_tensorRId_eq (Q₁ : QuadraticForm R M₁) : Q₁.comp (TensorProduct.rid R M₁) = Q₁.tmul (sq (R := R)) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem comp_tensorLId_eq (Q₂ : QuadraticForm R M₂) : Q₂.comp (TensorProduct.lid R M₂) = (sq (R := R)).tmul Q₂ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem contractLeftAux_contractLeftAux (v : M) (x : CliffordAlgebra Q) (fx : CliffordAlgebra Q) : contractLeftAux Q d v (ι Q v * x, contractLeftAux Q d v (x, fx)) = Q v • fx :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem contractLeft_ι_mul (a : M) (b : CliffordAlgebra Q) : d⌋(ι Q a * b) = d a • b - ι Q a * (d⌋b) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem contractRight_mul_ι (a : M) (b : CliffordAlgebra Q) : b * ι Q a⌊d = d a • b - b⌊d * ι Q a :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem contractLeft_algebraMap_mul (r : R) (b : CliffordAlgebra Q) : d⌋(algebraMap _ _ r * b) = algebraMap _ _ r * (d⌋b) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem contractLeft_mul_algebraMap (a : CliffordAlgebra Q) (r : R) : d⌋(a * algebraMap _ _ r) = d⌋a * algebraMap _ _ r :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem contractRight_algebraMap_mul (r : R) (b : CliffordAlgebra Q) : algebraMap _ _ r * b⌊d = algebraMap _ _ r * (b⌊d) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem contractRight_mul_algebraMap (a : CliffordAlgebra Q) (r : R) : a * algebraMap _ _ r⌊d = a⌊d * algebraMap _ _ r :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem contractLeft_ι (x : M) : d⌋ι Q x = algebraMap R _ (d x) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem contractRight_ι (x : M) : ι Q x⌊d = algebraMap R _ (d x) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem contractLeft_algebraMap (r : R) : d⌋algebraMap R (CliffordAlgebra Q) r = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem contractRight_algebraMap (r : R) : algebraMap R (CliffordAlgebra Q) r⌊d = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem contractLeft_one : d⌋(1 : CliffordAlgebra Q) = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem contractRight_one : (1 : CliffordAlgebra Q)⌊d = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem contractLeft_contractLeft (x : CliffordAlgebra Q) : d⌋(d⌋x) = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem contractRight_contractRight (x : CliffordAlgebra Q) : x⌊d⌊d = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem contractLeft_comm (x : CliffordAlgebra Q) : d⌋(d'⌋x) = -(d'⌋(d⌋x)) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem contractRight_comm (x : CliffordAlgebra Q) : x⌊d⌊d' = -(x⌊d'⌊d) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem changeFormAux_changeFormAux (B : BilinForm R M) (v : M) (x : CliffordAlgebra Q) : changeFormAux Q B v (changeFormAux Q B v x) = (Q v - B v v) • x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem changeForm.associated_neg_proof [Invertible (2 : R)] : (QuadraticForm.associated (R := R) (M := M) (-Q)).toQuadraticForm = 0 - Q :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem changeForm_one : changeForm h (1 : CliffordAlgebra Q) = 1 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem changeForm_ι (m : M) : changeForm h (ι (M := M) Q m) = ι (M := M) Q' m :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem changeForm_ι_mul (m : M) (x : CliffordAlgebra Q) : changeForm h (ι (M := M) Q m * x) = ι (M := M) Q' m * changeForm h x - contractLeft (Q := Q') (B m) (changeForm h x) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem changeForm_ι_mul_ι (m₁ m₂ : M) : changeForm h (ι Q m₁ * ι Q m₂) = ι Q' m₁ * ι Q' m₂ - algebraMap _ _ (B m₁ m₂) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem changeForm_contractLeft (d : Module.Dual R M) (x : CliffordAlgebra Q) : changeForm h (contractLeft (Q := Q) d x) = contractLeft (Q := Q') d (changeForm h x) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem changeForm_self_apply (x : CliffordAlgebra Q) : changeForm (Q' := Q) changeForm.zero_proof x = x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem changeForm_changeForm (x : CliffordAlgebra Q) : changeForm h' (changeForm h x) = changeForm (changeForm.add_proof h h') x :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem coe_multilinearMap_mk (f : (ι → M) → N) (h₁ h₂ h₃) : ((⟨⟨f, h₁, h₂⟩, h₃⟩ : M [⋀^ι]→ₗ[R] N) : MultilinearMap R (fun _ : ι => M) N) = ⟨f, @h₁, @h₂⟩ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem map_eq_zero_of_not_injective (v : ι → M) (hv : ¬Function.Injective v) : f v = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem zero_compLinearMap (g : M₂ →ₗ[R] M) : (0 : M [⋀^ι]→ₗ[R] N).compLinearMap g = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem add_compLinearMap (f₁ f₂ : M [⋀^ι]→ₗ[R] N) (g : M₂ →ₗ[R] M) : (f₁ + f₂).compLinearMap g = f₁.compLinearMap g + f₂.compLinearMap g :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem compLinearMap_zero [Nonempty ι] (f : M [⋀^ι]→ₗ[R] N) : f.compLinearMap (0 : M₂ →ₗ[R] M) = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem compLinearMap_injective (f : M₂ →ₗ[R] M) (hf : Function.Surjective f) : Function.Injective fun g : M [⋀^ι]→ₗ[R] N => g.compLinearMap f :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem map_update_self [DecidableEq ι] {i j : ι} (hij : i ≠ j) : f (Function.update v i (v j)) = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem map_update_update [DecidableEq ι] {i j : ι} (hij : i ≠ j) (m : M) : f (Function.update (Function.update v i m) j m) = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem map_swap_add [DecidableEq ι] {i j : ι} (hij : i ≠ j) : f (v ∘ Equiv.swap i j) + f v = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem map_add_swap [DecidableEq ι] {i j : ι} (hij : i ≠ j) : f v + f (v ∘ Equiv.swap i j) = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem map_perm [DecidableEq ι] [Fintype ι] (v : ι → M) (σ : Equiv.Perm ι) : g (v ∘ σ) = Equiv.Perm.sign σ • g v :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem map_congr_perm [DecidableEq ι] [Fintype ι] (σ : Equiv.Perm ι) : g v = Equiv.Perm.sign σ • g (v ∘ σ) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem map_linearDependent {K : Type*} [Ring K] {M : Type*} [AddCommGroup M] [Module K M] {N : Type*} [AddCommGroup N] [Module K N] [NoZeroSMulDivisors K N] (f : M [⋀^ι]→ₗ[K] N) (v : ι → M) (h : ¬LinearIndependent K v) : f v = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem alternization_map_eq_zero_of_eq_aux (m : MultilinearMap R (fun _ : ι => M) N') (v : ι → M) (i j : ι) (i_ne_j : i ≠ j) (hv : v i = v j) : (∑ σ : Perm ι, Equiv.Perm.sign σ • m.domDomCongr σ) v = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem alternatization_apply (m : MultilinearMap R (fun _ : ι => M) N') (v : ι → M) : alternatization m v = ∑ σ : Perm ι, Equiv.Perm.sign σ • m.domDomCongr σ v :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem coe_alternatization [DecidableEq ι] [Fintype ι] (a : M [⋀^ι]→ₗ[R] N') : MultilinearMap.alternatization (a : MultilinearMap R (fun _ => M) N') = Nat.factorial (Fintype.card ι) • a :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem compMultilinearMap_alternatization (g : N' →ₗ[R] N'₂) (f : MultilinearMap R (fun _ : ι => M) N') : MultilinearMap.alternatization (g.compMultilinearMap f) = g.compAlternatingMap (MultilinearMap.alternatization f) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem Basis.ext_alternating {f g : N₁ [⋀^ι]→ₗ[R'] N₂} (e : Basis ι₁ R' N₁) (h : ∀ v : ι → ι₁, Function.Injective v → (f fun i => e (v i)) = g fun i => e (v i)) : f = g :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem curryLeft_same {n : ℕ} (f : M'' [⋀^Fin n.succ.succ]→ₗ[R'] N'') (m : M'') : (f.curryLeft m).curryLeft m = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem curryLeft_compLinearMap {n : ℕ} (g : M₂'' →ₗ[R'] M'') (f : M'' [⋀^Fin n.succ]→ₗ[R'] N'') (m : M₂'') : (f.compLinearMap g).curryLeft m = (f.curryLeft (g m)).compLinearMap g :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem Matrix.toLinearMap₂'Aux_stdBasis (f : Matrix n m R) (i : n) (j : m) : f.toLinearMap₂'Aux σ₁ σ₂ (LinearMap.stdBasis R₁ (fun _ => R₁) i 1) (LinearMap.stdBasis R₂ (fun _ => R₂) j 1) = f i j :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem LinearMap.toLinearMap₂'Aux_toMatrix₂Aux (f : (n → R₁) →ₛₗ[σ₁] (m → R₂) →ₛₗ[σ₂] R) : Matrix.toLinearMap₂'Aux σ₁ σ₂ (LinearMap.toMatrix₂Aux (fun i => stdBasis R₁ (fun _ => R₁) i 1) (fun j => stdBasis R₂ (fun _ => R₂) j 1) f) = f :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem Matrix.toMatrix₂Aux_toLinearMap₂'Aux (f : Matrix n m R) : LinearMap.toMatrix₂Aux (fun i => LinearMap.stdBasis R₁ (fun _ => R₁) i 1) (fun j => LinearMap.stdBasis R₂ (fun _ => R₂) j 1) (f.toLinearMap₂'Aux σ₁ σ₂) = f :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem Matrix.toLinearMap₂'_apply' (M : Matrix n m R) (v : n → R) (w : m → R) : Matrix.toLinearMap₂' M v w = Matrix.dotProduct v (M *ᵥ w) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem LinearMap.toMatrix₂'_compl₁₂ (B : (n → R) →ₗ[R] (m → R) →ₗ[R] R) (l : (n' → R) →ₗ[R] n → R) (r : (m' → R) →ₗ[R] m → R) : toMatrix₂' (B.compl₁₂ l r) = (toMatrix' l)ᵀ * toMatrix₂' B * toMatrix' r :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem LinearMap.toMatrix₂'_comp (B : (n → R) →ₗ[R] (m → R) →ₗ[R] R) (f : (n' → R) →ₗ[R] n → R) : toMatrix₂' (B.comp f) = (toMatrix' f)ᵀ * toMatrix₂' B :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem LinearMap.toMatrix₂'_compl₂ (B : (n → R) →ₗ[R] (m → R) →ₗ[R] R) (f : (m' → R) →ₗ[R] m → R) : toMatrix₂' (B.compl₂ f) = toMatrix₂' B * toMatrix' f :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem LinearMap.mul_toMatrix₂'_mul (B : (n → R) →ₗ[R] (m → R) →ₗ[R] R) (M : Matrix n' n R) (N : Matrix m m' R) : M * toMatrix₂' B * N = toMatrix₂' (B.compl₁₂ (toLin' Mᵀ) (toLin' N)) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem LinearMap.mul_toMatrix' (B : (n → R) →ₗ[R] (m → R) →ₗ[R] R) (M : Matrix n' n R) : M * toMatrix₂' B = toMatrix₂' (B.comp <| toLin' Mᵀ) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem LinearMap.toMatrix₂'_mul (B : (n → R) →ₗ[R] (m → R) →ₗ[R] R) (M : Matrix m m' R) : toMatrix₂' B * M = toMatrix₂' (B.compl₂ <| toLin' M) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem Matrix.toLinearMap₂'_comp (M : Matrix n m R) (P : Matrix n n' R) (Q : Matrix m m' R) : M.toLinearMap₂'.compl₁₂ (toLin' P) (toLin' Q) = toLinearMap₂' (Pᵀ * M * Q) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem LinearMap.toMatrix₂_apply (B : M₁ →ₗ[R] M₂ →ₗ[R] R) (i : n) (j : m) : LinearMap.toMatrix₂ b₁ b₂ B i j = B (b₁ i) (b₂ j) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem LinearMap.toMatrix₂Aux_eq (B : M₁ →ₗ[R] M₂ →ₗ[R] R) : LinearMap.toMatrix₂Aux b₁ b₂ B = LinearMap.toMatrix₂ b₁ b₂ B :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem Matrix.toLinearMap₂_basisFun : Matrix.toLinearMap₂ (Pi.basisFun R n) (Pi.basisFun R m) = Matrix.toLinearMap₂' :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem LinearMap.toMatrix₂_basisFun : LinearMap.toMatrix₂ (Pi.basisFun R n) (Pi.basisFun R m) = LinearMap.toMatrix₂' :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem LinearMap.toMatrix₂_compl₁₂ (B : M₁ →ₗ[R] M₂ →ₗ[R] R) (l : M₁' →ₗ[R] M₁) (r : M₂' →ₗ[R] M₂) : LinearMap.toMatrix₂ b₁' b₂' (B.compl₁₂ l r) = (toMatrix b₁' b₁ l)ᵀ * LinearMap.toMatrix₂ b₁ b₂ B * toMatrix b₂' b₂ r :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem LinearMap.toMatrix₂_comp (B : M₁ →ₗ[R] M₂ →ₗ[R] R) (f : M₁' →ₗ[R] M₁) : LinearMap.toMatrix₂ b₁' b₂ (B.comp f) = (toMatrix b₁' b₁ f)ᵀ * LinearMap.toMatrix₂ b₁ b₂ B :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem LinearMap.toMatrix₂_compl₂ (B : M₁ →ₗ[R] M₂ →ₗ[R] R) (f : M₂' →ₗ[R] M₂) : LinearMap.toMatrix₂ b₁ b₂' (B.compl₂ f) = LinearMap.toMatrix₂ b₁ b₂ B * toMatrix b₂' b₂ f :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem LinearMap.toMatrix₂_mul_basis_toMatrix (c₁ : Basis n' R M₁) (c₂ : Basis m' R M₂) (B : M₁ →ₗ[R] M₂ →ₗ[R] R) : (b₁.toMatrix c₁)ᵀ * LinearMap.toMatrix₂ b₁ b₂ B * b₂.toMatrix c₂ = LinearMap.toMatrix₂ c₁ c₂ B :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem LinearMap.mul_toMatrix₂_mul (B : M₁ →ₗ[R] M₂ →ₗ[R] R) (M : Matrix n' n R) (N : Matrix m m' R) : M * LinearMap.toMatrix₂ b₁ b₂ B * N = LinearMap.toMatrix₂ b₁' b₂' (B.compl₁₂ (toLin b₁' b₁ Mᵀ) (toLin b₂' b₂ N)) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem LinearMap.mul_toMatrix₂ (B : M₁ →ₗ[R] M₂ →ₗ[R] R) (M : Matrix n' n R) : M * LinearMap.toMatrix₂ b₁ b₂ B = LinearMap.toMatrix₂ b₁' b₂ (B.comp (toLin b₁' b₁ Mᵀ)) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem LinearMap.toMatrix₂_mul (B : M₁ →ₗ[R] M₂ →ₗ[R] R) (M : Matrix m m' R) : LinearMap.toMatrix₂ b₁ b₂ B * M = LinearMap.toMatrix₂ b₁ b₂' (B.compl₂ (toLin b₂' b₂ M)) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem Matrix.toLinearMap₂_compl₁₂ (M : Matrix n m R) (P : Matrix n n' R) (Q : Matrix m m' R) : (Matrix.toLinearMap₂ b₁ b₂ M).compl₁₂ (toLin b₁' b₁ P) (toLin b₂' b₂ Q) = Matrix.toLinearMap₂ b₁' b₂' (Pᵀ * M * Q) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem isAdjointPair_toLinearMap₂' : LinearMap.IsAdjointPair (Matrix.toLinearMap₂' J) (Matrix.toLinearMap₂' J') (Matrix.toLin' A) (Matrix.toLin' A') ↔ Matrix.IsAdjointPair J J' A A' :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem isAdjointPair_toLinearMap₂ : LinearMap.IsAdjointPair (Matrix.toLinearMap₂ b₁ b₁ J) (Matrix.toLinearMap₂ b₂ b₂ J') (Matrix.toLin b₁ b₂ A) (Matrix.toLin b₂ b₁ A') ↔ Matrix.IsAdjointPair J J' A A' :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem Matrix.isAdjointPair_equiv (P : Matrix n n R) (h : IsUnit P) : (Pᵀ * J * P).IsAdjointPair (Pᵀ * J * P) A₁ A₂ ↔ J.IsAdjointPair J (P * A₁ * P⁻¹) (P * A₂ * P⁻¹) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem mem_pairSelfAdjointMatricesSubmodule : A₁ ∈ pairSelfAdjointMatricesSubmodule J J₂ ↔ Matrix.IsAdjointPair J J₂ A₁ A₁ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem mem_selfAdjointMatricesSubmodule : A₁ ∈ selfAdjointMatricesSubmodule J ↔ J.IsSelfAdjoint A₁ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem mem_skewAdjointMatricesSubmodule : A₁ ∈ skewAdjointMatricesSubmodule J ↔ J.IsSkewAdjoint A₁ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem _root_.Matrix.Nondegenerate.toLinearMap₂' {M : Matrix ι ι R₁} (h : M.Nondegenerate) : M.toLinearMap₂'.SeparatingLeft :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem _root_.Matrix.separatingLeft_toLinearMap₂_iff {M : Matrix ι ι R₁} (b : Basis ι R₁ M₁) : (toLinearMap₂ b b M).SeparatingLeft ↔ M.Nondegenerate :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem separatingLeft_toLinearMap₂'_iff_det_ne_zero {M : Matrix ι ι R₁} : M.toLinearMap₂'.SeparatingLeft ↔ M.det ≠ 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem separatingLeft_iff_det_ne_zero {B : M₁ →ₗ[R₁] M₁ →ₗ[R₁] R₁} (b : Basis ι R₁ M₁) : B.SeparatingLeft ↔ (toMatrix₂ b b B).det ≠ 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem det_le {A : Matrix n n R} {abv : AbsoluteValue R S} {x : S} (hx : ∀ i j, abv (A i j) ≤ x) : abv A.det ≤ Nat.factorial (Fintype.card n) • x ^ Fintype.card n :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem det_sum_le {ι : Type*} (s : Finset ι) {A : ι → Matrix n n R} {abv : AbsoluteValue R S} {x : S} (hx : ∀ k i j, abv (A k i j) ≤ x) : abv (det (∑ k ∈ s, A k)) ≤ Nat.factorial (Fintype.card n) • (Finset.card s • x) ^ Fintype.card n :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem det_sum_smul_le {ι : Type*} (s : Finset ι) {c : ι → R} {A : ι → Matrix n n R} {abv : AbsoluteValue R S} {x : S} (hx : ∀ k i j, abv (A k i j) ≤ x) {y : S} (hy : ∀ k, abv (c k) ≤ y) : abv (det (∑ k ∈ s, c k • A k)) ≤ Nat.factorial (Fintype.card n) • (Finset.card s • y * x) ^ Fintype.card n :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem nondegenerate_of_det_ne_zero [DecidableEq m] {M : Matrix m m A} (hM : M.det ≠ 0) : Nondegenerate M :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem eq_zero_of_vecMul_eq_zero [DecidableEq m] {M : Matrix m m A} (hM : M.det ≠ 0) {v : m → A} (hv : v ᵥ* M = 0) : v = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem eq_zero_of_mulVec_eq_zero [DecidableEq m] {M : Matrix m m A} (hM : M.det ≠ 0) {v : m → A} (hv : M *ᵥ v = 0) : v = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem invOf_eq [Invertible A.det] [Invertible A] : ⅟ A = ⅟ A.det • A.adjugate :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem det_invOf [Invertible A] [Invertible A.det] : (⅟ A).det = ⅟ A.det :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem mul_eq_one_comm : A * B = 1 ↔ B * A = 1 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem isUnit_iff_isUnit_det : IsUnit A ↔ IsUnit A.det :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem isUnit_det_transpose (h : IsUnit A.det) : IsUnit Aᵀ.det :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem nonsing_inv_apply_not_isUnit (h : ¬IsUnit A.det) : A⁻¹ = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem nonsing_inv_apply (h : IsUnit A.det) : A⁻¹ = (↑h.unit⁻¹ : α) • A.adjugate :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem invOf_eq_nonsing_inv [Invertible A] : ⅟ A = A⁻¹ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem coe_units_inv (A : (Matrix n n α)ˣ) : ↑A⁻¹ = (A⁻¹ : Matrix n n α) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem nonsing_inv_eq_ring_inverse : A⁻¹ = Ring.inverse A :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem transpose_nonsing_inv : A⁻¹ᵀ = Aᵀ⁻¹ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem conjTranspose_nonsing_inv [StarRing α] : A⁻¹ᴴ = Aᴴ⁻¹ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem mul_nonsing_inv (h : IsUnit A.det) : A * A⁻¹ = 1 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem nonsing_inv_mul (h : IsUnit A.det) : A⁻¹ * A = 1 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem inv_inv_of_invertible [Invertible A] : A⁻¹⁻¹ = A :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem mul_nonsing_inv_cancel_right (B : Matrix m n α) (h : IsUnit A.det) : B * A * A⁻¹ = B :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem mul_nonsing_inv_cancel_left (B : Matrix n m α) (h : IsUnit A.det) : A * (A⁻¹ * B) = B :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem nonsing_inv_mul_cancel_right (B : Matrix m n α) (h : IsUnit A.det) : B * A⁻¹ * A = B :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem nonsing_inv_mul_cancel_left (B : Matrix n m α) (h : IsUnit A.det) : A⁻¹ * (A * B) = B :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem inv_mul_eq_iff_eq_mul_of_invertible (A B C : Matrix n n α) [Invertible A] : A⁻¹ * B = C ↔ B = A * C :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem mul_inv_eq_iff_eq_mul_of_invertible (A B C : Matrix n n α) [Invertible A] : B * A⁻¹ = C ↔ B = C * A :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "lemma mul_right_injective_of_invertible [Invertible A] : Function.Injective (fun (x : Matrix n m α) => A * x) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "lemma mul_left_injective_of_invertible [Invertible A] : Function.Injective (fun (x : Matrix m n α) => x * A) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "lemma mul_left_injective_of_inv (A : Matrix m n α) (B : Matrix n m α) (h : A * B = 1) : Function.Injective (fun x : Matrix l m α => x * A) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "lemma mul_right_injective_of_inv (A : Matrix m n α) (B : Matrix n m α) (h : A * B = 1) : Function.Injective (fun x : Matrix m l α => B * x) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem vecMul_surjective_iff_exists_left_inverse [Fintype m] [Finite n] {A : Matrix m n R} : Function.Surjective A.vecMul ↔ ∃ B : Matrix n m R, B * A = 1 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem mulVec_surjective_iff_exists_right_inverse [Finite m] [Fintype n] {A : Matrix m n R} : Function.Surjective A.mulVec ↔ ∃ B : Matrix n m R, A * B = 1 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem vecMul_surjective_iff_isUnit {A : Matrix m m R} : Function.Surjective A.vecMul ↔ IsUnit A :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem mulVec_surjective_iff_isUnit {A : Matrix m m R} : Function.Surjective A.mulVec ↔ IsUnit A :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem vecMul_injective_iff_isUnit {A : Matrix m m K} : Function.Injective A.vecMul ↔ IsUnit A :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem mulVec_injective_iff_isUnit {A : Matrix m m K} : Function.Injective A.mulVec ↔ IsUnit A :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem linearIndependent_rows_iff_isUnit {A : Matrix m m K} : LinearIndependent K (fun i ↦ A i) ↔ IsUnit A :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem linearIndependent_cols_iff_isUnit {A : Matrix m m K} : LinearIndependent K (fun i ↦ Aᵀ i) ↔ IsUnit A :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem nonsing_inv_cancel_or_zero : A⁻¹ * A = 1 ∧ A * A⁻¹ = 1 ∨ A⁻¹ = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem det_nonsing_inv_mul_det (h : IsUnit A.det) : A⁻¹.det * A.det = 1 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem det_nonsing_inv : A⁻¹.det = Ring.inverse A.det :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem nonsing_inv_nonsing_inv (h : IsUnit A.det) : A⁻¹⁻¹ = A :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem isUnit_nonsing_inv_det_iff {A : Matrix n n α} : IsUnit A⁻¹.det ↔ IsUnit A.det :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem unitOfDetInvertible_eq_nonsingInvUnit [Invertible A.det] : unitOfDetInvertible A = nonsingInvUnit A (isUnit_of_invertible _) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem left_inv_eq_left_inv (h : B * A = 1) (g : C * A = 1) : B = C :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem right_inv_eq_right_inv (h : A * B = 1) (g : A * C = 1) : B = C :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem right_inv_eq_left_inv (h : A * B = 1) (g : C * A = 1) : B = C :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem inv_inj (h : A⁻¹ = B⁻¹) (h' : IsUnit A.det) : A = B :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem inv_zero : (0 : Matrix n n α)⁻¹ = 0 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem inv_smul (k : α) [Invertible k] (h : IsUnit A.det) : (k • A)⁻¹ = ⅟ k • A⁻¹ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem inv_smul' (k : αˣ) (h : IsUnit A.det) : (k • A)⁻¹ = k⁻¹ • A⁻¹ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem inv_adjugate (A : Matrix n n α) (h : IsUnit A.det) : (adjugate A)⁻¹ = h.unit⁻¹ • A :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem invOf_diagonal_eq {α} [Semiring α] (v : n → α) [Invertible v] [Invertible (diagonal v)] : ⅟ (diagonal v) = diagonal (⅟ v) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem isUnit_diagonal {v : n → α} : IsUnit (diagonal v) ↔ IsUnit v :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem inv_diagonal (v : n → α) : (diagonal v)⁻¹ = diagonal (Ring.inverse v) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem inv_inv_inv (A : Matrix n n α) : A⁻¹⁻¹⁻¹ = A⁻¹ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem inv_add_inv {A B : Matrix n n α} (h : IsUnit A ↔ IsUnit B) : A⁻¹ + B⁻¹ = A⁻¹ * (A + B) * B⁻¹ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem inv_sub_inv {A B : Matrix n n α} (h : IsUnit A ↔ IsUnit B) : A⁻¹ - B⁻¹ = A⁻¹ * (B - A) * B⁻¹ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem mul_inv_rev (A B : Matrix n n α) : (A * B)⁻¹ = B⁻¹ * A⁻¹ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem list_prod_inv_reverse : ∀ l : List (Matrix n n α), l.prod⁻¹ = (l.reverse.map Inv.inv).prod", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem det_smul_inv_mulVec_eq_cramer (A : Matrix n n α) (b : n → α) (h : IsUnit A.det) : A.det • A⁻¹ *ᵥ b = cramer A b :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem det_smul_inv_vecMul_eq_cramer_transpose (A : Matrix n n α) (b : n → α) (h : IsUnit A.det) : A.det • b ᵥ* A⁻¹ = cramer Aᵀ b :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem invOf_submatrix_equiv_eq (A : Matrix m m α) (e₁ e₂ : n ≃ m) [Invertible A] [Invertible (A.submatrix e₁ e₂)] : ⅟ (A.submatrix e₁ e₂) = (⅟ A).submatrix e₂ e₁ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem isUnit_submatrix_equiv {A : Matrix m m α} (e₁ e₂ : n ≃ m) : IsUnit (A.submatrix e₁ e₂) ↔ IsUnit A :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem inv_submatrix_equiv (A : Matrix m m α) (e₁ e₂ : n ≃ m) : (A.submatrix e₁ e₂)⁻¹ = A⁻¹.submatrix e₂ e₁ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem det_conj {M : Matrix m m α} (h : IsUnit M) (N : Matrix m m α) : det (M * N * M⁻¹) = det N :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem det_conj' {M : Matrix m m α} (h : IsUnit M) (N : Matrix m m α) : det (M⁻¹ * N * M) = det N :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem submatrix_succAbove_det_eq_negOnePow_submatrix_succAbove_det {n : ℕ} (M : Matrix (Fin (n + 1)) (Fin n) R) (hv : ∑ j, M j = 0) (j₁ j₂ : Fin (n + 1)) : (M.submatrix (Fin.succAbove j₁) id).det = Int.negOnePow (j₁ - j₂) • (M.submatrix (Fin.succAbove j₂) id).det :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem submatrix_succAbove_det_eq_negOnePow_submatrix_succAbove_det' {n : ℕ} (M : Matrix (Fin n) (Fin (n + 1)) R) (hv : ∀ i, ∑ j, M i j = 0) (j₁ j₂ : Fin (n + 1)) : (M.submatrix id (Fin.succAbove j₁)).det = Int.negOnePow (j₁ - j₂) • (M.submatrix id (Fin.succAbove j₂)).det :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem lift_rank_range_add_rank_ker (f : M →ₗ[R] M') : lift.{u} (Module.rank R (LinearMap.range f)) + lift.{v} (Module.rank R (LinearMap.ker f)) = lift.{v} (Module.rank R M) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_range_add_rank_ker (f : M →ₗ[R] M₁) : Module.rank R (LinearMap.range f) + Module.rank R (LinearMap.ker f) = Module.rank R M :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem lift_rank_eq_of_surjective {f : M →ₗ[R] M'} (h : Surjective f) : lift.{v} (Module.rank R M) = lift.{u} (Module.rank R M') + lift.{v} (Module.rank R (LinearMap.ker f)) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_eq_of_surjective {f : M →ₗ[R] M₁} (h : Surjective f) : Module.rank R M = Module.rank R M₁ + Module.rank R (LinearMap.ker f) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem exists_linearIndependent_of_lt_rank [StrongRankCondition R] {s : Set M} (hs : LinearIndependent (ι := s) R Subtype.val) : ∃ t, s ⊆ t ∧ #t = Module.rank R M ∧ LinearIndependent (ι := t) R Subtype.val :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem exists_linearIndependent_cons_of_lt_rank [StrongRankCondition R] {n : ℕ} {v : Fin n → M} (hv : LinearIndependent R v) (h : n < Module.rank R M) : ∃ (x : M), LinearIndependent R (Fin.cons x v) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem exists_linearIndependent_snoc_of_lt_rank [StrongRankCondition R] {n : ℕ} {v : Fin n → M} (hv : LinearIndependent R v) (h : n < Module.rank R M) : ∃ (x : M), LinearIndependent R (Fin.snoc v x) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem exists_linearIndependent_pair_of_one_lt_rank [StrongRankCondition R] [NoZeroSMulDivisors R M] (h : 1 < Module.rank R M) {x : M} (hx : x ≠ 0) : ∃ y, LinearIndependent R ![x, y] :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem exists_smul_not_mem_of_rank_lt {N : Submodule R M} (h : Module.rank R N < Module.rank R M) : ∃ m : M, ∀ r : R, r ≠ 0 → r • m ∉ N :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem Submodule.rank_sup_add_rank_inf_eq (s t : Submodule R M) : Module.rank R (s ⊔ t : Submodule R M) + Module.rank R (s ⊓ t : Submodule R M) = Module.rank R s + Module.rank R t :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem Submodule.rank_add_le_rank_add_rank (s t : Submodule R M) : Module.rank R (s ⊔ t : Submodule R M) ≤ Module.rank R s + Module.rank R t :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem LinearIndependent.sum_elim_of_quotient {M' : Submodule R M} {ι₁ ι₂} {f : ι₁ → M'} (hf : LinearIndependent R f) (g : ι₂ → M) (hg : LinearIndependent R (Submodule.Quotient.mk (p := M') ∘ g)) : LinearIndependent R (Sum.elim (f · : ι₁ → M) g) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem LinearIndependent.union_of_quotient {M' : Submodule R M} {s : Set M} (hs : s ⊆ M') (hs' : LinearIndependent (ι := s) R Subtype.val) {t : Set M} (ht : LinearIndependent (ι := t) R (Submodule.Quotient.mk (p := M') ∘ Subtype.val)) : LinearIndependent (ι := (s ∪ t : _)) R Subtype.val :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_quotient_add_rank_le [Nontrivial R] (M' : Submodule R M) : Module.rank R (M ⧸ M') + Module.rank R M' ≤ Module.rank R M :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_quotient_eq_of_le_torsion {R M} [CommRing R] [AddCommGroup M] [Module R M] {M' : Submodule R M} (hN : M' ≤ torsion R M) : Module.rank R (M ⧸ M') = Module.rank R M :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem finrank_ulift : finrank R (ULift M) = finrank R M :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem lift_rank_add_lift_rank_le_rank_prod [Nontrivial R] : lift.{v'} (Module.rank R M) + lift.{v} (Module.rank R M') ≤ Module.rank R (M × M') :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_add_rank_le_rank_prod [Nontrivial R] : Module.rank R M + Module.rank R M₁ ≤ Module.rank R (M × M₁) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_prod : Module.rank R (M × M') = Cardinal.lift.{v'} (Module.rank R M) + Cardinal.lift.{v, v'} (Module.rank R M') :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_prod' : Module.rank R (M × M₁) = Module.rank R M + Module.rank R M₁ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem FiniteDimensional.finrank_prod [Module.Finite R M] [Module.Finite R M'] : finrank R (M × M') = finrank R M + finrank R M' :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_finsupp (ι : Type w) : Module.rank R (ι →₀ M) = Cardinal.lift.{v} #ι * Cardinal.lift.{w} (Module.rank R M) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_finsupp' (ι : Type v) : Module.rank R (ι →₀ M) = #ι * Module.rank R M :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_finsupp_self (ι : Type w) : Module.rank R (ι →₀ R) = Cardinal.lift.{u} #ι :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_finsupp_self' {ι : Type u} : Module.rank R (ι →₀ R) = #ι :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_directSum {ι : Type v} (M : ι → Type w) [∀ i : ι, AddCommGroup (M i)] [∀ i : ι, Module R (M i)] [∀ i : ι, Module.Free R (M i)] : Module.rank R (⨁ i, M i) = Cardinal.sum fun i => Module.rank R (M i) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_matrix (m : Type v) (n : Type w) [Finite m] [Finite n] : Module.rank R (Matrix m n R) = Cardinal.lift.{max v w u, v} #m * Cardinal.lift.{max v w u, w} #n :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_matrix' (m n : Type v) [Finite m] [Finite n] : Module.rank R (Matrix m n R) = Cardinal.lift.{u} (#m * #n) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_matrix'' (m n : Type u) [Finite m] [Finite n] : Module.rank R (Matrix m n R) = #m * #n :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem finrank_finsupp {ι : Type v} [Fintype ι] : finrank R (ι →₀ M) = card ι * finrank R M :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem finrank_finsupp_self {ι : Type v} [Fintype ι] : finrank R (ι →₀ R) = card ι :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem finrank_directSum {ι : Type v} [Fintype ι] (M : ι → Type w) [∀ i : ι, AddCommGroup (M i)] [∀ i : ι, Module R (M i)] [∀ i : ι, Module.Free R (M i)] [∀ i : ι, Module.Finite R (M i)] : finrank R (⨁ i, M i) = ∑ i, finrank R (M i) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem finrank_matrix (m n : Type*) [Fintype m] [Fintype n] : finrank R (Matrix m n R) = card m * card n :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_pi [Finite η] : Module.rank R (∀ i, φ i) = Cardinal.sum fun i => Module.rank R (φ i) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem FiniteDimensional.finrank_pi {ι : Type v} [Fintype ι] : finrank R (ι → R) = Fintype.card ι :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem FiniteDimensional.finrank_pi_fintype {ι : Type v} [Fintype ι] {M : ι → Type w} [∀ i : ι, AddCommGroup (M i)] [∀ i : ι, Module R (M i)] [∀ i : ι, Module.Free R (M i)] [∀ i : ι, Module.Finite R (M i)] : finrank R (∀ i, M i) = ∑ i, finrank R (M i) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_fun {M η : Type u} [Fintype η] [AddCommGroup M] [Module R M] [Module.Free R M] : Module.rank R (η → M) = Fintype.card η * Module.rank R M :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_fun_eq_lift_mul : Module.rank R (η → M) = (Fintype.card η : Cardinal.{max u₁' v}) * Cardinal.lift.{u₁'} (Module.rank R M) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_fun' : Module.rank R (η → R) = Fintype.card η :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_fin_fun (n : ℕ) : Module.rank R (Fin n → R) = n :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem FiniteDimensional.finrank_fin_fun {n : ℕ} : finrank R (Fin n → R) = n :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_tensorProduct : Module.rank R (M ⊗[S] M') = Cardinal.lift.{v'} (Module.rank R M) * Cardinal.lift.{v} (Module.rank S M') :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_tensorProduct' : Module.rank R (M ⊗[S] M₁) = Module.rank R M * Module.rank S M₁ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem FiniteDimensional.finrank_tensorProduct : finrank R (M ⊗[S] M') = finrank R M * finrank S M' :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem lt_of_le_of_finrank_lt_finrank {s t : Submodule R M} (le : s ≤ t) (lt : finrank R s < finrank R t) : s < t :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem lt_top_of_finrank_lt_finrank {s : Submodule R M} (lt : finrank R s < finrank R M) : s < ⊤ :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_span_le (s : Set M) : Module.rank R (span R s) ≤ #s :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem rank_span_finset_le (s : Finset M) : Module.rank R (span R (s : Set M)) ≤ s.card :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem finrank_span_le_card (s : Set M) [Fintype s] : finrank R (span R s) ≤ s.toFinset.card :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem finrank_span_finset_le_card (s : Finset M) : (s : Set M).finrank R ≤ s.card :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem finrank_range_le_card {ι : Type*} [Fintype ι] (b : ι → M) : (Set.range b).finrank R ≤ Fintype.card ι :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem finrank_span_eq_card [Nontrivial R] {ι : Type*} [Fintype ι] {b : ι → M} (hb : LinearIndependent R b) : finrank R (span R (Set.range b)) = Fintype.card ι :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem finrank_span_set_eq_card {s : Set M} [Fintype s] (hs : LinearIndependent R ((↑) : s → M)) : finrank R (span R s) = s.toFinset.card :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem finrank_span_finset_eq_card {s : Finset M} (hs : LinearIndependent R ((↑) : s → M)) : finrank R (span R (s : Set M)) = s.card :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem subalgebra_top_rank_eq_submodule_top_rank : Module.rank F (⊤ : Subalgebra F E) = Module.rank F (⊤ : Submodule F E) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem subalgebra_top_finrank_eq_submodule_top_finrank : finrank F (⊤ : Subalgebra F E) = finrank F (⊤ : Submodule F E) :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem Subalgebra.rank_top : Module.rank F (⊤ : Subalgebra F E) = Module.rank F E :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem Subalgebra.rank_bot : Module.rank F (⊥ : Subalgebra F E) = 1 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem Subalgebra.finrank_bot : finrank F (⊥ : Subalgebra F E) = 1 :=", "area": "LinearAlgebra"} {"task": "t8", "statement": "theorem DifferentiableAt.inversion (hc : DifferentiableAt ℝ c a) (hR : DifferentiableAt ℝ R a) (hx : DifferentiableAt ℝ x a) (hne : x a ≠ c a) : DifferentiableAt ℝ (fun a ↦ inversion (c a) (R a) (x a)) a :=", "area": "Geometry"} {"task": "t8", "statement": "theorem hasFDerivAt_inversion (hx : x ≠ c) : HasFDerivAt (inversion c R) ((R / dist x c) ^ 2 • (reflection (ℝ ∙ (x - c))ᗮ : F →L[ℝ] F)) x :=", "area": "Geometry"} {"task": "t8", "statement": "theorem Complex.norm_eventually_eq_of_mdifferentiableAt_of_isLocalMax {f : M → F} {c : M} (hd : ∀ᶠ z in 𝓝 c, MDifferentiableAt I 𝓘(ℂ, F) f z) (hc : IsLocalMax (norm ∘ f) c) : ∀ᶠ y in 𝓝 c, ‖f y‖ = ‖f c‖ :=", "area": "Geometry"} {"task": "t8", "statement": "theorem norm_eqOn_of_isPreconnected_of_isMaxOn {f : M → F} {U : Set M} {c : M} (hd : MDifferentiableOn I 𝓘(ℂ, F) f U) (hc : IsPreconnected U) (ho : IsOpen U) (hcU : c ∈ U) (hm : IsMaxOn (norm ∘ f) U c) : EqOn (norm ∘ f) (const M ‖f c‖) U :=", "area": "Geometry"} {"task": "t8", "statement": "theorem eqOn_of_isPreconnected_of_isMaxOn_norm [StrictConvexSpace ℝ F] {f : M → F} {U : Set M} {c : M} (hd : MDifferentiableOn I 𝓘(ℂ, F) f U) (hc : IsPreconnected U) (ho : IsOpen U) (hcU : c ∈ U) (hm : IsMaxOn (norm ∘ f) U c) : EqOn f (const M (f c)) U :=", "area": "Geometry"} {"task": "t8", "statement": "theorem apply_eq_of_isPreconnected_isCompact_isOpen {f : M → F} {U : Set M} {a b : M} (hd : MDifferentiableOn I 𝓘(ℂ, F) f U) (hpc : IsPreconnected U) (hc : IsCompact U) (ho : IsOpen U) (ha : a ∈ U) (hb : b ∈ U) : f a = f b :=", "area": "Geometry"} {"task": "t8", "statement": "theorem uniqueMDiffWithinAt_univ : UniqueMDiffWithinAt I univ x :=", "area": "Geometry"} {"task": "t8", "statement": "theorem uniqueMDiffWithinAt_iff {s : Set M} {x : M} : UniqueMDiffWithinAt I s x ↔ UniqueDiffWithinAt 𝕜 ((extChartAt I x).symm ⁻¹' s ∩ (extChartAt I x).target) ((extChartAt I x) x) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem UniqueMDiffWithinAt.mono_nhds {s t : Set M} {x : M} (hs : UniqueMDiffWithinAt I s x) (ht : 𝓝[s] x ≤ 𝓝[t] x) : UniqueMDiffWithinAt I t x :=", "area": "Geometry"} {"task": "t8", "statement": "theorem UniqueMDiffWithinAt.eq (U : UniqueMDiffWithinAt I s x) (h : HasMFDerivWithinAt I I' f s x f') (h₁ : HasMFDerivWithinAt I I' f s x f₁') : f' = f₁' :=", "area": "Geometry"} {"task": "t8", "statement": "theorem UniqueMDiffWithinAt.prod {x : M} {y : M'} {s t} (hs : UniqueMDiffWithinAt I s x) (ht : UniqueMDiffWithinAt I' t y) : UniqueMDiffWithinAt (I.prod I') (s ×ˢ t) (x, y) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem mdifferentiableWithinAt_iff {f : M → M'} {s : Set M} {x : M} : MDifferentiableWithinAt I I' f s x ↔ ContinuousWithinAt f s x ∧ DifferentiableWithinAt 𝕜 (writtenInExtChartAt I I' x f) ((extChartAt I x).target ∩ (extChartAt I x).symm ⁻¹' s) ((extChartAt I x) x) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem mfderivWithin_zero_of_not_mdifferentiableWithinAt (h : ¬MDifferentiableWithinAt I I' f s x) : mfderivWithin I I' f s x = 0 :=", "area": "Geometry"} {"task": "t8", "statement": "theorem mfderiv_zero_of_not_mdifferentiableAt (h : ¬MDifferentiableAt I I' f x) : mfderiv I I' f x = 0 :=", "area": "Geometry"} {"task": "t8", "statement": "theorem HasMFDerivAt.mdifferentiableAt (h : HasMFDerivAt I I' f x f') : MDifferentiableAt I I' f x :=", "area": "Geometry"} {"task": "t8", "statement": "theorem hasMFDerivWithinAt_univ : HasMFDerivWithinAt I I' f univ x f' ↔ HasMFDerivAt I I' f x f' :=", "area": "Geometry"} {"task": "t8", "statement": "theorem hasMFDerivAt_unique (h₀ : HasMFDerivAt I I' f x f₀') (h₁ : HasMFDerivAt I I' f x f₁') : f₀' = f₁' :=", "area": "Geometry"} {"task": "t8", "statement": "theorem hasMFDerivWithinAt_inter' (h : t ∈ 𝓝[s] x) : HasMFDerivWithinAt I I' f (s ∩ t) x f' ↔ HasMFDerivWithinAt I I' f s x f' :=", "area": "Geometry"} {"task": "t8", "statement": "theorem hasMFDerivWithinAt_inter (h : t ∈ 𝓝 x) : HasMFDerivWithinAt I I' f (s ∩ t) x f' ↔ HasMFDerivWithinAt I I' f s x f' :=", "area": "Geometry"} {"task": "t8", "statement": "theorem HasMFDerivWithinAt.union (hs : HasMFDerivWithinAt I I' f s x f') (ht : HasMFDerivWithinAt I I' f t x f') : HasMFDerivWithinAt I I' f (s ∪ t) x f' :=", "area": "Geometry"} {"task": "t8", "statement": "theorem HasMFDerivWithinAt.hasMFDerivAt (h : HasMFDerivWithinAt I I' f s x f') (hs : s ∈ 𝓝 x) : HasMFDerivAt I I' f x f' :=", "area": "Geometry"} {"task": "t8", "statement": "theorem MDifferentiableWithinAt.hasMFDerivWithinAt (h : MDifferentiableWithinAt I I' f s x) : HasMFDerivWithinAt I I' f s x (mfderivWithin I I' f s x) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem MDifferentiableWithinAt.mfderivWithin (h : MDifferentiableWithinAt I I' f s x) : mfderivWithin I I' f s x = fderivWithin 𝕜 (writtenInExtChartAt I I' x f : _) ((extChartAt I x).symm ⁻¹' s ∩ range I) ((extChartAt I x) x) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem MDifferentiableAt.hasMFDerivAt (h : MDifferentiableAt I I' f x) : HasMFDerivAt I I' f x (mfderiv I I' f x) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem MDifferentiableAt.mfderiv (h : MDifferentiableAt I I' f x) : mfderiv I I' f x = fderivWithin 𝕜 (writtenInExtChartAt I I' x f : _) (range I) ((extChartAt I x) x) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem HasMFDerivWithinAt.mfderivWithin (h : HasMFDerivWithinAt I I' f s x f') (hxs : UniqueMDiffWithinAt I s x) : mfderivWithin I I' f s x = f' :=", "area": "Geometry"} {"task": "t8", "statement": "theorem MDifferentiable.mfderivWithin (h : MDifferentiableAt I I' f x) (hxs : UniqueMDiffWithinAt I s x) : mfderivWithin I I' f s x = mfderiv I I' f x :=", "area": "Geometry"} {"task": "t8", "statement": "theorem mdifferentiableWithinAt_univ : MDifferentiableWithinAt I I' f univ x ↔ MDifferentiableAt I I' f x :=", "area": "Geometry"} {"task": "t8", "statement": "theorem mdifferentiableWithinAt_inter (ht : t ∈ 𝓝 x) : MDifferentiableWithinAt I I' f (s ∩ t) x ↔ MDifferentiableWithinAt I I' f s x :=", "area": "Geometry"} {"task": "t8", "statement": "theorem mdifferentiableWithinAt_inter' (ht : t ∈ 𝓝[s] x) : MDifferentiableWithinAt I I' f (s ∩ t) x ↔ MDifferentiableWithinAt I I' f s x :=", "area": "Geometry"} {"task": "t8", "statement": "theorem MDifferentiableWithinAt.mdifferentiableAt (h : MDifferentiableWithinAt I I' f s x) (hs : s ∈ 𝓝 x) : MDifferentiableAt I I' f x :=", "area": "Geometry"} {"task": "t8", "statement": "theorem mdifferentiableOn_univ : MDifferentiableOn I I' f univ ↔ MDifferentiable I I' f :=", "area": "Geometry"} {"task": "t8", "statement": "theorem mdifferentiableOn_of_locally_mdifferentiableOn (h : ∀ x ∈ s, ∃ u, IsOpen u ∧ x ∈ u ∧ MDifferentiableOn I I' f (s ∩ u)) : MDifferentiableOn I I' f s :=", "area": "Geometry"} {"task": "t8", "statement": "theorem mfderivWithin_univ : mfderivWithin I I' f univ = mfderiv I I' f :=", "area": "Geometry"} {"task": "t8", "statement": "theorem mfderivWithin_inter (ht : t ∈ 𝓝 x) : mfderivWithin I I' f (s ∩ t) x = mfderivWithin I I' f s x :=", "area": "Geometry"} {"task": "t8", "statement": "theorem mfderivWithin_of_mem_nhds (h : s ∈ 𝓝 x) : mfderivWithin I I' f s x = mfderiv I I' f x :=", "area": "Geometry"} {"task": "t8", "statement": "theorem mfderivWithin_eq_mfderiv (hs : UniqueMDiffWithinAt I s x) (h : MDifferentiableAt I I' f x) : mfderivWithin I I' f s x = mfderiv I I' f x :=", "area": "Geometry"} {"task": "t8", "statement": "theorem mdifferentiableAt_iff_of_mem_source {x' : M} {y : M'} (hx : x' ∈ (chartAt H x).source) (hy : f x' ∈ (chartAt H' y).source) : MDifferentiableAt I I' f x' ↔ ContinuousAt f x' ∧ DifferentiableWithinAt 𝕜 (extChartAt I' y ∘ f ∘ (extChartAt I x).symm) (Set.range I) ((extChartAt I x) x') :=", "area": "Geometry"} {"task": "t8", "statement": "theorem ContMDiffWithinAt.mdifferentiableWithinAt (hf : ContMDiffWithinAt I I' n f s x) (hn : 1 ≤ n) : MDifferentiableWithinAt I I' f s x :=", "area": "Geometry"} {"task": "t8", "statement": "theorem tangentMapWithin_subset {p : TangentBundle I M} (st : s ⊆ t) (hs : UniqueMDiffWithinAt I s p.1) (h : MDifferentiableWithinAt I I' f t p.1) : tangentMapWithin I I' f s p = tangentMapWithin I I' f t p :=", "area": "Geometry"} {"task": "t8", "statement": "theorem tangentMapWithin_univ : tangentMapWithin I I' f univ = tangentMap I I' f :=", "area": "Geometry"} {"task": "t8", "statement": "theorem tangentMapWithin_eq_tangentMap {p : TangentBundle I M} (hs : UniqueMDiffWithinAt I s p.1) (h : MDifferentiableAt I I' f p.1) : tangentMapWithin I I' f s p = tangentMap I I' f p :=", "area": "Geometry"} {"task": "t8", "statement": "theorem HasMFDerivWithinAt.congr_of_eventuallyEq (h : HasMFDerivWithinAt I I' f s x f') (h₁ : f₁ =ᶠ[𝓝[s] x] f) (hx : f₁ x = f x) : HasMFDerivWithinAt I I' f₁ s x f' :=", "area": "Geometry"} {"task": "t8", "statement": "theorem HasMFDerivAt.congr_of_eventuallyEq (h : HasMFDerivAt I I' f x f') (h₁ : f₁ =ᶠ[𝓝 x] f) : HasMFDerivAt I I' f₁ x f' :=", "area": "Geometry"} {"task": "t8", "statement": "theorem Filter.EventuallyEq.mdifferentiableWithinAt_iff (h₁ : f₁ =ᶠ[𝓝[s] x] f) (hx : f₁ x = f x) : MDifferentiableWithinAt I I' f s x ↔ MDifferentiableWithinAt I I' f₁ s x :=", "area": "Geometry"} {"task": "t8", "statement": "theorem Filter.EventuallyEq.mfderivWithin_eq (hs : UniqueMDiffWithinAt I s x) (hL : f₁ =ᶠ[𝓝[s] x] f) (hx : f₁ x = f x) : mfderivWithin I I' f₁ s x = (mfderivWithin I I' f s x : _) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem tangentMapWithin_congr (h : ∀ x ∈ s, f x = f₁ x) (p : TangentBundle I M) (hp : p.1 ∈ s) (hs : UniqueMDiffWithinAt I s p.1) : tangentMapWithin I I' f s p = tangentMapWithin I I' f₁ s p :=", "area": "Geometry"} {"task": "t8", "statement": "theorem Filter.EventuallyEq.mfderiv_eq (hL : f₁ =ᶠ[𝓝 x] f) : mfderiv I I' f₁ x = (mfderiv I I' f x : _) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem mfderiv_congr_point {x' : M} (h : x = x') : @Eq (E →L[𝕜] E') (mfderiv I I' f x) (mfderiv I I' f x') :=", "area": "Geometry"} {"task": "t8", "statement": "theorem mfderiv_congr {f' : M → M'} (h : f = f') : @Eq (E →L[𝕜] E') (mfderiv I I' f x) (mfderiv I I' f' x) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem writtenInExtChartAt_comp (h : ContinuousWithinAt f s x) : {y | writtenInExtChartAt I I'' x (g ∘ f) y = (writtenInExtChartAt I' I'' (f x) g ∘ writtenInExtChartAt I I' x f) y} ∈ 𝓝[(extChartAt I x).symm ⁻¹' s ∩ range I] (extChartAt I x) x :=", "area": "Geometry"} {"task": "t8", "statement": "theorem HasMFDerivWithinAt.comp (hg : HasMFDerivWithinAt I' I'' g u (f x) g') (hf : HasMFDerivWithinAt I I' f s x f') (hst : s ⊆ f ⁻¹' u) : HasMFDerivWithinAt I I'' (g ∘ f) s x (g'.comp f') :=", "area": "Geometry"} {"task": "t8", "statement": "theorem HasMFDerivAt.comp (hg : HasMFDerivAt I' I'' g (f x) g') (hf : HasMFDerivAt I I' f x f') : HasMFDerivAt I I'' (g ∘ f) x (g'.comp f') :=", "area": "Geometry"} {"task": "t8", "statement": "theorem HasMFDerivAt.comp_hasMFDerivWithinAt (hg : HasMFDerivAt I' I'' g (f x) g') (hf : HasMFDerivWithinAt I I' f s x f') : HasMFDerivWithinAt I I'' (g ∘ f) s x (g'.comp f') :=", "area": "Geometry"} {"task": "t8", "statement": "theorem MDifferentiableWithinAt.comp (hg : MDifferentiableWithinAt I' I'' g u (f x)) (hf : MDifferentiableWithinAt I I' f s x) (h : s ⊆ f ⁻¹' u) : MDifferentiableWithinAt I I'' (g ∘ f) s x :=", "area": "Geometry"} {"task": "t8", "statement": "theorem mfderivWithin_comp (hg : MDifferentiableWithinAt I' I'' g u (f x)) (hf : MDifferentiableWithinAt I I' f s x) (h : s ⊆ f ⁻¹' u) (hxs : UniqueMDiffWithinAt I s x) : mfderivWithin I I'' (g ∘ f) s x = (mfderivWithin I' I'' g u (f x)).comp (mfderivWithin I I' f s x) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem mfderiv_comp (hg : MDifferentiableAt I' I'' g (f x)) (hf : MDifferentiableAt I I' f x) : mfderiv I I'' (g ∘ f) x = (mfderiv I' I'' g (f x)).comp (mfderiv I I' f x) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem mfderiv_comp_of_eq {x : M} {y : M'} (hg : MDifferentiableAt I' I'' g y) (hf : MDifferentiableAt I I' f x) (hy : f x = y) : mfderiv I I'' (g ∘ f) x = (mfderiv I' I'' g (f x)).comp (mfderiv I I' f x) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem tangentMapWithin_comp_at (p : TangentBundle I M) (hg : MDifferentiableWithinAt I' I'' g u (f p.1)) (hf : MDifferentiableWithinAt I I' f s p.1) (h : s ⊆ f ⁻¹' u) (hps : UniqueMDiffWithinAt I s p.1) : tangentMapWithin I I'' (g ∘ f) s p = tangentMapWithin I' I'' g u (tangentMapWithin I I' f s p) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem tangentMap_comp_at (p : TangentBundle I M) (hg : MDifferentiableAt I' I'' g (f p.1)) (hf : MDifferentiableAt I I' f p.1) : tangentMap I I'' (g ∘ f) p = tangentMap I' I'' g (tangentMap I I' f p) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem tangentMap_comp (hg : MDifferentiable I' I'' g) (hf : MDifferentiable I I' f) : tangentMap I I'' (g ∘ f) = tangentMap I' I'' g ∘ tangentMap I I' f :=", "area": "Geometry"} {"task": "t8", "statement": "theorem source_trans_partialHomeomorph (hU : IsOpen U) (hφ : ContinuousOn (fun x => φ x : B → F →L[𝕜] F) U) (h2φ : ContinuousOn (fun x => (φ x).symm : B → F →L[𝕜] F) U) (hU' : IsOpen U') (hφ' : ContinuousOn (fun x => φ' x : B → F →L[𝕜] F) U') (h2φ' : ContinuousOn (fun x => (φ' x).symm : B → F →L[𝕜] F) U') : (FiberwiseLinear.partialHomeomorph φ hU hφ h2φ ≫ₕ FiberwiseLinear.partialHomeomorph φ' hU' hφ' h2φ').source = (U ∩ U') ×ˢ univ :=", "area": "Geometry"} {"task": "t8", "statement": "theorem target_trans_partialHomeomorph (hU : IsOpen U) (hφ : ContinuousOn (fun x => φ x : B → F →L[𝕜] F) U) (h2φ : ContinuousOn (fun x => (φ x).symm : B → F →L[𝕜] F) U) (hU' : IsOpen U') (hφ' : ContinuousOn (fun x => φ' x : B → F →L[𝕜] F) U') (h2φ' : ContinuousOn (fun x => (φ' x).symm : B → F →L[𝕜] F) U') : (FiberwiseLinear.partialHomeomorph φ hU hφ h2φ ≫ₕ FiberwiseLinear.partialHomeomorph φ' hU' hφ' h2φ').target = (U ∩ U') ×ˢ univ :=", "area": "Geometry"} {"task": "t8", "statement": "theorem SmoothFiberwiseLinear.locality_aux₁ (e : PartialHomeomorph (B × F) (B × F)) (h : ∀ p ∈ e.source, ∃ s : Set (B × F), IsOpen s ∧ p ∈ s ∧ ∃ (φ : B → F ≃L[𝕜] F) (u : Set B) (hu : IsOpen u) (hφ : SmoothOn IB 𝓘(𝕜, F →L[𝕜] F) (fun x => (φ x : F →L[𝕜] F)) u) (h2φ : SmoothOn IB 𝓘(𝕜, F →L[𝕜] F) (fun x => ((φ x).symm : F →L[𝕜] F)) u), (e.restr s).EqOnSource (FiberwiseLinear.partialHomeomorph φ hu hφ.continuousOn h2φ.continuousOn)) : ∃ U : Set B, e.source = U ×ˢ univ ∧ ∀ x ∈ U, ∃ (φ : B → F ≃L[𝕜] F) (u : Set B) (hu : IsOpen u) (_huU : u ⊆ U) (_hux : x ∈ u), ∃ (hφ : SmoothOn IB 𝓘(𝕜, F →L[𝕜] F) (fun x => (φ x : F →L[𝕜] F)) u) (h2φ : SmoothOn IB 𝓘(𝕜, F →L[𝕜] F) (fun x => ((φ x).symm : F →L[𝕜] F)) u), (e.restr (u ×ˢ univ)).EqOnSource (FiberwiseLinear.partialHomeomorph φ hu hφ.continuousOn h2φ.continuousOn) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem SmoothFiberwiseLinear.locality_aux₂ (e : PartialHomeomorph (B × F) (B × F)) (U : Set B) (hU : e.source = U ×ˢ univ) (h : ∀ x ∈ U, ∃ (φ : B → F ≃L[𝕜] F) (u : Set B) (hu : IsOpen u) (_hUu : u ⊆ U) (_hux : x ∈ u) (hφ : SmoothOn IB 𝓘(𝕜, F →L[𝕜] F) (fun x => (φ x : F →L[𝕜] F)) u) (h2φ : SmoothOn IB 𝓘(𝕜, F →L[𝕜] F) (fun x => ((φ x).symm : F →L[𝕜] F)) u), (e.restr (u ×ˢ univ)).EqOnSource (FiberwiseLinear.partialHomeomorph φ hu hφ.continuousOn h2φ.continuousOn)) : ∃ (Φ : B → F ≃L[𝕜] F) (U : Set B) (hU₀ : IsOpen U) (hΦ : SmoothOn IB 𝓘(𝕜, F →L[𝕜] F) (fun x => (Φ x : F →L[𝕜] F)) U) (h2Φ : SmoothOn IB 𝓘(𝕜, F →L[𝕜] F) (fun x => ((Φ x).symm : F →L[𝕜] F)) U), e.EqOnSource (FiberwiseLinear.partialHomeomorph Φ hU₀ hΦ.continuousOn h2Φ.continuousOn) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem mem_aux {e : PartialHomeomorph (B × F) (B × F)} : (e ∈ ⋃ (φ : B → F ≃L[𝕜] F) (U : Set B) (hU : IsOpen U) (hφ : SmoothOn IB 𝓘(𝕜, F →L[𝕜] F) (fun x => φ x : B → F →L[𝕜] F) U) (h2φ : SmoothOn IB 𝓘(𝕜, F →L[𝕜] F) (fun x => (φ x).symm : B → F →L[𝕜] F) U), {e | e.EqOnSource (FiberwiseLinear.partialHomeomorph φ hU hφ.continuousOn h2φ.continuousOn)}) ↔ ∃ (φ : B → F ≃L[𝕜] F) (U : Set B) (hU : IsOpen U) (hφ : SmoothOn IB 𝓘(𝕜, F →L[𝕜] F) (fun x => φ x : B → F →L[𝕜] F) U) (h2φ : SmoothOn IB 𝓘(𝕜, F →L[𝕜] F) (fun x => (φ x).symm : B → F →L[𝕜] F) U), e.EqOnSource (FiberwiseLinear.partialHomeomorph φ hU hφ.continuousOn h2φ.continuousOn) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem FiberBundle.chartedSpace_chartAt (x : TotalSpace F E) : chartAt (ModelProd HB F) x = (trivializationAt F E x.proj).toPartialHomeomorph ≫ₕ (chartAt HB x.proj).prod (PartialHomeomorph.refl F) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem FiberBundle.chartedSpace_chartAt_symm_fst (x : TotalSpace F E) (y : ModelProd HB F) (hy : y ∈ (chartAt (ModelProd HB F) x).target) : ((chartAt (ModelProd HB F) x).symm y).proj = (chartAt HB x.proj).symm y.1 :=", "area": "Geometry"} {"task": "t8", "statement": "theorem FiberBundle.extChartAt (x : TotalSpace F E) : extChartAt (IB.prod 𝓘(𝕜, F)) x = (trivializationAt F E x.proj).toPartialEquiv ≫ (extChartAt IB x.proj).prod (PartialEquiv.refl F) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem FiberBundle.extChartAt_target (x : TotalSpace F E) : (extChartAt (IB.prod 𝓘(𝕜, F)) x).target = ((extChartAt IB x.proj).target ∩ (extChartAt IB x.proj).symm ⁻¹' (trivializationAt F E x.proj).baseSet) ×ˢ univ :=", "area": "Geometry"} {"task": "t8", "statement": "theorem contMDiffWithinAt_totalSpace (f : M → TotalSpace F E) {s : Set M} {x₀ : M} : ContMDiffWithinAt IM (IB.prod 𝓘(𝕜, F)) n f s x₀ ↔ ContMDiffWithinAt IM IB n (fun x => (f x).proj) s x₀ ∧ ContMDiffWithinAt IM 𝓘(𝕜, F) n (fun x ↦ (trivializationAt F E (f x₀).proj (f x)).2) s x₀ :=", "area": "Geometry"} {"task": "t8", "statement": "theorem contMDiffAt_totalSpace (f : M → TotalSpace F E) (x₀ : M) : ContMDiffAt IM (IB.prod 𝓘(𝕜, F)) n f x₀ ↔ ContMDiffAt IM IB n (fun x => (f x).proj) x₀ ∧ ContMDiffAt IM 𝓘(𝕜, F) n (fun x => (trivializationAt F E (f x₀).proj (f x)).2) x₀ :=", "area": "Geometry"} {"task": "t8", "statement": "theorem contMDiffAt_section (s : ∀ x, E x) (x₀ : B) : ContMDiffAt IB (IB.prod 𝓘(𝕜, F)) n (fun x => TotalSpace.mk' F x (s x)) x₀ ↔ ContMDiffAt IB 𝓘(𝕜, F) n (fun x ↦ (trivializationAt F E x₀ ⟨x, s x⟩).2) x₀ :=", "area": "Geometry"} {"task": "t8", "statement": "theorem contMDiff_proj : ContMDiff (IB.prod 𝓘(𝕜, F)) IB n (π F E) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem smooth_zeroSection : Smooth IB (IB.prod 𝓘(𝕜, F)) (zeroSection F E) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem smoothOn_symm_coordChangeL : SmoothOn IB 𝓘(𝕜, F →L[𝕜] F) (fun b : B => ((e.coordChangeL 𝕜 e' b).symm : F →L[𝕜] F)) (e.baseSet ∩ e'.baseSet) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem ContMDiffWithinAt.coordChange (hf : ContMDiffWithinAt IM IB n f s x) (hg : ContMDiffWithinAt IM 𝓘(𝕜, F) n g s x) (he : f x ∈ e.baseSet) (he' : f x ∈ e'.baseSet) : ContMDiffWithinAt IM 𝓘(𝕜, F) n (fun y ↦ e.coordChange e' (f y) (g y)) s x :=", "area": "Geometry"} {"task": "t8", "statement": "theorem Trivialization.contMDiffOn_symm_trans : ContMDiffOn (IB.prod 𝓘(𝕜, F)) (IB.prod 𝓘(𝕜, F)) n (e.toPartialHomeomorph.symm ≫ₕ e'.toPartialHomeomorph) (e.target ∩ e'.target) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem ContMDiffWithinAt.change_section_trivialization {f : M → TotalSpace F E} (hp : ContMDiffWithinAt IM IB n (π F E ∘ f) s x) (hf : ContMDiffWithinAt IM 𝓘(𝕜, F) n (fun y ↦ (e (f y)).2) s x) (he : f x ∈ e.source) (he' : f x ∈ e'.source) : ContMDiffWithinAt IM 𝓘(𝕜, F) n (fun y ↦ (e' (f y)).2) s x :=", "area": "Geometry"} {"task": "t8", "statement": "theorem Trivialization.contMDiffOn_iff {f : M → TotalSpace F E} {s : Set M} (he : MapsTo f s e.source) : ContMDiffOn IM (IB.prod 𝓘(𝕜, F)) n f s ↔ ContMDiffOn IM IB n (fun x => (f x).proj) s ∧ ContMDiffOn IM 𝓘(𝕜, F) n (fun x ↦ (e (f x)).2) s :=", "area": "Geometry"} {"task": "t8", "statement": "theorem Trivialization.smoothOn (e : Trivialization F (π F E)) [MemTrivializationAtlas e] : SmoothOn (IB.prod 𝓘(𝕜, F)) (IB.prod 𝓘(𝕜, F)) e e.source :=", "area": "Geometry"} {"task": "t8", "statement": "theorem Trivialization.smoothOn_symm (e : Trivialization F (π F E)) [MemTrivializationAtlas e] : SmoothOn (IB.prod 𝓘(𝕜, F)) (IB.prod 𝓘(𝕜, F)) e.toPartialHomeomorph.symm e.target :=", "area": "Geometry"} {"task": "t8", "statement": "theorem mk_smoothCoordChange (he : e ∈ a.pretrivializationAtlas) (he' : e' ∈ a.pretrivializationAtlas) {b : B} (hb : b ∈ e.baseSet ∩ e'.baseSet) (v : F) : (b, a.smoothCoordChange IB he he' b v) = e' ⟨b, e.symm b v⟩ :=", "area": "Geometry"} {"task": "t8", "statement": "theorem smoothVectorBundle : @SmoothVectorBundle _ _ F E _ _ _ _ _ _ IB _ _ _ _ _ _ a.totalSpaceTopology _ a.toFiberBundle a.toVectorBundle :=", "area": "Geometry"} {"task": "t8", "statement": "theorem ContMDiffWithinAt.div {f g : M → G} {s : Set M} {x₀ : M} (hf : ContMDiffWithinAt I' I n f s x₀) (hg : ContMDiffWithinAt I' I n g s x₀) : ContMDiffWithinAt I' I n (fun x => f x / g x) s x₀ :=", "area": "Geometry"} {"task": "t8", "statement": "theorem ContMDiffAt.div {f g : M → G} {x₀ : M} (hf : ContMDiffAt I' I n f x₀) (hg : ContMDiffAt I' I n g x₀) : ContMDiffAt I' I n (fun x => f x / g x) x₀ :=", "area": "Geometry"} {"task": "t8", "statement": "theorem ContMDiffOn.div {f g : M → G} {s : Set M} (hf : ContMDiffOn I' I n f s) (hg : ContMDiffOn I' I n g s) : ContMDiffOn I' I n (fun x => f x / g x) s :=", "area": "Geometry"} {"task": "t8", "statement": "theorem ContMDiff.div {f g : M → G} (hf : ContMDiff I' I n f) (hg : ContMDiff I' I n g) : ContMDiff I' I n fun x => f x / g x :=", "area": "Geometry"} {"task": "t8", "statement": "theorem ContMDiffWithinAt.div₀ (hf : ContMDiffWithinAt I' I n f s a) (hg : ContMDiffWithinAt I' I n g s a) (h₀ : g a ≠ 0) : ContMDiffWithinAt I' I n (f / g) s a :=", "area": "Geometry"} {"task": "t8", "statement": "theorem ContMDiffOn.div₀ (hf : ContMDiffOn I' I n f s) (hg : ContMDiffOn I' I n g s) (h₀ : ∀ x ∈ s, g x ≠ 0) : ContMDiffOn I' I n (f / g) s :=", "area": "Geometry"} {"task": "t8", "statement": "theorem ContMDiffAt.div₀ (hf : ContMDiffAt I' I n f a) (hg : ContMDiffAt I' I n g a) (h₀ : g a ≠ 0) : ContMDiffAt I' I n (f / g) a :=", "area": "Geometry"} {"task": "t8", "statement": "theorem ContMDiff.div₀ (hf : ContMDiff I' I n f) (hg : ContMDiff I' I n g) (h₀ : ∀ x, g x ≠ 0) : ContMDiff I' I n (f / g) :=", "area": "Geometry"} {"task": "t8", "statement": "theorem lift_succ (a : Ordinal.{v}) : lift.{u} (succ a) = succ (lift.{u} a) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem add_left_cancel (a) {b c : Ordinal} : a + b = a + c ↔ b = c :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem add_lt_add_iff_left' (a) {b c : Ordinal} : a + b < a + c ↔ b < c :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem add_le_add_iff_right {a b : Ordinal} : ∀ n : ℕ, a + n ≤ b + n ↔ a ≤ b", "area": "SetTheory"} {"task": "t8", "statement": "theorem add_right_cancel {a b : Ordinal} (n : ℕ) : a + n = b + n ↔ a = b :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem add_eq_zero_iff {a b : Ordinal} : a + b = 0 ↔ a = 0 ∧ b = 0 :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem pred_succ (o) : pred (succ o) = o :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem pred_le_self (o) : pred o ≤ o :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem pred_eq_iff_not_succ {o} : pred o = o ↔ ¬∃ a, o = succ a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem pred_eq_iff_not_succ' {o} : pred o = o ↔ ∀ a, o ≠ succ a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem pred_lt_iff_is_succ {o} : pred o < o ↔ ∃ a, o = succ a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem succ_pred_iff_is_succ {o} : succ (pred o) = o ↔ ∃ a, o = succ a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lt_pred {a b} : a < pred b ↔ succ a < b :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lift_is_succ {o : Ordinal.{v}} : (∃ a, lift.{u} o = succ a) ↔ ∃ a, o = succ a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lift_pred (o : Ordinal.{v}) : lift.{u} (pred o) = pred (lift.{u} o) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lt_limit {o} (h : IsLimit o) {a} : a < o ↔ ∃ x < o, a < x :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lift_isLimit (o) : IsLimit (lift o) ↔ IsLimit o :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem IsLimit.one_lt {o : Ordinal} (h : IsLimit o) : 1 < o :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem limitRecOn_zero {C} (H₁ H₂ H₃) : @limitRecOn C 0 H₁ H₂ H₃ = H₁ :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem limitRecOn_succ {C} (o H₁ H₂ H₃) : @limitRecOn C (succ o) H₁ H₂ H₃ = H₂ o (@limitRecOn C o H₁ H₂ H₃) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem limitRecOn_limit {C} (o H₁ H₂ H₃ h) : @limitRecOn C o H₁ H₂ H₃ = H₃ o h fun x _h => @limitRecOn C x H₁ H₂ H₃ :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem enum_succ_eq_top {o : Ordinal} : enum (· < ·) o (by rw [type_lt] exact lt_succ o) = (⊤ : (succ o).out.α) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem has_succ_of_type_succ_lt {α} {r : α → α → Prop} [wo : IsWellOrder α r] (h : ∀ a < type r, succ a < type r) (x : α) : ∃ y, r x y :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem out_no_max_of_succ_lt {o : Ordinal} (ho : ∀ a < o, succ a < o) : NoMaxOrder o.out.α :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem bounded_singleton {r : α → α → Prop} [IsWellOrder α r] (hr : (type r).IsLimit) (x) : Bounded r {x} :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem type_subrel_lt (o : Ordinal.{u}) : type (Subrel ((· < ·) : Ordinal → Ordinal → Prop) { o' : Ordinal | o' < o }) = Ordinal.lift.{u + 1} o :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mk_initialSeg (o : Ordinal.{u}) : #{ o' : Ordinal | o' < o } = Cardinal.lift.{u + 1} o.card :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem IsNormal.limit_lt {f} (H : IsNormal f) {o} (h : IsLimit o) {a} : a < f o ↔ ∃ b < o, a < f b :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem IsNormal.inj {f} (H : IsNormal f) {a b} : f a = f b ↔ a = b :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem IsNormal.le_set {f o} (H : IsNormal f) (p : Set Ordinal) (p0 : p.Nonempty) (b) (H₂ : ∀ o, b ≤ o ↔ ∀ a ∈ p, a ≤ o) : f b ≤ o ↔ ∀ a ∈ p, f a ≤ o :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem IsNormal.le_set' {f o} (H : IsNormal f) (p : Set α) (p0 : p.Nonempty) (g : α → Ordinal) (b) (H₂ : ∀ o, b ≤ o ↔ ∀ a ∈ p, g a ≤ o) : f b ≤ o ↔ ∀ a ∈ p, f (g a) ≤ o :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem add_le_of_limit {a b c : Ordinal} (h : IsLimit b) : a + b ≤ c ↔ ∀ b' < b, a + b' ≤ c :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem add_sub_cancel_of_le {a b : Ordinal} (h : b ≤ a) : b + (a - b) = a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem le_sub_of_le {a b c : Ordinal} (h : b ≤ a) : c ≤ a - b ↔ b + c ≤ a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem sub_zero (a : Ordinal) : a - 0 = a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem zero_sub (a : Ordinal) : 0 - a = 0 :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem sub_self (a : Ordinal) : a - a = 0 :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem sub_eq_zero_iff_le {a b : Ordinal} : a - b = 0 ↔ a ≤ b :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem sub_sub (a b c : Ordinal) : a - b - c = a - (b + c) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem add_sub_add_cancel (a b c : Ordinal) : a + b - (a + c) = b - c :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem sub_isLimit {a b} (l : IsLimit a) (h : b < a) : IsLimit (a - b) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem one_add_omega : 1 + ω = ω :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem one_add_of_omega_le {o} (h : ω ≤ o) : 1 + o = o :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mul_eq_zero' {a b : Ordinal} : a * b = 0 ↔ a = 0 ∨ b = 0 :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem le_mul_left (a : Ordinal) {b : Ordinal} (hb : 0 < b) : a ≤ a * b :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem le_mul_right (a : Ordinal) {b : Ordinal} (hb : 0 < b) : a ≤ b * a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mul_le_of_limit_aux {α β r s} [IsWellOrder α r] [IsWellOrder β s] {c} (h : IsLimit (type s)) (H : ∀ b' < type s, type r * b' ≤ c) (l : c < type r * type s) : False :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mul_le_of_limit {a b c : Ordinal} (h : IsLimit b) : a * b ≤ c ↔ ∀ b' < b, a * b' ≤ c :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mul_isNormal {a : Ordinal} (h : 0 < a) : IsNormal (a * ·) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lt_mul_of_limit {a b c : Ordinal} (h : IsLimit c) : a < b * c ↔ ∃ c' < c, a < b * c' :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mul_pos {a b : Ordinal} (h₁ : 0 < a) (h₂ : 0 < b) : 0 < a * b :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mul_ne_zero {a b : Ordinal} : a ≠ 0 → b ≠ 0 → a * b ≠ 0 :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mul_isLimit_left {a b : Ordinal} (l : IsLimit a) (b0 : 0 < b) : IsLimit (a * b) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem smul_eq_mul : ∀ (n : ℕ) (a : Ordinal), n • a = a * n", "area": "SetTheory"} {"task": "t8", "statement": "theorem div_nonempty {a b : Ordinal} (h : b ≠ 0) : { o | a < b * succ o }.Nonempty :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lt_mul_succ_div (a) {b : Ordinal} (h : b ≠ 0) : a < b * succ (a / b) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lt_mul_div_add (a) {b : Ordinal} (h : b ≠ 0) : a < b * (a / b) + b :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem div_le {a b c : Ordinal} (b0 : b ≠ 0) : a / b ≤ c ↔ a < b * succ c :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lt_div {a b c : Ordinal} (h : c ≠ 0) : a < b / c ↔ c * succ a ≤ b :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem div_pos {b c : Ordinal} (h : c ≠ 0) : 0 < b / c ↔ c ≤ b :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem le_div {a b c : Ordinal} (c0 : c ≠ 0) : a ≤ b / c ↔ c * a ≤ b :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem div_le_of_le_mul {a b c : Ordinal} (h : a ≤ b * c) : a / b ≤ c :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mul_div_le (a b : Ordinal) : b * (a / b) ≤ a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mul_add_div (a) {b : Ordinal} (b0 : b ≠ 0) (c) : (b * a + c) / b = a + c / b :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem div_eq_zero_of_lt {a b : Ordinal} (h : a < b) : a / b = 0 :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mul_div_cancel (a) {b : Ordinal} (b0 : b ≠ 0) : b * a / b = a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem div_one (a : Ordinal) : a / 1 = a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem div_self {a : Ordinal} (h : a ≠ 0) : a / a = 1 :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mul_sub (a b c : Ordinal) : a * (b - c) = a * b - a * c :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem isLimit_add_iff {a b} : IsLimit (a + b) ↔ IsLimit b ∨ b = 0 ∧ IsLimit a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem dvd_add_iff : ∀ {a b c : Ordinal}, a ∣ b → (a ∣ b + c ↔ a ∣ c)", "area": "SetTheory"} {"task": "t8", "statement": "theorem div_mul_cancel : ∀ {a b : Ordinal}, a ≠ 0 → a ∣ b → a * (b / a) = b", "area": "SetTheory"} {"task": "t8", "statement": "theorem le_of_dvd : ∀ {a b : Ordinal}, b ≠ 0 → a ∣ b → a ≤ b", "area": "SetTheory"} {"task": "t8", "statement": "theorem dvd_antisymm {a b : Ordinal} (h₁ : a ∣ b) (h₂ : b ∣ a) : a = b :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mod_zero (a : Ordinal) : a % 0 = a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mod_eq_of_lt {a b : Ordinal} (h : a < b) : a % b = a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem zero_mod (b : Ordinal) : 0 % b = 0 :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mod_lt (a) {b : Ordinal} (h : b ≠ 0) : a % b < b :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mod_self (a : Ordinal) : a % a = 0 :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mod_one (a : Ordinal) : a % 1 = 0 :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem dvd_of_mod_eq_zero {a b : Ordinal} (H : a % b = 0) : b ∣ a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mod_eq_zero_of_dvd {a b : Ordinal} (H : b ∣ a) : a % b = 0 :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mul_add_mod_self (x y z : Ordinal) : (x * y + z) % x = z % x :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mul_mod (x y : Ordinal) : x * y % x = 0 :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mod_mod_of_dvd (a : Ordinal) {b c : Ordinal} (h : c ∣ b) : a % b % c = a % c :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem bfamilyOfFamily'_typein {ι} (r : ι → ι → Prop) [IsWellOrder ι r] (f : ι → α) (i) : bfamilyOfFamily' r f (typein r i) (typein_lt_type r i) = f i :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem familyOfBFamily'_enum {ι : Type u} (r : ι → ι → Prop) [IsWellOrder ι r] {o} (ho : type r = o) (f : ∀ a < o, α) (i hi) : familyOfBFamily' r ho f (enum r i (by rwa [ho])) = f i hi :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem familyOfBFamily_enum (o : Ordinal) (f : ∀ a < o, α) (i hi) : familyOfBFamily o f (enum (· < ·) i (by convert hi exact type_lt _)) = f i hi :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem range_familyOfBFamily' {ι : Type u} (r : ι → ι → Prop) [IsWellOrder ι r] {o} (ho : type r = o) (f : ∀ a < o, α) : range (familyOfBFamily' r ho f) = brange o f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem brange_bfamilyOfFamily' {ι : Type u} (r : ι → ι → Prop) [IsWellOrder ι r] (f : ι → α) : brange _ (bfamilyOfFamily' r f) = range f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem brange_const {o : Ordinal} (ho : o ≠ 0) {c : α} : (brange o fun _ _ => c) = {c} :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem bddAbove_range {ι : Type u} (f : ι → Ordinal.{max u v}) : BddAbove (Set.range f) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem sup_le_iff {ι : Type u} {f : ι → Ordinal.{max u v}} {a} : sup.{_, v} f ≤ a ↔ ∀ i, f i ≤ a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lt_sup {ι : Type u} {f : ι → Ordinal.{max u v}} {a} : a < sup.{_, v} f ↔ ∃ i, a < f i :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem sup_not_succ_of_ne_sup {ι : Type u} {f : ι → Ordinal.{max u v}} (hf : ∀ i, f i ≠ sup.{_, v} f) {a} (hao : a < sup.{_, v} f) : succ a < sup.{_, v} f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem sup_eq_zero_iff {ι : Type u} {f : ι → Ordinal.{max u v}} : sup.{_, v} f = 0 ↔ ∀ i, f i = 0 :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem IsNormal.sup {f : Ordinal.{max u v} → Ordinal.{max u w}} (H : IsNormal f) {ι : Type u} (g : ι → Ordinal.{max u v}) [Nonempty ι] : f (sup.{_, v} g) = sup.{_, w} (f ∘ g) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem sup_sum {α : Type u} {β : Type v} (f : Sum α β → Ordinal) : sup.{max u v, w} f = max (sup.{u, max v w} fun a => f (Sum.inl a)) (sup.{v, max u w} fun b => f (Sum.inr b)) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem le_sup_shrink_equiv {s : Set Ordinal.{u}} (hs : Small.{u} s) (a) (ha : a ∈ s) : a ≤ sup.{u, u} fun x => ((@equivShrink s hs).symm x).val :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem sSup_ord {s : Set Cardinal.{u}} (hs : BddAbove s) : (sSup s).ord = sSup (ord '' s) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem iSup_ord {ι} {f : ι → Cardinal} (hf : BddAbove (range f)) : (iSup f).ord = ⨆ i, (f i).ord :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem sup_le_sup {ι ι' : Type u} (r : ι → ι → Prop) (r' : ι' → ι' → Prop) [IsWellOrder ι r] [IsWellOrder ι' r'] {o} (ho : type r = o) (ho' : type r' = o) (f : ∀ a < o, Ordinal.{max u v}) : sup.{_, v} (familyOfBFamily' r ho f) ≤ sup.{_, v} (familyOfBFamily' r' ho' f) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem sup_eq_sup {ι ι' : Type u} (r : ι → ι → Prop) (r' : ι' → ι' → Prop) [IsWellOrder ι r] [IsWellOrder ι' r'] {o : Ordinal.{u}} (ho : type r = o) (ho' : type r' = o) (f : ∀ a < o, Ordinal.{max u v}) : sup.{_, v} (familyOfBFamily' r ho f) = sup.{_, v} (familyOfBFamily' r' ho' f) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem sSup_eq_bsup {o : Ordinal.{u}} (f : ∀ a < o, Ordinal.{max u v}) : sSup (brange o f) = bsup.{_, v} o f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem bsup_eq_sup' {ι : Type u} (r : ι → ι → Prop) [IsWellOrder ι r] (f : ι → Ordinal.{max u v}) : bsup.{_, v} _ (bfamilyOfFamily' r f) = sup.{_, v} f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem bsup_eq_bsup {ι : Type u} (r r' : ι → ι → Prop) [IsWellOrder ι r] [IsWellOrder ι r'] (f : ι → Ordinal.{max u v}) : bsup.{_, v} _ (bfamilyOfFamily' r f) = bsup.{_, v} _ (bfamilyOfFamily' r' f) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem bsup_congr {o₁ o₂ : Ordinal.{u}} (f : ∀ a < o₁, Ordinal.{max u v}) (ho : o₁ = o₂) : bsup.{_, v} o₁ f = bsup.{_, v} o₂ fun a h => f a (h.trans_eq ho.symm) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem bsup_le_iff {o f a} : bsup.{u, v} o f ≤ a ↔ ∀ i h, f i h ≤ a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lt_bsup {o : Ordinal.{u}} (f : ∀ a < o, Ordinal.{max u v}) {a} : a < bsup.{_, v} o f ↔ ∃ i hi, a < f i hi :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem IsNormal.bsup {f : Ordinal.{max u v} → Ordinal.{max u w}} (H : IsNormal f) {o : Ordinal.{u}} : ∀ (g : ∀ a < o, Ordinal), o ≠ 0 → f (bsup.{_, v} o g) = bsup.{_, w} o fun a h => f (g a h) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem bsup_not_succ_of_ne_bsup {o : Ordinal.{u}} {f : ∀ a < o, Ordinal.{max u v}} (hf : ∀ {i : Ordinal} (h : i < o), f i h ≠ bsup.{_, v} o f) (a) : a < bsup.{_, v} o f → succ a < bsup.{_, v} o f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem bsup_eq_zero_iff {o} {f : ∀ a < o, Ordinal} : bsup o f = 0 ↔ ∀ i hi, f i hi = 0 :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem bsup_one (f : ∀ a < (1 : Ordinal), Ordinal) : bsup 1 f = f 0 zero_lt_one :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem bsup_le_of_brange_subset {o o'} {f : ∀ a < o, Ordinal} {g : ∀ a < o', Ordinal} (h : brange o f ⊆ brange o' g) : bsup.{u, max v w} o f ≤ bsup.{v, max u w} o' g :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lsub_le_iff {ι : Type u} {f : ι → Ordinal.{max u v}} {a} : lsub.{_, v} f ≤ a ↔ ∀ i, f i < a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lt_lsub_iff {ι : Type u} {f : ι → Ordinal.{max u v}} {a} : a < lsub.{_, v} f ↔ ∃ i, a ≤ f i :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem sup_eq_lsub_or_sup_succ_eq_lsub {ι : Type u} (f : ι → Ordinal.{max u v}) : sup.{_, v} f = lsub.{_, v} f ∨ succ (sup.{_, v} f) = lsub.{_, v} f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem sup_succ_le_lsub {ι : Type u} (f : ι → Ordinal.{max u v}) : succ (sup.{_, v} f) ≤ lsub.{_, v} f ↔ ∃ i, f i = sup.{_, v} f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem sup_eq_lsub_iff_succ {ι : Type u} (f : ι → Ordinal.{max u v}) : sup.{_, v} f = lsub.{_, v} f ↔ ∀ a < lsub.{_, v} f, succ a < lsub.{_, v} f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem sup_eq_lsub_iff_lt_sup {ι : Type u} (f : ι → Ordinal.{max u v}) : sup.{_, v} f = lsub.{_, v} f ↔ ∀ i, f i < sup.{_, v} f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lsub_empty {ι} [h : IsEmpty ι] (f : ι → Ordinal) : lsub f = 0 :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lsub_eq_zero_iff {ι : Type u} (f : ι → Ordinal.{max u v}) : lsub.{_, v} f = 0 ↔ IsEmpty ι :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lsub_le_of_range_subset {ι ι'} {f : ι → Ordinal} {g : ι' → Ordinal} (h : Set.range f ⊆ Set.range g) : lsub.{u, max v w} f ≤ lsub.{v, max u w} g :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lsub_typein (o : Ordinal) : lsub.{u, u} (typein ((· < ·) : o.out.α → o.out.α → Prop)) = o :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem sup_typein_limit {o : Ordinal} (ho : ∀ a, a < o → succ a < o) : sup.{u, u} (typein ((· < ·) : o.out.α → o.out.α → Prop)) = o :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem sup_typein_succ {o : Ordinal} : sup.{u, u} (typein ((· < ·) : (succ o).out.α → (succ o).out.α → Prop)) = o :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lsub_eq_lsub {ι ι' : Type u} (r : ι → ι → Prop) (r' : ι' → ι' → Prop) [IsWellOrder ι r] [IsWellOrder ι' r'] {o} (ho : type r = o) (ho' : type r' = o) (f : ∀ a < o, Ordinal.{max u v}) : lsub.{_, v} (familyOfBFamily' r ho f) = lsub.{_, v} (familyOfBFamily' r' ho' f) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem blsub_eq_blsub {ι : Type u} (r r' : ι → ι → Prop) [IsWellOrder ι r] [IsWellOrder ι r'] (f : ι → Ordinal.{max u v}) : blsub.{_, v} _ (bfamilyOfFamily' r f) = blsub.{_, v} _ (bfamilyOfFamily' r' f) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem blsub_congr {o₁ o₂ : Ordinal.{u}} (f : ∀ a < o₁, Ordinal.{max u v}) (ho : o₁ = o₂) : blsub.{_, v} o₁ f = blsub.{_, v} o₂ fun a h => f a (h.trans_eq ho.symm) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem blsub_le_iff {o : Ordinal.{u}} {f : ∀ a < o, Ordinal.{max u v}} {a} : blsub.{_, v} o f ≤ a ↔ ∀ i h, f i h < a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lt_blsub_iff {o : Ordinal.{u}} {f : ∀ b < o, Ordinal.{max u v}} {a} : a < blsub.{_, v} o f ↔ ∃ i hi, a ≤ f i hi :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem bsup_eq_blsub_or_succ_bsup_eq_blsub {o : Ordinal.{u}} (f : ∀ a < o, Ordinal.{max u v}) : bsup.{_, v} o f = blsub.{_, v} o f ∨ succ (bsup.{_, v} o f) = blsub.{_, v} o f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem bsup_succ_le_blsub {o : Ordinal.{u}} (f : ∀ a < o, Ordinal.{max u v}) : succ (bsup.{_, v} o f) ≤ blsub.{_, v} o f ↔ ∃ i hi, f i hi = bsup.{_, v} o f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem bsup_eq_blsub_iff_succ {o : Ordinal.{u}} (f : ∀ a < o, Ordinal.{max u v}) : bsup.{_, v} o f = blsub.{_, v} o f ↔ ∀ a < blsub.{_, v} o f, succ a < blsub.{_, v} o f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem bsup_eq_blsub_iff_lt_bsup {o : Ordinal.{u}} (f : ∀ a < o, Ordinal.{max u v}) : bsup.{_, v} o f = blsub.{_, v} o f ↔ ∀ i hi, f i hi < bsup.{_, v} o f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem bsup_eq_blsub_of_lt_succ_limit {o : Ordinal.{u}} (ho : IsLimit o) {f : ∀ a < o, Ordinal.{max u v}} (hf : ∀ a ha, f a ha < f (succ a) (ho.2 a ha)) : bsup.{_, v} o f = blsub.{_, v} o f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem blsub_eq_zero_iff {o} {f : ∀ a < o, Ordinal} : blsub o f = 0 ↔ o = 0 :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem blsub_zero (f : ∀ a < (0 : Ordinal), Ordinal) : blsub 0 f = 0 :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem blsub_type {α : Type u} (r : α → α → Prop) [IsWellOrder α r] (f : ∀ a < type r, Ordinal.{max u v}) : blsub.{_, v} (type r) f = lsub.{_, v} fun a => f (typein r a) (typein_lt_type _ _) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem blsub_le_of_brange_subset {o o'} {f : ∀ a < o, Ordinal} {g : ∀ a < o', Ordinal} (h : brange o f ⊆ brange o' g) : blsub.{u, max v w} o f ≤ blsub.{v, max u w} o' g :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem bsup_comp {o o' : Ordinal.{max u v}} {f : ∀ a < o, Ordinal.{max u v w}} (hf : ∀ {i j} (hi) (hj), i ≤ j → f i hi ≤ f j hj) {g : ∀ a < o', Ordinal.{max u v}} (hg : blsub.{_, u} o' g = o) : (bsup.{_, w} o' fun a ha => f (g a ha) (by rw [← hg]; apply lt_blsub)) = bsup.{_, w} o f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem blsub_comp {o o' : Ordinal.{max u v}} {f : ∀ a < o, Ordinal.{max u v w}} (hf : ∀ {i j} (hi) (hj), i ≤ j → f i hi ≤ f j hj) {g : ∀ a < o', Ordinal.{max u v}} (hg : blsub.{_, u} o' g = o) : (blsub.{_, w} o' fun a ha => f (g a ha) (by rw [← hg]; apply lt_blsub)) = blsub.{_, w} o f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem IsNormal.bsup_eq {f : Ordinal.{u} → Ordinal.{max u v}} (H : IsNormal f) {o : Ordinal.{u}} (h : IsLimit o) : (Ordinal.bsup.{_, v} o fun x _ => f x) = f o :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem IsNormal.blsub_eq {f : Ordinal.{u} → Ordinal.{max u v}} (H : IsNormal f) {o : Ordinal.{u}} (h : IsLimit o) : (blsub.{_, v} o fun x _ => f x) = f o :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem isNormal_iff_lt_succ_and_bsup_eq {f : Ordinal.{u} → Ordinal.{max u v}} : IsNormal f ↔ (∀ a, f a < f (succ a)) ∧ ∀ o, IsLimit o → (bsup.{_, v} o fun x _ => f x) = f o :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem isNormal_iff_lt_succ_and_blsub_eq {f : Ordinal.{u} → Ordinal.{max u v}} : IsNormal f ↔ (∀ a, f a < f (succ a)) ∧ ∀ o, IsLimit o → (blsub.{_, v} o fun x _ => f x) = f o :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem IsNormal.eq_iff_zero_and_succ {f g : Ordinal.{u} → Ordinal.{u}} (hf : IsNormal f) (hg : IsNormal g) : f = g ↔ f 0 = g 0 ∧ ∀ a, f a = g a → f (succ a) = g (succ a) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lt_blsub₂ {o₁ o₂ : Ordinal} (op : {a : Ordinal} → (a < o₁) → {b : Ordinal} → (b < o₂) → Ordinal) {a b : Ordinal} (ha : a < o₁) (hb : b < o₂) : op ha hb < blsub₂ o₁ o₂ op :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem le_mex_of_forall {ι : Type u} {f : ι → Ordinal.{max u v}} {a : Ordinal} (H : ∀ b < a, ∃ i, f i = b) : a ≤ mex.{_, v} f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem ne_mex {ι : Type u} (f : ι → Ordinal.{max u v}) : ∀ i, f i ≠ mex.{_, v} f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mex_le_of_ne {ι} {f : ι → Ordinal} {a} (ha : ∀ i, f i ≠ a) : mex f ≤ a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem exists_of_lt_mex {ι} {f : ι → Ordinal} {a} (ha : a < mex f) : ∃ i, f i = a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mex_monotone {α β : Type u} {f : α → Ordinal.{max u v}} {g : β → Ordinal.{max u v}} (h : Set.range f ⊆ Set.range g) : mex.{_, v} f ≤ mex.{_, v} g :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem mex_lt_ord_succ_mk {ι : Type u} (f : ι → Ordinal.{u}) : mex.{_, u} f < (succ #ι).ord :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem bmex_not_mem_brange {o : Ordinal} (f : ∀ a < o, Ordinal) : bmex o f ∉ brange o f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem le_bmex_of_forall {o : Ordinal} (f : ∀ a < o, Ordinal) {a : Ordinal} (H : ∀ b < a, ∃ i hi, f i hi = b) : a ≤ bmex o f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem ne_bmex {o : Ordinal.{u}} (f : ∀ a < o, Ordinal.{max u v}) {i} (hi) : f i hi ≠ bmex.{_, v} o f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem exists_of_lt_bmex {o : Ordinal} {f : ∀ a < o, Ordinal} {a} (ha : a < bmex o f) : ∃ i hi, f i hi = a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem bmex_monotone {o o' : Ordinal.{u}} {f : ∀ a < o, Ordinal.{max u v}} {g : ∀ a < o', Ordinal.{max u v}} (h : brange o f ⊆ brange o' g) : bmex.{_, v} o f ≤ bmex.{_, v} o' g :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem bmex_lt_ord_succ_card {o : Ordinal.{u}} (f : ∀ a < o, Ordinal.{u}) : bmex.{_, u} o f < (succ o.card).ord :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem enumOrd_mem_aux (hS : Unbounded (· < ·) S) (o) : enumOrd S o ∈ S ∩ Set.Ici (blsub.{u, u} o fun c _ => enumOrd S c) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem enumOrd_def (o) : enumOrd S o = sInf (S ∩ { b | ∀ c, c < o → enumOrd S c < b }) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem enumOrd_range {f : Ordinal → Ordinal} (hf : StrictMono f) : enumOrd (range f) = f :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem enumOrd_univ : enumOrd Set.univ = id :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem enumOrd_zero : enumOrd S 0 = sInf S :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem enumOrd_succ_le {a b} (hS : Unbounded (· < ·) S) (ha : a ∈ S) (hb : enumOrd S b < a) : enumOrd S (succ b) ≤ a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem enumOrd_le_of_subset {S T : Set Ordinal} (hS : Unbounded (· < ·) S) (hST : S ⊆ T) (a) : enumOrd T a ≤ enumOrd S a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem enumOrd_surjective (hS : Unbounded (· < ·) S) : ∀ s ∈ S, ∃ a, enumOrd S a = s :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem range_enumOrd (hS : Unbounded (· < ·) S) : range (enumOrd S) = S :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem eq_enumOrd (f : Ordinal → Ordinal) (hS : Unbounded (· < ·) S) : StrictMono f ∧ range f = S ↔ f = enumOrd S :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem one_add_natCast (m : ℕ) : 1 + (m : Ordinal) = succ m :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem natCast_mul (m : ℕ) : ∀ n : ℕ, ((m * n : ℕ) : Ordinal) = m * n", "area": "SetTheory"} {"task": "t8", "statement": "theorem natCast_le {m n : ℕ} : (m : Ordinal) ≤ n ↔ m ≤ n :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem natCast_inj {m n : ℕ} : (m : Ordinal) = n ↔ m = n :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem natCast_sub (m n : ℕ) : ((m - n : ℕ) : Ordinal) = m - n :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem natCast_div (m n : ℕ) : ((m / n : ℕ) : Ordinal) = m / n :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem natCast_mod (m n : ℕ) : ((m % n : ℕ) : Ordinal) = m % n :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lift_natCast : ∀ n : ℕ, lift.{u, v} n = n", "area": "SetTheory"} {"task": "t8", "statement": "theorem ord_aleph0 : ord.{u} ℵ₀ = ω :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem add_one_of_aleph0_le {c} (h : ℵ₀ ≤ c) : c + 1 = c :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lt_add_of_limit {a b c : Ordinal.{u}} (h : IsLimit c) : a < b + c ↔ ∃ c' < c, a < b + c' :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem lt_omega {o : Ordinal} : o < ω ↔ ∃ n : ℕ, o = n :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem one_lt_omega : 1 < ω :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem omega_isLimit : IsLimit ω :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem omega_le {o : Ordinal} : ω ≤ o ↔ ∀ n : ℕ, ↑n ≤ o :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem isLimit_iff_omega_dvd {a : Ordinal} : IsLimit a ↔ a ≠ 0 ∧ ω ∣ a :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem add_mul_limit_aux {a b c : Ordinal} (ba : b + a = a) (l : IsLimit c) (IH : ∀ c' < c, (a + b) * succ c' = a * succ c' + b) : (a + b) * c = a * c :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem add_mul_succ {a b : Ordinal} (c) (ba : b + a = a) : (a + b) * succ c = a * succ c + b :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem add_le_of_forall_add_lt {a b c : Ordinal} (hb : 0 < b) (h : ∀ d < b, a + d < c) : a + b ≤ c :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem IsNormal.apply_omega {f : Ordinal.{u} → Ordinal.{u}} (hf : IsNormal f) : Ordinal.sup.{0, u} (f ∘ Nat.cast) = f ω :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem sup_mul_nat (o : Ordinal) : (sup fun n : ℕ => o * n) = o * ω :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem rank_eq (h : Acc r a) : h.rank = Ordinal.sup.{u, u} fun b : { b // r b a } => Order.succ (h.inv b.2).rank :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem rank_lt_of_rel (hb : Acc r b) (h : r a b) : (hb.inv h).rank < hb.rank :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem rank_eq : hwf.rank a = Ordinal.sup.{u, u} fun b : { b // r b a } => Order.succ <| hwf.rank b :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem CNFRec_zero {C : Ordinal → Sort*} (b : Ordinal) (H0 : C 0) (H : ∀ o, o ≠ 0 → C (o % b ^ log b o) → C o) : @CNFRec b C H0 H 0 = H0 :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem CNFRec_pos (b : Ordinal) {o : Ordinal} {C : Ordinal → Sort*} (ho : o ≠ 0) (H0 : C 0) (H : ∀ o, o ≠ 0 → C (o % b ^ log b o) → C o) : @CNFRec b C H0 H o = H o ho (@CNFRec b C H0 H _) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem zero_CNF {o : Ordinal} (ho : o ≠ 0) : CNF 0 o = [⟨0, o⟩] :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem one_CNF {o : Ordinal} (ho : o ≠ 0) : CNF 1 o = [⟨0, o⟩] :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem CNF_of_le_one {b o : Ordinal} (hb : b ≤ 1) (ho : o ≠ 0) : CNF b o = [⟨0, o⟩] :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem CNF_of_lt {b o : Ordinal} (ho : o ≠ 0) (hb : o < b) : CNF b o = [⟨0, o⟩] :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem CNF_foldr (b o : Ordinal) : (CNF b o).foldr (fun p r ↦ b ^ p.1 * p.2 + r) 0 = o :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem CNF_fst_le_log {b o : Ordinal.{u}} {x : Ordinal × Ordinal} : x ∈ CNF b o → x.1 ≤ log b o :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem CNF_lt_snd {b o : Ordinal.{u}} {x : Ordinal × Ordinal} : x ∈ CNF b o → 0 < x.2 :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem CNF_snd_lt {b o : Ordinal.{u}} (hb : 1 < b) {x : Ordinal × Ordinal} : x ∈ CNF b o → x.2 < b :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem CNF_sorted (b o : Ordinal) : ((CNF b o).map Prod.fst).Sorted (· > ·) :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem subsingleton_short_example : ∀ x : PGame, Subsingleton (Short x)", "area": "SetTheory"} {"task": "t8", "statement": "theorem short_birthday (x : PGame.{u}) : [Short x] → x.birthday < Ordinal.omega :=", "area": "SetTheory"} {"task": "t8", "statement": "theorem TotalSpace.mk_cast {x x' : B} (h : x = x') (b : E x) : .mk' F x' (cast (congr_arg E h) b) = TotalSpace.mk x b :=", "area": "Data"} {"task": "t8", "statement": "theorem TotalSpace.mk_inj {b : B} {y y' : E b} : mk' F b y = mk' F b y' ↔ y = y' :=", "area": "Data"} {"task": "t8", "statement": "theorem TotalSpace.range_mk (b : B) : range ((↑) : E b → TotalSpace F E) = π F E ⁻¹' {b} :=", "area": "Data"} {"task": "t8", "statement": "theorem mk' {arr : Array α} {f : α → β} {n} {g : Fin n → β} (e : n = arr.size) (H : ∀ i h₁ h₂, f (arr.get ⟨i, h₁⟩) = g ⟨i, h₂⟩) : Agrees arr f g :=", "area": "Data"} {"task": "t8", "statement": "theorem size_eq {arr : Array α} {m : Fin n → β} (H : Agrees arr f m) : n = arr.size :=", "area": "Data"} {"task": "t8", "statement": "theorem get_eq {arr : Array α} {n} {m : Fin n → β} (H : Agrees arr f m) : ∀ i h₁ h₂, f (arr.get ⟨i, h₁⟩) = m ⟨i, h₂⟩ :=", "area": "Data"} {"task": "t8", "statement": "theorem push {arr : Array α} {n} {m : Fin n → β} (H : Agrees arr f m) (k) (hk : k = n + 1) (x) (m' : Fin k → β) (hm₁ : ∀ (i : Fin k) (h : i < n), m' i = m ⟨i, h⟩) (hm₂ : ∀ (h : n < k), f x = m' ⟨n, h⟩) : Agrees (arr.push x) f m' :=", "area": "Data"} {"task": "t8", "statement": "theorem set {arr : Array α} {n} {m : Fin n → β} (H : Agrees arr f m) {i : Fin arr.size} {x} {m' : Fin n → β} (hm₁ : ∀ (j : Fin n), j.1 ≠ i → m' j = m j) (hm₂ : ∀ (h : i < n), f x = m' ⟨i, h⟩) : Agrees (arr.set i x) f m' :=", "area": "Data"} {"task": "t8", "statement": "theorem rank_eq {arr : Array (UFNode α)} {n} {m : UFModel n} (H : m.Models arr) (i : Nat) (h : i < arr.size) : arr[i].rank = m.rank i :=", "area": "Data"} {"task": "t8", "statement": "theorem push {arr : Array (UFNode α)} {n} {m : UFModel n} (H : m.Models arr) (k) (hk : k = n + 1) (x) : (m.push k (hk ▸ Nat.le_add_right ..)).Models (arr.push ⟨n, x, 0⟩) :=", "area": "Data"} {"task": "t8", "statement": "theorem setParent {arr : Array (UFNode α)} {n} {m : UFModel n} (hm : m.Models arr) (i j H hi x) (hp : x.parent = j.1) (hrk : x.rank = arr[i].rank) : (m.setParent i j H).Models (arr.set ⟨i.1, hi⟩ x) :=", "area": "Data"} {"task": "t8", "statement": "theorem model' (self : UnionFind α) : ∃ (m : UFModel self.arr.size), m.Models self.arr :=", "area": "Data"} {"task": "t8", "statement": "theorem lt_rankMax (self : UnionFind α) (i : Nat) : self.rank i < self.rankMax :=", "area": "Data"} {"task": "t8", "statement": "theorem rank_eq (self : UnionFind α) {n} {m : UFModel n} (H : m.Models self.arr) {i} (h : i < self.size) : self.rank i = m.rank i :=", "area": "Data"} {"task": "t8", "statement": "theorem rank_lt (self : UnionFind α) {i : Nat} (h) : self.arr[i].parent ≠ i → self.rank i < self.rank self.arr[i].parent :=", "area": "Data"} {"task": "t8", "statement": "theorem parent_lt (self : UnionFind α) (i : Nat) (h) : self.arr[i].parent < self.size :=", "area": "Data"} {"task": "t8", "statement": "theorem lex_fibration [∀ (i) (s : Set ι), Decidable (i ∈ s)] : Fibration (InvImage (GameAdd (DFinsupp.Lex r s) (DFinsupp.Lex r s)) snd) (DFinsupp.Lex r s) fun x => piecewise x.2.1 x.2.2 x.1 :=", "area": "Data"} {"task": "t8", "statement": "theorem Lex.acc_of_single_erase [DecidableEq ι] {x : Π₀ i, α i} (i : ι) (hs : Acc (DFinsupp.Lex r s) <| single i (x i)) (hu : Acc (DFinsupp.Lex r s) <| x.erase i) : Acc (DFinsupp.Lex r s) x :=", "area": "Data"} {"task": "t8", "statement": "theorem Lex.acc_of_single [DecidableEq ι] [∀ (i) (x : α i), Decidable (x ≠ 0)] (x : Π₀ i, α i) : (∀ i ∈ x.support, Acc (DFinsupp.Lex r s) <| single i (x i)) → Acc (DFinsupp.Lex r s) x :=", "area": "Data"} {"task": "t8", "statement": "theorem Lex.acc_single [DecidableEq ι] {i : ι} (hi : Acc (rᶜ ⊓ (· ≠ ·)) i) : ∀ a, Acc (DFinsupp.Lex r s) (single i a) :=", "area": "Data"} {"task": "t8", "statement": "theorem Lex.wellFounded (hr : WellFounded <| rᶜ ⊓ (· ≠ ·)) : WellFounded (DFinsupp.Lex r s) :=", "area": "Data"} {"task": "t8", "statement": "theorem Pi.Lex.wellFounded [IsStrictTotalOrder ι r] [Finite ι] (hs : ∀ i, WellFounded (s i)) : WellFounded (Pi.Lex r (fun {i} ↦ s i)) :=", "area": "Data"} {"task": "t8", "statement": "theorem DFinsupp.wellFoundedLT [∀ i, Zero (α i)] [∀ i, Preorder (α i)] [∀ i, WellFoundedLT (α i)] (hbot : ∀ ⦃i⦄ ⦃a : α i⦄, ¬a < 0) : WellFoundedLT (Π₀ i, α i) :=", "area": "Data"} {"task": "t8", "statement": "theorem cons_val_succ (x : α) (u : Fin m → α) (i : Fin m) : vecCons x u i.succ = u i :=", "area": "Data"} {"task": "t8", "statement": "theorem cons_val_succ' {i : ℕ} (h : i.succ < m.succ) (x : α) (u : Fin m → α) : vecCons x u ⟨i.succ, h⟩ = u ⟨i, Nat.lt_of_succ_lt_succ h⟩ :=", "area": "Data"} {"task": "t8", "statement": "theorem tail_cons (x : α) (u : Fin m → α) : vecTail (vecCons x u) = u :=", "area": "Data"} {"task": "t8", "statement": "theorem range_cons (x : α) (u : Fin n → α) : Set.range (vecCons x u) = {x} ∪ Set.range u :=", "area": "Data"} {"task": "t8", "statement": "theorem range_cons_empty (x : α) (u : Fin 0 → α) : Set.range (Matrix.vecCons x u) = {x} :=", "area": "Data"} {"task": "t8", "statement": "theorem range_cons_cons_empty (x y : α) (u : Fin 0 → α) : Set.range (vecCons x <| vecCons y u) = {x, y} :=", "area": "Data"} {"task": "t8", "statement": "theorem cons_val_fin_one (x : α) (u : Fin 0 → α) : ∀ (i : Fin 1), vecCons x u i = x :=", "area": "Data"} {"task": "t8", "statement": "theorem vecAppend_eq_ite {α : Type*} {o : ℕ} (ho : o = m + n) (u : Fin m → α) (v : Fin n → α) : vecAppend ho u v = fun i : Fin o => if h : (i : ℕ) < m then u ⟨i, h⟩ else v ⟨(i : ℕ) - m, by omega⟩ :=", "area": "Data"} {"task": "t8", "statement": "theorem empty_vecAppend (v : Fin n → α) : vecAppend n.zero_add.symm ![] v = v :=", "area": "Data"} {"task": "t8", "statement": "theorem cons_vecAppend (ho : o + 1 = m + 1 + n) (x : α) (u : Fin m → α) (v : Fin n → α) : vecAppend ho (vecCons x u) v = vecCons x (vecAppend (by omega) u v) :=", "area": "Data"} {"task": "t8", "statement": "theorem vecAlt0_vecAppend (v : Fin n → α) : vecAlt0 rfl (vecAppend rfl v v) = v ∘ bit0 :=", "area": "Data"} {"task": "t8", "statement": "theorem vecAlt1_vecAppend (v : Fin (n + 1) → α) : vecAlt1 rfl (vecAppend rfl v v) = v ∘ bit1 :=", "area": "Data"} {"task": "t8", "statement": "theorem vecHead_vecAlt1 (hm : m + 2 = n + 1 + (n + 1)) (v : Fin (m + 2) → α) : vecHead (vecAlt1 hm v) = v 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem cons_vec_bit0_eq_alt0 (x : α) (u : Fin n → α) (i : Fin (n + 1)) : vecCons x u (bit0 i) = vecAlt0 rfl (vecAppend rfl (vecCons x u) (vecCons x u)) i :=", "area": "Data"} {"task": "t8", "statement": "theorem cons_vec_bit1_eq_alt1 (x : α) (u : Fin n → α) (i : Fin (n + 1)) : vecCons x u (bit1 i) = vecAlt1 rfl (vecAppend rfl (vecCons x u) (vecCons x u)) i :=", "area": "Data"} {"task": "t8", "statement": "theorem cons_vecAlt0 (h : m + 1 + 1 = n + 1 + (n + 1)) (x y : α) (u : Fin m → α) : vecAlt0 h (vecCons x (vecCons y u)) = vecCons x (vecAlt0 (by omega) u) :=", "area": "Data"} {"task": "t8", "statement": "theorem empty_vecAlt0 (α) {h} : vecAlt0 h (![] : Fin 0 → α) = ![] :=", "area": "Data"} {"task": "t8", "statement": "theorem cons_vecAlt1 (h : m + 1 + 1 = n + 1 + (n + 1)) (x y : α) (u : Fin m → α) : vecAlt1 h (vecCons x (vecCons y u)) = vecCons y (vecAlt1 (by omega) u) :=", "area": "Data"} {"task": "t8", "statement": "theorem empty_vecAlt1 (α) {h} : vecAlt1 h (![] : Fin 0 → α) = ![] :=", "area": "Data"} {"task": "t8", "statement": "theorem smul_cons (x : M) (y : α) (v : Fin n → α) : x • vecCons y v = vecCons (x • y) (x • v) :=", "area": "Data"} {"task": "t8", "statement": "theorem cons_add (x : α) (v : Fin n → α) (w : Fin n.succ → α) : vecCons x v + w = vecCons (x + vecHead w) (v + vecTail w) :=", "area": "Data"} {"task": "t8", "statement": "theorem add_cons (v : Fin n.succ → α) (y : α) (w : Fin n → α) : v + vecCons y w = vecCons (vecHead v + y) (vecTail v + w) :=", "area": "Data"} {"task": "t8", "statement": "theorem cons_add_cons (x : α) (v : Fin n → α) (y : α) (w : Fin n → α) : vecCons x v + vecCons y w = vecCons (x + y) (v + w) :=", "area": "Data"} {"task": "t8", "statement": "theorem cons_sub (x : α) (v : Fin n → α) (w : Fin n.succ → α) : vecCons x v - w = vecCons (x - vecHead w) (v - vecTail w) :=", "area": "Data"} {"task": "t8", "statement": "theorem sub_cons (v : Fin n.succ → α) (y : α) (w : Fin n → α) : v - vecCons y w = vecCons (vecHead v - y) (vecTail v - w) :=", "area": "Data"} {"task": "t8", "statement": "theorem cons_sub_cons (x : α) (v : Fin n → α) (y : α) (w : Fin n → α) : vecCons x v - vecCons y w = vecCons (x - y) (v - w) :=", "area": "Data"} {"task": "t8", "statement": "theorem cons_zero_zero : vecCons (0 : α) (0 : Fin n → α) = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem cons_eq_zero_iff {v : Fin n → α} {x : α} : vecCons x v = 0 ↔ x = 0 ∧ v = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem neg_cons (x : α) (v : Fin n → α) : -vecCons x v = vecCons (-x) (-v) :=", "area": "Data"} {"task": "t8", "statement": "theorem toMultiset_single (a : α) (n : ℕ) : toMultiset (single a n) = n • {a} :=", "area": "Data"} {"task": "t8", "statement": "theorem toMultiset_sum_single (s : Finset ι) (n : ℕ) : Finsupp.toMultiset (∑ i ∈ s, single i n) = n • s.val :=", "area": "Data"} {"task": "t8", "statement": "theorem card_toMultiset (f : α →₀ ℕ) : Multiset.card (toMultiset f) = f.sum fun _ => id :=", "area": "Data"} {"task": "t8", "statement": "theorem toMultiset_map (f : α →₀ ℕ) (g : α → β) : f.toMultiset.map g = toMultiset (f.mapDomain g) :=", "area": "Data"} {"task": "t8", "statement": "theorem prod_toMultiset [CommMonoid α] (f : α →₀ ℕ) : f.toMultiset.prod = f.prod fun a n => a ^ n :=", "area": "Data"} {"task": "t8", "statement": "theorem toFinset_toMultiset [DecidableEq α] (f : α →₀ ℕ) : f.toMultiset.toFinset = f.support :=", "area": "Data"} {"task": "t8", "statement": "theorem count_toMultiset [DecidableEq α] (f : α →₀ ℕ) (a : α) : (toMultiset f).count a = f a :=", "area": "Data"} {"task": "t8", "statement": "theorem toMultiset_sup [DecidableEq α] (f g : α →₀ ℕ) : toMultiset (f ⊔ g) = toMultiset f ∪ toMultiset g :=", "area": "Data"} {"task": "t8", "statement": "theorem toMultiset_inf [DecidableEq α] (f g : α →₀ ℕ) : toMultiset (f ⊓ g) = toMultiset f ∩ toMultiset g :=", "area": "Data"} {"task": "t8", "statement": "theorem mem_toMultiset (f : α →₀ ℕ) (i : α) : i ∈ toMultiset f ↔ i ∈ f.support :=", "area": "Data"} {"task": "t8", "statement": "theorem toFinsupp_singleton (a : α) : toFinsupp ({a} : Multiset α) = Finsupp.single a 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem toFinsupp_union (s t : Multiset α) : toFinsupp (s ∪ t) = toFinsupp s ⊔ toFinsupp t :=", "area": "Data"} {"task": "t8", "statement": "theorem toFinsupp_inter (s t : Multiset α) : toFinsupp (s ∩ t) = toFinsupp s ⊓ toFinsupp t :=", "area": "Data"} {"task": "t8", "statement": "theorem toFinsupp_sum_eq (s : Multiset α) : s.toFinsupp.sum (fun _ ↦ id) = Multiset.card s :=", "area": "Data"} {"task": "t8", "statement": "theorem toMultiset_strictMono : StrictMono (@toMultiset ι) :=", "area": "Data"} {"task": "t8", "statement": "theorem sum_id_lt_of_lt (m n : ι →₀ ℕ) (h : m < n) : (m.sum fun _ => id) < n.sum fun _ => id :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma coe_equivNatSumOfFintype_symm_apply [Fintype α] (P : {P : α → ℕ // ∑ i, P i = n}) : ((equivNatSumOfFintype α n).symm P : Multiset α) = ∑ a, ((P : α → ℕ) a) • {a} :=", "area": "Data"} {"task": "t8", "statement": "theorem coe_eq_zero {f : α →₀ M} : (f : α → M) = 0 ↔ f = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem ext_iff' {f g : α →₀ M} : f = g ↔ f.support = g.support ∧ ∀ x ∈ f.support, f x = g x :=", "area": "Data"} {"task": "t8", "statement": "theorem support_nonempty_iff {f : α →₀ M} : f.support.Nonempty ↔ f ≠ 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem card_support_eq_zero {f : α →₀ M} : card f.support = 0 ↔ f = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem support_subset_iff {s : Set α} {f : α →₀ M} : ↑f.support ⊆ s ↔ ∀ a ∉ s, f a = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem unique_ext [Unique α] {f g : α →₀ M} (h : f default = g default) : f = g :=", "area": "Data"} {"task": "t8", "statement": "theorem single_apply [Decidable (a = a')] : single a b a' = if a = a' then b else 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem single_apply_left {f : α → β} (hf : Function.Injective f) (x z : α) (y : M) : single (f x) y (f z) = single x y z :=", "area": "Data"} {"task": "t8", "statement": "theorem single_eq_set_indicator : ⇑(single a b) = Set.indicator {a} fun _ => b :=", "area": "Data"} {"task": "t8", "statement": "theorem single_eq_same : (single a b : α →₀ M) a = b :=", "area": "Data"} {"task": "t8", "statement": "theorem single_eq_of_ne (h : a ≠ a') : (single a b : α →₀ M) a' = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem single_eq_update [DecidableEq α] (a : α) (b : M) : ⇑(single a b) = Function.update (0 : _) a b :=", "area": "Data"} {"task": "t8", "statement": "theorem single_zero (a : α) : (single a 0 : α →₀ M) = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem single_of_single_apply (a a' : α) (b : M) : single a ((single a' b) a) = single a' (single a' b) a :=", "area": "Data"} {"task": "t8", "statement": "theorem support_single_subset : (single a b).support ⊆ {a} :=", "area": "Data"} {"task": "t8", "statement": "theorem single_apply_mem (x) : single a b x ∈ ({0, b} : Set M) :=", "area": "Data"} {"task": "t8", "statement": "theorem single_injective (a : α) : Function.Injective (single a : M → α →₀ M) :=", "area": "Data"} {"task": "t8", "statement": "theorem single_apply_eq_zero {a x : α} {b : M} : single a b x = 0 ↔ x = a → b = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem single_apply_ne_zero {a x : α} {b : M} : single a b x ≠ 0 ↔ x = a ∧ b ≠ 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem mem_support_single (a a' : α) (b : M) : a ∈ (single a' b).support ↔ a = a' ∧ b ≠ 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem eq_single_iff {f : α →₀ M} {a b} : f = single a b ↔ f.support ⊆ {a} ∧ f a = b :=", "area": "Data"} {"task": "t8", "statement": "theorem single_eq_single_iff (a₁ a₂ : α) (b₁ b₂ : M) : single a₁ b₁ = single a₂ b₂ ↔ a₁ = a₂ ∧ b₁ = b₂ ∨ b₁ = 0 ∧ b₂ = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem support_single_ne_bot (i : α) (h : b ≠ 0) : (single i b).support ≠ ⊥ :=", "area": "Data"} {"task": "t8", "statement": "theorem support_single_disjoint {b' : M} (hb : b ≠ 0) (hb' : b' ≠ 0) {i j : α} : Disjoint (single i b).support (single j b').support ↔ i ≠ j :=", "area": "Data"} {"task": "t8", "statement": "theorem single_eq_zero : single a b = 0 ↔ b = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem single_swap (a₁ a₂ : α) (b : M) : single a₁ b a₂ = single a₂ b a₁ :=", "area": "Data"} {"task": "t8", "statement": "theorem unique_single_eq_iff [Unique α] {b' : M} : single a b = single a' b' ↔ b = b' :=", "area": "Data"} {"task": "t8", "statement": "lemma apply_single [AddCommMonoid N] [AddCommMonoid P] {F : Type*} [FunLike F N P] [AddMonoidHomClass F N P] (e : F) (a : α) (n : N) (b : α) : e ((single a n) b) = single a (e n) b :=", "area": "Data"} {"task": "t8", "statement": "theorem card_support_eq_one {f : α →₀ M} : card f.support = 1 ↔ ∃ a, f a ≠ 0 ∧ f = single a (f a) :=", "area": "Data"} {"task": "t8", "statement": "theorem card_support_eq_one' {f : α →₀ M} : card f.support = 1 ↔ ∃ a, ∃ b ≠ 0, f = single a b :=", "area": "Data"} {"task": "t8", "statement": "theorem support_subset_singleton' {f : α →₀ M} {a : α} : f.support ⊆ {a} ↔ ∃ b, f = single a b :=", "area": "Data"} {"task": "t8", "statement": "theorem card_support_le_one [Nonempty α] {f : α →₀ M} : card f.support ≤ 1 ↔ ∃ a, f = single a (f a) :=", "area": "Data"} {"task": "t8", "statement": "theorem card_support_le_one' [Nonempty α] {f : α →₀ M} : card f.support ≤ 1 ↔ ∃ a b, f = single a b :=", "area": "Data"} {"task": "t8", "statement": "theorem equivFunOnFinite_single [DecidableEq α] [Finite α] (x : α) (m : M) : Finsupp.equivFunOnFinite (Finsupp.single x m) = Pi.single x m :=", "area": "Data"} {"task": "t8", "statement": "theorem equivFunOnFinite_symm_single [DecidableEq α] [Finite α] (x : α) (m : M) : Finsupp.equivFunOnFinite.symm (Pi.single x m) = Finsupp.single x m :=", "area": "Data"} {"task": "t8", "statement": "theorem coe_update [DecidableEq α] : (f.update a b : α → M) = Function.update f a b :=", "area": "Data"} {"task": "t8", "statement": "theorem update_self : f.update a (f a) = f :=", "area": "Data"} {"task": "t8", "statement": "theorem zero_update : update 0 a b = single a b :=", "area": "Data"} {"task": "t8", "statement": "theorem support_update [DecidableEq α] [DecidableEq M] : support (f.update a b) = if b = 0 then f.support.erase a else insert a f.support :=", "area": "Data"} {"task": "t8", "statement": "theorem support_update_zero [DecidableEq α] : support (f.update a 0) = f.support.erase a :=", "area": "Data"} {"task": "t8", "statement": "theorem support_update_ne_zero [DecidableEq α] (h : b ≠ 0) : support (f.update a b) = insert a f.support :=", "area": "Data"} {"task": "t8", "statement": "theorem support_update_subset [DecidableEq α] [DecidableEq M] : support (f.update a b) ⊆ insert a f.support :=", "area": "Data"} {"task": "t8", "statement": "theorem support_erase [DecidableEq α] {a : α} {f : α →₀ M} : (f.erase a).support = f.support.erase a :=", "area": "Data"} {"task": "t8", "statement": "theorem erase_same {a : α} {f : α →₀ M} : (f.erase a) a = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem erase_ne {a a' : α} {f : α →₀ M} (h : a' ≠ a) : (f.erase a) a' = f a' :=", "area": "Data"} {"task": "t8", "statement": "theorem erase_apply [DecidableEq α] {a a' : α} {f : α →₀ M} : f.erase a a' = if a' = a then 0 else f a' :=", "area": "Data"} {"task": "t8", "statement": "theorem erase_single {a : α} {b : M} : erase a (single a b) = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem erase_single_ne {a a' : α} {b : M} (h : a ≠ a') : erase a (single a' b) = single a' b :=", "area": "Data"} {"task": "t8", "statement": "theorem erase_of_not_mem_support {f : α →₀ M} {a} (haf : a ∉ f.support) : erase a f = f :=", "area": "Data"} {"task": "t8", "statement": "theorem erase_zero (a : α) : erase a (0 : α →₀ M) = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem erase_update_of_ne (f : α →₀ M) {a a' : α} (ha : a ≠ a') (b : M) : erase a (update f a' b) = update (erase a f) a' b :=", "area": "Data"} {"task": "t8", "statement": "theorem erase_idem (f : α →₀ M) (a : α) : erase a (erase a f) = erase a f :=", "area": "Data"} {"task": "t8", "statement": "theorem update_erase_eq_update (f : α →₀ M) (a : α) (b : M) : update (erase a f) a b = update f a b :=", "area": "Data"} {"task": "t8", "statement": "theorem erase_update_eq_erase (f : α →₀ M) (a : α) (b : M) : erase a (update f a b) = erase a f :=", "area": "Data"} {"task": "t8", "statement": "theorem support_onFinset_subset {s : Finset α} {f : α → M} {hf} : (onFinset s f hf).support ⊆ s :=", "area": "Data"} {"task": "t8", "statement": "theorem mem_support_onFinset {s : Finset α} {f : α → M} (hf : ∀ a : α, f a ≠ 0 → a ∈ s) {a : α} : a ∈ (Finsupp.onFinset s f hf).support ↔ f a ≠ 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem support_onFinset [DecidableEq M] {s : Finset α} {f : α → M} (hf : ∀ a : α, f a ≠ 0 → a ∈ s) : (Finsupp.onFinset s f hf).support = s.filter fun a => f a ≠ 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem mapRange_zero {f : M → N} {hf : f 0 = 0} : mapRange f hf (0 : α →₀ M) = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem mapRange_single {f : M → N} {hf : f 0 = 0} {a : α} {b : M} : mapRange f hf (single a b) = single a (f b) :=", "area": "Data"} {"task": "t8", "statement": "theorem support_mapRange_of_injective {e : M → N} (he0 : e 0 = 0) (f : ι →₀ M) (he : Function.Injective e) : (Finsupp.mapRange e he0 f).support = f.support :=", "area": "Data"} {"task": "t8", "statement": "theorem embDomain_apply (f : α ↪ β) (v : α →₀ M) (a : α) : embDomain f v (f a) = v a :=", "area": "Data"} {"task": "t8", "statement": "theorem embDomain_notin_range (f : α ↪ β) (v : α →₀ M) (a : β) (h : a ∉ Set.range f) : embDomain f v a = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem embDomain_injective (f : α ↪ β) : Function.Injective (embDomain f : (α →₀ M) → β →₀ M) :=", "area": "Data"} {"task": "t8", "statement": "theorem embDomain_mapRange (f : α ↪ β) (g : M → N) (p : α →₀ M) (hg : g 0 = 0) : embDomain f (mapRange g hg p) = mapRange g hg (embDomain f p) :=", "area": "Data"} {"task": "t8", "statement": "theorem single_of_embDomain_single (l : α →₀ M) (f : α ↪ β) (a : β) (b : M) (hb : b ≠ 0) (h : l.embDomain f = single a b) : ∃ x, l = single x b ∧ f x = a :=", "area": "Data"} {"task": "t8", "statement": "theorem embDomain_single (f : α ↪ β) (a : α) (m : M) : embDomain f (single a m) = single (f a) m :=", "area": "Data"} {"task": "t8", "statement": "theorem support_zipWith [D : DecidableEq α] {f : M → N → P} {hf : f 0 0 = 0} {g₁ : α →₀ M} {g₂ : α →₀ N} : (zipWith f hf g₁ g₂).support ⊆ g₁.support ∪ g₂.support :=", "area": "Data"} {"task": "t8", "statement": "theorem zipWith_single_single (f : M → N → P) (hf : f 0 0 = 0) (a : α) (m : M) (n : N) : zipWith f hf (single a m) (single a n) = single a (f m n) :=", "area": "Data"} {"task": "t8", "statement": "theorem support_add_eq [DecidableEq α] {g₁ g₂ : α →₀ M} (h : Disjoint g₁.support g₂.support) : (g₁ + g₂).support = g₁.support ∪ g₂.support :=", "area": "Data"} {"task": "t8", "statement": "lemma _root_.AddEquiv.finsuppUnique_symm {M : Type*} [AddZeroClass M] (d : M) : AddEquiv.finsuppUnique.symm d = single () d :=", "area": "Data"} {"task": "t8", "statement": "theorem update_eq_single_add_erase (f : α →₀ M) (a : α) (b : M) : f.update a b = single a b + f.erase a :=", "area": "Data"} {"task": "t8", "statement": "theorem update_eq_erase_add_single (f : α →₀ M) (a : α) (b : M) : f.update a b = f.erase a + single a b :=", "area": "Data"} {"task": "t8", "statement": "theorem single_add_erase (a : α) (f : α →₀ M) : single a (f a) + f.erase a = f :=", "area": "Data"} {"task": "t8", "statement": "theorem erase_add_single (a : α) (f : α →₀ M) : f.erase a + single a (f a) = f :=", "area": "Data"} {"task": "t8", "statement": "theorem erase_add (a : α) (f f' : α →₀ M) : erase a (f + f') = erase a f + erase a f' :=", "area": "Data"} {"task": "t8", "statement": "theorem induction {p : (α →₀ M) → Prop} (f : α →₀ M) (h0 : p 0) (ha : ∀ (a b) (f : α →₀ M), a ∉ f.support → b ≠ 0 → p f → p (single a b + f)) : p f :=", "area": "Data"} {"task": "t8", "statement": "theorem induction₂ {p : (α →₀ M) → Prop} (f : α →₀ M) (h0 : p 0) (ha : ∀ (a b) (f : α →₀ M), a ∉ f.support → b ≠ 0 → p f → p (f + single a b)) : p f :=", "area": "Data"} {"task": "t8", "statement": "theorem addHom_ext [AddZeroClass N] ⦃f g : (α →₀ M) →+ N⦄ (H : ∀ x y, f (single x y) = g (single x y)) : f = g :=", "area": "Data"} {"task": "t8", "statement": "theorem mulHom_ext [MulOneClass N] ⦃f g : Multiplicative (α →₀ M) →* N⦄ (H : ∀ x y, f (Multiplicative.ofAdd <| single x y) = g (Multiplicative.ofAdd <| single x y)) : f = g :=", "area": "Data"} {"task": "t8", "statement": "theorem mapRange_add [AddZeroClass N] {f : M → N} {hf : f 0 = 0} (hf' : ∀ x y, f (x + y) = f x + f y) (v₁ v₂ : α →₀ M) : mapRange f hf (v₁ + v₂) = mapRange f hf v₁ + mapRange f hf v₂ :=", "area": "Data"} {"task": "t8", "statement": "theorem mapRange_neg [NegZeroClass G] [NegZeroClass H] {f : G → H} {hf : f 0 = 0} (hf' : ∀ x, f (-x) = -f x) (v : α →₀ G) : mapRange f hf (-v) = -mapRange f hf v :=", "area": "Data"} {"task": "t8", "statement": "theorem mapRange_sub [SubNegZeroMonoid G] [SubNegZeroMonoid H] {f : G → H} {hf : f 0 = 0} (hf' : ∀ x y, f (x - y) = f x - f y) (v₁ v₂ : α →₀ G) : mapRange f hf (v₁ - v₂) = mapRange f hf v₁ - mapRange f hf v₂ :=", "area": "Data"} {"task": "t8", "statement": "theorem single_add_single_eq_single_add_single [AddCommMonoid M] {k l m n : α} {u v : M} (hu : u ≠ 0) (hv : v ≠ 0) : single k u + single l v = single m u + single n v ↔ (k = m ∧ l = n) ∨ (u = v ∧ k = n ∧ l = m) ∨ (u + v = 0 ∧ k = l ∧ m = n) :=", "area": "Data"} {"task": "t8", "statement": "theorem support_sub [DecidableEq α] [AddGroup G] {f g : α →₀ G} : support (f - g) ⊆ support f ∪ support g :=", "area": "Data"} {"task": "t8", "statement": "theorem erase_eq_sub_single [AddGroup G] (f : α →₀ G) (a : α) : f.erase a = f - single a (f a) :=", "area": "Data"} {"task": "t8", "statement": "theorem update_eq_sub_add_single [AddGroup G] (f : α →₀ G) (a : α) (b : G) : f.update a b = f - single a (f a) + single a b :=", "area": "Data"} {"task": "t8", "statement": "theorem eq_one_iff_odd {n : ℕ} : (n : ZMod 2) = 1 ↔ Odd n :=", "area": "Data"} {"task": "t8", "statement": "theorem ne_zero_iff_odd {n : ℕ} : (n : ZMod 2) ≠ 0 ↔ Odd n :=", "area": "Data"} {"task": "t8", "statement": "lemma antidiagonal_eq_map' (n : ℕ) : antidiagonal n = (range (n + 1)).map ⟨fun i ↦ (n - i, i), fun _ _ h ↦ (Prod.ext_iff.1 h).2⟩ :=", "area": "Data"} {"task": "t8", "statement": "lemma antidiagonal_eq_image (n : ℕ) : antidiagonal n = (range (n + 1)).image fun i ↦ (i, n - i) :=", "area": "Data"} {"task": "t8", "statement": "lemma antidiagonal_eq_image' (n : ℕ) : antidiagonal n = (range (n + 1)).image fun i ↦ (n - i, i) :=", "area": "Data"} {"task": "t8", "statement": "theorem card_antidiagonal (n : ℕ) : (antidiagonal n).card = n + 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem antidiagonal_succ (n : ℕ) : antidiagonal (n + 1) = cons (0, n + 1) ((antidiagonal n).map (Embedding.prodMap ⟨Nat.succ, Nat.succ_injective⟩ (Embedding.refl _))) (by simp) :=", "area": "Data"} {"task": "t8", "statement": "theorem antidiagonal_succ' (n : ℕ) : antidiagonal (n + 1) = cons (n + 1, 0) ((antidiagonal n).map (Embedding.prodMap (Embedding.refl _) ⟨Nat.succ, Nat.succ_injective⟩)) (by simp) :=", "area": "Data"} {"task": "t8", "statement": "theorem antidiagonal_succ_succ' {n : ℕ} : antidiagonal (n + 2) = cons (0, n + 2) (cons (n + 2, 0) ((antidiagonal n).map (Embedding.prodMap ⟨Nat.succ, Nat.succ_injective⟩ ⟨Nat.succ, Nat.succ_injective⟩)) <| by simp) (by simp) :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma antidiagonal_filter_snd_le_of_le {n k : ℕ} (h : k ≤ n) : (antidiagonal n).filter (fun a ↦ a.snd ≤ k) = (antidiagonal k).map (Embedding.prodMap ⟨_, add_left_injective (n - k)⟩ (Embedding.refl ℕ)) :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma antidiagonal_filter_fst_le_of_le {n k : ℕ} (h : k ≤ n) : (antidiagonal n).filter (fun a ↦ a.fst ≤ k) = (antidiagonal k).map (Embedding.prodMap (Embedding.refl ℕ) ⟨_, add_left_injective (n - k)⟩) :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma antidiagonal_filter_le_fst_of_le {n k : ℕ} (h : k ≤ n) : (antidiagonal n).filter (fun a ↦ k ≤ a.fst) = (antidiagonal (n - k)).map (Embedding.prodMap ⟨_, add_left_injective k⟩ (Embedding.refl ℕ)) :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma antidiagonal_filter_le_snd_of_le {n k : ℕ} (h : k ≤ n) : (antidiagonal n).filter (fun a ↦ k ≤ a.snd) = (antidiagonal (n - k)).map (Embedding.prodMap (Embedding.refl ℕ) ⟨_, add_left_injective k⟩) :=", "area": "Data"} {"task": "t8", "statement": "theorem updateFinset_singleton {i y} : updateFinset x {i} y = Function.update x i (y ⟨i, mem_singleton_self i⟩) :=", "area": "Data"} {"task": "t8", "statement": "theorem update_eq_updateFinset {i y} : Function.update x i y = updateFinset x {i} (uniqueElim y) :=", "area": "Data"} {"task": "t8", "statement": "theorem updateFinset_updateFinset {s t : Finset ι} (hst : Disjoint s t) {y : ∀ i : ↥s, π i} {z : ∀ i : ↥t, π i} : updateFinset (updateFinset x s y) t z = updateFinset x (s ∪ t) (Equiv.piFinsetUnion π hst ⟨y, z⟩) :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma sized_empty : (∅ : Set (Finset α)).Sized r :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma sized_singleton : ({s} : Set (Finset α)).Sized r ↔ s.card = r :=", "area": "Data"} {"task": "t8", "statement": "theorem sized_iUnion {f : ι → Set (Finset α)} : (⋃ i, f i).Sized r ↔ ∀ i, (f i).Sized r :=", "area": "Data"} {"task": "t8", "statement": "theorem sized_iUnion₂ {f : ∀ i, κ i → Set (Finset α)} : (⋃ (i) (j), f i j).Sized r ↔ ∀ i j, (f i j).Sized r :=", "area": "Data"} {"task": "t8", "statement": "theorem subset_powersetCard_univ_iff : 𝒜 ⊆ powersetCard r univ ↔ (𝒜 : Set (Finset α)).Sized r :=", "area": "Data"} {"task": "t8", "statement": "theorem _root_.Set.Sized.card_le (h𝒜 : (𝒜 : Set (Finset α)).Sized r) : card 𝒜 ≤ (Fintype.card α).choose r :=", "area": "Data"} {"task": "t8", "statement": "theorem sum_card_slice : (∑ r ∈ Iic (Fintype.card α), (𝒜 # r).card) = 𝒜.card :=", "area": "Data"} {"task": "t8", "statement": "theorem Finset.pairwiseDisjoint_range_singleton : (Set.range (singleton : α → Finset α)).PairwiseDisjoint id :=", "area": "Data"} {"task": "t8", "statement": "theorem PairwiseDisjoint.image_finset_of_le [DecidableEq ι] {s : Finset ι} {f : ι → α} (hs : (s : Set ι).PairwiseDisjoint f) {g : ι → ι} (hf : ∀ a, f (g a) ≤ f a) : (s.image g : Set ι).PairwiseDisjoint f :=", "area": "Data"} {"task": "t8", "statement": "theorem PairwiseDisjoint.biUnion_finset {s : Set ι'} {g : ι' → Finset ι} {f : ι → α} (hs : s.PairwiseDisjoint fun i' : ι' => (g i').sup f) (hg : ∀ i ∈ s, (g i : Set ι).PairwiseDisjoint f) : (⋃ i ∈ s, ↑(g i)).PairwiseDisjoint f :=", "area": "Data"} {"task": "t8", "statement": "theorem pairwise_of_coe_toFinset_pairwise (hl : (l.toFinset : Set α).Pairwise r) (hn : l.Nodup) : l.Pairwise r :=", "area": "Data"} {"task": "t8", "statement": "theorem pairwise_iff_coe_toFinset_pairwise (hn : l.Nodup) (hs : Symmetric r) : (l.toFinset : Set α).Pairwise r ↔ l.Pairwise r :=", "area": "Data"} {"task": "t8", "statement": "lemma mem_inf [DecidableEq α] {s : Finset ι} {f : ι → Finset α} {a : α} : a ∈ s.inf f ↔ ∀ i ∈ s, a ∈ f i :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.exists_max [Finite α] [Nonempty α] [LinearOrder β] (f : α → β) : ∃ x₀ : α, ∀ x, f x ≤ f x₀ :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.exists_min [Finite α] [Nonempty α] [LinearOrder β] (f : α → β) : ∃ x₀ : α, ∀ x, f x₀ ≤ f x :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma powerset_univ : (univ : Finset α).powerset = univ :=", "area": "Data"} {"task": "t8", "statement": "lemma filter_subset_univ [DecidableEq α] (s : Finset α) : filter (fun t ↦ t ⊆ s) univ = powerset s :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma powerset_eq_univ : s.powerset = univ ↔ s = univ :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma univ_filter_card_eq (k : ℕ) : (univ : Finset (Finset α)).filter (fun s ↦ s.card = k) = univ.powersetCard k :=", "area": "Data"} {"task": "t8", "statement": "theorem Fintype.card_finset_len [Fintype α] (k : ℕ) : Fintype.card { s : Finset α // s.card = k } = Nat.choose (Fintype.card α) k :=", "area": "Data"} {"task": "t8", "statement": "theorem card_of_subtype {p : α → Prop} (s : Finset α) (H : ∀ x : α, x ∈ s ↔ p x) [Fintype { x // p x }] : card { x // p x } = s.card :=", "area": "Data"} {"task": "t8", "statement": "theorem card_of_finset' {p : Set α} (s : Finset α) (H : ∀ x, x ∈ s ↔ x ∈ p) [Fintype p] : Fintype.card p = s.card :=", "area": "Data"} {"task": "t8", "statement": "theorem card_congr {α β} [Fintype α] [Fintype β] (f : α ≃ β) : card α = card β :=", "area": "Data"} {"task": "t8", "statement": "theorem card_congr' {α β} [Fintype α] [Fintype β] (h : α = β) : card α = card β :=", "area": "Data"} {"task": "t8", "statement": "theorem Finset.eq_univ_of_card [Fintype α] (s : Finset α) (hs : s.card = Fintype.card α) : s = univ :=", "area": "Data"} {"task": "t8", "statement": "theorem Finset.card_eq_iff_eq_univ [Fintype α] (s : Finset α) : s.card = Fintype.card α ↔ s = Finset.univ :=", "area": "Data"} {"task": "t8", "statement": "theorem Finset.card_add_card_compl [DecidableEq α] [Fintype α] (s : Finset α) : s.card + sᶜ.card = Fintype.card α :=", "area": "Data"} {"task": "t8", "statement": "theorem Finset.card_compl_add_card [DecidableEq α] [Fintype α] (s : Finset α) : sᶜ.card + s.card = Fintype.card α :=", "area": "Data"} {"task": "t8", "statement": "theorem Fintype.card_compl_set [Fintype α] (s : Set α) [Fintype s] [Fintype (↥sᶜ : Sort _)] : Fintype.card (↥sᶜ : Sort _) = Fintype.card α - Fintype.card s :=", "area": "Data"} {"task": "t8", "statement": "theorem Fintype.card_fin_lt_of_le {m n : ℕ} (h : m ≤ n) : Fintype.card {i : Fin n // i < m} = m :=", "area": "Data"} {"task": "t8", "statement": "theorem Finset.card_fin (n : ℕ) : Finset.card (Finset.univ : Finset (Fin n)) = n :=", "area": "Data"} {"task": "t8", "statement": "theorem Fin.cast_eq_cast' {n m : ℕ} (h : Fin n = Fin m) : _root_.cast h = Fin.cast (fin_injective h) :=", "area": "Data"} {"task": "t8", "statement": "theorem card_finset_fin_le {n : ℕ} (s : Finset (Fin n)) : s.card ≤ n :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.of_injective {α β : Sort*} [Finite β] (f : α → β) (H : Injective f) : Finite α :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.exists_univ_list (α) [Finite α] : ∃ l : List α, l.Nodup ∧ ∀ x : α, x ∈ l :=", "area": "Data"} {"task": "t8", "statement": "theorem List.Nodup.length_le_card {α : Type*} [Fintype α] {l : List α} (h : l.Nodup) : l.length ≤ Fintype.card α :=", "area": "Data"} {"task": "t8", "statement": "theorem card_lt_of_injective_of_not_mem (f : α → β) (h : Function.Injective f) {b : β} (w : b ∉ Set.range f) : card α < card β :=", "area": "Data"} {"task": "t8", "statement": "theorem card_range_le {α β : Type*} (f : α → β) [Fintype α] [Fintype (Set.range f)] : Fintype.card (Set.range f) ≤ Fintype.card α :=", "area": "Data"} {"task": "t8", "statement": "theorem card_eq_one_iff : card α = 1 ↔ ∃ x : α, ∀ y, y = x :=", "area": "Data"} {"task": "t8", "statement": "theorem card_eq_zero_iff : card α = 0 ↔ IsEmpty α :=", "area": "Data"} {"task": "t8", "statement": "theorem card_le_one_iff : card α ≤ 1 ↔ ∀ a b : α, a = b :=", "area": "Data"} {"task": "t8", "statement": "theorem one_lt_card_iff_nontrivial : 1 < card α ↔ Nontrivial α :=", "area": "Data"} {"task": "t8", "statement": "theorem exists_unique_iff_card_one {α} [Fintype α] (p : α → Prop) [DecidablePred p] : (∃! a : α, p a) ↔ (Finset.univ.filter p).card = 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem two_lt_card_iff : 2 < card α ↔ ∃ a b c : α, a ≠ b ∧ a ≠ c ∧ b ≠ c :=", "area": "Data"} {"task": "t8", "statement": "theorem surjective_of_injective {f : α → α} (hinj : Injective f) : Surjective f :=", "area": "Data"} {"task": "t8", "statement": "theorem injective_iff_bijective {f : α → α} : Injective f ↔ Bijective f :=", "area": "Data"} {"task": "t8", "statement": "theorem surjective_iff_bijective {f : α → α} : Surjective f ↔ Bijective f :=", "area": "Data"} {"task": "t8", "statement": "theorem injective_iff_surjective_of_equiv {f : α → β} (e : α ≃ β) : Injective f ↔ Surjective f :=", "area": "Data"} {"task": "t8", "statement": "lemma Finset.exists_superset_card_eq [Fintype α] {n : ℕ} {s : Finset α} (hsn : s.card ≤ n) (hnα : n ≤ Fintype.card α) : ∃ t, s ⊆ t ∧ t.card = n :=", "area": "Data"} {"task": "t8", "statement": "theorem set_fintype_card_eq_univ_iff [Fintype α] (s : Set α) [Fintype s] : Fintype.card s = Fintype.card α ↔ s = Set.univ :=", "area": "Data"} {"task": "t8", "statement": "theorem equiv_of_fintype_self_embedding_to_embedding [Finite α] (e : α ↪ α) : e.equivOfFintypeSelfEmbedding.toEmbedding = e :=", "area": "Data"} {"task": "t8", "statement": "theorem nonempty_of_card_le [Fintype α] [Fintype β] (h : Fintype.card α ≤ Fintype.card β) : Nonempty (α ↪ β) :=", "area": "Data"} {"task": "t8", "statement": "theorem exists_of_card_le_finset [Fintype α] {s : Finset β} (h : Fintype.card α ≤ s.card) : ∃ f : α ↪ β, Set.range f ⊆ s :=", "area": "Data"} {"task": "t8", "statement": "theorem Finset.univ_map_embedding {α : Type*} [Fintype α] (e : α ↪ α) : univ.map e = univ :=", "area": "Data"} {"task": "t8", "statement": "theorem Fintype.card_subtype_lt [Fintype α] {p : α → Prop} [DecidablePred p] {x : α} (hx : ¬p x) : Fintype.card { x // p x } < Fintype.card α :=", "area": "Data"} {"task": "t8", "statement": "theorem Fintype.card_subtype [Fintype α] (p : α → Prop) [DecidablePred p] : Fintype.card { x // p x } = ((Finset.univ : Finset α).filter p).card :=", "area": "Data"} {"task": "t8", "statement": "theorem Fintype.card_subtype_compl [Fintype α] (p : α → Prop) [Fintype { x // p x }] [Fintype { x // ¬p x }] : Fintype.card { x // ¬p x } = Fintype.card α - Fintype.card { x // p x } :=", "area": "Data"} {"task": "t8", "statement": "theorem Fintype.card_compl_eq_card_compl [Finite α] (p q : α → Prop) [Fintype { x // p x }] [Fintype { x // ¬p x }] [Fintype { x // q x }] [Fintype { x // ¬q x }] (h : Fintype.card { x // p x } = Fintype.card { x // q x }) : Fintype.card { x // ¬p x } = Fintype.card { x // ¬q x } :=", "area": "Data"} {"task": "t8", "statement": "theorem univ_eq_singleton_of_card_one {α} [Fintype α] (x : α) (h : Fintype.card α = 1) : (univ : Finset α) = {x} :=", "area": "Data"} {"task": "t8", "statement": "theorem wellFounded_of_trans_of_irrefl (r : α → α → Prop) [IsTrans α r] [IsIrrefl α r] : WellFounded r :=", "area": "Data"} {"task": "t8", "statement": "theorem Finset.exists_minimal {α : Type*} [Preorder α] (s : Finset α) (h : s.Nonempty) : ∃ m ∈ s, ∀ x ∈ s, ¬x < m :=", "area": "Data"} {"task": "t8", "statement": "theorem of_injective_to_set {s : Set α} (hs : s ≠ Set.univ) {f : α → s} (hf : Injective f) : Infinite α :=", "area": "Data"} {"task": "t8", "statement": "theorem nonempty (α : Type*) [Infinite α] : Nonempty α :=", "area": "Data"} {"task": "t8", "statement": "theorem natEmbeddingAux_injective (α : Type*) [Infinite α] : Function.Injective (natEmbeddingAux α) :=", "area": "Data"} {"task": "t8", "statement": "theorem exists_subset_card_eq (α : Type*) [Infinite α] (n : ℕ) : ∃ s : Finset α, s.card = n :=", "area": "Data"} {"task": "t8", "statement": "theorem exists_superset_card_eq [Infinite α] (s : Finset α) (n : ℕ) (hn : s.card ≤ n) : ∃ t : Finset α, s ⊆ t ∧ t.card = n :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.exists_ne_map_eq_of_infinite {α β} [Infinite α] [Finite β] (f : α → β) : ∃ x y : α, x ≠ y ∧ f x = f y :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.exists_infinite_fiber [Infinite α] [Finite β] (f : α → β) : ∃ y : β, Infinite (f ⁻¹' {y}) :=", "area": "Data"} {"task": "t8", "statement": "theorem List.exists_pw_disjoint_with_card {α : Type*} [Fintype α] {c : List ℕ} (hc : c.sum ≤ Fintype.card α) : ∃ o : List (List α), o.map length = c ∧ (∀ s ∈ o, s.Nodup) ∧ Pairwise List.Disjoint o :=", "area": "Data"} {"task": "t8", "statement": "theorem Fintype.induction_subsingleton_or_nontrivial {P : ∀ (α) [Fintype α], Prop} (α : Type*) [Fintype α] (hbase : ∀ (α) [Fintype α] [Subsingleton α], P α) (hstep : ∀ (α) [Fintype α] [Nontrivial α], (∀ (β) [Fintype β], Fintype.card β < Fintype.card α → P β) → P α) : P α :=", "area": "Data"} {"task": "t8", "statement": "theorem mem_piFinset {t : ∀ a, Finset (δ a)} {f : ∀ a, δ a} : f ∈ piFinset t ↔ ∀ a, f a ∈ t a :=", "area": "Data"} {"task": "t8", "statement": "theorem coe_piFinset (t : ∀ a, Finset (δ a)) : (piFinset t : Set (∀ a, δ a)) = Set.pi Set.univ fun a => t a :=", "area": "Data"} {"task": "t8", "statement": "theorem piFinset_empty [Nonempty α] : piFinset (fun _ => ∅ : ∀ i, Finset (δ i)) = ∅ :=", "area": "Data"} {"task": "t8", "statement": "@[simp, aesop safe apply (rule_sets := [finsetNonempty])] lemma piFinset_nonempty : (piFinset s).Nonempty ↔ ∀ a, (s a).Nonempty :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma piFinset_of_isEmpty [IsEmpty α] (s : ∀ a, Finset (γ a)) : piFinset s = univ :=", "area": "Data"} {"task": "t8", "statement": "theorem piFinset_singleton (f : ∀ i, δ i) : piFinset (fun i => {f i} : ∀ i, Finset (δ i)) = {f} :=", "area": "Data"} {"task": "t8", "statement": "lemma piFinset_image [∀ a, DecidableEq (δ a)] (f : ∀ a, γ a → δ a) (s : ∀ a, Finset (γ a)) : piFinset (fun a ↦ (s a).image (f a)) = (piFinset s).image fun b a ↦ f _ (b a) :=", "area": "Data"} {"task": "t8", "statement": "lemma eval_image_piFinset (t : ∀ a, Finset (δ a)) (a : α) [DecidableEq (δ a)] (ht : ∀ b, a ≠ b → (t b).Nonempty) : ((piFinset t).image fun f ↦ f a) = t a :=", "area": "Data"} {"task": "t8", "statement": "lemma eval_image_piFinset_const {β} [DecidableEq β] (t : Finset β) (a : α) : ((piFinset fun _i : α ↦ t).image fun f ↦ f a) = t :=", "area": "Data"} {"task": "t8", "statement": "lemma filter_piFinset_of_not_mem (t : ∀ a, Finset (δ a)) (a : α) (x : δ a) (hx : x ∉ t a) : (piFinset t).filter (· a = x) = ∅ :=", "area": "Data"} {"task": "t8", "statement": "lemma piFinset_update_eq_filter_piFinset_mem (s : ∀ i, Finset (δ i)) (i : α) {t : Finset (δ i)} (hts : t ⊆ s i) : piFinset (Function.update s i t) = (piFinset s).filter (fun f ↦ f i ∈ t) :=", "area": "Data"} {"task": "t8", "statement": "lemma piFinset_update_singleton_eq_filter_piFinset_eq (s : ∀ i, Finset (δ i)) (i : α) {a : δ i} (ha : a ∈ s i) : piFinset (Function.update s i {a}) = (piFinset s).filter (fun f ↦ f i = a) :=", "area": "Data"} {"task": "t8", "statement": "theorem Finset.univ_pi_univ {α : Type*} {β : α → Type*} [DecidableEq α] [Fintype α] [∀ a, Fintype (β a)] : (Finset.univ.pi fun a : α => (Finset.univ : Finset (β a))) = Finset.univ :=", "area": "Data"} {"task": "t8", "statement": "theorem algHom_ext ⦃f g : ℂ →ₐ[ℝ] A⦄ (h : f I = g I) : f = g :=", "area": "Data"} {"task": "t8", "statement": "theorem coe_basisOneI : ⇑basisOneI = ![1, I] :=", "area": "Data"} {"task": "t8", "statement": "theorem toMatrix_conjAe : LinearMap.toMatrix basisOneI basisOneI conjAe.toLinearMap = !![1, 0; 0, -1] :=", "area": "Data"} {"task": "t8", "statement": "theorem real_algHom_eq_id_or_conj (f : ℂ →ₐ[ℝ] ℂ) : f = AlgHom.id ℝ ℂ ∨ f = conjAe :=", "area": "Data"} {"task": "t8", "statement": "theorem liftAux_apply_I (I' : A) (hI') : liftAux I' hI' I = I' :=", "area": "Data"} {"task": "t8", "statement": "theorem skewAdjoint.I_smul_neg_I (a : skewAdjoint A) : I • (skewAdjoint.negISMul a : A) = a :=", "area": "Data"} {"task": "t8", "statement": "theorem realPart_apply_coe (a : A) : (ℜ a : A) = (2 : ℝ)⁻¹ • (a + star a) :=", "area": "Data"} {"task": "t8", "statement": "theorem imaginaryPart_apply_coe (a : A) : (ℑ a : A) = -I • (2 : ℝ)⁻¹ • (a - star a) :=", "area": "Data"} {"task": "t8", "statement": "theorem realPart_add_I_smul_imaginaryPart (a : A) : (ℜ a : A) + I • (ℑ a : A) = a :=", "area": "Data"} {"task": "t8", "statement": "theorem realPart_I_smul (a : A) : ℜ (I • a) = -ℑ a :=", "area": "Data"} {"task": "t8", "statement": "theorem imaginaryPart_I_smul (a : A) : ℑ (I • a) = ℜ a :=", "area": "Data"} {"task": "t8", "statement": "theorem realPart_smul (z : ℂ) (a : A) : ℜ (z • a) = z.re • ℜ a - z.im • ℑ a :=", "area": "Data"} {"task": "t8", "statement": "theorem imaginaryPart_smul (z : ℂ) (a : A) : ℑ (z • a) = z.re • ℑ a + z.im • ℜ a :=", "area": "Data"} {"task": "t8", "statement": "lemma skewAdjointPart_eq_I_smul_imaginaryPart (x : A) : (skewAdjointPart ℝ x : A) = I • (imaginaryPart x : A) :=", "area": "Data"} {"task": "t8", "statement": "nonrec lemma IsSelfAdjoint.imaginaryPart {x : A} (hx : IsSelfAdjoint x) : ℑ x = 0 :=", "area": "Data"} {"task": "t8", "statement": "lemma imaginaryPart_comp_subtype_selfAdjoint : imaginaryPart.comp (selfAdjoint.submodule ℝ A).subtype = 0 :=", "area": "Data"} {"task": "t8", "statement": "lemma imaginaryPart_surjective : Function.Surjective (imaginaryPart (A := A)) :=", "area": "Data"} {"task": "t8", "statement": "lemma span_selfAdjoint : span ℂ (selfAdjoint A : Set A) = ⊤ :=", "area": "Data"} {"task": "t8", "statement": "lemma Complex.coe_selfAdjointEquiv (z : selfAdjoint ℂ) : (selfAdjointEquiv z : ℂ) = z :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma realPart_ofReal (r : ℝ) : (ℜ (r : ℂ) : ℂ) = r :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma imaginaryPart_ofReal (r : ℝ) : ℑ (r : ℂ) = 0 :=", "area": "Data"} {"task": "t8", "statement": "lemma Complex.coe_realPart (z : ℂ) : (ℜ z : ℂ) = z.re :=", "area": "Data"} {"task": "t8", "statement": "lemma star_mul_self_add_self_mul_star {A : Type*} [NonUnitalRing A] [StarRing A] [Module ℂ A] [IsScalarTower ℂ A A] [SMulCommClass ℂ A A] [StarModule ℂ A] (a : A) : star a * a + a * star a = 2 • (ℜ a * ℜ a + ℑ a * ℑ a) :=", "area": "Data"} {"task": "t8", "statement": "theorem mk_complex : #ℂ = 𝔠 :=", "area": "Data"} {"task": "t8", "statement": "theorem mk_univ_complex : #(Set.univ : Set ℂ) = 𝔠 :=", "area": "Data"} {"task": "t8", "statement": "theorem not_countable_complex : ¬(Set.univ : Set ℂ).Countable :=", "area": "Data"} {"task": "t8", "statement": "theorem induction₂ {P : EReal → EReal → Prop} (top_top : P ⊤ ⊤) (top_pos : ∀ x : ℝ, 0 < x → P ⊤ x) (top_zero : P ⊤ 0) (top_neg : ∀ x : ℝ, x < 0 → P ⊤ x) (top_bot : P ⊤ ⊥) (pos_top : ∀ x : ℝ, 0 < x → P x ⊤) (pos_bot : ∀ x : ℝ, 0 < x → P x ⊥) (zero_top : P 0 ⊤) (coe_coe : ∀ x y : ℝ, P x y) (zero_bot : P 0 ⊥) (neg_top : ∀ x : ℝ, x < 0 → P x ⊤) (neg_bot : ∀ x : ℝ, x < 0 → P x ⊥) (bot_top : P ⊥ ⊤) (bot_pos : ∀ x : ℝ, 0 < x → P ⊥ x) (bot_zero : P ⊥ 0) (bot_neg : ∀ x : ℝ, x < 0 → P ⊥ x) (bot_bot : P ⊥ ⊥) : ∀ x y, P x y", "area": "Data"} {"task": "t8", "statement": "theorem mul_comm (x y : EReal) : x * y = y * x :=", "area": "Data"} {"task": "t8", "statement": "theorem range_coe : range Real.toEReal = {⊥, ⊤}ᶜ :=", "area": "Data"} {"task": "t8", "statement": "theorem range_coe_eq_Ioo : range Real.toEReal = Ioo ⊥ ⊤ :=", "area": "Data"} {"task": "t8", "statement": "theorem toReal_le_toReal {x y : EReal} (h : x ≤ y) (hx : x ≠ ⊥) (hy : y ≠ ⊤) : x.toReal ≤ y.toReal :=", "area": "Data"} {"task": "t8", "statement": "theorem coe_toReal {x : EReal} (hx : x ≠ ⊤) (h'x : x ≠ ⊥) : (x.toReal : EReal) = x :=", "area": "Data"} {"task": "t8", "statement": "theorem le_coe_toReal {x : EReal} (h : x ≠ ⊤) : x ≤ x.toReal :=", "area": "Data"} {"task": "t8", "statement": "theorem coe_toReal_le {x : EReal} (h : x ≠ ⊥) : ↑x.toReal ≤ x :=", "area": "Data"} {"task": "t8", "statement": "theorem eq_top_iff_forall_lt (x : EReal) : x = ⊤ ↔ ∀ y : ℝ, (y : EReal) < x :=", "area": "Data"} {"task": "t8", "statement": "theorem eq_bot_iff_forall_lt (x : EReal) : x = ⊥ ↔ ∀ y : ℝ, x < (y : EReal) :=", "area": "Data"} {"task": "t8", "statement": "lemma exists_between_coe_real {x z : EReal} (h : x < z) : ∃ y : ℝ, x < y ∧ y < z :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma image_coe_Icc (x y : ℝ) : Real.toEReal '' Icc x y = Icc ↑x ↑y :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma image_coe_Ico (x y : ℝ) : Real.toEReal '' Ico x y = Ico ↑x ↑y :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma image_coe_Ici (x : ℝ) : Real.toEReal '' Ici x = Ico ↑x ⊤ :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma image_coe_Ioc (x y : ℝ) : Real.toEReal '' Ioc x y = Ioc ↑x ↑y :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma image_coe_Ioo (x y : ℝ) : Real.toEReal '' Ioo x y = Ioo ↑x ↑y :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma image_coe_Ioi (x : ℝ) : Real.toEReal '' Ioi x = Ioo ↑x ⊤ :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma image_coe_Iic (x : ℝ) : Real.toEReal '' Iic x = Ioc ⊥ ↑x :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma image_coe_Iio (x : ℝ) : Real.toEReal '' Iio x = Ioo ⊥ ↑x :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma preimage_coe_Ici (x : ℝ) : Real.toEReal ⁻¹' Ici x = Ici x :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma preimage_coe_Ioi (x : ℝ) : Real.toEReal ⁻¹' Ioi x = Ioi x :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma preimage_coe_Ioi_bot : Real.toEReal ⁻¹' Ioi ⊥ = univ :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma preimage_coe_Iic (y : ℝ) : Real.toEReal ⁻¹' Iic y = Iic y :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma preimage_coe_Iio (y : ℝ) : Real.toEReal ⁻¹' Iio y = Iio y :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma preimage_coe_Iio_top : Real.toEReal ⁻¹' Iio ⊤ = univ :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma preimage_coe_Icc (x y : ℝ) : Real.toEReal ⁻¹' Icc x y = Icc x y :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma preimage_coe_Ico (x y : ℝ) : Real.toEReal ⁻¹' Ico x y = Ico x y :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma preimage_coe_Ioc (x y : ℝ) : Real.toEReal ⁻¹' Ioc x y = Ioc x y :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma preimage_coe_Ioo (x y : ℝ) : Real.toEReal ⁻¹' Ioo x y = Ioo x y :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma preimage_coe_Ico_top (x : ℝ) : Real.toEReal ⁻¹' Ico x ⊤ = Ici x :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma preimage_coe_Ioo_top (x : ℝ) : Real.toEReal ⁻¹' Ioo x ⊤ = Ioi x :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma preimage_coe_Ioc_bot (y : ℝ) : Real.toEReal ⁻¹' Ioc ⊥ y = Iic y :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma preimage_coe_Ioo_bot (y : ℝ) : Real.toEReal ⁻¹' Ioo ⊥ y = Iio y :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma preimage_coe_Ioo_bot_top : Real.toEReal ⁻¹' Ioo ⊥ ⊤ = univ :=", "area": "Data"} {"task": "t8", "statement": "theorem coe_ennreal_eq_zero {x : ℝ≥0∞} : (x : EReal) = 0 ↔ x = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem coe_ennreal_eq_one {x : ℝ≥0∞} : (x : EReal) = 1 ↔ x = 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem coe_ennreal_pos {x : ℝ≥0∞} : (0 : EReal) < x ↔ 0 < x :=", "area": "Data"} {"task": "t8", "statement": "theorem coe_ennreal_add (x y : ENNReal) : ((x + y : ℝ≥0∞) : EReal) = x + y :=", "area": "Data"} {"task": "t8", "statement": "theorem coe_ennreal_top_mul (x : ℝ≥0) : ((⊤ * x : ℝ≥0∞) : EReal) = ⊤ * x :=", "area": "Data"} {"task": "t8", "statement": "theorem coe_ennreal_mul : ∀ x y : ℝ≥0∞, ((x * y : ℝ≥0∞) : EReal) = (x : EReal) * y", "area": "Data"} {"task": "t8", "statement": "theorem exists_rat_btwn_of_lt : ∀ {a b : EReal}, a < b → ∃ x : ℚ, a < (x : ℝ) ∧ ((x : ℝ) : EReal) < b", "area": "Data"} {"task": "t8", "statement": "theorem bot_lt_add_iff {x y : EReal} : ⊥ < x + y ↔ ⊥ < x ∧ ⊥ < y :=", "area": "Data"} {"task": "t8", "statement": "theorem top_add_of_ne_bot {x : EReal} (h : x ≠ ⊥) : ⊤ + x = ⊤ :=", "area": "Data"} {"task": "t8", "statement": "theorem top_add_iff_ne_bot {x : EReal} : ⊤ + x = ⊤ ↔ x ≠ ⊥ :=", "area": "Data"} {"task": "t8", "statement": "theorem add_top_of_ne_bot {x : EReal} (h : x ≠ ⊥) : x + ⊤ = ⊤ :=", "area": "Data"} {"task": "t8", "statement": "theorem add_top_iff_ne_bot {x : EReal} : x + ⊤ = ⊤ ↔ x ≠ ⊥ :=", "area": "Data"} {"task": "t8", "statement": "theorem add_pos {a b : EReal} (ha : 0 < a) (hb : 0 < b) : 0 < a + b :=", "area": "Data"} {"task": "t8", "statement": "theorem toReal_add {x y : EReal} (hx : x ≠ ⊤) (h'x : x ≠ ⊥) (hy : y ≠ ⊤) (h'y : y ≠ ⊥) : toReal (x + y) = toReal x + toReal y :=", "area": "Data"} {"task": "t8", "statement": "theorem addLECancellable_coe (x : ℝ) : AddLECancellable (x : EReal)", "area": "Data"} {"task": "t8", "statement": "theorem add_lt_add_left_coe {x y : EReal} (h : x < y) (z : ℝ) : (z : EReal) + x < z + y :=", "area": "Data"} {"task": "t8", "statement": "theorem add_lt_add {x y z t : EReal} (h1 : x < y) (h2 : z < t) : x + z < y + t :=", "area": "Data"} {"task": "t8", "statement": "theorem add_lt_add_of_lt_of_le' {x y z t : EReal} (h : x < y) (h' : z ≤ t) (hbot : t ≠ ⊥) (htop : t = ⊤ → z = ⊤ → x = ⊥) : x + z < y + t :=", "area": "Data"} {"task": "t8", "statement": "theorem add_lt_top {x y : EReal} (hx : x ≠ ⊤) (hy : y ≠ ⊤) : x + y < ⊤ :=", "area": "Data"} {"task": "t8", "statement": "theorem toReal_neg : ∀ {a : EReal}, toReal (-a) = -toReal a", "area": "Data"} {"task": "t8", "statement": "theorem neg_le {a b : EReal} : -a ≤ b ↔ -b ≤ a :=", "area": "Data"} {"task": "t8", "statement": "theorem le_neg_of_le_neg {a b : EReal} (h : a ≤ -b) : b ≤ -a :=", "area": "Data"} {"task": "t8", "statement": "theorem neg_lt_iff_neg_lt {a b : EReal} : -a < b ↔ -b < a :=", "area": "Data"} {"task": "t8", "statement": "theorem sub_lt_sub_of_lt_of_le {x y z t : EReal} (h : x < y) (h' : z ≤ t) (hz : z ≠ ⊥) (ht : t ≠ ⊤) : x - t < y - z :=", "area": "Data"} {"task": "t8", "statement": "theorem coe_real_ereal_eq_coe_toNNReal_sub_coe_toNNReal (x : ℝ) : (x : EReal) = Real.toNNReal x - Real.toNNReal (-x) :=", "area": "Data"} {"task": "t8", "statement": "theorem toReal_sub {x y : EReal} (hx : x ≠ ⊤) (h'x : x ≠ ⊥) (hy : y ≠ ⊤) (h'y : y ≠ ⊥) : toReal (x - y) = toReal x - toReal y :=", "area": "Data"} {"task": "t8", "statement": "lemma add_sub_cancel_right {a : EReal} {b : Real} : a + b - b = a :=", "area": "Data"} {"task": "t8", "statement": "lemma top_mul_of_pos {x : EReal} (h : 0 < x) : ⊤ * x = ⊤ :=", "area": "Data"} {"task": "t8", "statement": "lemma mul_pos {a b : EReal} (ha : 0 < a) (hb : 0 < b) : 0 < a * b :=", "area": "Data"} {"task": "t8", "statement": "lemma top_mul_of_neg {x : EReal} (h : x < 0) : ⊤ * x = ⊥ :=", "area": "Data"} {"task": "t8", "statement": "lemma bot_mul_of_pos {x : EReal} (h : 0 < x) : ⊥ * x = ⊥ :=", "area": "Data"} {"task": "t8", "statement": "lemma bot_mul_of_neg {x : EReal} (h : x < 0) : ⊥ * x = ⊤ :=", "area": "Data"} {"task": "t8", "statement": "lemma toReal_mul {x y : EReal} : toReal (x * y) = toReal x * toReal y :=", "area": "Data"} {"task": "t8", "statement": "protected lemma neg_mul (x y : EReal) : -x * y = -(x * y) :=", "area": "Data"} {"task": "t8", "statement": "lemma right_distrib_of_nonneg {a b c : EReal} (ha : 0 ≤ a) (hb : 0 ≤ b) : (a + b) * c = a * c + b * c :=", "area": "Data"} {"task": "t8", "statement": "lemma left_distrib_of_nonneg {a b c : EReal} (ha : 0 ≤ a) (hb : 0 ≤ b) : c * (a + b) = c * a + c * b :=", "area": "Data"} {"task": "t8", "statement": "lemma le_iff_le_forall_real_gt (x y : EReal) : (∀ z : ℝ, x < z → y ≤ z) ↔ y ≤ x :=", "area": "Data"} {"task": "t8", "statement": "theorem abs_eq_zero_iff {x : EReal} : x.abs = 0 ↔ x = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem abs_zero : (0 : EReal).abs = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem coe_abs (x : ℝ) : ((x : EReal).abs : EReal) = (|x| : ℝ) :=", "area": "Data"} {"task": "t8", "statement": "theorem abs_neg : ∀ x : EReal, (-x).abs = x.abs", "area": "Data"} {"task": "t8", "statement": "theorem abs_mul (x y : EReal) : (x * y).abs = x.abs * y.abs :=", "area": "Data"} {"task": "t8", "statement": "theorem sign_coe (x : ℝ) : sign (x : EReal) = sign x :=", "area": "Data"} {"task": "t8", "statement": "theorem coe_coe_sign (x : SignType) : ((x : ℝ) : EReal) = x :=", "area": "Data"} {"task": "t8", "statement": "theorem sign_neg : ∀ x : EReal, sign (-x) = -sign x", "area": "Data"} {"task": "t8", "statement": "theorem sign_mul (x y : EReal) : sign (x * y) = sign x * sign y :=", "area": "Data"} {"task": "t8", "statement": "theorem sign_mul_abs : ∀ x : EReal, (sign x * x.abs : EReal) = x", "area": "Data"} {"task": "t8", "statement": "theorem abs_mul_sign (x : EReal) : (x.abs * sign x : EReal) = x :=", "area": "Data"} {"task": "t8", "statement": "theorem sign_eq_and_abs_eq_iff_eq {x y : EReal} : x.abs = y.abs ∧ sign x = sign y ↔ x = y :=", "area": "Data"} {"task": "t8", "statement": "theorem le_iff_sign {x y : EReal} : x ≤ y ↔ sign x < sign y ∨ sign x = SignType.neg ∧ sign y = SignType.neg ∧ y.abs ≤ x.abs ∨ sign x = SignType.zero ∧ sign y = SignType.zero ∨ sign x = SignType.pos ∧ sign y = SignType.pos ∧ x.abs ≤ y.abs :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma inv_zero : (0 : EReal)⁻¹ = 0 :=", "area": "Data"} {"task": "t8", "statement": "lemma inv_neg (a : EReal) : (-a)⁻¹ = -a⁻¹ :=", "area": "Data"} {"task": "t8", "statement": "lemma inv_inv {a : EReal} (h : a ≠ ⊥) (h' : a ≠ ⊤) : (a⁻¹)⁻¹ = a :=", "area": "Data"} {"task": "t8", "statement": "lemma mul_inv (a b : EReal) : (a * b)⁻¹ = a⁻¹ * b⁻¹ :=", "area": "Data"} {"task": "t8", "statement": "lemma sign_mul_inv_abs (a : EReal) : (sign a) * (a.abs : EReal)⁻¹ = a⁻¹ :=", "area": "Data"} {"task": "t8", "statement": "lemma sign_mul_inv_abs' (a : EReal) : (sign a) * ((a.abs⁻¹ : ℝ≥0∞) : EReal) = a⁻¹ :=", "area": "Data"} {"task": "t8", "statement": "lemma inv_nonneg_of_nonneg {a : EReal} (h : 0 ≤ a) : 0 ≤ a⁻¹ :=", "area": "Data"} {"task": "t8", "statement": "lemma inv_nonpos_of_nonpos {a : EReal} (h : a ≤ 0) : a⁻¹ ≤ 0 :=", "area": "Data"} {"task": "t8", "statement": "lemma inv_pos_of_pos_ne_top {a : EReal} (h : 0 < a) (h' : a ≠ ⊤) : 0 < a⁻¹ :=", "area": "Data"} {"task": "t8", "statement": "lemma inv_neg_of_neg_ne_bot {a : EReal} (h : a < 0) (h' : a ≠ ⊥) : a⁻¹ < 0 :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma div_zero {a : EReal} : a / 0 = 0 :=", "area": "Data"} {"task": "t8", "statement": "lemma div_self {a : EReal} (h₁ : a ≠ ⊥) (h₂ : a ≠ ⊤) (h₃ : a ≠ 0) : a / a = 1 :=", "area": "Data"} {"task": "t8", "statement": "lemma mul_div (a b c : EReal) : a * (b / c) = (a * b) / c :=", "area": "Data"} {"task": "t8", "statement": "lemma mul_div_right (a b c : EReal) : (a / b) * c = (a * c) / b :=", "area": "Data"} {"task": "t8", "statement": "lemma div_div (a b c : EReal) : a / b / c = a / (b * c) :=", "area": "Data"} {"task": "t8", "statement": "lemma div_mul_cancel {a b : EReal} (h₁ : b ≠ ⊥) (h₂ : b ≠ ⊤) (h₃ : b ≠ 0) : (a / b) * b = a :=", "area": "Data"} {"task": "t8", "statement": "lemma mul_div_cancel {a b : EReal} (h₁ : b ≠ ⊥) (h₂ : b ≠ ⊤) (h₃ : b ≠ 0) : b * (a / b) = a :=", "area": "Data"} {"task": "t8", "statement": "lemma mul_div_mul_cancel {a b c : EReal} (h₁ : c ≠ ⊥) (h₂ : c ≠ ⊤) (h₃ : c ≠ 0) : (a * c) / (b * c) = a / b :=", "area": "Data"} {"task": "t8", "statement": "lemma strictMono_div_right_of_pos {b : EReal} (h : 0 < b) (h' : b ≠ ⊤) : StrictMono fun a ↦ a / b :=", "area": "Data"} {"task": "t8", "statement": "lemma antitone_div_right_of_nonpos {b : EReal} (h : b ≤ 0) : Antitone fun a ↦ a / b :=", "area": "Data"} {"task": "t8", "statement": "lemma strictAnti_div_right_of_neg {b : EReal} (h : b < 0) (h' : b ≠ ⊥) : StrictAnti fun a ↦ a / b :=", "area": "Data"} {"task": "t8", "statement": "lemma le_div_iff_mul_le {a b c : EReal} (h : b > 0) (h' : b ≠ ⊤) : a ≤ c / b ↔ a * b ≤ c :=", "area": "Data"} {"task": "t8", "statement": "lemma div_le_iff_le_mul {a b c : EReal} (h : 0 < b) (h' : b ≠ ⊤) : a / b ≤ c ↔ a ≤ b * c :=", "area": "Data"} {"task": "t8", "statement": "theorem cantorFunctionAux_true (h : f n = true) : cantorFunctionAux c f n = c ^ n :=", "area": "Data"} {"task": "t8", "statement": "theorem cantorFunctionAux_false (h : f n = false) : cantorFunctionAux c f n = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem cantorFunctionAux_nonneg (h : 0 ≤ c) : 0 ≤ cantorFunctionAux c f n :=", "area": "Data"} {"task": "t8", "statement": "theorem cantorFunctionAux_eq (h : f n = g n) : cantorFunctionAux c f n = cantorFunctionAux c g n :=", "area": "Data"} {"task": "t8", "statement": "theorem cantorFunctionAux_zero (f : ℕ → Bool) : cantorFunctionAux c f 0 = cond (f 0) 1 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem cantorFunctionAux_succ (f : ℕ → Bool) : (fun n => cantorFunctionAux c f (n + 1)) = fun n => c * cantorFunctionAux c (fun n => f (n + 1)) n :=", "area": "Data"} {"task": "t8", "statement": "theorem summable_cantor_function (f : ℕ → Bool) (h1 : 0 ≤ c) (h2 : c < 1) : Summable (cantorFunctionAux c f) :=", "area": "Data"} {"task": "t8", "statement": "theorem cantorFunction_le (h1 : 0 ≤ c) (h2 : c < 1) (h3 : ∀ n, f n → g n) : cantorFunction c f ≤ cantorFunction c g :=", "area": "Data"} {"task": "t8", "statement": "theorem cantorFunction_succ (f : ℕ → Bool) (h1 : 0 ≤ c) (h2 : c < 1) : cantorFunction c f = cond (f 0) 1 0 + c * cantorFunction c fun n => f (n + 1) :=", "area": "Data"} {"task": "t8", "statement": "theorem increasing_cantorFunction (h1 : 0 < c) (h2 : c < 1 / 2) {n : ℕ} {f g : ℕ → Bool} (hn : ∀ k < n, f k = g k) (fn : f n = false) (gn : g n = true) : cantorFunction c f < cantorFunction c g :=", "area": "Data"} {"task": "t8", "statement": "theorem cantorFunction_injective (h1 : 0 < c) (h2 : c < 1 / 2) : Function.Injective (cantorFunction c) :=", "area": "Data"} {"task": "t8", "statement": "theorem mk_real : #ℝ = 𝔠 :=", "area": "Data"} {"task": "t8", "statement": "theorem mk_univ_real : #(Set.univ : Set ℝ) = 𝔠 :=", "area": "Data"} {"task": "t8", "statement": "theorem not_countable_real : ¬(Set.univ : Set ℝ).Countable :=", "area": "Data"} {"task": "t8", "statement": "theorem mk_Ioi_real (a : ℝ) : #(Ioi a) = 𝔠 :=", "area": "Data"} {"task": "t8", "statement": "theorem mk_Iio_real (a : ℝ) : #(Iio a) = 𝔠 :=", "area": "Data"} {"task": "t8", "statement": "theorem mk_Ioo_real {a b : ℝ} (h : a < b) : #(Ioo a b) = 𝔠 :=", "area": "Data"} {"task": "t8", "statement": "theorem pair_unpair (n : ℕ) : pair (unpair n).1 (unpair n).2 = n :=", "area": "Data"} {"task": "t8", "statement": "theorem pair_unpair' {n a b} (H : unpair n = (a, b)) : pair a b = n :=", "area": "Data"} {"task": "t8", "statement": "theorem unpair_pair (a b : ℕ) : unpair (pair a b) = (a, b) :=", "area": "Data"} {"task": "t8", "statement": "theorem unpair_lt {n : ℕ} (n1 : 1 ≤ n) : (unpair n).1 < n :=", "area": "Data"} {"task": "t8", "statement": "theorem unpair_zero : unpair 0 = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem unpair_left_le : ∀ n : ℕ, (unpair n).1 ≤ n", "area": "Data"} {"task": "t8", "statement": "theorem left_le_pair (a b : ℕ) : a ≤ pair a b :=", "area": "Data"} {"task": "t8", "statement": "theorem right_le_pair (a b : ℕ) : b ≤ pair a b :=", "area": "Data"} {"task": "t8", "statement": "theorem unpair_right_le (n : ℕ) : (unpair n).2 ≤ n :=", "area": "Data"} {"task": "t8", "statement": "theorem pair_lt_pair_left {a₁ a₂} (b) (h : a₁ < a₂) : pair a₁ b < pair a₂ b :=", "area": "Data"} {"task": "t8", "statement": "theorem pair_lt_pair_right (a) {b₁ b₂} (h : b₁ < b₂) : pair a b₁ < pair a b₂ :=", "area": "Data"} {"task": "t8", "statement": "theorem pair_lt_max_add_one_sq (m n : ℕ) : pair m n < (max m n + 1) ^ 2 :=", "area": "Data"} {"task": "t8", "statement": "theorem max_sq_add_min_le_pair (m n : ℕ) : max m n ^ 2 + min m n ≤ pair m n :=", "area": "Data"} {"task": "t8", "statement": "theorem add_le_pair (m n : ℕ) : m + n ≤ pair m n :=", "area": "Data"} {"task": "t8", "statement": "theorem iSup_unpair {α} [CompleteLattice α] (f : ℕ → ℕ → α) : ⨆ n : ℕ, f n.unpair.1 n.unpair.2 = ⨆ (i : ℕ) (j : ℕ), f i j :=", "area": "Data"} {"task": "t8", "statement": "theorem iUnion_unpair_prod {α β} {s : ℕ → Set α} {t : ℕ → Set β} : ⋃ n : ℕ, s n.unpair.fst ×ˢ t n.unpair.snd = (⋃ n, s n) ×ˢ ⋃ n, t n :=", "area": "Data"} {"task": "t8", "statement": "theorem fst_natCast (n : ℕ) : (n : α × β).fst = n :=", "area": "Data"} {"task": "t8", "statement": "theorem snd_natCast (n : ℕ) : (n : α × β).snd = n :=", "area": "Data"} {"task": "t8", "statement": "theorem cast_ite (P : Prop) [Decidable P] (m n : ℕ) : ((ite P m n : ℕ) : R) = ite P (m : R) (n : R) :=", "area": "Data"} {"task": "t8", "statement": "theorem cast_one [AddMonoidWithOne R] : ((1 : ℕ) : R) = 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem cast_add [AddMonoidWithOne R] (m n : ℕ) : ((m + n : ℕ) : R) = m + n :=", "area": "Data"} {"task": "t8", "statement": "theorem binCast_eq [AddMonoidWithOne R] (n : ℕ) : (Nat.binCast n : R) = ((n : ℕ) : R) :=", "area": "Data"} {"task": "t8", "statement": "theorem cast_bit1 [AddMonoidWithOne R] (n : ℕ) : ((bit1 n : ℕ) : R) = bit1 (n : R) :=", "area": "Data"} {"task": "t8", "statement": "theorem one_add_one_eq_two [AddMonoidWithOne R] : 1 + 1 = (2 : R) :=", "area": "Data"} {"task": "t8", "statement": "theorem two_add_one_eq_three [AddMonoidWithOne R] : 2 + 1 = (3 : R) :=", "area": "Data"} {"task": "t8", "statement": "theorem three_add_one_eq_four [AddMonoidWithOne R] : 3 + 1 = (4 : R) :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_def (n : ℕ) {p : ℕ} (pp : p.Prime) : n.factorization p = padicValNat p n :=", "area": "Data"} {"task": "t8", "statement": "theorem factors_count_eq {n p : ℕ} : n.factors.count p = n.factorization p :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_eq_factors_multiset (n : ℕ) : n.factorization = Multiset.toFinsupp (n.factors : Multiset ℕ) :=", "area": "Data"} {"task": "t8", "statement": "theorem multiplicity_eq_factorization {n p : ℕ} (pp : p.Prime) (hn : n ≠ 0) : multiplicity p n = n.factorization p :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_prod_pow_eq_self {n : ℕ} (hn : n ≠ 0) : n.factorization.prod (· ^ ·) = n :=", "area": "Data"} {"task": "t8", "statement": "theorem eq_of_factorization_eq {a b : ℕ} (ha : a ≠ 0) (hb : b ≠ 0) (h : ∀ p : ℕ, a.factorization p = b.factorization p) : a = b :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_inj : Set.InjOn factorization { x : ℕ | x ≠ 0 } :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_zero : factorization 0 = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_one : factorization 1 = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_eq_zero_iff (n p : ℕ) : n.factorization p = 0 ↔ ¬p.Prime ∨ ¬p ∣ n ∨ n = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_eq_zero_of_non_prime (n : ℕ) {p : ℕ} (hp : ¬p.Prime) : n.factorization p = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_eq_zero_of_not_dvd {n p : ℕ} (h : ¬p ∣ n) : n.factorization p = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem Prime.factorization_pos_of_dvd {n p : ℕ} (hp : p.Prime) (hn : n ≠ 0) (h : p ∣ n) : 0 < n.factorization p :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_eq_zero_of_remainder {p r : ℕ} (i : ℕ) (hr : ¬p ∣ r) : (p * i + r).factorization p = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_eq_zero_iff_remainder {p r : ℕ} (i : ℕ) (pp : p.Prime) (hr0 : r ≠ 0) : ¬p ∣ r ↔ (p * i + r).factorization p = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_eq_zero_iff' (n : ℕ) : n.factorization = 0 ↔ n = 0 ∨ n = 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_mul {a b : ℕ} (ha : a ≠ 0) (hb : b ≠ 0) : (a * b).factorization = a.factorization + b.factorization :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_prod {α : Type*} {S : Finset α} {g : α → ℕ} (hS : ∀ x ∈ S, g x ≠ 0) : (S.prod g).factorization = S.sum fun x => (g x).factorization :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_pow (n k : ℕ) : factorization (n ^ k) = k • n.factorization :=", "area": "Data"} {"task": "t8", "statement": "theorem Prime.factorization {p : ℕ} (hp : Prime p) : p.factorization = single p 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem Prime.factorization_self {p : ℕ} (hp : Prime p) : p.factorization p = 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem Prime.factorization_pow {p k : ℕ} (hp : Prime p) : (p ^ k).factorization = single p k :=", "area": "Data"} {"task": "t8", "statement": "theorem eq_pow_of_factorization_eq_single {n p k : ℕ} (hn : n ≠ 0) (h : n.factorization = Finsupp.single p k) : n = p ^ k :=", "area": "Data"} {"task": "t8", "statement": "theorem Prime.eq_of_factorization_pos {p q : ℕ} (hp : Prime p) (h : p.factorization q ≠ 0) : p = q :=", "area": "Data"} {"task": "t8", "statement": "theorem prod_pow_factorization_eq_self {f : ℕ →₀ ℕ} (hf : ∀ p : ℕ, p ∈ f.support → Prime p) : (f.prod (· ^ ·)).factorization = f :=", "area": "Data"} {"task": "t8", "statement": "theorem eq_factorization_iff {n : ℕ} {f : ℕ →₀ ℕ} (hn : n ≠ 0) (hf : ∀ p ∈ f.support, Prime p) : f = n.factorization ↔ f.prod (· ^ ·) = n :=", "area": "Data"} {"task": "t8", "statement": "theorem factorizationEquiv_apply (n : ℕ+) : (factorizationEquiv n).1 = n.1.factorization :=", "area": "Data"} {"task": "t8", "statement": "theorem ord_proj_of_not_prime (n p : ℕ) (hp : ¬p.Prime) : ord_proj[p] n = 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem ord_compl_of_not_prime (n p : ℕ) (hp : ¬p.Prime) : ord_compl[p] n = n :=", "area": "Data"} {"task": "t8", "statement": "theorem ord_proj_dvd (n p : ℕ) : ord_proj[p] n ∣ n :=", "area": "Data"} {"task": "t8", "statement": "theorem ord_proj_pos (n p : ℕ) : 0 < ord_proj[p] n :=", "area": "Data"} {"task": "t8", "statement": "theorem ord_compl_pos {n : ℕ} (p : ℕ) (hn : n ≠ 0) : 0 < ord_compl[p] n :=", "area": "Data"} {"task": "t8", "statement": "theorem ord_proj_mul {a b : ℕ} (p : ℕ) (ha : a ≠ 0) (hb : b ≠ 0) : ord_proj[p] (a * b) = ord_proj[p] a * ord_proj[p] b :=", "area": "Data"} {"task": "t8", "statement": "theorem ord_compl_mul (a b p : ℕ) : ord_compl[p] (a * b) = ord_compl[p] a * ord_compl[p] b :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_lt {n : ℕ} (p : ℕ) (hn : n ≠ 0) : n.factorization p < n :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_le_of_le_pow {n p b : ℕ} (hb : n ≤ p ^ b) : n.factorization p ≤ b :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_le_iff_dvd {d n : ℕ} (hd : d ≠ 0) (hn : n ≠ 0) : d.factorization ≤ n.factorization ↔ d ∣ n :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_prime_le_iff_dvd {d n : ℕ} (hd : d ≠ 0) (hn : n ≠ 0) : (∀ p : ℕ, p.Prime → d.factorization p ≤ n.factorization p) ↔ d ∣ n :=", "area": "Data"} {"task": "t8", "statement": "theorem pow_succ_factorization_not_dvd {n p : ℕ} (hn : n ≠ 0) (hp : p.Prime) : ¬p ^ (n.factorization p + 1) ∣ n :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_le_factorization_mul_left {a b : ℕ} (hb : b ≠ 0) : a.factorization ≤ (a * b).factorization :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_le_factorization_mul_right {a b : ℕ} (ha : a ≠ 0) : b.factorization ≤ (a * b).factorization :=", "area": "Data"} {"task": "t8", "statement": "theorem Prime.pow_dvd_iff_le_factorization {p k n : ℕ} (pp : Prime p) (hn : n ≠ 0) : p ^ k ∣ n ↔ k ≤ n.factorization p :=", "area": "Data"} {"task": "t8", "statement": "theorem Prime.pow_dvd_iff_dvd_ord_proj {p k n : ℕ} (pp : Prime p) (hn : n ≠ 0) : p ^ k ∣ n ↔ p ^ k ∣ ord_proj[p] n :=", "area": "Data"} {"task": "t8", "statement": "theorem Prime.dvd_iff_one_le_factorization {p n : ℕ} (pp : Prime p) (hn : n ≠ 0) : p ∣ n ↔ 1 ≤ n.factorization p :=", "area": "Data"} {"task": "t8", "statement": "theorem exists_factorization_lt_of_lt {a b : ℕ} (ha : a ≠ 0) (hab : a < b) : ∃ p : ℕ, a.factorization p < b.factorization p :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_div {d n : ℕ} (h : d ∣ n) : (n / d).factorization = n.factorization - d.factorization :=", "area": "Data"} {"task": "t8", "statement": "theorem not_dvd_ord_compl {n p : ℕ} (hp : Prime p) (hn : n ≠ 0) : ¬p ∣ ord_compl[p] n :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_ord_compl (n p : ℕ) : (ord_compl[p] n).factorization = n.factorization.erase p :=", "area": "Data"} {"task": "t8", "statement": "theorem dvd_ord_compl_of_dvd_not_dvd {p d n : ℕ} (hdn : d ∣ n) (hpd : ¬p ∣ d) : d ∣ ord_compl[p] n :=", "area": "Data"} {"task": "t8", "statement": "theorem dvd_iff_div_factorization_eq_tsub {d n : ℕ} (hd : d ≠ 0) (hdn : d ≤ n) : d ∣ n ↔ (n / d).factorization = n.factorization - d.factorization :=", "area": "Data"} {"task": "t8", "statement": "theorem ord_proj_dvd_ord_proj_of_dvd {a b : ℕ} (hb0 : b ≠ 0) (hab : a ∣ b) (p : ℕ) : ord_proj[p] a ∣ ord_proj[p] b :=", "area": "Data"} {"task": "t8", "statement": "theorem ord_proj_dvd_ord_proj_iff_dvd {a b : ℕ} (ha0 : a ≠ 0) (hb0 : b ≠ 0) : (∀ p : ℕ, ord_proj[p] a ∣ ord_proj[p] b) ↔ a ∣ b :=", "area": "Data"} {"task": "t8", "statement": "theorem ord_compl_dvd_ord_compl_of_dvd {a b : ℕ} (hab : a ∣ b) (p : ℕ) : ord_compl[p] a ∣ ord_compl[p] b :=", "area": "Data"} {"task": "t8", "statement": "theorem ord_compl_dvd_ord_compl_iff_dvd (a b : ℕ) : (∀ p : ℕ, ord_compl[p] a ∣ ord_compl[p] b) ↔ a ∣ b :=", "area": "Data"} {"task": "t8", "statement": "theorem dvd_iff_prime_pow_dvd_dvd (n d : ℕ) : d ∣ n ↔ ∀ p k : ℕ, Prime p → p ^ k ∣ d → p ^ k ∣ n :=", "area": "Data"} {"task": "t8", "statement": "theorem prod_primeFactors_dvd (n : ℕ) : ∏ p ∈ n.primeFactors, p ∣ n :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_gcd {a b : ℕ} (ha_pos : a ≠ 0) (hb_pos : b ≠ 0) : (gcd a b).factorization = a.factorization ⊓ b.factorization :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_lcm {a b : ℕ} (ha : a ≠ 0) (hb : b ≠ 0) : (a.lcm b).factorization = a.factorization ⊔ b.factorization :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma factorizationLCMLeft_zero_left : factorizationLCMLeft 0 b = 1 :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma factorizationLCMLeft_zero_right : factorizationLCMLeft a 0 = 1 :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma factorizationLCRight_zero_left : factorizationLCMRight 0 b = 1 :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma factorizationLCMRight_zero_right : factorizationLCMRight a 0 = 1 :=", "area": "Data"} {"task": "t8", "statement": "lemma factorizationLCMLeft_pos : 0 < factorizationLCMLeft a b :=", "area": "Data"} {"task": "t8", "statement": "lemma factorizationLCMRight_pos : 0 < factorizationLCMRight a b :=", "area": "Data"} {"task": "t8", "statement": "lemma coprime_factorizationLCMLeft_factorizationLCMRight : (factorizationLCMLeft a b).Coprime (factorizationLCMRight a b) :=", "area": "Data"} {"task": "t8", "statement": "lemma factorizationLCMLeft_mul_factorizationLCMRight (ha : a ≠ 0) (hb : b ≠ 0) : (factorizationLCMLeft a b) * (factorizationLCMRight a b) = lcm a b :=", "area": "Data"} {"task": "t8", "statement": "lemma factorizationLCMLeft_dvd_left : factorizationLCMLeft a b ∣ a :=", "area": "Data"} {"task": "t8", "statement": "lemma factorizationLCMRight_dvd_right : factorizationLCMRight a b ∣ b :=", "area": "Data"} {"task": "t8", "statement": "theorem prod_primeFactors_gcd_mul_prod_primeFactors_mul {β : Type*} [CommMonoid β] (m n : ℕ) (f : ℕ → β) : (m.gcd n).primeFactors.prod f * (m * n).primeFactors.prod f = m.primeFactors.prod f * n.primeFactors.prod f :=", "area": "Data"} {"task": "t8", "statement": "theorem setOf_pow_dvd_eq_Icc_factorization {n p : ℕ} (pp : p.Prime) (hn : n ≠ 0) : { i : ℕ | i ≠ 0 ∧ p ^ i ∣ n } = Set.Icc 1 (n.factorization p) :=", "area": "Data"} {"task": "t8", "statement": "theorem Icc_factorization_eq_pow_dvd (n : ℕ) {p : ℕ} (pp : Prime p) : Icc 1 (n.factorization p) = (Ico 1 n).filter fun i : ℕ => p ^ i ∣ n :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_eq_card_pow_dvd (n : ℕ) {p : ℕ} (pp : p.Prime) : n.factorization p = ((Ico 1 n).filter fun i => p ^ i ∣ n).card :=", "area": "Data"} {"task": "t8", "statement": "theorem Ico_filter_pow_dvd_eq {n p b : ℕ} (pp : p.Prime) (hn : n ≠ 0) (hb : n ≤ p ^ b) : ((Ico 1 n).filter fun i => p ^ i ∣ n) = (Icc 1 b).filter fun i => p ^ i ∣ n :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_mul_apply_of_coprime {p a b : ℕ} (hab : Coprime a b) : (a * b).factorization p = a.factorization p + b.factorization p :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_mul_of_coprime {a b : ℕ} (hab : Coprime a b) : (a * b).factorization = a.factorization + b.factorization :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_eq_of_coprime_left {p a b : ℕ} (hab : Coprime a b) (hpa : p ∈ a.factors) : (a * b).factorization p = a.factorization p :=", "area": "Data"} {"task": "t8", "statement": "theorem factorization_eq_of_coprime_right {p a b : ℕ} (hab : Coprime a b) (hpb : p ∈ b.factors) : (a * b).factorization p = b.factorization p :=", "area": "Data"} {"task": "t8", "statement": "theorem multiplicative_factorization {β : Type*} [CommMonoid β] (f : ℕ → β) (h_mult : ∀ x y : ℕ, Coprime x y → f (x * y) = f x * f y) (hf : f 1 = 1) : ∀ {n : ℕ}, n ≠ 0 → f n = n.factorization.prod fun p k => f (p ^ k) :=", "area": "Data"} {"task": "t8", "statement": "theorem multiplicative_factorization' {β : Type*} [CommMonoid β] (f : ℕ → β) (h_mult : ∀ x y : ℕ, Coprime x y → f (x * y) = f x * f y) (hf0 : f 0 = 1) (hf1 : f 1 = 1) : f n = n.factorization.prod fun p k => f (p ^ k) :=", "area": "Data"} {"task": "t8", "statement": "theorem eq_iff_prime_padicValNat_eq (a b : ℕ) (ha : a ≠ 0) (hb : b ≠ 0) : a = b ↔ ∀ p : ℕ, p.Prime → padicValNat p a = padicValNat p b :=", "area": "Data"} {"task": "t8", "statement": "theorem prod_pow_prime_padicValNat (n : Nat) (hn : n ≠ 0) (m : Nat) (pr : n < m) : (∏ p ∈ Finset.filter Nat.Prime (Finset.range m), p ^ padicValNat p n) = n :=", "area": "Data"} {"task": "t8", "statement": "theorem card_multiples (n p : ℕ) : card ((Finset.range n).filter fun e => p ∣ e + 1) = n / p :=", "area": "Data"} {"task": "t8", "statement": "theorem Ioc_filter_dvd_card_eq_div (n p : ℕ) : ((Ioc 0 n).filter fun x => p ∣ x).card = n / p :=", "area": "Data"} {"task": "t8", "statement": "lemma card_multiples' (N n : ℕ) : ((Finset.range N.succ).filter (fun k ↦ k ≠ 0 ∧ n ∣ k)).card = N / n :=", "area": "Data"} {"task": "t8", "statement": "theorem prod_factorial_pos : 0 < ∏ i ∈ s, (f i)! :=", "area": "Data"} {"task": "t8", "statement": "theorem prod_factorial_dvd_factorial_sum : (∏ i ∈ s, (f i)!) ∣ (∑ i ∈ s, f i)! :=", "area": "Data"} {"task": "t8", "statement": "theorem descFactorial_eq_prod_range (n : ℕ) : ∀ k, n.descFactorial k = ∏ i ∈ range k, (n - i)", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma IsZeckendorfRep_nil : IsZeckendorfRep [] :=", "area": "Data"} {"task": "t8", "statement": "lemma IsZeckendorfRep.sum_fib_lt : ∀ {n l}, IsZeckendorfRep l → (∀ a ∈ (l ++ [0]).head?, a < n) → (l.map fib).sum < fib n", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma greatestFib_eq_zero : greatestFib n = 0 ↔ n = 0 :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma greatestFib_pos : 0 < greatestFib n ↔ 0 < n :=", "area": "Data"} {"task": "t8", "statement": "lemma greatestFib_sub_fib_greatestFib_le_greatestFib (hn : n ≠ 0) : greatestFib (n - fib (greatestFib n)) ≤ greatestFib n - 2 :=", "area": "Data"} {"task": "t8", "statement": "lemma isZeckendorfRep_zeckendorf : ∀ n, (zeckendorf n).IsZeckendorfRep", "area": "Data"} {"task": "t8", "statement": "lemma zeckendorf_sum_fib : ∀ {l}, IsZeckendorfRep l → zeckendorf (l.map fib).sum = l", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma sum_zeckendorf_fib (n : ℕ) : (n.zeckendorf.map fib).sum = n :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma mk'_zero (d) (h : d ≠ 0) (w) : mk' 0 d h w = 0 :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma num_eq_zero {q : ℚ} : q.num = 0 ↔ q = 0 :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma num_nonneg : 0 ≤ q.num ↔ 0 ≤ q :=", "area": "Data"} {"task": "t8", "statement": "theorem divInt_eq_zero {a b : ℤ} (b0 : b ≠ 0) : a /. b = 0 ↔ a = 0 :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma divInt_self' {n : ℤ} (hn : n ≠ 0) : n /. n = 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem lift_binop_eq (f : ℚ → ℚ → ℚ) (f₁ : ℤ → ℤ → ℤ → ℤ → ℤ) (f₂ : ℤ → ℤ → ℤ → ℤ → ℤ) (fv : ∀ {n₁ d₁ h₁ c₁ n₂ d₂ h₂ c₂}, f ⟨n₁, d₁, h₁, c₁⟩ ⟨n₂, d₂, h₂, c₂⟩ = f₁ n₁ d₁ n₂ d₂ /. f₂ n₁ d₁ n₂ d₂) (f0 : ∀ {n₁ d₁ n₂ d₂}, d₁ ≠ 0 → d₂ ≠ 0 → f₂ n₁ d₁ n₂ d₂ ≠ 0) (a b c d : ℤ) (b0 : b ≠ 0) (d0 : d ≠ 0) (H : ∀ {n₁ d₁ n₂ d₂}, a * d₁ = n₁ * b → c * d₂ = n₂ * d → f₁ n₁ d₁ n₂ d₂ * f₂ a b c d = f₁ a b c d * f₂ n₁ d₁ n₂ d₂) : f (a /. b) (c /. d) = f₁ a b c d /. f₂ a b c d :=", "area": "Data"} {"task": "t8", "statement": "lemma neg_def (q : ℚ) : -q = -q.num /. q.den :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma divInt_mul_divInt' (n₁ d₁ n₂ d₂ : ℤ) : (n₁ /. d₁) * (n₂ /. d₂) = (n₁ * n₂) /. (d₁ * d₂) :=", "area": "Data"} {"task": "t8", "statement": "lemma mk'_mul_mk' (n₁ n₂ : ℤ) (d₁ d₂ : ℕ) (hd₁ hd₂ hnd₁ hnd₂) (h₁₂ : n₁.natAbs.Coprime d₂) (h₂₁ : n₂.natAbs.Coprime d₁) : mk' n₁ d₁ hd₁ hnd₁ * mk' n₂ d₂ hd₂ hnd₂ = mk' (n₁ * n₂) (d₁ * d₂) (Nat.mul_ne_zero hd₁ hd₂) (by rw [Int.natAbs_mul]; exact (hnd₁.mul h₂₁).mul_right (h₁₂.mul hnd₂)) :=", "area": "Data"} {"task": "t8", "statement": "lemma mul_eq_mkRat (q r : ℚ) : q * r = mkRat (q.num * r.num) (q.den * r.den) :=", "area": "Data"} {"task": "t8", "statement": "lemma pow_def (q : ℚ) (n : ℕ) : q ^ n = ⟨q.num ^ n, q.den ^ n, by simp [Nat.pow_eq_zero], by rw [Int.natAbs_pow]; exact q.reduced.pow _ _⟩ :=", "area": "Data"} {"task": "t8", "statement": "lemma pow_eq_mkRat (q : ℚ) (n : ℕ) : q ^ n = mkRat (q.num ^ n) (q.den ^ n) :=", "area": "Data"} {"task": "t8", "statement": "lemma pow_eq_divInt (q : ℚ) (n : ℕ) : q ^ n = q.num ^ n /. q.den ^ n :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma mk'_pow (num : ℤ) (den : ℕ) (hd hdn) (n : ℕ) : mk' num den hd hdn ^ n = mk' (num ^ n) (den ^ n) (by simp [Nat.pow_eq_zero, hd]) (by rw [Int.natAbs_pow]; exact hdn.pow _ _) :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma inv_mkRat (a : ℤ) (b : ℕ) : (mkRat a b)⁻¹ = b /. a :=", "area": "Data"} {"task": "t8", "statement": "lemma inv_def' (q : ℚ) : q⁻¹ = q.den /. q.num :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma divInt_div_divInt (n₁ d₁ n₂ d₂) : (n₁ /. d₁) / (n₂ /. d₂) = (n₁ * d₂) /. (d₁ * n₂) :=", "area": "Data"} {"task": "t8", "statement": "lemma div_def' (q r : ℚ) : q / r = (q.num * r.den) /. (q.den * r.num) :=", "area": "Data"} {"task": "t8", "statement": "protected lemma add_zero : a + 0 = a :=", "area": "Data"} {"task": "t8", "statement": "protected lemma zero_add : 0 + a = a :=", "area": "Data"} {"task": "t8", "statement": "protected lemma add_comm : a + b = b + a :=", "area": "Data"} {"task": "t8", "statement": "theorem add_assoc : a + b + c = a + (b + c) :=", "area": "Data"} {"task": "t8", "statement": "protected lemma add_left_neg : -a + a = 0 :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma divInt_one (n : ℤ) : n /. 1 = n :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma mkRat_one (n : ℤ) : mkRat n 1 = n :=", "area": "Data"} {"task": "t8", "statement": "lemma divInt_one_one : 1 /. 1 = 1 :=", "area": "Data"} {"task": "t8", "statement": "@[deprecated divInt_one (since := \"2024-03-18\")] lemma divInt_neg_one_one : -1 /. 1 = -1 :=", "area": "Data"} {"task": "t8", "statement": "theorem mul_assoc : a * b * c = a * (b * c) :=", "area": "Data"} {"task": "t8", "statement": "theorem add_mul : (a + b) * c = a * c + b * c :=", "area": "Data"} {"task": "t8", "statement": "theorem mul_add : a * (b + c) = a * b + a * c :=", "area": "Data"} {"task": "t8", "statement": "theorem zero_ne_one : 0 ≠ (1 : ℚ) :=", "area": "Data"} {"task": "t8", "statement": "theorem mul_inv_cancel : a ≠ 0 → a * a⁻¹ = 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem eq_iff_mul_eq_mul {p q : ℚ} : p = q ↔ p.num * q.den = q.num * p.den :=", "area": "Data"} {"task": "t8", "statement": "lemma zero_of_num_zero {q : ℚ} (hq : q.num = 0) : q = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem zero_iff_num_zero {q : ℚ} : q = 0 ↔ q.num = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem mk_num_ne_zero_of_ne_zero {q : ℚ} {n d : ℤ} (hq : q ≠ 0) (hqnd : q = n /. d) : n ≠ 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem mk_denom_ne_zero_of_ne_zero {q : ℚ} {n d : ℤ} (hq : q ≠ 0) (hqnd : q = n /. d) : d ≠ 0 :=", "area": "Data"} {"task": "t8", "statement": "protected lemma nonneg_antisymm : 0 ≤ q → 0 ≤ -q → q = 0 :=", "area": "Data"} {"task": "t8", "statement": "protected lemma nonneg_total (a : ℚ) : 0 ≤ a ∨ 0 ≤ -a :=", "area": "Data"} {"task": "t8", "statement": "theorem add_divInt (a b c : ℤ) : (a + b) /. c = a /. c + b /. c :=", "area": "Data"} {"task": "t8", "statement": "theorem divInt_eq_div (n d : ℤ) : n /. d = (n : ℚ) / d :=", "area": "Data"} {"task": "t8", "statement": "lemma intCast_div_eq_divInt (n d : ℤ) : (n : ℚ) / (d) = n /. d :=", "area": "Data"} {"task": "t8", "statement": "theorem divInt_mul_divInt_cancel {x : ℤ} (hx : x ≠ 0) (n d : ℤ) : n /. x * (x /. d) = n /. d :=", "area": "Data"} {"task": "t8", "statement": "theorem coe_int_num_of_den_eq_one {q : ℚ} (hq : q.den = 1) : (q.num : ℚ) = q :=", "area": "Data"} {"task": "t8", "statement": "lemma eq_num_of_isInt {q : ℚ} (h : q.isInt) : q = q.num :=", "area": "Data"} {"task": "t8", "statement": "theorem cast_inv_nat (n : ℕ) : ((n⁻¹ : ℚ) : α) = (n : α)⁻¹ :=", "area": "Data"} {"task": "t8", "statement": "theorem cast_inv_int (n : ℤ) : ((n⁻¹ : ℚ) : α) = (n : α)⁻¹ :=", "area": "Data"} {"task": "t8", "statement": "theorem cast_nnratCast {K} [DivisionRing K] (q : ℚ≥0) : ((q : ℚ) : K) = (q : K) :=", "area": "Data"} {"task": "t8", "statement": "theorem cast_ofScientific {K} [DivisionRing K] (m : ℕ) (s : Bool) (e : ℕ) : (OfScientific.ofScientific m s e : ℚ) = (OfScientific.ofScientific m s e : K) :=", "area": "Data"} {"task": "t8", "statement": "theorem cast_pow {K} [DivisionSemiring K] (q : ℚ≥0) (n : ℕ) : NNRat.cast (q ^ n) = (NNRat.cast q : K) ^ n :=", "area": "Data"} {"task": "t8", "statement": "theorem cast_zpow_of_ne_zero {K} [DivisionSemiring K] (q : ℚ≥0) (z : ℤ) (hq : (q.num : K) ≠ 0) : NNRat.cast (q ^ z) = (NNRat.cast q : K) ^ z :=", "area": "Data"} {"task": "t8", "statement": "@[simp, norm_cast] lemma cast_natCast (n : ℕ) : ((n : ℚ≥0) : α) = n :=", "area": "Data"} {"task": "t8", "statement": "lemma cast_commute (q : ℚ≥0) (a : α) : Commute (↑q) a :=", "area": "Data"} {"task": "t8", "statement": "@[norm_cast] lemma cast_divNat_of_ne_zero (a : ℕ) {b : ℕ} (hb : (b : α) ≠ 0) : divNat a b = (a / b : α) :=", "area": "Data"} {"task": "t8", "statement": "@[norm_cast] lemma cast_add_of_ne_zero (hq : (q.den : α) ≠ 0) (hr : (r.den : α) ≠ 0) : ↑(q + r) = (q + r : α) :=", "area": "Data"} {"task": "t8", "statement": "@[norm_cast] lemma cast_mul_of_ne_zero (hq : (q.den : α) ≠ 0) (hr : (r.den : α) ≠ 0) : ↑(q * r) = (q * r : α) :=", "area": "Data"} {"task": "t8", "statement": "@[norm_cast] lemma cast_inv_of_ne_zero (hq : (q.num : α) ≠ 0) : (q⁻¹ : ℚ≥0) = (q⁻¹ : α) :=", "area": "Data"} {"task": "t8", "statement": "@[norm_cast] lemma cast_div_of_ne_zero (hq : (q.den : α) ≠ 0) (hr : (r.num : α) ≠ 0) : ↑(q / r) = (q / r : α) :=", "area": "Data"} {"task": "t8", "statement": "theorem cast_intCast (n : ℤ) : ((n : ℚ) : α) = n :=", "area": "Data"} {"task": "t8", "statement": "theorem cast_natCast (n : ℕ) : ((n : ℚ) : α) = n :=", "area": "Data"} {"task": "t8", "statement": "@[simp, norm_cast] lemma cast_ofNat (n : ℕ) [n.AtLeastTwo] : ((no_index (OfNat.ofNat n : ℚ)) : α) = (OfNat.ofNat n : α) :=", "area": "Data"} {"task": "t8", "statement": "theorem cast_commute (r : ℚ) (a : α) : Commute (↑r) a :=", "area": "Data"} {"task": "t8", "statement": "@[norm_cast] lemma cast_divInt_of_ne_zero (a : ℤ) {b : ℤ} (b0 : (b : α) ≠ 0) : (a /. b : α) = a / b :=", "area": "Data"} {"task": "t8", "statement": "@[norm_cast] lemma cast_mkRat_of_ne_zero (a : ℤ) {b : ℕ} (hb : (b : α) ≠ 0) : (mkRat a b : α) = a / b :=", "area": "Data"} {"task": "t8", "statement": "@[norm_cast] lemma cast_add_of_ne_zero {q r : ℚ} (hq : (q.den : α) ≠ 0) (hr : (r.den : α) ≠ 0) : (q + r : ℚ) = (q + r : α) :=", "area": "Data"} {"task": "t8", "statement": "@[simp, norm_cast] lemma cast_neg (q : ℚ) : ↑(-q) = (-q : α) :=", "area": "Data"} {"task": "t8", "statement": "@[norm_cast] lemma cast_sub_of_ne_zero (hp : (p.den : α) ≠ 0) (hq : (q.den : α) ≠ 0) : ↑(p - q) = (p - q : α) :=", "area": "Data"} {"task": "t8", "statement": "@[norm_cast] lemma cast_mul_of_ne_zero (hp : (p.den : α) ≠ 0) (hq : (q.den : α) ≠ 0) : ↑(p * q) = (p * q : α) :=", "area": "Data"} {"task": "t8", "statement": "@[norm_cast] lemma cast_inv_of_ne_zero (hq : (q.num : α) ≠ 0) : ↑(q⁻¹) = (q⁻¹ : α) :=", "area": "Data"} {"task": "t8", "statement": "@[norm_cast] lemma cast_div_of_ne_zero (hp : (p.den : α) ≠ 0) (hq : (q.num : α) ≠ 0) : ↑(p / q) = (p / q : α) :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma map_nnratCast [DivisionSemiring α] [DivisionSemiring β] [RingHomClass F α β] (f : F) (q : ℚ≥0) : f q = q :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma eq_nnratCast [DivisionSemiring α] [FunLike F ℚ≥0 α] [RingHomClass F ℚ≥0 α] (f : F) (q : ℚ≥0) : f q = q :=", "area": "Data"} {"task": "t8", "statement": "theorem map_ratCast [DivisionRing α] [DivisionRing β] [RingHomClass F α β] (f : F) (q : ℚ) : f q = q :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma eq_ratCast [DivisionRing α] [FunLike F ℚ α] [RingHomClass F ℚ α] (f : F) (q : ℚ) : f q = q :=", "area": "Data"} {"task": "t8", "statement": "theorem ext_rat' (h : ∀ m : ℤ, f m = g m) : f = g :=", "area": "Data"} {"task": "t8", "statement": "theorem ext_rat_on_pnat (same_on_neg_one : f (-1) = g (-1)) (same_on_pnat : ∀ n : ℕ, 0 < n → f n = g n) : f = g :=", "area": "Data"} {"task": "t8", "statement": "theorem map₂_def {α β γ : Type u} (f : α → β → γ) (a : Option α) (b : Option β) : map₂ f a b = f <$> a <*> b :=", "area": "Data"} {"task": "t8", "statement": "theorem map₂_none_right (f : α → β → γ) (a : Option α) : map₂ f a none = none :=", "area": "Data"} {"task": "t8", "statement": "theorem map₂_coe_right (f : α → β → γ) (a : Option α) (b : β) : map₂ f a b = a.map fun a => f a b :=", "area": "Data"} {"task": "t8", "statement": "theorem mem_map₂_iff {c : γ} : c ∈ map₂ f a b ↔ ∃ a' b', a' ∈ a ∧ b' ∈ b ∧ f a' b' = c :=", "area": "Data"} {"task": "t8", "statement": "theorem map₂_eq_none_iff : map₂ f a b = none ↔ a = none ∨ b = none :=", "area": "Data"} {"task": "t8", "statement": "theorem map₂_swap (f : α → β → γ) (a : Option α) (b : Option β) : map₂ f a b = map₂ (fun a b => f b a) b a :=", "area": "Data"} {"task": "t8", "statement": "theorem map_map₂ (f : α → β → γ) (g : γ → δ) : (map₂ f a b).map g = map₂ (fun a b => g (f a b)) a b :=", "area": "Data"} {"task": "t8", "statement": "theorem map₂_map_left (f : γ → β → δ) (g : α → γ) : map₂ f (a.map g) b = map₂ (fun a b => f (g a) b) a b :=", "area": "Data"} {"task": "t8", "statement": "theorem map₂_map_right (f : α → γ → δ) (g : β → γ) : map₂ f a (b.map g) = map₂ (fun a b => f a (g b)) a b :=", "area": "Data"} {"task": "t8", "statement": "theorem map_uncurry (f : α → β → γ) (x : Option (α × β)) : x.map (uncurry f) = map₂ f (x.map Prod.fst) (x.map Prod.snd) :=", "area": "Data"} {"task": "t8", "statement": "theorem map₂_assoc {f : δ → γ → ε} {g : α → β → δ} {f' : α → ε' → ε} {g' : β → γ → ε'} (h_assoc : ∀ a b c, f (g a b) c = f' a (g' b c)) : map₂ f (map₂ g a b) c = map₂ f' a (map₂ g' b c) :=", "area": "Data"} {"task": "t8", "statement": "theorem map₂_comm {g : β → α → γ} (h_comm : ∀ a b, f a b = g b a) : map₂ f a b = map₂ g b a :=", "area": "Data"} {"task": "t8", "statement": "theorem map₂_left_comm {f : α → δ → ε} {g : β → γ → δ} {f' : α → γ → δ'} {g' : β → δ' → ε} (h_left_comm : ∀ a b c, f a (g b c) = g' b (f' a c)) : map₂ f a (map₂ g b c) = map₂ g' b (map₂ f' a c) :=", "area": "Data"} {"task": "t8", "statement": "theorem map₂_right_comm {f : δ → γ → ε} {g : α → β → δ} {f' : α → γ → δ'} {g' : δ' → β → ε} (h_right_comm : ∀ a b c, f (g a b) c = g' (f' a c) b) : map₂ f (map₂ g a b) c = map₂ g' (map₂ f' a c) b :=", "area": "Data"} {"task": "t8", "statement": "theorem map_map₂_distrib {g : γ → δ} {f' : α' → β' → δ} {g₁ : α → α'} {g₂ : β → β'} (h_distrib : ∀ a b, g (f a b) = f' (g₁ a) (g₂ b)) : (map₂ f a b).map g = map₂ f' (a.map g₁) (b.map g₂) :=", "area": "Data"} {"task": "t8", "statement": "theorem map_map₂_distrib_left {g : γ → δ} {f' : α' → β → δ} {g' : α → α'} (h_distrib : ∀ a b, g (f a b) = f' (g' a) b) : (map₂ f a b).map g = map₂ f' (a.map g') b :=", "area": "Data"} {"task": "t8", "statement": "theorem map_map₂_distrib_right {g : γ → δ} {f' : α → β' → δ} {g' : β → β'} (h_distrib : ∀ a b, g (f a b) = f' a (g' b)) : (map₂ f a b).map g = map₂ f' a (b.map g') :=", "area": "Data"} {"task": "t8", "statement": "theorem map₂_map_left_comm {f : α' → β → γ} {g : α → α'} {f' : α → β → δ} {g' : δ → γ} (h_left_comm : ∀ a b, f (g a) b = g' (f' a b)) : map₂ f (a.map g) b = (map₂ f' a b).map g' :=", "area": "Data"} {"task": "t8", "statement": "theorem map_map₂_right_comm {f : α → β' → γ} {g : β → β'} {f' : α → β → δ} {g' : δ → γ} (h_right_comm : ∀ a b, f a (g b) = g' (f' a b)) : map₂ f a (b.map g) = (map₂ f' a b).map g' :=", "area": "Data"} {"task": "t8", "statement": "theorem map_map₂_antidistrib {g : γ → δ} {f' : β' → α' → δ} {g₁ : β → β'} {g₂ : α → α'} (h_antidistrib : ∀ a b, g (f a b) = f' (g₁ b) (g₂ a)) : (map₂ f a b).map g = map₂ f' (b.map g₁) (a.map g₂) :=", "area": "Data"} {"task": "t8", "statement": "theorem map_map₂_antidistrib_left {g : γ → δ} {f' : β' → α → δ} {g' : β → β'} (h_antidistrib : ∀ a b, g (f a b) = f' (g' b) a) : (map₂ f a b).map g = map₂ f' (b.map g') a :=", "area": "Data"} {"task": "t8", "statement": "theorem map_map₂_antidistrib_right {g : γ → δ} {f' : β → α' → δ} {g' : α → α'} (h_antidistrib : ∀ a b, g (f a b) = f' b (g' a)) : (map₂ f a b).map g = map₂ f' b (a.map g') :=", "area": "Data"} {"task": "t8", "statement": "theorem map₂_map_left_anticomm {f : α' → β → γ} {g : α → α'} {f' : β → α → δ} {g' : δ → γ} (h_left_anticomm : ∀ a b, f (g a) b = g' (f' b a)) : map₂ f (a.map g) b = (map₂ f' b a).map g' :=", "area": "Data"} {"task": "t8", "statement": "theorem map_map₂_right_anticomm {f : α → β' → γ} {g : β → β'} {f' : β → α → δ} {g' : δ → γ} (h_right_anticomm : ∀ a b, f a (g b) = g' (f' b a)) : map₂ f a (b.map g) = (map₂ f' b a).map g' :=", "area": "Data"} {"task": "t8", "statement": "lemma map₂_left_identity {f : α → β → β} {a : α} (h : ∀ b, f a b = b) (o : Option β) : map₂ f (some a) o = o :=", "area": "Data"} {"task": "t8", "statement": "lemma map₂_right_identity {f : α → β → α} {b : β} (h : ∀ a, f a b = a) (o : Option α) : map₂ f o (some b) = o :=", "area": "Data"} {"task": "t8", "statement": "theorem AbsoluteValue.map_units_int (abv : AbsoluteValue ℤ S) (x : ℤˣ) : abv x = 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem AbsoluteValue.map_units_intCast [Nontrivial R] (abv : AbsoluteValue R S) (x : ℤˣ) : abv ((x : ℤ) : R) = 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem AbsoluteValue.map_units_int_smul (abv : AbsoluteValue R S) (x : ℤˣ) (y : R) : abv (x • y) = abv y :=", "area": "Data"} {"task": "t8", "statement": "theorem log_of_right_le_one (b : ℕ) {r : R} (hr : r ≤ 1) : log b r = -Nat.clog b ⌈r⁻¹⌉₊ :=", "area": "Data"} {"task": "t8", "statement": "theorem log_natCast (b : ℕ) (n : ℕ) : log b (n : R) = Nat.log b n :=", "area": "Data"} {"task": "t8", "statement": "theorem log_of_left_le_one {b : ℕ} (hb : b ≤ 1) (r : R) : log b r = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem log_of_right_le_zero (b : ℕ) {r : R} (hr : r ≤ 0) : log b r = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem zpow_log_le_self {b : ℕ} {r : R} (hb : 1 < b) (hr : 0 < r) : (b : R) ^ log b r ≤ r :=", "area": "Data"} {"task": "t8", "statement": "theorem lt_zpow_succ_log_self {b : ℕ} (hb : 1 < b) (r : R) : r < (b : R) ^ (log b r + 1) :=", "area": "Data"} {"task": "t8", "statement": "theorem log_one_right (b : ℕ) : log b (1 : R) = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem log_zpow {b : ℕ} (hb : 1 < b) (z : ℤ) : log b ((b : R) ^ z : R) = z :=", "area": "Data"} {"task": "t8", "statement": "theorem log_mono_right {b : ℕ} {r₁ r₂ : R} (h₀ : 0 < r₁) (h : r₁ ≤ r₂) : log b r₁ ≤ log b r₂ :=", "area": "Data"} {"task": "t8", "statement": "theorem clog_of_right_le_one (b : ℕ) {r : R} (hr : r ≤ 1) : clog b r = -Nat.log b ⌊r⁻¹⌋₊ :=", "area": "Data"} {"task": "t8", "statement": "theorem clog_of_right_le_zero (b : ℕ) {r : R} (hr : r ≤ 0) : clog b r = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem clog_inv (b : ℕ) (r : R) : clog b r⁻¹ = -log b r :=", "area": "Data"} {"task": "t8", "statement": "theorem log_inv (b : ℕ) (r : R) : log b r⁻¹ = -clog b r :=", "area": "Data"} {"task": "t8", "statement": "theorem neg_log_inv_eq_clog (b : ℕ) (r : R) : -log b r⁻¹ = clog b r :=", "area": "Data"} {"task": "t8", "statement": "theorem neg_clog_inv_eq_log (b : ℕ) (r : R) : -clog b r⁻¹ = log b r :=", "area": "Data"} {"task": "t8", "statement": "theorem clog_natCast (b : ℕ) (n : ℕ) : clog b (n : R) = Nat.clog b n :=", "area": "Data"} {"task": "t8", "statement": "theorem clog_of_left_le_one {b : ℕ} (hb : b ≤ 1) (r : R) : clog b r = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem self_le_zpow_clog {b : ℕ} (hb : 1 < b) (r : R) : r ≤ (b : R) ^ clog b r :=", "area": "Data"} {"task": "t8", "statement": "theorem zpow_pred_clog_lt_self {b : ℕ} {r : R} (hb : 1 < b) (hr : 0 < r) : (b : R) ^ (clog b r - 1) < r :=", "area": "Data"} {"task": "t8", "statement": "theorem clog_one_right (b : ℕ) : clog b (1 : R) = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem clog_zpow {b : ℕ} (hb : 1 < b) (z : ℤ) : clog b ((b : R) ^ z : R) = z :=", "area": "Data"} {"task": "t8", "statement": "theorem clog_mono_right {b : ℕ} {r₁ r₂ : R} (h₀ : 0 < r₁) (h : r₁ ≤ r₂) : clog b r₁ ≤ clog b r₂ :=", "area": "Data"} {"task": "t8", "statement": "theorem noMinOrder_iff [LT α] [LT β] : NoMinOrder (Sum α β) ↔ NoMinOrder α ∧ NoMinOrder β :=", "area": "Data"} {"task": "t8", "statement": "theorem noMaxOrder_iff [LT α] [LT β] : NoMaxOrder (Sum α β) ↔ NoMaxOrder α ∧ NoMaxOrder β :=", "area": "Data"} {"task": "t8", "statement": "theorem denselyOrdered_iff [LT α] [LT β] : DenselyOrdered (Sum α β) ↔ DenselyOrdered α ∧ DenselyOrdered β :=", "area": "Data"} {"task": "t8", "statement": "theorem nextOr_cons_of_ne (xs : List α) (y x d : α) (h : x ≠ y) : nextOr (y :: xs) x d = nextOr xs x d :=", "area": "Data"} {"task": "t8", "statement": "theorem nextOr_eq_nextOr_of_mem_of_ne (xs : List α) (x d d' : α) (x_mem : x ∈ xs) (x_ne : x ≠ xs.getLast (ne_nil_of_mem x_mem)) : nextOr xs x d = nextOr xs x d' :=", "area": "Data"} {"task": "t8", "statement": "theorem mem_of_nextOr_ne {xs : List α} {x d : α} (h : nextOr xs x d ≠ d) : x ∈ xs :=", "area": "Data"} {"task": "t8", "statement": "theorem nextOr_concat {xs : List α} {x : α} (d : α) (h : x ∉ xs) : nextOr (xs ++ [x]) x d = d :=", "area": "Data"} {"task": "t8", "statement": "theorem nextOr_mem {xs : List α} {x d : α} (hd : d ∈ xs) : nextOr xs x d ∈ xs :=", "area": "Data"} {"task": "t8", "statement": "theorem next_cons_cons_eq' (y z : α) (h : x ∈ y :: z :: l) (hx : x = y) : next (y :: z :: l) x h = z :=", "area": "Data"} {"task": "t8", "statement": "theorem next_ne_head_ne_getLast (h : x ∈ l) (y : α) (h : x ∈ y :: l) (hy : x ≠ y) (hx : x ≠ getLast (y :: l) (cons_ne_nil _ _)) : next (y :: l) x h = next l x (by simpa [hy] using h) :=", "area": "Data"} {"task": "t8", "statement": "theorem next_cons_concat (y : α) (hy : x ≠ y) (hx : x ∉ l) (h : x ∈ y :: l ++ [x] := mem_append_right _ (mem_singleton_self x)) : next (y :: l ++ [x]) x h = y :=", "area": "Data"} {"task": "t8", "statement": "theorem next_getLast_cons (h : x ∈ l) (y : α) (h : x ∈ y :: l) (hy : x ≠ y) (hx : x = getLast (y :: l) (cons_ne_nil _ _)) (hl : Nodup l) : next (y :: l) x h = y :=", "area": "Data"} {"task": "t8", "statement": "theorem prev_getLast_cons' (y : α) (hxy : x ∈ y :: l) (hx : x = y) : prev (y :: l) x hxy = getLast (y :: l) (cons_ne_nil _ _) :=", "area": "Data"} {"task": "t8", "statement": "theorem prev_cons_cons_eq' (y z : α) (h : x ∈ y :: z :: l) (hx : x = y) : prev (y :: z :: l) x h = getLast (z :: l) (cons_ne_nil _ _) :=", "area": "Data"} {"task": "t8", "statement": "theorem prev_cons_cons_of_ne' (y z : α) (h : x ∈ y :: z :: l) (hy : x ≠ y) (hz : x = z) : prev (y :: z :: l) x h = y :=", "area": "Data"} {"task": "t8", "statement": "theorem prev_ne_cons_cons (y z : α) (h : x ∈ y :: z :: l) (hy : x ≠ y) (hz : x ≠ z) : prev (y :: z :: l) x h = prev (z :: l) x (by simpa [hy] using h) :=", "area": "Data"} {"task": "t8", "statement": "theorem prev_mem (h : x ∈ l) : l.prev x h ∈ l :=", "area": "Data"} {"task": "t8", "statement": "theorem next_get : ∀ (l : List α) (_h : Nodup l) (i : Fin l.length), next l (l.get i) (get_mem _ _ _) = l.get ⟨(i + 1) % l.length, Nat.mod_lt _ (i.1.zero_le.trans_lt i.2)⟩", "area": "Data"} {"task": "t8", "statement": "theorem prev_nthLe (l : List α) (h : Nodup l) (n : ℕ) (hn : n < l.length) : prev l (l.nthLe n hn) (nthLe_mem _ _ _) = l.nthLe ((n + (l.length - 1)) % l.length) (Nat.mod_lt _ (n.zero_le.trans_lt hn)) :=", "area": "Data"} {"task": "t8", "statement": "theorem pmap_next_eq_rotate_one (h : Nodup l) : (l.pmap l.next fun _ h => h) = l.rotate 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem pmap_prev_eq_rotate_length_sub_one (h : Nodup l) : (l.pmap l.prev fun _ h => h) = l.rotate (l.length - 1) :=", "area": "Data"} {"task": "t8", "statement": "theorem prev_next (l : List α) (h : Nodup l) (x : α) (hx : x ∈ l) : prev l (next l x hx) (next_mem _ _ _) = x :=", "area": "Data"} {"task": "t8", "statement": "theorem next_prev (l : List α) (h : Nodup l) (x : α) (hx : x ∈ l) : next l (prev l x hx) (prev_mem _ _ _) = x :=", "area": "Data"} {"task": "t8", "statement": "theorem prev_reverse_eq_next (l : List α) (h : Nodup l) (x : α) (hx : x ∈ l) : prev l.reverse x (mem_reverse.mpr hx) = next l x hx :=", "area": "Data"} {"task": "t8", "statement": "theorem next_reverse_eq_prev (l : List α) (h : Nodup l) (x : α) (hx : x ∈ l) : next l.reverse x (mem_reverse.mpr hx) = prev l x hx :=", "area": "Data"} {"task": "t8", "statement": "theorem isRotated_next_eq {l l' : List α} (h : l ~r l') (hn : Nodup l) {x : α} (hx : x ∈ l) : l.next x hx = l'.next x (h.mem_iff.mp hx) :=", "area": "Data"} {"task": "t8", "statement": "theorem isRotated_prev_eq {l l' : List α} (h : l ~r l') (hn : Nodup l) {x : α} (hx : x ∈ l) : l.prev x hx = l'.prev x (h.mem_iff.mp hx) :=", "area": "Data"} {"task": "t8", "statement": "theorem coe_cons_eq_coe_append (l : List α) (a : α) : (↑(a :: l) : Cycle α) = (↑(l ++ [a]) : Cycle α) :=", "area": "Data"} {"task": "t8", "statement": "theorem induction_on {C : Cycle α → Prop} (s : Cycle α) (H0 : C nil) (HI : ∀ (a) (l : List α), C ↑l → C ↑(a :: l)) : C s :=", "area": "Data"} {"task": "t8", "statement": "theorem reverse_reverse (s : Cycle α) : s.reverse.reverse = s :=", "area": "Data"} {"task": "t8", "statement": "theorem subsingleton_reverse_iff {s : Cycle α} : s.reverse.Subsingleton ↔ s.Subsingleton :=", "area": "Data"} {"task": "t8", "statement": "theorem Subsingleton.congr {s : Cycle α} (h : Subsingleton s) : ∀ ⦃x⦄ (_hx : x ∈ s) ⦃y⦄ (_hy : y ∈ s), x = y :=", "area": "Data"} {"task": "t8", "statement": "theorem nontrivial_coe_nodup_iff {l : List α} (hl : l.Nodup) : Nontrivial (l : Cycle α) ↔ 2 ≤ l.length :=", "area": "Data"} {"task": "t8", "statement": "theorem nontrivial_reverse_iff {s : Cycle α} : s.reverse.Nontrivial ↔ s.Nontrivial :=", "area": "Data"} {"task": "t8", "statement": "theorem length_nontrivial {s : Cycle α} (h : Nontrivial s) : 2 ≤ length s :=", "area": "Data"} {"task": "t8", "statement": "theorem Subsingleton.nodup {s : Cycle α} (h : Subsingleton s) : Nodup s :=", "area": "Data"} {"task": "t8", "statement": "theorem Nodup.nontrivial_iff {s : Cycle α} (h : Nodup s) : Nontrivial s ↔ ¬Subsingleton s :=", "area": "Data"} {"task": "t8", "statement": "theorem card_toMultiset (s : Cycle α) : Multiset.card s.toMultiset = s.length :=", "area": "Data"} {"task": "t8", "statement": "theorem toMultiset_eq_nil {s : Cycle α} : s.toMultiset = 0 ↔ s = Cycle.nil :=", "area": "Data"} {"task": "t8", "statement": "theorem map_eq_nil {β : Type*} (f : α → β) (s : Cycle α) : map f s = nil ↔ s = nil :=", "area": "Data"} {"task": "t8", "statement": "theorem mem_map {β : Type*} {f : α → β} {b : β} {s : Cycle α} : b ∈ s.map f ↔ ∃ a, a ∈ s ∧ f a = b :=", "area": "Data"} {"task": "t8", "statement": "theorem mem_lists_iff_coe_eq {s : Cycle α} {l : List α} : l ∈ s.lists ↔ (l : Cycle α) = s :=", "area": "Data"} {"task": "t8", "statement": "theorem lists_nil : lists (@nil α) = [([] : List α)] :=", "area": "Data"} {"task": "t8", "statement": "theorem toFinset_eq_nil {s : Cycle α} : s.toFinset = ∅ ↔ s = Cycle.nil :=", "area": "Data"} {"task": "t8", "statement": "theorem next_reverse_eq_prev (s : Cycle α) (hs : Nodup s) (x : α) (hx : x ∈ s) : s.reverse.next (nodup_reverse_iff.mpr hs) x (mem_reverse_iff.mpr hx) = s.prev hs x hx :=", "area": "Data"} {"task": "t8", "statement": "theorem next_reverse_eq_prev' (s : Cycle α) (hs : Nodup s.reverse) (x : α) (hx : x ∈ s.reverse) : s.reverse.next hs x hx = s.prev (nodup_reverse_iff.mp hs) x (mem_reverse_iff.mp hx) :=", "area": "Data"} {"task": "t8", "statement": "theorem next_mem (s : Cycle α) (hs : Nodup s) (x : α) (hx : x ∈ s) : s.next hs x hx ∈ s :=", "area": "Data"} {"task": "t8", "statement": "theorem prev_mem (s : Cycle α) (hs : Nodup s) (x : α) (hx : x ∈ s) : s.prev hs x hx ∈ s :=", "area": "Data"} {"task": "t8", "statement": "theorem Chain.nil (r : α → α → Prop) : Cycle.Chain r (@nil α) :=", "area": "Data"} {"task": "t8", "statement": "theorem chain_singleton (r : α → α → Prop) (a : α) : Chain r [a] ↔ r a a :=", "area": "Data"} {"task": "t8", "statement": "theorem chain_ne_nil (r : α → α → Prop) {l : List α} : ∀ hl : l ≠ [], Chain r l ↔ List.Chain r (getLast l hl) l :=", "area": "Data"} {"task": "t8", "statement": "theorem chain_map {β : Type*} {r : α → α → Prop} (f : β → α) {s : Cycle β} : Chain r (s.map f) ↔ Chain (fun a b => r (f a) (f b)) s :=", "area": "Data"} {"task": "t8", "statement": "theorem chain_range_succ (r : ℕ → ℕ → Prop) (n : ℕ) : Chain r (List.range n.succ) ↔ r n 0 ∧ ∀ m < n, r m m.succ :=", "area": "Data"} {"task": "t8", "statement": "theorem Chain.imp {r₁ r₂ : α → α → Prop} (H : ∀ a b, r₁ a b → r₂ a b) (p : Chain r₁ s) : Chain r₂ s :=", "area": "Data"} {"task": "t8", "statement": "theorem chain_of_pairwise : (∀ a ∈ s, ∀ b ∈ s, r a b) → Chain r s :=", "area": "Data"} {"task": "t8", "statement": "theorem chain_iff_pairwise [IsTrans α r] : Chain r s ↔ ∀ a ∈ s, ∀ b ∈ s, r a b :=", "area": "Data"} {"task": "t8", "statement": "theorem Chain.eq_nil_of_irrefl [IsTrans α r] [IsIrrefl α r] (h : Chain r s) : s = Cycle.nil :=", "area": "Data"} {"task": "t8", "statement": "theorem forall_eq_of_chain [IsTrans α r] [IsAntisymm α r] (hs : Chain r s) {a b : α} (ha : a ∈ s) (hb : b ∈ s) : a = b :=", "area": "Data"} {"task": "t8", "statement": "theorem getD_eq_get {n : ℕ} (hn : n < l.length) : l.getD n d = l.get ⟨n, hn⟩ :=", "area": "Data"} {"task": "t8", "statement": "theorem getD_map {n : ℕ} (f : α → β) : (map f l).getD n (f d) = f (l.getD n d) :=", "area": "Data"} {"task": "t8", "statement": "theorem getD_eq_default {n : ℕ} (hn : l.length ≤ n) : l.getD n d = d :=", "area": "Data"} {"task": "t8", "statement": "theorem getElem?_getD_singleton_default_eq (n : ℕ) : [d][n]?.getD d = d :=", "area": "Data"} {"task": "t8", "statement": "theorem getElem?_getD_replicate_default_eq (r n : ℕ) : (replicate r d)[n]?.getD d = d :=", "area": "Data"} {"task": "t8", "statement": "theorem getD_append (l l' : List α) (d : α) (n : ℕ) (h : n < l.length) : (l ++ l').getD n d = l.getD n d :=", "area": "Data"} {"task": "t8", "statement": "theorem getD_append_right (l l' : List α) (d : α) (n : ℕ) (h : l.length ≤ n) : (l ++ l').getD n d = l'.getD (n - l.length) d :=", "area": "Data"} {"task": "t8", "statement": "theorem getD_eq_getD_get? (n : ℕ) : l.getD n d = (l.get? n).getD d :=", "area": "Data"} {"task": "t8", "statement": "theorem getI_eq_iget_get? (n : ℕ) : l.getI n = (l.get? n).iget :=", "area": "Data"} {"task": "t8", "statement": "theorem getI_zero_eq_headI : l.getI 0 = l.headI :=", "area": "Data"} {"task": "t8", "statement": "theorem tfae_singleton (p) : TFAE [p] :=", "area": "Data"} {"task": "t8", "statement": "theorem tfae_cons_of_mem {a b} {l : List Prop} (h : b ∈ l) : TFAE (a :: l) ↔ (a ↔ b) ∧ TFAE l :=", "area": "Data"} {"task": "t8", "statement": "theorem tfae_cons_self {a} {l : List Prop} : TFAE (a :: a :: l) ↔ TFAE (a :: l) :=", "area": "Data"} {"task": "t8", "statement": "theorem tfae_of_cycle {a b} {l : List Prop} (h_chain : List.Chain (· → ·) a (b :: l)) (h_last : getLastD l b → a) : TFAE (a :: b :: l) :=", "area": "Data"} {"task": "t8", "statement": "theorem forall_tfae {α : Type*} (l : List (α → Prop)) (H : ∀ a : α, (l.map (fun p ↦ p a)).TFAE) : (l.map (fun p ↦ ∀ a, p a)).TFAE :=", "area": "Data"} {"task": "t8", "statement": "theorem exists_tfae {α : Type*} (l : List (α → Prop)) (H : ∀ a : α, (l.map (fun p ↦ p a)).TFAE) : (l.map (fun p ↦ ∃ a, p a)).TFAE :=", "area": "Data"} {"task": "t8", "statement": "theorem tfae_not_iff {l : List Prop} : TFAE (l.map Not) ↔ TFAE l :=", "area": "Data"} {"task": "t8", "statement": "theorem lt_iff_le_and_exists : p < q ↔ p ≤ q ∧ ∃ x ∈ q, x ∉ p :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma length_replicate (n : ℕ) (c : Char) : (replicate n c).length = n :=", "area": "Data"} {"task": "t8", "statement": "lemma length_eq_list_length (l : List Char) : (String.mk l).length = l.length :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma leftpad_length (n : ℕ) (c : Char) : ∀ (s : String), (leftpad n c s).length = max n s.length", "area": "Data"} {"task": "t8", "statement": "lemma leftpad_prefix (n : ℕ) (c : Char) : ∀ s, IsPrefix (replicate (n - length s) c) (leftpad n c s)", "area": "Data"} {"task": "t8", "statement": "lemma leftpad_suffix (n : ℕ) (c : Char) : ∀ s, IsSuffix s (leftpad n c s)", "area": "Data"} {"task": "t8", "statement": "theorem Finite.toFinset_eq_toFinset {s : Set α} [Fintype s] (h : s.Finite) : h.toFinset = s.toFinset :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.exists_finset {s : Set α} (h : s.Finite) : ∃ s' : Finset α, ∀ a : α, a ∈ s' ↔ a ∈ s :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.exists_finset_coe {s : Set α} (h : s.Finite) : ∃ s' : Finset α, ↑s' = s :=", "area": "Data"} {"task": "t8", "statement": "theorem toFinset_nonempty : hs.toFinset.Nonempty ↔ s.Nonempty :=", "area": "Data"} {"task": "t8", "statement": "theorem coeSort_toFinset : ↥hs.toFinset = ↥s :=", "area": "Data"} {"task": "t8", "statement": "theorem toFinset_subset {t : Finset α} : hs.toFinset ⊆ t ↔ s ⊆ t :=", "area": "Data"} {"task": "t8", "statement": "theorem toFinset_ssubset {t : Finset α} : hs.toFinset ⊂ t ↔ s ⊂ t :=", "area": "Data"} {"task": "t8", "statement": "theorem subset_toFinset {s : Finset α} : s ⊆ ht.toFinset ↔ ↑s ⊆ t :=", "area": "Data"} {"task": "t8", "statement": "theorem ssubset_toFinset {s : Finset α} : s ⊂ ht.toFinset ↔ ↑s ⊂ t :=", "area": "Data"} {"task": "t8", "statement": "theorem toFinset_subset_toFinset : hs.toFinset ⊆ ht.toFinset ↔ s ⊆ t :=", "area": "Data"} {"task": "t8", "statement": "theorem toFinset_ssubset_toFinset : hs.toFinset ⊂ ht.toFinset ↔ s ⊂ t :=", "area": "Data"} {"task": "t8", "statement": "theorem toFinset_setOf [Fintype α] (p : α → Prop) [DecidablePred p] (h : { x | p x }.Finite) : h.toFinset = Finset.univ.filter p :=", "area": "Data"} {"task": "t8", "statement": "theorem toFinset_inter [DecidableEq α] (hs : s.Finite) (ht : t.Finite) (h : (s ∩ t).Finite) : h.toFinset = hs.toFinset ∩ ht.toFinset :=", "area": "Data"} {"task": "t8", "statement": "theorem toFinset_union [DecidableEq α] (hs : s.Finite) (ht : t.Finite) (h : (s ∪ t).Finite) : h.toFinset = hs.toFinset ∪ ht.toFinset :=", "area": "Data"} {"task": "t8", "statement": "theorem toFinset_diff [DecidableEq α] (hs : s.Finite) (ht : t.Finite) (h : (s \\ t).Finite) : h.toFinset = hs.toFinset \\ ht.toFinset :=", "area": "Data"} {"task": "t8", "statement": "theorem toFinset_symmDiff [DecidableEq α] (hs : s.Finite) (ht : t.Finite) (h : (s ∆ t).Finite) : h.toFinset = hs.toFinset ∆ ht.toFinset :=", "area": "Data"} {"task": "t8", "statement": "theorem toFinset_compl [DecidableEq α] [Fintype α] (hs : s.Finite) (h : sᶜ.Finite) : h.toFinset = hs.toFinsetᶜ :=", "area": "Data"} {"task": "t8", "statement": "theorem toFinset_univ [Fintype α] (h : (Set.univ : Set α).Finite) : h.toFinset = Finset.univ :=", "area": "Data"} {"task": "t8", "statement": "theorem toFinset_empty (h : (∅ : Set α).Finite) : h.toFinset = ∅ :=", "area": "Data"} {"task": "t8", "statement": "theorem toFinset_image [DecidableEq β] (f : α → β) (hs : s.Finite) (h : (f '' s).Finite) : h.toFinset = hs.toFinset.image f :=", "area": "Data"} {"task": "t8", "statement": "theorem toFinset_range [DecidableEq α] [Fintype β] (f : β → α) (h : (range f).Finite) : h.toFinset = Finset.univ.image f :=", "area": "Data"} {"task": "t8", "statement": "theorem Equiv.set_finite_iff {s : Set α} {t : Set β} (hst : s ≃ t) : s.Finite ↔ t.Finite :=", "area": "Data"} {"task": "t8", "statement": "theorem finite_toSet_toFinset (s : Finset α) : s.finite_toSet.toFinset = s :=", "area": "Data"} {"task": "t8", "statement": "theorem finite_toSet (s : Multiset α) : { x | x ∈ s }.Finite :=", "area": "Data"} {"task": "t8", "statement": "theorem finite_toSet_toFinset [DecidableEq α] (s : Multiset α) : s.finite_toSet.toFinset = s.toFinset :=", "area": "Data"} {"task": "t8", "statement": "theorem subset (s : Set α) {t : Set α} [Finite s] (h : t ⊆ s) : Finite t :=", "area": "Data"} {"task": "t8", "statement": "theorem finite_biUnion {ι : Type*} (s : Set ι) [Finite s] (t : ι → Set α) (H : ∀ i ∈ s, Finite (t i)) : Finite (⋃ x ∈ s, t x) :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.subset {s : Set α} (hs : s.Finite) {t : Set α} (ht : t ⊆ s) : t.Finite :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.union {s t : Set α} (hs : s.Finite) (ht : t.Finite) : (s ∪ t).Finite :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.finite_of_compl {s : Set α} (hs : s.Finite) (hsc : sᶜ.Finite) : Finite α :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.biUnion' {ι} {s : Set ι} (hs : s.Finite) {t : ∀ i ∈ s, Set α} (ht : ∀ i (hi : i ∈ s), (t i hi).Finite) : (⋃ i ∈ s, t i ‹_›).Finite :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.sUnion {s : Set (Set α)} (hs : s.Finite) (H : ∀ t ∈ s, Set.Finite t) : (⋃₀ s).Finite :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.iUnion {ι : Type*} {s : ι → Set α} {t : Set ι} (ht : t.Finite) (hs : ∀ i ∈ t, (s i).Finite) (he : ∀ i, i ∉ t → s i = ∅) : (⋃ i, s i).Finite :=", "area": "Data"} {"task": "t8", "statement": "theorem Infinite.nonempty {s : Set α} (h : s.Infinite) : s.Nonempty :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.image {s : Set α} (f : α → β) (hs : s.Finite) : (f '' s).Finite :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.dependent_image {s : Set α} (hs : s.Finite) (F : ∀ i ∈ s, β) : {y : β | ∃ x hx, F x hx = y}.Finite :=", "area": "Data"} {"task": "t8", "statement": "theorem finite_of_finite_preimage (h : (f ⁻¹' s).Finite) (hs : s ⊆ range f) : s.Finite :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.surjOn_iff_bijOn_of_mapsTo : SurjOn f s s ↔ BijOn f s s :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.injOn_iff_bijOn_of_mapsTo : InjOn f s ↔ BijOn f s s :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.prod (hs : s.Finite) (ht : t.Finite) : (s ×ˢ t : Set (α × β)).Finite :=", "area": "Data"} {"task": "t8", "statement": "theorem infinite_prod : (s ×ˢ t).Infinite ↔ s.Infinite ∧ t.Nonempty ∨ t.Infinite ∧ s.Nonempty :=", "area": "Data"} {"task": "t8", "statement": "theorem finite_prod : (s ×ˢ t).Finite ↔ (s.Finite ∨ t = ∅) ∧ (t.Finite ∨ s = ∅) :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.image2 (f : α → β → γ) (hs : s.Finite) (ht : t.Finite) : (image2 f s t).Finite :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.finite_subsets {α : Type u} {a : Set α} (h : a.Finite) : { b | b ⊆ a }.Finite :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.pi (ht : ∀ i, (t i).Finite) : (pi univ t).Finite :=", "area": "Data"} {"task": "t8", "statement": "lemma Finite.pi' (ht : ∀ i, (t i).Finite) : {f : ∀ i, κ i | ∀ i, f i ∈ t i}.Finite :=", "area": "Data"} {"task": "t8", "statement": "theorem union_finset_finite_of_range_finite (f : α → Finset β) (h : (range f).Finite) : (⋃ a, (f a : Set β)).Finite :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.toFinset_insert [DecidableEq α] {s : Set α} {a : α} (hs : (insert a s).Finite) : hs.toFinset = insert a (hs.subset <| subset_insert _ _).toFinset :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.toFinset_prod {s : Set α} {t : Set β} (hs : s.Finite) (ht : t.Finite) : hs.toFinset ×ˢ ht.toFinset = (hs.prod ht).toFinset :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.toFinset_offDiag {s : Set α} [DecidableEq α] (hs : s.Finite) : hs.offDiag.toFinset = hs.toFinset.offDiag :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.fin_embedding {s : Set α} (h : s.Finite) : ∃ (n : ℕ) (f : Fin n ↪ α), range f = s :=", "area": "Data"} {"task": "t8", "statement": "theorem finite_subset_iUnion {s : Set α} (hs : s.Finite) {ι} {t : ι → Set α} (h : s ⊆ ⋃ i, t i) : ∃ I : Set ι, I.Finite ∧ s ⊆ ⋃ i ∈ I, t i :=", "area": "Data"} {"task": "t8", "statement": "theorem eq_finite_iUnion_of_finite_subset_iUnion {ι} {s : ι → Set α} {t : Set α} (tfin : t.Finite) (h : t ⊆ ⋃ i, s i) : ∃ I : Set ι, I.Finite ∧ ∃ σ : { i | i ∈ I } → Set α, (∀ i, (σ i).Finite) ∧ (∀ i, σ i ⊆ s i) ∧ t = ⋃ i, σ i :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.induction_on {C : Set α → Prop} {s : Set α} (h : s.Finite) (H0 : C ∅) (H1 : ∀ {a s}, a ∉ s → Set.Finite s → C s → C (insert a s)) : C s :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.induction_on' {C : Set α → Prop} {S : Set α} (h : S.Finite) (H0 : C ∅) (H1 : ∀ {a s}, a ∈ S → s ⊆ S → a ∉ s → C s → C (insert a s)) : C S :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.induction_to {C : Set α → Prop} {S : Set α} (h : S.Finite) (S0 : Set α) (hS0 : S0 ⊆ S) (H0 : C S0) (H1 : ∀ s ⊂ S, C s → ∃ a ∈ S \\ s, C (insert a s)) : C S :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.induction_to_univ [Finite α] {C : Set α → Prop} (S0 : Set α) (H0 : C S0) (H1 : ∀ S ≠ univ, C S → ∃ a ∉ S, C (insert a S)) : C univ :=", "area": "Data"} {"task": "t8", "statement": "theorem seq_of_forall_finite_exists {γ : Type*} {P : γ → Set γ → Prop} (h : ∀ t : Set γ, t.Finite → ∃ c, P c t) : ∃ u : ℕ → γ, ∀ n, P (u n) (u '' Iio n) :=", "area": "Data"} {"task": "t8", "statement": "theorem empty_card' {h : Fintype.{u} (∅ : Set α)} : @Fintype.card (∅ : Set α) h = 0 :=", "area": "Data"} {"task": "t8", "statement": "theorem card_fintypeInsertOfNotMem {a : α} (s : Set α) [Fintype s] (h : a ∉ s) : @Fintype.card _ (fintypeInsertOfNotMem s h) = Fintype.card s + 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem card_insert {a : α} (s : Set α) [Fintype s] (h : a ∉ s) {d : Fintype.{u} (insert a s : Set α)} : @Fintype.card _ d = Fintype.card s + 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem card_image_of_inj_on {s : Set α} [Fintype s] {f : α → β} [Fintype (f '' s)] (H : ∀ x ∈ s, ∀ y ∈ s, f x = f y → x = y) : Fintype.card (f '' s) = Fintype.card s :=", "area": "Data"} {"task": "t8", "statement": "theorem card_ne_eq [Fintype α] (a : α) [Fintype { x : α | x ≠ a }] : Fintype.card { x : α | x ≠ a } = Fintype.card α - 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem infinite_univ_iff : (@univ α).Infinite ↔ Infinite α :=", "area": "Data"} {"task": "t8", "statement": "lemma Infinite.exists_not_mem_finite (hs : s.Infinite) (ht : t.Finite) : ∃ a, a ∈ s ∧ a ∉ t :=", "area": "Data"} {"task": "t8", "statement": "lemma Finite.exists_not_mem (hs : s.Finite) : ∃ a, a ∉ s :=", "area": "Data"} {"task": "t8", "statement": "theorem Infinite.exists_subset_card_eq {s : Set α} (hs : s.Infinite) (n : ℕ) : ∃ t : Finset α, ↑t ⊆ s ∧ t.card = n :=", "area": "Data"} {"task": "t8", "statement": "theorem infinite_of_finite_compl [Infinite α] {s : Set α} (hs : sᶜ.Finite) : s.Infinite :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.infinite_compl [Infinite α] {s : Set α} (hs : s.Finite) : sᶜ.Infinite :=", "area": "Data"} {"task": "t8", "statement": "theorem infinite_union {s t : Set α} : (s ∪ t).Infinite ↔ s.Infinite ∨ t.Infinite :=", "area": "Data"} {"task": "t8", "statement": "theorem infinite_range_iff {f : α → β} (hi : Injective f) : (range f).Infinite ↔ Infinite α :=", "area": "Data"} {"task": "t8", "statement": "theorem infinite_image2 (hfs : ∀ b ∈ t, InjOn (fun a => f a b) s) (hft : ∀ a ∈ s, InjOn (f a) t) : (image2 f s t).Infinite ↔ s.Infinite ∧ t.Nonempty ∨ t.Infinite ∧ s.Nonempty :=", "area": "Data"} {"task": "t8", "statement": "lemma finite_image2 (hfs : ∀ b ∈ t, InjOn (f · b) s) (hft : ∀ a ∈ s, InjOn (f a) t) : (image2 f s t).Finite ↔ s.Finite ∧ t.Finite ∨ s = ∅ ∨ t = ∅ :=", "area": "Data"} {"task": "t8", "statement": "theorem Infinite.exists_ne_map_eq_of_mapsTo {s : Set α} {t : Set β} {f : α → β} (hs : s.Infinite) (hf : MapsTo f s t) (ht : t.Finite) : ∃ x ∈ s, ∃ y ∈ s, x ≠ y ∧ f x = f y :=", "area": "Data"} {"task": "t8", "statement": "theorem infinite_range_of_injective [Infinite α] {f : α → β} (hi : Injective f) : (range f).Infinite :=", "area": "Data"} {"task": "t8", "statement": "theorem infinite_of_injective_forall_mem [Infinite α] {s : Set β} {f : α → β} (hi : Injective f) (hf : ∀ x : α, f x ∈ s) : s.Infinite :=", "area": "Data"} {"task": "t8", "statement": "theorem not_injOn_infinite_finite_image {f : α → β} {s : Set α} (h_inf : s.Infinite) (h_fin : (f '' s).Finite) : ¬InjOn f s :=", "area": "Data"} {"task": "t8", "statement": "theorem infinite_of_forall_exists_gt (h : ∀ a, ∃ b ∈ s, a < b) : s.Infinite :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.exists_lt_map_eq_of_forall_mem [LinearOrder α] [Infinite α] {t : Set β} {f : α → β} (hf : ∀ a, f a ∈ t) (ht : t.Finite) : ∃ a b, a < b ∧ f a = f b :=", "area": "Data"} {"task": "t8", "statement": "theorem exists_min_image [LinearOrder β] (s : Set α) (f : α → β) (h1 : s.Finite) : s.Nonempty → ∃ a ∈ s, ∀ b ∈ s, f a ≤ f b", "area": "Data"} {"task": "t8", "statement": "theorem exists_max_image [LinearOrder β] (s : Set α) (f : α → β) (h1 : s.Finite) : s.Nonempty → ∃ a ∈ s, ∀ b ∈ s, f b ≤ f a", "area": "Data"} {"task": "t8", "statement": "theorem exists_lower_bound_image [Nonempty α] [LinearOrder β] (s : Set α) (f : α → β) (h : s.Finite) : ∃ a : α, ∀ b ∈ s, f a ≤ f b :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.iSup_biInf_of_monotone {ι ι' α : Type*} [Preorder ι'] [Nonempty ι'] [IsDirected ι' (· ≤ ·)] [Order.Frame α] {s : Set ι} (hs : s.Finite) {f : ι → ι' → α} (hf : ∀ i ∈ s, Monotone (f i)) : ⨆ j, ⨅ i ∈ s, f i j = ⨅ i ∈ s, ⨆ j, f i j :=", "area": "Data"} {"task": "t8", "statement": "theorem iSup_iInf_of_monotone {ι ι' α : Type*} [Finite ι] [Preorder ι'] [Nonempty ι'] [IsDirected ι' (· ≤ ·)] [Order.Frame α] {f : ι → ι' → α} (hf : ∀ i, Monotone (f i)) : ⨆ j, ⨅ i, f i j = ⨅ i, ⨆ j, f i j :=", "area": "Data"} {"task": "t8", "statement": "theorem iUnion_pi_of_monotone {ι ι' : Type*} [LinearOrder ι'] [Nonempty ι'] {α : ι → Type*} {I : Set ι} {s : ∀ i, ι' → Set (α i)} (hI : I.Finite) (hs : ∀ i ∈ I, Monotone (s i)) : ⋃ j : ι', I.pi (fun i => s i j) = I.pi fun i => ⋃ j, s i j :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.exists_maximal_wrt [PartialOrder β] (f : α → β) (s : Set α) (h : s.Finite) (hs : s.Nonempty) : ∃ a ∈ s, ∀ a' ∈ s, f a ≤ f a' → f a = f a' :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.exists_maximal_wrt' [PartialOrder β] (f : α → β) (s : Set α) (h : (f '' s).Finite) (hs : s.Nonempty) : (∃ a ∈ s, ∀ (a' : α), a' ∈ s → f a ≤ f a' → f a = f a') :=", "area": "Data"} {"task": "t8", "statement": "theorem Finite.bddAbove_biUnion {I : Set β} {S : β → Set α} (H : I.Finite) : BddAbove (⋃ i ∈ I, S i) ↔ ∀ i ∈ I, BddAbove (S i) :=", "area": "Data"} {"task": "t8", "statement": "lemma exists_card_eq [Infinite α] : ∀ n : ℕ, ∃ s : Finset α, s.card = n", "area": "Data"} {"task": "t8", "statement": "lemma Finite.of_forall_not_lt_lt (h : ∀ ⦃x y z : α⦄, x < y → y < z → False) : Finite α :=", "area": "Data"} {"task": "t8", "statement": "lemma Set.finite_of_forall_not_lt_lt (h : ∀ x ∈ s, ∀ y ∈ s, ∀ z ∈ s, x < y → y < z → False) : Set.Finite s :=", "area": "Data"} {"task": "t8", "statement": "lemma Set.finite_diff_iUnion_Ioo' (s : Set α) : (s \\ ⋃ x : s × s, Ioo x.1 x.2).Finite :=", "area": "Data"} {"task": "t8", "statement": "lemma Directed.exists_mem_subset_of_finset_subset_biUnion {α ι : Type*} [Nonempty ι] {f : ι → Set α} (h : Directed (· ⊆ ·) f) {s : Finset α} (hs : (s : Set α) ⊆ ⋃ i, f i) : ∃ i, (s : Set α) ⊆ f i :=", "area": "Data"} {"task": "t8", "statement": "theorem DirectedOn.exists_mem_subset_of_finset_subset_biUnion {α ι : Type*} {f : ι → Set α} {c : Set ι} (hn : c.Nonempty) (hc : DirectedOn (fun i j => f i ⊆ f j) c) {s : Finset α} (hs : (s : Set α) ⊆ ⋃ i ∈ c, f i) : ∃ i ∈ c, (s : Set α) ⊆ f i :=", "area": "Data"} {"task": "t8", "statement": "theorem v_eq_succ_vp : u.v = succ₂ u.vp :=", "area": "Data"} {"task": "t8", "statement": "theorem isSpecial_iff : u.IsSpecial ↔ u.IsSpecial' :=", "area": "Data"} {"task": "t8", "statement": "theorem flip_isReduced : (flip u).IsReduced ↔ u.IsReduced :=", "area": "Data"} {"task": "t8", "statement": "theorem flip_isSpecial : (flip u).IsSpecial ↔ u.IsSpecial :=", "area": "Data"} {"task": "t8", "statement": "theorem flip_v : (flip u).v = u.v.swap :=", "area": "Data"} {"task": "t8", "statement": "theorem qp_eq (hr : u.r = 0) : u.q = u.qp + 1 :=", "area": "Data"} {"task": "t8", "statement": "theorem start_isSpecial (a b : ℕ+) : (start a b).IsSpecial :=", "area": "Data"} {"task": "t8", "statement": "theorem start_v (a b : ℕ+) : (start a b).v = ⟨a, b⟩ :=", "area": "Data"} {"task": "t8", "statement": "theorem finish_isReduced : u.finish.IsReduced :=", "area": "Data"} {"task": "t8", "statement": "theorem finish_isSpecial (hs : u.IsSpecial) : u.finish.IsSpecial :=", "area": "Data"} {"task": "t8", "statement": "theorem finish_v (hr : u.r = 0) : u.finish.v = u.v :=", "area": "Data"} {"task": "t8", "statement": "theorem step_wf (hr : u.r ≠ 0) : SizeOf.sizeOf u.step < SizeOf.sizeOf u :=", "area": "Data"} {"task": "t8", "statement": "theorem step_isSpecial (hs : u.IsSpecial) : u.step.IsSpecial :=", "area": "Data"} {"task": "t8", "statement": "theorem step_v (hr : u.r ≠ 0) : u.step.v = u.v.swap :=", "area": "Data"} {"task": "t8", "statement": "theorem reduce_a {u : XgcdType} (h : u.r = 0) : u.reduce = u.finish :=", "area": "Data"} {"task": "t8", "statement": "theorem reduce_b {u : XgcdType} (h : u.r ≠ 0) : u.reduce = u.step.reduce.flip :=", "area": "Data"} {"task": "t8", "statement": "theorem reduce_isReduced : ∀ u : XgcdType, u.reduce.IsReduced", "area": "Data"} {"task": "t8", "statement": "theorem reduce_isSpecial : ∀ u : XgcdType, u.IsSpecial → u.reduce.IsSpecial", "area": "Data"} {"task": "t8", "statement": "theorem reduce_v : ∀ u : XgcdType, u.reduce.v = u.v", "area": "Data"} {"task": "t8", "statement": "theorem gcdA'_coe : (gcdA' a b : ℕ) = gcdW a b + gcdX a b :=", "area": "Data"} {"task": "t8", "statement": "theorem gcdB'_coe : (gcdB' a b : ℕ) = gcdY a b + gcdZ a b :=", "area": "Data"} {"task": "t8", "statement": "theorem gcd_props : let d := gcdD a b let w := gcdW a b let x := gcdX a b let y := gcdY a b let z := gcdZ a b let a' := gcdA' a b let b' := gcdB' a b w * z = succPNat (x * y) ∧ a = a' * d ∧ b = b' * d ∧ z * a' = succPNat (x * b') ∧ w * b' = succPNat (y * a') ∧ (z * a : ℕ) = x * b + d ∧ (w * b : ℕ) = y * a + d :=", "area": "Data"} {"task": "t8", "statement": "theorem gcd_eq : gcdD a b = gcd a b :=", "area": "Data"} {"task": "t8", "statement": "theorem sup_add (s₁ s₂ : Multiset α) : (s₁ + s₂).sup = s₁.sup ⊔ s₂.sup :=", "area": "Data"} {"task": "t8", "statement": "theorem sup_le {s : Multiset α} {a : α} : s.sup ≤ a ↔ ∀ b ∈ s, b ≤ a :=", "area": "Data"} {"task": "t8", "statement": "theorem sup_ndunion (s₁ s₂ : Multiset α) : (ndunion s₁ s₂).sup = s₁.sup ⊔ s₂.sup :=", "area": "Data"} {"task": "t8", "statement": "theorem sup_union (s₁ s₂ : Multiset α) : (s₁ ∪ s₂).sup = s₁.sup ⊔ s₂.sup :=", "area": "Data"} {"task": "t8", "statement": "theorem sup_ndinsert (a : α) (s : Multiset α) : (ndinsert a s).sup = a ⊔ s.sup :=", "area": "Data"} {"task": "t8", "statement": "theorem nodup_sup_iff {α : Type*} [DecidableEq α] {m : Multiset (Multiset α)} : m.sup.Nodup ↔ ∀ a : Multiset α, a ∈ m → a.Nodup :=", "area": "Data"} {"task": "t8", "statement": "theorem inf_add (s₁ s₂ : Multiset α) : (s₁ + s₂).inf = s₁.inf ⊓ s₂.inf :=", "area": "Data"} {"task": "t8", "statement": "theorem le_inf {s : Multiset α} {a : α} : a ≤ s.inf ↔ ∀ b ∈ s, a ≤ b :=", "area": "Data"} {"task": "t8", "statement": "theorem inf_ndunion (s₁ s₂ : Multiset α) : (ndunion s₁ s₂).inf = s₁.inf ⊓ s₂.inf :=", "area": "Data"} {"task": "t8", "statement": "theorem inf_union (s₁ s₂ : Multiset α) : (s₁ ∪ s₂).inf = s₁.inf ⊓ s₂.inf :=", "area": "Data"} {"task": "t8", "statement": "theorem inf_ndinsert (a : α) (s : Multiset α) : (ndinsert a s).inf = a ⊓ s.inf :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma fromColumns_toColumns (A : Matrix m (n₁ ⊕ n₂) R) : fromColumns A.toColumns₁ A.toColumns₂ = A :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma fromRows_toRows (A : Matrix (m₁ ⊕ m₂) n R) : fromRows A.toRows₁ A.toRows₂ = A :=", "area": "Data"} {"task": "t8", "statement": "lemma fromRows_inj : Function.Injective2 (@fromRows R m₁ m₂ n) :=", "area": "Data"} {"task": "t8", "statement": "lemma fromColumns_inj : Function.Injective2 (@fromColumns R m n₁ n₂) :=", "area": "Data"} {"task": "t8", "statement": "lemma transpose_fromColumns (A₁ : Matrix m n₁ R) (A₂ : Matrix m n₂ R) : transpose (fromColumns A₁ A₂) = fromRows (transpose A₁) (transpose A₂) :=", "area": "Data"} {"task": "t8", "statement": "lemma transpose_fromRows (A₁ : Matrix m₁ n R) (A₂ : Matrix m₂ n R) : transpose (fromRows A₁ A₂) = fromColumns (transpose A₁) (transpose A₂) :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma fromRows_neg (A₁ : Matrix m₁ n R) (A₂ : Matrix m₂ n R) : -fromRows A₁ A₂ = fromRows (-A₁) (-A₂) :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma fromColumns_neg (A₁ : Matrix n m₁ R) (A₂ : Matrix n m₂ R) : -fromColumns A₁ A₂ = fromColumns (-A₁) (-A₂) :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma fromRows_mulVec (A₁ : Matrix m₁ n R) (A₂ : Matrix m₂ n R) (v : n → R) : fromRows A₁ A₂ *ᵥ v = Sum.elim (A₁ *ᵥ v) (A₂ *ᵥ v) :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma vecMul_fromColumns (B₁ : Matrix m n₁ R) (B₂ : Matrix m n₂ R) (v : m → R) : v ᵥ* fromColumns B₁ B₂ = Sum.elim (v ᵥ* B₁) (v ᵥ* B₂) :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma sum_elim_vecMul_fromRows (B₁ : Matrix m₁ n R) (B₂ : Matrix m₂ n R) (v₁ : m₁ → R) (v₂ : m₂ → R) : Sum.elim v₁ v₂ ᵥ* fromRows B₁ B₂ = v₁ ᵥ* B₁ + v₂ ᵥ* B₂ :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma fromColumns_mulVec_sum_elim (A₁ : Matrix m n₁ R) (A₂ : Matrix m n₂ R) (v₁ : n₁ → R) (v₂ : n₂ → R) : fromColumns A₁ A₂ *ᵥ Sum.elim v₁ v₂ = A₁ *ᵥ v₁ + A₂ *ᵥ v₂ :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma fromRows_mul (A₁ : Matrix m₁ n R) (A₂ : Matrix m₂ n R) (B : Matrix n m R) : fromRows A₁ A₂ * B = fromRows (A₁ * B) (A₂ * B) :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma mul_fromColumns (A : Matrix m n R) (B₁ : Matrix n n₁ R) (B₂ : Matrix n n₂ R) : A * fromColumns B₁ B₂ = fromColumns (A * B₁) (A * B₂) :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma fromRows_zero : fromRows (0 : Matrix m₁ n R) (0 : Matrix m₂ n R) = 0 :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma fromColumns_zero : fromColumns (0 : Matrix m n₁ R) (0 : Matrix m n₂ R) = 0 :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma fromColumns_fromRows_eq_fromBlocks (B₁₁ : Matrix m₁ n₁ R) (B₁₂ : Matrix m₁ n₂ R) (B₂₁ : Matrix m₂ n₁ R) (B₂₂ : Matrix m₂ n₂ R) : fromColumns (fromRows B₁₁ B₂₁) (fromRows B₁₂ B₂₂) = fromBlocks B₁₁ B₁₂ B₂₁ B₂₂ :=", "area": "Data"} {"task": "t8", "statement": "@[simp] lemma fromRows_fromColumn_eq_fromBlocks (B₁₁ : Matrix m₁ n₁ R) (B₁₂ : Matrix m₁ n₂ R) (B₂₁ : Matrix m₂ n₁ R) (B₂₂ : Matrix m₂ n₂ R) : fromRows (fromColumns B₁₁ B₁₂) (fromColumns B₂₁ B₂₂) = fromBlocks B₁₁ B₁₂ B₂₁ B₂₂ :=", "area": "Data"} {"task": "t8", "statement": "lemma fromRows_mul_fromColumns (A₁ : Matrix m₁ n R) (A₂ : Matrix m₂ n R) (B₁ : Matrix n n₁ R) (B₂ : Matrix n n₂ R) : (fromRows A₁ A₂) * (fromColumns B₁ B₂) = fromBlocks (A₁ * B₁) (A₁ * B₂) (A₂ * B₁) (A₂ * B₂) :=", "area": "Data"} {"task": "t8", "statement": "lemma fromColumns_mul_fromRows (A₁ : Matrix m n₁ R) (A₂ : Matrix m n₂ R) (B₁ : Matrix n₁ n R) (B₂ : Matrix n₂ n R) : fromColumns A₁ A₂ * fromRows B₁ B₂ = (A₁ * B₁ + A₂ * B₂) :=", "area": "Data"} {"task": "t8", "statement": "lemma fromColumns_mul_fromBlocks (A₁ : Matrix m m₁ R) (A₂ : Matrix m m₂ R) (B₁₁ : Matrix m₁ n₁ R) (B₁₂ : Matrix m₁ n₂ R) (B₂₁ : Matrix m₂ n₁ R) (B₂₂ : Matrix m₂ n₂ R) : (fromColumns A₁ A₂) * fromBlocks B₁₁ B₁₂ B₂₁ B₂₂ = fromColumns (A₁ * B₁₁ + A₂ * B₂₁) (A₁ * B₁₂ + A₂ * B₂₂) :=", "area": "Data"} {"task": "t8", "statement": "lemma fromBlocks_mul_fromRows (A₁ : Matrix n₁ n R) (A₂ : Matrix n₂ n R) (B₁₁ : Matrix m₁ n₁ R) (B₁₂ : Matrix m₁ n₂ R) (B₂₁ : Matrix m₂ n₁ R) (B₂₂ : Matrix m₂ n₂ R) : fromBlocks B₁₁ B₁₂ B₂₁ B₂₂ * (fromRows A₁ A₂) = fromRows (B₁₁ * A₁ + B₁₂ * A₂) (B₂₁ * A₁ + B₂₂ * A₂) :=", "area": "Data"} {"task": "t8", "statement": "lemma fromColumns_mul_fromRows_eq_one_comm (e : n ≃ n₁ ⊕ n₂) (A₁ : Matrix n n₁ R) (A₂ : Matrix n n₂ R) (B₁ : Matrix n₁ n R) (B₂ : Matrix n₂ n R) : fromColumns A₁ A₂ * fromRows B₁ B₂ = 1 ↔ fromRows B₁ B₂ * fromColumns A₁ A₂ = 1 :=", "area": "Data"} {"task": "t8", "statement": "lemma conjTranspose_fromColumns_eq_fromRows_conjTranspose (A₁ : Matrix m n₁ R) (A₂ : Matrix m n₂ R) : conjTranspose (fromColumns A₁ A₂) = fromRows (conjTranspose A₁) (conjTranspose A₂) :=", "area": "Data"} {"task": "t8", "statement": "lemma conjTranspose_fromRows_eq_fromColumns_conjTranspose (A₁ : Matrix m₁ n R) (A₂ : Matrix m₂ n R) : conjTranspose (fromRows A₁ A₂) = fromColumns (conjTranspose A₁) (conjTranspose A₂) :=", "area": "Data"} {"task": "t8", "statement": "theorem BlankExtends.refl {Γ} [Inhabited Γ] (l : List Γ) : BlankExtends l l :=", "area": "Computability"} {"task": "t8", "statement": "theorem BlankExtends.trans {Γ} [Inhabited Γ] {l₁ l₂ l₃ : List Γ} : BlankExtends l₁ l₂ → BlankExtends l₂ l₃ → BlankExtends l₁ l₃ :=", "area": "Computability"} {"task": "t8", "statement": "theorem BlankExtends.below_of_le {Γ} [Inhabited Γ] {l l₁ l₂ : List Γ} : BlankExtends l l₁ → BlankExtends l l₂ → l₁.length ≤ l₂.length → BlankExtends l₁ l₂ :=", "area": "Computability"} {"task": "t8", "statement": "theorem BlankExtends.above_of_le {Γ} [Inhabited Γ] {l l₁ l₂ : List Γ} : BlankExtends l₁ l → BlankExtends l₂ l → l₁.length ≤ l₂.length → BlankExtends l₁ l₂ :=", "area": "Computability"} {"task": "t8", "statement": "theorem BlankRel.trans {Γ} [Inhabited Γ] {l₁ l₂ l₃ : List Γ} : BlankRel l₁ l₂ → BlankRel l₂ l₃ → BlankRel l₁ l₃ :=", "area": "Computability"} {"task": "t8", "statement": "theorem ListBlank.cons_head_tail {Γ} [Inhabited Γ] : ∀ l : ListBlank Γ, l.tail.cons l.head = l :=", "area": "Computability"} {"task": "t8", "statement": "theorem ListBlank.nth_zero {Γ} [Inhabited Γ] (l : ListBlank Γ) : l.nth 0 = l.head :=", "area": "Computability"} {"task": "t8", "statement": "theorem ListBlank.nth_succ {Γ} [Inhabited Γ] (l : ListBlank Γ) (n : ℕ) : l.nth (n + 1) = l.tail.nth n :=", "area": "Computability"} {"task": "t8", "statement": "theorem ListBlank.ext {Γ} [i : Inhabited Γ] {L₁ L₂ : ListBlank Γ} : (∀ i, L₁.nth i = L₂.nth i) → L₁ = L₂ :=", "area": "Computability"} {"task": "t8", "statement": "theorem ListBlank.nth_modifyNth {Γ} [Inhabited Γ] (f : Γ → Γ) (n i) (L : ListBlank Γ) : (L.modifyNth f n).nth i = if i = n then f (L.nth i) else L.nth i :=", "area": "Computability"} {"task": "t8", "statement": "theorem PointedMap.headI_map {Γ Γ'} [Inhabited Γ] [Inhabited Γ'] (f : PointedMap Γ Γ') (l : List Γ) : (l.map f).headI = f l.headI :=", "area": "Computability"} {"task": "t8", "statement": "theorem ListBlank.head_map {Γ Γ'} [Inhabited Γ] [Inhabited Γ'] (f : PointedMap Γ Γ') (l : ListBlank Γ) : (l.map f).head = f l.head :=", "area": "Computability"} {"task": "t8", "statement": "theorem ListBlank.tail_map {Γ Γ'} [Inhabited Γ] [Inhabited Γ'] (f : PointedMap Γ Γ') (l : ListBlank Γ) : (l.map f).tail = l.tail.map f :=", "area": "Computability"} {"task": "t8", "statement": "theorem ListBlank.map_cons {Γ Γ'} [Inhabited Γ] [Inhabited Γ'] (f : PointedMap Γ Γ') (l : ListBlank Γ) (a : Γ) : (l.cons a).map f = (l.map f).cons (f a) :=", "area": "Computability"} {"task": "t8", "statement": "theorem ListBlank.nth_map {Γ Γ'} [Inhabited Γ] [Inhabited Γ'] (f : PointedMap Γ Γ') (l : ListBlank Γ) (n : ℕ) : (l.map f).nth n = f (l.nth n) :=", "area": "Computability"} {"task": "t8", "statement": "theorem proj_map_nth {ι : Type*} {Γ : ι → Type*} [∀ i, Inhabited (Γ i)] (i : ι) (L n) : (ListBlank.map (@proj ι Γ _ i) L).nth n = L.nth n i :=", "area": "Computability"} {"task": "t8", "statement": "theorem ListBlank.map_modifyNth {Γ Γ'} [Inhabited Γ] [Inhabited Γ'] (F : PointedMap Γ Γ') (f : Γ → Γ) (f' : Γ' → Γ') (H : ∀ x, F (f x) = f' (F x)) (n) (L : ListBlank Γ) : (L.modifyNth f n).map F = (L.map F).modifyNth f' n :=", "area": "Computability"} {"task": "t8", "statement": "theorem ListBlank.append_mk {Γ} [Inhabited Γ] (l₁ l₂ : List Γ) : ListBlank.append l₁ (ListBlank.mk l₂) = ListBlank.mk (l₁ ++ l₂) :=", "area": "Computability"} {"task": "t8", "statement": "theorem ListBlank.append_assoc {Γ} [Inhabited Γ] (l₁ l₂ : List Γ) (l₃ : ListBlank Γ) : ListBlank.append (l₁ ++ l₂) l₃ = ListBlank.append l₁ (ListBlank.append l₂ l₃) :=", "area": "Computability"} {"task": "t8", "statement": "theorem ListBlank.cons_bind {Γ Γ'} [Inhabited Γ] [Inhabited Γ'] (a : Γ) (l : ListBlank Γ) (f : Γ → List Γ') (hf) : (l.cons a).bind f hf = (l.bind f hf).append (f a) :=", "area": "Computability"} {"task": "t8", "statement": "theorem Tape.move_left_right {Γ} [Inhabited Γ] (T : Tape Γ) : (T.move Dir.left).move Dir.right = T :=", "area": "Computability"} {"task": "t8", "statement": "theorem Tape.move_right_left {Γ} [Inhabited Γ] (T : Tape Γ) : (T.move Dir.right).move Dir.left = T :=", "area": "Computability"} {"task": "t8", "statement": "theorem Tape.mk'_left_right₀ {Γ} [Inhabited Γ] (T : Tape Γ) : Tape.mk' T.left T.right₀ = T :=", "area": "Computability"} {"task": "t8", "statement": "theorem Tape.move_left_mk' {Γ} [Inhabited Γ] (L R : ListBlank Γ) : (Tape.mk' L R).move Dir.left = Tape.mk' L.tail (R.cons L.head) :=", "area": "Computability"} {"task": "t8", "statement": "theorem Tape.move_right_mk' {Γ} [Inhabited Γ] (L R : ListBlank Γ) : (Tape.mk' L R).move Dir.right = Tape.mk' (L.cons R.head) R.tail :=", "area": "Computability"} {"task": "t8", "statement": "theorem Tape.right₀_nth {Γ} [Inhabited Γ] (T : Tape Γ) (n : ℕ) : T.right₀.nth n = T.nth n :=", "area": "Computability"} {"task": "t8", "statement": "theorem Tape.mk'_nth_nat {Γ} [Inhabited Γ] (L R : ListBlank Γ) (n : ℕ) : (Tape.mk' L R).nth n = R.nth n :=", "area": "Computability"} {"task": "t8", "statement": "theorem Tape.move_left_nth {Γ} [Inhabited Γ] : ∀ (T : Tape Γ) (i : ℤ), (T.move Dir.left).nth i = T.nth (i - 1)", "area": "Computability"} {"task": "t8", "statement": "theorem Tape.move_right_nth {Γ} [Inhabited Γ] (T : Tape Γ) (i : ℤ) : (T.move Dir.right).nth i = T.nth (i + 1) :=", "area": "Computability"} {"task": "t8", "statement": "theorem Tape.move_right_n_head {Γ} [Inhabited Γ] (T : Tape Γ) (i : ℕ) : ((Tape.move Dir.right)^[i] T).head = T.nth i :=", "area": "Computability"} {"task": "t8", "statement": "theorem Tape.write_self {Γ} [Inhabited Γ] : ∀ T : Tape Γ, T.write T.1 = T :=", "area": "Computability"} {"task": "t8", "statement": "theorem Tape.write_mk' {Γ} [Inhabited Γ] (a b : Γ) (L R : ListBlank Γ) : (Tape.mk' L (R.cons a)).write b = Tape.mk' L (R.cons b) :=", "area": "Computability"} {"task": "t8", "statement": "theorem Tape.map_fst {Γ Γ'} [Inhabited Γ] [Inhabited Γ'] (f : PointedMap Γ Γ') : ∀ T : Tape Γ, (T.map f).1 = f T.1 :=", "area": "Computability"} {"task": "t8", "statement": "theorem Tape.map_write {Γ Γ'} [Inhabited Γ] [Inhabited Γ'] (f : PointedMap Γ Γ') (b : Γ) : ∀ T : Tape Γ, (T.write b).map f = (T.map f).write (f b) :=", "area": "Computability"} {"task": "t8", "statement": "theorem Tape.write_move_right_n {Γ} [Inhabited Γ] (f : Γ → Γ) (L R : ListBlank Γ) (n : ℕ) : ((Tape.move Dir.right)^[n] (Tape.mk' L R)).write (f (R.nth n)) = (Tape.move Dir.right)^[n] (Tape.mk' L (R.modifyNth f n)) :=", "area": "Computability"} {"task": "t8", "statement": "theorem Tape.map_move {Γ Γ'} [Inhabited Γ] [Inhabited Γ'] (f : PointedMap Γ Γ') (T : Tape Γ) (d) : (T.move d).map f = (T.map f).move d :=", "area": "Computability"} {"task": "t8", "statement": "theorem Tape.map_mk' {Γ Γ'} [Inhabited Γ] [Inhabited Γ'] (f : PointedMap Γ Γ') (L R : ListBlank Γ) : (Tape.mk' L R).map f = Tape.mk' (L.map f) (R.map f) :=", "area": "Computability"} {"task": "t8", "statement": "theorem Tape.map_mk₂ {Γ Γ'} [Inhabited Γ] [Inhabited Γ'] (f : PointedMap Γ Γ') (L R : List Γ) : (Tape.mk₂ L R).map f = Tape.mk₂ (L.map f) (R.map f) :=", "area": "Computability"} {"task": "t8", "statement": "theorem reaches₁_eq {σ} {f : σ → Option σ} {a b c} (h : f a = f b) : Reaches₁ f a c ↔ Reaches₁ f b c :=", "area": "Computability"} {"task": "t8", "statement": "theorem reaches₁_fwd {σ} {f : σ → Option σ} {a b c} (h₁ : Reaches₁ f a c) (h₂ : b ∈ f a) : Reaches f b c :=", "area": "Computability"} {"task": "t8", "statement": "theorem mem_eval {σ} {f : σ → Option σ} {a b} : b ∈ eval f a ↔ Reaches f a b ∧ f b = none :=", "area": "Computability"} {"task": "t8", "statement": "theorem eval_maximal₁ {σ} {f : σ → Option σ} {a b} (h : b ∈ eval f a) (c) : ¬Reaches₁ f b c", "area": "Computability"} {"task": "t8", "statement": "theorem eval_maximal {σ} {f : σ → Option σ} {a b} (h : b ∈ eval f a) {c} : Reaches f b c ↔ c = b :=", "area": "Computability"} {"task": "t8", "statement": "theorem reaches_eval {σ} {f : σ → Option σ} {a b} (ab : Reaches f a b) : eval f a = eval f b :=", "area": "Computability"} {"task": "t8", "statement": "theorem tr_reaches₁ {σ₁ σ₂ f₁ f₂} {tr : σ₁ → σ₂ → Prop} (H : Respects f₁ f₂ tr) {a₁ a₂} (aa : tr a₁ a₂) {b₁} (ab : Reaches₁ f₁ a₁ b₁) : ∃ b₂, tr b₁ b₂ ∧ Reaches₁ f₂ a₂ b₂ :=", "area": "Computability"} {"task": "t8", "statement": "theorem tr_reaches {σ₁ σ₂ f₁ f₂} {tr : σ₁ → σ₂ → Prop} (H : Respects f₁ f₂ tr) {a₁ a₂} (aa : tr a₁ a₂) {b₁} (ab : Reaches f₁ a₁ b₁) : ∃ b₂, tr b₁ b₂ ∧ Reaches f₂ a₂ b₂ :=", "area": "Computability"} {"task": "t8", "statement": "theorem tr_reaches_rev {σ₁ σ₂ f₁ f₂} {tr : σ₁ → σ₂ → Prop} (H : Respects f₁ f₂ tr) {a₁ a₂} (aa : tr a₁ a₂) {b₂} (ab : Reaches f₂ a₂ b₂) : ∃ c₁ c₂, Reaches f₂ b₂ c₂ ∧ tr c₁ c₂ ∧ Reaches f₁ a₁ c₁ :=", "area": "Computability"} {"task": "t8", "statement": "theorem tr_eval {σ₁ σ₂ f₁ f₂} {tr : σ₁ → σ₂ → Prop} (H : Respects f₁ f₂ tr) {a₁ b₁ a₂} (aa : tr a₁ a₂) (ab : b₁ ∈ eval f₁ a₁) : ∃ b₂, tr b₁ b₂ ∧ b₂ ∈ eval f₂ a₂ :=", "area": "Computability"} {"task": "t8", "statement": "theorem tr_eval_rev {σ₁ σ₂ f₁ f₂} {tr : σ₁ → σ₂ → Prop} (H : Respects f₁ f₂ tr) {a₁ b₂ a₂} (aa : tr a₁ a₂) (ab : b₂ ∈ eval f₂ a₂) : ∃ b₁, tr b₁ b₂ ∧ b₁ ∈ eval f₁ a₁ :=", "area": "Computability"} {"task": "t8", "statement": "theorem frespects_eq {σ₁ σ₂} {f₂ : σ₂ → Option σ₂} {tr : σ₁ → σ₂} {a₂ b₂} (h : f₂ a₂ = f₂ b₂) : ∀ {b₁}, FRespects f₂ tr a₂ b₁ ↔ FRespects f₂ tr b₂ b₁", "area": "Computability"} {"task": "t8", "statement": "theorem fun_respects {σ₁ σ₂ f₁ f₂} {tr : σ₁ → σ₂} : (Respects f₁ f₂ fun a b ↦ tr a = b) ↔ ∀ ⦃a₁⦄, FRespects f₂ tr (tr a₁) (f₁ a₁) :=", "area": "Computability"} {"task": "t8", "statement": "theorem tr_eval' {σ₁ σ₂} (f₁ : σ₁ → Option σ₁) (f₂ : σ₂ → Option σ₂) (tr : σ₁ → σ₂) (H : Respects f₁ f₂ fun a b ↦ tr a = b) (a₁) : eval f₂ (tr a₁) = tr <$> eval f₁ a₁ :=", "area": "Computability"} {"task": "t8", "statement": "theorem step_supports (M : Machine₀) {S : Set Λ} (ss : Supports M S) : ∀ {c c' : Cfg₀}, c' ∈ step M c → c.q ∈ S → c'.q ∈ S :=", "area": "Computability"} {"task": "t8", "statement": "theorem univ_supports (M : Machine₀) : Supports M Set.univ :=", "area": "Computability"} {"task": "t8", "statement": "theorem Machine.map_step {S : Set Λ} (f₂₁ : Function.RightInverse f₁ f₂) (g₂₁ : ∀ q ∈ S, g₂ (g₁ q) = q) : ∀ c : Cfg Γ Λ, c.q ∈ S → (step M c).map (Cfg.map f₁ g₁) = step (M.map f₁ f₂ g₁ g₂) (Cfg.map f₁ g₁ c)", "area": "Computability"} {"task": "t8", "statement": "theorem Machine.map_respects (g₁ : PointedMap Λ Λ') (g₂ : Λ' → Λ) {S} (ss : Supports M S) (f₂₁ : Function.RightInverse f₁ f₂) (g₂₁ : ∀ q ∈ S, g₂ (g₁ q) = q) : Respects (step M) (step (M.map f₁ f₂ g₁ g₂)) fun a b ↦ a.q ∈ S ∧ Cfg.map f₁ g₁ a = b :=", "area": "Computability"} {"task": "t8", "statement": "theorem stmts₁_self {q : Stmt₁} : q ∈ stmts₁ q :=", "area": "Computability"} {"task": "t8", "statement": "theorem stmts₁_trans {q₁ q₂ : Stmt₁} : q₁ ∈ stmts₁ q₂ → stmts₁ q₁ ⊆ stmts₁ q₂ :=", "area": "Computability"} {"task": "t8", "statement": "theorem stmts₁_supportsStmt_mono {S : Finset Λ} {q₁ q₂ : Stmt₁} (h : q₁ ∈ stmts₁ q₂) (hs : SupportsStmt S q₂) : SupportsStmt S q₁ :=", "area": "Computability"} {"task": "t8", "statement": "theorem stmts_trans {M : Λ → Stmt₁} {S : Finset Λ} {q₁ q₂ : Stmt₁} (h₁ : q₁ ∈ stmts₁ q₂) : some q₂ ∈ stmts M S → some q₁ ∈ stmts M S :=", "area": "Computability"} {"task": "t8", "statement": "theorem stmts_supportsStmt {M : Λ → Stmt₁} {S : Finset Λ} {q : Stmt₁} (ss : Supports M S) : some q ∈ stmts M S → SupportsStmt S q :=", "area": "Computability"} {"task": "t8", "statement": "theorem step_supports (M : Λ → Stmt₁) {S : Finset Λ} (ss : Supports M S) : ∀ {c c' : Cfg₁}, c' ∈ step M c → c.l ∈ Finset.insertNone S → c'.l ∈ Finset.insertNone S", "area": "Computability"} {"task": "t8", "statement": "theorem tr_respects : Respects (TM1.step M) (TM0.step (tr M)) fun (c₁ : Cfg₁) (c₂ : Cfg₁₀) ↦ trCfg M c₁ = c₂ :=", "area": "Computability"} {"task": "t8", "statement": "theorem tr_eval (l : List Γ) : TM0.eval (tr M) l = TM1.eval M l :=", "area": "Computability"} {"task": "t8", "statement": "theorem tr_supports {S : Finset Λ} (ss : TM1.Supports M S) : TM0.Supports (tr M) ↑(trStmts M S) :=", "area": "Computability"} {"task": "t8", "statement": "theorem exists_enc_dec [Finite Γ] : ∃ (n : ℕ) (enc : Γ → Vector Bool n) (dec : Vector Bool n → Γ), enc default = Vector.replicate n false ∧ ∀ a, dec (enc a) = a :=", "area": "Computability"} {"task": "t8", "statement": "theorem stepAux_move (d : Dir) (q : Stmt'₁) (v : σ) (T : Tape Bool) : stepAux (moveₙ d q) v T = stepAux q v ((Tape.move d)^[n] T) :=", "area": "Computability"} {"task": "t8", "statement": "theorem supportsStmt_move {S : Finset Λ'₁} {d : Dir} {q : Stmt'₁} : SupportsStmt S (moveₙ d q) = SupportsStmt S q :=", "area": "Computability"} {"task": "t8", "statement": "theorem supportsStmt_write {S : Finset Λ'₁} {l : List Bool} {q : Stmt'₁} : SupportsStmt S (write l q) = SupportsStmt S q :=", "area": "Computability"} {"task": "t8", "statement": "theorem supportsStmt_read {S : Finset Λ'₁} : ∀ {f : Γ → Stmt'₁}, (∀ a, SupportsStmt S (f a)) → SupportsStmt S (read dec f) :=", "area": "Computability"} {"task": "t8", "statement": "theorem trTape_mk' (L R : ListBlank Γ) : trTape enc0 (Tape.mk' L R) = trTape' enc0 L R :=", "area": "Computability"} {"task": "t8", "statement": "theorem trTape'_move_left (L R : ListBlank Γ) : (Tape.move Dir.left)^[n] (trTape' enc0 L R) = trTape' enc0 L.tail (R.cons L.head) :=", "area": "Computability"} {"task": "t8", "statement": "theorem trTape'_move_right (L R : ListBlank Γ) : (Tape.move Dir.right)^[n] (trTape' enc0 L R) = trTape' enc0 (L.cons R.head) R.tail :=", "area": "Computability"} {"task": "t8", "statement": "theorem stepAux_write (q : Stmt'₁) (v : σ) (a b : Γ) (L R : ListBlank Γ) : stepAux (write (enc a).toList q) v (trTape' enc0 L (ListBlank.cons b R)) = stepAux q v (trTape' enc0 (ListBlank.cons a L) R) :=", "area": "Computability"} {"task": "t8", "statement": "theorem stepAux_read (f : Γ → Stmt'₁) (v : σ) (L R : ListBlank Γ) : stepAux (read dec f) v (trTape' enc0 L R) = stepAux (f R.head) v (trTape' enc0 L R) :=", "area": "Computability"} {"task": "t8", "statement": "theorem tr_respects {enc₀} : Respects (step M) (step (tr enc dec M)) fun c₁ c₂ ↦ trCfg enc enc₀ c₁ = c₂ :=", "area": "Computability"} {"task": "t8", "statement": "theorem tr_supports {S : Finset Λ} (ss : Supports M S) : Supports (tr enc dec M) (trSupp M S) :=", "area": "Computability"} {"task": "t8", "statement": "theorem tr_respects : Respects (TM0.step M) (TM1.step (tr M)) fun a b ↦ trCfg M a = b :=", "area": "Computability"} {"task": "t8", "statement": "theorem stmts₁_self {q : Stmt₂} : q ∈ stmts₁ q :=", "area": "Computability"} {"task": "t8", "statement": "theorem stmts₁_trans {q₁ q₂ : Stmt₂} : q₁ ∈ stmts₁ q₂ → stmts₁ q₁ ⊆ stmts₁ q₂ :=", "area": "Computability"} {"task": "t8", "statement": "theorem stmts₁_supportsStmt_mono {S : Finset Λ} {q₁ q₂ : Stmt₂} (h : q₁ ∈ stmts₁ q₂) (hs : SupportsStmt S q₂) : SupportsStmt S q₁ :=", "area": "Computability"} {"task": "t8", "statement": "theorem stmts_trans {M : Λ → Stmt₂} {S : Finset Λ} {q₁ q₂ : Stmt₂} (h₁ : q₁ ∈ stmts₁ q₂) : some q₂ ∈ stmts M S → some q₁ ∈ stmts M S :=", "area": "Computability"} {"task": "t8", "statement": "theorem stmts_supportsStmt {M : Λ → Stmt₂} {S : Finset Λ} {q : Stmt₂} (ss : Supports M S) : some q ∈ stmts M S → SupportsStmt S q :=", "area": "Computability"} {"task": "t8", "statement": "theorem step_supports (M : Λ → Stmt₂) {S : Finset Λ} (ss : Supports M S) : ∀ {c c' : Cfg₂}, c' ∈ step M c → c.l ∈ Finset.insertNone S → c'.l ∈ Finset.insertNone S", "area": "Computability"} {"task": "t8", "statement": "theorem stk_nth_val {K : Type*} {Γ : K → Type*} {L : ListBlank (∀ k, Option (Γ k))} {k S} (n) (hL : ListBlank.map (proj k) L = ListBlank.mk (List.map some S).reverse) : L.nth n k = S.reverse.get? n :=", "area": "Computability"} {"task": "t8", "statement": "theorem addBottom_map (L : ListBlank (∀ k, Option (Γ k))) : (addBottom L).map ⟨Prod.snd, by rfl⟩ = L :=", "area": "Computability"} {"task": "t8", "statement": "theorem addBottom_modifyNth (f : (∀ k, Option (Γ k)) → ∀ k, Option (Γ k)) (L : ListBlank (∀ k, Option (Γ k))) (n : ℕ) : (addBottom L).modifyNth (fun a ↦ (a.1, f a.2)) n = addBottom (L.modifyNth f n) :=", "area": "Computability"} {"task": "t8", "statement": "theorem addBottom_nth_snd (L : ListBlank (∀ k, Option (Γ k))) (n : ℕ) : ((addBottom L).nth n).2 = L.nth n :=", "area": "Computability"} {"task": "t8", "statement": "theorem addBottom_nth_succ_fst (L : ListBlank (∀ k, Option (Γ k))) (n : ℕ) : ((addBottom L).nth (n + 1)).1 = false :=", "area": "Computability"} {"task": "t8", "statement": "theorem addBottom_head_fst (L : ListBlank (∀ k, Option (Γ k))) : (addBottom L).head.1 = true :=", "area": "Computability"} {"task": "t8", "statement": "theorem supports_run (S : Finset Λ) {k : K} (s : StAct₂ k) (q : Stmt₂) : TM2.SupportsStmt S (stRun s q) ↔ TM2.SupportsStmt S q :=", "area": "Computability"} {"task": "t8", "statement": "theorem step_run {k : K} (q : Stmt₂) (v : σ) (S : ∀ k, List (Γ k)) : ∀ s : StAct₂ k, TM2.stepAux (stRun s q) v S = TM2.stepAux q (stVar v (S k) s) (update S k (stWrite v (S k) s))", "area": "Computability"} {"task": "t8", "statement": "theorem trNormal_run {k : K} (s : StAct₂ k) (q : Stmt₂) : trNormal (stRun s q) = goto fun _ _ ↦ go k s q :=", "area": "Computability"} {"task": "t8", "statement": "theorem trStmts₁_run {k : K} {s : StAct₂ k} {q : Stmt₂} : trStmts₁ (stRun s q) = {go k s q, ret q} ∪ trStmts₁ q :=", "area": "Computability"} {"task": "t8", "statement": "theorem tr_respects_aux₂ {k : K} {q : Stmt₂₁} {v : σ} {S : ∀ k, List (Γ k)} {L : ListBlank (∀ k, Option (Γ k))} (hL : ∀ k, L.map (proj k) = ListBlank.mk ((S k).map some).reverse) (o : StAct₂ k) : let v' := stVar v (S k) o let Sk' := stWrite v (S k) o let S' := update S k Sk' ∃ L' : ListBlank (∀ k, Option (Γ k)), (∀ k, L'.map (proj k) = ListBlank.mk ((S' k).map some).reverse) ∧ TM1.stepAux (trStAct q o) v ((Tape.move Dir.right)^[(S k).length] (Tape.mk' ∅ (addBottom L))) = TM1.stepAux q v' ((Tape.move Dir.right)^[(S' k).length] (Tape.mk' ∅ (addBottom L'))) :=", "area": "Computability"} {"task": "t8", "statement": "theorem tr_respects_aux₁ {k} (o q v) {S : List (Γ k)} {L : ListBlank (∀ k, Option (Γ k))} (hL : L.map (proj k) = ListBlank.mk (S.map some).reverse) (n) (H : n ≤ S.length) : Reaches₀ (TM1.step (tr M)) ⟨some (go k o q), v, Tape.mk' ∅ (addBottom L)⟩ ⟨some (go k o q), v, (Tape.move Dir.right)^[n] (Tape.mk' ∅ (addBottom L))⟩ :=", "area": "Computability"} {"task": "t8", "statement": "theorem tr_respects_aux₃ {q v} {L : ListBlank (∀ k, Option (Γ k))} (n) : Reaches₀ (TM1.step (tr M)) ⟨some (ret q), v, (Tape.move Dir.right)^[n] (Tape.mk' ∅ (addBottom L))⟩ ⟨some (ret q), v, Tape.mk' ∅ (addBottom L)⟩ :=", "area": "Computability"} {"task": "t8", "statement": "theorem tr_respects_aux {q v T k} {S : ∀ k, List (Γ k)} (hT : ∀ k, ListBlank.map (proj k) T = ListBlank.mk ((S k).map some).reverse) (o : StAct₂ k) (IH : ∀ {v : σ} {S : ∀ k : K, List (Γ k)} {T : ListBlank (∀ k, Option (Γ k))}, (∀ k, ListBlank.map (proj k) T = ListBlank.mk ((S k).map some).reverse) → ∃ b, TrCfg (TM2.stepAux q v S) b ∧ Reaches (TM1.step (tr M)) (TM1.stepAux (trNormal q) v (Tape.mk' ∅ (addBottom T))) b) : ∃ b, TrCfg (TM2.stepAux (stRun o q) v S) b ∧ Reaches (TM1.step (tr M)) (TM1.stepAux (trNormal (stRun o q)) v (Tape.mk' ∅ (addBottom T))) b :=", "area": "Computability"} {"task": "t8", "statement": "theorem tr_respects : Respects (TM2.step M) (TM1.step (tr M)) TrCfg :=", "area": "Computability"} {"task": "t8", "statement": "theorem trCfg_init (k) (L : List (Γ k)) : TrCfg (TM2.init k L) (TM1.init (trInit k L) : Cfg₂₁) :=", "area": "Computability"} {"task": "t8", "statement": "theorem tr_eval (k) (L : List (Γ k)) {L₁ L₂} (H₁ : L₁ ∈ TM1.eval (tr M) (trInit k L)) (H₂ : L₂ ∈ TM2.eval M k L) : ∃ (S : ∀ k, List (Γ k)) (L' : ListBlank (∀ k, Option (Γ k))), addBottom L' = L₁ ∧ (∀ k, L'.map (proj k) = ListBlank.mk ((S k).map some).reverse) ∧ S k = L₂ :=", "area": "Computability"} {"task": "t8", "statement": "theorem tr_supports {S} (ss : TM2.Supports M S) : TM1.Supports (tr M) (trSupp M S) :=", "area": "Computability"} {"task": "t8", "statement": "theorem εClosure_empty : M.εClosure ∅ = ∅ :=", "area": "Computability"} {"task": "t8", "statement": "theorem mem_stepSet_iff : s ∈ M.stepSet S a ↔ ∃ t ∈ S, s ∈ M.εClosure (M.step t a) :=", "area": "Computability"} {"task": "t8", "statement": "theorem stepSet_empty (a : α) : M.stepSet ∅ a = ∅ :=", "area": "Computability"} {"task": "t8", "statement": "theorem evalFrom_append_singleton (S : Set σ) (x : List α) (a : α) : M.evalFrom S (x ++ [a]) = M.stepSet (M.evalFrom S x) a :=", "area": "Computability"} {"task": "t8", "statement": "theorem evalFrom_empty (x : List α) : M.evalFrom ∅ x = ∅ :=", "area": "Computability"} {"task": "t8", "statement": "theorem toεNFA_εClosure (M : NFA α σ) (S : Set σ) : M.toεNFA.εClosure S = S :=", "area": "Computability"} {"task": "t8", "statement": "theorem toεNFA_evalFrom_match (M : NFA α σ) (start : Set σ) : M.toεNFA.evalFrom start = M.evalFrom start :=", "area": "Computability"} {"task": "t8", "statement": "theorem toεNFA_correct (M : NFA α σ) : M.toεNFA.accepts = M.accepts :=", "area": "Computability"} {"task": "t8", "statement": "lemma Rewrites.exists_parts {r : ContextFreeRule T N} {u v : List (Symbol T N)} (hyp : r.Rewrites u v) : ∃ p q : List (Symbol T N), u = p ++ [Symbol.nonterminal r.input] ++ q ∧ v = p ++ r.output ++ q :=", "area": "Computability"} {"task": "t8", "statement": "lemma rewrites_of_exists_parts (r : ContextFreeRule T N) (p q : List (Symbol T N)) : r.Rewrites (p ++ [Symbol.nonterminal r.input] ++ q) (p ++ r.output ++ q) :=", "area": "Computability"} {"task": "t8", "statement": "theorem rewrites_iff {r : ContextFreeRule T N} (u v : List (Symbol T N)) : r.Rewrites u v ↔ ∃ p q : List (Symbol T N), u = p ++ [Symbol.nonterminal r.input] ++ q ∧ v = p ++ r.output ++ q :=", "area": "Computability"} {"task": "t8", "statement": "lemma Rewrites.append_left {r : ContextFreeRule T N} {v w : List (Symbol T N)} (hvw : r.Rewrites v w) (p : List (Symbol T N)) : r.Rewrites (p ++ v) (p ++ w) :=", "area": "Computability"} {"task": "t8", "statement": "lemma Rewrites.append_right {r : ContextFreeRule T N} {v w : List (Symbol T N)} (hvw : r.Rewrites v w) (p : List (Symbol T N)) : r.Rewrites (v ++ p) (w ++ p) :=", "area": "Computability"} {"task": "t8", "statement": "@[simp] lemma mem_language_iff (g : ContextFreeGrammar.{uN} T) (w : List T) : w ∈ g.language ↔ g.Derives [Symbol.nonterminal g.initial] (List.map Symbol.terminal w) :=", "area": "Computability"} {"task": "t8", "statement": "lemma Derives.append_left {v w : List (Symbol T g.NT)} (hvw : g.Derives v w) (p : List (Symbol T g.NT)) : g.Derives (p ++ v) (p ++ w) :=", "area": "Computability"} {"task": "t8", "statement": "lemma Derives.append_right {v w : List (Symbol T g.NT)} (hvw : g.Derives v w) (p : List (Symbol T g.NT)) : g.Derives (v ++ p) (w ++ p) :=", "area": "Computability"} {"task": "t8", "statement": "lemma ContextFreeRule.reverse_involutive {N : Type uN} : Function.Involutive (@ContextFreeRule.reverse T N) :=", "area": "Computability"} {"task": "t8", "statement": "lemma ContextFreeGrammar.reverse_involutive : Function.Involutive (@ContextFreeGrammar.reverse T) :=", "area": "Computability"} {"task": "t8", "statement": "lemma ContextFreeGrammar.reverse_derives (g : ContextFreeGrammar T) {s : List (Symbol T g.NT)} (hgs : g.reverse.Derives [Symbol.nonterminal g.reverse.initial] s) : g.Derives [Symbol.nonterminal g.initial] s.reverse :=", "area": "Computability"} {"task": "t8", "statement": "lemma ContextFreeGrammar.reverse_mem_language_of_mem_reverse_language (g : ContextFreeGrammar T) {w : List T} (hgw : w ∈ g.reverse.language) : w.reverse ∈ g.language :=", "area": "Computability"} {"task": "t8", "statement": "lemma ContextFreeGrammar.mem_reverse_language_iff_reverse_mem_language (g : ContextFreeGrammar T) (w : List T) : w ∈ g.reverse.language ↔ w.reverse ∈ g.language :=", "area": "Computability"} {"task": "t8", "statement": "theorem commute_eps_left [Semiring R] (x : DualNumber R) : Commute ε x :=", "area": "Algebra"} {"task": "t8", "statement": "theorem algHom_ext' ⦃f g : A[ε] →ₐ[R] B⦄ (hinl : f.comp (inlAlgHom _ _ _) = g.comp (inlAlgHom _ _ _)) (hinr : f.toLinearMap ∘ₗ (LinearMap.toSpanSingleton A A[ε] ε).restrictScalars R = g.toLinearMap ∘ₗ (LinearMap.toSpanSingleton A A[ε] ε).restrictScalars R) : f = g :=", "area": "Algebra"} {"task": "t8", "statement": "theorem algHom_ext ⦃f g : R[ε] →ₐ[R] A⦄ (hε : f ε = g ε) : f = g :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lift_apply_inl (fe : {fe : (A →ₐ[R] B) × B // _}) (a : A) : lift fe (inl a : A[ε]) = fe.val.1 a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lift_smul (fe : {fe : (A →ₐ[R] B) × B // _}) (a : A) (ad : A[ε]) : lift fe (a • ad) = fe.val.1 a * lift fe ad :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lift_op_smul (fe : {fe : (A →ₐ[R] B) × B // _}) (a : A) (ad : A[ε]) : lift fe (MulOpposite.op a • ad) = lift fe ad * fe.val.1 a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lift_apply_eps (fe : {fe : (A →ₐ[R] B) × B // fe.2 * fe.2 = 0 ∧ ∀ a, Commute fe.2 (fe.1 a)}) : lift fe (ε : A[ε]) = fe.val.2 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem sSup_inv (s : Set α) : sSup s⁻¹ = (sInf s)⁻¹ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem sInf_inv (s : Set α) : sInf s⁻¹ = (sSup s)⁻¹ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem sSup_div : sSup (s / t) = sSup s / sInf t :=", "area": "Algebra"} {"task": "t8", "statement": "theorem sInf_div : sInf (s / t) = sInf s / sSup t :=", "area": "Algebra"} {"task": "t8", "statement": "theorem csSup_inv (hs₀ : s.Nonempty) (hs₁ : BddBelow s) : sSup s⁻¹ = (sInf s)⁻¹ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem csInf_inv (hs₀ : s.Nonempty) (hs₁ : BddAbove s) : sInf s⁻¹ = (sSup s)⁻¹ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem csSup_div (hs₀ : s.Nonempty) (hs₁ : BddAbove s) (ht₀ : t.Nonempty) (ht₁ : BddBelow t) : sSup (s / t) = sSup s / sInf t :=", "area": "Algebra"} {"task": "t8", "statement": "theorem csInf_div (hs₀ : s.Nonempty) (hs₁ : BddBelow s) (ht₀ : t.Nonempty) (ht₁ : BddAbove t) : sInf (s / t) = sInf s / sSup t :=", "area": "Algebra"} {"task": "t8", "statement": "theorem smul_Ioo : r • Ioo a b = Ioo (r • a) (r • b) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem smul_Icc : r • Icc a b = Icc (r • a) (r • b) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem smul_Ico : r • Ico a b = Ico (r • a) (r • b) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem smul_Ioc : r • Ioc a b = Ioc (r • a) (r • b) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem smul_Ioi : r • Ioi a = Ioi (r • a) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem smul_Iio : r • Iio a = Iio (r • a) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem smul_Ici : r • Ici a = Ici (r • a) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem smul_Iic : r • Iic a = Iic (r • a) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_nonneg (ha : 0 ≤ a) : 0 ≤ f a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_nonpos (ha : a ≤ 0) : f a ≤ 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem monotone_iff_map_nonneg : Monotone (f : α → β) ↔ ∀ a, 0 ≤ a → 0 ≤ f a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem strictMono_iff_map_pos : StrictMono (f : α → β) ↔ ∀ a, 0 < a → 0 < f a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mk_coe (f : α →*o β) (h) : OrderMonoidHom.mk (f : α →* β) h = f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toMonoidHom_injective : Injective (toMonoidHom : _ → α →* β) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toOrderHom_injective : Injective (toOrderHom : _ → α →o β) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem cancel_right {g₁ g₂ : β →*o γ} {f : α →*o β} (hf : Function.Surjective f) : g₁.comp f = g₂.comp f ↔ g₁ = g₂ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem cancel_left {g : β →*o γ} {f₁ f₂ : α →*o β} (hg : Function.Injective g) : g.comp f₁ = g.comp f₂ ↔ f₁ = f₂ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toOrderMonoidHom_injective : Injective (toOrderMonoidHom : _ → α →*o β) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toMonoidWithZeroHom_injective : Injective (toMonoidWithZeroHom : _ → α →*₀ β) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem cancel_right {g₁ g₂ : β →*₀o γ} {f : α →*₀o β} (hf : Function.Surjective f) : g₁.comp f = g₂.comp f ↔ g₁ = g₂ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem cancel_left {g : β →*₀o γ} {f₁ f₂ : α →*₀o β} (hg : Function.Injective g) : g.comp f₁ = g.comp f₂ ↔ f₁ = f₂ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toMonoidWithZeroHom_eq_coe (f : α →*₀o β) : f.toMonoidWithZeroHom = f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem sub_top {a : WithTop α} : a - ⊤ = (⊥ : α) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem sub_eq_top_iff {a b : WithTop α} : a - b = ⊤ ↔ a = ⊤ ∧ b ≠ ⊤ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_sub [Sub β] [Bot β] {f : α → β} (h : ∀ x y, f (x - y) = f x - f y) (h₀ : f ⊥ = ⊥) : ∀ x y : WithTop α, (x - y).map f = x.map f - y.map f", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma divInt_nonneg_iff_of_pos_right {a b : ℤ} (hb : 0 < b) : 0 ≤ a /. b ↔ 0 ≤ a :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma divInt_nonneg {a b : ℤ} (ha : 0 ≤ a) (hb : 0 ≤ b) : 0 ≤ a /. b :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma mkRat_nonneg {a : ℤ} (ha : 0 ≤ a) (b : ℕ) : 0 ≤ mkRat a b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ofScientific_nonneg (m : ℕ) (s : Bool) (e : ℕ) : 0 ≤ Rat.ofScientific m s e :=", "area": "Algebra"} {"task": "t8", "statement": "protected lemma add_nonneg : 0 ≤ a → 0 ≤ b → 0 ≤ a + b :=", "area": "Algebra"} {"task": "t8", "statement": "protected lemma mul_nonneg : 0 ≤ a → 0 ≤ b → 0 ≤ a * b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem le_iff_sub_nonneg (a b : ℚ) : a ≤ b ↔ 0 ≤ b - a :=", "area": "Algebra"} {"task": "t8", "statement": "protected lemma divInt_le_divInt {a b c d : ℤ} (b0 : 0 < b) (d0 : 0 < d) : a /. b ≤ c /. d ↔ a * d ≤ c * b :=", "area": "Algebra"} {"task": "t8", "statement": "protected lemma le_total : a ≤ b ∨ b ≤ a :=", "area": "Algebra"} {"task": "t8", "statement": "protected lemma le_def : p ≤ q ↔ p.num * q.den ≤ q.num * p.den :=", "area": "Algebra"} {"task": "t8", "statement": "protected lemma lt_def : p < q ↔ p.num * q.den < q.num * p.den :=", "area": "Algebra"} {"task": "t8", "statement": "theorem add_le_add_left {a b c : ℚ} : c + a ≤ c + b ↔ a ≤ b :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma num_nonpos {a : ℚ} : a.num ≤ 0 ↔ a ≤ 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem div_lt_div_iff_mul_lt_mul {a b c d : ℤ} (b_pos : 0 < b) (d_pos : 0 < d) : (a : ℚ) / b < c / d ↔ a * d < c * b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lt_one_iff_num_lt_denom {q : ℚ} : q < 1 ↔ q.num < q.den :=", "area": "Algebra"} {"task": "t8", "statement": "theorem abs_def (q : ℚ) : |q| = q.num.natAbs /. q.den :=", "area": "Algebra"} {"task": "t8", "statement": "@[to_additive] lemma mabs_zpow (n : ℤ) (a : α) : |a ^ n|ₘ = |a|ₘ ^ |n| :=", "area": "Algebra"} {"task": "t8", "statement": "lemma odd_abs [LinearOrder α] [Ring α] {a : α} : Odd (abs a) ↔ Odd a :=", "area": "Algebra"} {"task": "t8", "statement": "lemma abs_mul (a b : α) : |a * b| = |a| * |b| :=", "area": "Algebra"} {"task": "t8", "statement": "lemma Even.pow_abs (hn : Even n) (a : α) : |a| ^ n = a ^ n :=", "area": "Algebra"} {"task": "t8", "statement": "lemma abs_neg_one_pow (n : ℕ) : |(-1 : α) ^ n| = 1 :=", "area": "Algebra"} {"task": "t8", "statement": "lemma abs_pow_eq_one (a : α) (h : n ≠ 0) : |a ^ n| = 1 ↔ |a| = 1 :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma abs_mul_self (a : α) : |a * a| = a * a :=", "area": "Algebra"} {"task": "t8", "statement": "lemma abs_eq_iff_mul_self_eq : |a| = |b| ↔ a * a = b * b :=", "area": "Algebra"} {"task": "t8", "statement": "lemma abs_lt_iff_mul_self_lt : |a| < |b| ↔ a * a < b * b :=", "area": "Algebra"} {"task": "t8", "statement": "lemma abs_le_iff_mul_self_le : |a| ≤ |b| ↔ a * a ≤ b * b :=", "area": "Algebra"} {"task": "t8", "statement": "lemma abs_le_one_iff_mul_self_le_one : |a| ≤ 1 ↔ a * a ≤ 1 :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma sq_abs (a : α) : |a| ^ 2 = a ^ 2 :=", "area": "Algebra"} {"task": "t8", "statement": "lemma abs_sq (x : α) : |x ^ 2| = x ^ 2 :=", "area": "Algebra"} {"task": "t8", "statement": "lemma sq_lt_sq : a ^ 2 < b ^ 2 ↔ |a| < |b| :=", "area": "Algebra"} {"task": "t8", "statement": "lemma sq_le_sq : a ^ 2 ≤ b ^ 2 ↔ |a| ≤ |b| :=", "area": "Algebra"} {"task": "t8", "statement": "lemma abs_lt_of_sq_lt_sq (h : a ^ 2 < b ^ 2) (hb : 0 ≤ b) : |a| < b :=", "area": "Algebra"} {"task": "t8", "statement": "lemma abs_le_of_sq_le_sq (h : a ^ 2 ≤ b ^ 2) (hb : 0 ≤ b) : |a| ≤ b :=", "area": "Algebra"} {"task": "t8", "statement": "lemma sq_eq_sq_iff_abs_eq_abs (a b : α) : a ^ 2 = b ^ 2 ↔ |a| = |b| :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma sq_le_one_iff_abs_le_one (a : α) : a ^ 2 ≤ 1 ↔ |a| ≤ 1 :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma sq_lt_one_iff_abs_lt_one (a : α) : a ^ 2 < 1 ↔ |a| < 1 :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma one_le_sq_iff_one_le_abs (a : α) : 1 ≤ a ^ 2 ↔ 1 ≤ |a| :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma one_lt_sq_iff_one_lt_abs (a : α) : 1 < a ^ 2 ↔ 1 < |a| :=", "area": "Algebra"} {"task": "t8", "statement": "lemma exists_abs_lt {α : Type*} [LinearOrderedRing α] (a : α) : ∃ b > 0, |a| < b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem abs_sub_sq (a b : α) : |a - b| * |a - b| = a * a + b * b - (1 + 1) * a * b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem abs_dvd (a b : α) : |a| ∣ b ↔ a ∣ b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem dvd_abs (a b : α) : a ∣ |b| ↔ a ∣ b :=", "area": "Algebra"} {"task": "t8", "statement": "lemma pow_eq_pow_iff_of_ne_zero (hn : n ≠ 0) : a ^ n = b ^ n ↔ a = b ∨ a = -b ∧ Even n :=", "area": "Algebra"} {"task": "t8", "statement": "lemma pow_eq_pow_iff_cases : a ^ n = b ^ n ↔ n = 0 ∨ a = b ∨ a = -b ∧ Even n :=", "area": "Algebra"} {"task": "t8", "statement": "lemma pow_eq_one_iff_of_ne_zero (hn : n ≠ 0) : a ^ n = 1 ↔ a = 1 ∨ a = -1 ∧ Even n :=", "area": "Algebra"} {"task": "t8", "statement": "lemma pow_eq_one_iff_cases : a ^ n = 1 ↔ n = 0 ∨ a = 1 ∨ a = -1 ∧ Even n :=", "area": "Algebra"} {"task": "t8", "statement": "lemma pow_eq_neg_pow_iff (hb : b ≠ 0) : a ^ n = -b ^ n ↔ a = -b ∧ Odd n :=", "area": "Algebra"} {"task": "t8", "statement": "lemma pow_eq_neg_one_iff : a ^ n = -1 ↔ a = -1 ∧ Odd n :=", "area": "Algebra"} {"task": "t8", "statement": "lemma Odd.ne_two_of_dvd_nat {m n : ℕ} (hn : Odd n) (hm : m ∣ n) : m ≠ 2 :=", "area": "Algebra"} {"task": "t8", "statement": "@[to_additive \"A functor `F : J ⥤ AddGrp.{u}` has a limit iff `(F ⋙ forget AddGrp).sections` is `u`-small.\"] lemma hasLimit_iff_small_sections : HasLimit F ↔ Small.{u} (F ⋙ forget Grp).sections :=", "area": "Algebra"} {"task": "t8", "statement": "@[to_additive \"A functor `F : J ⥤ AddCommGrp.{u}` has a limit iff `(F ⋙ forget AddCommGrp).sections` is `u`-small.\"] lemma hasLimit_iff_small_sections : HasLimit F ↔ Small.{u} (F ⋙ forget CommGrp).sections :=", "area": "Algebra"} {"task": "t8", "statement": "theorem kernelIsoKer_hom_comp_subtype {G H : AddCommGrp.{u}} (f : G ⟶ H) : (kernelIsoKer f).hom ≫ AddSubgroup.subtype f.ker = kernel.ι f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem kernelIsoKer_inv_comp_ι {G H : AddCommGrp.{u}} (f : G ⟶ H) : (kernelIsoKer f).inv ≫ kernel.ι f = AddSubgroup.subtype f.ker :=", "area": "Algebra"} {"task": "t8", "statement": "theorem cokernel_π_ext {M N : ModuleCat.{u} R} (f : M ⟶ N) {x y : N} (m : M) (w : x = y + f m) : cokernel.π f x = cokernel.π f y :=", "area": "Algebra"} {"task": "t8", "statement": "@[reassoc (attr := simp)] lemma colimitCoconeιApp_naturality {i j : J} (f : i ⟶ j) : F.map f ≫ colimitCoconeιApp F j = colimitCoconeιApp F i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem cocone_naturality {j j' : J} (f : j ⟶ j') : F.map f ≫ coconeMorphism F j' = coconeMorphism F j :=", "area": "Algebra"} {"task": "t8", "statement": "theorem cocone_naturality_components (j j' : J) (f : j ⟶ j') (x : F.obj j) : (coconeMorphism F j') (F.map f x) = (coconeMorphism F j) x :=", "area": "Algebra"} {"task": "t8", "statement": "lemma even_iff : Even n ↔ n % 2 = 0 where", "area": "Algebra"} {"task": "t8", "statement": "lemma not_even_iff : ¬ Even n ↔ n % 2 = 1 :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma not_even_one : ¬Even 1 :=", "area": "Algebra"} {"task": "t8", "statement": "@[parity_simps] lemma even_add : Even (m + n) ↔ (Even m ↔ Even n) :=", "area": "Algebra"} {"task": "t8", "statement": "@[parity_simps] lemma even_add_one : Even (n + 1) ↔ ¬Even n :=", "area": "Algebra"} {"task": "t8", "statement": "lemma succ_mod_two_eq_zero_iff {m : ℕ} : (m + 1) % 2 = 0 ↔ m % 2 = 1 :=", "area": "Algebra"} {"task": "t8", "statement": "lemma succ_mod_two_eq_one_iff {m : ℕ} : (m + 1) % 2 = 1 ↔ m % 2 = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "lemma two_not_dvd_two_mul_add_one (n : ℕ) : ¬2 ∣ 2 * n + 1 :=", "area": "Algebra"} {"task": "t8", "statement": "@[parity_simps] lemma even_sub (h : n ≤ m) : Even (m - n) ↔ (Even m ↔ Even n) :=", "area": "Algebra"} {"task": "t8", "statement": "@[parity_simps] lemma even_mul : Even (m * n) ↔ Even m ∨ Even n :=", "area": "Algebra"} {"task": "t8", "statement": "@[parity_simps] lemma even_pow : Even (m ^ n) ↔ Even m ∧ n ≠ 0 :=", "area": "Algebra"} {"task": "t8", "statement": "lemma even_mul_succ_self (n : ℕ) : Even (n * (n + 1)) :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] protected lemma isUnit_iff {n : ℕ} : IsUnit n ↔ n = 1 where", "area": "Algebra"} {"task": "t8", "statement": "theorem isConj_iff_eq {α : Type*} [CommMonoid α] {a b : α} : IsConj a b ↔ a = b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem MonoidHom.map_isConj (f : α →* β) {a b : α} : IsConj a b → IsConj (f a) (f b)", "area": "Algebra"} {"task": "t8", "statement": "theorem isConj_one_right {a : α} : IsConj 1 a ↔ a = 1 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem conj_pow {i : ℕ} {a b : α} : (a * b * a⁻¹) ^ i = a * b ^ i * a⁻¹ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem conj_zpow {i : ℤ} {a b : α} : (a * b * a⁻¹) ^ i = a * b ^ i * a⁻¹ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_surjective {f : α →* β} (hf : Function.Surjective f) : Function.Surjective (ConjClasses.map f) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem isConj_iff_conjugatesOf_eq {a b : α} : IsConj a b ↔ conjugatesOf a = conjugatesOf b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mem_carrier_iff_mk_eq {a : α} {b : ConjClasses α} : a ∈ carrier b ↔ ConjClasses.mk a = b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem op_div [DivInvMonoid α] (x y : α) : op (x / y) = (op y)⁻¹ * op x :=", "area": "Algebra"} {"task": "t8", "statement": "theorem semiconjBy_op [Mul α] {a x y : α} : SemiconjBy (op a) (op y) (op x) ↔ SemiconjBy a x y :=", "area": "Algebra"} {"task": "t8", "statement": "theorem semiconjBy_unop [Mul α] {a x y : αᵐᵒᵖ} : SemiconjBy (unop a) (unop y) (unop x) ↔ SemiconjBy a x y :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_apply (s : Set α) (f : α → M) (a : α) [Decidable (a ∈ s)] : mulIndicator s f a = if a ∈ s then f a else 1 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_eq_one_or_self (s : Set α) (f : α → M) (a : α) : mulIndicator s f a = 1 ∨ mulIndicator s f a = f a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_apply_eq_self : s.mulIndicator f a = f a ↔ a ∉ s → f a = 1 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_eq_self : s.mulIndicator f = f ↔ mulSupport f ⊆ s :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_eq_self_of_superset (h1 : s.mulIndicator f = f) (h2 : s ⊆ t) : t.mulIndicator f = f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_eq_one : (mulIndicator s f = fun x => 1) ↔ Disjoint (mulSupport f) s :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_apply_ne_one {a : α} : s.mulIndicator f a ≠ 1 ↔ a ∈ s ∩ mulSupport f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulSupport_mulIndicator : Function.mulSupport (s.mulIndicator f) = s ∩ Function.mulSupport f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_congr (h : EqOn f g s) : mulIndicator s f = mulIndicator s g :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_one (s : Set α) : (mulIndicator s fun _ => (1 : M)) = fun _ => (1 : M) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_mulIndicator (s t : Set α) (f : α → M) : mulIndicator s (mulIndicator t f) = mulIndicator (s ∩ t) f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_inter_mulSupport (s : Set α) (f : α → M) : mulIndicator (s ∩ mulSupport f) f = mulIndicator s f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem comp_mulIndicator (h : M → β) (f : α → M) {s : Set α} {x : α} [DecidablePred (· ∈ s)] : h (s.mulIndicator f x) = s.piecewise (h ∘ f) (const α (h 1)) x :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_comp_right {s : Set α} (f : β → α) {g : α → M} {x : β} : mulIndicator (f ⁻¹' s) (g ∘ f) x = mulIndicator s g (f x) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_image {s : Set α} {f : β → M} {g : α → β} (hg : Injective g) {x : α} : mulIndicator (g '' s) f (g x) = mulIndicator s (f ∘ g) x :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_comp_of_one {g : M → N} (hg : g 1 = 1) : mulIndicator s (g ∘ f) = g ∘ mulIndicator s f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_one_preimage (s : Set M) : t.mulIndicator 1 ⁻¹' s ∈ ({Set.univ, ∅} : Set (Set α)) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_const_preimage_eq_union (U : Set α) (s : Set M) (a : M) [Decidable (a ∈ s)] [Decidable ((1 : M) ∈ s)] : (U.mulIndicator fun _ => a) ⁻¹' s = (if a ∈ s then U else ∅) ∪ if (1 : M) ∈ s then Uᶜ else ∅ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_const_preimage (U : Set α) (s : Set M) (a : M) : (U.mulIndicator fun _ => a) ⁻¹' s ∈ ({Set.univ, U, Uᶜ, ∅} : Set (Set α)) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_preimage_of_not_mem (s : Set α) (f : α → M) {t : Set M} (ht : (1 : M) ∉ t) : mulIndicator s f ⁻¹' t = f ⁻¹' t ∩ s :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mem_range_mulIndicator {r : M} {s : Set α} {f : α → M} : r ∈ range (mulIndicator s f) ↔ r = 1 ∧ s ≠ univ ∨ r ∈ f '' s :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_rel_mulIndicator {r : M → M → Prop} (h1 : r 1 1) (ha : a ∈ s → r (f a) (g a)) : r (mulIndicator s f a) (mulIndicator s g a) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_union_mul_inter_apply (f : α → M) (s t : Set α) (a : α) : mulIndicator (s ∪ t) f a * mulIndicator (s ∩ t) f a = mulIndicator s f a * mulIndicator t f a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_union_of_not_mem_inter (h : a ∉ s ∩ t) (f : α → M) : mulIndicator (s ∪ t) f a = mulIndicator s f a * mulIndicator t f a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_mul (s : Set α) (f g : α → M) : (mulIndicator s fun a => f a * g a) = fun a => mulIndicator s f a * mulIndicator s g a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_compl_mul_self_apply (s : Set α) (f : α → M) (a : α) : mulIndicator sᶜ f a * mulIndicator s f a = f a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_self_mul_compl_apply (s : Set α) (f : α → M) (a : α) : mulIndicator s f a * mulIndicator sᶜ f a = f a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_mul_eq_left {f g : α → M} (h : Disjoint (mulSupport f) (mulSupport g)) : (mulSupport f).mulIndicator (f * g) = f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_mul_eq_right {f g : α → M} (h : Disjoint (mulSupport f) (mulSupport g)) : (mulSupport g).mulIndicator (f * g) = g :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_mul_compl_eq_piecewise [DecidablePred (· ∈ s)] (f g : α → M) : s.mulIndicator f * sᶜ.mulIndicator g = s.piecewise f g :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_compl' (s : Set α) (f : α → G) : mulIndicator sᶜ f = f / mulIndicator s f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_diff (h : s ⊆ t) (f : α → G) : mulIndicator (t \\ s) f = mulIndicator t f * (mulIndicator s f)⁻¹ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mulIndicator_diff' (h : s ⊆ t) (f : α → G) : mulIndicator (t \\ s) f = mulIndicator t f / mulIndicator s f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem apply_mulIndicator_symmDiff {g : G → β} (hg : ∀ x, g x⁻¹ = g x) (s t : Set α) (f : α → G) (x : α): g (mulIndicator (s ∆ t) f x) = g (mulIndicator s f x / mulIndicator t f x) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem MonoidHom.map_mulIndicator {M N : Type*} [MulOneClass M] [MulOneClass N] (f : M →* N) (s : Set α) (g : α → M) (x : α) : f (s.mulIndicator g x) = s.mulIndicator (f ∘ g) x :=", "area": "Algebra"} {"task": "t8", "statement": "@[to_additive (attr := simp)] lemma coe_monoidHom_comp_coe_monoidHom_symm (e : M ≃* N) : (e : M →* N).comp e.symm = MonoidHom.id _ :=", "area": "Algebra"} {"task": "t8", "statement": "@[to_additive (attr := simp)] lemma coe_monoidHom_symm_comp_coe_monoidHom (e : M ≃* N) : (e.symm : N →* M).comp e = MonoidHom.id _ :=", "area": "Algebra"} {"task": "t8", "statement": "@[to_additive] lemma comp_left_injective (e : M ≃* N) : Injective fun f : N →* P ↦ f.comp (e : M →* N) :=", "area": "Algebra"} {"task": "t8", "statement": "@[to_additive] lemma comp_right_injective (e : M ≃* N) : Injective fun f : P →* M ↦ (e : M →* N).comp f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem eq_top_of_card_eq [Finite H] (h : Nat.card H = Nat.card G) : H = ⊤ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem card_eq_iff_eq_top [Finite H] : Nat.card H = Nat.card G ↔ H = ⊤ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem card_le_one_iff_eq_bot [Finite H] : Nat.card H ≤ 1 ↔ H = ⊥ :=", "area": "Algebra"} {"task": "t8", "statement": "@[to_additive] lemma eq_bot_iff_card : H = ⊥ ↔ Nat.card H = 1 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem pi_mem_of_mulSingle_mem_aux [DecidableEq η] (I : Finset η) {H : Subgroup (∀ i, f i)} (x : ∀ i, f i) (h1 : ∀ i, i ∉ I → x i = 1) (h2 : ∀ i, i ∈ I → Pi.mulSingle i (x i) ∈ H) : x ∈ H :=", "area": "Algebra"} {"task": "t8", "statement": "theorem pi_mem_of_mulSingle_mem [Finite η] [DecidableEq η] {H : Subgroup (∀ i, f i)} (x : ∀ i, f i) (h : ∀ i, Pi.mulSingle i (x i) ∈ H) : x ∈ H :=", "area": "Algebra"} {"task": "t8", "statement": "theorem pi_le_iff [DecidableEq η] [Finite η] {H : ∀ i, Subgroup (f i)} {J : Subgroup (∀ i, f i)} : pi univ H ≤ J ↔ ∀ i : η, map (MonoidHom.mulSingle f i) (H i) ≤ J :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mem_normalizer_fintype {S : Set G} [Finite S] {x : G} (h : ∀ n, n ∈ S → x * n * x⁻¹ ∈ S) : x ∈ Subgroup.setNormalizer S :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mem_iInf {ι : Sort*} {S : ι → Subsemigroup M} {x : M} : (x ∈ ⨅ i, S i) ↔ ∀ i, x ∈ S i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coe_iInf {ι : Sort*} {S : ι → Subsemigroup M} : (↑(⨅ i, S i) : Set M) = ⋂ i, S i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem subsingleton_of_subsingleton [Subsingleton (Subsemigroup M)] : Subsingleton M :=", "area": "Algebra"} {"task": "t8", "statement": "theorem closure_induction' (s : Set M) {p : ∀ x, x ∈ closure s → Prop} (mem : ∀ (x) (h : x ∈ s), p x (subset_closure h)) (mul : ∀ x hx y hy, p x hx → p y hy → p (x * y) (mul_mem hx hy)) {x} (hx : x ∈ closure s) : p x hx :=", "area": "Algebra"} {"task": "t8", "statement": "theorem dense_induction {p : M → Prop} (x : M) {s : Set M} (hs : closure s = ⊤) (mem : ∀ x ∈ s, p x) (mul : ∀ x y, p x → p y → p (x * y)) : p x :=", "area": "Algebra"} {"task": "t8", "statement": "theorem closure_singleton_le_iff_mem (m : M) (p : Subsemigroup M) : closure {m} ≤ p ↔ m ∈ p :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mem_iSup {ι : Sort*} (p : ι → Subsemigroup M) {m : M} : (m ∈ ⨆ i, p i) ↔ ∀ N, (∀ i, p i ≤ N) → m ∈ N :=", "area": "Algebra"} {"task": "t8", "statement": "theorem iSup_eq_closure {ι : Sort*} (p : ι → Subsemigroup M) : ⨆ i, p i = Subsemigroup.closure (⋃ i, (p i : Set M)) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_rename (f : R →+* S) (g : σ → τ) (p : MvPolynomial σ R) : map f (rename g p) = rename g (map f p) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem rename_rename (f : σ → τ) (g : τ → α) (p : MvPolynomial σ R) : rename g (rename f p) = rename (g ∘ f) p :=", "area": "Algebra"} {"task": "t8", "statement": "theorem rename_monomial (f : σ → τ) (d : σ →₀ ℕ) (r : R) : rename f (monomial d r) = monomial (d.mapDomain f) r :=", "area": "Algebra"} {"task": "t8", "statement": "theorem rename_eq (f : σ → τ) (p : MvPolynomial σ R) : rename f p = Finsupp.mapDomain (Finsupp.mapDomain f) p :=", "area": "Algebra"} {"task": "t8", "statement": "theorem rename_injective (f : σ → τ) (hf : Function.Injective f) : Function.Injective (rename f : MvPolynomial σ R → MvPolynomial τ R) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem killCompl_comp_rename : (killCompl hf).comp (rename f) = AlgHom.id R _ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem eval₂_rename : (rename k p).eval₂ f g = p.eval₂ f (g ∘ k) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem rename_eval₂ (g : τ → MvPolynomial σ R) : rename k (p.eval₂ C (g ∘ k)) = (rename k p).eval₂ C (rename k ∘ g) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem rename_prod_mk_eval₂ (j : τ) (g : σ → MvPolynomial σ R) : rename (Prod.mk j) (p.eval₂ C g) = p.eval₂ C fun x => rename (Prod.mk j) (g x) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem eval₂_rename_prod_mk (g : σ × τ → S) (i : σ) (p : MvPolynomial τ R) : (rename (Prod.mk i) p).eval₂ f g = eval₂ f (fun j => g (i, j)) p :=", "area": "Algebra"} {"task": "t8", "statement": "theorem exists_finset_rename (p : MvPolynomial σ R) : ∃ (s : Finset σ) (q : MvPolynomial { x // x ∈ s } R), p = rename (↑) q :=", "area": "Algebra"} {"task": "t8", "statement": "theorem exists_finset_rename₂ (p₁ p₂ : MvPolynomial σ R) : ∃ (s : Finset σ) (q₁ q₂ : MvPolynomial s R), p₁ = rename (↑) q₁ ∧ p₂ = rename (↑) q₂ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem exists_fin_rename (p : MvPolynomial σ R) : ∃ (n : ℕ) (f : Fin n → σ) (_hf : Injective f) (q : MvPolynomial (Fin n) R), p = rename f q :=", "area": "Algebra"} {"task": "t8", "statement": "theorem eval₂_cast_comp (f : σ → τ) (c : ℤ →+* R) (g : τ → R) (p : MvPolynomial σ ℤ) : eval₂ c (g ∘ f) p = eval₂ c g (rename f p) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_rename_mapDomain (f : σ → τ) (hf : Injective f) (φ : MvPolynomial σ R) (d : σ →₀ ℕ) : (rename f φ).coeff (d.mapDomain f) = φ.coeff d :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_rename_embDomain (f : σ ↪ τ) (φ : MvPolynomial σ R) (d : σ →₀ ℕ) : (rename f φ).coeff (d.embDomain f) = φ.coeff d :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_rename_eq_zero (f : σ → τ) (φ : MvPolynomial σ R) (d : τ →₀ ℕ) (h : ∀ u : σ →₀ ℕ, u.mapDomain f = d → φ.coeff u = 0) : (rename f φ).coeff d = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_rename_ne_zero (f : σ → τ) (φ : MvPolynomial σ R) (d : τ →₀ ℕ) (h : (rename f φ).coeff d ≠ 0) : ∃ u : σ →₀ ℕ, u.mapDomain f = d ∧ φ.coeff u ≠ 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem constantCoeff_rename {τ : Type*} (f : σ → τ) (φ : MvPolynomial σ R) : constantCoeff (rename f φ) = constantCoeff φ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_rename_of_injective {p : MvPolynomial σ R} {f : σ → τ} [DecidableEq τ] (h : Function.Injective f) : (rename f p).support = Finset.image (Finsupp.mapDomain f) p.support :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lcm_add (s₁ s₂ : Multiset α) : (s₁ + s₂).lcm = GCDMonoid.lcm s₁.lcm s₂.lcm :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lcm_dvd {s : Multiset α} {a : α} : s.lcm ∣ a ↔ ∀ b ∈ s, b ∣ a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem normalize_lcm (s : Multiset α) : normalize s.lcm = s.lcm :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lcm_eq_zero_iff [Nontrivial α] (s : Multiset α) : s.lcm = 0 ↔ (0 : α) ∈ s :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lcm_dedup (s : Multiset α) : (dedup s).lcm = s.lcm :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lcm_ndunion (s₁ s₂ : Multiset α) : (ndunion s₁ s₂).lcm = GCDMonoid.lcm s₁.lcm s₂.lcm :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lcm_union (s₁ s₂ : Multiset α) : (s₁ ∪ s₂).lcm = GCDMonoid.lcm s₁.lcm s₂.lcm :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lcm_ndinsert (a : α) (s : Multiset α) : (ndinsert a s).lcm = GCDMonoid.lcm a s.lcm :=", "area": "Algebra"} {"task": "t8", "statement": "theorem gcd_add (s₁ s₂ : Multiset α) : (s₁ + s₂).gcd = GCDMonoid.gcd s₁.gcd s₂.gcd :=", "area": "Algebra"} {"task": "t8", "statement": "theorem dvd_gcd {s : Multiset α} {a : α} : a ∣ s.gcd ↔ ∀ b ∈ s, a ∣ b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem normalize_gcd (s : Multiset α) : normalize s.gcd = s.gcd :=", "area": "Algebra"} {"task": "t8", "statement": "theorem gcd_eq_zero_iff (s : Multiset α) : s.gcd = 0 ↔ ∀ x : α, x ∈ s → x = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem gcd_map_mul (a : α) (s : Multiset α) : (s.map (a * ·)).gcd = normalize a * s.gcd :=", "area": "Algebra"} {"task": "t8", "statement": "theorem gcd_dedup (s : Multiset α) : (dedup s).gcd = s.gcd :=", "area": "Algebra"} {"task": "t8", "statement": "theorem gcd_ndunion (s₁ s₂ : Multiset α) : (ndunion s₁ s₂).gcd = GCDMonoid.gcd s₁.gcd s₂.gcd :=", "area": "Algebra"} {"task": "t8", "statement": "theorem gcd_union (s₁ s₂ : Multiset α) : (s₁ ∪ s₂).gcd = GCDMonoid.gcd s₁.gcd s₂.gcd :=", "area": "Algebra"} {"task": "t8", "statement": "theorem gcd_ndinsert (a : α) (s : Multiset α) : (ndinsert a s).gcd = GCDMonoid.gcd a s.gcd :=", "area": "Algebra"} {"task": "t8", "statement": "theorem extract_gcd' (s t : Multiset α) (hs : ∃ x, x ∈ s ∧ x ≠ (0 : α)) (ht : s = t.map (s.gcd * ·)) : t.gcd = 1 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem extract_gcd (s : Multiset α) (hs : s ≠ 0) : ∃ t : Multiset α, s = t.map (s.gcd * ·) ∧ t.gcd = 1 :=", "area": "Algebra"} {"task": "t8", "statement": "@[to_additive] lemma mul_prod_Ico_eq_prod_Icc (h : a ≤ b) : f b * ∏ x ∈ Ico a b, f x = ∏ x ∈ Icc a b, f x :=", "area": "Algebra"} {"task": "t8", "statement": "@[to_additive] lemma prod_Ico_mul_eq_prod_Icc (h : a ≤ b) : (∏ x ∈ Ico a b, f x) * f b = ∏ x ∈ Icc a b, f x :=", "area": "Algebra"} {"task": "t8", "statement": "@[to_additive] lemma mul_prod_Ioc_eq_prod_Icc (h : a ≤ b) : f a * ∏ x ∈ Ioc a b, f x = ∏ x ∈ Icc a b, f x :=", "area": "Algebra"} {"task": "t8", "statement": "@[to_additive] lemma prod_Ioc_mul_eq_prod_Icc (h : a ≤ b) : (∏ x ∈ Ioc a b, f x) * f a = ∏ x ∈ Icc a b, f x :=", "area": "Algebra"} {"task": "t8", "statement": "@[to_additive] lemma mul_prod_Ioi_eq_prod_Ici (a : α) : f a * ∏ x ∈ Ioi a, f x = ∏ x ∈ Ici a, f x :=", "area": "Algebra"} {"task": "t8", "statement": "@[to_additive] lemma prod_Ioi_mul_eq_prod_Ici (a : α) : (∏ x ∈ Ioi a, f x) * f a = ∏ x ∈ Ici a, f x :=", "area": "Algebra"} {"task": "t8", "statement": "@[to_additive] lemma mul_prod_Iio_eq_prod_Iic (a : α) : f a * ∏ x ∈ Iio a, f x = ∏ x ∈ Iic a, f x :=", "area": "Algebra"} {"task": "t8", "statement": "@[to_additive] lemma prod_Iio_mul_eq_prod_Iic (a : α) : (∏ x ∈ Iio a, f x) * f a = ∏ x ∈ Iic a, f x :=", "area": "Algebra"} {"task": "t8", "statement": "@[to_additive] lemma prod_prod_Ioi_mul_eq_prod_prod_off_diag (f : α → α → M) : ∏ i, ∏ j ∈ Ioi i, f j i * f i j = ∏ i, ∏ j ∈ {i}ᶜ, f j i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem prod_Ico_add' [OrderedCancelAddCommMonoid α] [ExistsAddOfLE α] [LocallyFiniteOrder α] (f : α → M) (a b c : α) : (∏ x ∈ Ico a b, f (x + c)) = ∏ x ∈ Ico (a + c) (b + c), f x :=", "area": "Algebra"} {"task": "t8", "statement": "theorem prod_Ico_add [OrderedCancelAddCommMonoid α] [ExistsAddOfLE α] [LocallyFiniteOrder α] (f : α → M) (a b c : α) : (∏ x ∈ Ico a b, f (c + x)) = ∏ x ∈ Ico (a + c) (b + c), f x :=", "area": "Algebra"} {"task": "t8", "statement": "theorem prod_Ico_succ_top {a b : ℕ} (hab : a ≤ b) (f : ℕ → M) : (∏ k ∈ Ico a (b + 1), f k) = (∏ k ∈ Ico a b, f k) * f b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem prod_eq_prod_Ico_succ_bot {a b : ℕ} (hab : a < b) (f : ℕ → M) : ∏ k ∈ Ico a b, f k = f a * ∏ k ∈ Ico (a + 1) b, f k :=", "area": "Algebra"} {"task": "t8", "statement": "theorem prod_Ioc_consecutive (f : ℕ → M) {m n k : ℕ} (hmn : m ≤ n) (hnk : n ≤ k) : ((∏ i ∈ Ioc m n, f i) * ∏ i ∈ Ioc n k, f i) = ∏ i ∈ Ioc m k, f i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem prod_Ioc_succ_top {a b : ℕ} (hab : a ≤ b) (f : ℕ → M) : (∏ k ∈ Ioc a (b + 1), f k) = (∏ k ∈ Ioc a b, f k) * f (b + 1) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem prod_Icc_succ_top {a b : ℕ} (hab : a ≤ b + 1) (f : ℕ → M) : (∏ k in Icc a (b + 1), f k) = (∏ k in Icc a b, f k) * f (b + 1) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem prod_Ico_eq_mul_inv {δ : Type*} [CommGroup δ] (f : ℕ → δ) {m n : ℕ} (h : m ≤ n) : ∏ k ∈ Ico m n, f k = (∏ k ∈ range n, f k) * (∏ k ∈ range m, f k)⁻¹ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem prod_Ico_eq_div {δ : Type*} [CommGroup δ] (f : ℕ → δ) {m n : ℕ} (h : m ≤ n) : ∏ k ∈ Ico m n, f k = (∏ k ∈ range n, f k) / ∏ k ∈ range m, f k :=", "area": "Algebra"} {"task": "t8", "statement": "theorem prod_range_div_prod_range {α : Type*} [CommGroup α] {f : ℕ → α} {n m : ℕ} (hnm : n ≤ m) : ((∏ k ∈ range m, f k) / ∏ k ∈ range n, f k) = ∏ k ∈ (range m).filter fun k => n ≤ k, f k :=", "area": "Algebra"} {"task": "t8", "statement": "theorem sum_Ico_Ico_comm {M : Type*} [AddCommMonoid M] (a b : ℕ) (f : ℕ → ℕ → M) : (∑ i ∈ Finset.Ico a b, ∑ j ∈ Finset.Ico i b, f i j) = ∑ j ∈ Finset.Ico a b, ∑ i ∈ Finset.Ico a (j + 1), f i j :=", "area": "Algebra"} {"task": "t8", "statement": "theorem sum_Ico_Ico_comm' {M : Type*} [AddCommMonoid M] (a b : ℕ) (f : ℕ → ℕ → M) : (∑ i ∈ Finset.Ico a b, ∑ j ∈ Finset.Ico (i + 1) b, f i j) = ∑ j ∈ Finset.Ico a b, ∑ i ∈ Finset.Ico a j, f i j :=", "area": "Algebra"} {"task": "t8", "statement": "theorem prod_Ico_eq_prod_range (f : ℕ → M) (m n : ℕ) : ∏ k ∈ Ico m n, f k = ∏ k ∈ range (n - m), f (m + k) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem prod_Ico_reflect (f : ℕ → M) (k : ℕ) {m n : ℕ} (h : m ≤ n + 1) : (∏ j ∈ Ico k m, f (n - j)) = ∏ j ∈ Ico (n + 1 - m) (n + 1 - k), f j :=", "area": "Algebra"} {"task": "t8", "statement": "theorem prod_range_reflect (f : ℕ → M) (n : ℕ) : (∏ j ∈ range n, f (n - 1 - j)) = ∏ j ∈ range n, f j :=", "area": "Algebra"} {"task": "t8", "statement": "theorem prod_Ico_id_eq_factorial : ∀ n : ℕ, (∏ x ∈ Ico 1 (n + 1), x) = n !", "area": "Algebra"} {"task": "t8", "statement": "theorem prod_range_add_one_eq_factorial : ∀ n : ℕ, (∏ x ∈ range n, (x + 1)) = n !", "area": "Algebra"} {"task": "t8", "statement": "theorem sum_range_id_mul_two (n : ℕ) : (∑ i ∈ range n, i) * 2 = n * (n - 1) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem sum_range_id (n : ℕ) : ∑ i ∈ range n, i = n * (n - 1) / 2 :=", "area": "Algebra"} {"task": "t8", "statement": "@[to_additive] lemma prod_range_diag_flip (n : ℕ) (f : ℕ → ℕ → M) : (∏ m ∈ range n, ∏ k ∈ range (m + 1), f k (m - k)) = ∏ m ∈ range n, ∏ k ∈ range (n - m), f m k :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Submodule.isInternal_prime_power_torsion_of_pid [Module.Finite R M] (hM : Module.IsTorsion R M) : DirectSum.IsInternal fun p : (factors (⊤ : Submodule R M).annihilator).toFinset => torsionBy R M (IsPrincipal.generator (p : Ideal R) ^ (factors (⊤ : Submodule R M).annihilator).count ↑p) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Submodule.exists_isInternal_prime_power_torsion_of_pid [Module.Finite R M] (hM : Module.IsTorsion R M) : ∃ (ι : Type u) (_ : Fintype ι) (_ : DecidableEq ι) (p : ι → R) (_ : ∀ i, Irreducible <| p i) (e : ι → ℕ), DirectSum.IsInternal fun i => torsionBy R M <| p i ^ e i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem _root_.Ideal.torsionOf_eq_span_pow_pOrder (x : M) : torsionOf R M x = span {p ^ pOrder hM x} :=", "area": "Algebra"} {"task": "t8", "statement": "theorem p_pow_smul_lift {x y : M} {k : ℕ} (hM' : Module.IsTorsionBy R M (p ^ pOrder hM y)) (h : p ^ k • x ∈ R ∙ y) : ∃ a : R, p ^ k • x = p ^ k • a • y :=", "area": "Algebra"} {"task": "t8", "statement": "theorem exists_smul_eq_zero_and_mk_eq {z : M} (hz : Module.IsTorsionBy R M (p ^ pOrder hM z)) {k : ℕ} (f : (R ⧸ R ∙ p ^ k) →ₗ[R] M ⧸ R ∙ z) : ∃ x : M, p ^ k • x = 0 ∧ Submodule.Quotient.mk (p := span R {z}) x = f 1 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem torsion_by_prime_power_decomposition (hN : Module.IsTorsion' N (Submonoid.powers p)) [h' : Module.Finite R N] : ∃ (d : ℕ) (k : Fin d → ℕ), Nonempty <| N ≃ₗ[R] ⨁ i : Fin d, R ⧸ R ∙ p ^ (k i : ℕ) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem equiv_directSum_of_isTorsion [h' : Module.Finite R N] (hN : Module.IsTorsion R N) : ∃ (ι : Type u) (_ : Fintype ι) (p : ι → R) (_ : ∀ i, Irreducible <| p i) (e : ι → ℕ), Nonempty <| N ≃ₗ[R] ⨁ i : ι, R ⧸ R ∙ p i ^ e i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem equiv_free_prod_directSum [h' : Module.Finite R N] : ∃ (n : ℕ) (ι : Type u) (_ : Fintype ι) (p : ι → R) (_ : ∀ i, Irreducible <| p i) (e : ι → ℕ), Nonempty <| N ≃ₗ[R] (Fin n →₀ R) × ⨁ i : ι, R ⧸ R ∙ p i ^ e i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem torsionOf_zero : torsionOf R M (0 : M) = ⊤ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem torsionOf_eq_top_iff (m : M) : torsionOf R M m = ⊤ ↔ m = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem torsionOf_eq_bot_iff_of_noZeroSMulDivisors [Nontrivial R] [NoZeroSMulDivisors R M] (m : M) : torsionOf R M m = ⊥ ↔ m ≠ 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem CompleteLattice.Independent.linear_independent' {ι R M : Type*} {v : ι → M} [Ring R] [AddCommGroup M] [Module R M] (hv : CompleteLattice.Independent fun i => R ∙ v i) (h_ne_zero : ∀ i, Ideal.torsionOf R M (v i) = ⊥) : LinearIndependent R v :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mem_torsionBySet_iff (x : M) : x ∈ torsionBySet R M s ↔ ∀ a : s, (a : R) • x = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem torsionBySet_singleton_eq : torsionBySet R M {a} = torsionBy R M a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem torsionBySet_eq_torsionBySet_span : torsionBySet R M s = torsionBySet R M (Ideal.span s) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem torsionBy_le_torsionBy_of_dvd (a b : R) (dvd : a ∣ b) : torsionBy R M a ≤ torsionBy R M b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem torsionBy_one : torsionBy R M 1 = ⊥ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem torsionBySet_univ : torsionBySet R M Set.univ = ⊥ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem isTorsionBySet_singleton_iff : IsTorsionBySet R M {a} ↔ IsTorsionBy R M a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem isTorsionBySet_iff_torsionBySet_eq_top : IsTorsionBySet R M s ↔ Submodule.torsionBySet R M s = ⊤ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem isTorsionBy_iff_torsionBy_eq_top : IsTorsionBy R M a ↔ torsionBy R M a = ⊤ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem isTorsionBySet_iff_is_torsion_by_span : IsTorsionBySet R M s ↔ IsTorsionBySet R M (Ideal.span s) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem iSup_torsionBySet_ideal_eq_torsionBySet_iInf : ⨆ i ∈ S, torsionBySet R M (p i) = torsionBySet R M ↑(⨅ i ∈ S, p i) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem supIndep_torsionBySet_ideal : S.SupIndep fun i => torsionBySet R M <| p i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem iSup_torsionBy_eq_torsionBy_prod : ⨆ i ∈ S, torsionBy R M (q i) = torsionBy R M (∏ i ∈ S, q i) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem supIndep_torsionBy : S.SupIndep fun i => torsionBy R M <| q i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem torsionBySet_isInternal {p : ι → Ideal R} (hp : (S : Set ι).Pairwise fun i j => p i ⊔ p j = ⊤) (hM : Module.IsTorsionBySet R M (⨅ i ∈ S, p i : Ideal R)) : DirectSum.IsInternal fun i : S => torsionBySet R M <| p i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem torsionBy_isInternal {q : ι → R} (hq : (S : Set ι).Pairwise <| (IsCoprime on q)) (hM : Module.IsTorsionBy R M <| ∏ i ∈ S, q i) : DirectSum.IsInternal fun i : S => torsionBy R M <| q i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem isTorsion'_iff_torsion'_eq_top : IsTorsion' M S ↔ torsion' R M S = ⊤ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem _root_.Submodule.annihilator_top_inter_nonZeroDivisors [Module.Finite R M] (hM : Module.IsTorsion R M) : ((⊤ : Submodule R M).annihilator : Set R) ∩ R⁰ ≠ ∅ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coe_torsion_eq_annihilator_ne_bot : (torsion R M : Set M) = { x : M | (R ∙ x).annihilator ≠ ⊥ } :=", "area": "Algebra"} {"task": "t8", "statement": "theorem noZeroSMulDivisors_iff_torsion_eq_bot : NoZeroSMulDivisors R M ↔ torsion R M = ⊥ :=", "area": "Algebra"} {"task": "t8", "statement": "lemma torsion_int {G} [AddCommGroup G] : (torsion ℤ G).toAddSubgroup = AddCommGroup.torsion G :=", "area": "Algebra"} {"task": "t8", "statement": "theorem torsion_eq_bot : torsion R (M ⧸ torsion R M) = ⊥ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem isTorsion'_powers_iff (p : R) : IsTorsion' M (Submonoid.powers p) ↔ ∀ x : M, ∃ n : ℕ, p ^ n • x = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem exists_isTorsionBy {p : R} (hM : IsTorsion' M <| Submonoid.powers p) (d : ℕ) (hd : d ≠ 0) (s : Fin d → M) (hs : span R (Set.range s) = ⊤) : ∃ j : Fin d, Module.IsTorsionBy R M (p ^ pOrder hM (s j)) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem torsionBy_eq_span_singleton {R : Type w} [CommRing R] (a b : R) (ha : a ∈ R⁰) : torsionBy R (R ⧸ R ∙ a * b) a = R ∙ mk (R ∙ a * b) b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem isTorsion_iff_isTorsion_nat [AddCommMonoid M] : AddMonoid.IsTorsion M ↔ Module.IsTorsion ℕ M :=", "area": "Algebra"} {"task": "t8", "statement": "theorem isTorsion_iff_isTorsion_int [AddCommGroup M] : AddMonoid.IsTorsion M ↔ Module.IsTorsion ℤ M :=", "area": "Algebra"} {"task": "t8", "statement": "theorem projective_def' : Projective R P ↔ ∃ s : P →ₗ[R] P →₀ R, Finsupp.total P P R id ∘ₗ s = .id :=", "area": "Algebra"} {"task": "t8", "statement": "theorem projective_lifting_property [h : Projective R P] (f : M →ₗ[R] N) (g : P →ₗ[R] N) (hf : Function.Surjective f) : ∃ h : P →ₗ[R] M, f.comp h = g :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Projective.of_basis {ι : Type*} (b : Basis ι R P) : Projective R P :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Projective.of_split [Module.Projective R M] (i : P →ₗ[R] M) (s : M →ₗ[R] P) (H : s.comp i = LinearMap.id) : Module.Projective R P :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Projective.of_equiv [Module.Projective R M] (e : M ≃ₗ[R] P) : Module.Projective R P :=", "area": "Algebra"} {"task": "t8", "statement": "lemma restrict_sub {R M M₁ : Type*} [Ring R] [AddCommGroup M] [AddCommGroup M₁] [Module R M] [Module R M₁] {p : Submodule R M} {q : Submodule R M₁} {f g : M →ₗ[R] M₁} (hf : MapsTo f p q) (hg : MapsTo g p q) (hfg : MapsTo (f - g) p q := fun _ hx ↦ q.sub_mem (hf hx) (hg hx)) : f.restrict hf - g.restrict hg = (f - g).restrict hfg :=", "area": "Algebra"} {"task": "t8", "statement": "lemma restrict_commute {f g : M →ₗ[R] M} (h : Commute f g) {p : Submodule R M} (hf : MapsTo f p p) (hg : MapsTo g p p) : Commute (f.restrict hf) (g.restrict hg) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem submodule_pow_eq_zero_of_pow_eq_zero {N : Submodule R M} {g : Module.End R N} {G : Module.End R M} (h : G.comp N.subtype = N.subtype.comp g) {k : ℕ} (hG : G ^ k = 0) : g ^ k = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem pow_apply_mem_of_forall_mem {p : Submodule R M} (n : ℕ) (h : ∀ x ∈ p, f' x ∈ p) (x : M) (hx : x ∈ p) : (f' ^ n) x ∈ p :=", "area": "Algebra"} {"task": "t8", "statement": "theorem pow_restrict {p : Submodule R M} (n : ℕ) (h : ∀ x ∈ p, f' x ∈ p) (h' := pow_apply_mem_of_forall_mem n h) : (f'.restrict h) ^ n = (f' ^ n).restrict h' :=", "area": "Algebra"} {"task": "t8", "statement": "theorem subtype_comp_inclusion (p q : Submodule R M) (h : p ≤ q) : q.subtype.comp (inclusion h) = p.subtype :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ker_le_ker_comp (f : M →ₛₗ[τ₁₂] M₂) (g : M₂ →ₛₗ[τ₂₃] M₃) : ker f ≤ ker (g.comp f : M →ₛₗ[τ₁₃] M₃) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ker_sup_ker_le_ker_comp_of_commute {f g : M →ₗ[R] M} (h : Commute f g) : ker f ⊔ ker g ≤ ker (f ∘ₗ g) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ker_le_comap {p : Submodule R₂ M₂} (f : M →ₛₗ[τ₁₂] M₂) : ker f ≤ p.comap f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem disjoint_ker {f : F} {p : Submodule R M} : Disjoint p (ker f) ↔ ∀ x ∈ p, f x = 0 → x = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ker_eq_bot' {f : F} : ker f = ⊥ ↔ ∀ m, f m = 0 → m = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ker_eq_bot_of_inverse {τ₂₁ : R₂ →+* R} [RingHomInvPair τ₁₂ τ₂₁] {f : M →ₛₗ[τ₁₂] M₂} {g : M₂ →ₛₗ[τ₂₁] M} (h : (g.comp f : M →ₗ[R] M) = id) : ker f = ⊥ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem le_ker_iff_map [RingHomSurjective τ₁₂] {f : F} {p : Submodule R M} : p ≤ ker f ↔ map f p = ⊥ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ker_codRestrict {τ₂₁ : R₂ →+* R} (p : Submodule R M) (f : M₂ →ₛₗ[τ₂₁] M) (hf) : ker (codRestrict p f hf) = ker f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ker_restrict [AddCommMonoid M₁] [Module R M₁] {p : Submodule R M} {q : Submodule R M₁} {f : M →ₗ[R] M₁} (hf : ∀ x : M, x ∈ p → f x ∈ q) : ker (f.restrict hf) = LinearMap.ker (f.domRestrict p) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ker_zero : ker (0 : M →ₛₗ[τ₁₂] M₂) = ⊤ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ker_eq_bot_of_injective {f : F} (hf : Injective f) : ker f = ⊥ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem sub_mem_ker_iff {x y} : x - y ∈ ker f ↔ f x = f y :=", "area": "Algebra"} {"task": "t8", "statement": "theorem disjoint_ker' {p : Submodule R M} : Disjoint p (ker f) ↔ ∀ x ∈ p, ∀ y ∈ p, f x = f y → x = y :=", "area": "Algebra"} {"task": "t8", "statement": "theorem _root_.LinearMapClass.ker_eq_bot : ker f = ⊥ ↔ Injective f :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma injective_domRestrict_iff {f : M →ₛₗ[τ₁₂] M₂} {S : Submodule R M} : Injective (f.domRestrict S) ↔ S ⊓ LinearMap.ker f = ⊥ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem injective_restrict_iff_disjoint {p : Submodule R M} {f : M →ₗ[R] M} (hf : ∀ x ∈ p, f x ∈ p) : Injective (f.restrict hf) ↔ Disjoint p (ker f) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ker_inclusion (p p' : Submodule R M) (h : p ≤ p') : ker (inclusion h) = ⊥ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ker_comp_of_ker_eq_bot (f : M →ₛₗ[τ₁₂] M₂) {g : M₂ →ₛₗ[τ₂₃] M₃} (hg : ker g = ⊥) : ker (g.comp f : M →ₛₗ[τ₁₃] M₃) = ker f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem span_top : span K (span ℤ (Set.range b) : Set E) = ⊤ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_fundamentalDomain {F : Type*} [NormedAddCommGroup F] [NormedSpace K F] (f : E ≃ₗ[K] F) : f '' (fundamentalDomain b) = fundamentalDomain (b.map f) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem fundamentalDomain_reindex {ι' : Type*} (e : ι ≃ ι') : fundamentalDomain (b.reindex e) = fundamentalDomain b :=", "area": "Algebra"} {"task": "t8", "statement": "lemma fundamentalDomain_pi_basisFun [Fintype ι] : fundamentalDomain (Pi.basisFun ℝ ι) = Set.pi Set.univ fun _ : ι ↦ Set.Ico (0 : ℝ) 1 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem repr_floor_apply (m : E) (i : ι) : b.repr (floor b m) i = ⌊b.repr m i⌋ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem repr_ceil_apply (m : E) (i : ι) : b.repr (ceil b m) i = ⌈b.repr m i⌉ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem floor_eq_self_of_mem (m : E) (h : m ∈ span ℤ (Set.range b)) : (floor b m : E) = m :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ceil_eq_self_of_mem (m : E) (h : m ∈ span ℤ (Set.range b)) : (ceil b m : E) = m :=", "area": "Algebra"} {"task": "t8", "statement": "theorem repr_fract_apply (m : E) (i : ι) : b.repr (fract b m) i = Int.fract (b.repr m i) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem fract_fract (m : E) : fract b (fract b m) = fract b m :=", "area": "Algebra"} {"task": "t8", "statement": "theorem fract_zspan_add (m : E) {v : E} (h : v ∈ span ℤ (Set.range b)) : fract b (v + m) = fract b m :=", "area": "Algebra"} {"task": "t8", "statement": "theorem fract_add_zspan (m : E) {v : E} (h : v ∈ span ℤ (Set.range b)) : fract b (m + v) = fract b m :=", "area": "Algebra"} {"task": "t8", "statement": "theorem fract_eq_self {x : E} : fract b x = x ↔ x ∈ fundamentalDomain b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem fract_eq_fract (m n : E) : fract b m = fract b n ↔ -m + n ∈ span ℤ (Set.range b) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem norm_fract_le [HasSolidNorm K] (m : E) : ‖fract b m‖ ≤ ∑ i, ‖b i‖ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coe_floor_self (k : K) : (floor (Basis.singleton ι K) k : K) = ⌊k⌋ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coe_fract_self (k : K) : (fract (Basis.singleton ι K) k : K) = Int.fract k :=", "area": "Algebra"} {"task": "t8", "statement": "theorem fundamentalDomain_isBounded [Finite ι] [HasSolidNorm K] : IsBounded (fundamentalDomain b) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem vadd_mem_fundamentalDomain [Fintype ι] (y : span ℤ (Set.range b)) (x : E) : y +ᵥ x ∈ fundamentalDomain b ↔ y = -floor b x :=", "area": "Algebra"} {"task": "t8", "statement": "theorem exist_unique_vadd_mem_fundamentalDomain [Finite ι] (x : E) : ∃! v : span ℤ (Set.range b), v +ᵥ x ∈ fundamentalDomain b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem quotientEquiv.symm_apply [Fintype ι] (x : fundamentalDomain b) : (quotientEquiv b).symm x = Submodule.Quotient.mk ↑x :=", "area": "Algebra"} {"task": "t8", "statement": "theorem discreteTopology_pi_basisFun [Finite ι] : DiscreteTopology (span ℤ (Set.range (Pi.basisFun ℝ ι))) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem fundamentalDomain_subset_parallelepiped [Fintype ι] : fundamentalDomain b ⊆ parallelepiped b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem fundamentalDomain_measurableSet [MeasurableSpace E] [OpensMeasurableSpace E] [Finite ι] : MeasurableSet (fundamentalDomain b) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem isAddFundamentalDomain [Finite ι] [MeasurableSpace E] [OpensMeasurableSpace E] (μ : Measure E) : IsAddFundamentalDomain (span ℤ (Set.range b)).toAddSubgroup (fundamentalDomain b) μ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem measure_fundamentalDomain_ne_zero [Finite ι] [MeasurableSpace E] [BorelSpace E] {μ : Measure E} [Measure.IsAddHaarMeasure μ] : μ (fundamentalDomain b) ≠ 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem measure_fundamentalDomain [Fintype ι] [DecidableEq ι] [MeasurableSpace E] (μ : Measure E) [BorelSpace E] [Measure.IsAddHaarMeasure μ] (b₀ : Basis ι ℝ E) : μ (fundamentalDomain b) = ENNReal.ofReal |b₀.det b| * μ (fundamentalDomain b₀) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem volume_fundamentalDomain [Fintype ι] [DecidableEq ι] (b : Basis ι ℝ (ι → ℝ)) : volume (fundamentalDomain b) = ENNReal.ofReal |(Matrix.of b).det| :=", "area": "Algebra"} {"task": "t8", "statement": "theorem fundamentalDomain_ae_parallelepiped [Fintype ι] [MeasurableSpace E] (μ : Measure E) [BorelSpace E] [Measure.IsAddHaarMeasure μ] : fundamentalDomain b =ᵐ[μ] parallelepiped b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Zlattice.FG [hs : IsZlattice K L] : AddSubgroup.FG L :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Zlattice.module_free [IsZlattice K L] : Module.Free ℤ L :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Zlattice.rank [hs : IsZlattice K L] : finrank ℤ L = finrank K E :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Basis.ofZlatticeBasis_apply (i : ι) : b.ofZlatticeBasis K L i = b i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Basis.ofZlatticeBasis_repr_apply (x : L) (i : ι) : (b.ofZlatticeBasis K L).repr x i = b.repr x i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Basis.ofZlatticeBasis_span : (span ℤ (Set.range (b.ofZlatticeBasis K))).toAddSubgroup = L :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Zlattice.isAddFundamentalDomain {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {L : AddSubgroup E} [DiscreteTopology L] [IsZlattice ℝ L] [Finite ι] (b : Basis ι ℤ L) [MeasurableSpace E] [OpensMeasurableSpace E] (μ : MeasureTheory.Measure E) : MeasureTheory.IsAddFundamentalDomain L (Zspan.fundamentalDomain (b.ofZlatticeBasis ℝ)) μ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem prod_dvd_iff {x y : G₁ × G₂} : x ∣ y ↔ x.1 ∣ y.1 ∧ x.2 ∣ y.2 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem pi_dvd_iff {x y : ∀ i, G i} : x ∣ y ↔ ∀ i, x i ∣ y i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem dvd_of_eq (h : a = b) : a ∣ b :=", "area": "Algebra"} {"task": "t8", "statement": "lemma pow_dvd_pow (a : α) (h : m ≤ n) : a ^ m ∣ a ^ n :=", "area": "Algebra"} {"task": "t8", "statement": "lemma dvd_pow (hab : a ∣ b) : ∀ {n : ℕ} (_ : n ≠ 0), a ∣ b ^ n", "area": "Algebra"} {"task": "t8", "statement": "theorem mul_dvd_mul_left (a : α) (h : b ∣ c) : a * b ∣ a * c :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Dvd.intro_left (c : α) (h : c * a = b) : a ∣ b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem dvd_iff_exists_eq_mul_left : a ∣ b ↔ ∃ c, b = c * a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem dvd_mul_of_dvd_right (h : a ∣ b) (c : α) : a ∣ c * b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mul_dvd_mul : ∀ {a b c d : α}, a ∣ b → c ∣ d → a * c ∣ b * d", "area": "Algebra"} {"task": "t8", "statement": "theorem dvd_of_mul_left_dvd (h : a * b ∣ c) : b ∣ c :=", "area": "Algebra"} {"task": "t8", "statement": "theorem dvd_mul [DecompositionMonoid α] {k m n : α} : k ∣ m * n ↔ ∃ d₁ d₂, d₁ ∣ m ∧ d₂ ∣ n ∧ k = d₁ * d₂ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem pow_dvd_pow_of_dvd (h : a ∣ b) : ∀ n : ℕ, a ^ n ∣ b ^ n", "area": "Algebra"} {"task": "t8", "statement": "lemma indicator_mul (s : Set ι) (f g : ι → M₀) : indicator s (fun i ↦ f i * g i) = fun i ↦ indicator s f i * indicator s g i :=", "area": "Algebra"} {"task": "t8", "statement": "lemma indicator_mul_left (s : Set ι) (f g : ι → M₀) : indicator s (fun j ↦ f j * g j) i = indicator s f i * g i :=", "area": "Algebra"} {"task": "t8", "statement": "lemma indicator_mul_right (s : Set ι) (f g : ι → M₀) : indicator s (fun j ↦ f j * g j) i = f i * indicator s g i :=", "area": "Algebra"} {"task": "t8", "statement": "lemma inter_indicator_mul (f g : ι → M₀) (i : ι) : (s ∩ t).indicator (fun j ↦ f j * g j) i = s.indicator f i * t.indicator g i :=", "area": "Algebra"} {"task": "t8", "statement": "lemma inter_indicator_one : (s ∩ t).indicator (1 : ι → M₀) = s.indicator 1 * t.indicator 1 :=", "area": "Algebra"} {"task": "t8", "statement": "lemma indicator_prod_one {t : Set κ} {j : κ} : (s ×ˢ t).indicator (1 : ι × κ → M₀) (i, j) = s.indicator 1 i * t.indicator 1 j :=", "area": "Algebra"} {"task": "t8", "statement": "lemma indicator_eq_zero_iff_not_mem : indicator s 1 i = (0 : M₀) ↔ i ∉ s :=", "area": "Algebra"} {"task": "t8", "statement": "lemma indicator_eq_one_iff_mem : indicator s 1 i = (1 : M₀) ↔ i ∈ s :=", "area": "Algebra"} {"task": "t8", "statement": "lemma indicator_one_inj (h : indicator s (1 : ι → M₀) = indicator t 1) : s = t :=", "area": "Algebra"} {"task": "t8", "statement": "lemma support_mul_subset_left (f g : ι → M₀) : support (fun x ↦ f x * g x) ⊆ support f :=", "area": "Algebra"} {"task": "t8", "statement": "lemma support_mul_subset_right (f g : ι → M₀) : support (fun x ↦ f x * g x) ⊆ support g :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma support_mul (f g : ι → M₀) : support (fun x ↦ f x * g x) = support f ∩ support g :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma support_pow (f : ι → M₀) (hn : n ≠ 0) : support (fun a ↦ f a ^ n) = support f :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma support_div (f g : ι → G₀) : support (fun a ↦ f a / g a) = support f ∩ support g :=", "area": "Algebra"} {"task": "t8", "statement": "lemma mulSupport_one_sub' [AddGroup R] (f : ι → R) : mulSupport (1 - f) = support f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Odd.neg_zpow (h : Odd n) (a : α) : (-a) ^ n = -a ^ n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Odd.neg_one_zpow (h : Odd n) : (-1 : α) ^ n = -1 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mk_coe (f : A →⋆ₙ+* B) (h₁ h₂ h₃ h₄) : (⟨⟨⟨f, h₁⟩, h₂, h₃⟩, h₄⟩ : A →⋆ₙ+* B) = f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem symm_symm (e : A ≃⋆+* B) : e.symm.symm = e :=", "area": "Algebra"} {"task": "t8", "statement": "theorem List.trop_sum [AddMonoid R] (l : List R) : trop l.sum = List.prod (l.map trop) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Multiset.trop_sum [AddCommMonoid R] (s : Multiset R) : trop s.sum = Multiset.prod (s.map trop) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem trop_sum [AddCommMonoid R] (s : Finset S) (f : S → R) : trop (∑ i ∈ s, f i) = ∏ i ∈ s, trop (f i) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem List.untrop_prod [AddMonoid R] (l : List (Tropical R)) : untrop l.prod = List.sum (l.map untrop) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Multiset.untrop_prod [AddCommMonoid R] (s : Multiset (Tropical R)) : untrop s.prod = Multiset.sum (s.map untrop) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem untrop_prod [AddCommMonoid R] (s : Finset S) (f : S → Tropical R) : untrop (∏ i ∈ s, f i) = ∑ i ∈ s, untrop (f i) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem List.trop_minimum [LinearOrder R] (l : List R) : trop l.minimum = List.sum (l.map (trop ∘ WithTop.some)) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Multiset.trop_inf [LinearOrder R] [OrderTop R] (s : Multiset R) : trop s.inf = Multiset.sum (s.map trop) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Finset.trop_inf [LinearOrder R] [OrderTop R] (s : Finset S) (f : S → R) : trop (s.inf f) = ∑ i ∈ s, trop (f i) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem trop_sInf_image [ConditionallyCompleteLinearOrder R] (s : Finset S) (f : S → WithTop R) : trop (sInf (f '' s)) = ∑ i ∈ s, trop (f i) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem trop_iInf [ConditionallyCompleteLinearOrder R] [Fintype S] (f : S → WithTop R) : trop (⨅ i : S, f i) = ∑ i : S, trop (f i) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Multiset.untrop_sum [LinearOrder R] [OrderTop R] (s : Multiset (Tropical R)) : untrop s.sum = Multiset.inf (s.map untrop) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Finset.untrop_sum' [LinearOrder R] [OrderTop R] (s : Finset S) (f : S → Tropical R) : untrop (∑ i ∈ s, f i) = s.inf (untrop ∘ f) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem untrop_sum_eq_sInf_image [ConditionallyCompleteLinearOrder R] (s : Finset S) (f : S → Tropical (WithTop R)) : untrop (∑ i ∈ s, f i) = sInf (untrop ∘ f '' s) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem untrop_sum [ConditionallyCompleteLinearOrder R] [Fintype S] (f : S → Tropical (WithTop R)) : untrop (∑ i : S, f i) = ⨅ i : S, untrop (f i) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Finset.untrop_sum [ConditionallyCompleteLinearOrder R] (s : Finset S) (f : S → Tropical (WithTop R)) : untrop (∑ i ∈ s, f i) = ⨅ i : s, untrop (f i) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem range_mk' : LieModuleHom.range (mk' N) = ⊤ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mk'_ker : (mk' N).ker = N :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_mk'_eq_bot_le : map (mk' N) N' = ⊥ ↔ N' ≤ N :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lieCharacter_apply_lie (χ : LieCharacter R L) (x y : L) : χ ⁅x, y⁆ = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lieCharacter_apply_lie' (χ : LieCharacter R L) (x y : L) : ⁅χ x, χ y⁆ = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lieCharacter_apply_of_mem_derived (χ : LieCharacter R L) {x : L} (h : x ∈ derivedSeries R L 1) : χ x = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "lemma rank_eq_natTrailingDegree : rank R L M = (polyCharpoly φ b).natTrailingDegree :=", "area": "Algebra"} {"task": "t8", "statement": "lemma rank_eq_natTrailingDegree : rank R L = (polyCharpoly (ad R L).toLinearMap b).natTrailingDegree :=", "area": "Algebra"} {"task": "t8", "statement": "lemma isRegular_iff_finrank_engel_eq_rank (x : L) : IsRegular K x ↔ finrank K (engel K x) = rank K L :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lie_skew : -⁅y, x⁆ = ⁅x, y⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem neg_lie : ⁅-x, m⁆ = -⁅x, m⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lie_neg : ⁅x, -m⁆ = -⁅x, m⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem sub_lie : ⁅x - y, m⁆ = ⁅x, m⁆ - ⁅y, m⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lie_sub : ⁅x, m - n⁆ = ⁅x, m⁆ - ⁅x, n⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma lie_lie : ⁅⁅x, y⁆, m⁆ = ⁅x, ⁅y, m⁆⁆ - ⁅y, ⁅x, m⁆⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lie_jacobi : ⁅x, ⁅y, z⁆⁆ + ⁅y, ⁅z, x⁆⁆ + ⁅z, ⁅x, y⁆⁆ = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coe_injective : @Function.Injective (L₁ →ₗ⁅R⁆ L₂) (L₁ → L₂) (↑) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ext_iff {f g : L₁ →ₗ⁅R⁆ L₂} : f = g ↔ ∀ x, f x = g x :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mk_coe (f : L₁ →ₗ⁅R⁆ L₂) (h₁ h₂ h₃) : (⟨⟨⟨f, h₁⟩, h₂⟩, h₃⟩ : L₁ →ₗ⁅R⁆ L₂) = f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem comp_id (f : L₁ →ₗ⁅R⁆ L₂) : f.comp (id : L₁ →ₗ⁅R⁆ L₁) = f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem id_comp (f : L₁ →ₗ⁅R⁆ L₂) : (id : L₂ →ₗ⁅R⁆ L₂).comp f = f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem LieModule.compLieHom [Module R M] [LieModule R L₂ M] : @LieModule R L₁ M _ _ _ _ _ (LieRingModule.compLieHom M f) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coe_linearEquiv_injective : Injective ((↑) : (L₁ ≃ₗ⁅R⁆ L₂) → L₁ ≃ₗ[R] L₂) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem symm_symm (e : L₁ ≃ₗ⁅R⁆ L₂) : e.symm.symm = e :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_lie₂ (f : M →ₗ⁅R,L⁆ N →ₗ[R] P) (x : L) (m : M) (n : N) : ⁅x, f m n⁆ = f ⁅x, m⁆ n + f m ⁅x, n⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coe_injective : @Function.Injective (M →ₗ⁅R,L⁆ N) (M → N) (↑) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ext_iff {f g : M →ₗ⁅R,L⁆ N} : f = g ↔ ∀ m, f m = g m :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mk_coe (f : M →ₗ⁅R,L⁆ N) (h) : (⟨f, h⟩ : M →ₗ⁅R,L⁆ N) = f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coe_mk (f : M →ₗ[R] N) (h) : ((⟨f, h⟩ : M →ₗ⁅R,L⁆ N) : M → N) = f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coe_linear_mk (f : M →ₗ[R] N) (h) : ((⟨f, h⟩ : M →ₗ⁅R,L⁆ N) : M →ₗ[R] N) = f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toEquiv_injective : Function.Injective (toEquiv : (M ≃ₗ⁅R,L⁆ N) → M ≃ N) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem symm_symm (e : M ≃ₗ⁅R,L⁆ N) : e.symm.symm = e :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lieIdeal_oper_eq_linear_span : (↑⁅I, N⁆ : Submodule R M) = Submodule.span R { m | ∃ (x : I) (n : N), ⁅(x : L), (n : M)⁆ = m } :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lieIdeal_oper_eq_linear_span' : (↑⁅I, N⁆ : Submodule R M) = Submodule.span R { m | ∃ x ∈ I, ∃ n ∈ N, ⁅x, n⁆ = m } :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lie_le_iff : ⁅I, N⁆ ≤ N' ↔ ∀ x ∈ I, ∀ m ∈ N, ⁅x, m⁆ ∈ N' :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lie_coe_mem_lie (x : I) (m : N) : ⁅(x : L), (m : M)⁆ ∈ ⁅I, N⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lie_comm : ⁅I, J⁆ = ⁅J, I⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lie_le_right : ⁅I, N⁆ ≤ N :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lie_le_left : ⁅I, J⁆ ≤ I :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lie_le_inf : ⁅I, J⁆ ≤ I ⊓ J :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lie_bot : ⁅I, (⊥ : LieSubmodule R L M)⁆ = ⊥ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem bot_lie : ⁅(⊥ : LieIdeal R L), N⁆ = ⊥ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lie_eq_bot_iff : ⁅I, N⁆ = ⊥ ↔ ∀ x ∈ I, ∀ m ∈ N, ⁅(x : L), m⁆ = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mono_lie (h₁ : I ≤ J) (h₂ : N ≤ N') : ⁅I, N⁆ ≤ ⁅J, N'⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lie_sup : ⁅I, N ⊔ N'⁆ = ⁅I, N⁆ ⊔ ⁅I, N'⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem sup_lie : ⁅I ⊔ J, N⁆ = ⁅I, N⁆ ⊔ ⁅J, N⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem lie_inf : ⁅I, N ⊓ N'⁆ ≤ ⁅I, N⁆ ⊓ ⁅I, N'⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem inf_lie : ⁅I ⊓ J, N⁆ ≤ ⁅I, N⁆ ⊓ ⁅J, N⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_bracket_eq : map f ⁅I, N⁆ = ⁅I, map f N⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_comap_eq (hf : N₂ ≤ f.range) : map f (comap f N₂) = N₂ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem comap_map_eq (hf : f.ker = ⊥) : comap f (map f N) = N :=", "area": "Algebra"} {"task": "t8", "statement": "theorem comap_bracket_eq (hf₁ : f.ker = ⊥) (hf₂ : N₂ ≤ f.range) : comap f ⁅I, N₂⁆ = ⁅I, comap f N₂⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_comap_incl : map N.incl (comap N.incl N') = N ⊓ N' :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_bracket_le {I₁ I₂ : LieIdeal R L} : map f ⁅I₁, I₂⁆ ≤ ⁅map f I₁, map f I₂⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_bracket_eq {I₁ I₂ : LieIdeal R L} (h : Function.Surjective f) : map f ⁅I₁, I₂⁆ = ⁅map f I₁, map f I₂⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem comap_bracket_le {J₁ J₂ : LieIdeal R L'} : ⁅comap f J₁, comap f J₂⁆ ≤ comap f ⁅J₁, J₂⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_comap_incl {I₁ I₂ : LieIdeal R L} : map I₁.incl (comap I₁.incl I₂) = I₁ ⊓ I₂ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem comap_bracket_eq {J₁ J₂ : LieIdeal R L'} (h : f.IsIdealMorphism) : comap f ⁅f.idealRange ⊓ J₁, f.idealRange ⊓ J₂⁆ = ⁅comap f J₁, comap f J₂⁆ ⊔ f.ker :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_comap_bracket_eq {J₁ J₂ : LieIdeal R L'} (h : f.IsIdealMorphism) : map f ⁅comap f J₁, comap f J₂⁆ = ⁅f.idealRange ⊓ J₁, f.idealRange ⊓ J₂⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem comap_bracket_incl {I₁ I₂ : LieIdeal R L} : ⁅comap I.incl I₁, comap I.incl I₂⁆ = comap I.incl ⁅I ⊓ I₁, I ⊓ I₂⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem comap_bracket_incl_of_le {I₁ I₂ : LieIdeal R L} (h₁ : I₁ ≤ I) (h₂ : I₂ ≤ I) : ⁅comap I.incl I₁, comap I.incl I₂⁆ = comap I.incl ⁅I₁, I₂⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma coe_ad_apply_eq_ad_apply (x : L) : ad R L x = LieAlgebra.ad R L x :=", "area": "Algebra"} {"task": "t8", "statement": "lemma lie_ad (x : L) (D : LieDerivation R L L) : ⁅ad R L x, D⁆ = ⁅x, D⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "lemma ad_ker_eq_center : (ad R L).ker = LieAlgebra.center R L :=", "area": "Algebra"} {"task": "t8", "statement": "lemma injective_ad_of_center_eq_bot (h : LieAlgebra.center R L = ⊥) : Function.Injective (ad R L) :=", "area": "Algebra"} {"task": "t8", "statement": "lemma lie_der_ad_eq_ad_der (D : LieDerivation R L L) (x : L) : ⁅D, ad R L x⁆ = ad R L (D x) :=", "area": "Algebra"} {"task": "t8", "statement": "lemma ad_isIdealMorphism : (ad R L).IsIdealMorphism :=", "area": "Algebra"} {"task": "t8", "statement": "lemma maxTrivSubmodule_eq_bot_of_center_eq_bot (h : LieAlgebra.center R L = ⊥) : LieModule.maxTrivSubmodule R L (LieDerivation R L L) = ⊥ :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma coe_toLinear_eq_zero_iff : (χ : L →ₗ[R] R) = 0 ↔ χ.IsZero :=", "area": "Algebra"} {"task": "t8", "statement": "lemma coe_toLinear_ne_zero_iff : (χ : L →ₗ[R] R) ≠ 0 ↔ χ.IsNonZero :=", "area": "Algebra"} {"task": "t8", "statement": "lemma trace_comp_toEnd_weightSpace_eq (χ : L → R) : LinearMap.trace R _ ∘ₗ (toEnd R L (weightSpace M χ)).toLinearMap = finrank R (weightSpace M χ) • χ :=", "area": "Algebra"} {"task": "t8", "statement": "lemma zero_lt_finrank_weightSpace {χ : L → R} (hχ : weightSpace M χ ≠ ⊥) : 0 < finrank R (weightSpace M χ) :=", "area": "Algebra"} {"task": "t8", "statement": "lemma toEnd_eq (x : L) : toEnd R L (shiftedWeightSpace R L M χ) x = (shift R L M χ).conj (toEnd R L (weightSpace M χ) x - χ x • LinearMap.id) :=", "area": "Algebra"} {"task": "t8", "statement": "lemma exists_forall_lie_eq_smul [IsNoetherian R M] (χ : Weight R L M) : ∃ m : M, m ≠ 0 ∧ ∀ x : L, ⁅x, m⁆ = χ x • m :=", "area": "Algebra"} {"task": "t8", "statement": "private lemma chainLength_aux {x} (hx : x ∈ rootSpace H (chainTop α β)) : ∃ n : ℕ, n • x = ⁅coroot α, x⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "lemma chainLength_nsmul {x} (hx : x ∈ rootSpace H (chainTop α β)) : chainLength α β • x = ⁅coroot α, x⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "lemma chainLength_smul {x} (hx : x ∈ rootSpace H (chainTop α β)) : (chainLength α β : K) • x = ⁅coroot α, x⁆ :=", "area": "Algebra"} {"task": "t8", "statement": "lemma apply_coroot_eq_cast' : β (coroot α) = ↑(chainLength α β - 2 * chainTopCoeff α β : ℤ) :=", "area": "Algebra"} {"task": "t8", "statement": "lemma rootSpace_neg_nsmul_add_chainTop_of_le {n : ℕ} (hn : n ≤ chainLength α β) : rootSpace H (- (n • α) + chainTop α β) ≠ ⊥ :=", "area": "Algebra"} {"task": "t8", "statement": "lemma rootSpace_neg_nsmul_add_chainTop_of_lt {n : ℕ} (hn : chainLength α β < n) : rootSpace H (- (n • α) + chainTop α β) = ⊥ :=", "area": "Algebra"} {"task": "t8", "statement": "lemma chainTopCoeff_le_chainLength : chainTopCoeff α β ≤ chainLength α β :=", "area": "Algebra"} {"task": "t8", "statement": "lemma chainBotCoeff_add_chainTopCoeff : chainBotCoeff α β + chainTopCoeff α β = chainLength α β :=", "area": "Algebra"} {"task": "t8", "statement": "lemma chainTopCoeff_add_chainBotCoeff : chainTopCoeff α β + chainBotCoeff α β = chainLength α β :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma chainLength_neg : chainLength (-α) β = chainLength α β :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma chainLength_zero [Nontrivial L] : chainLength 0 β = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "lemma apply_coroot_eq_cast : β (coroot α) = (chainBotCoeff α β - chainTopCoeff α β : ℤ) :=", "area": "Algebra"} {"task": "t8", "statement": "lemma le_chainBotCoeff_of_rootSpace_ne_top (n : ℤ) (hn : rootSpace H (-n • α + β) ≠ ⊥) : n ≤ chainBotCoeff α β :=", "area": "Algebra"} {"task": "t8", "statement": "lemma rootSpace_zsmul_add_ne_bot_iff (n : ℤ) : rootSpace H (n • α + β) ≠ ⊥ ↔ n ≤ chainTopCoeff α β ∧ -n ≤ chainBotCoeff α β :=", "area": "Algebra"} {"task": "t8", "statement": "lemma rootSpace_zsmul_add_ne_bot_iff_mem (n : ℤ) : rootSpace H (n • α + β) ≠ ⊥ ↔ n ∈ Finset.Icc (-chainBotCoeff α β : ℤ) (chainTopCoeff α β) :=", "area": "Algebra"} {"task": "t8", "statement": "lemma chainTopCoeff_of_eq_zsmul_add (β' : Weight K H L) (n : ℤ) (hβ' : (β' : H → K) = n • α + β) : chainTopCoeff α β' = chainTopCoeff α β - n :=", "area": "Algebra"} {"task": "t8", "statement": "lemma chainBotCoeff_of_eq_zsmul_add (β' : Weight K H L) (n : ℤ) (hβ' : (β' : H → K) = n • α + β) : chainBotCoeff α β' = chainBotCoeff α β + n :=", "area": "Algebra"} {"task": "t8", "statement": "lemma chainLength_of_eq_zsmul_add (β' : Weight K H L) (n : ℤ) (hβ' : (β' : H → K) = n • α + β) : chainLength α β' = chainLength α β :=", "area": "Algebra"} {"task": "t8", "statement": "lemma chainTopCoeff_zero_right [Nontrivial L] : chainTopCoeff α (0 : Weight K H L) = 1 :=", "area": "Algebra"} {"task": "t8", "statement": "lemma chainLength_zero_right [Nontrivial L] : chainLength α 0 = 2 :=", "area": "Algebra"} {"task": "t8", "statement": "lemma rootSpace_two_smul : rootSpace H (2 • α) = ⊥ :=", "area": "Algebra"} {"task": "t8", "statement": "lemma rootSpace_one_div_two_smul : rootSpace H ((2⁻¹ : K) • α) = ⊥ :=", "area": "Algebra"} {"task": "t8", "statement": "lemma eq_neg_one_or_eq_zero_or_eq_one_of_eq_smul (k : K) (h : (β : H → K) = k • α) : k = -1 ∨ k = 0 ∨ k = 1 :=", "area": "Algebra"} {"task": "t8", "statement": "lemma eq_neg_or_eq_of_eq_smul (hβ : β.IsNonZero) (k : K) (h : (β : H → K) = k • α) : β = -α ∨ β = α :=", "area": "Algebra"} {"task": "t8", "statement": "lemma reflectRoot_isNonZero (α β : Weight K H L) (hβ : β.IsNonZero) : (reflectRoot α β).IsNonZero :=", "area": "Algebra"} {"task": "t8", "statement": "theorem isCrystallographic_rootSystem : (rootSystem H).IsCrystallographic :=", "area": "Algebra"} {"task": "t8", "statement": "theorem isReduced_rootSystem : (rootSystem H).IsReduced :=", "area": "Algebra"} {"task": "t8", "statement": "theorem distrib_three_right [Mul R] [Add R] [RightDistribClass R] (a b c d : R) : (a + b + c) * d = a * d + b * d + c * d :=", "area": "Algebra"} {"task": "t8", "statement": "theorem add_one_mul [RightDistribClass α] (a b : α) : (a + 1) * b = a * b + b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mul_add_one [LeftDistribClass α] (a b : α) : a * (b + 1) = a * b + a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem one_add_mul [RightDistribClass α] (a b : α) : (1 + a) * b = b + a * b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mul_one_add [LeftDistribClass α] (a b : α) : a * (1 + b) = a + a * b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem two_mul (n : α) : 2 * n = n + n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mul_two (n : α) : n * 2 = n + n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mul_ite {α} [Mul α] (P : Prop) [Decidable P] (a b c : α) : (a * if P then b else c) = if P then a * b else a * c :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ite_mul {α} [Mul α] (P : Prop) [Decidable P] (a b c : α) : (if P then a else b) * c = if P then a * c else b * c :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ite_sub_ite {α} [Sub α] (P : Prop) [Decidable P] (a b c d : α) : ((if P then a else b) - if P then c else d) = if P then a - c else b - d :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ite_add_ite {α} [Add α] (P : Prop) [Decidable P] (a b c d : α) : ((if P then a else b) + if P then c else d) = if P then a + c else b + d :=", "area": "Algebra"} {"task": "t8", "statement": "lemma ite_zero_mul : ite P a 0 * b = ite P (a * b) 0 :=", "area": "Algebra"} {"task": "t8", "statement": "lemma mul_ite_zero : a * ite P b 0 = ite P (a * b) 0 :=", "area": "Algebra"} {"task": "t8", "statement": "lemma ite_zero_mul_ite_zero : ite P a 0 * ite Q b 0 = ite (P ∧ Q) (a * b) 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mul_boole {α} [MulZeroOneClass α] (P : Prop) [Decidable P] (a : α) : (a * if P then 1 else 0) = if P then a else 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem boole_mul {α} [MulZeroOneClass α] (P : Prop) [Decidable P] (a : α) : (if P then 1 else 0) * a = if P then a else 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem add_mul_self_eq (a b : α) : (a + b) * (a + b) = a * a + 2 * a * b + b * b :=", "area": "Algebra"} {"task": "t8", "statement": "lemma add_sq (a b : α) : (a + b) ^ 2 = a ^ 2 + 2 * a * b + b ^ 2 :=", "area": "Algebra"} {"task": "t8", "statement": "lemma add_sq' (a b : α) : (a + b) ^ 2 = a ^ 2 + b ^ 2 + 2 * a * b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem neg_mul_neg (a b : α) : -a * -b = a * b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem neg_mul_comm (a b : α) : -a * b = a * -b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem neg_eq_neg_one_mul (a : α) : -a = -1 * a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mul_neg_one (a : α) : a * -1 = -a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem neg_one_mul (a : α) : -1 * a = -a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mul_sub_left_distrib (a b c : α) : a * (b - c) = a * b - a * c :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mul_sub_right_distrib (a b c : α) : (a - b) * c = a * c - b * c :=", "area": "Algebra"} {"task": "t8", "statement": "theorem sub_one_mul (a b : α) : (a - 1) * b = a * b - b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mul_sub_one (a b : α) : a * (b - 1) = a * b - a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem one_sub_mul (a b : α) : (1 - a) * b = b - a * b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mul_one_sub (a b : α) : a * (1 - b) = a - a * b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem comp_zero (g : β →ₙ+* γ) : g.comp (0 : α →ₙ+* β) = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem zero_comp (f : α →ₙ+* β) : (0 : β →ₙ+* γ).comp f = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem cancel_left {g : β →ₙ+* γ} {f₁ f₂ : α →ₙ+* β} (hg : Injective g) : g.comp f₁ = g.comp f₂ ↔ f₁ = f₂ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toMonoidWithZeroHom_eq_coe (f : α →+* β) : (f.toMonoidWithZeroHom : α → β) = f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_ite_zero_one {F : Type*} [FunLike F α β] [RingHomClass F α β] (f : F) (p : Prop) [Decidable p] : f (ite p 0 1) = ite p 0 1 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_ite_one_zero {F : Type*} [FunLike F α β] [RingHomClass F α β] (f : F) (p : Prop) [Decidable p] : f (ite p 1 0) = ite p 1 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem codomain_trivial_iff_map_one_eq_zero : (0 : β) = 1 ↔ f 1 = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem codomain_trivial_iff_range_trivial : (0 : β) = 1 ↔ ∀ x, f x = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem domain_nontrivial [Nontrivial β] : Nontrivial α :=", "area": "Algebra"} {"task": "t8", "statement": "theorem cancel_left {g : β →+* γ} {f₁ f₂ : α →+* β} (hg : Injective g) : g.comp f₁ = g.comp f₂ ↔ f₁ = f₂ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coe_addMonoidHom_mkRingHomOfMulSelfOfTwoNeZero (h h_two h_one) : (f.mkRingHomOfMulSelfOfTwoNeZero h h_two h_one : β →+ α) = f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_divX : (divX p).coeff n = p.coeff (n + 1) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem divX_mul_X_add (p : R[X]) : divX p * X + C (p.coeff 0) = p :=", "area": "Algebra"} {"task": "t8", "statement": "theorem X_mul_divX_add (p : R[X]) : X * divX p + C (p.coeff 0) = p :=", "area": "Algebra"} {"task": "t8", "statement": "theorem divX_C (a : R) : divX (C a) = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem divX_eq_zero_iff : divX p = 0 ↔ p = C (p.coeff 0) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem divX_add : divX (p + q) = divX p + divX q :=", "area": "Algebra"} {"task": "t8", "statement": "theorem divX_one : divX (1 : R[X]) = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem divX_C_mul : divX (C a * p) = C a * divX p :=", "area": "Algebra"} {"task": "t8", "statement": "theorem divX_X_pow : divX (X ^ n : R[X]) = if (n = 0) then 0 else X ^ (n - 1) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem natDegree_divX_eq_natDegree_tsub_one : p.divX.natDegree = p.natDegree - 1 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem divX_C_mul_X_pow : divX (C a * X ^ n) = if n = 0 then 0 else C a * X ^ (n - 1) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem degree_divX_lt (hp0 : p ≠ 0) : (divX p).degree < p.degree :=", "area": "Algebra"} {"task": "t8", "statement": "theorem degree_pos_induction_on {P : R[X] → Prop} (p : R[X]) (h0 : 0 < degree p) (hC : ∀ {a}, a ≠ 0 → P (C a * X)) (hX : ∀ {p}, 0 < degree p → P p → P (p * X)) (hadd : ∀ {p} {a}, 0 < degree p → P p → P (p + C a)) : P p :=", "area": "Algebra"} {"task": "t8", "statement": "theorem natDegree_ne_zero_induction_on {M : R[X] → Prop} {f : R[X]} (f0 : f.natDegree ≠ 0) (h_C_add : ∀ {a p}, M p → M (C a + p)) (h_add : ∀ {p q}, M p → M q → M (p + q)) (h_monomial : ∀ {n : ℕ} {a : R}, a ≠ 0 → n ≠ 0 → M (monomial n a)) : M f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem cardinal_mk_eq_max {R : Type u} [Semiring R] [Nontrivial R] : #(R[X]) = max #R ℵ₀ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem cardinal_mk_le_max {R : Type u} [Semiring R] : #(R[X]) ≤ max #R ℵ₀ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem expand_eq_sum {f : R[X]} : expand R p f = f.sum fun e a => C a * (X ^ p) ^ e :=", "area": "Algebra"} {"task": "t8", "statement": "theorem expand_monomial (r : R) : expand R p (monomial q r) = monomial (q * p) r :=", "area": "Algebra"} {"task": "t8", "statement": "theorem expand_expand (f : R[X]) : expand R p (expand R q f) = expand R (p * q) f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem expand_zero (f : R[X]) : expand R 0 f = C (eval 1 f) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem expand_one (f : R[X]) : expand R 1 f = f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem expand_pow (f : R[X]) : expand R (p ^ q) f = (expand R p)^[q] f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem derivative_expand (f : R[X]) : Polynomial.derivative (expand R p f) = expand R p (Polynomial.derivative f) * (p * (X ^ (p - 1) : R[X])) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_expand {p : ℕ} (hp : 0 < p) (f : R[X]) (n : ℕ) : (expand R p f).coeff n = if p ∣ n then f.coeff (n / p) else 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_expand_mul {p : ℕ} (hp : 0 < p) (f : R[X]) (n : ℕ) : (expand R p f).coeff (n * p) = f.coeff n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_expand_mul' {p : ℕ} (hp : 0 < p) (f : R[X]) (n : ℕ) : (expand R p f).coeff (p * n) = f.coeff n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem expand_injective {n : ℕ} (hn : 0 < n) : Function.Injective (expand R n) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem expand_eq_C {p : ℕ} (hp : 0 < p) {f : R[X]} {r : R} : expand R p f = C r ↔ f = C r :=", "area": "Algebra"} {"task": "t8", "statement": "theorem natDegree_expand (p : ℕ) (f : R[X]) : (expand R p f).natDegree = f.natDegree * p :=", "area": "Algebra"} {"task": "t8", "statement": "theorem leadingCoeff_expand {p : ℕ} {f : R[X]} (hp : 0 < p) : (expand R p f).leadingCoeff = f.leadingCoeff :=", "area": "Algebra"} {"task": "t8", "statement": "theorem monic_expand_iff {p : ℕ} {f : R[X]} (hp : 0 < p) : (expand R p f).Monic ↔ f.Monic :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_expand {p : ℕ} {f : R →+* S} {q : R[X]} : map f (expand R p q) = expand S p (map f q) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem expand_eval (p : ℕ) (P : R[X]) (r : R) : eval r (expand R p P) = eval (r ^ p) P :=", "area": "Algebra"} {"task": "t8", "statement": "theorem expand_aeval {A : Type*} [Semiring A] [Algebra R A] (p : ℕ) (P : R[X]) (r : A) : aeval r (expand R p P) = aeval (r ^ p) P :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_contract {p : ℕ} (hp : p ≠ 0) (f : R[X]) (n : ℕ) : (contract p f).coeff n = f.coeff (n * p) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_contract {p : ℕ} (hp : p ≠ 0) {f : R →+* S} {q : R[X]} : (q.contract p).map f = (q.map f).contract p :=", "area": "Algebra"} {"task": "t8", "statement": "theorem contract_expand {f : R[X]} (hp : p ≠ 0) : contract p (expand R p f) = f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem contract_one {f : R[X]} : contract 1 f = f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem expand_contract [CharP R p] [NoZeroDivisors R] {f : R[X]} (hf : Polynomial.derivative f = 0) (hp : p ≠ 0) : expand R p (contract p f) = f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem expand_contract' [NoZeroDivisors R] {f : R[X]} (hf : Polynomial.derivative f = 0) : expand R p (contract p f) = f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem expand_char (f : R[X]) : map (frobenius R p) (expand R p f) = f ^ p :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_expand_pow_char (f : R[X]) (n : ℕ) : map (frobenius R p ^ n) (expand R (p ^ n) f) = f ^ p ^ n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem rootMultiplicity_expand_pow : (expand R (p ^ n) f).rootMultiplicity r = p ^ n * f.rootMultiplicity (r ^ p ^ n) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem rootMultiplicity_expand : (expand R p f).rootMultiplicity r = p * f.rootMultiplicity (r ^ p) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem isLocalRingHom_expand {p : ℕ} (hp : 0 < p) : IsLocalRingHom (↑(expand R p) : R[X] →+* R[X]) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem of_irreducible_expand_pow {p : ℕ} (hp : p ≠ 0) {f : R[X]} {n : ℕ} : Irreducible (expand R (p ^ n) f) → Irreducible f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_add (p q : R[X]) (n : ℕ) : coeff (p + q) n = coeff p n + coeff q n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_smul [SMulZeroClass S R] (r : S) (p : R[X]) (n : ℕ) : coeff (r • p) n = r • coeff p n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_smul [SMulZeroClass S R] (r : S) (p : R[X]) : support (r • p) ⊆ support p :=", "area": "Algebra"} {"task": "t8", "statement": "theorem card_support_mul_le : (p * q).support.card ≤ p.support.card * q.support.card :=", "area": "Algebra"} {"task": "t8", "statement": "lemma coeff_list_sum_map {ι : Type*} (l : List ι) (f : ι → R[X]) (n : ℕ) : (l.map f).sum.coeff n = (l.map (fun a => (f a).coeff n)).sum :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_sum [Semiring S] (n : ℕ) (f : ℕ → R → S[X]) : coeff (p.sum f) n = p.sum fun a b => coeff (f a b) n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_mul (p q : R[X]) (n : ℕ) : coeff (p * q) n = ∑ x ∈ antidiagonal n, coeff p x.1 * coeff q x.2 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mul_coeff_zero (p q : R[X]) : coeff (p * q) 0 = coeff p 0 * coeff q 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_mul_X_zero (p : R[X]) : coeff (p * X) 0 = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_X_mul_zero (p : R[X]) : coeff (X * p) 0 = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_C_mul_X_pow (x : R) (k n : ℕ) : coeff (C x * X ^ k : R[X]) n = if n = k then x else 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_C_mul_X (x : R) (n : ℕ) : coeff (C x * X : R[X]) n = if n = 1 then x else 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_C_mul (p : R[X]) : coeff (C a * p) n = a * coeff p n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem C_mul' (a : R) (f : R[X]) : C a * f = a • f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_mul_C (p : R[X]) (n : ℕ) (a : R) : coeff (p * C a) n = coeff p n * a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_X_pow (k n : ℕ) : coeff (X ^ k : R[X]) n = if n = k then 1 else 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_X_pow_self (n : ℕ) : coeff (X ^ n : R[X]) n = 1 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_binomial {k m : ℕ} (hkm : k ≠ m) {x y : R} (hx : x ≠ 0) (hy : y ≠ 0) : support (C x * X ^ k + C y * X ^ m) = {k, m} :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_trinomial {k m n : ℕ} (hkm : k < m) (hmn : m < n) {x y z : R} (hx : x ≠ 0) (hy : y ≠ 0) (hz : z ≠ 0) : support (C x * X ^ k + C y * X ^ m + C z * X ^ n) = {k, m, n} :=", "area": "Algebra"} {"task": "t8", "statement": "theorem card_support_binomial {k m : ℕ} (h : k ≠ m) {x y : R} (hx : x ≠ 0) (hy : y ≠ 0) : card (support (C x * X ^ k + C y * X ^ m)) = 2 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem card_support_trinomial {k m n : ℕ} (hkm : k < m) (hmn : m < n) {x y z : R} (hx : x ≠ 0) (hy : y ≠ 0) (hz : z ≠ 0) : card (support (C x * X ^ k + C y * X ^ m + C z * X ^ n)) = 3 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_mul_X_pow (p : R[X]) (n d : ℕ) : coeff (p * Polynomial.X ^ n) (d + n) = coeff p d :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_X_pow_mul (p : R[X]) (n d : ℕ) : coeff (Polynomial.X ^ n * p) (d + n) = coeff p d :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_mul_X_pow' (p : R[X]) (n d : ℕ) : (p * X ^ n).coeff d = ite (n ≤ d) (p.coeff (d - n)) 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_X_pow_mul' (p : R[X]) (n d : ℕ) : (X ^ n * p).coeff d = ite (n ≤ d) (p.coeff (d - n)) 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_mul_X (p : R[X]) (n : ℕ) : coeff (p * X) (n + 1) = coeff p n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_X_mul (p : R[X]) (n : ℕ) : coeff (X * p) (n + 1) = coeff p n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_mul_monomial (p : R[X]) (n d : ℕ) (r : R) : coeff (p * monomial n r) (d + n) = coeff p d * r :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_monomial_mul (p : R[X]) (n d : ℕ) (r : R) : coeff (monomial n r * p) (d + n) = r * coeff p d :=", "area": "Algebra"} {"task": "t8", "statement": "theorem isRegular_X_pow (n : ℕ) : IsRegular (X ^ n : R[X]) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_X_add_C_pow (r : R) (n k : ℕ) : ((X + C r) ^ n).coeff k = r ^ (n - k) * (n.choose k : R) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_X_add_one_pow (R : Type*) [Semiring R] (n k : ℕ) : ((X + 1) ^ n).coeff k = (n.choose k : R) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_one_add_X_pow (R : Type*) [Semiring R] (n k : ℕ) : ((1 + X) ^ n).coeff k = (n.choose k : R) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem C_dvd_iff_dvd_coeff (r : R) (φ : R[X]) : C r ∣ φ ↔ ∀ i, r ∣ φ.coeff i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem smul_eq_C_mul (a : R) : a • p = C a * p :=", "area": "Algebra"} {"task": "t8", "statement": "theorem update_eq_add_sub_coeff {R : Type*} [Ring R] (p : R[X]) (n : ℕ) (a : R) : p.update n a = p + Polynomial.C (a - p.coeff n) * Polynomial.X ^ n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem natCast_coeff_zero {n : ℕ} {R : Type*} [Semiring R] : (n : R[X]).coeff 0 = n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem natCast_inj {m n : ℕ} {R : Type*} [Semiring R] [CharZero R] : (↑m : R[X]) = ↑n ↔ m = n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem intCast_coeff_zero {i : ℤ} {R : Type*} [Ring R] : (i : R[X]).coeff 0 = i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem intCast_inj {m n : ℤ} {R : Type*} [Ring R] [CharZero R] : (↑m : R[X]) = ↑n ↔ m = n :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma C_apply (t : R) (n : ℤ) : C t n = if n = 0 then t else 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem T_add (m n : ℤ) : (T (m + n) : R[T;T⁻¹]) = T m * T n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem T_sub (m n : ℤ) : (T (m - n) : R[T;T⁻¹]) = T m * T (-n) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem T_pow (m : ℤ) (n : ℕ) : (T m ^ n : R[T;T⁻¹]) = T (n * m) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mul_T_assoc (f : R[T;T⁻¹]) (m n : ℤ) : f * T m * T n = f * T (m + n) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem single_eq_C_mul_T (r : R) (n : ℤ) : (Finsupp.single n r : R[T;T⁻¹]) = (C r * T n : R[T;T⁻¹]) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem _root_.Polynomial.toLaurent_C_mul_T (n : ℕ) (r : R) : (toLaurent (Polynomial.monomial n r) : R[T;T⁻¹]) = C r * T n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem _root_.Polynomial.toLaurent_C (r : R) : toLaurent (Polynomial.C r) = C r :=", "area": "Algebra"} {"task": "t8", "statement": "theorem _root_.Polynomial.toLaurent_X : (toLaurent Polynomial.X : R[T;T⁻¹]) = T 1 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem _root_.Polynomial.toLaurent_C_mul_eq (r : R) (f : R[X]) : toLaurent (Polynomial.C r * f) = C r * toLaurent f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem _root_.Polynomial.toLaurent_X_pow (n : ℕ) : toLaurent (X ^ n : R[X]) = T n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem _root_.Polynomial.toLaurent_C_mul_X_pow (n : ℕ) (r : R) : toLaurent (Polynomial.C r * X ^ n) = C r * T n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem induction_on {M : R[T;T⁻¹] → Prop} (p : R[T;T⁻¹]) (h_C : ∀ a, M (C a)) (h_add : ∀ {p q}, M p → M q → M (p + q)) (h_C_mul_T : ∀ (n : ℕ) (a : R), M (C a * T n) → M (C a * T (n + 1))) (h_C_mul_T_Z : ∀ (n : ℕ) (a : R), M (C a * T (-n)) → M (C a * T (-n - 1))) : M p :=", "area": "Algebra"} {"task": "t8", "statement": "theorem induction_on' {M : R[T;T⁻¹] → Prop} (p : R[T;T⁻¹]) (h_add : ∀ p q, M p → M q → M (p + q)) (h_C_mul_T : ∀ (n : ℤ) (a : R), M (C a * T n)) : M p :=", "area": "Algebra"} {"task": "t8", "statement": "theorem commute_T (n : ℤ) (f : R[T;T⁻¹]) : Commute (T n) f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem trunc_C_mul_T (n : ℤ) (r : R) : trunc (C r * T n) = ite (0 ≤ n) (monomial n.toNat r) 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem leftInverse_trunc_toLaurent : Function.LeftInverse (trunc : R[T;T⁻¹] → R[X]) Polynomial.toLaurent :=", "area": "Algebra"} {"task": "t8", "statement": "theorem exists_T_pow (f : R[T;T⁻¹]) : ∃ (n : ℕ) (f' : R[X]), toLaurent f' = f * T n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem induction_on_mul_T {Q : R[T;T⁻¹] → Prop} (f : R[T;T⁻¹]) (Qf : ∀ {f : R[X]} {n : ℕ}, Q (toLaurent f * T (-n))) : Q f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem reduce_to_polynomial_of_mul_T (f : R[T;T⁻¹]) {Q : R[T;T⁻¹] → Prop} (Qf : ∀ f : R[X], Q (toLaurent f)) (QT : ∀ f, Q (f * T 1) → Q f) : Q f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_C_mul_T (a : R) (n : ℤ) : Finsupp.support (C a * T n) ⊆ {n} :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_C_mul_T_of_ne_zero {a : R} (a0 : a ≠ 0) (n : ℤ) : Finsupp.support (C a * T n) = {n} :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toLaurent_support (f : R[X]) : f.toLaurent.support = f.support.map Nat.castEmbedding :=", "area": "Algebra"} {"task": "t8", "statement": "theorem degree_eq_bot_iff {f : R[T;T⁻¹]} : f.degree = ⊥ ↔ f = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem degree_C_mul_T (n : ℤ) (a : R) (a0 : a ≠ 0) : degree (C a * T n) = n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem degree_C_mul_T_ite [DecidableEq R] (n : ℤ) (a : R) : degree (C a * T n) = if a = 0 then ⊥ else ↑n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem degree_T [Nontrivial R] (n : ℤ) : (T n : R[T;T⁻¹]).degree = n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem degree_C {a : R} (a0 : a ≠ 0) : (C a).degree = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem degree_C_ite [DecidableEq R] (a : R) : (C a).degree = if a = 0 then ⊥ else 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem degree_C_mul_T_le (n : ℤ) (a : R) : degree (C a * T n) ≤ n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem degree_T_le (n : ℤ) : (T n : R[T;T⁻¹]).degree ≤ n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem degree_C_le (a : R) : (C a).degree ≤ 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem isLocalization : IsLocalization (Submonoid.closure ({X} : Set R[X])) R[T;T⁻¹] :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma invert_comp_C : invert ∘ (@C R _) = C :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma invert_C (t : R) : invert (C t) = C t :=", "area": "Algebra"} {"task": "t8", "statement": "lemma involutive_invert : Involutive (invert (R := R)) :=", "area": "Algebra"} {"task": "t8", "statement": "lemma toLaurent_reverse (p : R[X]) : toLaurent p.reverse = invert (toLaurent p) * (T p.natDegree) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mirror_zero : (0 : R[X]).mirror = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mirror_monomial (n : ℕ) (a : R) : (monomial n a).mirror = monomial n a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mirror_natDegree : p.mirror.natDegree = p.natDegree :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mirror_natTrailingDegree : p.mirror.natTrailingDegree = p.natTrailingDegree :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_mirror (n : ℕ) : p.mirror.coeff n = p.coeff (revAt (p.natDegree + p.natTrailingDegree) n) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mirror_eval_one : p.mirror.eval 1 = p.eval 1 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mirror_mirror : p.mirror.mirror = p :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mirror_eq_zero : p.mirror = 0 ↔ p = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mirror_trailingCoeff : p.mirror.trailingCoeff = p.leadingCoeff :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mirror_leadingCoeff : p.mirror.leadingCoeff = p.trailingCoeff :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_mul_mirror : (p * p.mirror).coeff (p.natDegree + p.natTrailingDegree) = p.sum fun n => (· ^ 2) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem natDegree_mul_mirror : (p * p.mirror).natDegree = 2 * p.natDegree :=", "area": "Algebra"} {"task": "t8", "statement": "theorem natTrailingDegree_mul_mirror : (p * p.mirror).natTrailingDegree = 2 * p.natTrailingDegree :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mirror_neg : (-p).mirror = -p.mirror :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mirror_mul_of_domain : (p * q).mirror = p.mirror * q.mirror :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mirror_smul (a : R) : (a • p).mirror = a • p.mirror :=", "area": "Algebra"} {"task": "t8", "statement": "theorem irreducible_of_mirror (h1 : ¬IsUnit f) (h2 : ∀ k, f * f.mirror = k * k.mirror → k = f ∨ k = -f ∨ k = f.mirror ∨ k = -f.mirror) (h3 : IsRelPrime f f.mirror) : Irreducible f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem eta (f : R[X]) : Polynomial.ofFinsupp f.toFinsupp = f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ofFinsupp_add {a b} : (⟨a + b⟩ : R[X]) = ⟨a⟩ + ⟨b⟩ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ofFinsupp_neg {R : Type u} [Ring R] {a} : (⟨-a⟩ : R[X]) = -⟨a⟩ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ofFinsupp_sub {R : Type u} [Ring R] {a b} : (⟨a - b⟩ : R[X]) = ⟨a⟩ - ⟨b⟩ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ofFinsupp_mul (a b) : (⟨a * b⟩ : R[X]) = ⟨a⟩ * ⟨b⟩ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ofFinsupp_pow (a) (n : ℕ) : (⟨a ^ n⟩ : R[X]) = ⟨a⟩ ^ n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toFinsupp_add (a b : R[X]) : (a + b).toFinsupp = a.toFinsupp + b.toFinsupp :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toFinsupp_neg {R : Type u} [Ring R] (a : R[X]) : (-a).toFinsupp = -a.toFinsupp :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toFinsupp_sub {R : Type u} [Ring R] (a b : R[X]) : (a - b).toFinsupp = a.toFinsupp - b.toFinsupp :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toFinsupp_mul (a b : R[X]) : (a * b).toFinsupp = a.toFinsupp * b.toFinsupp :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toFinsupp_pow (a : R[X]) (n : ℕ) : (a ^ n).toFinsupp = a.toFinsupp ^ n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toFinsupp_eq_zero {a : R[X]} : a.toFinsupp = 0 ↔ a = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toFinsupp_eq_one {a : R[X]} : a.toFinsupp = 1 ↔ a = 1 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ofFinsupp_eq_zero {a} : (⟨a⟩ : R[X]) = 0 ↔ a = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ofFinsupp_eq_one {a} : (⟨a⟩ : R[X]) = 1 ↔ a = 1 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_ofFinsupp (p) : support (⟨p⟩ : R[X]) = p.support :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_toFinsupp (p : R[X]) : p.toFinsupp.support = p.support :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_eq_empty : p.support = ∅ ↔ p = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem card_support_eq_zero : p.support.card = 0 ↔ p = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toFinsupp_monomial (n : ℕ) (r : R) : (monomial n r).toFinsupp = Finsupp.single n r :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ofFinsupp_single (n : ℕ) (r : R) : (⟨Finsupp.single n r⟩ : R[X]) = monomial n r :=", "area": "Algebra"} {"task": "t8", "statement": "theorem monomial_mul_monomial (n m : ℕ) (r s : R) : monomial n r * monomial m s = monomial (n + m) (r * s) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem monomial_pow (n : ℕ) (r : R) (k : ℕ) : monomial n r ^ k = monomial (n * k) (r ^ k) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem smul_monomial {S} [SMulZeroClass S R] (a : S) (n : ℕ) (b : R) : a • monomial n b = monomial n (a • b) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_add : (p + q).support ⊆ p.support ∪ q.support :=", "area": "Algebra"} {"task": "t8", "statement": "theorem C_0 : C (0 : R) = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem C_mul_monomial : C a * monomial n b = monomial n (a * b) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem monomial_mul_C : monomial n a * C b = monomial n (a * b) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem monomial_one_right_eq_X_pow (n : ℕ) : monomial n (1 : R) = X ^ n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem X_mul : X * p = p * X :=", "area": "Algebra"} {"task": "t8", "statement": "theorem X_pow_mul {n : ℕ} : X ^ n * p = p * X ^ n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem X_pow_mul_assoc {n : ℕ} : p * X ^ n * q = p * q * X ^ n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem monomial_mul_X (n : ℕ) (r : R) : monomial n r * X = monomial (n + 1) r :=", "area": "Algebra"} {"task": "t8", "statement": "theorem monomial_mul_X_pow (n : ℕ) (r : R) (k : ℕ) : monomial n r * X ^ k = monomial (n + k) r :=", "area": "Algebra"} {"task": "t8", "statement": "theorem X_mul_monomial (n : ℕ) (r : R) : X * monomial n r = monomial (n + 1) r :=", "area": "Algebra"} {"task": "t8", "statement": "theorem X_pow_mul_monomial (k n : ℕ) (r : R) : X ^ k * monomial n r = monomial (n + k) r :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_ofFinsupp (p) : coeff (⟨p⟩ : R[X]) = p :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_injective : Injective (coeff : R[X] → ℕ → R) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toFinsupp_apply (f : R[X]) (i) : f.toFinsupp i = f.coeff i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_monomial : coeff (monomial n a) m = if n = m then a else 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_one {n : ℕ} : coeff (1 : R[X]) n = if n = 0 then 1 else 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_one_zero : coeff (1 : R[X]) 0 = 1 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_monomial_succ : coeff (monomial (n + 1) a) 0 = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_X_of_ne_one {n : ℕ} (hn : n ≠ 1) : coeff (X : R[X]) n = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mem_support_iff : n ∈ p.support ↔ p.coeff n ≠ 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem not_mem_support_iff : n ∉ p.support ↔ p.coeff n = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_C : coeff (C a) n = ite (n = 0) a 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_C_ne_zero (h : n ≠ 0) : (C a).coeff n = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma coeff_C_succ {r : R} {n : ℕ} : coeff (C r) (n + 1) = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_natCast_ite : (Nat.cast m : R[X]).coeff n = ite (n = 0) m 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_ofNat_succ (a n : ℕ) [h : a.AtLeastTwo] : coeff (no_index (OfNat.ofNat a : R[X])) (n + 1) = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem C_mul_X_pow_eq_monomial : ∀ {n : ℕ}, C a * X ^ n = monomial n a", "area": "Algebra"} {"task": "t8", "statement": "theorem toFinsupp_C_mul_X_pow (a : R) (n : ℕ) : Polynomial.toFinsupp (C a * X ^ n) = Finsupp.single n a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem C_mul_X_eq_monomial : C a * X = monomial 1 a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toFinsupp_C_mul_X (a : R) : Polynomial.toFinsupp (C a * X) = Finsupp.single 1 a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem subsingleton_iff_subsingleton : Subsingleton R[X] ↔ Subsingleton R :=", "area": "Algebra"} {"task": "t8", "statement": "theorem forall_eq_iff_forall_eq : (∀ f g : R[X], f = g) ↔ ∀ a b : R, a = b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ext_iff {p q : R[X]} : p = q ↔ ∀ n, coeff p n = coeff q n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem addSubmonoid_closure_setOf_eq_monomial : AddSubmonoid.closure { p : R[X] | ∃ n a, p = monomial n a } = ⊤ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem addHom_ext {M : Type*} [AddMonoid M] {f g : R[X] →+ M} (h : ∀ n a, f (monomial n a) = g (monomial n a)) : f = g :=", "area": "Algebra"} {"task": "t8", "statement": "theorem eq_zero_of_eq_zero (h : (0 : R) = (1 : R)) (p : R[X]) : p = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_monomial (n) {a : R} (H : a ≠ 0) : (monomial n a).support = singleton n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_monomial' (n) (a : R) : (monomial n a).support ⊆ singleton n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_C_mul_X {c : R} (h : c ≠ 0) : Polynomial.support (C c * X) = singleton 1 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_C_mul_X' (c : R) : Polynomial.support (C c * X) ⊆ singleton 1 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_C_mul_X_pow (n : ℕ) {c : R} (h : c ≠ 0) : Polynomial.support (C c * X ^ n) = singleton n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_C_mul_X_pow' (n : ℕ) (c : R) : Polynomial.support (C c * X ^ n) ⊆ singleton n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem X_pow_eq_monomial (n) : X ^ n = monomial n (1 : R) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toFinsupp_X_pow (n : ℕ) : (X ^ n).toFinsupp = Finsupp.single n (1 : R) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem smul_X_eq_monomial {n} : a • X ^ n = monomial n (a : R) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_X_pow (H : ¬(1 : R) = 0) (n : ℕ) : (X ^ n : R[X]).support = singleton n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_X_empty (H : (1 : R) = 0) : (X : R[X]).support = ∅ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_X (H : ¬(1 : R) = 0) : (X : R[X]).support = singleton 1 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem monomial_left_inj {a : R} (ha : a ≠ 0) {i j : ℕ} : monomial i a = monomial j a ↔ i = j :=", "area": "Algebra"} {"task": "t8", "statement": "theorem binomial_eq_binomial {k l m n : ℕ} {u v : R} (hu : u ≠ 0) (hv : v ≠ 0) : C u * X ^ k + C v * X ^ l = C u * X ^ m + C v * X ^ n ↔ k = m ∧ l = n ∨ u = v ∧ k = n ∧ l = m ∨ u + v = 0 ∧ k = l ∧ m = n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mul_eq_sum_sum : p * q = ∑ i ∈ p.support, q.sum fun j a => (monomial (i + j)) (p.coeff i * a) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem sum_zero_index {S : Type*} [AddCommMonoid S] (f : ℕ → R → S) : (0 : R[X]).sum f = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem sum_add_index {S : Type*} [AddCommMonoid S] (p q : R[X]) (f : ℕ → R → S) (hf : ∀ i, f i 0 = 0) (h_add : ∀ a b₁ b₂, f a (b₁ + b₂) = f a b₁ + f a b₂) : (p + q).sum f = p.sum f + q.sum f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem sum_add' {S : Type*} [AddCommMonoid S] (p : R[X]) (f g : ℕ → R → S) : p.sum (f + g) = p.sum f + p.sum g :=", "area": "Algebra"} {"task": "t8", "statement": "theorem sum_C_mul_X_pow_eq (p : R[X]) : (p.sum fun n a => C a * X ^ n) = p :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toFinsupp_erase (p : R[X]) (n : ℕ) : toFinsupp (p.erase n) = p.toFinsupp.erase n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ofFinsupp_erase (p : R[ℕ]) (n : ℕ) : (⟨p.erase n⟩ : R[X]) = (⟨p⟩ : R[X]).erase n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_erase (p : R[X]) (n : ℕ) : support (p.erase n) = (support p).erase n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem monomial_add_erase (p : R[X]) (n : ℕ) : monomial n (coeff p n) + p.erase n = p :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_erase (p : R[X]) (n i : ℕ) : (p.erase n).coeff i = if i = n then 0 else p.coeff i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem erase_zero (n : ℕ) : (0 : R[X]).erase n = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem erase_monomial {n : ℕ} {a : R} : erase n (monomial n a) = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem erase_same (p : R[X]) (n : ℕ) : coeff (p.erase n) n = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem erase_ne (p : R[X]) (n i : ℕ) (h : i ≠ n) : coeff (p.erase n) i = coeff p i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_update (p : R[X]) (n : ℕ) (a : R) : (p.update n a).coeff = Function.update p.coeff n a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_update_apply (p : R[X]) (n : ℕ) (a : R) (i : ℕ) : (p.update n a).coeff i = if i = n then a else p.coeff i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_update_same (p : R[X]) (n : ℕ) (a : R) : (p.update n a).coeff n = a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_update_ne (p : R[X]) {n : ℕ} (a : R) {i : ℕ} (h : i ≠ n) : (p.update n a).coeff i = p.coeff i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem update_zero_eq_erase (p : R[X]) (n : ℕ) : p.update n 0 = p.erase n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_update (p : R[X]) (n : ℕ) (a : R) [Decidable (a = 0)] : support (p.update n a) = if a = 0 then p.support.erase n else insert n p.support :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_update_zero (p : R[X]) (n : ℕ) : support (p.update n 0) = p.support.erase n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_update_ne_zero (p : R[X]) (n : ℕ) {a : R} (ha : a ≠ 0) : support (p.update n a) = insert n p.support :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_neg (p : R[X]) (n : ℕ) : coeff (-p) n = -coeff p n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coeff_sub (p q : R[X]) (n : ℕ) : coeff (p - q) n = coeff p n - coeff q n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem monomial_neg (n : ℕ) (a : R) : monomial n (-a) = -monomial n a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem monomial_sub (n : ℕ) : monomial n (a - b) = monomial n a - monomial n b :=", "area": "Algebra"} {"task": "t8", "statement": "theorem support_neg {p : R[X]} : (-p).support = p.support :=", "area": "Algebra"} {"task": "t8", "statement": "theorem C_eq_intCast (n : ℤ) : C (n : R) = n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem X_ne_zero : (X : R[X]) ≠ 0 :=", "area": "Algebra"} {"task": "t8", "statement": "lemma nnqsmul_eq_C_mul (q : ℚ≥0) (f : R[X]) : q • f = Polynomial.C (q : R) * f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem qsmul_eq_C_mul (a : ℚ) (f : R[X]) : a • f = Polynomial.C (a : R) * f :=", "area": "Algebra"} {"task": "t8", "statement": "@[reassoc (attr := simp)] lemma ι_mapBifunctorMap (i₁ : I₁) (i₂ : I₂) (j : J) (h : ComplexShape.π c₁ c₂ c (i₁, i₂) = j) : ιMapBifunctor K₁ K₂ F c i₁ i₂ j h ≫ (mapBifunctorMap f₁ f₂ F c).f j = (F.map (f₁.f i₁)).app (K₂.X i₂) ≫ (F.obj (L₁.X i₁)).map (f₂.f i₂) ≫ ιMapBifunctor L₁ L₂ F c i₁ i₂ j h :=", "area": "Algebra"} {"task": "t8", "statement": "lemma hasColimitDiagram (I : D ⥤ Ideal R) (i : ℕ) : HasColimit (diagram I i) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Ideal.exists_pow_le_of_le_radical_of_fG (hIJ : I ≤ J.radical) (hJ : J.radical.FG) : ∃ k : ℕ, I ^ k ≤ J :=", "area": "Algebra"} {"task": "t8", "statement": "theorem d_comp_d (C : HomologicalComplex V c) (i j k : ι) : C.d i j ≫ C.d j k = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ext {C₁ C₂ : HomologicalComplex V c} (h_X : C₁.X = C₂.X) (h_d : ∀ i j : ι, c.Rel i j → C₁.d i j ≫ eqToHom (congr_fun h_X j) = eqToHom (congr_fun h_X i) ≫ C₂.d i j) : C₁ = C₂ :=", "area": "Algebra"} {"task": "t8", "statement": "@[reassoc (attr := simp)] lemma XIsoOfEq_hom_comp_XIsoOfEq_hom (K : HomologicalComplex V c) {p₁ p₂ p₃ : ι} (h₁₂ : p₁ = p₂) (h₂₃ : p₂ = p₃) : (K.XIsoOfEq h₁₂).hom ≫ (K.XIsoOfEq h₂₃).hom = (K.XIsoOfEq (h₁₂.trans h₂₃)).hom :=", "area": "Algebra"} {"task": "t8", "statement": "@[reassoc (attr := simp)] lemma XIsoOfEq_hom_comp_XIsoOfEq_inv (K : HomologicalComplex V c) {p₁ p₂ p₃ : ι} (h₁₂ : p₁ = p₂) (h₃₂ : p₃ = p₂) : (K.XIsoOfEq h₁₂).hom ≫ (K.XIsoOfEq h₃₂).inv = (K.XIsoOfEq (h₁₂.trans h₃₂.symm)).hom :=", "area": "Algebra"} {"task": "t8", "statement": "@[reassoc (attr := simp)] lemma XIsoOfEq_inv_comp_XIsoOfEq_hom (K : HomologicalComplex V c) {p₁ p₂ p₃ : ι} (h₂₁ : p₂ = p₁) (h₂₃ : p₂ = p₃) : (K.XIsoOfEq h₂₁).inv ≫ (K.XIsoOfEq h₂₃).hom = (K.XIsoOfEq (h₂₁.symm.trans h₂₃)).hom :=", "area": "Algebra"} {"task": "t8", "statement": "@[reassoc (attr := simp)] lemma XIsoOfEq_inv_comp_XIsoOfEq_inv (K : HomologicalComplex V c) {p₁ p₂ p₃ : ι} (h₂₁ : p₂ = p₁) (h₃₂ : p₃ = p₂) : (K.XIsoOfEq h₂₁).inv ≫ (K.XIsoOfEq h₃₂).inv = (K.XIsoOfEq (h₃₂.trans h₂₁).symm).hom :=", "area": "Algebra"} {"task": "t8", "statement": "@[reassoc (attr := simp)] lemma XIsoOfEq_hom_comp_d (K : HomologicalComplex V c) {p₁ p₂ : ι} (h : p₁ = p₂) (p₃ : ι) : (K.XIsoOfEq h).hom ≫ K.d p₂ p₃ = K.d p₁ p₃ :=", "area": "Algebra"} {"task": "t8", "statement": "@[reassoc (attr := simp)] lemma XIsoOfEq_inv_comp_d (K : HomologicalComplex V c) {p₂ p₁ : ι} (h : p₂ = p₁) (p₃ : ι) : (K.XIsoOfEq h).inv ≫ K.d p₂ p₃ = K.d p₁ p₃ :=", "area": "Algebra"} {"task": "t8", "statement": "@[reassoc (attr := simp)] lemma d_comp_XIsoOfEq_hom (K : HomologicalComplex V c) {p₂ p₃ : ι} (h : p₂ = p₃) (p₁ : ι) : K.d p₁ p₂ ≫ (K.XIsoOfEq h).hom = K.d p₁ p₃ :=", "area": "Algebra"} {"task": "t8", "statement": "@[reassoc (attr := simp)] lemma d_comp_XIsoOfEq_inv (K : HomologicalComplex V c) {p₂ p₃ : ι} (h : p₃ = p₂) (p₁ : ι) : K.d p₁ p₂ ≫ (K.XIsoOfEq h).inv = K.d p₁ p₃ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem next_nat_zero : (ComplexShape.down ℕ).next 0 = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem prev_nat_zero : (ComplexShape.up ℕ).prev 0 = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Hom.comm {A B : HomologicalComplex V c} (f : A.Hom B) (i j : ι) : f.f i ≫ B.d i j = A.d i j ≫ f.f j :=", "area": "Algebra"} {"task": "t8", "statement": "@[ext] lemma hom_ext {C D : HomologicalComplex V c} (f g : C ⟶ D) (h : ∀ i, f.f i = g.f i) : f = g :=", "area": "Algebra"} {"task": "t8", "statement": "theorem eqToHom_f {C₁ C₂ : HomologicalComplex V c} (h : C₁ = C₂) (n : ι) : HomologicalComplex.Hom.f (eqToHom h) n = eqToHom (congr_fun (congr_arg HomologicalComplex.X h) n) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem hom_f_injective {C₁ C₂ : HomologicalComplex V c} : Function.Injective fun f : Hom C₁ C₂ => f.f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem isZero_zero [HasZeroObject V] : IsZero (zero : HomologicalComplex V c) :=", "area": "Algebra"} {"task": "t8", "statement": "lemma mono_of_mono_f {K L : HomologicalComplex V c} (φ : K ⟶ L) (hφ : ∀ i, Mono (φ.f i)) : Mono φ where", "area": "Algebra"} {"task": "t8", "statement": "lemma epi_of_epi_f {K L : HomologicalComplex V c} (φ : K ⟶ L) (hφ : ∀ i, Epi (φ.f i)) : Epi φ where", "area": "Algebra"} {"task": "t8", "statement": "@[reassoc] lemma XIsoOfEq_hom_naturality {K L : HomologicalComplex V c} (φ : K ⟶ L) {n n' : ι} (h : n = n') : φ.f n ≫ (L.XIsoOfEq h).hom = (K.XIsoOfEq h).hom ≫ φ.f n' :=", "area": "Algebra"} {"task": "t8", "statement": "@[reassoc] lemma XIsoOfEq_inv_naturality {K L : HomologicalComplex V c} (φ : K ⟶ L) {n n' : ι} (h : n = n') : φ.f n' ≫ (L.XIsoOfEq h).inv = (K.XIsoOfEq h).inv ≫ φ.f n :=", "area": "Algebra"} {"task": "t8", "statement": "theorem d_comp_eqToHom {i j j' : ι} (rij : c.Rel i j) (rij' : c.Rel i j') : C.d i j' ≫ eqToHom (congr_arg C.X (c.next_eq rij' rij)) = C.d i j :=", "area": "Algebra"} {"task": "t8", "statement": "theorem eqToHom_comp_d {i i' j : ι} (rij : c.Rel i j) (rij' : c.Rel i' j) : eqToHom (congr_arg C.X (c.prev_eq rij rij')) ≫ C.d i' j = C.d i j :=", "area": "Algebra"} {"task": "t8", "statement": "theorem kernel_eq_kernel [HasKernels V] {i j j' : ι} (r : c.Rel i j) (r' : c.Rel i j') : kernelSubobject (C.d i j) = kernelSubobject (C.d i j') :=", "area": "Algebra"} {"task": "t8", "statement": "theorem image_eq_image [HasImages V] [HasEqualizers V] {i i' j : ι} (r : c.Rel i j) (r' : c.Rel i' j) : imageSubobject (C.d i j) = imageSubobject (C.d i' j) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem dTo_eq {i j : ι} (r : c.Rel i j) : C.dTo j = (C.xPrevIso r).hom ≫ C.d i j :=", "area": "Algebra"} {"task": "t8", "statement": "theorem dFrom_eq {i j : ι} (r : c.Rel i j) : C.dFrom i = C.d i j ≫ (C.xNextIso r).inv :=", "area": "Algebra"} {"task": "t8", "statement": "theorem xPrevIso_comp_dTo {i j : ι} (r : c.Rel i j) : (C.xPrevIso r).inv ≫ C.dTo j = C.d i j :=", "area": "Algebra"} {"task": "t8", "statement": "theorem xPrevIsoSelf_comp_dTo {j : ι} (h : ¬c.Rel (c.prev j) j) : (C.xPrevIsoSelf h).inv ≫ C.dTo j = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem dFrom_comp_xNextIso {i j : ι} (r : c.Rel i j) : C.dFrom i ≫ (C.xNextIso r).hom = C.d i j :=", "area": "Algebra"} {"task": "t8", "statement": "theorem dFrom_comp_xNextIsoSelf {i : ι} (h : ¬c.Rel i (c.next i)) : C.dFrom i ≫ (C.xNextIsoSelf h).hom = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem kernel_from_eq_kernel [HasKernels V] {i j : ι} (r : c.Rel i j) : kernelSubobject (C.dFrom i) = kernelSubobject (C.d i j) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem image_to_eq_image [HasImages V] [HasEqualizers V] {i j : ι} (r : c.Rel i j) : imageSubobject (C.dTo j) = imageSubobject (C.d i j) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem isoOfComponents_app (f : ∀ i, C₁.X i ≅ C₂.X i) (hf : ∀ i j, c.Rel i j → (f i).hom ≫ C₂.d i j = C₁.d i j ≫ (f j).hom) (i : ι) : isoApp (isoOfComponents f hf) i = f i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem prev_eq (f : Hom C₁ C₂) {i j : ι} (w : c.Rel i j) : f.prev j = (C₁.xPrevIso w).hom ≫ f.f i ≫ (C₂.xPrevIso w).inv :=", "area": "Algebra"} {"task": "t8", "statement": "theorem next_eq (f : Hom C₁ C₂) {i j : ι} (w : c.Rel i j) : f.next i = (C₁.xNextIso w).hom ≫ f.f j ≫ (C₂.xNextIso w).inv :=", "area": "Algebra"} {"task": "t8", "statement": "theorem of_d (j : α) : (of X d sq).d (j + 1) j = d j :=", "area": "Algebra"} {"task": "t8", "statement": "theorem of_d_ne {i j : α} (h : i ≠ j + 1) : (of X d sq).d i j = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mk_d_1_0 : (mk X₀ X₁ X₂ d₀ d₁ s succ).d 1 0 = d₀ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mk_d_2_1 : (mk X₀ X₁ X₂ d₀ d₁ s succ).d 2 1 = d₁ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mk'_d_1_0 : (mk' X₀ X₁ d₀ succ').d 1 0 = d₀ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mkHom_f_succ_succ (n : ℕ) : (mkHom P Q zero one one_zero_comm succ).f (n + 2) = (succ n ⟨(mkHom P Q zero one one_zero_comm succ).f n, (mkHom P Q zero one one_zero_comm succ).f (n + 1), (mkHom P Q zero one one_zero_comm succ).comm (n + 1) n⟩).1 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem of_d (j : α) : (of X d sq).d j (j + 1) = d j :=", "area": "Algebra"} {"task": "t8", "statement": "theorem of_d_ne {i j : α} (h : i + 1 ≠ j) : (of X d sq).d i j = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mk_d_1_0 : (mk X₀ X₁ X₂ d₀ d₁ s succ).d 0 1 = d₀ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mk_d_2_0 : (mk X₀ X₁ X₂ d₀ d₁ s succ).d 1 2 = d₁ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mk'_d_1_0 : (mk' X₀ X₁ d₀ succ').d 0 1 = d₀ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mkHom_f_succ_succ (n : ℕ) : (mkHom P Q zero one one_zero_comm succ).f (n + 2) = (succ n ⟨(mkHom P Q zero one one_zero_comm succ).f n, (mkHom P Q zero one one_zero_comm succ).f (n + 1), (mkHom P Q zero one one_zero_comm succ).comm n (n + 1)⟩).1 :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma leftHomologyMap'_neg : leftHomologyMap' (-φ) h₁ h₂ = -leftHomologyMap' φ h₁ h₂ :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma cyclesMap'_neg : cyclesMap' (-φ) h₁ h₂ = -cyclesMap' φ h₁ h₂ :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma leftHomologyMap'_add : leftHomologyMap' (φ + φ') h₁ h₂ = leftHomologyMap' φ h₁ h₂ + leftHomologyMap' φ' h₁ h₂ :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma cyclesMap'_add : cyclesMap' (φ + φ') h₁ h₂ = cyclesMap' φ h₁ h₂ + cyclesMap' φ' h₁ h₂ :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma leftHomologyMap'_sub : leftHomologyMap' (φ - φ') h₁ h₂ = leftHomologyMap' φ h₁ h₂ - leftHomologyMap' φ' h₁ h₂ :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma cyclesMap'_sub : cyclesMap' (φ - φ') h₁ h₂ = cyclesMap' φ h₁ h₂ - cyclesMap' φ' h₁ h₂ :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma rightHomologyMap'_neg : rightHomologyMap' (-φ) h₁ h₂ = -rightHomologyMap' φ h₁ h₂ :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma opcyclesMap'_neg : opcyclesMap' (-φ) h₁ h₂ = -opcyclesMap' φ h₁ h₂ :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma rightHomologyMap'_add : rightHomologyMap' (φ + φ') h₁ h₂ = rightHomologyMap' φ h₁ h₂ + rightHomologyMap' φ' h₁ h₂ :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma opcyclesMap'_add : opcyclesMap' (φ + φ') h₁ h₂ = opcyclesMap' φ h₁ h₂ + opcyclesMap' φ' h₁ h₂ :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma rightHomologyMap'_sub : rightHomologyMap' (φ - φ') h₁ h₂ = rightHomologyMap' φ h₁ h₂ - rightHomologyMap' φ' h₁ h₂ :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma opcyclesMap'_sub : opcyclesMap' (φ - φ') h₁ h₂ = opcyclesMap' φ h₁ h₂ - opcyclesMap' φ' h₁ h₂ :=", "area": "Algebra"} {"task": "t8", "statement": "lemma eq_add_nullHomotopic (h : Homotopy φ₁ φ₂) : φ₁ = φ₂ + nullHomotopic _ _ h.h₀ h.h₀_f h.h₁ h.h₂ h.h₃ h.g_h₃ :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma homologyMap'_nullHomotopic (H₁ : S₁.HomologyData) (H₂ : S₂.HomologyData) (h₀ : S₁.X₁ ⟶ S₂.X₁) (h₀_f : h₀ ≫ S₂.f = 0) (h₁ : S₁.X₂ ⟶ S₂.X₁) (h₂ : S₁.X₃ ⟶ S₂.X₂) (h₃ : S₁.X₃ ⟶ S₂.X₃) (g_h₃ : S₁.g ≫ h₃ = 0) : homologyMap' (nullHomotopic _ _ h₀ h₀_f h₁ h₂ h₃ g_h₃) H₁ H₂ = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma leftHomologyMap_nullHomotopic [S₁.HasLeftHomology] [S₂.HasLeftHomology] (h₀ : S₁.X₁ ⟶ S₂.X₁) (h₀_f : h₀ ≫ S₂.f = 0) (h₁ : S₁.X₂ ⟶ S₂.X₁) (h₂ : S₁.X₃ ⟶ S₂.X₂) (h₃ : S₁.X₃ ⟶ S₂.X₃) (g_h₃ : S₁.g ≫ h₃ = 0) : leftHomologyMap (nullHomotopic _ _ h₀ h₀_f h₁ h₂ h₃ g_h₃) = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma rightHomologyMap_nullHomotopic [S₁.HasRightHomology] [S₂.HasRightHomology] (h₀ : S₁.X₁ ⟶ S₂.X₁) (h₀_f : h₀ ≫ S₂.f = 0) (h₁ : S₁.X₂ ⟶ S₂.X₁) (h₂ : S₁.X₃ ⟶ S₂.X₂) (h₃ : S₁.X₃ ⟶ S₂.X₃) (g_h₃ : S₁.g ≫ h₃ = 0) : rightHomologyMap (nullHomotopic _ _ h₀ h₀_f h₁ h₂ h₃ g_h₃) = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma homologyMap_nullHomotopic [S₁.HasHomology] [S₂.HasHomology] (h₀ : S₁.X₁ ⟶ S₂.X₁) (h₀_f : h₀ ≫ S₂.f = 0) (h₁ : S₁.X₂ ⟶ S₂.X₁) (h₂ : S₁.X₃ ⟶ S₂.X₂) (h₃ : S₁.X₃ ⟶ S₂.X₃) (g_h₃ : S₁.g ≫ h₃ = 0) : homologyMap (nullHomotopic _ _ h₀ h₀_f h₁ h₂ h₃ g_h₃) = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "lemma leftHomologyMap'_congr (h : Homotopy φ₁ φ₂) (h₁ : S₁.LeftHomologyData) (h₂ : S₂.LeftHomologyData) : leftHomologyMap' φ₁ h₁ h₂ = leftHomologyMap' φ₂ h₁ h₂ :=", "area": "Algebra"} {"task": "t8", "statement": "lemma rightHomologyMap'_congr (h : Homotopy φ₁ φ₂) (h₁ : S₁.RightHomologyData) (h₂ : S₂.RightHomologyData) : rightHomologyMap' φ₁ h₁ h₂ = rightHomologyMap' φ₂ h₁ h₂ :=", "area": "Algebra"} {"task": "t8", "statement": "lemma homologyMap'_congr (h : Homotopy φ₁ φ₂) (h₁ : S₁.HomologyData) (h₂ : S₂.HomologyData) : homologyMap' φ₁ h₁ h₂ = homologyMap' φ₂ h₁ h₂ :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma homOfDegreewiseSplit_f (n : ℤ) : (homOfDegreewiseSplit S σ).f n = (cocycleOfDegreewiseSplit S σ).1.v n (n + 1) rfl :=", "area": "Algebra"} {"task": "t8", "statement": "@[reassoc (attr := simp)] lemma shift_f_comp_mappingConeHomOfDegreewiseSplitIso_inv : S.f⟦(1 : ℤ)⟧' ≫ (mappingConeHomOfDegreewiseSplitIso S σ).inv = -mappingCone.inr _ :=", "area": "Algebra"} {"task": "t8", "statement": "@[reassoc (attr := simp)] lemma mappingConeHomOfDegreewiseSplitIso_inv_comp_triangle_mor₃ : (mappingConeHomOfDegreewiseSplitIso S σ).inv ≫ (mappingCone.triangle (homOfDegreewiseSplit S σ)).mor₃ = -S.g⟦(1 : ℤ)⟧' :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma cocycleOfDegreewiseSplit_triangleRotateShortComplexSplitting_v (p : ℤ) : (cocycleOfDegreewiseSplit _ (triangleRotateShortComplexSplitting φ)).1.v p _ rfl = -φ.f _ :=", "area": "Algebra"} {"task": "t8", "statement": "lemma distinguished_iff_iso_trianglehOfDegreewiseSplit (T : Triangle (HomotopyCategory C (ComplexShape.up ℤ))) : (T ∈ distTriang _) ↔ ∃ (S : ShortComplex (CochainComplex C ℤ)) (σ : ∀ n, (S.map (HomologicalComplex.eval C _ n)).Splitting), Nonempty (T ≅ CochainComplex.trianglehOfDegreewiseSplit S σ) :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma inv_add_add_mul_eq_zero (u : (PreQuasiregular R)ˣ) : u⁻¹.val.val + u.val.val + u.val.val * u⁻¹.val.val = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma add_inv_add_mul_eq_zero (u : (PreQuasiregular R)ˣ) : u.val.val + u⁻¹.val.val + u⁻¹.val.val * u.val.val = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "lemma isQuasiregular_iff {x : R} : IsQuasiregular x ↔ ∃ y, y + x + x * y = 0 ∧ x + y + y * x = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "lemma IsQuasiregular.map {F R S : Type*} [NonUnitalSemiring R] [NonUnitalSemiring S] [FunLike F R S] [NonUnitalRingHomClass F R S] (f : F) {x : R} (hx : IsQuasiregular x) : IsQuasiregular (f x) :=", "area": "Algebra"} {"task": "t8", "statement": "lemma IsQuasiregular.isUnit_one_add {R : Type*} [Semiring R] {x : R} (hx : IsQuasiregular x) : IsUnit (1 + x) :=", "area": "Algebra"} {"task": "t8", "statement": "lemma isQuasiregular_iff_isUnit {R : Type*} [Ring R] {x : R} : IsQuasiregular x ↔ IsUnit (1 + x) :=", "area": "Algebra"} {"task": "t8", "statement": "lemma isQuasiregular_iff_isUnit' (R : Type*) {A : Type*} [CommSemiring R] [NonUnitalSemiring A] [Module R A] [IsScalarTower R A A] [SMulCommClass R A A] {x : A} : IsQuasiregular x ↔ IsUnit (1 + x : Unitization R A) :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma quasispectrum.zero_mem [Nontrivial R] (a : A) : 0 ∈ quasispectrum R a :=", "area": "Algebra"} {"task": "t8", "statement": "lemma quasispectrum.mem_of_not_quasiregular (a : A) {r : Rˣ} (hr : ¬ IsQuasiregular (-(r⁻¹ • a))) : (r : R) ∈ quasispectrum R a :=", "area": "Algebra"} {"task": "t8", "statement": "lemma quasispectrum_eq_spectrum_union (R : Type*) {A : Type*} [CommSemiring R] [Ring A] [Algebra R A] (a : A) : quasispectrum R a = spectrum R a ∪ {r : R | ¬ IsUnit r} :=", "area": "Algebra"} {"task": "t8", "statement": "lemma quasispectrum_eq_spectrum_union_zero (R : Type*) {A : Type*} [Semifield R] [Ring A] [Algebra R A] (a : A) : quasispectrum R a = spectrum R a ∪ {0} :=", "area": "Algebra"} {"task": "t8", "statement": "lemma mem_quasispectrum_iff {R A : Type*} [Semifield R] [Ring A] [Algebra R A] {a : A} {x : R} : x ∈ quasispectrum R a ↔ x = 0 ∨ x ∈ spectrum R a :=", "area": "Algebra"} {"task": "t8", "statement": "lemma isQuasiregular_inr_iff (a : A) : IsQuasiregular (a : Unitization R A) ↔ IsQuasiregular a :=", "area": "Algebra"} {"task": "t8", "statement": "lemma zero_mem_spectrum_inr (R S : Type*) {A : Type*} [CommSemiring R] [CommRing S] [Nontrivial S] [NonUnitalRing A] [Algebra R S] [Module S A] [IsScalarTower S A A] [SMulCommClass S A A] [Module R A] [IsScalarTower R S A] (a : A) : 0 ∈ spectrum R (a : Unitization S A) :=", "area": "Algebra"} {"task": "t8", "statement": "lemma mem_spectrum_inr_of_not_isUnit {R A : Type*} [CommRing R] [NonUnitalRing A] [Module R A] [IsScalarTower R A A] [SMulCommClass R A A] (a : A) (r : R) (hr : ¬ IsUnit r) : r ∈ spectrum R (a : Unitization R A) :=", "area": "Algebra"} {"task": "t8", "statement": "lemma quasispectrum_eq_spectrum_inr (R : Type*) {A : Type*} [CommRing R] [Ring A] [Algebra R A] (a : A) : quasispectrum R a = spectrum R (a : Unitization R A) :=", "area": "Algebra"} {"task": "t8", "statement": "lemma quasispectrum_eq_spectrum_inr' (R S : Type*) {A : Type*} [Semifield R] [Field S] [NonUnitalRing A] [Algebra R S] [Module S A] [IsScalarTower S A A] [SMulCommClass S A A] [Module R A] [IsScalarTower R S A] (a : A) : quasispectrum R a = spectrum R (a : Unitization S A) :=", "area": "Algebra"} {"task": "t8", "statement": "lemma iff_spectrum_nonneg {𝕜 A : Type*} [LinearOrderedSemifield 𝕜] [Ring A] [PartialOrder A] [Algebra 𝕜 A] : NonnegSpectrumClass 𝕜 A ↔ ∀ a : A, 0 ≤ a → ∀ x ∈ spectrum 𝕜 a, 0 ≤ x :=", "area": "Algebra"} {"task": "t8", "statement": "theorem quasispectrum.algebraMap_mem_iff (S : Type*) {R A : Type*} [Semifield R] [Field S] [NonUnitalRing A] [Algebra R S] [Module S A] [IsScalarTower S A A] [SMulCommClass S A A] [Module R A] [IsScalarTower R S A] {a : A} {r : R} : algebraMap R S r ∈ quasispectrum S a ↔ r ∈ quasispectrum R a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_zero (h : QuasispectrumRestricts a f) : f 0 = 0 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem of_subset_range_algebraMap (hf : f.LeftInverse (algebraMap R S)) (h : quasispectrum S a ⊆ Set.range (algebraMap R S)) : QuasispectrumRestricts a f where", "area": "Algebra"} {"task": "t8", "statement": "theorem algebraMap_image : algebraMap R S '' quasispectrum R a = quasispectrum S a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem image : f '' quasispectrum S a = quasispectrum R a :=", "area": "Algebra"} {"task": "t8", "statement": "protected lemma comp {R₁ R₂ R₃ A : Type*} [Semifield R₁] [Field R₂] [Field R₃] [NonUnitalRing A] [Module R₁ A] [Module R₂ A] [Module R₃ A] [Algebra R₁ R₂] [Algebra R₂ R₃] [Algebra R₁ R₃] [IsScalarTower R₁ R₂ R₃] [IsScalarTower R₂ R₃ A] [IsScalarTower R₃ A A] [SMulCommClass R₃ A A] {a : A} {f : R₃ → R₂} {g : R₂ → R₁} {e : R₃ → R₁} (hfge : g ∘ f = e) (hf : QuasispectrumRestricts a f) (hg : QuasispectrumRestricts a g) : QuasispectrumRestricts a e where", "area": "Algebra"} {"task": "t8", "statement": "theorem of_rightInvOn (h₁ : Function.LeftInverse f (algebraMap R S)) (h₂ : (spectrum S a).RightInvOn f (algebraMap R S)) : SpectrumRestricts a f where", "area": "Algebra"} {"task": "t8", "statement": "theorem of_subset_range_algebraMap (hf : f.LeftInverse (algebraMap R S)) (h : spectrum S a ⊆ Set.range (algebraMap R S)) : SpectrumRestricts a f where", "area": "Algebra"} {"task": "t8", "statement": "theorem algebraMap_image : algebraMap R S '' spectrum R a = spectrum S a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem image : f '' spectrum S a = spectrum R a :=", "area": "Algebra"} {"task": "t8", "statement": "lemma of_spectrum_eq {a b : A} {f : S → R} (ha : SpectrumRestricts a f) (h : spectrum S a = spectrum S b) : SpectrumRestricts b f where", "area": "Algebra"} {"task": "t8", "statement": "theorem quasispectrumRestricts_iff_spectrumRestricts_inr (S : Type*) {R A : Type*} [Semifield R] [Field S] [NonUnitalRing A] [Algebra R S] [Module R A] [Module S A] [IsScalarTower S A A] [SMulCommClass S A A] [IsScalarTower R S A] {a : A} {f : S → R} : QuasispectrumRestricts a f ↔ SpectrumRestricts (a : Unitization S A) f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem quasispectrumRestricts_iff_spectrumRestricts {R S A : Type*} [Semifield R] [Semifield S] [Ring A] [Algebra R S] [Algebra R A] [Algebra S A] {a : A} {f : S → R} : QuasispectrumRestricts a f ↔ SpectrumRestricts a f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem symm_symm (e : A₁ ≃ₐ[R] A₂) : e.symm.symm = e :=", "area": "Algebra"} {"task": "t8", "statement": "theorem comp_symm (e : A₁ ≃ₐ[R] A₂) : AlgHom.comp (e : A₁ →ₐ[R] A₂) ↑e.symm = AlgHom.id R A₂ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem symm_comp (e : A₁ ≃ₐ[R] A₂) : AlgHom.comp ↑e.symm (e : A₁ →ₐ[R] A₂) = AlgHom.id R A₁ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem arrowCongr_comp (e₁ : A₁ ≃ₐ[R] A₁') (e₂ : A₂ ≃ₐ[R] A₂') (e₃ : A₃ ≃ₐ[R] A₃') (f : A₁ →ₐ[R] A₂) (g : A₂ →ₐ[R] A₃) : arrowCongr e₁ e₃ (g.comp f) = (arrowCongr e₂ e₃ g).comp (arrowCongr e₁ e₂ f) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem arrowCongr_refl : arrowCongr AlgEquiv.refl AlgEquiv.refl = Equiv.refl (A₁ →ₐ[R] A₂) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem arrowCongr_trans (e₁ : A₁ ≃ₐ[R] A₂) (e₁' : A₁' ≃ₐ[R] A₂') (e₂ : A₂ ≃ₐ[R] A₃) (e₂' : A₂' ≃ₐ[R] A₃') : arrowCongr (e₁.trans e₂) (e₁'.trans e₂') = (arrowCongr e₁ e₁').trans (arrowCongr e₂ e₂') :=", "area": "Algebra"} {"task": "t8", "statement": "theorem arrowCongr_symm (e₁ : A₁ ≃ₐ[R] A₁') (e₂ : A₂ ≃ₐ[R] A₂') : (arrowCongr e₁ e₂).symm = arrowCongr e₁.symm e₂.symm :=", "area": "Algebra"} {"task": "t8", "statement": "theorem equivCongr_refl : equivCongr AlgEquiv.refl AlgEquiv.refl = Equiv.refl (A₁ ≃ₐ[R] A₁') :=", "area": "Algebra"} {"task": "t8", "statement": "theorem ofLinearEquiv_toLinearEquiv (map_mul) (map_one) : ofLinearEquiv e.toLinearEquiv map_mul map_one = e :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toLinearEquiv_ofLinearEquiv : toLinearEquiv (ofLinearEquiv l map_one map_mul) = l :=", "area": "Algebra"} {"task": "t8", "statement": "theorem autCongr_refl : autCongr AlgEquiv.refl = MulEquiv.refl (A₁ ≃ₐ[R] A₁) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem algebraMap_eq_apply (e : A₁ ≃ₐ[R] A₂) {y : R} {x : A₁} : algebraMap R A₂ y = e x ↔ algebraMap R A₁ y = x :=", "area": "Algebra"} {"task": "t8", "statement": "theorem algebraMap_smul [SMul R M] [IsScalarTower R A M] (r : R) (x : M) : algebraMap R A r • x = r • x :=", "area": "Algebra"} {"task": "t8", "statement": "theorem of_algebraMap_smul [SMul R M] (h : ∀ (r : R) (x : M), algebraMap R A r • x = r • x) : IsScalarTower R A M where", "area": "Algebra"} {"task": "t8", "statement": "theorem of_algebraMap_eq [Algebra R A] (h : ∀ x, algebraMap R A x = algebraMap S A (algebraMap R S x)) : IsScalarTower R S A :=", "area": "Algebra"} {"task": "t8", "statement": "theorem algebraMap_eq : algebraMap R A = (algebraMap S A).comp (algebraMap R S) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem algebraMap_apply (x : R) : algebraMap R A x = algebraMap S A (algebraMap R S x) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem Algebra.ext {S : Type u} {A : Type v} [CommSemiring S] [Semiring A] (h1 h2 : Algebra S A) (h : ∀ (r : S) (x : A), (by have I := h1; exact r • x) = r • x) : h1 = h2 :=", "area": "Algebra"} {"task": "t8", "statement": "theorem _root_.AlgHom.map_algebraMap (f : A →ₐ[S] B) (r : R) : f (algebraMap R A r) = algebraMap R B r :=", "area": "Algebra"} {"task": "t8", "statement": "theorem restrictScalars_span (hsur : Function.Surjective (algebraMap R A)) (X : Set M) : restrictScalars R (span A X) = span R X :=", "area": "Algebra"} {"task": "t8", "statement": "theorem smul_mem_span_smul_of_mem {s : Set S} {t : Set A} {k : S} (hks : k ∈ span R s) {x : A} (hx : x ∈ t) : k • x ∈ span R (s • t) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem span_smul_of_span_eq_top {s : Set S} (hs : span R s = ⊤) (t : Set A) : span R (s • t) = (span S t).restrictScalars R :=", "area": "Algebra"} {"task": "t8", "statement": "theorem smul_mem_span_smul' {s : Set S} (hs : span R s = ⊤) {t : Set A} {k : S} {x : A} (hx : x ∈ span R (s • t)) : k • x ∈ span R (s • t) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem smul_mem_span_smul {s : Set S} (hs : span R s = ⊤) {t : Set A} {k : S} {x : A} (hx : x ∈ span R t) : k • x ∈ span R (s • t) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_mem_span_algebraMap_image {S T : Type*} [CommSemiring S] [Semiring T] [Algebra R S] [Algebra R T] [Algebra S T] [IsScalarTower R S T] (x : S) (a : Set S) (hx : x ∈ Submodule.span R a) : algebraMap S T x ∈ Submodule.span R (algebraMap S T '' a) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mul_sub_algebraMap_commutes [Ring A] [Algebra R A] (x : A) (r : R) : x * (x - algebraMap R A r) = (x - algebraMap R A r) * x :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mul_sub_algebraMap_pow_commutes [Ring A] [Algebra R A] (x : A) (r : R) (n : ℕ) : x * (x - algebraMap R A r) ^ n = (x - algebraMap R A r) ^ n * x :=", "area": "Algebra"} {"task": "t8", "statement": "theorem End_algebraMap_isUnit_inv_apply_eq_iff {x : R} (h : IsUnit (algebraMap R (Module.End S M) x)) (m m' : M) : (↑(h.unit⁻¹) : Module.End S M) m = m' ↔ m = x • m' :=", "area": "Algebra"} {"task": "t8", "statement": "theorem End_algebraMap_isUnit_inv_apply_eq_iff' {x : R} (h : IsUnit (algebraMap R (Module.End S M) x)) (m m' : M) : m' = (↑h.unit⁻¹ : Module.End S M) m ↔ m = x • m' :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_algebraMap_mul (f : A →ₗ[R] B) (a : A) (r : R) : f (algebraMap R A r * a) = algebraMap R B r * f a :=", "area": "Algebra"} {"task": "t8", "statement": "theorem map_mul_algebraMap (f : A →ₗ[R] B) (a : A) (r : R) : f (a * algebraMap R A r) = f a * algebraMap R B r :=", "area": "Algebra"} {"task": "t8", "statement": "theorem algebraMap_injective [CommRing R] [Ring A] [Nontrivial A] [Algebra R A] [NoZeroSMulDivisors R A] : Function.Injective (algebraMap R A) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem algebra_compatible_smul (r : R) (m : M) : r • m = (algebraMap R A) r • m :=", "area": "Algebra"} {"task": "t8", "statement": "theorem NoZeroSMulDivisors.trans (R A M : Type*) [CommRing R] [Ring A] [IsDomain A] [Algebra R A] [AddCommGroup M] [Module R M] [Module A M] [IsScalarTower R A M] [NoZeroSMulDivisors R A] [NoZeroSMulDivisors A M] : NoZeroSMulDivisors R M :=", "area": "Algebra"} {"task": "t8", "statement": "theorem injective_algebraMap_of_linearMap (hb : Function.Injective b) : Function.Injective (algebraMap F E) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem surjective_algebraMap_of_linearMap (hb : Function.Surjective b) : Function.Surjective (algebraMap F E) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem algebra_ext {R : Type*} [CommSemiring R] {A : Type*} [Semiring A] (P Q : Algebra R A) (h : ∀ r : R, (haveI := P; algebraMap R A r) = haveI := Q; algebraMap R A r) : P = Q :=", "area": "Algebra"} {"task": "t8", "statement": "theorem left_comm (x : A) (r : R) (y : A) : x * (algebraMap R A r * y) = algebraMap R A r * (x * y) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem right_comm (x : A) (r : R) (y : A) : x * algebraMap R A r * y = x * y * algebraMap R A r :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mul_smul_comm (s : R) (x y : A) : x * s • y = s • (x * y) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem _root_.smul_algebraMap {α : Type*} [Monoid α] [MulDistribMulAction α A] [SMulCommClass α R A] (a : α) (r : R) : a • algebraMap R A r = algebraMap R A r :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toSubsemiring_injective : Function.Injective (toSubsemiring : Subalgebra R A → Subsemiring A) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toSubring_injective {R : Type u} {A : Type v} [CommRing R] [Ring A] [Algebra R A] : Function.Injective (toSubring : Subalgebra R A → Subring A) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem toSubalgebra_mk (s : Submodule R A) (h1 hmul) : s.toSubalgebra h1 hmul = Subalgebra.mk ⟨⟨⟨s, @hmul⟩, h1⟩, s.add_mem, s.zero_mem⟩ (by intro r; rw [Algebra.algebraMap_eq_smul_one]; apply s.smul_mem _ h1) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coe_range (φ : A →ₐ[R] B) : (φ.range : Set B) = Set.range φ :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mem_sInf {S : Set (Subalgebra R A)} {x : A} : x ∈ sInf S ↔ ∀ p ∈ S, x ∈ p :=", "area": "Algebra"} {"task": "t8", "statement": "theorem sInf_toSubmodule (S : Set (Subalgebra R A)) : Subalgebra.toSubmodule (sInf S) = sInf (Subalgebra.toSubmodule '' S) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem sInf_toSubsemiring (S : Set (Subalgebra R A)) : (sInf S).toSubsemiring = sInf (Subalgebra.toSubsemiring '' S) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem coe_iInf {ι : Sort*} {S : ι → Subalgebra R A} : (↑(⨅ i, S i) : Set A) = ⋂ i, S i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem mem_iInf {ι : Sort*} {S : ι → Subalgebra R A} {x : A} : (x ∈ ⨅ i, S i) ↔ ∀ i, x ∈ S i :=", "area": "Algebra"} {"task": "t8", "statement": "theorem iInf_toSubmodule {ι : Sort*} (S : ι → Subalgebra R A) : toSubmodule (⨅ i, S i) = ⨅ i, toSubmodule (S i) :=", "area": "Algebra"} {"task": "t8", "statement": "theorem eq_top_iff {S : Subalgebra R A} : S = ⊤ ↔ ∀ x : A, x ∈ S :=", "area": "Algebra"} {"task": "t8", "statement": "theorem equivOfEq_rfl (S : Subalgebra R A) : equivOfEq S S rfl = AlgEquiv.refl :=", "area": "Algebra"} {"task": "t8", "statement": "theorem range_comp_val : (f.comp S.val).range = S.map f :=", "area": "Algebra"} {"task": "t8", "statement": "theorem rangeS_algebraMap {R A : Type*} [CommSemiring R] [CommSemiring A] [Algebra R A] (S : Subalgebra R A) : (algebraMap S A).rangeS = S.toSubsemiring :=", "area": "Algebra"} {"task": "t8", "statement": "theorem range_algebraMap {R A : Type*} [CommRing R] [CommRing A] [Algebra R A] (S : Subalgebra R A) : (algebraMap S A).range = S.toSubring :=", "area": "Algebra"} {"task": "t8", "statement": "theorem _root_.Set.algebraMap_mem_center (r : R) : algebraMap R A r ∈ Set.center A :=", "area": "Algebra"} {"task": "t8", "statement": "@[simp] lemma centralizer_centralizer_centralizer {s : Set A} : centralizer R s.centralizer.centralizer = centralizer R s :=", "area": "Algebra"}