On functions of one real variable whose definition set is the union of two subsets of opposite monotonicity

Abstract

Authors

Keywords

?

Paper coordinates

T. Popoviciu, Asupra funcţiilor de o variabilă reală a căror mulţime de definiţie este reunirea a două submulţimi de monotonie opusă, Analele Acad. R.P.R., t. III (1950) Mem. 1, pp. 1-16 (in Romanian).

PDF

About this paper

Journal
Publisher Name
DOI
Print ISSN
Online ISSN

[MR0043871]

google scholar link

??

Paper (preprint) in HTML form

Original text
Rate this translation
Your feedback will be used to help improve Google Translate

On functions of one real variable whose definition set is the union of two subsets of opposite monotonicity.

Prof. TIBERIU POPOVICIU
CORRESPONDING MEMBER OF THE RPR ACADEMY
  1. 1.

    We will consider functionsf(x)f(x), real, finite, uniform and defined on an arbitrary linear setIt isIt isWe will denote byM(f;It is)M(f;E)the upper edge and withm(f;It is)m(f;E)the lower bound of this function. Finally we will use the notation

[x1,x2;f]=f(x2)f(x1)x2x1.\left[x_{1},x_{2};f\right]=-\frac{f\left(x_{2}\right)-f\left(x_{1}\right)}{x_{2}-x_{1}}.

The necessary and sufficient condition thatf(x)f(x)to be monotonous onIt isIt isis to have[x1,x2;f][x2,x3;f]0\left[x_{1},x_{2};f\right]\left[x_{2},x_{3};f\right]\geq 0, for any group of 3 pointsx1,x2,x3x_{1},x_{2},x_{3}his/hersIt isIt isIt follows that if the function is not monotone, the points can be foundx1<x2<x3x_{1}<x_{2}<x_{3}, hisIt isIt is, so that we have[x1,x2;f][x2,x3;f]<01\left[x_{1},x_{2};f\right]\left[x_{2},x_{3};f\right]<01).

Let a be a real number and let us put 2 ).

It isA=It is(,A),It isA=It is(A,+).E_{a}=E\frown(-\infty,a),E_{a}^{\prime}=E\frown(a,+\infty).

Let's note withIt isA,It isAE_{a}^{*},E_{a}^{*}crowdsIt isA,It isAE_{a},E_{a}^{\prime}adding, ifAIt isa\in E, the point a in any one of these sets. We will then have

It isA=It isA,It isA=It isA if it doesn't belong to him It is,E_{a}^{*}=E_{a},E_{a}^{*}=E_{a}^{\prime}\text{ if a does not belong to }E,

It isA=It isA{A},It isA=It isAE_{a}^{*}=E_{a}\cup\{a\},E_{a}^{*}=E_{a}^{\prime}orIt isA=It isA,It isA=It isA{A}E_{a}^{*}=E_{a},E_{a}^{*}=E_{a}^{\prime}\cup\{a\}ifAIt isa\in E.

We always haveIt is=It isAIt isA,It isAIt isA=0E=E_{a}^{*}\cup E_{a}^{\prime*},E_{a}^{*}\cap E_{a}^{\prime*}=0and we say thatIt isIt isis decomposed into the union of two consecutive subsets. The point a is the separation point of this decomposition. There is only one separation point decompositionAA, if this point does not belong toIt isIt isand two such decompositions ifAIt isa\in E.

We will say thatf(x)f(x)is a function (mm) (onIt isIt is) if there is a decompositionIt is=It isAIt isAE=E_{a}^{*}\smile E_{a}^{*}his/herIt isIt isin two consecutive subsets such that the function is monotone on each of the setsIt isA,It isAE_{a}^{*},E_{a}^{\prime*}, the monotonicity being of opposite sense on these two subsets ofIt isIt isMore precisely we will say thatf(x)f(x)is then a function (m+m^{+}) respectively a function (mm^{-}) as it is non-increasing and non-decreasing respectively onIt isAE_{a}^{*}(so non-decreasing respectively non-increasing onIt isAE_{a}^{\prime*}).

It is clear that any monotone function is at the same time a function(m+)\left(m^{+}\right)and a function (mm^{-}). Conversely, any function that is at the same time a function (m+m^{+}) and a function (mm^{-}) is a monotone function. Iff(x)f(x)is a function (m+m^{+}) respectively a function (mm^{-}), the function -f(x)f(x)is a function (mm^{-}) respectively a function (m+m^{+}). Finally, any function (m+m^{+}) onIt isIt isis a function (m+m^{+}) on any subset ofIt isIt is.
2. To simplify the exposition we will make some conventions. Linearity and increase (decrease) are particular cases of non-decrease (non-increase). We also agree that any function defined on at most one point is considered monotonic, that is, regardless of whether it is increasing or decreasing.

With these conventions one of the decomposition subsetsIt isA,It isAE_{a}^{*},E_{a}^{\prime*}, corresponding to a function (mm), can be reduced to the empty set. This happens if and only if the function is monotone. The separation point a can be one of the improper points -\inftyor++\infty, which again occurs if and only if the function is monotonic.

Any function defined on at most 2 points is monotone and any function defined on at most 3 points is a function (mm).

Calculations with proper and improper numbers are done according to the usual rules.
3. Becausef(x)f(x)to be a function (m+m^{+}) on the pointsx1<x2<x3x_{1}<x_{2}<x_{3}it is necessary and sufficient for us to have

f(x2)MAX(f(x1),f(x9))f\left(x_{2}\right)\leqq\max\left(f\left(x_{1}\right),f\left(x_{9}\right)\right) (1)

In the case of a crowdIt isIt ishaving at least 3 points, we have:
Theorem 1. Becausef(x)\mathrm{f}(\mathrm{x})to be a function (m+\mathrm{m}^{+}) on E is necessary and sufficient for it to be a function (m+\mathrm{m}^{+}) on each of the three-point groups of E.

This property can also be stated in the following form:
Theorem 1'. Becausef(x)\mathrm{f}(\mathrm{x})to be a function (m+\mathrm{m}^{+}) on E it is necessary and sufficient that inequality (1) is verified for any group of 3 pointsx1<x2<x3\mathrm{x}_{1}<\mathrm{x}_{2}<\mathrm{x}_{3}of E.

In the case of functions (mm^{-}) we have analogous properties, inequality (1) being replaced by

f(x2)min(f(x1),f(x3)),x1<x2<x3f\left(x_{2}\right)\geqq\min\left(f\left(x_{1}\right),f\left(x_{3}\right)\right),x_{1}<x_{2}<x_{3}

It follows that if a functionf(x)f(x)is not a function (m) we can find the pointsx1<x2<x3,x1<x2<x3x_{1}<x_{2}<x_{3},x_{1}^{\prime}<x_{2}^{\prime}<x_{3}^{\prime}his/hersIt isIt isso that

f(x2)>MAX(f(x1),f(x3)),f(x2)<min(f(x1),f(x3)).f\left(x_{2}\right)>\max\left(f\left(x_{1}\right),f\left(x_{3}\right)\right),f\left(x_{2}^{\prime}\right)<\min\left(f\left(x_{1}^{\prime}\right),f\left(x_{3}^{\prime}\right)\right).

A simple reasoning shows us that we can then find 4 pointsx1<x2<x3<x4x_{1}<x_{2}<x_{3}<x_{4}his/hersIt isIt isso that the string

[x1,x2;f],[x2,x3;f],[x3,x4;f]\left[x_{1},x_{2};f\right],\left[x_{2},x_{3};f\right],\left[x_{3},x_{4};f\right] (2)

to have 2 sign variations 1 ).
But on the pointsx1<x2<x3<x4x_{1}<x_{2}<x_{3}<x_{4}the property of beingaafunction (mm) is expressed precisely by the fact that the string (2) has at most 1 sign variation. For functions defined on at least 4 points we therefore deduce:

Theorem 2. Becausef(x)\mathrm{f}(\mathrm{x})to be a function (m) on E is necessary and sufficient for it to be a function (m) on any group of 4 points of E.

This property can also be stated in the form:
Theorem 2'. For f (x) to be a function (m) on E, it is necessary and sufficient that the sequence (2) has at least 1 sign variation, whatever the points.x1<x2<x3<x4\mathrm{x}_{1}<\mathrm{x}_{2}<\mathrm{x}_{3}<\mathrm{x}_{4}of E.
4. The proof of theorem 1 has been given elsewhere 2 ). The inequalities (1) are obviously necessary. We will give a new proof

0 0 footnotetext: 1 ) The terms of the string are therefore all0\neq 0and alternatively positive and negative.
2 ) Tiberiu Popoviciu, Deux remarques sur les fonctions convexes. Bull. Sc. Acad. Roumaine, 20, 45-49, 1938.

of the sufficiency of these inequalities and then we will specify a little the structure of the functions (mm).

We have first:
Lemma 1. If inequality (1) is verified for any group of 3 pointsx1<x2<x3\mathrm{x}_{1}<\mathrm{x}_{2}<\mathrm{x}_{3}of E and if a is any number, the functionf(x)\mathrm{f}(\mathrm{x})It is monotonous on one of the smallest of the crowds.It isA,It isA\mathrm{E}_{a},\mathrm{E}_{a}^{\prime}.

For the sake of demonstration, let's assume the opposite. We can then find the points

x1,x2,x3It isA;x4,x5,x6It isA;x1<x2<x3<x4<x5<x6x_{1},x_{2},x_{3}\in E_{a};x_{4},x_{5},x_{6}\in E_{a}^{\prime};x_{1}<x_{2}<x_{3}<x_{4}<x_{5}<x_{6}

so that we have

[x1,x2;f][x2,x3;f]<0,[x4,x5;f][x5,x6;f]<0\left[x_{1},x_{2};f\right]\left[x_{2},x_{3};f\right]<0,\left[x_{4},x_{5};f\right]\left[x_{5},x_{6};f\right]<0

and it is easy to verify that on at least one of the groups of 3, pointsx1,x2,x3;x4,x5,x6;x2,x3,x4;x2,x4,x5x_{1},x_{2},x_{3};x_{4},x_{5},x_{6};x_{2},x_{3},x_{4};x_{2},x_{4},x_{5}inequality (1) is not verified.

One can still specify Lemma 1, but the above statement is sufficient for what follows. For example, it is easy to see that in the statement one can replaceIt isA,It isAE_{a},E_{a}^{\prime}byIt isA,It isAE_{a}^{*},E_{a}^{\prime*}respectively.

We deduce from here:
Lemma 2. If inequality (1) is true for any group of 3 pointsx1<x2<x3\mathrm{x}_{1}<\mathrm{x}_{2}<\mathrm{x}_{3}of E , one can find a point c such that the functionf(x)\mathrm{f}(\mathrm{x})to be unsightly onIt isc\mathrm{E}_{c}, and non-decreasing onIt isc\mathrm{E}_{c}^{\prime}.

It is enough to prove the property in the case whenf(x)f(x)it is not monotonous onIt is1E^{1}).

There are pointsAaso thatf(x)f(x)to be monotonous on𝑬A\boldsymbol{E}_{a}Indeed, if for the pointsx1<x2<x3x_{1}<x_{2}<x_{3}his/hersIt isEHAVE[x1,x2;f][x2,x3;f]<0\left[x_{1},x_{2};f\right]\left[x_{2},x_{3};f\right]<0then, by virtue of the lemma𝟏\mathbf{1}, anythingA<x1a<x_{1}check the property. If thenA1<Aa_{1}<aandf(x)f(x)it is monotonous onIt isAE_{a}, it is also monotonic onIt isA1E_{a_{1}}. Eitherbbthe upper edge of the pointsAaThe pointbbis the only point that enjoys the property thatf(x)f(x)it is monotonous onIt isAE_{a}for anythingAba\leqq band it is not monotonous onIt isAE_{a}ifA>ba>bWe haveb>b>-\inftyand alsob<+b<+\inftybecause it is obvious thatbx3b\leqq x_{3}. It is also seen that there is a unique and proper pointbb^{\prime}who enjoys their own

0 0 footnotetext: 1. See below the case when f(x)f(x)it is monotonous.

father thatf(x)f(x)it is monotonous onIt isAE_{a}^{\prime}for anythingAba\geq b^{\prime}and it is not monotonous onIt isAE_{a}^{\prime}ifA<ba<b^{\prime}We have the inequalitybbb^{\prime}\leqq bbecause, otherwise, the function would not be monotone on any of the setsIt isb+b2,It isb+b2E_{\frac{b+b^{\prime}}{2}},E_{\frac{b+b^{\prime}}{2}}^{\prime}, which contradicts Lemma 1.

Lemma 2 will be satisfied if we takec[b,b]c\in\left[b^{\prime},b\right]The function is monotone on each of the setsIt isc,It iscE_{c},E_{c}^{\prime}and it remains to prove that it is effectively non-increasing onIt iscE_{c}and non-decreasing onIt iscE_{c}^{\prime}To consolidate the ideas, let us show that the function is non-increasing onIt iscE_{c}Otherwise we could find the pointsx1,x2It iscx_{1},x_{2}\in E_{c},x1<x2x_{1}<x_{2}so that we havef(x1)<f(x2)f\left(x_{1}\right)<f\left(x_{2}\right)However, the function is not monotonic onIt isE, the points can be foundx1,x2It isx_{1}^{\prime},x_{2}^{\prime}\in E,x1<x2x_{1}^{\prime}<x_{2}^{\prime}so that we havef(x1)>f(x2)f\left(x_{1}^{\prime}\right)>f\left(x_{2}^{\prime}\right)We should have thenx2<x2x_{2}<x_{2}Iff(x2)<f(x2)f\left(x_{2}^{\prime}\right)<f\left(x_{2}\right)inequality (1) is not verified on the pointsx1,x2,x2x_{1},x_{2},x_{2}^{\prime}Iff(x2)f(x2)f\left(x_{2}^{\prime}\right)\geq f\left(x_{2}\right)we should also havex2<x1x_{2}<x_{1}^{\prime}and inequality (1) would not be verified on the pointsx1,x1,x2x_{1},x_{1}^{\prime},x_{2}^{\prime}It is also proven thatf(x)f(x)is non-decreasing onIt iscE_{c}^{\prime}.
5. Theorem 1 now follows easily. Letcca point that satisfies Lemma 2. Ifccdoes not belong to himIt isEthe decomposition sought isIt is=It iscIt iscE=E_{c}^{*}\cup E_{c}^{\prime*}IfcIt isc\in E, on at least one of the setsIt isc{c}E_{c}\cup\{c\},It isc{c}E_{c}^{\prime}\cup\{c\}the function is monotonic. Indeed, otherwise, we could find the pointsx1It isc,x2It iscx_{1}\in E_{c},x_{2}\in E_{c}^{\prime}so thatf(x1)<f(c),f(x2)<<f(c)f\left(x_{1}\right)<f(c),f\left(x_{2}\right)<<f(c)and inequality (1) would not be verified on the pointsx1,c,x2x_{1},c,x_{2}Theorem 1 still follows, adding the pointccto one of the crowdsIt isc,It iscE_{c},E_{c}^{\prime}and its decompositionIt isEis still in shapeIt is=It isckIt iscE=E_{c}^{\mathrm{k}}\cup E^{\prime*}{}_{c}.

Analogous results exist for the functions (mm^{-}).
Iff(x)f(x)is a function (mm) the pointsccseparation of the decompositionsIt is=It iscIt iscE=E_{c}^{*}\cup E_{c}^{\prime*}in two consecutive subsets of opposite monotonicity form an interval[b,b]\left[b^{\prime},b\right], finite or infinite, being able to be reduced to a single point. This interval is always closed provided that we also consider improper numbers,+-\infty,+\inftyIff(x)f(x)it is not monotonous,b,bb^{\prime},bare precisely the finite numbers determined above. In this caseb,bb^{\prime},bmust belong to any closed interval containing three pointsx1<x2<x3x_{1}<x_{2}<x_{3}his/hersIt isEso that we have[x1,x2;f][x2,x3;f]<0\left[x_{1},x_{2};f\right]\left[x_{2},x_{3};f\right]<0Iff(x)f(x)is monotonous, the interval[b,b]\left[b^{\prime},b\right]is infinite or reduces to one of the improper points++\infty,-\inftyIndeed, if we look at
the function as a function (m+m^{+}) we haveb=b^{\prime}=-\inftyif it is non-decreasing andb=+b=+\inftyif it is non-increasing.

If the crowdIt is(b,b)E\cap\left(b^{\prime},b\right)is not empty, the function reduces to a constant on this set. Indeed, iff(x)f(x)is a function(m+)\left(m^{+}\right)and ifx0It is(b,b)x_{0}\in E\cap\left(b^{\prime},b\right), he is non-increasing onIt isx0{x0}E_{x_{0}}\cup\left\{x_{0}\right\}and unwaveringly onIt isx0{x0}E_{x_{0}}^{\prime}\cup\left\{x_{0}\right\}It follows thatf(x0)=m(f;It is)f\left(x_{0}\right)=m(f;E). It is also seen that iff(x)f(x)is a function(m)\left(m^{-}\right)HAVEf(x0)=M(f;It is)f\left(x_{0}\right)=M(f;E).

From the above it follows that, for a function (mm), its decompositionIt isEinto two consecutive subsets of opposite monotonicity can be done, in general, in several and even infinitely many ways. It is easy to see which are the cases in which this decomposition is unique. Assuming thatf(x)f(x)is - function(m+)\left(m^{+}\right), for uniqueness it is necessary that the setIt is(b,b)E\cap\left(b^{\prime},b\right)to be empty and furthermore it is necessary and sufficient that we have:b,bIt isb^{\prime},b\in Eandf(b)>m(f;It isb)f(b)>m\left(f;E_{b^{\prime}}\right)orf(b)>m(f;It isb)f\left(b^{\prime}\right)>m\left(f;E_{b}^{\prime}\right), ifb=bb^{\prime}=b ; at most one of the pointsb,bb^{\prime},bto belong toIt isEandf(b)>>m(f;It isb)f\left(b^{\prime}\right)>>m\left(f;E_{b}^{\prime}\right)respectivelyf(b)>m(f;It isb)f(b)>m\left(f;E_{b^{\prime}}\right)asbIt isb^{\prime}\in ErespectivelybIt isb\in E, ifb<bb^{\prime}<b.
6. Before going further, we will make an observation on the functions (m) that will be useful to us below.

Whetherf(x)f(x)a function(m+),[b,b]\left(m^{+}\right),\left[b^{\prime},b\right]the range of corresponding separation points andandIan arbitrary interval (closed or not) that has no points in common withIt isE(soIt isand=AE\cap I=O. Finally, eitherIt is1E_{1}some subset ofandIUnder these conditions we have:

Lemma 3. If the intervals[b,b]\left[\mathrm{b}^{\prime},\mathrm{b}\right]and I have at least one point in common and ifγ\gammais a constant such thatγm(f;It is)\gamma\leqq\mathrm{m}(\mathrm{f};\mathrm{E}), function

f1(x)={f(x), for xIt isγ, for xIt is1f_{1}(x)=\left\{\begin{array}[]{l}f(x),\text{ pentru }x\in E\\ \gamma,\text{ pentru }x\in E_{1}\end{array}\right.

is a function (m+\mathrm{m}^{+}) onIt isIt is1\mathrm{E}\cup\mathrm{E}_{1}It is sufficient to prove the
property forIt is1=andE_{1}=I. Be it thenc[b,b]andc\in\left[b^{\prime},b\right]\cap Iand let's putF=It isandF=E\cup IFunctionf1(x)f_{1}(x)is non-increasing onFcF_{c}, for it is easily seen that it is non-increasing onIt iscandE_{c}\cup IandFcF_{c}is a subset of this set. It is also seen thatf1(x)f_{1}(x)is non-decreasing onFcF_{c}^{\prime}. Lemma 3 follows.

It can still be observed that the interval of the points of separation of the decompositions ofFFcorresponding to the functionf1(x)f_{1}(x)contains the rangeandI, so[b,b]\left[b^{\prime},b\right]also contains the intervalandI.

An analogous property holds for the functions (mm^{-}), the inequality from the hypothesis of lemma 3 is thenγM(f;It is)\gamma\geqq M(f;E).
7. We propose to generalize Theorem 2 by removing the restriction that the considered subsets ofIt isEto be consecutive.

We will say thatf(x)f(x)is a function(M)(M)(onIt isE) ifIt isEcan be decomposed into the union of two subsets (empty or not), on each of which the function is monotone and the monotonicity is of opposite sense on the two subsets. It is clear that any function (mm) is a function(M)(M)In particular, any function defined on at most 3 points is a function (MM). Finally, it is obvious that any function(M)(M)onIt isEis a function (MM) on any subset ofIt isE.

Let's first examine the functions defined on 4 distinct pointsx1<x2<x3<x4x_{1}<x_{2}<x_{3}<x_{4}Let's consider the string
(3)

f(x2),f(x1),f(x4),f(x3)f\left(x_{2}\right),f\left(x_{1}\right),f\left(x_{4}\right),f\left(x_{3}\right)

If the functionf(x)f(x)is not univalent, it is obviously a function (MM). Otherwise (i.e. if the function is univalent) two cases must be distinguished:
11^{\circ}The sequence (3) is not strictly monotone.
22^{\circ}. The sequence (3) is strictly monotone (increasing or decreasing).
In the case11^{\circ}we have:

[x1,x2;f][x1,x4;f]<0 or [x1,x4;f][x3,x4;f]<0\left[x_{1},x_{2};f\right]\left[x_{1},x_{4};f\right]<0\text{ sau }\left[x_{1},x_{4};f\right]\left[x_{3},x_{4};f\right]<0

and examining all possible cases it is seen thatf(x)f(x)is a function(M)(M), the decomposition of the definition set being, for example:

{x1}{x2,x3,x4},(x2){x1,x3,x4},{x3}{x1,x2,x4}{x4}{x1,x2,x3} or {x1,x4}{x2,x3}\begin{array}[]{lcccl}\left\{x_{1}\right\}\cup\left\{x_{2},x_{3},x_{4}\right\},&\left(x_{2}\right)\cup\left\{x_{1},x_{3},x_{4}\right\},&\left\{x_{3}\right\}\cup\left\{x_{1},x_{2},x_{4}\right\}\\ \left\{x_{4}\right\}\cup\left\{x_{1},x_{2},x_{3}\right\}&\text{ sau }&\left\{x_{1},x_{4}\right\}\cup\left\{x_{2},x_{3}\right\}\end{array}

In case22^{\circ}it is sufficient to examine all the decompositions of the definition set into the union of two subsets to see that the function is not a function (MM).

We therefore have:
Theorem 3. Because the functionf(x)\mathrm{f}(\mathrm{x}), define it on the pointsx1<<x2<x3<x4\mathrm{x}_{1}<<\mathrm{x}_{2}<\mathrm{x}_{3}<\mathrm{x}_{4}, to be a function (M), it is necessary and sufficient that the sequence (3) is not strictly monotone.
8. Let us now consider a functionf(x)f(x)defined on 5 distinct pointsx1<x2<x3<x4<x5x_{1}<x_{2}<x_{3}<x_{4}<x_{5}Becausef(x)f(x)to be a function(M)(M)it is necessary that it be a function(M)(M)on any group of 4
points chosen among the pointsx1,x2,x3,x4,x5x_{1},x_{2},x_{3},x_{4},x_{5}However, this condition is not sufficient.

Let us seek to determine the functions that enjoy the property that they are not functions.(M)(M)but that they are functions(M)(M)on any group of 4 points chosen from the 5 points considered. We will distinguish two cases for this:
1.f(x1)f(x5)1^{\circ}.f\left(x_{1}\right)\neq f\left(x_{5}\right).
2.f(x1)=f(x5)2^{\circ}.f\left(x_{1}\right)=f\left(x_{5}\right)
We will show that in the case 11^{\circ}there are no functions of the required form. For the proof we can assumef(x1)<f(x5)f\left(x_{1}\right)<f\left(x_{5}\right)Then the function cannot be non-increasing on the pointsx2,x3,x4x_{2},x_{3},x_{4}and so we must havef(x2)<f(x3)f\left(x_{2}\right)<f\left(x_{3}\right)orf(x3)<f(x4)f\left(x_{3}\right)<f\left(x_{4}\right).

Let's assumef(x1)<f(x5),f(x2)<f(x3)f\left(x_{1}\right)<f\left(x_{5}\right),f\left(x_{2}\right)<f^{\circ}\left(x_{3}\right)The function can have one of the following 10 forms 1 ):
1.f(x2)<f(x1)<f(x5)<f(x4)1^{\circ}.f\left(x_{2}\right)<f\left(x_{1}\right)<f\left(x_{5}\right)<f\left(x_{4}\right),
2.f(x2)<f(x1)<f(x4)<f(x3)f\left(x_{2}\right)<f\left(x_{1}\right)<f\left(x_{4}\right)<f\left(x_{3}\right),
3.f(x4)<f(x5)<f(x2)<f(x3)3^{\circ}.f\left(x_{4}\right)<f\left(x_{5}\right)<f\left(x_{2}\right)<f\left(x_{3}\right),
4.f(x2)<f(x1)<f(x5)<f(x3)4^{\circ}.f\left(x_{2}\right)<f\left(x_{1}\right)<f\left(x_{5}\right)<f\left(x_{3}\right),
5.f(x2)<f(x3)f(x4)f(x5)5^{\circ}.f\left(x_{2}\right)<f\left(x_{3}\right)\leqq f\left(x_{4}\right)\leqq f\left(x_{5}\right),
6.f(x1)f(x2)<f(x3)f(x5)6^{\circ}.f\left(x_{1}\right)\leqq f\left(x_{2}\right)<f\left(x_{3}\right)\leqq f\left(x_{5}\right),
7f(x1)f(x2)<f(x3)f(x4)7^{\circ}\cdot f\left(x_{1}\right)\leqq f\left(x_{2}\right)<f\left(x_{3}\right)\leqq f\left(x_{4}\right),
8.f(x2)<f(x3)f(x5),f(x4)f(x1)8^{\circ}.f\left(x_{2}\right)<f\left(x_{3}\right)\leqq f\left(x_{5}\right),f\left(x_{4}\right)\leqq f\left(x_{1}\right),
9.f(x1)f(x2)f(x5),f(x4)f(x3)9^{\circ}.f\left(x_{1}\right)\leqq f\left(x_{2}\right)\leqq f\left(x_{5}\right),f\left(x_{4}\right)\leqq f\left(x_{3}\right),
10.f(x1)f(x2)<f(x3),f(x5)f(x4)10^{\circ}.f\left(x_{1}\right)\leqq f\left(x_{2}\right)<f\left(x_{3}\right),f\left(x_{5}\right)\leqq f\left(x_{4}\right)
In cases 1,2,31^{\circ},2^{\circ},3^{\circ}respectively44^{\circ}the function is not a function (MM) on groups of 4 pointsx1,x2,x4,x5;x1,x2,x3,x4;x2,x3,x4,x5x_{1},x_{2},x_{4},x_{5};x_{1},x_{2},x_{3},x_{4};x_{2},x_{3},x_{4},x_{5}respectivelyx1,x2,x3,x5x_{1},x_{2},x_{3},x_{5}In cases5,65^{\circ},6^{\circ}respectively77^{\circ}function is a function (MM), being monotone on groups of 4 pointsx2,x3,x4x_{2},x_{3},x_{4},x5;x1,x2,x3,x5x_{5};x_{1},x_{2},x_{3},x_{5}respectivelyx1,x2,x3,x4x_{1},x_{2},x_{3},x_{4}In cases8,98^{\circ},9^{\circ}respectively1010^{\circ}function is a function (MM), the decomposition into two subsets of opposite monotonicity being, for example,{x1,x4,}{x2,x3,x5}\left\{x_{1},x_{4},\right\}\cup\left\{x_{2},x_{3},x_{5}\right\},{x3,x4}{x1,x2,x5}\left\{x_{3},x_{4}\right\}\cup\left\{x_{1},x_{2},x_{5}\right\}respectively{x4,x5}{x1,x2,x3}\left\{x_{4},x_{5}\right\}\cup\left\{x_{1},x_{2},x_{3}\right\}.

By symmetry it is seen that the same property occurs iff(x1)<f(x5),f(x3)<f(x4)f\left(x_{1}\right)<f\left(x_{5}\right),f\left(x_{3}\right)<f\left(x_{4}\right)Finally, the property results the same forf(x1)>f(x5)f\left(x_{1}\right)>f\left(x_{5}\right).

0 0 footnotetext: 1. The 10 possibilities are not mutually exclusive.

Now let it be the case22^{\circ}from the beginning of this issue. We will show that in this case there are functions that are not functions (M) on the 5 points, but are functions (M) on any group of 4 points chosen from them.

Such a function cannot be monotonic on the pointsx2x_{2},x3,x4x_{3},x_{4}and cannot take the valuef(x1)=f(x5)f\left(x_{1}\right)=f\left(x_{5}\right)at any of these points. Iff(x2),f(x3),f(x4)f\left(x_{2}\right),f\left(x_{3}\right),f\left(x_{4}\right)are they all greater or all smaller thanf(x1)f\left(x_{1}\right)function is a function (MM), the decomposition being, for example:

{x1,x4}{x2,x3,x5} or {x3,x4}{x1,x2,x5}\left\{x_{1},x_{4}\right\}\cup\left\{x_{2},x_{3},x_{5}\right\}\text{ sau }\left\{x_{3},x_{4}\right\}\cup\left\{x_{1},x_{2},x_{5}\right\}

It remains to examine the functions for which one of the strings:

{MAX(f(x2),f(x4)),f(x1)=f(x5),f(x3)f(x3),f(x1)=f(x5),min(f(x2),f(x4))\left\{\begin{array}[]{l}\max\left(f\left(x_{2}\right),f\left(x_{4}\right)\right),f\left(x_{1}\right)=f\left(x_{5}\right),f\left(x_{3}\right)\\ f\left(x_{3}\right),f\left(x_{1}\right)=f\left(x_{5}\right),\min\left(f\left(x_{2}\right),f\left(x_{4}\right)\right)\end{array}\right.

is increasing.
It is easy to verify that such a function is a function (MM) on any group of 4 points chosen from the pointsx1,x2,x3,x4,x5x_{1},x_{2},x_{3},x_{4},x_{5}, but that it is not a function (MM) on all these points.

Finally we have:
Theorem 4. Because the functionf(x)\mathrm{f}(\mathrm{x}), defined on the pointsx1<<x2<x3<x4<x5\mathrm{x}_{1}<<\mathrm{x}_{2}<\mathrm{x}_{3}<\mathrm{x}_{4}<\mathrm{x}_{5}, to be a function ( M ), it is necessary and sufficient that it be a function ( M ) on any group of 4 points chosen from the pointsx1,x2,x3,x4,x5\mathrm{x}_{1},\mathrm{x}_{2},\mathrm{x}_{3},\mathrm{x}_{4},\mathrm{x}_{5}, and so that it is not of the formf(x1)=f(x5)\mathrm{f}\left(\mathrm{x}_{1}\right)=\mathrm{f}\left(\mathrm{x}_{5}\right), one of the rows (4) being increasing.

In this way, the structure of functions(M)(M)defined on no more than 5 points is specified.
9. In the following we will use the following:

Lemma 4. LetIt is=GH,GH=0\mathrm{E}=\mathrm{G}\cup\mathrm{H},\mathrm{G}\cap\mathrm{H}=0andf(x)\mathrm{f}(\mathrm{x})a function defined on E that verifies the following properties:
1.f(x)1^{\circ}.\mathrm{f}(\mathrm{x})is a function(m+)\left(\mathrm{m}^{+}\right)on G and is a function(m)\left(\mathrm{m}^{-}\right)on H.
22^{\circ}.m(f;G)M(f;H)m(f;G)\geq M(f;H).
33^{\circ}. Intervals[b,b]\left[\mathrm{b}^{\prime},\mathrm{b}\right]and[b1,b1]\left[\mathrm{b}_{1},\mathrm{\penalty 10000\ b}_{1}\right]of the separation points of the decompositions corresponding to the functionf(x)\mathrm{f}(\mathrm{x})on G and H, they have at least one point in common.

Thenf(x)\mathrm{f}(\mathrm{x})is a function (M) on E .
Letc[b,b][b1,b1]c\in\left[b^{\prime},b\right]\cap\left[b_{1}^{\prime},b_{1}\right]andG=GcGc,H=HcHcG=G_{c}^{*}\cup G_{c}^{\prime*},H=H_{c}^{*}\cup H_{c}^{\prime*}the corresponding decompositions ofG,HG,Hfor the separation point c. Let us consider the setsIt is1=GcHc,It is2=E_{1}=G_{c}^{*}\cup H_{c}^{*},E_{2}=
=GcHc=G_{c}^{\prime*}\cup H_{c}^{*}. ThenIt is=It is1It is2E=E_{1}\cup E_{2}. But the function is non-increasing onGcG_{c}^{*}and onHcH_{c}^{\prime*}Ifx1Gc,x2Hcx_{1}\in G_{c}^{*},x_{2}\in H_{c}^{**}HAVEx1<x2x_{1}<x_{2}andf(x1)m(f;G)M(f;andand)f(x2)f\left(x_{1}\right)\geq\geq m(f;G)\geqq M(f;II)\geqq f\left(x_{2}\right), that isf(x1)f(x2)f\left(x_{1}\right)\geqq f\left(x_{2}\right)This inequality shows that the functionf(x)f(x)is non-increasing on the setIt is1E_{1}. It is also seen that it is non-decreasing onIt is2E_{2}. Lemma 4 is proved.
10. It remains to examine functions defined on a setIt isEhaving at least 5 distinct points. For these functions we have:

Theorem 5. Because the functionf(x)\mathrm{f}(\mathrm{x})be a function (M) on E , it is necessary and sufficient that it be a function (M) on any group of 5 points of E.

The condition is obviously necessary. It remains to show that it is also sufficient.

Iff(x)f(x)is a function(M)(M)on any group of 5 points of hisIt isEit is, a fortiori, a function(M)(M)on any group of 4 points ofIt isE. -
11. To arrive at the required proof we will first establish some helpful properties.

Whetherα\alphaa real number and denote byIt is(α)E^{(\alpha)}set of pointsxIt isx\in Efor whichf(x)<αf(x)<\alphaand withIt is(α)E^{\prime(\alpha)}the set of pointsxIt isx\in Efor whichf(x)>αf(x)>\alphaWe have obviouslyIt is(α)It is(α)=0E^{(\alpha)}\cap E^{\prime(\alpha)}=0and we deduce:

Lemma 5. Iff(x)\mathrm{f}(\mathrm{x})is a function (M) on any group of 4 points of E and if a is any real number, at least one of the following properties is satisfied:
ff(x)\mathrm{f}^{\mathrm{f}}(\mathrm{x})is a function(m)\left(\mathrm{m}^{-}\right)onIt is(α)\mathrm{E}^{(\alpha)}.
f(x)\mathrm{f}(\mathrm{x})is a function(m+)\left(\mathrm{m}^{+}\right)onIt is()\mathrm{E}^{\prime(\infty)}Indeed
, in the opposite case, we could find the pointsx1,x2x_{1},x_{2},x3It is(α),x,1x,2x3It is(α),x1<x2<x3,x<1x<2x3x_{3}\in E^{(\alpha)},x^{\prime}{}_{1},x^{\prime}{}_{2},x^{\prime}{}_{3}\in E^{\prime(\alpha)},x_{1}<x_{2}<x_{3},x^{\prime}{}_{1}<x^{\prime}{}_{2}<x^{\prime}{}_{3}, so that we have:

f(x2)<min(f(x1),f(x3)),f(x2)>MAX(f(x1),f(x3)).f\left(x_{2}\right)<\min\left(f\left(x_{1}\right),f\left(x_{3}\right)\right),f\left(x_{2}^{\prime}\right)>\max\left(f\left(x_{1}^{\prime}\right),f\left(x_{3}^{\prime}\right)\right).

It is easy to see then that ifx2<x2,f(x)x_{2}<x_{2}^{\prime},f(x)it is not a function(M)(M)on the pointsx1,x2,x2,x3x_{1},x_{2},x_{2}^{\prime},x_{3}^{\prime}and ifx2>x2,f(x)x_{2}>x_{2}^{\prime},f(x)is not a function (MM) on the pointsx1,x2,x2,x3x_{1}^{\prime},x_{2}^{\prime},x_{2},x_{3}.

Let us now suppose thatf(x)f(x)is a function(M)(M)but that it does not reduce to a function (mm). It is seen, as in the proof of the lemma𝟐\mathbf{2}, that there is a numberβ\beta, unique and well-determined, which enjoys
the property thatf(x)f(x)is a function(m)\left(m^{-}\right)onIt is(α)E^{(\alpha)}for anythingαβ\alpha\leqq\betabut it is not a function (mm^{-}) onIt is(α)E^{(\alpha)}ifα>β\alpha>\beta. Likewise, there is a unique and well-determined numberβ\beta^{\prime}who enjoys the property thatf(x)f(x)is a function (m+m^{+}) onIt is(α)E^{\prime(\alpha)}for anythingαβ\alpha\geqq\beta^{\prime}but it is not a function (m+m^{+}) onIt is(α)E^{\prime(\alpha)}ifα<β\alpha<\beta^{\prime}. The numbersβ,β\beta^{\prime},\betaare contained in the closed interval:
[min(f(x1),f(x2),f(x3),f(x4)),MAX(f(x1),f(x2),f(x3),f(x4))]\left[\min\left(f\left(x_{1}\right),f\left(x_{2}\right),f\left(x_{3}\right),f\left(x_{4}\right)\right),\max\left(f\left(x_{1}\right),f\left(x_{2}\right),f\left(x_{3}\right),f\left(x_{4}\right)\right)\right]
for any group of 4 pointsx1<x2<x3<x4x_{1}<x_{2}<x_{3}<x_{4}his/hersIt isEfor which the string (2) has 2 sign variations. We also haveββ\beta^{\prime}\leqq\beta.

We deduce from here:
Lemma 6. Iff(x)\mathrm{f}(\mathrm{x})If there is a function (M) on any group of 4 points of E, one can find a numberγ\gammajust like thatf(x)\mathrm{f}(\mathrm{x})to be a function(m)\left(\mathrm{m}^{-}\right)onIt is(γ)\mathrm{E}^{(\gamma)}and a function(m+)\left(\mathrm{m}^{+}\right)onIt is(γ)\mathrm{E}^{\prime}(\gamma).

It is enough to takeγ[β,β]\gamma\in\left[\beta^{\prime},\beta\right]For the property to be general we must admit thatβ,β,γ\beta^{\prime},\beta,\gammacan also take on inappropriate values. The numbersγ\gammawhich satisfy Lemma 6 form a closed interval[β,β]\left[\beta^{\prime},\beta\right], finite or not. This interval is finite if and only if the function does not reduce to a function (mm). Thenβ\beta^{\prime},β\betaare precisely the numbers determined above. Iff(x)f(x)is a function(m+)\left(m^{+}\right)HAVEβ=+\beta=+\inftyand iff(x)f(x)is a function (mm^{-}) we haveβ=\beta^{\prime}=-\infty.

It can still be observed that on the set of pointsxxso thatβ<f(x)<β\beta^{\prime}<\cdot f(x)<\beta, the function is monotonic.

Lemmas 5, 6 are satisfied, a fortiori, by any function that is a function(M)(M)on any group of 5 points of hisIt isE.
12. We can now deduce:

Lemma 7. Iff(x)\mathrm{f}(\mathrm{x})is a function (M) on any group of 4 points of E and if the numberγ\gammacheck the conditions of the lemma6,f(x)6,\mathrm{f}(\mathrm{x})is a function (M) on the setIt is(Y)\mathrm{E}^{(\Upsilon)}(It is(γ)\mathrm{E}^{\prime}(\gamma).

Indeed, ifG=It is(γ),H=It is(γ)G=E^{\prime}(\gamma),H=E^{(\gamma)}all assumptions of Lemma 4 are satisfied.1,21^{\circ},2^{\circ}are verified according to the definition of setsIt is(γ),It is(γ)E^{(\gamma)},E^{\prime(\gamma)}and according to Lemma 6. Hypothesis33^{\circ}is also satisfied. Otherwise, suppose, for example,b1<bb_{1}<b^{\prime}. Be it thenb1<c<bb_{1}<c<b^{\prime}The function is not non-decreasing onHcH_{c}and onGcG_{c}^{\prime}We can therefore find the points:

x1,x2Hc,x3,x4Gc,x1<x2<x3<x4x_{1},x_{2}\in H_{c},x_{3},x_{4}\in G_{c}^{\prime},x_{1}<x_{2}<x_{3}<x_{4}

so thatf(x2)<f(x1)<f(x4)<f(x3)f\left(x_{2}\right)<f\left(x_{1}\right)<f\left(x_{4}\right)<f\left(x_{3}\right)andf(x)f(x)wouldn't it be a function(M)(M)on the pointsx1,x2,x3,x4x_{1},x_{2},x_{3},x_{4}.

Lemma 7 is satisfied in particular by any function that is a function (MM) on any group of 5 points ofIt isE.

Whetherγ\gammaa number that satisfies the conditions of Lemma 6. We can assume thatγ\gammais a finite number. Otherwise the functionf(x)f(x), is a function (mm). We saw that the intervals [b,bb^{\prime},b],[b1,b1]\left[b_{1}^{\prime},b_{1}\right]of the separation points corresponding to the function on the setsG=It is(γ),H=It is(γ)G=E^{\prime}(\gamma),H=E^{(\gamma)}, have at least one point in common. So we havebb1,b1bb^{\prime}\leqq b_{1},\quad b_{1}^{\prime}\leqq b.

We will also need the following:
Lemma 8. In the above hypotheses, iff(x0)=γ\mathrm{f}\left(\mathrm{x}_{0}\right)=\gamma, we havex0[b,b][b1,b1]\mathrm{x}_{0}\in\left[\mathrm{\penalty 10000\ b}^{\prime},\mathrm{b}\right]\cup\left[\mathrm{b}_{1}^{\prime},\mathrm{b}_{1}\right].

Indeed, let's assume the opposite. For example, let's sayx0<bx_{0}<b^{\prime},x0<b1x_{0}<b_{1}^{\prime}. Thenf(x)f(x)is not non-increasing onGx0G_{x_{0}}^{\prime}and it is not non-decreasing onHx0H_{x_{0}}^{\prime}We can therefore find the points:

x1,x2Gx0,x1,x2Hx0,x0<x1<x2,x0<x1<x2,x_{1},\quad x_{2}\in G_{x_{0}}^{\prime},\quad x_{1}^{\prime},\quad x_{2}^{\prime}\in H_{x_{0}}^{\prime},\quad x_{0}<x_{1}<x_{2},\quad x_{0}<x_{1}^{\prime}<x_{2}^{\prime},

so thatf(x1)<f(x2)<γ=f(x0),f(x1)>f(x2)>γ=f(x0)f\left(x_{1}\right)<f\left(x_{2}\right)<\gamma=f\left(x_{0}\right),f\left(x_{1}^{\prime}\right)>f\left(x_{2}^{\prime}\right)>\gamma=f\left(x_{0}\right)and it is seen that ifx1<x1,f(x)x_{1}<x_{1}^{\prime},f(x)is not a function(M)(M)on the pointsx0,x1,x1,x2x_{0},x_{1},x_{1}^{\prime},x_{2}^{\prime}, and ifx1>x1,f(x)x_{1}>x_{1}^{\prime},f(x)is not a function(M)(M)on the pointsx0,x1,x1,x2x_{0},x_{1}^{\prime},x_{1},x_{2}.

Finally, we have
Lemma 9. In the above hypotheses, iff(x0)=γ\mathrm{f}\left(\mathrm{x}_{0}\right)=\gammaand ifx0<b\mathrm{x}_{0}<b^{\prime},x0>b,x0<b1\mathrm{x}_{0}>\mathrm{b},\quad\mathrm{x}_{0}<\mathrm{b}_{1}^{\prime}respectivelyx0>b1\mathrm{x}_{0}>\mathrm{b}_{1}HAVEH(x0,b)=0\mathrm{H}\cap\left(\mathrm{x}_{0}{}^{\prime},\mathrm{b}^{\prime}\right)=0,H(b,x0)=0,G(x0,b1)=0\mathrm{H}\cap\left(\mathrm{b},\mathrm{x}_{0}\right)=0,\mathrm{G}\cap\left(\mathrm{x}_{0},\mathrm{\penalty 10000\ b}_{1}^{\prime}\right)=0respectivelyG(b1,x0)=0\mathrm{G}\cap\left(\mathrm{b}_{1},\mathrm{x}_{0}\right)=0.

It is enough to prove the property in the casex0<bx_{0}<b^{\prime}If we hadH(x0,b)0H\cap\left(x_{0},b^{\prime}\right)\neq 0, there would be a pointcchis/herHHso thatx0<c<bx_{0}<c<b^{\prime}We would then havef(x0)>f(c)f\left(x_{0}\right)>f(c)But from his definitionbb^{\prime}it follows that we can find the pointsx1,x2x_{1},x_{2}his/hersGGso thatc<x1<x2c<x_{1}<x_{2}and thatf(x1)>f(x2)f\left(x_{1}\right)>f\left(x_{2}\right)It would therefore follow that the function is not a function (MM) on the pointsx0,c,x1,x2x_{0},c,x_{1},x_{2}. The proof is done in the same way in the other three cases.
13. Let us now return to the proof of theorem 5, more precisely to the proof of the sufficiency of the condition expressed by this theorem.

Let's assume thatf(x)f(x)does not reduce to a function (mm) (because otherwise there is nothing to prove) and eitherγ\gammaa (finite) number
that satisfies the conditions of Lemma 6. Let us keep the notations from No. 12 and denote byKKthe set of points ofIt isEin whichf(x)f(x)take the valueγ\gammaThen the crowdsG,andand,KG,II,Kare disjoint pairs and their union is equal toIt isE.

For the proof we distinguish 3 cases:
Case I. K is empty. The theorem then follows from Lemma 7.
Case II.KKhas only one pointx0x_{0}Here we will distinguish 2 subcases:

Subcaseandand1.x0[b,b][b1,b1]II_{1}.x_{0}\in\left[b^{\prime},b\right]\sim\left[b_{1}^{\prime},b_{1}\right]. Then the function(m+)f(x)\left(m^{+}\right)f(x)fromGGcan be extended at the pointx0x_{0}under the conditions of Lemma 3. So addingx0x_{0}TOGGthe theorem follows from lemma 4, all the assumptions of this lemma being satisfied

Subcaseandand2.x0II_{2}.x_{0}does not belong to both intervals[b,b],[b1,b1]\left[b^{\prime},b\right],\left[b_{1}^{\prime},b_{1}\right]To fix the ideas, let's assume thatx0x_{0}does not belong to the range[b1,b1]\left[b_{1}^{\prime},b_{1}\right]and that, for example,x0<b1x_{0}<b_{1}^{\prime}Based on Lemma 8, we havex0[b,b]x_{0}\in\left[b^{\prime},b\right]We can extend the functionf(x)f(x)fromGGon the pointx0x_{0}and then, based on Lemma 9, the interval of separation points corresponding to the functionf(x)f(x)on the crowdG{x0}G\cup\left\{x_{0}\right\}has at least one point in common with[b,b]\left[b^{\prime},b\right]So addingx0x_{0}TOGGThe theorem follows from Lemma 4, all the assumptions of this lemma being satisfied.

The proof is the same ifx0>b1x_{0}>b_{1}or ifx0x_{0}does not belong to the range[b,b]\left[b^{\prime},b\right].

Case III. K has at least two points. Then let [d,d]\left.d^{\prime},d\right]the smallest interval containingKKWe haved<dd^{\prime}<dHere we again distinguish two subcases:

Subcase III 1. Open interval(d,d)\left(d^{\prime},d\right)has no common point with at least one of the setsG,HG,HFor fixing ideas eitherG(d,d)=0G\cap\left(d^{\prime},d\right)=0.

If[d,d][b,b]=0\left[d^{\prime},d\right]\cap\left[b^{\prime},b\right]=0, we have[d,d][b1,b1]\left[d^{\prime},d\right]\subseteq\left[b_{1}^{\prime},b_{1}\right], based on Lemma 8. Based on Lemma3,f(x)3,f(x)is a function(m)\left(m^{-}\right)onHKH\cup Kand, based on Lemma 9, the interval of separation points corresponding to this function has at least one point in common with[b,b]\left[b^{\prime},b\right]So addingKKTOHHthe theorem still results by applying lemma 4.

If[d,d][b,b]0,f(x)\left[d^{\prime},d\right]\sim\left[b^{\prime},b\right]\neq 0,f(x)is a function(m+)\left(m^{+}\right)onGKG\cup K, based on Lemma 3. Based on Lemma 9, the interval of separation points corresponding to this function has at least one common pointwith[b1,b1]\mathrm{cu}\left[b_{1}^{\prime},b_{1}\right]and the theorem results as above.

The same is true ifH(d,d)=0H\cap\left(d^{\prime},d\right)=0.

Subcase11and211I_{2}. The interval (d,dd^{\prime},d) has points in common with both subsetsG,HG,H. Be it thenx1G(d,d),x2H(d,d)x_{1}\in G\cap\left(d^{\prime},d\right),x_{2}\in H\cap\left(d^{\prime},d\right), for fixing ideas, eitherx2<x1x_{2}<x_{1}We haved<x2<x1<dd^{\prime}<x_{2}<x_{1}<dand, based on the theorem4,H(x1,d)=0,G(d,x2)=04,H\cap\left(x_{1},d\right)=0,G\frown\left(d^{\prime},x_{2}\right)=0. Be it thenit isethe left extremum of the smallest interval containing its pointsG(d,d)G\cap\left(d^{\prime},d\right)andit ise^{\prime}the right extremum of the smallest interval containing its pointsH(d,d)H\cap\left(d^{\prime},d\right). Thenx2it is,it isx1x_{2}\leqq e,e^{\prime}\leqq x_{1}We cannot haveit is>it ise^{\prime}>eOtherwise, based on the definition of the pointsdd,d,it is,it isd^{\prime},e,e^{\prime}, we could find the points:

x3,x1K,x5G,x6H,x3<x2<x5<x6<x1<x4x_{3},x_{1}\in K,x_{5}\in G,x_{6}\in H,x_{3}<x_{2}<x_{5}<x_{6}<x_{1}<x_{4}

and then on each of the 5-point groupsx3,x2,x5,x6,x4;x3x_{3},x_{2},x_{5},x_{6},x_{4};x_{3},x5,x6,x1,x4x_{5},x_{6},x_{1},x_{4}we are in contradiction with theorem 4. So we haveit isit ise^{\prime}\leqq eIfc[it is,it is]c\in\left[e^{\prime},e\right], we haveG(d,c)=0,H(c,d)=0G\cap\left(d^{\prime},c\right)=0,H\cap(c,d)=0I say now that the intervals[it is,it is]\left[e^{\prime},e\right]and[b,b]\left[b^{\prime},b\right]have at least one point in common. Indeed, we cannot haveit is<be<b^{\prime}because then, based on the definition of the pointdd^{\prime}and based on the lemma9\mathbf{9}, we would haveH(d,b)=0H\cap\left(d^{\prime},b^{\prime}\right)=0, in contradiction with the definition of the pointit ise^{\prime}We can't have either.b<it isb<e^{\prime}because, also based on Lemma 9, we would haveH(b,d)=0H\cap(b,d)=0, which again contradicts the definition of the pointit ise^{\prime}. It is also proven that the intervals[it is,it is]\left[e^{\prime},e\right]and[b1,b1]\left[b_{1}^{\prime},b_{1}\right]have at least one point in common. Otherwise we would come across a contradiction with the definition of the pointit ise.

But, based on a well-known property, if several intervals have at least one point in common, then they have at least one point in common. It follows that the intervals [b,bb^{\prime},b],[b1,b1],[it is,it is]\left[b_{1}^{\prime},b_{1}\right],\left[e^{\prime},e\right]they have at least one thing in common.

Whetherc[b,b][b1,b1][it is,it is]c\in\left[b^{\prime},b\right]\sim\left[b_{1}^{\prime},b_{1}\right]\sim\left[e^{\prime},e\right]Based on Lemma 3,f(x)f(x)is a function(m+)\left(m^{+}\right)onGKcG\cup K_{c}^{\prime}and a function(m)\left(m^{-}\right)onHKc"H\cup K_{c}^{\prime\prime}, where, in the casecKc\in K, it doesn't matter which subsetKc,KcK_{c},K_{c}^{\prime}we add this pointccAll assumptions of Lemma 4 are then satisfied, replacingG,HG,HwithGKc,HKcG\cup K_{c}^{*},H\backsim K_{c}^{\prime*}respectively. The theorem is still proven.

The same is true for the case whenx2>x1x_{2}>x_{1}
Theorem 5 is therefore completely proven .

1950

Related Posts