At the end of my paper with Itay Kaplan “Forking and dividing in NTP2 theories” we had asked several questions, admittedly without giving them much thought. Since 2008 when the paper went in circulation, some people had actually shown interest in those questions. By now two of them are known to have negative answers, one due to Gabriel Conant and one by myself, with very easy examples. I’d like to have them written down for a reference somewhere, so I’ve thought this might be an appropriate place.

**Question 1.** (rephrased as more elaborate latex is not available here): Is it true that in a simple theory, every type has a global Lascar-invariant extension.

I recall that a complete global type is Lascar-invariant over a small set if whenever and has the same Lascar strong type over as , then . Having the same Lascar strong type means that is equivalent to with respect to every equivalence relation with boundedly many classes which is -invariant.

This property is true in the random graph, for example – any type can be extended to a global one without adding any new edges. This is also true in any extensible NIP theory, say in any stalbe theory, any -minimal theory (e.g. real closed fields) or any -minimal theory (e.g. algebraically closed valued fields), as well as in any theory with definable Skolem functions (e.g. -adics). A theory is extensible if every type does not fork over its domain. However, the crucial point is that this property need not be preserved in reducts of the theory, which immediately gives an easy simple counterexample.

**Example.** Let be the reduct of the random graph given by the ternary relation which holds if and only if and the number of edges between vertices in the set is odd.

**Claim.**

- is supersimple of -rank . Thus, Lascar strong type is determined by the strong type.
- For any set , .
- All pairs of different elements have the same type over .
- Let and . Then is not Lascar-invariant over .

*Proof:* (1) is because is definable on the set of singletons in the random graph, which is supersimple of -rank 1. Now it is a well-known fact that Lascar strong type is determined by the strong type in supersimple theories.

(2) is easy to see, and (3) is by back-and-forth.

(4) Assume is Lascar-invariant over , thus invariant over it by (1) and (2). Let , then by (3) either for all or for all . In the first case, let satisfy . Then it is easy to see that — a contradiction. In the other case, take satisfying and check that — a contradiction again.

Thus, by (4) *the unique type over the empty set has no global Lascar-invariant extension*.

There are various modifications of the question which still make sense, and also one can ask if this property holds in particular algebraic structures of interest. I have some things to say about it, but not this time.

**Question 2. **“Can similar results be proved for NSOP theories?”

Here “similar results” refers to the main result of the paper, that is that in an NTP2 theory a formula divides over an extension base if and only if it forks over it. Now, Gabe shows in “Forking and dividing in Henson graphs” that it is not the case for the triangle-free random graph. From my own experience, triangle-free random graph seems to demonstrate the failure of all the phenomena which holds for NTP2 theories.

**Example.** Let be the theory of the triangle-free random graph, and let . Let .

**Claim.**

- divides over for any .
- does not divide over .
- is an extension base.
- is but .
- However, forking and dividing are the same for complete types.

See Gabe’s article for details and for the general case of Henson graphs.

Still the following part of the question remains open:

**Problem.**

- Is forking=dividing for complete types?
- Is forking equal to dividing for formulas in NTP1 over models?