About Quotient Orders and Ordering Sequences
In preparation for the formalization in Mizar [4] of lotteries as given in [14], this article closes some gaps in the Mizar Mathematical Library (MML) regarding relational structures. The quotient order is introduced by the equivalence relation identifying two elements x, y of a preorder as equivale...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2017-07-01
|
Series: | Formalized Mathematics |
Subjects: | |
Online Access: | https://doi.org/10.1515/forma-2017-0012 |
id |
doaj-e1b97b3dae4046f08d174b974a842d7a |
---|---|
record_format |
Article |
spelling |
doaj-e1b97b3dae4046f08d174b974a842d7a2021-09-05T20:45:04ZengSciendoFormalized Mathematics1426-26301898-99342017-07-0125212113910.1515/forma-2017-0012forma-2017-0012About Quotient Orders and Ordering SequencesKoch Sebastian0Johannes Gutenberg University, Mainz, GermanyIn preparation for the formalization in Mizar [4] of lotteries as given in [14], this article closes some gaps in the Mizar Mathematical Library (MML) regarding relational structures. The quotient order is introduced by the equivalence relation identifying two elements x, y of a preorder as equivalent if x ⩽ y and y ⩽ x. This concept is known (see e.g. chapter 5 of [19]) and was first introduced into the MML in [13] and that work is incorporated here. Furthermore given a set A, partition D of A and a finite-support function f : A → ℝ, a function Σf : D → ℝ, Σf (X)= ∑x∈Xf(x) can be defined as some kind of natural “restriction” from f to D. The first main result of this article can then be formulated as: ∑x∈Af(x)=∑X∈DΣf(X)(=∑X∈D∑x∈Xf(x))$$\sum\limits_{x \in A} {f(x)} = \sum\limits_{X \in D} {\Sigma _f (X)\left( { = \sum\limits_{X \in D} {\sum\limits_{x \in X} {f(x)} } } \right)} $$https://doi.org/10.1515/forma-2017-0012quotient orderordered finite sequences06a0503b35 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Koch Sebastian |
spellingShingle |
Koch Sebastian About Quotient Orders and Ordering Sequences Formalized Mathematics quotient order ordered finite sequences 06a05 03b35 |
author_facet |
Koch Sebastian |
author_sort |
Koch Sebastian |
title |
About Quotient Orders and Ordering Sequences |
title_short |
About Quotient Orders and Ordering Sequences |
title_full |
About Quotient Orders and Ordering Sequences |
title_fullStr |
About Quotient Orders and Ordering Sequences |
title_full_unstemmed |
About Quotient Orders and Ordering Sequences |
title_sort |
about quotient orders and ordering sequences |
publisher |
Sciendo |
series |
Formalized Mathematics |
issn |
1426-2630 1898-9934 |
publishDate |
2017-07-01 |
description |
In preparation for the formalization in Mizar [4] of lotteries as given in [14], this article closes some gaps in the Mizar Mathematical Library (MML) regarding relational structures. The quotient order is introduced by the equivalence relation identifying two elements x, y of a preorder as equivalent if x ⩽ y and y ⩽ x. This concept is known (see e.g. chapter 5 of [19]) and was first introduced into the MML in [13] and that work is incorporated here. Furthermore given a set A, partition D of A and a finite-support function f : A → ℝ, a function Σf : D → ℝ, Σf (X)= ∑x∈Xf(x) can be defined as some kind of natural “restriction” from f to D. The first main result of this article can then be formulated as:
∑x∈Af(x)=∑X∈DΣf(X)(=∑X∈D∑x∈Xf(x))$$\sum\limits_{x \in A} {f(x)} = \sum\limits_{X \in D} {\Sigma _f (X)\left( { = \sum\limits_{X \in D} {\sum\limits_{x \in X} {f(x)} } } \right)} $$ |
topic |
quotient order ordered finite sequences 06a05 03b35 |
url |
https://doi.org/10.1515/forma-2017-0012 |
work_keys_str_mv |
AT kochsebastian aboutquotientordersandorderingsequences |
_version_ |
1717784584279556096 |