Past Logic Seminar

 

Given a finite set X, is an easy exercise to show that a binary operation * from XxX to X which is injective in each variable separately, and which is also associative, makes (X,*) into a group. Hrushovski and others have asked what happens if * is only partially associative - do we still get something resembling a group? The answer is known to be yes (in a strong sense) if almost all triples satisfy the associative law. In joint work with Tim Gowers, we consider the so-called `1%' regime, in which we only have an epsilon fraction of triples satisfying the associative law. In this regime, the answer turns out to be rather more subtle, involving certain group-like structures which we call rough approximate groups. I will discuss these objects, and try to give a sense of how they arise, by describing a somewhat combinatorial interpretation of partial associativity.
 

We take a look at difference fields with several commuting automorphisms. The theory of difference fields with one distinguished automorphism has a model companion known as ACFA, which Zoe Chatzidakis and Ehud Hrushovski have studied in depth. However, Hrushovski has proved that if you look at fields with two or more commuting automorphisms, then the existentially closed models of the theory do not form a first order model class. We introduce a non-elementary framework for studying them. We then discuss how to generalise a result of Kowalski and Pillay that every definable group (in ACFA) virtually embeds into an algebraic group. This is joint work in progress with Zoe Chatzidakis and Nick Ramsey.

   It is a long-standing open problem whether the ring of integers Z has an existential first-order definition in Q, the field of rational numbers. A few years ago, Jochen Koenigsmann proved that Z has a universal first-order definition in Q, building on earlier work by Bjorn Poonen. This result was later generalised to number fields by Jennifer Park and to global function fields of odd characteristic by Kirsten Eisenträger and Travis Morrison, who used classical machinery from number theory and class field theory related to the behaviour of quaternion algebras over global and local fields.

   In this talk, I will sketch a variation on the techniques used to obtain the aforementioned results. It allows for a relatively short and uniform treatment of global fields of all characteristics that is significantly less dependent on class field theory. Instead, a central role is played by Hilbert's Reciprocity Law for quaternion algebras. I will conclude with an example of a non-global set-up where the existence of a reciprocity law similarly yields universal definitions of certain subrings.

I will be talking of recent results by Ayse Berkman and myself, as well as about a more general program of research in this area.

I will present joint work with A. Pillay on the theory of NIP formulas in arbitrary groups, which exhibit a local formulation of the notion of finitely satisfiable generics (as defined by Hrushovski, Peterzil, and Pillay). This setting generalizes ``local stable group theory" (i.e., the study of stable formulas in groups) and also the case of arbitrary NIP formulas in pseudofinite groups. Time permitting, I will mention an application of these results in additive combinatorics.

I will present Pila's Modular Zilber-Pink with Derivatives (MZPD) conjecture, which is a Zilber-Pink type statement for the j-function and its derivatives, and discuss some weak and functional/differential analogues. In particular, I will define special varieties in each setting and explain the relationship between them. I will then show how one can prove the aforementioned weak/functional/differential MZPD statements using the Ax-Schanuel theorem for the j-function and its derivatives and some basic complex analytic geometry. Note that I gave a similar talk in Oxford last year (where I discussed a differential MZPD conjecture and proved it assuming an Existential Closedness conjecture for j), but this talk is going to be significantly different from that one (the approach presented in this talk will be mostly complex analytic rather than differential algebraic, and the results will be unconditional).

In this talk I will explain a category theoretic perspective on geometry.  Starting with a category of local objects (of and algebraic nature), and a (Grothendieck) 
topology on it, one can define global objects such as schemes and stacks. Examples of this  approach are algebraic, analytic, differential geometries and also more exotic geometries  such as analytic and differential geometry over the integers and analytic geometry over  the field with one element. In this approach the notion of a point is not primary but is  derived from the local to global structure. The Zariski and Huber spectra are recovered  in this way, and we also get new spectra which might be of interest in model theory.

In 1996 using techniques from model theory and intersection theory, Hrushovski obtained a generalisation of the Lang-Weil estimates. Subsequently the estimates have found applications in group theory, algebraic dynamics and algebraic geometry. We shall discuss a geometric proof of the non-uniform version of these estimates.

I will give an introduction to the theory of definable parameterization of definable sets in the o-minimal context and its application to diophantine problems. I will then go on to discuss uniformity issues with particular reference to the subanalytic case. This is joint work with Jonathan Pila and Raf Cluckers

In the spirit of the Ax-Kochen-Ershov principle, one could conjecture that the imaginaries in equicharacteristic zero Henselian fields can be entirely classified in terms of the Haskell-Hrushovski-Macpherson geometric imaginaries, residue field imaginaries and value group imaginaries. However, the situation is more complicated than that. My goal in this talk will be to present what we believe to be an optimal conjecture and give elements of a proof.

The well known (and notoriously hard) P vs NP problem asks whether every Boolean function with polynomial-size proofs is also computable in
polynomial time.

The standard approach to the P vs NP problem is via circuit complexity. For progressively richer classes of Boolean circuits (networks of AND, OR and NOT
logic gates), one wishes to show super-polynomial lower bounds on the sizes of circuits (as a function of the size of the input) computing some Boolean
function known to be in NP, such as the Satisfiability problem.

However, there is a more logic-oriented approach initiated by Cook and Reckhow, going through proof complexity rather than circuit complexity. For
progressively richer proof systems, one wishes to show super-polynomial lower bounds on the sizes of proofs (as a function of the size of the tautology) of
some sequence of propositional tautologies.

I will give a brief overview on known results along these two directions, and on their limitations. Somewhat surprisingly, similar techniques have been found
to be useful for these seemingly different approaches. I will say something about known connections between the approaches, and pose the question of
whether there are deeper connections.

Finally, I will discuss how the perspective of proof complexity can be used to formalize the difficulty of proving lower bounds on the sizes of computations
(or of proofs).

 

Let $p$ be a fixed prime number and let $SCVF_p$ be the theory of separably closed non-trivially valued fields of
characteristic $p$. In the talk, we will see that, in many ways, the step from $ACVF_{p,p}$ to $SCVF_p$ is not more
complicated than the one from $ACF_p$ to $SCF_p$.

At a basic level, this is true for quantifier elimination (Delon), for which it suffices to add parametrized $p$-coordinate
functions to any of the usual languages for valued fields. It follows that all completions are NIP.

At a more sophisticated level, in finite degree of imperfection, when a $p$-basis is named or when one just works with
Hasse derivations, the imaginaries of $SCVF_p$ are not more complicated than the ones in $ACVF_{p,p}$, i.e., they are
classified by the geometric sorts of Haskell-Hrushovski-Macpherson. The latter is proved using prolongations. One may
also use these to characterize the stable part and the stably dominated types in $SCVF_p$, and to show metastability.

If G is a topological group, a G-flow X is a non-empty, compact, Hausdorff space on which G acts continuously; it is minimal if all G-orbits are dense. By a theorem of Ellis, there is a (unique) minimal G-flow M(G) which is universal: there is a continuous G-map to every other G-flow. 

Here, we will be interested in the case where G = Aut(K) for some structure K, usually omega-categorical. Work of Kechris, Pestov and Todorcevic and others gives conditions on K under which structural Ramsey Theory (due to Nesetril - Rodl and others) can be used to compute M(G). 

In the first part of the talk I will give a description of the above theory and when it applies (the 'tame case'). In the second part, I will describe joint work with J. Hubicka and J. Nesetril which shows that the omega-categorical structures constructed in the late 1980's by Hrushovski as counterexamples to Lachlan's conjecture are not tame and moreover, minimal flows of their automorphism groups have rather different properties to those in the tame case. 

 The talk is about the normal modal logics of elementary classes defined by first-order formulas of the form
 'for all x_0 there exist x_1, ..., x_n phi(x_0, x_1, ... x_n)' with phi being a conjunction of binary atoms.
 I'll show that many properties of these logics, such as finite axiomatisability,
 elementarity,  axiomatisability by a set of canonical formulas or by a single generalised Sahlqvist formula,
 together with modal definability of the initial formula, either simultaneously hold or simultaneously do not hold.
 

Starting with a countable transitive model of V=L, we show that by 
adding a single Cohen real, c, most intermediate models do no satisfy choice. In 
fact, most intermediate models to L[c] are not even definable.

The key part of the proof is the Bristol model, which is intermediate to L[c], 
but is not constructible from a set. We will give a broad explanation of the 
construction of the Bristol model within the constraints of time.

Here Z is Zermelo’s set theory of 1908, as later formulated: full separation, but no replacement or collection among its axioms. PROVI was presented in lectures in Cambridge in 2010 and later published with improvements by Nathan Bowler, and is, I claim, the weakest subsystem of ZF to support a recognisable theory of set forcing: PROV is PROVI shorn of its axiom of infinity. The provident sets are the transitive non-empty models of PROV. The talk will begin with a presentation of PROV, and then discuss more recent applications and problems: in particular an answer in the system Z + PROV to a question posed by Eugene Wesley in 1972 will be sketched, and two proofs (fallacious, I hope) of 0 = 1 will be given, one using my slim models of Z and the other applying the Spector–Gandy theorem to certain models of PROVI. These “proofs”, when re-interpreted, supply some arguments of Reverse Mathematics.

NSOP1 is a class of first order theories containing simple theories, which contains many natural examples that somehow slip-out of the simple context.

As in simple theories, NSOP1 theories admit a natural notion of independence dubbed Kim-independence, which generalizes non-forking in simple theories and satisfies many of its properties.

In this talk I will explain all these notions, and in particular talk about recent progress (joint with Nick Ramsey) in the study of Kim-independence, showing transitivity and several consequences.

We survey recent research related to the Extension Property of Partial Isomorhisms (EPPA, also known as Hrushovski property) and, perhaps surprisingly, relate it to structural Ramsey theory.   This is based on a joint work with David Evans, Jan Hubicka and Matej Konecny.
 

Traditionally, logic was thought of as `principles of right reason'. Early twentieth century philosophy of mathematics focused on the problem of a general foundation for all mathematics. In contrast, the last 70 years have seen model theory develop as the study and comparison of formal theories for studying specific areas of mathematics. While this shift began in work of Tarski, Robinson, Henkin, Vaught, and Morley, the decisive step came with Shelah's stability theory. After this paradigm shift there is a systematic search for a short set of syntactic conditions which divide first order theories into disjoint classes such that models of different theories in the same class have similar mathematical properties. This classification of theories makes more precise the idea of a `tame structure'. Thus, logic (specifically model theory) becomes a tool for organizing and doing mathematics with consequences for combinatorics, diophantine geometry, differential equations and other fields. I will present an account of the last 70 years in model theory that illustrates this shift. This reports material in my recent book published by Cambridge: Formalization without Foundationalism: Model Theory and the Philosophy of Mathematical Practice.

With Gianluca Paolini (in preparation), we constructed, using a variant on the Hrushovski dimension function, for every k ≥ 3, 2^µ families of strongly minimal Steiner k systems. We study the mathematical properties of these counterexamples to Zilber’s trichotomy conjecture rather than thinking of them as merely exotic examples. In particular the long study of finite Steiner systems in reflected in results that depend on the block size k. A quasigroup is a structure with a binary operation such that for each equation xy = z the values of two of the variables determines a unique value for the third. The new Steiner 3-systems are bi-interpretable with strongly minimal Steiner quasigroups. For k > 3, we show the pure k-Steiner systems have ‘essentially unary definable closure’ and do not interpret a quasigroup. But we show that for q a prime power the Steiner q systems can be interpreted into specific sorts of quasigroups, block algebras. We extend the notion of an (a, b)-cycle graph arising in the study of finite and infinite Stein triple systems (e.g Cameron-Webb) by introducing what we call the (a, b)-path graph of a block algebra. We exhibit theories of strongly minimal block algebras where all (a, b)-paths are infinite and others in which all are finite only in the prime model. We show how to obtain combinatorial properties (e.g. 2-transitivity) by the either varying the basic collection of finite partial Steiner systems or modifying the µ function which ensures strong minimality

I will discuss joint work with Gismatullin, Halupczok, and Simonetta on the following problem: given a henselian valued field of characteristic 0, possibly equipped with analytic structure (in the sense stemming originally from Denef and van den Dries), describe the possibilities for a definable group G in the valued field sort which is definably almost simple, that is, has no proper infinite definable normal subgroups. We also have results for an algebraically closed valued field K in characteristic p, but assuming also that the group is a definable subgroup of GL(n, K).

I will explain how complex varieties which have asymptotically large intersections with finite grids can be seen to correspond to projective geometries, exploiting ideas of Hrushovski. I will describe how this leads to a precise characterisation of such varieties. Time permitting, I will discuss consequences for generalised sum-product estimates and connections to diophantine problems. This is joint work with Emmanuel Breuillard.

abstract:

In my talk I shall try to explain the following speculation and present some
evidence in the form of "correlations" between categoricity conjectures in
model theory and motivic conjectures in algebraic geometry.

Transfinite induction constructions developed in model theory are by now
sufficiently developed to be used to build analogues of objects in algebraic
geometry constructed with a choice of topology, such as a singular cohomology theory,
the Hodge decomposition, and fundamental groups of complex algebraic varieties.
Moreover, these algebraic geometric objects are often conjectured to satisfy
homogeneity or freeness properties which are true for objects constructed by
transfinite induction.


An example of this is Hrushovski fusion used to build Zilber pseudoexponentiation,
i.e. a group homomorphism  $ex:C^+ \to C^*$ which satisfies Schanuel conjecture,
a transcendence property analogous to Grothendieck conjecture on periods.


I shall also present a precise conjecture on "uniqueness" of Q-forms (comparison isomorphisms)
of complex etale cohomology, and will try to explain its relation to conjectures on l-adic
Galois representations coming from the theory of motivic Galois group.
 

In 1985, Babai and Sós asked whether there exists a constant c>0 such that every finite group of order n has a product-free set of size at least cn, where a product-free set of a group is a subset that does not contain three elements x,y and z  satisfying xy=z. Gowers showed that the answer is no in the early 2000s, by linking the existence of product-free sets of large density to the existence of low dimensional unitary representations.

In this talk, I will provide an answer to the aforementioned question by model theoretic means. Furthermore, I will relate some of Gowers' results to the existence of nontrivial definable compactifications of nonstandard finite groups.
 

 
We study continuous theories of classes of finite dimensional Hilbert spaces expanded by 
a finite family (of a fixed size) of unitary operators. 
Infinite dimensional models of these theories are called pseudo finite dimensional dynamical Hilbert spaces. 
Our main results connect decidability questions of these theories with the topic of approximations of groups by metric groups. 

This is a survey on recent advances in classical decidability issues for local and global fields and for some canonical infinite extensions of those.

Abstract: The universal algorithm is a Turing machine program that can in principle enumerate any finite sequence of numbers, if run in the right model of PA, and furthermore, can always enumerate any desired extension of that sequence in a suitable end-extension of that model. The universal finite set is a set-theoretic analogue, a locally verifiable definition that can in principle define any finite set, in the right model of set theory, and can always define any desired finite extension of that set in a suitable top-extension of that model. Recent work has uncovered a $\Sigma_1$-definable version that works with respect to end-extensions. I shall give an account of all three results, which have a parallel form, and describe applications to the model theory of arithmetic and set theory. Post questions and commentary on my blog at http://jdh.hamkins.org/parallels-in-universality-oxford-math-logic-semi…;

Both in the real and in the p-adic case, I will talk about recent results about C^r-parameterizations and their diophantine applications.  In both cases, the dependence on r of the number of parameterizing C^r maps plays a role. In the non-archimedean case, we get as an application new bounds for rational points of bounded height lying on algebraic varieties defined over finite fields, sharpening the bounds by Sedunova, and making them uniform in the finite field. In the real case, some results from joint work with Pila and Wilkie, and also beyond this work, will be presented, 
in relation to several questions raised by Yomdin. The non-archimedean case is joint work with Forey and Loeser. The real case is joint work with Pila and Wilkie, continued by my PhD student S. Van Hille.  Some work with Binyamini and Novikov in the non-archimedean context will also be mentioned. The relations with questions by Yomdin is joint work with Friedland and Yomdin. 

In joint work with Gareths Boxall and Jones we prove a poly-logarithmic bound for the number of rational points on the graph of functions on the disc that exhibit a certain decay. I will present an application of this counting theorem to the arithmetic of dynamical systems. It concerns fields generated by the solutions of equations of the form $P^{\circ n}(z) = P^{\circ n}(y)$ for a polynomial $P$ of degree $D \geq 2$ where $y$ is a fixed algebraic number. The general goal is to show that the degree of such fields grows like a power of $D^n$.    

This lecture will give a brief review of the theory of non-abelian reciprocity maps and their applications to Diophantine geometry, and pose some questions for model-theorists.
 

Several works (by Kontsevich, Soibelman, Berkovich, Nicaise, Boucksom, Jonsson...) have shown that the limit behavior of a one-parameter family $(X_t)$ of complex algebraic varieties can often be described using the associated Berkovich t-adic analytic space $X^b$. In a work in progress with E. Hrushovski and F. Loeser, we provide a new instance of this general phenomenon. Suppose we are given for every t an  $(n,n)$-form $ω_t$ on $X_t$ (for n= dim X). Then under some assumptions on the formula that describes $ω_t$, the family $(ω_t)$ has a "limit" ω, which is a real valued  (n,n)-form in the sense of Chambert-Loir and myself on the Berkovich space $X^b$, and the integral of $ω_t$ on $X_t$ tends to the integral of ω on $X^b$. 
In this talk I will first make some reminders about Berkovich spaces and (n,n)-forms in this setting, and then discuss the above result. 
In fact, as I will explain, it is more convenient to formulate it with  $(X_t)$ seen as a single algebraic variety over a non-standard model *C of C and (ω_t) as a (n,n) differential form on this variety. The field *C also carries a t-adic real valuation which makes it a model of ACVF (and enables to do Berkovich geometry on it), and our proof uses repeatedly RCF and ACVF theories. 
 

I will report on two recent papers with D. Ghioca and U. Zannier (joined by P. Corvaja and F. Hu, respectively) in which we consider variants of the Mordell-Lang conjecture.  In the first of these, we study the dynamical Mordell-Lang conjecture in positive characteristic, proving some instances, but also showing that in general the problem is at least as hard as a difficult diophantine problem over the integers.  In the second paper, we study the Mordell-Lang problem for extensions of abelian varieties by the additive group.  Here we have positive results in the function field case obtained by using the socle theorem in the form offered as an aside in Hrushovski's 1996 paper and in the number field case we relate this problem to the Bombieri-Lang conjecture.

I will present a variation of positive model theory which addresses the issues of approximations of conventional geometric structures by sequences of Zariski structures as well as approximation by sequences of finite structures. In particular I am interested in applications to quantum mechanics.

I will report on a progress in defining and calculating oscillating in- tegrals of importance in quantum physics. This is based on calculating Gauss sums of order higher or equal to 2 over rings Z/mZ for very specific m. 

We reflect on the set-theoretic ineffability of the Cantorian Absolute of all sets. If this is done in the style of Levy and Montague in a first order manner, or Bernays using second or higher order methods this has only resulted in principles that can justify large cardinals that are `intra-constructible', that is they do not contradict the assumption that V, the universe of sets of mathematical discourse, is Gödel's universe of constructible sets, namely L.  Peter Koellner has advanced reasons that this style of reflection will only have this rather limited strength. However set theorists would dearly like to have much stronger axioms of infinity. We propose a widened structural `Global Reflection Principle' that is based on a view of sets and Cantorian absolute infinities that delivers a proper class of Woodin cardinals (and more). A mereological view of classes is used to differentiate between sets and classes. Once allied to a wider view of structural reflection, stronger conclusions are thus possible.
 

Obtaining Woodin's Cardinals

P. D. Welch, in ``Logic in Harvard: Conference celebrating the birthday of Hugh Woodin''
Eds. A. Caicedo, J. Cummings, P.Koellner & P. Larson, AMS Series, Contemporary Mathematics, vol. 690, 161-176,May 2017.

Global Reflection principles, 

           P. D. Welch, currently in the Isaac Newton Institute pre-print series, No. NI12051-SAS, 
to appear as part of the Harvard ``Exploring the Frontiers of Incompleteness'' Series volume, 201?, Ed. P. Koellner, pp28.
 

A longstanding open question asks whether every unstable NIP theory interprets an infinite linear order. I will present a construction that almost provides a positive answer. I will also discuss some conjectural applications to the classification of omega-categorical NIP structure, generalizing what is known for omega-stable, and classification of models mimicking the superstable case.
 

About fifteen years ago, Thomas Scanlon and I gave a description of sets that arise as the intersection of a subvariety with a finitely generated subgroup inside a semiabelian variety over a finite field. Inspired by later work of Derksen on the positive characteristic Skolem-Mahler-Lech theorem, which turns out to be a special case, Jason Bell and I have recently recast those results in terms of finite automata. I will report on this work, as well as on the work-in-progress it has engendered, also with Bell, on an effective version of the isotrivial Mordell-Lang theorem.

Let L be a lattice in R^n and let Z in R^(m+n) a parameterized family of subsets Z_T of R^n. Starting from an old result of Davenport and using O-minimal structures, together with Martin Widmer, we proved for fairly general families Z an estimate for the number of points of L in Z_T, which is essentially best possible. 
After introducing the problem and stating the result, we will present applications to counting algebraic integers of bounded height and to Manin’s Conjecture.

The number of solutions of a given algebro-geometric configuration, when it is finite, does not change upon a small perturbation of the parameters; this persists 
even upon specializations that change the topology.    The precise formulation of this principle of Poncelet and Schubert   required, i.a., the notions of   algebraically closed fields, flatness, completenesss, multiplicity.     I will explain a model-theoretic version, presented in   quite different terms.  It applies notably to difference equations involving the Galois-Frobenius automorphism $x^p$, uniformly in a prime $p$.   In fixed positive characteristic, interesting technical problems arise that I will discuss if time permits.  

Roelcke precompact groups are exactly the topological groups that can be realized as automorphism groups of omega-categorical structures (in continuous logic). In this talk, I will discuss a model-theoretic framework for the study of those groups and their dynamical systems as well as two concrete applications. The talk is based on joint work with Itaï Ben Yaacov and Tomás Ibarlucía.

(Joint with Gareth Boxall) In this talk I will introduce some properties of distal theories. I will remark that distality is preserved neither under reducts nor expansions of the language. I will then go on to discuss a recent result that the Shelah expansion of a theory is distal if and only if the theory itself is distal. 

We discuss the connections and differences between the ZFC set theory and univalent foundations and answer the above question in the negative.
 

The talk is based on my joint work with Anand Pillay and Tomasz Rzepecki.

I will describe some connections between various objects from topological dynamics associated with a given first order theory and various Galois groups of this theory. One of the main corollaries is a natural presentation of the closure of the neutral element of the Lascar Galois group of any given theory $T$ (this closure is a group sometimes denoted by $Gal_0(T)$) as a quotient of a compact Hausdorff group by a dense subgroup.

As an application, I will present a very general theorem concerning the complexity of bounded, invariant equivalence relations (whose classes are sometimes called strong types) in countable theories, generalizing a theorem of Kaplan, Miller and Simon concerning Borel cardinalities of Lascar strong types and also later extensions of this result to certain bounded, $F_\sigma$ equivalence relations (which were obtained in a paper of Kaplan and Miller and, independently, in a paper of Rzepecki and myself). The main point of our general theorem says that in a countable theory, any bounded, invariant equivalence relation defined
on the set of realizations of a single complete type over $\emptyset$ is type-definable if and only if it is smooth (in the sense of descriptive set theory). If time permits, I will very briefly mention more recent developments in this direction (also based on the results from the first paragraph) which will appear in my future paper with Rzepecki.
 

It is well known that the theory of differentially closed fields of characteristic 0 has prime models and that they are unique up to isomorphism. One can ask the same question for the theory ACFA of existentially closed difference fields (recall that a difference field is a field with an automorphism).

In this talk, I will first give the trivial reasons of why this question cannot have a positive answer. It could however be the case that over certain difference fields prime models (of the theory ACFA) exist and are unique. Such a prime model would be called a difference closure of the difference field K. I will show by an example that the obvious conditions on K do not suffice.

I will then consider the class of aleph-epsilon saturated models of ACFA, or of kappa-saturated models of ACFA. There are natural notions of aleph-epsilon prime model and kappa-prime model. It turns out that for these stronger notions, if K is an algebraically closed difference field of characteristic 0, with fixed subfield F aleph-epsilon saturated, then there is an aleph-epsilon prime model over K, and it is unique up to K-isomorphism. A similar result holds for kappa-prime when kappa is a regular cardinal.

None of this extends to positive characteristic.
 

Let k be a field of characteristic zero and K=k((t)). Semi-algebraic sets over K are boolean combinations of algebraic sets and sets defined by valuative inequalities. The associated Grothendieck ring has been studied by Hrushovski and Kazhdan who link it via motivic integration to the Grothendieck ring of varieties over k. I will present a morphism from the former to the Grothendieck ring of motives of rigid analytic varieties over K in the sense of Ayoub. This allows to refine the comparison by Ayoub, Ivorra and Sebag between motivic Milnor fibre and motivic nearby cycle functor.
 

Hilbert's Nullstellensatz asserts the existence of a complex point satisfying lying on a given variety, provided there is no (ideal-theoretic) proof to the contrary.
I will describe an analogue for curves (of unbounded degree), with respect to conditions specifying that they lie on a given smooth variety, and have homology class
near a specified ray.   In particular, an analogue of the Lefschetz principle (relating large positive characteristic to characteristic zero) becomes available for such questions.
The proof is very close to a theorem of  Boucksom-Demailly-Pau-Peternell on moveable curves, but requires a certain sharpening.   This is part of a joint project with Itai Ben Yaacov, investigating the logic of the product formula; the algebro-geometric statement is needed for proving the existential closure of $\Cc(t)^{alg}$ in this language.