pub struct ProductMeasure {
pub domain1: MeasurableSet,
pub domain2: MeasurableSet,
}Expand description
Product measure μ₁ ⊗ μ₂ on a product space X₁ × X₂.
By Fubini’s theorem, for non-negative measurable f:
∫_{X₁×X₂} f d(μ₁⊗μ₂) = ∫_{X₁} (∫_{X₂} f(x,y) dμ₂(y)) dμ₁(x)
For Lebesgue measures this reduces to iterated integration.
Fields§
§domain1: MeasurableSetFirst factor domain.
domain2: MeasurableSetSecond factor domain.
Implementations§
Source§impl ProductMeasure
impl ProductMeasure
Sourcepub fn new(domain1: MeasurableSet, domain2: MeasurableSet) -> Self
pub fn new(domain1: MeasurableSet, domain2: MeasurableSet) -> Self
Create a product measure from two domains.
Sourcepub fn measure_product_box(&self, a: &MeasurableSet, b: &MeasurableSet) -> f64
pub fn measure_product_box(&self, a: &MeasurableSet, b: &MeasurableSet) -> f64
Measure a product box A × B under the product Lebesgue measure.
(λ₁ ⊗ λ₂)(A × B) = λ₁(A) · λ₂(B)
Sourcepub fn product_domain(&self) -> MeasurableSet
pub fn product_domain(&self) -> MeasurableSet
Compute the product domain as a single concatenated box.
Trait Implementations§
Source§impl Clone for ProductMeasure
impl Clone for ProductMeasure
Source§fn clone(&self) -> ProductMeasure
fn clone(&self) -> ProductMeasure
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for ProductMeasure
impl RefUnwindSafe for ProductMeasure
impl Send for ProductMeasure
impl Sync for ProductMeasure
impl Unpin for ProductMeasure
impl UnsafeUnpin for ProductMeasure
impl UnwindSafe for ProductMeasure
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.