Related papers: Generalized Egorov's statement for ideals
We consider a generalized version (GES) of the wellknown Severini-Egoroff theorem in real analysis, first shown to be undecidable in ZFC by Tomasz Weiss. This independence is easily derived from suitable hypotheses on some cardinal…
A simple proof of Egorov's theorem for infinite measure is given
We study Egorov ideals, that is ideals on $\omega$ for which the Egorov's theorem for ideal versions of pointwise and uniform convergences holds. We show that a non-pathological $\bf{\Sigma^0_2}$ ideal is Egorov if and only if it is…
We show that contrary to recent papers by S. Albeverio, A. Yu. Khrennikov and V. Shelkovich, point values do not determine elements of the so-called p-adic Colombeau-Egorov algebra uniquely. We further show in a more general way that for an…
We generalize Romanoff's theorem. Also, we obtain a result on sums related to Euler's totient function.
We consider a non-standard version of Egorov's algebra of generalized functions, with improved properties of the generalized scalars and embedding of the Schwartz distributions compared with the original standard Egorov's version. The…
A classical theorem of Menshov states that every measurable function can redefined on a set of arbitrarily small Lebesgue measure, so that the resulting function has uniformly convergent Fourier series. We prove that the same is true if we…
We give a generalization of Fujisawa's theorem in [F]. Our proof of the generalized theorem is purely algebraic and it is simpler than his proof.
It is proved in $\mathsf{ZF}$ (without the axiom of choice) that, for all infinite sets $M$, there are no surjections from $\omega\times M$ onto $\mathscr{P}(M)$.
The Implicit and Inverse Function Theorems are special cases of a general Implicit/Inverse Function Theorem which can be easily derived from either theorem. The theorems can thus be easily deduced from each other via the generalized…
The Egoroff theorem for measurable $\bold X$-valued functions and operator-valued measures $\bold m: \Sigma \to L(\bold X, \bold Y)$, where $\Sigma$ is a $\sigma$-algebra of subsets of $T \neq \emptyset$ and $\bold X$, $\bold Y$ are both…
It is well-known that a strict analogue of the Birkhoff Ergodic Theorem in infinite ergodic theory is trivial; it states that for any infinite-measure-preserving ergodic system the Birkhoff average of every integrable function is almost…
A remarkable theorem of Besicovitch is that an integrable function $f$ on $\mathbb{R}^2$ is strongly differentiable if and only if its associated strong maximal function $M_S f$ is finite a.e. We provide an analogue of Besicovitch's result…
In this paper we prove the theorem on freedom for relatively free Lie algebras with a single relation (analogous with the well-known result of Shirshov) and a generalized Freiheitssatz for relatively free Lie algebras (analogous with the…
We prove a weighted analogue of the Khintchine-Groshev Theorem, where the distance to the nearest integer is replaced by the absolute value. This is subsequently applied to proving the optimality of several linear independence criteria over…
We show that the Fr\"oberg conjecture holds in the second non-trivial degree for an ideal generated by generic forms of degree $d>2$. We also show that the conjecture is true up to degree $2d-1$ provided that the number of variables is…
With a new proof approach we prove in a more general setting the classical convergence theorem that almost everywhere convergence of measurable functions on a finite measure space implies convergence in measure. Specifically, we generalize…
Let $(\xi_n)_{n=0}^\infty$ be a nonhomogeneous Markov chain taking values from finite state-space of $\mathbf{X}=\{1,2,\ldots,b\}$. In this paper, we will study the generalized entropy ergodic theorem with almost-everywhere and…
We show that the theory ZFC-, consisting of the usual axioms of ZFC but with the power set axiom removed-specifically axiomatized by extensionality, foundation, pairing, union, infinity, separation, replacement and the assertion that every…
Geoffrion's theorem is a fundamental result from mathematical programming assessing the quality of Lagrangian relaxation, a standard technique to get bounds for integer programs. An often implicit condition is that the set of feasible…