No Arabic abstract
A function F:R^2->R is sup-measurable if F_f:R->R given by F_f(x)=F(x,f(x)), x in R, is measurable for each measurable function f:R->R. It is known that under different set theoretical assumptions, including CH, there are sup-measurable non-measurable functions, as well as their category analog. In this paper we will show that the existence of category analog of sup-measurable non-measurable functions is independent of ZFC. A similar result for the original measurable case is a subject of a work in prepartion by Roslanowski and Shelah.
A function f:R -> R is approximately continuous iff it is continuous in the density topology, i.e., for any ordinary open set U the set E=f^{-1}(U) is measurable and has Lebesgue density one at each of its points. Denjoy proved that approximately continuous functions are Baire 1., i.e., pointwise For any f:R^2 -> R define f_x(y) = f^y(x) = f(x,y). A function f:R^2 -> R is separately continuous if f_x and f^y are continuous for every x,y in R. Lebesgue in his first paper proved that any separately continuous function is Baire 1. Sierpinski showed that there exists a nonmeasurable f:R^2 -> R which is separately Baire 1. In this paper we prove: Thm 1. Let f:R^2 -> R be such that f_x is approximately continuous and f^y is Baire 1 for every x,y in R. Then f is Baire 2. Thm 2. Suppose there exists a real-valued measurable cardinal. Then for any function f:R^2 -> R and countable ordinal i, if f_x is approximately continuous and f^y is Baire i for every x,y in R, then f is Baire i+1 as a function of two variables. Thm 3. (i) Suppose that R can be covered by omega_1 closed null sets. Then there exists a nonmeasurable function f:R^2 -> R such that f_x is approximately continuous and f^y is Baire 2 for every x,y in R. (ii) Suppose that R can be covered by omega_1 null sets. Then there exists a nonmeasurable function f:R^2 -> R such that f_x is approximately continuous and f^y is Baire 3 for every x,y in R. Thm 4. In the random real model for any function f:R^2 -> R if f_x is approximately continuous and f^y is measurable for every x,y in R, then f is measurable as a function of two variables.
We solve the sup-norm problem for non-spherical Maass forms on an arithmetic quotient of G=SL_2(C) with maximal compact K=SU_2(C) when the dimension of the associated K-type gets large. Our results cover the case of vector-valued Maass forms as well as all the individual scalar-valued Maass forms of the Wigner basis. They establish the first subconvex bounds for the sup-norm problem in the K-aspect in a non-abelian situation and yield sub-Weyl exponents in some cases. On the way, we develop theory of independent interest for the group G, including localization estimates for generalized spherical functions of high K-type and a Paley-Wiener theorem for the corresponding spherical transform acting on the space of rapidly decreasing functions.
A sequence of functions f_n: X -> R from a Baire space X to the reals is said to converge in category iff every subsequence has a subsequence which converges on all but a meager set. We show that if there exists a Souslin Tree then there exists a nonatomic Baire space X such that every sequence which converge in category converges everywhere on a comeager set. This answers a question of Wagner and Wilczynski, Convergence of sequences of measurable functions, Acta Math Acad Sci Hung 36(1980), 125-128.
The Omitting Types Theorem in model theory and the Baire Category Theorem in topology are known to be closely linked. We examine the precise relation between these two theorems. Working with a general notion of logic we show that the classical Omitting Types Theorem holds for a logic if a certain associated topological space has all closed subspaces Baire. We also consider stronger Baire category conditions, and hence stronger Omitting Types Theorems, including a game version. We use examples of spaces previously studied in set-theoretic topology to produce abstract logics showing that the game Omitting Types statement is consistently not equivalent to the classical one.
This paper is an attempt to solve the following problem: given a logic, how to turn it into a paraconsistent one? In other words, given a logic in which emph{ex falso quodlibet} holds, how to convert it into a logic not satisfying this principle? We use a framework provided by category theory in order to define a category of consequence structures. Then, we propose a functor to transform a logic not able to deal with contradictions into a paraconsistent one. Moreover, we study the case of paraconsistentization of propositional classical logic.