{'fraction_non_alphanumeric': 0.033442088091353996, 'fraction_numerical': 0.012234910277324634, 'mean_word_length': 4.815165876777251, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A second grammar of associators

1. Introduction. This paper is concerned with proving identities in commutative Moufang loops. Many such identities were derived in chapter VIII of (1) in the course of demonstrating the local nilpotence of commutative Moufang loops. The results there are regarded as constituting the ‘first grammar of associators’: the reader is assumed to have a good knowledge of them. The current paper develops additional material required for the determination in (5) of the precise nilpotence class of the free commutative Moufang loop on any given finite number of generators. It is called a ‘grammar’ because it lists formal ways in which the language of associators works, and is merely meant to serve a reader of ‘literature’ in the language such as (5). However, it may be of interest for other purposes, such as answering Manin's question ((3), Vopros 10·3; (4), problem 10·2) on the 3-rank of the free commutative Moufang loop of exponent 3. There is also the problem raised below as to whether the Triple Argument Hypothesis is a consequence of the commutative Moufang loop laws. Finally, the Möbius function in Section 9 may tempt someone to look at lattice-theoretical aspects of associators.