Superatomic Boolean algebras constructed from strongly unbounded functions

Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that κ, λ are infinite cardinals such that κ^{++ +} ≤ λ, κ^<κ = κ and 2^κ = κ⁺, and η is an ordinal with κ⁺ ≤ η < κ⁺⁺ and cf(η) = κ⁺. Then, in some cardinal‐preserving generic extension there is a superatomic Boolean algebra $\mathcal BUsing Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that κ, λ are infinite cardinals such that κ^{++ +} ≤ λ, κ^<κ = κ and 2^κ = κ⁺, and η is an ordinal with κ⁺ ≤ η < κ⁺⁺ and cf(η) = κ⁺. Then, in some cardinal‐preserving generic extension there is a superatomic Boolean algebra $\mathcal B$ such that $\mathrm{ht}(\mathcal B) = \eta + 1$, $\mathrm{wd}_{\alpha }(\mathcal B) = \kappa$ for every α < η and $\mathrm{wd}_{\eta }(\mathcal B) = \lambda$(i.e., there is a locally compact scattered space with cardinal sequence 〈κ〉_η^??〈λ〉). Especially, $\langle {\omega }\rangle _{{\omega }_1}{}^{\smallfrown } \langle {\omega }_3\rangle$ and $\langle {\omega }_1\rangle _{{\omega }_2}{}^{\smallfrown } \langle {\omega }_4\rangle$ can be cardinal sequences of superatomic Boolean algebras.     

Reduced products which are not saturated

Summary IfT is a complete theory of Boolean algebra, then we writeA ⊲_T B to denote that for every cardinal κ and every κ-regular filter over a setI such that the Boolean algebra 2 _F ^I of all subsets ofI reduced byF is a model ofT, the reduced powerA _F ^I isK ⁺-saturated wheneverB _F ^I isK ⁺-saturated. The relation ⊲_T generalizes the relation ◃ introduced by Keisler. As in the case of Keisler's ◃ it happens that ⊲_T’s are relations between complete theories, i.e. ifA≡B thenA ⊲_T B andB ⊲_T A. In this paper some examples of theories which are maximal (minimal) with respect to ⊲_T’s are provided and the relations ⊲_T are compared with each other. Presented by J. Mycielski     

On <Emphasis Type="Italic">α</Emphasis>-complete retracts of specker lattice ordered groups

Let α be a cardinal. The notion of α-complete retract of a Boolean algebra has been studied by Dwinger. Specker lattice ordered groups were investigated by Conrad and Darnel. Assume that G is a Specker lattice ordered group generated by a Boolean algebra B(G). The notion of α-complete retract of G can be defined analogously as in the case of Boolean algebras. In the present paper we deal with the relations between α-complete retracts of G and α-complete retracts of B(G).     

Complexity of some natural problems on the class of computable I-algebras

We study computable Boolean algebras with distinguished ideals (I-algebras for short). We prove that the isomorphism problem for computable I-algebras is Σ ₁ ¹ -complete and show that the computable isomorphism problem and the computable categoricity problem for computable I-algebras are Σ ₃ ⁰ -complete.     

On the reconstruction of boolean algebras from their automorphism groups

A Boolean algebraB is called faithful, if for every direct summandB ₁ ofB: ifB ₁ is rigid, (that is, it does not have any automorphisms other than the identity), then there isB ₂ such thatBB ₁×B ₁×B ₁×B ₂. LetB be a complete Boolean algebra, thenB can be uniquely represented asBB ^R×B ^D×B ^D×B ^F, whereB ^R,B ^D,B ^F are pairwise totally different, (that is, no two of them have non-zero isomorphic direct summands),B ^R,B ^D are rigid andB ^F is faithful. Aut(B) denotes the automorphism group ofB.I thank the NSF for supporting this research by a grant.     

Comparison of Boolean algebras

In this work, some results related to superatomic Boolean interval algebras are presented, and proved in a topological way. Let x be an uncountable cardinal. To each I x, we can associate a superatomic interval Boolean algebra B _I of cardinality x in such a way that the following properties are equivalent: (i) I I x, (ii) B _I is a quotient algebra of B _J, and (iii) there is an homomorphism f from B _J into B _I such that for every atom b of B _I, there is an atom a of B _J satisfying f(a)=b. As a corollary, there are 2 ^x isomorphism types of superatomic interval Boolean algebras of cardinality x. This case is quite different from the countable one.     

A Rank Theorem of Operators between Banach Spaces

Suppose that E and F are two Banach spaces and that B(E, F) is the space of all bounded linear operators from E to F. Let T ₀∈B(E, F) with a generalized inverse T ₀ ⁺∈B(F, E). This paper shows that, for every T∈B(E, F) with ‖T ₀ ⁺ (T−T ₀)‖<1, B ≡ (I + T ₀ ⁺(T−T ₀))⁻¹ T ₀ ⁺ is a generalized inverse of T if and only if (I−T ₀ ⁺ T ₀)N(T) = N(T ₀), where N(·) stands for the null space of the operator inside the parenthesis. This result improves a useful theorem of Nashed and Cheng and further shows that a lemma given by Nashed and Cheng is valid in the case where T ₀ is a semi-Fredholm operator but not in general.     

Definability of Geometric Properties in Algebraically Closed Fields

We prove that there exists no sentence F of the language of rings with an extra binary predicat I₂ satisfying the following property: for every definable set X ? ?², X is connected if and only if (?, X) ? F, where I₂ is interpreted by X. We conjecture that the same result holds for closed subset of ?². We prove some results motivated by this conjecture.     

Indestructibility,HOD, and the Ground Axiom

Let φ₁ stand for the statement V = HOD and φ₂ stand for the Ground Axiom. Suppose T_i for i = 1, …, 4 are the theories “ZFC + φ₁ + φ₂,” “ZFC + ¬φ₁ + φ₂,” “ZFC + φ₁ + ¬φ₂,” and “ZFC + ¬φ₁ + ¬φ₂” respectively. We show that if κ is indestructibly supercompact and λ > κ is inaccessible, then for i = 1, …, 4, A_i = _df{δ < κ∣δ is an inaccessible cardinal which is not a limit of inaccessible cardinals and V_δ?T_i} must be unbounded in κ. The large cardinal hypothesis on λ is necessary, as we further demonstrate by constructing via forcing four models in which A_i = ?? for i = 1, …, 4. In each of these models, there is an indestructibly supercompact cardinal κ, and no cardinal δ > κ is inaccessible. We show it is also the case that if κ is indestructibly supercompact, then V_κ?T₁, so by reflection, B₁ = _df{δ < κ∣δ is an inaccessible limit of inaccessible cardinals and V_δ?T₁} is unbounded in κ. Consequently, it is not possible to construct a model in which κ is indestructibly supercompact and B₁ = ??. On the other hand, assuming κ is supercompact and no cardinal δ > κ is inaccessible, we demonstrate that it is possible to construct a model in which κ is indestructibly supercompact and for every inaccessible cardinal δ < κ, V_δ?T₁. It is thus not possible to prove in ZFC that B_i = _df{δ < κ∣δ is an inaccessible limit of inaccessible cardinals and V_δ?T_i} for i = 2, …, 4 is unbounded in κ if κ is indestructibly supercompact. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

The Jacobian conjecture,the <Emphasis Type="Italic">d</Emphasis>-inversion approximation and its natural boundary

Let F ? \mathbbC[ X, Y ]² F \in \mathbb{C}{\left[ {X,\,Y} \right]^2} be an étale map of degree deg F = d. An étale map G ? \mathbbC[ X,Y ]² G \in \mathbb{C}{\left[ {X,Y} \right]^2} is called a d-inverse approximation of F if deg G ≤ d and F ◦ G =(X + A(X, Y), Y + B(X, Y)) and G ◦ F =(X + C(X, Y), Y + D(X, Y)), where the orders of the four polynomials A, B, C, and D are greater than d. It is a well-known result that every \mathbbC² {\mathbb{C}^2} -automorphism F of degree d has a d-inverse approximation, namely, F ⁻¹. In this paper, we prove that if F is a counterexample of degree d to the two-dimensional Jacobian conjecture, then F has no d-inverse approximation. We also give few consequences of this result. Bibliography: 18 titles.     

On Poset Boolean Algebras

Let (P,≤) be a partially ordered set. The poset Boolean algebra of P, denoted F(P), is defined as follows: The set of generators of F(P) is {x _p  : p∈P}, and the set of relations is {x _p ⋅x _q =x _p  : p≤q}. We say that a Boolean algebra B is well-generated, if B has a sublattice G such that G generates B and (G,≤ ^B |G) is well-founded. A well-generated algebra is superatomic. THEOREM 1. Let (P,≤) be a partially ordered set. The following are equivalent. (i) P does not contain an infinite set of pairwise incomparable elements, and P does not contain a subset isomorphic to the chain of rational numbers, (ii) F(P) is superatomic, (iii) F(P) is well-generated. The equivalence (i) ⇔ (ii) is due to M. Pouzet. A partially ordered set W is well-ordered, if W does not contain a strictly decreasing infinite sequence, and W does not contain an infinite set of pairwise incomparable elements. THEOREM 2. Let F(P) be a superatomic poset algebra. Then there are a well-ordered set W and a subalgebra B of F(W), such that F(P) is a homomorphic image of B. This is similar but weaker than the fact that every interval algebra of a scattered chain is embeddable in an ordinal algebra. Remember that an interval algebra is a special case of a poset algebra. This revised version was published online in June 2006 with corrections to the Cover Date.     

Long time existence for a slightly perturbed vortex sheet

Consider a flat two-dimensional vortex sheet perturbed initially by a small analytic disturbance. By a formal perturbation analysis, Moore derived an approximate differential equation for the evolution of the vortex sheet. We present a simplified derivation of Moore's approximate equation and analyze errors in the approximation. The result is used to prove existence of smooth solutions for long time. If the initial perturbation is of size ? and is analytic in a strip |??m γ| < ρ, existence of a smooth solution of Birkhoff's equation is shown for time t < k2p, if ? is sufficiently small, with κ → 1 as ? → 0. For the particular case of sinusoidal data of wave length π and amplitude e, Moore's analysis and independent numerical results show singularity development at time t^c = |log ?| + O(log|log ?|. Our results prove existence for t < κ|log ?|, if ? is sufficiently small, with k κ → 1 as ? → 0. Thus our existence results are nearly optimal.     

On a superatomic Boolean algebra which is not generated by a well-founded sublattice

Let b denote the unboundedness number of ω^ω. That is, b is the smallest cardinality of a subset such that for everyg∈ω^ω there isf ∈ F such that {n: g(n) ≤ f(n)}is infinite. A Boolean algebraB is wellgenerated, if it has a well-founded sublatticeL such thatL generatesB. We show that it is consistent with ZFC that , and there is a Boolean algebraB such thatB is not well-generated, andB is superatomic with cardinal sequence 〈ℵ₀, ℵ₁, ℵ₁, 1〉. This result is motivated by the fact that if the cardinal sequence of a Boolean algebraB is 〈ℵ₀, ℵ₀, λ, 1〉, andB is not well-generated, then λ≥b.     

The strong closure of $\sigma$-complete Boolean algebras of projections

A result of T. A. Gillespie implies that the strong operator closure of any abstractly s\sigma -complete Boolean algebra of projections in a Banach space X which does not contain a copy of c₀ is Bade complete. It is shown that the same conclusion is valid for another (extensive) class of Banach spaces X, namely those which are weakly compactly generated. As a consequence, it follows that a Boolean algebra of projections in a separable Banach space is abstractly s\sigma -complete iff it is abstractly complete. It is also shown that a Banach space X has the property that the strong closure of every abstractly complete Boolean algebra of projections in X is Bade complete iff X does not contain a copy of l^￥\ell ^\infty \!.     

Baer subplanes generated by collineations between pencils of lines

In this paper we define a degenerateC _F-set in PG (2,q ²) as the set of points of intersection of corresponding lines under a suitable collineation between two pencils of lines with vertices two distinct pointsA andB mapping the lineA ∨B onto itself. We prove that every such a set is the union of the lineA ∨B and a Baer subplane and vice versa every Baer subplane can be seen as a subset of a degenerateC _F-set.     

On differentiable area-preserving maps of the plane

F: ℝ² → ℝ² is an almost-area-preserving map if: (a) F is a topological embedding, not necessarily surjective; and (b) there exists a constant s > 0 such that for every measurable set B, μ(F(B)) = sμ(B) where μ is the Lebesgue measure. We study when a differentiable map whose Jacobian determinant is nonzero constant to be an almost-area-preserving map. In particular, if for all z, the eigenvalues of the Jacobian matrix DF _z are constant, F is an almost-area-preserving map with convex image.     

Exact Pairs for Abstract Bounded Reducibilities

In an attempt to give a unified account of common properties of various resource bounded reducibilities, we introduce conditions on a binary relation ≤_r between subsets of the natural numbers, where ≤_r is meant as a resource bounded reducibility. The conditions are a formalization of basic features shared by most resource bounded reducibilities which can be found in the literature. As our main technical result, we show that these conditions imply a result about exact pairs which has been previously shown by Ambos-Spies [2] in a setting of polynomial time bounds: given some recursively presentable ≤_r-ideal I and some recursive ≤_r-hard set B for I which is not contained in I, there is some recursive set C, where B and C are an exact pair for I, that is, I is equal to the intersection of the lower ≤_r-cones of B and C, where C is not in I. In particular, if the relation ≤_r is in addition transitive and there are least sets, then every recursive set which is not in the least degree is half of a minimal pair of recursive sets.     

Reaction-Diffusion Equations with Polynomial Drifts Driven by Fractional Brownian Motions

A reaction-diffusion equation on [0, 1] ^d with the heat conductivity κ > 0, a polynomial drift term and an additive noise, fractional in time with H > 1/2, and colored in space, is considered. We have shown the existence, uniqueness and uniform boundedness of solution with respect to κ. Also we show that if κ tends to infinity, then the corresponding solutions of the equation converge to a process satisfying a stochastic ordinary differential equation.     

Lattice-universal Orlicz spaces on probability spaces

Lattice-universal Orlicz function spacesL ^F _α,β[0, 1] with prefixed Boyd indices are constructed. Namely, given 0<α<β<∞ arbitrary there exists Orlicz function spacesL ^F _α,β[0, 1] with indices α and β such that every Orlicz function spaceL ^G [0, 1] with indices between α and β is lattice-isomorphic to a sublattice ofL ^F _α,β[0, 1]. The existence of classes of universal Orlicz spacesl ^Fα,β(I) with uncountable symmetric basis and prefixed indices α and β is also proved in the uncountable discrete case. Partially supported by BFM2001-1284.