Radon–Nikodym set¶

The convex range of a vector measure formed from several agents' nonatomic valuations of measurable cake pieces, representing all simultaneously attainable value vectors.

Version: v1 · 2026-09-08 · History
Domain-specific #: 6375
Origin domain: fair division
Subdomain: fair division

Core Idea¶

For a measurable subset B, its image under the vector measure records every agent's value of B; the Radon–Nikodym set is convex and centrally symmetric under nonatomic assumptions and supports geometric cake-cutting proofs. Each measurable piece maps to a point whose coordinates are agent valuations, and varying the piece traces a feasible value region whose convex geometry translates division requirements into intersection or separation questions. 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.

Scope of Application¶

Radon–Nikodym set belongs to fair division and is useful where the analyst can specify the typed fair division carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the cake sigma-algebra, agents, finite nonatomic measures, vector-measure map, attainable range and any normalization, complement symmetry or convexity assumption are explicit. The scope is broad within that domain but bounded by the need for the cake sigma-algebra, agents, finite nonatomic measures, vector-measure map, attainable range and any normalization, complement symmetry or convexity assumption are explicit. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the cake sigma-algebra, agents, finite nonatomic measures, vector-measure map, attainable range and any normalization, complement symmetry or convexity assumption 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. A bare label is insufficient because the name Radon–Nikodym set can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

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 Radon–Nikodym set. Radon–Nikodym set 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¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed fair division carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the cake sigma-algebra, agents, finite nonatomic measures, vector-measure map, attainable range and any normalization, complement symmetry or convexity assumption are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of fair division because they reuse the typed fair division carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Each measurable piece maps to a point whose coordinates are agent valuations, and varying the piece traces a feasible value region whose convex geometry translates division requirements into intersection or separation questions., and type the carrier, state every parameter and convention in the definition, test that the cake sigma-algebra, agents, finite nonatomic measures, vector-measure map, attainable range and any normalization, complement symmetry or convexity assumption are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Radon–Nikodym set Domain-specific

Parents (1) — more general patterns this builds on

Radon–Nikodym set is a kind of Fairness Prime

The proposed strict upward parent is prime:fairness.

Hierarchy path (1) — routes to 1 parentless root

Radon–Nikodym set → Fairness → Impartiality → Symmetry

Neighborhood in Abstraction Space¶

Radon–Nikodym set sits in a moderately populated region (46^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Mathematical Types, Functions & Infinity (33 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08