On constant functions by segments

Abstract

Authors

T. Popoviciu
Institutul de Calcul

Keywords

?

Paper coordinates

T. Popoviciu, Sur les fonctions constantes par segments, Mathematica (Cluj), 7(30) (1965), pp. 333-340 (in French).

PDF

About this paper

Journal

Mathematica Cluj

Publisher Name

Published by the Romanian Academy  Publishing House

DOI
Print ISSN

1222-9016

Online ISSN

2601-744X

google scholar link

??

Paper (preprint) in HTML form

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

ON CONSTANT FUNCTIONS BY SEGMENT

TIBERIU POPOVICIU

in Cluj

  1. 1.

    EitherEEa (non-empty) set of points on the real axis (or on the real axis supplemented by improper points)-\inftyAnd\infty). A subset ofEEis said to be a segment ofEEif with two points ofEEit still contains all the points ofEEunderstood between them.EEE^{\prime}\subsetq Eis therefore a segment ofEEifhas,bEhasb[has,b]EEa,b\in E^{\prime}\wedge a\leqslant b\Rightarrow[a,b]\cap E\subseteq E^{\prime}.

Any set formed by a single point ofEEand the wholeEEThey themselves are segments ofEEWe can assume that the empty set is also a segment ofEEThe intersection of two (or any number, finite or infinite, of) segments ofEEis a segment ofEEThe union of two or more (any finite or infinite number of) segments, which have at least one point in common, is a segment.

Note. IfEEis the real axis; the notion of segment coincides with that of interval.

In the general case, we could first introduce the notion of a closed segment. This is a subset ofEEformed by all the points ofEEincluded (in the broadest sense) between two pointshas,ba,bOrhasba\leqslant bofEEA closed segment is therefore a set of the form[has,b]E[a,b]\cap EOrhas,bEa,b\in EThe pointshashasAndbbare the endpoints of this segment. A segment (any segment) ofEEis then a subset ofEEwhich, with any two of its points, always contains the closed segment having those points as endpoints.

In the case of the real axis, the closed segment is a closed interval and the segment, in general, is any interval.

In this work, it is unnecessary to distinguish between a closed segment and an arbitrary (or possibly non-closed) segment. The notion of a segment will therefore be accepted in the sense given at the beginning of this section
2. We will say that the (finite) sequence(Eα)α=1n\left(E_{\alpha}\right)_{\alpha=1}^{n}of segmentsEEforms a decomposition ofEEin consecutive segments or a partition ofEEif:
a) The segmentsEα,α=1,2,,nE_{\alpha},\alpha=1,2,\ldots,nare non-empty and divide the set into classesEE
b ) hasEα,bEβ,α<βhas<ba\in E_{\alpha},b\in E_{\beta},\alpha<\beta\Rightarrow a<b.

Property a) means that the segmentsEα,α=1,2,,nE_{\alpha},\alpha=1,2,\ldots,nhave nothing in common in pairs andα=1nEα=E\bigcup_{\alpha=1}^{n}E_{\alpha}=E.

Property b) means that ifα<β\alpha<\beta, every point ofEαE_{\alpha}is to the left of all points ofEβE_{\beta}.

We can designate by(E1|E2||En)\left(E_{1}\left|E_{2}\right|\ldots\mid E_{n}\right)the partition ofEEconsidered. The (natural) numbernncan be equal to 1. Then the unique term of the partition coincides withEEIt is easy to see that ifEEis finished, the numbernncan be equal to any natural number, at most equal to the number of points ofEE.

IfEEis an interval, the terms of a partition ofEEare intervals, two by two disjoint and of which any two consecutive ones have a common endpoint.

Any sheet music(E1|E2||En)\left(E_{1}\left|E_{2}\right|\ldots\mid E_{n}\right)ofEEcan be obtained by intersectingEEwith the terms of a partition(R1|R2||Rn)\left(R_{1}\left|R_{2}\right|\ldots\mid R_{n}\right)of the real axis(Eα=RαE,α=1,2,,n)\left(E_{\alpha}=R_{\alpha}\cap E,\alpha=1,2,\ldots,n\right).

IfEEis infinite, there exists a partition ofEEhavingnnterms, whatever the natural numbernnIndeed, one can find an increasing sequence(xα)α=1n+1\left(x_{\alpha}\right)_{\alpha=1}^{n+1}ofn+1n+1terms ofE(n>1)E(n>1), such that one hasxαE,α==1,2,,n+1x_{\alpha}\in E,\alpha==1,2,\ldots,n+1Andxα<xα+1,α=1,2,,nx_{\alpha}<x_{\alpha+1},\alpha=1,2,\ldots,nIf we askE1==(,x1]E,Eα=(xα1,xα]E,α=2,3,,n1(n>2)E_{1}==\left(-\infty,x_{1}\right]\cap E,E_{\alpha}=\left(x_{\alpha-1},x_{\alpha}\right]\cap E,\alpha=2,3,\ldots,n-1(n>2),En=(x,)EE_{n}=(x,\infty)\cap E, decomposition(E1|E2||En)\left(E_{1}\left|E_{2}\right|\ldots\mid E_{n}\right)is a score ofEE3.
We will now explain what is meant by a contraction or expansion of a partition ofEE.

Given a partition ofEE, we can deduce another by combining consecutive terms. We can then say that the second partition is obtained from the first by contraction. If

(E1|E2||En)\left(E_{1}\left|E_{2}\right|\ldots\mid E_{n}\right) (1)

is a score ofEEand ifFα=β=1kαEk1+k2++kα1+β,α=1,2,,γF_{\alpha}=\bigcup_{\beta=1}^{k_{\alpha}}E_{k_{1}+k_{2}+\ldots+k_{\alpha-1}+\beta},\quad\alpha=1,2,\ldots,\gamma, Orr,k1,k2,,krr,k_{1},k_{2},\ldots,k_{r}are natural numbers andk1+k2++kr==n(k0=0)k_{1}+k_{2}+\ldots+k_{r}==n\left(k_{0}=0\right), SO

(F1|F2||Fr)\left(F_{1}\left|F_{2}\right|\ldots\mid F_{r}\right) (2)

is a score ofEEobtained by contraction of partition (1).

We can also say that partition (1) is obtained from partition (2) by expansion. Therefore, we can obtain another partition from a given partition by expansion by decomposing some of its terms into new consecutive segments. Thus, partition (1) is obtained from partition (2) by expansion, by replacingFαF_{\alpha}by its score(Ek1+k2++kα1+1|Ek1+k2++kα1+2||Ek1+k2++kα)\left(E_{k_{1}+k_{2}}+\ldots+k_{\alpha-1}+1\left|E_{k_{1}+k_{2}}+\ldots+k_{\alpha-1}+2\right|\ldots\mid E_{k_{1}+k_{2}}+\ldots+k_{\alpha}\right)Forα==1,2,,r\alpha==1,2,\ldots,r.

One of the partitions obtained from partition (1) by contraction or expansion is this partition itself.

If (1), (2) are any two partitions ofEE(not necessarily obtained from each other by contraction or dilation), the first two termsE1,F1E_{1},F_{1}and similarly the last two termsEn,FrE_{n},F_{r}are. in the subset relation. That is to say, one of the relationsE1F1,F1E1E_{1}\subseteq F_{1},F_{1}\subset E_{1}and likewise one of the relationshipsEnFr,FrEnE_{n}\subseteq F_{r},F_{r}\subseteq E_{n}is always verified.
4. A function (real or complex, finite or not), defined on the setEEof the real axis is said to be constant by segments if there exists a partition (1) ofEEsuch that on each of the termsEα,α=1,2,,nE_{\alpha},\alpha=1,2,\ldots,n, this function being a constant. We can say that the partition (1) is then a support of the segment constant function under consideration. The numbernnThe terms of this support can be called the degree of the function. The degree is not well determined, in general, since any partition obtained bynnis not good dilation of a support is also a support of the function.

The degree, which varies with the number of terms in a given function, is a natural number. Therefore, it has a minimum, which is also a natural number and is called the effective degree of the segment-constant function under consideration.

If the function has effective degreenn, it has a support (1) withnnterms. In this case the function reduces (ifn>1n>1) with two different constants over any two consecutive termsEα,Eα+1(α=1,2,,n1)E_{\alpha},E_{\alpha+1}(\alpha=1,2,\ldots,n-1)This almost self-evident property will be revisited later in the proof of Theorem 1.

We will demonstrate that if a function constant over segments has effective degreenn, its support tonnThe term is unique. For this, let's assume the function has two supports(E1|E2||En),(F1|F2||Fn)\left(E_{1}\left|E_{2}\right|\ldots\mid E_{n}\right),\left(F_{1}\left|F_{2}\right|\ldots\mid F_{n}\right)withnnterms. It suffices to demonstrate thatEα=Fα,α=1,2,,nE_{\alpha}=F_{\alpha},\alpha=1,2,\ldots,n. Forn=1n=1The property is obvious. Ifn>1n>1Let's suppose the opposite. Then there is an index.r,1rn1r,1\leqslant r\leqslant n-1, such as one might haveEα=Fα,α=1,2,,r1E_{\alpha}=F_{\alpha},\alpha=1,2,\ldots,r-1,ErFrE_{r}\neq F_{r}(onlyE1F1E_{1}\neq F_{1}ifr=1r=1One of the setsEr,FrE_{r},F_{r}must be a proper subset of the other. EitherErFrE_{r}\subset F_{r}to clarify things. There is then a point that belongs toEr+1FrE_{r+1}\cap F_{r}and which therefore belongs to.Er+1E_{r+1}but does not belong toErE_{r}The function in question is not constant onFrF_{r}which contradicts the definition of this set.

This demonstrates the stated uniqueness.

5. By expanding on a point already made, we can demonstrate the

THEOREM 1. So that the partition (1) ofEEeither the support for the functionffconstant across segments and of effective degreennonEEIt is necessary and sufficient thatffreduce (ifn>1\mathrm{si}n>1) with two different constants over any two consecutive termsEα,Eα+1(α=1,2,,n1)E_{\alpha},E_{\alpha+1}(\alpha=1,2,\ldots,n-1).

The partition (1) being a support offfThis function must be a constant on each of the terms.Eα,α=1,2,,nE_{\alpha},\alpha=1,2,\ldots,n.

Let us now proceed to the proof of the theorem.
The condition is necessary, since otherwise, by a suitable contraction, one could obtain a support having less thannnterms.

To demonstrate that the condition is also sufficient, let us assume that it is satisfied. Let (2) then be any support of the functionffWe will demonstrate that partition (2) is obtained from (1) by dilation. Ifn=1n=1the property is immediate If iFFis of 1a partition (2) I1 exic whatever (μ\mu)hintα\mathrm{indice}\alphasuch that (A denotes the empty set)

FβEαΛ.F_{\beta}\cap E_{\alpha}\neq\Lambda. (3)

Otherwise, indeed, the definition of a partition would imply thatFβ(nEα)=FβE=ΛF_{\beta}\cap\left(\cup^{n}E_{\alpha}\right)=F_{\beta}\cap E=\Lambdawhich is impossible sinceFβF_{\beta}is not empty. We haveFβEαF_{\beta}\subseteq E_{\alpha}Indeed, otherwise we might find a clueα\alpha^{\prime}, different fromα\alpha, such as

FβEαΛF_{\beta}\cap E_{\alpha^{\prime}}\neq\Lambda (4)

But from (3) and (4) it follows that one of the relations

FβEα1Λ(ifα>1),FβEα+1Λ(ifα<n)F_{\beta}\cap E_{\alpha-1}\neq\Lambda(\mathrm{si}\alpha>1),F_{\beta}\cap E_{\alpha+1}\neq\Lambda(\mathrm{si}\alpha<n) (5)

certainly takes place. This is impossible since then the functionffwould not be constant onFβF_{\beta}, contrary to the definition of this set. It therefore follows that any segmentFβF_{\beta}is a subset of one and only one (the uniqueness ofα\alphain (3)) segmentEαE_{\alpha}.

Let us also note that at allα\alphamust correspond to at least oneβ\betasuch asEαFβ𝚲E_{\alpha}\cap F_{\beta}\neq\boldsymbol{\Lambda}Otherwise, indeed, it would follow, as above, thatEαE=ΛE_{\alpha}\cap E=\Lambdawhich is impossible sinceEαE_{\alpha}is not empty.

This demonstrates that, under the conditions of the demonstration, partition (2) is obtained from (1) by dilation.

Theorem 1 is proven.
Note that we have proven a little more than what was stated in Theorem 1, and in particular that any support of a function constant under segments can be obtained by dilating its support with the minimum number of terms.
6. Consider two functionsf,gf,gconstants per segment onEEand be
  

(F1|F2||Fm),(G1|G2||Gn)\left(F_{1}\left|F_{2}\right|\ldots\mid F_{m}\right),\left(G_{1}\left|G_{2}\right|\ldots\mid G_{n}\right) (6)

the respective supports of these functions.
We will show that we can find a common support for the functionsffAndgg.

The intersectionsFαGβ,α=1,2,,m,β=1,2,,nF_{\alpha}\cap G_{\beta},\alpha=1,2,\ldots,m,\beta=1,2,\ldots,nare pairwise disjoint segments and their union is equal toEEAmong these intersections, some are certainly non-empty. These are the intersectionsF1G1F_{1}\cap G_{1}AndFmGnF_{m}\cap G_{n}But also, among these intersections, there are some that are generally always empty. By arranging the non-empty intersections in a specific order, we obtain the partition

(E1|E2||Ep)\left(E_{1}\left|E_{2}\right|\ldots\mid E_{p}\right) (7)

which is obtained from each of the partitions (6) by dilation and it therefore follows that it is a common support of the functionsffAndgg.

The preceding property results from the following analysis. First, at anyα(1αm)\alpha(1\leqslant\alpha\leqslant m)corresponds, aβ(1βn)\beta(1\leqslant\beta\leqslant n)such asFαGβF_{\alpha}\cap G_{\beta}not be empty. Then ifFαGβF_{\alpha}\cap G_{\beta}not all is emptyFαGβF_{\alpha^{\prime}}\cap G_{\beta^{\prime}}withα>α,β<β\alpha^{\prime}>\alpha,\beta^{\prime}<\betais empty, because otherwise, every point ofFαGβF_{\alpha^{\prime}}\cap G_{\beta^{\prime}}should be both to the left and to the right of any point ofFαGβF_{\alpha}\cap G_{\beta}It follows that we can find the non-negative integersk1,k2,,kmk_{1},k_{2},\ldots,k_{m}such ask1+k2++km=nk_{1}+k_{2}+\ldots+k_{m}=nand such that all intersectionsFαGβF_{\alpha}\cap G_{\beta}different segments (k0=0k_{0}=0)

FhasGk1+k2+kα1+β,β=0,1,,kα,α=1,2,,mF_{a}\cap G_{k_{1}+k_{2}+\ldots k_{\alpha-1}+\beta},\quad\beta=0,1,\ldots,k_{\alpha},\alpha=1,2,\ldots,m (8)

are empty.
The number of segments (8) is equal tom+n1m+n-1and so we havepm+n1p\leqslant m+n-1for the numberppterms of the partition (7).

Those of the sets (8) that are not empty, arranged in "lexicographical" order of their indices, form the followingE1,E2,,EpE_{1},E_{2},\ldots,E_{p}This means that ifEγ=FαGβ,Eγ=FαGβE_{\gamma}=F_{\alpha}\cap G_{\beta},E_{\gamma^{\prime}}=F_{\alpha^{\prime}}\cap G_{\beta^{\prime}}, ofγ<γ\gamma<\gamma^{\prime}it follows thatαα\alpha\leqslant\alpha^{\prime},ββ,α+β<α+β\beta\leqslant\beta^{\prime},\alpha+\beta<\alpha^{\prime}+\beta^{\prime}This shows us, at the same time, that the partitions (6) are obtained from (7) by contraction.

It also follows thatpm,pnp\geqslant m,p\geqslant nTherefore, thatpmax(m,n)p\geqslant\max(m,n)7.
From the previous results we can deduce some properties of the set of constant functions by segments.

The sum and product of two segment-constant functions are segment-constant functions. This property follows immediately if we perform the operations of addition and multiplication on the two functions considered with respect to a common support.

In particular, the constants are segment-constant functions. It follows that the set of segment-constant functions is a linear (vector) set with respect to the usual addition (value by value) of functions and the usual multiplication by a number (real or complex) of functions.

From previous results it also follows that if two functions constant on segments are respectively of degreemmAndnn, their sum and their product are of degreem+n1m+n-1It should be noted that the functions considered can have the effective degreesmmAndnnand, at the same time, their sum and their product of degree 1 (can be constants) without uuu be y thatnnduelconch ofEEand if the functionsf,gf,gare defined by the formulas

f(x)=1+(1)α2 For xEα,α=1,2,,n,g=1ff(x)=\frac{1+(-1)^{\alpha}}{2}\text{ pour }x\in E_{\alpha},\alpha=1,2,\ldots,n,g=1-f

then the sumf+gf+greduces to the constant 1 and the productfgfgto the constant 0.8.
We will say that a segmentEE^{\prime}ofEEis an initial segment (ofEE) if there is no point ofEEto the left of all the points ofEE^{\prime}and similarly we will say that the segmentEE^{\prime}ofEEis a final segment (ofEE) if there is no point ofEEto the right of all points ofEE^{\prime}The empty set (or segment) is not considered an initial or final segment. If (1) is a partition ofEEthe segmentEEast E_{\text{est }}in initial degree andEnE_{n}a final segment ofEE.

A function defined onEEwill be said to be initially constant and finally constant if there exists an initial segment and a final segment ofEE, on which this function is constant. Every constant, and in general, every segment-constant function, is initially constant and also ultimately constant, regardless ofEE.

But, in general, a function is neither initially constant nor ultimately constant. For example, function 1axx(and also any non-constant polynomial) is neither initially constant nor ultimately constant on an open interval. Ifhas=infEEa=\inf E\in E(so ifEE(at a minimum), any function defined onEEis initially constant, since the set {hasa} formed by the single pointhasais an initial segment ofEEand every function is constant at a single point. Similarly, we see that if supEEE\in E(so ifEE(a maximum) any function defined onEEis ultimately constant.

9. We now propose to demonstrate the

THEOREM 2. A necessary and sufficient condition for the functionff, defined on the setEE(having at leastn+1n+1points), or constant
by segments and of degreennis that whatever then+1n+1pointsx1<x2<<xn+1x_{1}<<x_{2}<\ldots<x_{n+1}ofEEone has

α=1n[f(xα)f(xα+1)]=0\prod_{\alpha=1}^{n}\left[f\left(x_{\alpha}\right)-f\left(x_{\alpha+1}\right)\right]=0 (9)

The condition is necessary. Indeed, if (1) is a support tonnterms offfamong the pointsxα,α=1,2,,n+1x_{\alpha},\alpha=1,2,\ldots,n+1There are certainly at least two consecutive ones.xβ,xβ+1x_{\beta},x_{\beta+1}which belong to the same termEαE_{\alpha}and equality (9) is verified.

Before going further, let's prove
Lemma 1. If the condition expressed by equality (9), from Theorem 2, is satisfied, the functionffis ultimately constant.

Let us therefore assume that the condition of Theorem 2 is satisfied and assume that the functionffis not ultimately constant. Therefore, in particular, this function is not constant, and thus there exist pointsx1,x2Ex_{1},x_{2}\in Esuch asx1<x2x_{1}<x_{2}Andf(x1)f(x2)f\left(x_{1}\right)\neq f\left(x_{2}\right)On the final segmentE[x2,)E\cap\left[x_{2},\infty\right)the function is not constant and therefore there is a pointx3x_{3}of this segment, such asx2<x3x_{2}<x_{3}and on whichf(x2)f(x3)f\left(x_{2}\right)\neq f\left(x_{3}\right)We can continue in this way and form the (infinite) increasing sequence.x1,x2,x_{1},x_{2},\ldots, such as one might havef(xα)f(xα+1)f\left(x_{\alpha}\right)\neq\neq f\left(x_{\alpha+1}\right)for everythingα\alphaThis contradicts equality (9) and this contradiction proves lemma 1.

It can be shown in the same way that, under the same conditions, the function is initially constant.

We will now proceed by complete induction to demonstrate the sufficiency of the condition of Theorem 2.

Forn=1n=1the property is true because iff(x1)=f(x2)f\left(x_{1}\right)=f\left(x_{2}\right)for everythingx1,x2Ex_{1},x_{2}\in E, the function is constant and is therefore constant over segments of degree 1.

Let us now suppose thatn>1n>1and that the theorem is proven for constant functions by segments of degreen1n-1Suppose then that the condition expressed by equality (9) is satisfied. LetEE^{\prime}the meeting of all the final segments on which the functionffis constant. According to Lemma 1, the setEE^{\prime}is not empty. So, eitherE=EE^{\prime}=Ethe function is constant onEEand the theorem is proven. Or elseEEE^{\prime}\subset E, SOEEE-E^{\prime}is not empty. We will demonstrate that in this case the functionffis constant by degree segmentsn1n-1onEEE-E^{\prime}Indeed, otherwise, one might findnnpointsx1<x2<<xnx_{1}<x_{2}<<\ldots<x_{n}ofEEE-E^{\prime}such as one might have

α=1n1[f(xα)f(xα+1)]0\prod_{\alpha=1}^{n-1}\left[f\left(x_{\alpha}\right)-f\left(x_{\alpha+1}\right)\right]\neq 0

But on the segmentE[xn,)E\cap\left[x_{n},\infty\right)the function cannot be constant, by definition ofEE^{\prime}We can therefore find a pointxn+1x_{n+1}of this
segment (therefore ofEE), different fromxnx_{n}such asf(xn)f(xn+1)f\left(x_{n}\right)\neq f\left(x_{n+1}\right)The result would bexn<xn+1x_{n}<x_{n+1}And

α=1n[f(xα)f(xα+1)]0\prod_{\alpha=1}^{n}\left[f\left(x_{\alpha}\right)-f\left(x_{\alpha+1}\right)\right]\neq 0

which contradicts equality (9).
This contradiction demonstrates Theorem 2 for segment constant functions of degreenn.

Theorem 2 is therefore proven.
We see, by very slight modifications to the proof, that Theorem 2 also holds ifEEcontains one or both improper points,-\infty,\infty.

The property expressed by Theorem 2 can also be expressed in the form of

THEOREM 3. A necessary and sufficient condition for a function defined on the setEE(having at leastn+1n+1points) is constant by segments of degree n is that this property is satisfied, by the function considered, on every subset ofEEformed byn+1n+1points.
10. In this work we only consider segment-constant functions of finite degree. We can define partitions ofEEwhose terms form an infinite sequence or, more generally, an ordered set of a given ordinal type. To these partitions correspond segment-constant functions of a corresponding type (a kind of degree). It is clear that such functions are only of interest if the ordinal type of the supports is different from that of the ordered set.EEThus, any function defined on a well-ordered set of ordinal numbersω\omega(of an infinite sequence) is obviously constant over segments of degreeω\omegaHowever, not every function defined on the real axis is constant over segments of degreeω\omega.

The notion of an ordered set is taken here in the sense of the ordering of real numbers according to their numerical magnitude. The ordinal type of the partitions, and therefore also the type (the degree) of the corresponding segment constant functions, can be specified as follows. LetIIan ordered subset of the real (ordered) axis.E=EαE=\cup E_{\alpha}is a partition of the ordinal type ofIIif theEαE_{\alpha}are segmentsffofEE, two by two disjoint. IfI=(1,2,,n)I=(1,2,\ldots,n)we have constant functions of degree (finite) through segmentsnn, studied in this work and ifI==(1,2,,n,)=1I==(1,2,\ldots,n,\ldots)=1Following the natural numbers, we have the constant functions by segments of degreeω\omega.

0 0 footnotetext: Received on 18. April 1965.
1965

Related Posts