Definition talk:Indexed Iterated Binary Operation

From ProofWiki
Jump to navigation Jump to search

Generalization to ordered sets

Bourbaki, Algebra, chap I, ยง2: Composition of an ordered sequence of elements generalizes this to (finite) ordered sets. The added value is small, but it does take care of things like iterations over even integers. Then again, this is covered by iteration over sets except in the nonassociative or noncommutative case. The most common examples come from endomorphism structures.

Q: generalize immediately to ordered sets? Or only the thms? I guess future will tell what we need. --barto (talk) (contribs) 09:56, 31 December 2017 (EST)