Robinson forcing is not absolute

Robinson (or infinite model theoretic) forcing is studied in the context of set theory. The major result is that infinite forcing, genericity, and related notions are not absolute relative to ZFC. This answers a question of G. Sacks and provides a non-trivial example of a non-absolute notion of model theory. This non-absoluteness phenomenon is shown to be intrinsic to the concept of infinite forcing in the sense that any ZFC-definable set theory, relative to which forcing is absolute, has the flavor of asserting self-inconsistency. More precisely: IfT is a ZFC-definable set theory such that the existence of a standard model ofT is consistent withT, then forcing is not absolute relative toT. For example, if it is consistent that ZFC+ “there is a measureable cardinal” has a standard model then forcing is not absolute relative to ZFC+ “there is a measureable cardinal.” Some consequences: 1) The resultants for infinite forcing may not be chosen “effectively” in general. This answers a question of A. Robinson. 2) If ZFC is consistent then it is consistent that the class of constructible division rings is disjoint from the class of generic division rings. 3) If ZFC is consistent then the generics may not be axiomatized by a single sentence ofL _w/w. In Memoriam: Abraham Robinson     

Variation homological diagrams,¶and corner singularities

We describe the general homological framework (the variation arrays and variation homological diagrams) in which can be studied hypersurface isolated singularities as well as boundary singularities and corner singularities from the point of view of duality. We then show that any corner singularity is extension, in a sense which is defined, of the corner singularities of less dimension on which it is built. This framework is also used to rewrite Thom–Sebastiani type properties for isolated singularities and to establish them for boundary singularities. Received: 27 June 2000 / Revised version: 18 October 2000     

Measured creatures

We prove that two basic questions on outer measure are undecidable. First we show that consistently every sup-measurable functionf: ℝ² → ℝ is measurable. The interest in sup-measurable functions comes from differential equations and the question for which functionsf: ℝ² → ℝ the Cauchy problemy′=f(x,y), y(x₀)=y₀ has a unique almost-everywhere solution in the classAC _t(ℝ) of locally absolutely continuous functions on ℝ. Next we prove that consistently every functionf: ℝ → ℝ is continuous on some set of positive outer Lebesgue measure. This says that in a strong sense the family of continuous functions (from the reals to the reals) is dense in the space of arbitrary such functions. For the proofs we discover and investigate a new family of nicely definable forcing notions (so indirectly we deal with nice ideals of subsets of the reals—the two classical ones being the ideal of null sets and the ideal of meagre ones). Concerning the method, i.e., the development of a family of forcing notions, the point is that whereas there are many such objects close to the Cohen forcing (corresponding to the ideal of meagre sets), little has been known on the existence of relatives of the random real forcing (corresponding to the ideal of null sets), and we look exactly at such forcing notions. The first author thanks The Hebrew University of Jerusalem for support during his visits to Jerusalem and the KBN (Polish Committee of Scientific Research) for partial support through grant 2P03A03114. The research of the second author was partially supported by the Israel Science Foundation. Publication 736.     

A free boundary problem for $\infty$–Laplace equation

We consider a free boundary problem for the p-Laplacian describing nonlinear potential flow past a convex profile K with prescribed pressure on the free stream line. The main purpose of this paper is to study the limit as of the classical solutions of the problem above, existing under certain convexity assumptions on a(x). We show, as one can expect, that the limit solves the corresponding potential flow problem for the -Laplacian in a certain weak sense, strong enough however, to guarantee uniqueness. We show also that in the special case the limit is given by the distance function. Received: 10 October 2000 / Accepted: 23 February 2001 / Published online: 19 October 2001     

Hechler’s theorem for the null ideal

We prove the following theorem: For a partially ordered set Q such that every countable subset of Q has a strict upper bound, there is a forcing notion satisfying the countable chain condition such that, in the forcing extension, there is a basis of the null ideal of the real line which is order-isomorphic to Q with respect to set-inclusion. This is a variation of Hechlers classical result in the theory of forcing. The corresponding theorem for the meager ideal was established by Bartoszyski and Kada.Research supported by NSERC. The first author thanks F.D. Tall and the Department of Mathematics at the University of Toronto for their hospitality during the academic year 2003/2004 when the present paper was completed.The second author was supported by Grant-in-Aid for Young Scientists (B) 14740058, MEXT.Mathematics Subject Classification (2000): 03E35, 03E17Revised version: 16 February 2004     

A characterization of graphs which can be approximated in area by smooth graphs

For vector valued maps, convergence in W ^1,1 and of all minors of the Jacobian matrix in L ¹ is equivalent to convergence weakly in the sense of currents and in area for graphs. We show that maps defined on domains of dimension n≥ 3 can be approximated strongly in this sense by smooth maps if and only if the same property holds for the restriction to a.e. 2-dimensional plane intersecting the domain. Received April 29, 1999 / final version received July 21, 2000?Published online September 25, 2000     

The local Rankin-Selberg convolution for GL(n): divisibility of the conductor

Let F be a non-Archimedean local field and an integer. Let be irreducible supercuspidal representations of GL with . One knows that there exists an irreducible supercuspidal representation of GL, with , such that the local constants (in the sense of Jacquet, Piatetskii-Shapiro and Shalika) are distinct. In this paper, we show that, when is an unramified twist of , one may here takem dividingn and , for a prime divisor ofn depending on and the order of : in particular, , where is the least prime divisor of . This follows from a result giving control of certain divisibility properties of the conductor of a pair of supercuspidal representations. Received: 11 November 2000 / Accepted: 15 January 2001 / Published online: 23 July 2001     

A Gentzen-style axiomatization for basic predicate calculus

 We introduce a Gentzen-style sequent calculus axiomatization for Basic Predicate Calculus. Our new axiomatization is an improvement of the previous axiomatizations, in the sense that it has the subformula property. In this system the cut rule is eliminated. Received: 18 April 2000 / Published online: 2 September 2002 Mathematics Subject Classification (2000): Primary 03F05; Secondary 03F99, 03B60 Key words or phrases: Basic predicate calculus – Cut elimination – Sequent     

Iterative methods for solving a poroelastic shell model of Naghdi's type

In this paper, we first formulate a linear quasi‐static poroelastic shell model of Naghdi's type. The model is given in three unknowns: displacement of the middle surface, infinitesimal rotation of the cross section of the shell, and the pressure π. The model has the structure of the quasi‐static Biot's system and can be seen as a system of the shell equation with pressure term as forcing and the parabolic type equation for the pressure with divergence of the filtration velocity as forcing term. On the basis of the ideas of the operator splitting methods, we formulate two sequences of approximate solutions, corresponding to ‘undrained split’ and ‘fixed stress split’ methods. We show that these sequences converge to the solution of the poroelastic shell model. Therefore, the iterations constitute two numerical methods for the model. Moreover, both methods are optimized in a certain sense producing schemes with smallest contraction coefficient and thus faster convergence rates. Also, these convergences imply existence of solutions for the model. Copyright © 2017 John Wiley & Sons, Ltd.     

Computability in structures representing a Scott set

Continuing work begun in [10], we utilize a notion of forcing for which the generic objects are structures and which allows us to determine whether these “generic” structures compute certain sets and enumerations. The forcing conditions are bounded complexity types which are consistent with a given theory and are elements of a given Scott set. These generic structures will “represent” this given Scott set, in the sense that the structure has a certain weak saturation property with respect to bounded complexity types in the Scott set. For example, if ? is a nonstandard model of PA, then ? represents the Scott set ? = n∈ω | ?⊧“the nth prime divides a” | a∈?. The notion of forcing yields two main results. The first characterizes the sets of natural numbers computable in all models of a given theory representing a given Scott set. We show that the characteristic function of such a set must be enumeration reducible to a complete existential type which is consistent with the given theory and is an element of the given Scott set. The second provides a sufficient condition for the existence of a structure ? such that ? represents a countable jump ideal and ? does not compute an enumeration of a given family of sets ?. This second result is of particular interest when the family of sets which cannot be enumerated is ? = Rep[Th(?)]. Under this additional assumption, the second result generalizes a result on TA [6] and on certain other completions of PA [10]. For example, we show that there also exist models of completions of ZF from which one cannot enumerate the family of sets represented by the theory. Received: 8 October 1997 / Published online: 25 January 2001     

Sacks forcing,Laver forcing,and Martin's axiom

Summary In this paper we study the question assuming MA+CH does Sacks forcing or Laver forcing collapse cardinals? We show that this question is equivalent to the question of what is the additivity of Marczewski's ideals ⁰. We give a proof that it is consistent that Sacks forcing collapses cardinals. On the other hand we show that Laver forcing does not collapse cardinals.Research partially supported by NSF grant 8801139     

Adjoining cofinitary permutations (II)

 We construct several forcing models in each of which there exists a maximal cofinitary group, i.e., a maximal almost disjoint group, G≤Sym(ℕ), such that G is also a maximal almost disjoint family in Sym(ℕ). We also ask several open questions in this area in the fourth section of this paper. Received: 25 December 2000 / Revised version: 10 December 2001 Published online: 5 November 2002 Current address:Department of Mathematics, University of Michigan, Ann Arbor, MI, 48109-1109. USA.e-mail: yizhang@umich.edu The author's research on this subject was partially supported by a visiting grant from the Institute Mittag–Leffler, Royal Academy of Science, Sweden and the grant no. 40734 of Academy of Finland. Mathematics Subject Classification (2000): 03E35, 20A15, 20B07, 20B35     

Sweet &; sour and other flavours of ccc forcing notions

We continue developing the general theory of forcing notions built with the use of norms on possibilities, this time concentrating on ccc forcing notions and classifying them.The first author thanks the Hebrew University of Jerusalem for its hospitality during his visits to Jerusalem. His research was also partially supported by a grant from the University Committee on Research of UNOThe research of the second author was partially supported by the Israel Science Foundation. Publication 672Mathematics Subject Classification (2000): Primary 03E35 Secondary; 03E40, 03E05Revised version: 30 September 2003     

Box and Packing Dimensions of Typical Compact Sets

 Let (X,ρ) be a complete metric space and let dim A be the upper box dimension of the set . We show that packing dimension of the typical (in the sense of Baire category) compact set is at least . (Received 27 March 2000; in revised form 5 June 2000)     

Generic compactness reformulated

We point out a connection between reflection principles and generic large cardinals. One principle of pure reflection is introduced that is as strong as generic supercompactness of ₂ by -closed forcing. This new concept implies CH and extends the reflection principles for stationary sets in a canonical way.Mathematics Subject Classification (2000): 03E50, 03E55     

Proper forcing extensions and Solovay models

We study the preservation of the property of being a Solovay model under proper projective forcing extensions. We show that every strongly-proper forcing notion preserves this property. This yields that the consistency strength of the absoluteness of under strongly-proper forcing notions is that of the existence of an inaccessible cardinal. Further, the absoluteness of under projective strongly-proper forcing notions is consistent relative to the existence of a -Mahlo cardinal. We also show that the consistency strength of the absoluteness of under forcing extensions with -linked forcing notions is exactly that of the existence of a Mahlo cardinal, in contrast with the general ccc case, which requires a weakly-compact cardinal.Research partially supported by the research projects BFM2002-03236 of the Spanish Ministry of Science and Technology, and 2002SGR 00126 of the Generalitat de Catalunya. The second author was also partially supported by the research project GE01/HUM10, Grupos de excelencia, Principado de Asturias.Mathematics Subject Classification (2000): 03E15, 03E35     

Local points of twisted Mumford quotients and Shimura curves

We determine over which fields twisted Mumford quotients have rational points. Using the $p$-adic uniformization, we apply these results to Shimura curves, and show some new cases for which the jacobians are even in the sense of [PS]. Mathematics Subject Classification (2000):14G20, 14G35The first author was partially supported by grants from the NSF and PSC-CUNYThe first two authors were partially supported by a joint Binational Israel-USA Foundation grant     

Stiff Oscillatory Systems, Delta Jumps and White Noise

Two model problems for stiff oscillatory systems are introduced. Both comprise a linear superposition of harmonic oscillators used as a forcing term for a scalar ODE. In the first case the initial conditions are chosen so that the forcing term approximates a delta function as and in the second case so that it approximates white noise. In both cases the fastest natural frequency of the oscillators is <e6>OM</e6>(N). The model problems are integrated numerically in the stiff regime where the time-step satisfies The convergence of the algorithms is studied in this case in the limit and For the white noise problem both strong and weak convergence are considered. Order reduction phenomena are observed numerically and proved theoretically. August 25, 1999. Final version received: May 3, 2000.     

Some families of special Lagrangian tori

 We give an explicit proof of the local version of Bryant's result [1], stating that any 3-dimensional real-analytic Riemannian manifold can be isometrically embedded as a special Lagrangian submanifold in a Calabi-Yau manifold. We then refine the theorem proving that a certain class of real-analytic one-parameter families of metrics on a 3-torus can be isometrically embedded in a Calabi-Yau manifold as a one-parameter family of special Lagrangian submanifolds. Two applications of these results show how the geometry of the moduli space of 3-dimesional special Lagrangian submanifolds differs considerably from the 2-dimensional one. First of all, applying Bryant's theorem and a construction due to Calabi we show that nearby elements of the local moduli space of a special Lagrangian 3-torus can intersect themselves. Secondly, we use our examples of one-parameter families to show that in dimension three (and higher) the moduli space of special Lagrangian tori is not, in general, special Lagrangian in the sense of Hitchin [13]. Received: 18 December 2001 / Revised version: 31 January 2002 / Published online: 16 October 2002 Mathematics Subject Classification (2000): 53-XX, 53C38     

The distributivity numbers of /fin and its square

We show that in a model obtained by forcing with a countable support iteration of Mathias forcing of length , the distributivity number of /fin is , whereas the distributivity number of r.o./fin) is . This answers a problem of Balcar, Pelant and Simon, and others.