Finite Relation Pair Membership Table
Convert an explicit finite homogeneous relation to a binary membership matrix with caller universe order; duplicate pairs coalesce.
Description
Convert an explicit finite homogeneous relation to a binary membership matrix with caller universe order; duplicate pairs coalesce.
A pair relation can be represented as a binary table while preserving the chosen universe order.
When to use this tool
Convert an explicit finite homogeneous relation to a binary membership matrix with caller universe order; duplicate pairs coalesce.
- Prepare the supplied pairsJson, universe fields for this operation.
- Compare the complete example with the representation used by your own input before carrying the result into another step.
How to use the tool and how it works
- Enter pairsJson, universe. Use the exact text syntax, units and index conventions explained below.
- Run the tool. If input validation fails, correct the supplied fields before interpreting any result.
- Read result.universe, result.matrix. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Validate a unique universe and in-universe pair list, deduplicate pairs and return a matrix with one exactly where its row/column pair exists. Echo the universe.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| pairsJson | JSON text, entered as one text field. The decoded structure is illustrated below; it is not a separate file. | Text |
| universe | universe. | List of strings; at most 128 entries |
For the JSON text fields, the following decoded structures show the example records before they are serialized into input strings. Keep field names, list nesting and value types as shown.
[
{
"field": "pairsJson",
"decoded": [
[
"a",
"b"
],
[
"b",
"a"
]
]
}
]| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.universe | The universe list in the ordering and representation described above. |
| result.matrix | The matrix list in the ordering and representation described above. |
{
"input": {
"pairsJson": "[[\"a\",\"b\"],[\"b\",\"a\"]]",
"universe": [
"a",
"b"
]
},
"output": {
"result": {
"universe": [
"a",
"b"
],
"matrix": [
[
0,
1
],
[
1,
0
]
]
}
}
}Limitations and assumptions
- The matrix records membership rather than multiplicity. No closure, weighting or property inference is applied.
- All declared input fields are required and unexpected top-level fields are rejected. Numbers must be finite; lists are limited to 128 entries and ordinary text fields to 8,192 UTF-16 code units, with tighter limits where stated.
- JSON text inputs must parse within bounded nesting and size limits. Numeric outputs outside the safe finite range are rejected; large exact integer results use decimal strings. Indexes and half-open spans are zero-based unless a rank is explicitly described as one-based.
Alternative or Complementary methods
Declare the full universe and distinguish testing a property from adding its closure. Use separate functionality and totality checks before interpreting a relation as a function.
References
Similar or alternative tools
- Finite Relation Membership Pair List
Decode a square binary finite relation membership matrix into unique ordered pairs with explicit universe labels.
- Finite Relation Antisymmetric Pair Audit
Audit finite relation antisymmetry and return explicit failing witnesses; unknown universe elements are rejected.