Datenvertragswerk
finite lie chevalley eilenberg homology
For a rational Lie algebra of dimension 1..3 given by its full bracket[i][j][k] in a fixed basis (fractions with numerator abs<=2, denominator 1..2), validates shape, skew-symmetry and all Jacobi identities and computes Chevalley-Eilenberg homology with trivial coefficients Q. Chains are C_k=exterior^k g with lexicographic wedge bases. Returns all differential matrices d0..dn, canonical kernel bases, boundary bases and homology representatives.
POST https://datenvertrag.halowerk.com/v1/finite-lie-chevalley-eilenberg-homologyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| dimension | See schema | Yes | |
| bracket | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"dimension": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 3
},
{
"type": "null"
}
]
},
"bracket": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "string",
"pattern": "^-?[0-2]/[1-2]$",
"maxLength": 4
},
"minItems": 1,
"maxItems": 3
},
"minItems": 1,
"maxItems": 3
},
"minItems": 1,
"maxItems": 3
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"dimension": {
"type": "integer",
"minimum": 1,
"maximum": 3
},
"chain_bases": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 0,
"maxItems": 3
},
"minItems": 0,
"maxItems": 3
},
"minItems": 1,
"maxItems": 4
},
"differentials": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "string",
"pattern": "^-?[0-9]+/[1-9][0-9]*$",
"maxLength": 16
},
"minItems": 0,
"maxItems": 3
},
"minItems": 0,
"maxItems": 3
},
"minItems": 1,
"maxItems": 4
},
"cycle_bases": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "string",
"pattern": "^-?[0-9]+/[1-9][0-9]*$",
"maxLength": 16
},
"minItems": 0,
"maxItems": 3
},
"minItems": 0,
"maxItems": 3
},
"minItems": 1,
"maxItems": 4
},
"boundary_bases": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "string",
"pattern": "^-?[0-9]+/[1-9][0-9]*$",
"maxLength": 16
},
"minItems": 0,
"maxItems": 3
},
"minItems": 0,
"maxItems": 3
},
"minItems": 1,
"maxItems": 4
},
"homology_representatives": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "string",
"pattern": "^-?[0-9]+/[1-9][0-9]*$",
"maxLength": 16
},
"minItems": 0,
"maxItems": 3
},
"minItems": 0,
"maxItems": 3
},
"minItems": 1,
"maxItems": 4
},
"betti_numbers": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 4
},
"complete": {
"const": true
}
},
"required": [
"dimension",
"chain_bases",
"differentials",
"cycle_bases",
"boundary_bases",
"homology_representatives",
"betti_numbers",
"complete"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"dimension",
"bracket",
"claim"
],
"additionalProperties": false
}Published input example
{
"dimension": 2,
"bracket": [
[
[
"0/1",
"0/1"
],
[
"0/1",
"0/1"
]
],
[
[
"0/1",
"0/1"
],
[
"0/1",
"0/1"
]
]
],
"claim": {
"dimension": 2,
"chain_bases": [
[
[]
],
[
[
0
],
[
1
]
],
[
[
0,
1
]
]
],
"differentials": [
[],
[
[
"0/1",
"0/1"
]
],
[
[
"0/1"
],
[
"0/1"
]
]
],
"cycle_bases": [
[
[
"1/1"
]
],
[
[
"1/1",
"0/1"
],
[
"0/1",
"1/1"
]
],
[
[
"1/1"
]
]
],
"boundary_bases": [
[],
[],
[]
],
"homology_representatives": [
[
[
"1/1"
]
],
[
[
"1/1",
"0/1"
],
[
"0/1",
"1/1"
]
],
[
[
"1/1"
]
]
],
"betti_numbers": [
1,
2,
1
],
"complete": true
}
}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.