Idempotent measure

A probability measure on a topological group that is unchanged by convolution with itself.

Version

v2 · 2026-09-19 · History

Domain-specific #

4955

Domain group

Formal Sciences

Origin domain

Mathematics

Subdomain

Harmonic Analysis → Mathematics

Core Idea

The underlying group and Borel structure, probability normalization and convolution convention matter; idempotence is under convolution rather than pointwise multiplication. Two independent group-valued draws with the same law are multiplied; if the product distribution equals the original law, the measure is convolution-idempotent and under standard hypotheses corresponds to Haar measure on a compact subgroup. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

The Same-Again Spinner

Think of a perfectly fair spinner that can stop anywhere around a circle. If you spin it once, then spin again and add the two turns together, the result is still perfectly fair, with the same kind of randomness as one spin. An idempotent measure is a kind of randomness that stays exactly the same when you combine two random tries like that.

Same-Random-Twice Rule

Imagine a random way of picking a move, like a turn of a wheel. You make two random moves, one after the other, each picked the same way and independently, and combine them. If the combined result has exactly the same chances as a single move, the way of picking is called an idempotent measure. A perfectly fair spin around a full circle works. So does a fair pick from only quarter turns, because combining quarter turns stays inside the quarter turns. 'Same chances' is about the combined move, not about multiplying chances together.

Convolution-Idempotent Probability Measure

Take a group G with a probability measure μ on it. The convolution μ∗μ is the distribution of xy, where x and y are drawn independently from μ and multiplied with the group operation. μ is idempotent if μ∗μ = μ. This is idempotence under convolution, not squaring probabilities point by point. Under standard hypotheses, the idempotent probability measures are exactly the normalized Haar measures, or 'uniform' measures, on compact subgroups. Examples are the uniform measure on a circle, or the point mass at the identity. You need to state the group, its topology and Borel sets, and the convolution convention.

 

Let G be a topological (or metric) group with its Borel σ-algebra, and μ a Borel probability measure. Convolution μ * ν is the law of xy, where x ~ μ and y ~ ν are independent and multiplied using the group operation. μ is idempotent if μ * μ = μ. The idempotence is with respect to convolution, not pointwise products of densities or of measures of sets. Under standard hypotheses, such as in compact or locally compact settings, idempotent probability measures are precisely the normalized Haar measures of compact subgroups H. Their support is H, and they are uniform on it. The simplest example is the point mass at the identity, which is Haar measure on the trivial subgroup. In noncommutative groups, the order of multiplication in convolution matters, and the characterization needs the appropriate qualifications. The weak topology enters when such measures arise as limits of convolution powers.

Scope of Application

Idempotent measure belongs to harmonic analysis and is useful where the analyst can specify the typed harmonic analysis carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the topological or metric group and Borel sigma-algebra, probability measure, group multiplication and inverse, convolution definition, equation mu star mu equals mu, weak topology, compact-subgroup support and normalized Haar characterization and noncommutative qualifications are explicit. The scope is broad within that domain but bounded by the need for the topological or metric group and Borel sigma-algebra, probability measure, group multiplication and inverse, convolution definition, equation mu star mu equals mu, weak topology, compact-subgroup support and normalized Haar characterization and noncommutative qualifications are explicit.

Clarity

The abstraction clarifies a crowded vocabulary by making the topological or metric group and Borel sigma-algebra, probability measure, group multiplication and inverse, convolution definition, equation mu star mu equals mu, weak topology, compact-subgroup support and normalized Haar characterization and noncommutative qualifications are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Idempotent measure. Idempotent measure compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning

1. Identify the carrier. State what the elements, states, objects, or observations are: the typed harmonic analysis carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
2. Lock the constitutive rule. Express the topological or metric group and Borel sigma-algebra, probability measure, group multiplication and inverse, convolution definition, equation mu star mu equals mu, weak topology, compact-subgroup support and normalized Haar characterization and noncommutative qualifications are explicit independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of harmonic analysis because they reuse the typed harmonic analysis carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, Two independent group-valued draws with the same law are multiplied; if the product distribution equals the original law, the measure is convolution-idempotent and under standard hypotheses corresponds to Haar measure on a compact subgroup., and type the carrier, state every parameter and convention in the definition, test that the topological or metric group and Borel sigma-algebra, probability measure, group multiplication and inverse, convolution definition, equation mu star mu equals mu, weak topology, compact-subgroup support and normalized Haar characterization and noncommutative qualifications are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Current abstraction Idempotent measure Domain-specific

Parents (1) — outgoing typed relations

• Idempotent measure is a kind of Invariance Prime

  It remains its own entry because its identity is fixed by the topological or metric group and Borel sigma-algebra, probability measure, group multiplication and inverse, convolution definition, equation mu star mu equals mu, weak topology, compact-subgroup support and normalized Haar characterization and noncommutative qualifications.

Hierarchy path (1) — routes to 1 parentless root

• Idempotent measure → is a kind of Invariance

Neighborhood in Abstraction Space

Idempotent measure sits in a crowded region of the domain-specific corpus (27^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Measure & Probability Foundations (42 abstractions)

Nearest neighbors

• Maximal function — 0.90
• Hardy–Littlewood maximal function — 0.89
• Pontryagin duality — 0.89
• Dyadic cubes — 0.89
• Harmonic measure — 0.88

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