On Algebraic Properties of the Family of Weakly Świa̧tkowski Functions

In the paper we will focus on weakly Światkowski functions. We say that f satisfies the weak Świa̧tkowski condition (or f is a weakly Świa̧tkowski function) if for all x1,x2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$x_1, x_2$$\end{document} with f(x1)<f(x2)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f(x_1)< f(x_2)$$\end{document} there is a point x between x1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$x_1$$\end{document} and x2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$x_2$$\end{document} such that f(x1)<f(x)<f(x2)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f(x_1)<f(x)< f(x_2)$$\end{document}. This definition is a modification of the Świa̧tkowski condition, in which point x mentioned above has to be a point of continuity of f. In the paper we will examine some properties of weakly Świa̧tkowski functions and consider lineability and algebrability of some families of functions related to them.


Introduction
There are a lot of generalizations of the notion of continuity. One of such generalizations was given in 1978 by Mańk andŚwiątkowski. Their paper [18] was related to sufficient conditions for the monotonicity of a real function defined on a subset of R. Three families of functions were considered there: the Darboux functions (we denote it by D), the Baire one functions and functions fulfilling the condition γ, which was later called theŚwiątkowski condition (see [21]). Mańk andŚwiątkowski showed that those three families of functions: the Darboux functions, the Baire one functions and theŚwiątkowski functions are incomparable. It was shown later that the family ofŚwiątkowski functions is included in the family of cliquish functions. The class ofŚwiątkowski functions is not closed neither under addition nor under uniform convergence. One can find the latest results related to theŚwiątkowski functions in [20], [24] and [25].
Recently, a weaker form of theŚwiątkowski condition was introduced in the paper [6]. An inspiration for this paper comes from the problem presented in the Lviv Scottish Book (http://www.math.lviv.ua/szkocka). Since 2016 it has continued the traditions of the legendary "Scottish Book" (1935)(1936)(1937)(1938)(1939)(1940)(1941), the notebook with open mathematical problems inscribed by mathematicians visiting the famous Scottish Café. Julia Wódka, during her visit to Lviv in 2018 wrote in the Lviv Scotish Book a question, which was originally asked several years ago by Aleksander Maliszewski: Is anyŚwiątkowski function with closed graph continuous? Taras Banakh found this problem interesting and together with Ma lgorzata Filipczak and Julia Wódka answered affirmatively to this question. In fact, it was proved in [6] that any returning function on the real line with closed graph is continuous. It was shown that the class of returning functions is quite wide and contains many known classes of real-valued functions possessing some generalized continuity properties. Particularly, among them one can find theŚwiątkowski functions and a new class of the weaklý Swiątkowski functions.
In this work, we present some new results concerning the weaklý Swiątkowski functions. We will examine the properties of them and we will show that this family is not closed under addition, under uniform limits, under taking maximums or minimums.
In the last section of the paper we will consider the algebrability and lineability of some families referred to the weaklyŚwiątkowski functions and to the cliquish functions.

Properties of the WeaklyŚwiatkowski Functions
Let us begin this section by recalling the definition introduced by Mańk and Swiątkowski.

Definition 1 ([18]). We say that
The family ofŚwiątkowski functions will be denoted byŚ. Banakh, Filipczak and Wódka skipped the requirement that f has to be continuous at the point x and gave the weaker form of the above condition. In fact, in [6] the considered notions were formulated in more general case. In the present paper we will work with functions defined on the real line, which gives the following form of the definition. . We say that f : R → R satisfies the weakŚwiątkowski condition (or f is a weaklyŚwiątkowski function) if for all real It is easy to observe that any function which has a finite number of values is not weaklyŚwiątkowski. EvidentlyŚ ⊂ wŚ, where wŚ stands for the family of weaklyŚwiątkowski functions. The next simple example shows that this inclusion is proper.

Example 3. Any function of the form
is weaklyŚwiątkowski for any real positive numbers α, β.
Obviously, the above function is not aŚwiątkowski function. It is not cliquish either. A function f : 23]). We will use the equivalent condition more convenient for us: a function is cliquish if and only if the set of its continuity points is dense. So f from Example 3 is not cliquish as it is continuous only at x = 0. It is known, that anyŚwiątkowski function is cliquish and the inclusionŚ C q is proper, but as we see the families C q and wŚ are incomparable. Note that all Darboux functions are weaklyŚwiątkowski and the inclusion D ⊂ wŚ is proper, as the function f from Example 3 does not have the Darboux property (see Fig. 1).
Another example of a weaklyŚwiątkowski function (which is not Swiątkowski) is so called everywhere surjective function, i.e. a function with the property that for every nontrivial open interval I its image under this function is equal to R. Any everywhere surjective function is weaklyŚwiątkowski and has the Darboux property.
Of course the family wŚ is not closed under addition. Moreover, it is known that any real function can be presented as a sum of two Darboux functions, so it is also a sum of two weaklyŚwiątkowski functions. On the other hand, even adding a linear function to the weaklyŚwiątkowski function can give us a function which does not belong to the family wŚ. We will show much more -that there is a function f ∈ wŚ such that for any nonzero a the function f + a · id is not weaklyŚwiątkowski (this property is called linear sensitivity, see [9]). Proof. Consider the function It is easy to check that f ∈ wŚ. Let us put g(x) = f (x) + ax, a ∈ R (its graph for positive a is on Fig. 2). Then The vertex of the parabola y = (x + a)x is at the point x w = − a 2 , one xintercept is x 0 = −a. Analogously for the second parabola y = (−x + a)x: x w = a 2 , x 0 = a. Both curves are tangent at x = 0 (which is another xintercept of both parabolas).
It is not difficult to see that g ∈ wŚ. Indeed, take any number x 1 ∈ Q ∩ − a 2 , 0 and x 2 ∈ R\Q such that x 2 ∈ (x 1 , 0). Then there is no point x ∈ (x 1 , x 2 ) for which g(x) lies between g(x 1 ) and g(x 2 ).
For a given family F ⊂ R R we denote by M a (F) the maximal additive class of F, i.e.
It is easy to see that if f ≡ 0 belongs to F, then M a (F) ⊂ F. It is known that the family Const of constant functions is the maximal additive family for the class of Darboux functions which was shown in 1931 by Radaković ([22]). We will show the analogous result for the family of weaklyŚwiątkowski functions.  Proof. Firstly observe that if f ∈ wŚ, x 0 ∈ R and k is any positive number, then the function is weaklyŚwiątkowski and, evidently, −g is weaklyŚwiątkowski, too.
Suppose that f ∈ M a (wŚ) and f is not constant, so we can find a, b ∈ R such that f (a) < f(b). Since f is weaklyŚwiątkowski, then there is Then f − g is not weaklyŚwiątkowski, which is a contradiction. Obviously, Const ⊂ M a (wŚ), which finishes the proof.

Example 6.
There exist functions f, g ∈ wŚ such that min(f, g) / ∈ wŚ and Let us take functions: Then and min(f, g) / ∈ wŚ and f 2 / ∈ wŚ. As we see the minimum of two weaklyŚwiątkowski functions may not be weaklyŚwiątkowski even if one of these functions is constant. Analogous result can be obtained for maximum of two weaklyŚwiątkowski functions.
It is known (see [15]) that for any real function f : R → R there exists a sequence of Darboux functions (so also weaklyŚwiątkowski functions) convergent to f , hence the pointwise limits of weaklyŚwiątkowski functions give us the set R R . The situation is more interesting when we consider the uniform limit.
Example 7. The family wŚ is not closed under uniform limit.
Lets us define the sequence (h n ) n∈N : For any n ∈ N , h n is weaklyŚwiątkowski and evenŚwiątkowski. Observe that (h n ) n∈N is uniformly convergent to the function which is not weaklyŚwiątkowski.
By wŚ we will denote the family of functions from R R fulfilling the condition where I(a, b) is the open interval with ends a and b. If we additionaly demand that the point x ∈ I(a, b) is a continuity point of f , then we obtain an analogous family forŚwiątkowski functions (it was examined in [25]).
for any real x. Particularly (1) holds for a and b, so Because ε < f(b) − f (a), from the above inequalities we have  (1) and (2) to the last inequality we obtain and from the arbitrariness of ε, f ∈ wŚ.
Note that wŚ R R . Indeed, the inclusion is proper as the function is not in the family wŚ.
Observation 9. If f ∈ wŚ and g ∈ D, then f •g ∈ wŚ. There exist f ∈ wŚ and g ∈ C, such that g • f / ∈ wŚ (C stands for the family of continuous functions). g(b)). The function g has the Darboux property, so in the interval (a, b) there is a point x such that g(x) = z which finishes the proof of the first part of our observation. If we change the order of functions in the composition, then the obtained function may not be weaklyŚwiątkowski. Indeed, take the functions Then g • f = |f | is not a weaklyŚwiątkowski function.

Algebrability and Lineability
The question whether the family of functions having some special properties contains a large algebraic structure has become important in the last few years. This problem is connected with so-called lineability and algebrability of sets in function spaces. It is particularly interesting if the considered family is not closed with respect to some algebraic operations. Among others the following families of functions were examined: the family of continuous nowhere differentiable functions, the family of differentiable nowhere monotone functions, the family of everywhere surjective functions and the family of functions having a finite number of continuity points.
One of the first papers in this research was [2], in which the notion of lineability was introduced and examined. The wider survey one can find in [1],  [8] or [14], and in the earlier paper [3]. For a given cardinal κ, a subset M of a linear space V is κ-lineable if M ∪ {0} contains a linear subspace of dimension κ. The typical way of proving κ-lineability (in particular c -lineability) of M is to construct a set of cardinality κ of linearly independent elements of M and to show that any linear combination of them belongs to M . In the field of algebrability one of the first results was related to the space of everywhere surjective functions ( [4]) and the space of continuous functions which are nowhere differentiable ( [13]). The authors have proved that such function spaces contain the infinitely generated algebras.
Let us take a cardinal κ. We will say that a subset A of a commutative algebra is κ-algebrable if A ∪ {0} contains a κ-generated algebra B, i.e. the minimal cardinality of a set of generators of B is equal to κ.
In [10] A. Bartoszewicz and S. G lab introduced the notion of strong algebrability which does not coincides with the algebrability. For a cardinal κ, we say that A is a κ-generated free algebra if there exists a subset X = {x α : α < κ} of A such that any function f from X to some algebra A can be uniquely extended to a homomorphism from A into A . Then X is called a set of free generators of the algebra A. A subset X = {x α : α < κ} of a commutative algebra B generates a free subalgebra A if and only if for each polynomial P in n variables without a constant term and for any x α1 , x α2 , . . . , x αn we have P (x α1 , x α2 , . . . , x αn ) = 0 if and only if P = 0. We say that a subset E of a commutative linear algebra B is strongly κ-algebrable if there exists a κ-generated free algebra A contained in E ∪ {0}. In the case of algebrability, P (x α1 , x α2 , . . . , x αn ) can be equal to zero even for a nonzero polynomial P .
There are subsets of linear algebras which are algebrable but not strongly algebrable, for instance c 00 (the family of all sequences from c 0 with real terms equal to zero from some place) is algebrable but not strongly 1-algebrable ( [10]). The analogous result holds for the family of functions having finite numbers of values ( [5]). Now we will consider algebrability of some families of functions referring to the weaklyŚwiątkowski condition. In particular we firstly consider the classes wŚ \ C q , wŚ ∩ C q and C q \ wŚ. Let us observe that the classes C q and wŚ have the cardinality 2 c . It was proved in [11] that the family EDD of everywhere discontinuous Darboux functions (i.e. functions which are nowhere continuous and have the Darboux property) is strongly 2 c -algebrable. From inclusions EDD D wŚ and by equality EDD ∩ C q = ∅ we obtain the first result.
Moreover, by [11] it follows that we can make the large algebra contained in wŚ \ C q consisting of the measurable functions, of the Baire functions or of the functions measurable in both ways, and even of the perfectly everywhere surjective functions ( [11], Thm. 3.6 and 3.7). Recall that perfectly everywhere surjective functions are not measurable and do not have the Baire property. To show the strong 2 c -algebrability of the classes wŚ ∩ C q and C q \ wŚ we use the following result from [11]. Let X be a set of cardinality c and I be a bounded or unbounded interval in R. Assume that F is a family of subsets of X such that card(F) = c and for each F ∈ F we have also card(F ) = c. Then by Theorem 2.2 [11], the family SES(I, F) is strongly 2 c -algebrable. The proof of the above theorem is based on Theorem 2.1 from [11] and on so called the Disjoint Refinement Lemma. Recall that the authors of [11] call a function f ∈ R R I-strongly everywhere surjective with respect to F (in short f ∈ SES(I, F)) if for any F ∈ F there exist n ∈ N and a polynomial P in n variables without a constant term such that f (F ) = P (I n ) and for any y ∈ f (F ), card {x : x ∈ F and f (x) = y} = c. It is not difficult to check that f (F ) is equal to g(I) for some function in one variable defined by polynomial P . However, we decide to use the formula f (F ) = P (I n ) to apply theorems from [11] which were formulated in this language.
Let us observe that if I = R and F consists of all nonempty open sets in R then SES(R, F) ⊂ EDD(R). Now we are able to prove the following. Theorem 11. The families wŚ ∩ C q and C q \ wŚ are strongly 2 c -algebrable.
Proof. Let C be a Cantor type set (nowhere dense and perfect). Let C 0 consist of elements of C which are the ends of the gaps of C. To show the strong 2 c -algebrability of wŚ ∩ C q let us take X = C \ C 0 and F = {X ∩ G : G is an open set and X ∩ G is nonempty}. In fact it means that X ∩ G is a nonempty open set in C. By Theorem 1.2 from [11] we construct a 2 cgenerated free algebra A consisting of SES(R, F)-functionsf on X. Let A 1 be the algebra of functions of the form: Observe that R \ C is a dense open set and f is continuous exactly on R \ C. Hence f is cliquish. Moreover, f is Darboux so it is weaklý Swiątkowski. Now let A 2 be the algebra of functions of the form: Now we obtain a 2 c -generated free algebra containing in C q \wŚ. Indeed, if x is the end of the gap (a, x) in C then for all points t between a and x we have f (t) = 0 and f (x) = 1. Of course f is continuous exactly on R \ C, hence it is cliquish.
Strongly 2 c -algebrable families from Theorem 10 and 11 are presented on Fig. 3.  Figure 3. Strongly 2 c -algebrable families: wŚ \ C q , wŚ ∩ C q and C q \ wŚ In the next theorems we will use "the independent dense sets method" presented in [7]. To describe this method let us start with the classic Fichtenholz-Kantorovich theorem.
Having the independent family of sets, we can define 2 c linearly independent functions: for α < c, let g α : B α → R be a nonzero function defined on a The family {f ξ : ξ < 2 c } is linearly independent, because the linear combination of functions from this family with nonzero coefficients can not be a zero one as on one set B α it is not equal to zero. The algebra generated by {f ξ : ξ < 2 c } can not have κ generators with κ < 2 c . We show it in the next lemma, which is probably well known, but for the convenience of the reader we present its short proof.

Lemma 13 If an algebra A contains a linearly independent family of power κ and κ is an uncountable cardinal number, then the minimal power of set of generators of A is equal to κ.
Proof Let G = {g α : α < τ} be a set of generators of the algebra A. Then A consists of linear combinations of products g α1 · g α2 · . . . · g αm where g αi ∈ G and the elements g α1 , . . . , g αm from this product may not be different. Any linear base of algebra A is always also a set of generators of this algebra, so τ ≤ κ ≤ τ <ω . If κ is uncountable, then τ <ω is also uncountable. Therefore τ <ω = τ and consequently κ = τ which completes the proof.
Observe that the family of polynomials in one variable without a constant term is generated by the set of one element {x}, so the assumption that κ > ω in the above lemma is essential.
Note that each of the functions P s can be the zero function, even if P is a nonzero polynomial. Hence constructed algebra is not a free algebra. Finally, by spanning the algebra by the functions {f ξ : ξ < 2 c } and using the fact that this set is linearly independent, we obtain an algebra of 2 c generators. This method of proving 2 c -algebrability with the independent family of Bernstein sets was introduced in [12] and widely applied in [7] and later in [19].
. .} be a dense set and {B n α : α < c ∧ n ∈ N} be a decomposition of R into c pairwise disjoint dense sets. We put B α = n B n α and It is evident that this function is not Darboux because it has only denumerable set of values. It is not cliquish either, as it is everywhere discontinuous, but it is weaklyŚwiątkowski. The last property follows from the density of used sets. Indeed, let {N ξ : ξ < 2 c } be an independent family in c described earlier and define f ξ by the presented earlier formula: ] is equal to D ∪ {0} for any interval (x 1 , x 2 ). Let us take any nonzero polynomial P in n variables without a constant term and put F = P (f ξ1 , . . . , f ξn ). Then F is not Darboux, because it has only denumerable set of values. Evidently F is not cliquish, because it is everywhere discontinuous. We will show that F ∈ wŚ. Observe that F is constant on each set B α , so P (f ξ1 , . . . , f ξn )| Bα is of the form P (ε 1 g α , . . . , ε n g α ) = P s (g α ), where s = (ε 1 , . . . , ε n ) ∈ {0, 1} n and P s is a polynomial of one variable without the constant term. Let us take x 1 and x 2 such that 0 = F (x 1 ) < F (x 2 ). The range of the polynomial is a dense set so in the interval with ends x 1 and x 2 we can find a point x such that F (x) is between F (x 1 ) and F (x 2 ).
Assume now that F (x 1 ) = 0 and F (x 2 ) = 0. This means that points x 1 , x 2 belong to different sets B α and F ( If P s1 has not the global maximum at d then in the right-side neighbourhood of  Figure 4. The sets wŚ \ (D ∪ C q ) and R R \ (wŚ ∪ C q ) are 2 c -algebrable polynomials do not have constant terms, so P s1 (0) = P s2 (0) = 0. Hence, P s1 (d ) ≥ 0 and P s2 (d ) ≤ 0 and consequently P s2 (d ) ≤ P s1 (d ) which is impossible. Finally F is weaklyŚwiątkowski, which completes the proof (see left part of Fig. 4).
In [9] we showed among others the c-lineability of the family of functions linearly sensitive toŚwiątkowski condition. Now we will show the same result for the family of functions linearly sensitive to weakŚwiątkowski condition. Let us recall the theorem used in [9]. An easy proof of it is based on Theorem 12.
Theorem 16 (Theorem 2, [9]). Let M ⊂ R [0,1] . Assume that there exists a sequence ([a n , b n ]) n∈N of closed disjoint intervals contained in [0, 1] and a sequence (F n ) n∈N of functions F n : [a n , b n ] → R such that for any A ⊂ N and any bounded nonzero sequence of reals (α i ) i∈A , the function belongs to M . Then M is c-lineable.
In Theorem 4 we have presented a simple example of a function which is linearly sensitive with respect to the weakŚwiątkowski condition, but in the next proof we have to use some more complicated example of such a function.

Theorem 17
The family of functions linearly sensitive with respect to the weaḱ Swiątkowski condition is c-lineable. Proof We will take the functions defined in the proof of Theorem 7 [9] as follows: We will modify the function F 1 so that the function we are searching for belongs to wŚ \Ś. Now let the second function F 2 : − 1 2 , 1 2 → [1, 2] be defined as follows . . affine otherwise and we put is weaklyŚwiątkowski but notŚwiątkowski. The graph of F is presented on Fig. 5. Analogously as in Theorem 7 [9] we prove that F is linearly sensitive to weakŚwiątkowski condition.
Consider the function F + a · id for a > 0 (the graph of such function is on Fig. 6). Note that the parabola y = x 2 + ax has the vertex at − a 2 (see Fig. 6).
Therefore, for k such that 1 2k−1 < a 2 , x 1 = − 1 2k−1 and x 2 = 0 there is no x ∈ (x 1 , x 2 ) such that F (x) lies between F (x 1 ) and F (x 2 ). Hence F +a·id does not satisfy theŚwiątkowski condition. For a < 0 the situation is symmetrical. Although the next part of the proof is analogous as in [9], we shortly present its sketch for the convenience of the reader. To apply Theorem 16 we fix a sequence of intervals {[a n , b n ] : n = 1, 2, . . .} such that 0 ≤ a 1 < b 1 < a 2 < b 2 < . . . < 1 and observe that for any n the function G n : [a n , b n ] → R defined by the formula G n (x) = G 2(x − a n ) b n − a n − 1 is a function linearly sensitive to the weakŚwiątkowski condition and G n (a n ) = G n (b n ) = 0. Let us take an arbitrary set A ⊂ N and any bounded sequence (α i ) i∈A of nonzero numbers. The function is linearly sensitive to the weakŚwiątkowski condition. It is easy to check that G αi,A is weaklyŚwiątkowski, but for any a = 0 the function G αi,A + a · id does not fulfill the weakŚwiątkowski condition. This finishes the proof.
Funding Not applicable.
Data availability and materials Not applicable.

Conflict of interest
The authors declare that they have no conflict of interest.
Code availability Not applicable.
Open Access. This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons. org/licenses/by/4.0/.