Loogle!
Result
Found 50 declarations mentioning BoxIntegral.Prepartition.boxes.
- BoxIntegral.Prepartition.boxes ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} (self : BoxIntegral.Prepartition I) : Finset (BoxIntegral.Box ฮน) - BoxIntegral.Prepartition.injective_boxes ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} : Function.Injective BoxIntegral.Prepartition.boxes - BoxIntegral.Prepartition.IsPartition.nonempty_boxes ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} {ฯ : BoxIntegral.Prepartition I} (h : ฯ.IsPartition) : ฯ.boxes.Nonempty - BoxIntegral.Prepartition.bot_boxes ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} : โฅ.boxes = โ - BoxIntegral.Prepartition.restrict_boxes_of_le ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I J : BoxIntegral.Box ฮน} (ฯ : BoxIntegral.Prepartition I) (h : I โค J) : (ฯ.restrict J).boxes = ฯ.boxes - BoxIntegral.Prepartition.single_boxes ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} (I J : BoxIntegral.Box ฮน) (h : J โค I) : (BoxIntegral.Prepartition.single I J h).boxes = {J} - BoxIntegral.Prepartition.top_boxes ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} : โค.boxes = {I} - BoxIntegral.Prepartition.le_of_mem' ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} (self : BoxIntegral.Prepartition I) (J : BoxIntegral.Box ฮน) : J โ self.boxes โ J โค I - BoxIntegral.Prepartition.filter_boxes ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} (ฯ : BoxIntegral.Prepartition I) (p : BoxIntegral.Box ฮน โ Prop) : (ฯ.filter p).boxes = {J โ ฯ.boxes | p J} - BoxIntegral.Prepartition.mem_boxes ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I J : BoxIntegral.Box ฮน} (ฯ : BoxIntegral.Prepartition I) : J โ ฯ.boxes โ J โ ฯ - BoxIntegral.Prepartition.distortion_biUnion ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} [Fintype ฮน] (ฯ : BoxIntegral.Prepartition I) (ฯi : (J : BoxIntegral.Box ฮน) โ BoxIntegral.Prepartition J) : (ฯ.biUnion ฯi).distortion = ฯ.boxes.sup fun J => (ฯi J).distortion - BoxIntegral.Prepartition.IsPartition.eq_of_boxes_subset ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} {ฯโ ฯโ : BoxIntegral.Prepartition I} (hโ : ฯโ.IsPartition) (hโ : ฯโ.boxes โ ฯโ.boxes) : ฯโ = ฯโ - BoxIntegral.Prepartition.distortion_of_const ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} (ฯ : BoxIntegral.Prepartition I) [Fintype ฮน] {c : NNReal} (hโ : ฯ.boxes.Nonempty) (hโ : โ J โ ฯ, J.distortion = c) : ฯ.distortion = c - BoxIntegral.Prepartition.biUnion_boxes ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} (ฯ : BoxIntegral.Prepartition I) (ฯi : (J : BoxIntegral.Box ฮน) โ BoxIntegral.Prepartition J) : (ฯ.biUnion ฯi).boxes = ฯ.boxes.biUnion fun J => (ฯi J).boxes - BoxIntegral.Prepartition.eq_of_boxes_subset_iUnion_superset ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} {ฯโ ฯโ : BoxIntegral.Prepartition I} (hโ : ฯโ.boxes โ ฯโ.boxes) (hโ : ฯโ.iUnion โ ฯโ.iUnion) : ฯโ = ฯโ - BoxIntegral.Prepartition.iUnion_def' ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} (ฯ : BoxIntegral.Prepartition I) : ฯ.iUnion = โ J โ ฯ.boxes, โJ - BoxIntegral.Prepartition.sum_fiberwise ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} {ฮฑ : Type u_2} {M : Type u_3} [AddCommMonoid M] (ฯ : BoxIntegral.Prepartition I) (f : BoxIntegral.Box ฮน โ ฮฑ) (g : BoxIntegral.Box ฮน โ M) : โ y โ Finset.image f ฯ.boxes, โ J โ (ฯ.filter fun J => f J = y).boxes, g J = โ J โ ฯ.boxes, g J - BoxIntegral.Prepartition.sum_biUnion_boxes ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} {M : Type u_2} [AddCommMonoid M] (ฯ : BoxIntegral.Prepartition I) (ฯi : (J : BoxIntegral.Box ฮน) โ BoxIntegral.Prepartition J) (f : BoxIntegral.Box ฮน โ M) : โ J โ ฯ.boxes.biUnion fun J => (ฯi J).boxes, f J = โ J โ ฯ.boxes, โ J' โ (ฯi J).boxes, f J' - BoxIntegral.Prepartition.pairwiseDisjoint ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} (self : BoxIntegral.Prepartition I) : (โself.boxes).Pairwise (Function.onFun Disjoint BoxIntegral.Box.toSet) - BoxIntegral.Prepartition.disjoint_boxes_of_disjoint_iUnion ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} {ฯโ ฯโ : BoxIntegral.Prepartition I} (h : Disjoint ฯโ.iUnion ฯโ.iUnion) : Disjoint ฯโ.boxes ฯโ.boxes - BoxIntegral.Prepartition.disjUnion_boxes ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} (ฯโ ฯโ : BoxIntegral.Prepartition I) (h : Disjoint ฯโ.iUnion ฯโ.iUnion) : (ฯโ.disjUnion ฯโ h).boxes = ฯโ.boxes โช ฯโ.boxes - BoxIntegral.Prepartition.card_filter_mem_Icc_le ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} (ฯ : BoxIntegral.Prepartition I) [Fintype ฮน] (x : ฮน โ โ) : {J โ ฯ.boxes | x โ BoxIntegral.Box.Icc J}.card โค 2 ^ Fintype.card ฮน - BoxIntegral.Prepartition.sum_ofWithBot ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} {M : Type u_2} [AddCommMonoid M] (boxes : Finset (WithBot (BoxIntegral.Box ฮน))) (le_of_mem : โ J โ boxes, J โค โI) (pairwise_disjoint : (โboxes).Pairwise Disjoint) (f : BoxIntegral.Box ฮน โ M) : โ J โ (BoxIntegral.Prepartition.ofWithBot boxes le_of_mem pairwise_disjoint).boxes, f J = โ J โ boxes, Option.elim' 0 f J - BoxIntegral.Prepartition.sum_disj_union_boxes ๐ Mathlib.Analysis.BoxIntegral.Partition.Basic
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} {ฯโ ฯโ : BoxIntegral.Prepartition I} {M : Type u_2} [AddCommMonoid M] (h : Disjoint ฯโ.iUnion ฯโ.iUnion) (f : BoxIntegral.Box ฮน โ M) : โ J โ ฯโ.boxes โช ฯโ.boxes, f J = โ J โ ฯโ.boxes, f J + โ J โ ฯโ.boxes, f J - BoxIntegral.Prepartition.distortion_biUnionTagged ๐ Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} [Fintype ฮน] (ฯ : BoxIntegral.Prepartition I) (ฯi : (J : BoxIntegral.Box ฮน) โ BoxIntegral.TaggedPrepartition J) : (ฯ.biUnionTagged ฯi).distortion = ฯ.boxes.sup fun J => (ฯi J).distortion - BoxIntegral.TaggedPrepartition.distortion_biUnionPrepartition ๐ Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} [Fintype ฮน] (ฯ : BoxIntegral.TaggedPrepartition I) (ฯi : (J : BoxIntegral.Box ฮน) โ BoxIntegral.Prepartition J) : (ฯ.biUnionPrepartition ฯi).distortion = ฯ.boxes.sup fun J => (ฯi J).distortion - BoxIntegral.TaggedPrepartition.distortion_of_const ๐ Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} (ฯ : BoxIntegral.TaggedPrepartition I) [Fintype ฮน] {c : NNReal} (hโ : ฯ.boxes.Nonempty) (hโ : โ J โ ฯ, J.distortion = c) : ฯ.distortion = c - BoxIntegral.TaggedPrepartition.filter_boxes_val ๐ Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} (ฯ : BoxIntegral.TaggedPrepartition I) (p : BoxIntegral.Box ฮน โ Prop) : (ฯ.filter p).boxes.val = Multiset.filter (fun J => p J) ฯ.boxes.val - BoxIntegral.TaggedPrepartition.IsHenstock.card_filter_tag_eq_le ๐ Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} {ฯ : BoxIntegral.TaggedPrepartition I} [Fintype ฮน] (h : ฯ.IsHenstock) (x : ฮน โ โ) : {J โ ฯ.boxes | ฯ.tag J = x}.card โค 2 ^ Fintype.card ฮน - BoxIntegral.TaggedPrepartition.single_boxes_val ๐ Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ฮน : Type u_1} (I J : BoxIntegral.Box ฮน) (hJ : J โค I) (x : ฮน โ โ) (h : x โ BoxIntegral.Box.Icc I) : (BoxIntegral.TaggedPrepartition.single I J hJ x h).boxes.val = {J} - BoxIntegral.TaggedPrepartition.disjUnion_boxes ๐ Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ฮน : Type u_1} {I : BoxIntegral.Box ฮน} {ฯโ ฯโ : BoxIntegral.TaggedPrepartition I} (h : Disjoint ฯโ.iUnion ฯโ.iUnion) : (ฯโ.disjUnion ฯโ h).boxes = ฯโ.boxes โช ฯโ.boxes - BoxIntegral.TaggedPrepartition.IsSubordinate.diam_le ๐ Mathlib.Analysis.BoxIntegral.Partition.Tagged
{ฮน : Type u_1} {I J : BoxIntegral.Box ฮน} {r : (ฮน โ โ) โ โ(Set.Ioi 0)} [Fintype ฮน] {ฯ : BoxIntegral.TaggedPrepartition I} (h : ฯ.IsSubordinate r) (hJ : J โ ฯ.boxes) : Metric.diam (BoxIntegral.Box.Icc J) โค 2 * โ(r (ฯ.tag J)) - BoxIntegral.TaggedPrepartition.unionComplToSubordinate_boxes ๐ Mathlib.Analysis.BoxIntegral.Partition.SubboxInduction
{ฮน : Type u_1} [Fintype ฮน] {I : BoxIntegral.Box ฮน} (ฯโ : BoxIntegral.TaggedPrepartition I) (ฯโ : BoxIntegral.Prepartition I) (hU : ฯโ.iUnion = โI \ ฯโ.iUnion) (r : (ฮน โ โ) โ โ(Set.Ioi 0)) : (ฯโ.unionComplToSubordinate ฯโ hU r).boxes = ฯโ.boxes โช (ฯโ.toSubordinate r).boxes - BoxIntegral.Prepartition.sum_split_boxes ๐ Mathlib.Analysis.BoxIntegral.Partition.Split
{ฮน : Type u_1} {M : Type u_3} [AddCommMonoid M] (I : BoxIntegral.Box ฮน) (i : ฮน) (x : โ) (f : BoxIntegral.Box ฮน โ M) : โ J โ (BoxIntegral.Prepartition.split I i x).boxes, f J = Option.elim' 0 f (I.splitLower i x) + Option.elim' 0 f (I.splitUpper i x) - BoxIntegral.BoxAdditiveMap.mk ๐ Mathlib.Analysis.BoxIntegral.Partition.Additive
{ฮน : Type u_3} {M : Type u_4} [AddCommMonoid M] {I : WithTop (BoxIntegral.Box ฮน)} (toFun : BoxIntegral.Box ฮน โ M) (sum_partition_boxes' : โ (J : BoxIntegral.Box ฮน), โJ โค I โ โ (ฯ : BoxIntegral.Prepartition J), ฯ.IsPartition โ โ Ji โ ฯ.boxes, toFun Ji = toFun J) : BoxIntegral.BoxAdditiveMap ฮน M I - BoxIntegral.BoxAdditiveMap.sum_partition_boxes' ๐ Mathlib.Analysis.BoxIntegral.Partition.Additive
{ฮน : Type u_3} {M : Type u_4} [AddCommMonoid M] {I : WithTop (BoxIntegral.Box ฮน)} (self : BoxIntegral.BoxAdditiveMap ฮน M I) (J : BoxIntegral.Box ฮน) : โJ โค I โ โ (ฯ : BoxIntegral.Prepartition J), ฯ.IsPartition โ โ Ji โ ฯ.boxes, self.toFun Ji = self.toFun J - BoxIntegral.BoxAdditiveMap.coe_mk ๐ Mathlib.Analysis.BoxIntegral.Partition.Additive
{ฮน : Type u_1} {M : Type u_2} [AddCommMonoid M] {Iโ : WithTop (BoxIntegral.Box ฮน)} (f : BoxIntegral.Box ฮน โ M) (h : โ (J : BoxIntegral.Box ฮน), โJ โค Iโ โ โ (ฯ : BoxIntegral.Prepartition J), ฯ.IsPartition โ โ Ji โ ฯ.boxes, f Ji = f J) : โ{ toFun := f, sum_partition_boxes' := h } = f - BoxIntegral.BoxAdditiveMap.sum_partition_boxes ๐ Mathlib.Analysis.BoxIntegral.Partition.Additive
{ฮน : Type u_1} {M : Type u_2} [AddCommMonoid M] {Iโ : WithTop (BoxIntegral.Box ฮน)} {I : BoxIntegral.Box ฮน} (f : BoxIntegral.BoxAdditiveMap ฮน M Iโ) (hI : โI โค Iโ) {ฯ : BoxIntegral.Prepartition I} (h : ฯ.IsPartition) : โ J โ ฯ.boxes, f J = f I - BoxIntegral.BoxAdditiveMap.sum_boxes_congr ๐ Mathlib.Analysis.BoxIntegral.Partition.Additive
{ฮน : Type u_1} {M : Type u_2} [AddCommMonoid M] {Iโ : WithTop (BoxIntegral.Box ฮน)} {I : BoxIntegral.Box ฮน} [Finite ฮน] (f : BoxIntegral.BoxAdditiveMap ฮน M Iโ) (hI : โI โค Iโ) {ฯโ ฯโ : BoxIntegral.Prepartition I} (h : ฯโ.iUnion = ฯโ.iUnion) : โ J โ ฯโ.boxes, f J = โ J โ ฯโ.boxes, f J - BoxIntegral.Prepartition.measure_iUnion_toReal ๐ Mathlib.Analysis.BoxIntegral.Partition.Measure
{ฮน : Type u_1} [Finite ฮน] {I : BoxIntegral.Box ฮน} (ฯ : BoxIntegral.Prepartition I) (ฮผ : MeasureTheory.Measure (ฮน โ โ)) [MeasureTheory.IsLocallyFiniteMeasure ฮผ] : ฮผ.real ฯ.iUnion = โ J โ ฯ.boxes, ฮผ.real โJ - BoxIntegral.integralSum_biUnionTagged ๐ Mathlib.Analysis.BoxIntegral.Basic
{ฮน : Type u} {E : Type v} {F : Type w} [NormedAddCommGroup E] [NormedSpace โ E] [NormedAddCommGroup F] [NormedSpace โ F] {I : BoxIntegral.Box ฮน} (f : (ฮน โ โ) โ E) (vol : BoxIntegral.BoxAdditiveMap ฮน (E โL[โ] F) โค) (ฯ : BoxIntegral.Prepartition I) (ฯi : (J : BoxIntegral.Box ฮน) โ BoxIntegral.TaggedPrepartition J) : BoxIntegral.integralSum f vol (ฯ.biUnionTagged ฯi) = โ J โ ฯ.boxes, BoxIntegral.integralSum f vol (ฯi J) - BoxIntegral.integralSum_fiberwise ๐ Mathlib.Analysis.BoxIntegral.Basic
{ฮน : Type u} {E : Type v} {F : Type w} [NormedAddCommGroup E] [NormedSpace โ E] [NormedAddCommGroup F] [NormedSpace โ F] {I : BoxIntegral.Box ฮน} {ฮฑ : Type u_1} (g : BoxIntegral.Box ฮน โ ฮฑ) (f : (ฮน โ โ) โ E) (vol : BoxIntegral.BoxAdditiveMap ฮน (E โL[โ] F) โค) (ฯ : BoxIntegral.TaggedPrepartition I) : โ y โ Finset.image g ฯ.boxes, BoxIntegral.integralSum f vol (ฯ.filter fun x => g x = y) = BoxIntegral.integralSum f vol ฯ - BoxIntegral.Integrable.tendsto_integralSum_sum_integral ๐ Mathlib.Analysis.BoxIntegral.Basic
{ฮน : Type u} {E : Type v} {F : Type w} [NormedAddCommGroup E] [NormedSpace โ E] [NormedAddCommGroup F] [NormedSpace โ F] {I : BoxIntegral.Box ฮน} [Fintype ฮน] {l : BoxIntegral.IntegrationParams} {f : (ฮน โ โ) โ E} {vol : BoxIntegral.BoxAdditiveMap ฮน (E โL[โ] F) โค} [CompleteSpace F] (h : BoxIntegral.Integrable I l f vol) (ฯโ : BoxIntegral.Prepartition I) : Filter.Tendsto (BoxIntegral.integralSum f vol) (BoxIntegral.IntegrationParams.toFilteriUnion I ฯโ) (nhds (โ J โ ฯโ.boxes, BoxIntegral.integral J l f vol)) - BoxIntegral.Integrable.sum_integral_congr ๐ Mathlib.Analysis.BoxIntegral.Basic
{ฮน : Type u} {E : Type v} {F : Type w} [NormedAddCommGroup E] [NormedSpace โ E] [NormedAddCommGroup F] [NormedSpace โ F] {I : BoxIntegral.Box ฮน} [Fintype ฮน] {l : BoxIntegral.IntegrationParams} {f : (ฮน โ โ) โ E} {vol : BoxIntegral.BoxAdditiveMap ฮน (E โL[โ] F) โค} [CompleteSpace F] (h : BoxIntegral.Integrable I l f vol) {ฯโ ฯโ : BoxIntegral.Prepartition I} (hU : ฯโ.iUnion = ฯโ.iUnion) : โ J โ ฯโ.boxes, BoxIntegral.integral J l f vol = โ J โ ฯโ.boxes, BoxIntegral.integral J l f vol - BoxIntegral.Integrable.dist_integralSum_sum_integral_le_of_memBaseSet ๐ Mathlib.Analysis.BoxIntegral.Basic
{ฮน : Type u} {E : Type v} {F : Type w} [NormedAddCommGroup E] [NormedSpace โ E] [NormedAddCommGroup F] [NormedSpace โ F] {I : BoxIntegral.Box ฮน} {ฯ : BoxIntegral.TaggedPrepartition I} [Fintype ฮน] {l : BoxIntegral.IntegrationParams} {f : (ฮน โ โ) โ E} {vol : BoxIntegral.BoxAdditiveMap ฮน (E โL[โ] F) โค} {c : NNReal} {ฮต : โ} [CompleteSpace F] (h : BoxIntegral.Integrable I l f vol) (h0 : 0 < ฮต) (hฯ : l.MemBaseSet I c (h.convergenceR ฮต c) ฯ) : dist (BoxIntegral.integralSum f vol ฯ) (โ J โ ฯ.boxes, BoxIntegral.integral J l f vol) โค ฮต - BoxIntegral.Integrable.dist_integralSum_sum_integral_le_of_memBaseSet_of_iUnion_eq ๐ Mathlib.Analysis.BoxIntegral.Basic
{ฮน : Type u} {E : Type v} {F : Type w} [NormedAddCommGroup E] [NormedSpace โ E] [NormedAddCommGroup F] [NormedSpace โ F] {I : BoxIntegral.Box ฮน} {ฯ : BoxIntegral.TaggedPrepartition I} [Fintype ฮน] {l : BoxIntegral.IntegrationParams} {f : (ฮน โ โ) โ E} {vol : BoxIntegral.BoxAdditiveMap ฮน (E โL[โ] F) โค} {c : NNReal} {ฮต : โ} [CompleteSpace F] (h : BoxIntegral.Integrable I l f vol) (h0 : 0 < ฮต) (hฯ : l.MemBaseSet I c (h.convergenceR ฮต c) ฯ) {ฯโ : BoxIntegral.Prepartition I} (hU : ฯ.iUnion = ฯโ.iUnion) : dist (BoxIntegral.integralSum f vol ฯ) (โ J โ ฯโ.boxes, BoxIntegral.integral J l f vol) โค ฮต - BoxIntegral.integralSum_congr ๐ Mathlib.Analysis.BoxIntegral.Basic
{ฮน : Type u} {E : Type v} {F : Type w} [NormedAddCommGroup E] [NormedSpace โ E] [NormedAddCommGroup F] [NormedSpace โ F] {I : BoxIntegral.Box ฮน} {ฯ : BoxIntegral.TaggedPrepartition I} {fโ fโ : (ฮน โ โ) โ E} {volโ volโ : BoxIntegral.BoxAdditiveMap ฮน (E โL[โ] F) โค} (hf : Set.EqOn fโ fโ (BoxIntegral.Box.Icc I)) (hvol : Set.EqOn โvolโ โvolโ โฯ.boxes) : BoxIntegral.integralSum fโ volโ ฯ = BoxIntegral.integralSum fโ volโ ฯ - BoxIntegral.integralSum_sub_partitions ๐ Mathlib.Analysis.BoxIntegral.Basic
{ฮน : Type u} {E : Type v} {F : Type w} [NormedAddCommGroup E] [NormedSpace โ E] [NormedAddCommGroup F] [NormedSpace โ F] {I : BoxIntegral.Box ฮน} (f : (ฮน โ โ) โ E) (vol : BoxIntegral.BoxAdditiveMap ฮน (E โL[โ] F) โค) {ฯโ ฯโ : BoxIntegral.TaggedPrepartition I} (hโ : ฯโ.IsPartition) (hโ : ฯโ.IsPartition) : BoxIntegral.integralSum f vol ฯโ - BoxIntegral.integralSum f vol ฯโ = โ J โ (ฯโ.toPrepartition โ ฯโ.toPrepartition).boxes, ((vol J) (f ((ฯโ.infPrepartition ฯโ.toPrepartition).tag J)) - (vol J) (f ((ฯโ.infPrepartition ฯโ.toPrepartition).tag J))) - BoxIntegral.unitPartition.box_index_tag_eq_self ๐ Mathlib.Analysis.BoxIntegral.UnitPartition
{ฮน : Type u_1} (n : โ) [NeZero n] [Fintype ฮน] {B I : BoxIntegral.Box ฮน} (hI : I โ (BoxIntegral.unitPartition.prepartition n B).boxes) : BoxIntegral.unitPartition.box n (BoxIntegral.unitPartition.index n ((BoxIntegral.unitPartition.prepartition n B).tag I)) = I - BoxIntegral.unitPartition.mem_prepartition_boxes_iff ๐ Mathlib.Analysis.BoxIntegral.UnitPartition
{ฮน : Type u_1} {n : โ} [NeZero n] [Fintype ฮน] {B I : BoxIntegral.Box ฮน} : I โ (BoxIntegral.unitPartition.prepartition n B).boxes โ โ ฮฝ โ BoxIntegral.unitPartition.admissibleIndex n B, BoxIntegral.unitPartition.box n ฮฝ = I
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
๐Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
๐"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
๐_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
๐Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
๐(?a -> ?b) -> List ?a -> List ?b
๐List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
๐|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of allโandโ) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
๐|- _ < _ โ tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
โข (_ : Type _)finds all definitions which provide data whileโข (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
๐ Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ โ _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c