Skip to content

Set-indexed Operation Arity

An algebraic operation's specified set of argument positions, which may be finite or infinite.

Version
v1 · 2026-10-31 · History
Domain-specific #
14578
Domain group
Formal Sciences
Origin domain
Mathematics

Core Idea

An algebraic signature can assign an operation a set \(I\) of argument positions. For a carrier \(A\), the operation takes one \(A\)-value at every position and returns an element of \(A\): formally \(f:A^I\to A\). The set can be finite or infinite. Its cardinality tells how many positions there are; the chosen indexing can also organize them.[1]

A position can be declared even if changing its value does not affect the output. The empty index set has one empty input family; an operation from it to \(A\) exists only if \(A\) is nonempty.[1]

How would you explain it like I'm…

Machine with Labeled Slots

Think of a machine with labeled slots where you drop in toys, and it hands back one toy. The labels tell you which slots there are, and there could be a few slots or even endlessly many. Some slots might not change what comes out at all. And a machine with zero slots just hands you a toy, so it only works if there are toys to give.

Operations With Named Inputs

In math, an operation is like a machine that takes some inputs and gives back one output, all from the same set of things. Usually we say how many inputs it takes, like addition takes two. In this way of doing things, instead of just a number, each operation gets a set of labels, one for each input position, and the set can even be infinite. You fill each labeled position with an element, and the machine returns one element. A position can be listed even if changing it never changes the answer. And a machine with zero inputs just hands back one fixed thing, which only works if the set has at least one thing in it.

Index-Set Arity of Operations

In universal algebra, a signature lists operation symbols, and in one convention each symbol is given an arity set I rather than just a number. On a set A, the symbol is interpreted as a function f from A^I to A: it takes a family of elements of A labeled by I and returns one element of A. I can be finite or infinite; its size says how many inputs there are, and the set itself names the positions. A declared input position doesn't have to influence the result: arity describes the type of input, whereas 'essential dependence' asks whether changing that position can change the output. When I is the empty set, there is exactly one empty input family, so a nullary operation is just a choice of element of A, which exists only if A is nonempty.

 

In one universal-algebra convention, a signature assigns each operation symbol an arity set I, not merely a cardinal. An interpretation on a carrier A is a function f: A^I → A, taking an I-indexed family (a_i)_{i∈I} of elements of A to an element of A. The index set may be finite or infinite; its cardinality gives the number of argument positions, while the set itself identifies those positions in the representation. Arity specifies the input type and is distinct from essential dependence, which asks whether varying a given coordinate can change the output; a declared position may be inessential. For I = ∅, A^∅ has exactly one element, the empty family, so a nullary operation is equivalent to choosing an element of A and exists only if A is nonempty.

How It Works

For multiplication in a group \(G\), take \(I=\{0,1\}\). Each input is a pair of group elements and the result is their product in \(G\).[1] Lipparini gives a different operation on \(B=\mathbb N\cup\{\infty\}\) that takes a countable sequence and returns an element of \(B\), as part of a particular infinitary-algebra counterexample.[2] Both examples have a carrier, a declared position set, an indexed input family and an output in the carrier. They illustrate use within algebra, not unlimited cross-domain transfer.

Bergman also describes the entries of a determinant using an \(n\times n\) index set. The two coordinates give useful organization beyond the count \(n^2\). Equal-sized position sets can be transported through a chosen bijection, however; their labels alone do not make an intrinsic difference.[1]

Boundaries

Finite Argument Arity counts finitely many places in a broader range of represented symbols and relations. It overlaps the finite algebraic cases here; this account also permits infinite position sets, while an arbitrary predicate, relation or variable-length interface need not be a same-carrier operation. No particular parent relation is asserted.

Neighborhood in Abstraction Space

Set-indexed Operation Arity sits in a sparse region of the domain-specific corpus (63rd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Algebraic Operations & Quasigroup Structures (14 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-31

References

[1] George M. Bergman, “An Invitation to General Algebra and Universal Constructions”, version 3.0, https://math.berkeley.edu/~gbergman/245/3.0.pdf, §1.4, pp. 11–12; Definitions 8.1.1–8.1.2, pp. 304–305; §8.8. registry ↩a ↩b ↩c ↩d

[2] Paolo Lipparini, “Non-Generators in Extensions of Infinitary Algebras,” preliminaries p. 2 and Proposition 3.1, p. 4. University repository copy. registry ↩