Datenvertragswerk
finite algebra congruence commutator
For one fully supplied finite algebra on original labels0..n-1,n1..3, with0..2total unary and0..2total binary operations, compute the ENTIRE ORDERED TERM-CONDITION COMMUTATOR[alpha,beta]. Both supplied partitions must be congruences; block labels normalize by first occurrence. Return every congruence, the complete term-matrix subalgebra M(alpha,beta) in A^4, its full constructive generation certificate, all centralizing congruences and a genuine least matrix counterexample for every excluded.
POST https://datenvertrag.halowerk.com/v1/finite-algebra-congruence-commutatorInputs
| Field | Type | Required | Description |
|---|---|---|---|
| size | See schema | Yes | |
| unary_operations | See schema | Yes | |
| binary_operations | See schema | Yes | |
| alpha | See schema | Yes | |
| beta | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"size",
"unary_operations",
"binary_operations",
"alpha",
"beta",
"claim"
],
"properties": {
"size": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 3
},
{
"type": "null"
}
]
},
"unary_operations": {
"anyOf": [
{
"type": "array",
"minItems": 0,
"maxItems": 2,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
}
},
{
"type": "null"
}
]
},
"binary_operations": {
"anyOf": [
{
"type": "array",
"minItems": 0,
"maxItems": 2,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
}
}
},
{
"type": "null"
}
]
},
"alpha": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
},
{
"type": "null"
}
]
},
"beta": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"congruences",
"term_matrices",
"generation",
"centralizing_congruence_indices",
"commutator",
"commutator_congruence_index",
"failures"
],
"properties": {
"congruences": {
"type": "array",
"minItems": 1,
"maxItems": 5,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
}
},
"term_matrices": {
"type": "array",
"minItems": 1,
"maxItems": 81,
"items": {
"type": "array",
"minItems": 4,
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
}
},
"generation": {
"type": "array",
"minItems": 1,
"maxItems": 81,
"items": {
"type": "array",
"minItems": 4,
"maxItems": 4,
"items": {
"type": "integer",
"minimum": -2,
"maximum": 80
}
}
},
"centralizing_congruence_indices": {
"type": "array",
"minItems": 1,
"maxItems": 5,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
}
},
"commutator": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
},
"commutator_congruence_index": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"failures": {
"type": "array",
"minItems": 0,
"maxItems": 4,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"congruence_index",
"matrix_index"
],
"properties": {
"congruence_index": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"matrix_index": {
"type": "integer",
"minimum": 0,
"maximum": 80
}
}
}
}
}
},
{
"type": "null"
}
]
}
}
}Published input example
{
"size": 2,
"unary_operations": [],
"binary_operations": [
[
[
0,
1
],
[
1,
0
]
]
],
"alpha": [
0,
0
],
"beta": [
0,
0
],
"claim": {
"congruences": [
[
0,
0
],
[
0,
1
]
],
"term_matrices": [
[
0,
0,
0,
0
],
[
0,
0,
1,
1
],
[
0,
1,
0,
1
],
[
0,
1,
1,
0
],
[
1,
0,
0,
1
],
[
1,
0,
1,
0
],
[
1,
1,
0,
0
],
[
1,
1,
1,
1
]
],
"generation": [
[
0,
-1,
0,
0
],
[
1,
-1,
0,
1
],
[
2,
-2,
0,
1
],
[
5,
-2,
1,
0
],
[
6,
-1,
1,
0
],
[
7,
-1,
1,
1
],
[
3,
0,
1,
2
],
[
4,
0,
1,
5
]
],
"centralizing_congruence_indices": [
0,
1
],
"commutator": [
0,
1
],
"commutator_congruence_index": 1,
"failures": []
}
}Result & documentation
Machine-readable documentation of this hub
Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.
More endpoints in this hub
- Datenvertragswerk0.003 USDC
acyclic automata probabilistic refinement witness
POSThttps://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessFor two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1.
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- Datenvertragswerk0.003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.