We prove that if is an -categorical supersimple theory with nontrivial dependence (given by forking), then there is a nontrivial regular 1-type over a finite set of reals which is realized by real elements; hence forking induces a nontrivial pregeometry on the solution set of this type and the pregeometry is definable (using only finitely many parameters). The assumption about -categoricity is necessary. This result is used to prove the following: If is a finite relational vocabulary with maximal arity 3 and is a supersimple -theory with elimination of quantifiers, then has trivial dependence and finite SU-rank. This immediately gives the following strengthening of a previous result of the author: if is a ternary simple homogeneous structure with only finitely many constraints, then has trivial dependence and finite SU-rank.

生成讲解博客的中文版本

生成AI智能校验的中文版本