Diophantine geometry over groups. II: Completions, closures and formal solutions (Q1812255): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q2776330 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Stable actions of groups on real trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4529472 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4028727 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Structure and rigidity in hyperbolic groups. I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cyclic splittings of finitely presented groups and the canonical JSJ deccomposition / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Diophantine geometry over groups. I: Makanin-Razborov diagrams / rank | |||
Normal rank |
Latest revision as of 16:51, 5 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Diophantine geometry over groups. II: Completions, closures and formal solutions |
scientific article |
Statements
Diophantine geometry over groups. II: Completions, closures and formal solutions (English)
0 references
25 August 2003
0 references
The author continues to publish results on the structure of sets of solutions to systems of equations in a free group, projections of such sets, and the structure of elementary sets defined over a free group [for part I cf. Publ. Math., Inst Hautes Étud. Sci. 93, 31-105 (2001; Zbl 1018.20034)]. Merzlyakov's known theorem on solutions of positive sentences is generalized. It is known that if a sentence of the form \(\forall y\in V\;\exists x\;\Sigma(x,y,a)=1\wedge\Psi(x,y,a)\not=1\) is a true sentence, where \(V\) is a variety defined by a system of equations using the variables \(y\) and the coefficients \(a\), then there exists a collection of so called closures of the completions of the variety \(V\), and with each closure there is an associated formal solution \(x=x(s,z,y,a)\) defined over it so that each of the words in the system of equations obtained by reducing the variables \(x\) with the formal solutions \(x=x(s,z,y,a)\) in the system \(\Sigma(x,y,a)\) represents the trivial element in the limit group associated with the corresponding closure of the variety \(V\). The formal limit groups and their associated formal Makanin-Razborov diagrams are presented precisely. They encode the entire collection of formal solutions associated with the given sentence. It is necessary to get a quantifier elimination procedure for predicates defined over a free group.
0 references
equations over groups
0 references
solutions to systems of equations
0 references
free groups
0 references
elementary sets
0 references
positive sentences
0 references
quantifier elimination
0 references
Diophantine geometry over groups
0 references
Makanin-Razborov diagrams
0 references
limit groups
0 references
JSJ-decompositions
0 references
finitely generated groups
0 references
residually free groups
0 references