- Order:
- Duration: 12:45
- Published: 31 Oct 2010
- Uploaded: 27 May 2011
- Author: TonEEsNightmare
In mathematics, given a subset S of a partially ordered set T, the supremum (sup) of S, if it exists, is the least element of T that is greater than or equal to each element of S. Consequently, the supremum is also referred to as the least upper bound (lub or LUB). If the supremum exists, it may or may not belong to S. If the supremum exists, it is unique.
Suprema are often considered for subsets of real numbers, rational numbers, or any other well-known mathematical structure for which it is immediately clear what it means for an element to be "greater-than-or-equal-to" another element. The definition generalizes easily to the more abstract setting of order theory, where one considers arbitrary partially ordered sets.The concept of supremum is not the same as the concepts of minimal upper bound, maximal element, or greatest element.
:
:
:
:
In the last example, the supremum of a set of rationals is irrational, which means that the rationals are incomplete.
One basic property of the supremum is
:
for any functionals f and g.
If, in addition, we define sup(S) = −∞ when S is empty and sup(S) = +∞ when S is not bounded above, then every set of real numbers has a supremum under the affinely extended real number system.
:
:
If the supremum belongs to the set, then it is the greatest element in the set. The term maximal element is synonymous as long as one deals with real numbers or any other totally ordered set.
To show that a = sup(S), one has to show that a is an upper bound for S and that any other upper bound for S is greater than a. Equivalently, one could alternatively show that a is an upper bound for S and that any number less than a is not an upper bound for S.
Formally, we have: For subsets S of arbitrary partially ordered sets (P, ≤), a supremum or least upper bound of S is an element u in P such that # x ≤ u for all x in S, and # for any v in P such that x ≤ v for all x in S it holds that u ≤ v.
Thus the supremum does not exist if there is no upper bound, or if the set of upper bounds has two or more elements of which none is a least element of that set. It can easily be shown that, if S has a supremum, then the supremum is unique (as the least element of any partially ordered set, if it exists, is unique): if u1 and u2 are both suprema of S then it follows that u1 ≤ u2 and u2 ≤ u1, and since ≤ is antisymmetric, one finds that u1 = u2.
If the supremum exists it may or may not belong to S. If S contains a greatest element, then that element is the supremum; and if not, then the supremum does not belong to S.
The dual concept of supremum, the greatest lower bound, is called infimum and is also known as meet.
If the supremum of a set S exists, it can be denoted as sup(S) or, which is more common in order theory, by S. Likewise, infima are denoted by inf(S) or S. In lattice theory it is common to use the infimum/meet and supremum/join as binary operators; in this case (and similarly for infima).
A complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet).
In the sections below the difference between suprema, maximal elements, and minimal upper bounds is stressed. As a consequence of the possible absence of suprema, classes of partially ordered sets for which certain types of subsets are guaranteed to have least upper bound become especially interesting. This leads to the consideration of so-called completeness properties and to numerous definitions of special partially ordered sets.
In general, this situation occurs for all subsets that do not contain a greatest element. In contrast, if a set does contain a greatest element, then it also has a supremum given by the greatest element.
As an example, let S be the set of all finite subsets of natural numbers and consider the partially ordered set obtained by taking all sets from S together with the set of integers Z and the set of positive real numbers R+, ordered by subset inclusion as above. Then clearly both Z and R+ are greater than all finite sets of natural numbers. Yet, neither is R+ smaller than Z nor is the converse true: both sets are minimal upper bounds but none is a supremum.
The least-upper-bound property is an example of the aforementioned completeness properties which is typical for the set of real numbers. This property is sometimes called Dedekind completeness.
If an ordered set S has the property that every nonempty subset of S having an upper bound also has a least upper bound, then S is said to have the least-upper-bound property. As noted above, the set R of all real numbers has the least-upper-bound property. Similarly, the set Z of integers has the least-upper-bound property; if S is a nonempty subset of Z and there is some number n such that every element s of S is less than or equal to n, then there is a least upper bound u for S, an integer that is an upper bound for S and is less than or equal to every other upper bound for S. A well-ordered set also has the least-upper-bound property, and the empty subset has also a least upper bound: the minimum of the whole set.
An example of a set that lacks the least-upper-bound property is Q, the set of rational numbers. Let S be the set of all rational numbers q such that q2 < 2. Then S has an upper bound (1000, for example, or 6) but no least upper bound in Q. For suppose p ∈ Q is an upper bound for S, so p2 > 2. Then q = (2p+2)/(p + 2) is also an upper bound for S, and q < p. (To see this, note that q = p − (p2 − 2)/(p + 2), and that p2 − 2 is positive.) Another example is the Hyperreals; there is no least upper bound of the set of positive infinitesimals.
There is a corresponding 'greatest-lower-bound property'; an ordered set possesses the greatest-lower-bound property if and only if it also possesses the least-upper-bound property; the least-upper-bound of the set of lower bounds of a set is the greatest-lower-bound, and the greatest-lower-bound of the set of upper bounds of a set is the least-upper-bound of the set.
If in a partially ordered set P every bounded subset has a supremum, this applies also, for any set X, in the function space containing all functions from X to P, where f ≤ g if and only if f(x) ≤ g(x) for all x in X. For example, it applies for real functions, and, since these can be considered special cases of functions, for real n-tuples and sequences of real numbers.
This text is licensed under the Creative Commons CC-BY-SA License. This text was originally published on Wikipedia and was developed by the Wikipedia community.
Guillaume Dufay (Du Fay, Du Fayt) (August 5, 1397? – November 27, 1474) was a Franco-Flemish composer of the early Renaissance. As the central figure in the Burgundian School, he was the most famous and influential composer in Europe in the mid-15th century.
During this period Dufay also began his long association with the Este family in Ferrara, some of the most important musical patrons of the Renaissance, and with which he probably had become acquainted during the days of his association with the Malatesta family; Rimini and Ferrara are not only geographically close, but the two families were related by marriage, and Dufay composed at least one ballade for Niccolò III, Marquis of Ferrara. In 1437 Dufay visited the town. When Niccolò died in 1441, the next Marquis maintained the contact with Dufay, and not only continued financial support for the composer but copied and distributed some of his music.
Dufay was to remain in Cambrai through the 1440s, and during this time he was also in the service of the Duke of Burgundy. While in Cambrai he collaborated with Nicolas Grenon on a complete revision of the liturgical musical collection of the cathedral, which included writing an extensive collection of polyphonic music for services. In addition to his musical work, he was active in the general administration of the cathedral. In 1444 his mother Marie died, and was buried in the cathedral; and in 1445 Dufay moved into the house of the previous canon, which was to remain his primary residence for the rest of his life.
After an illness of several weeks, Dufay died on November 27, 1474. He had requested that his motet Ave regina celorum be sung for him as he died, with pleas for mercy interpolated between verses of the antiphon, but time was insufficient for this to be arranged. Dufay was buried in the chapel of St. Etienne in the cathedral of Cambrai; his portrait was carved onto his tombstone. After the destruction of the cathedral the tombstone was lost, but it was found in 1859 (it was being used to cover a well), and is now in the Palais des Beaux Arts museum in Lille.
Dufay wrote in most of the common forms of the day, including masses, motets, Magnificats, hymns, simple chant settings in fauxbourdon, and antiphons within the area of sacred music, and rondeaux, ballades, virelais and a few other chanson types within the realm of secular music. None of his surviving music is specifically instrumental, although instruments were certainly used for some of his secular music, especially for the lower parts; all of his sacred music is vocal. Instruments may have been used to reinforce the voices in actual performance for almost any portion of his output. In his lifetime, Dufay wrote seven complete masses, 28 individual Mass movements, 15 settings of chant used in Mass Propers, three Magnificats, two Benedicamus Domino settings, 15 antiphon settings (6 are Marian antiphons), 27 hymns, 22 motets (13 are isorhythmic) and 87 chansons. Assigning works to Dufay based on alleged stylistic similarities has been a favorite pastime of musicologists for at least a hundred years, judging from the copious literature on the subject.
Dufay may have been the first composer to use the term fauxbourdon to describe this style, which was prominent in 15th century liturgical music, especially that of the Burgundian school.
Most of his songs are for three voices, using a texture dominated by the highest voice; the other two voices, unsupplied with text, were likely played by instruments. Occasionally Dufay used four voices, but in a number of these songs the fourth voice was supplied by a later, usually anonymous, composer. Typically he used the rondeau form when writing love songs. His latest secular songs show influence from Busnois and Ockeghem, and the rhythmic and melodic differentiation between the voices is less; as in the work of other composers of the mid-15th century, he was beginning to tend towards the smooth polyphony which was to become the predominant style fifty years later.
A typical ballade is Resvellies vous et faites chiere lye, which was written in 1423 for the marriage of Carlo Malatesta and Vittoria di Lorenzo Colonna (Carlo was a son of Malatesta dei Sonetti, Lord of Pesaro. Vittoria was the niece of Pope Martin V). The musical form is aabC for each stanza, with C being the refrain. The musical setting emphasizes passages in the text which specifically refer to the couple being married.
The early music ensemble Dufay Collective is named for the composer.
Category:1397 births Category:1474 deaths Category:Renaissance composers Category:Burgundian school composers
This text is licensed under the Creative Commons CC-BY-SA License. This text was originally published on Wikipedia and was developed by the Wikipedia community.