Diophantine geometry over groups. IV: An iterative procedure for validation of a sentence. (Q1766466): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgroups of Surface Groups are Almost Geometric / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diophantine geometry over groups. I: Makanin-Razborov diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diophantine geometry over groups. II: Completions, closures and formal solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diophantine geometry over groups. III: Rigid and solid solutions. / rank
 
Normal rank

Latest revision as of 18:24, 7 June 2024

scientific article
Language Label Description Also known as
English
Diophantine geometry over groups. IV: An iterative procedure for validation of a sentence.
scientific article

    Statements

    Diophantine geometry over groups. IV: An iterative procedure for validation of a sentence. (English)
    0 references
    7 March 2005
    0 references
    This long and carefully written paper is the fourth in the author's impressive series on the structure of sets of solutions to systems of equations in a free group [for part II cf. Isr. J. Math. 134, 173-254 (2003; Zbl 1028.20028)]. The structural results obtained in the first papers in the sequence are applied to analyze \(\forall\exists\) sentences. An iterative procedure is associated with an \(\forall\exists\) sentence to produce a sequence of varieties and formal solutions defined over them. The author proves that the complexity of Diophantine sets associated with these varieties produced along the procedure strictly increases. It follows that the procedure terminates after finitely many steps. The outcome of the iterative procedure can be viewed as a stratification theorem generalising Merzlyakov's known result from positive sentences to general \(\forall\exists\) ones. On every stratum an \(\forall\exists\) sentence can be validated using a finite set of formal solutions.
    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: Diophantine sets
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references