Alphabeta Math
Pipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Root Systems, Dynkin Diagrams, and the Cartan-Killing Classification — Examples

1 · Prerequisites

2 · Summary

These examples accompany root-systems-dynkin-diagrams-and-cartan-killing-classification. They compute the rank-one system A1, the rank-two systems A2,B2,G2 from their plane pictures, the classical systems in coordinates, the simple roots and fundamental weights of An, the Weyl groups of types A,B,D, the diagram duality of Bn and Cn, the low-rank coincidences, the Serre presentation of sl3, and the positive roots and highest root of G2. Two counterexamples show that a cycle graph fails positive definiteness and that SL⁡2(C) and PGL⁡2(C) have the same Lie algebra and diagram but different centers, hence are not isomorphic.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-09-22Open item page →

The root system A_1

Example

Let E=Rα be a Euclidean line and Φ={α,−α} with (α,α)=1. Then Φ is the reduced crystallographic root system A1; its Weyl group has order 2, its two bases are {α} and {−α}, and relative to either base its Cartan matrix is the 1×1 matrix [2].

Facts & Assumptions

Given: A Euclidean line E=Rα with α≠0 and the set Φ={α,−α}.

[L1]

A reduced crystallographic root system is a finite spanning set of nonzero vectors closed under its root reflections with integral Cartan integers and reducedness (Reduced crystallographic Euclidean root system).

[L2]

The reflection sα negates α, the Weyl group is the subgroup of O(E) generated by the root reflections, and the diagonal entry of the Cartan matrix relative to either one-element base {β} is 2(β,β)/(β,β)=2 (Weyl group, Cartan matrix of a based root system).

Verification

technique · direct
1.1L1algebra

Φ is finite, spans E, omits 0, and Rα∩Φ={±α}; the reflection sα sends α to −α and −α to α, so sα(Φ)=Φ; the only Cartan integers are 2(±α,±α)/(α,α)=±2, which are integers. Hence Φ is a reduced crystallographic root system.

2.1L2step 1.1algebra∎

Each positive system consists of one of the two roots, so the two bases are {α} and {−α}. The Weyl group is {1,sα} of order 2, and relative to either one-element base the Cartan matrix is [2] by [L2]. This is the rank-one system A1.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-09-22Open item page →

Rank-two systems A_2, B_2 and G_2

Example

The following configurations with six, eight and twelve roots in the plane realize A2,B2 and G2: for A2 the six unit vectors spaced by 60∘, for B2 the eight vectors ±e1,±e2,±e1±e2, and for G2 the twelve vectors of the explicit model. The off-diagonal Cartan products are 1,2,3 respectively.

Facts & Assumptions

Given: The standard plane R2 with orthonormal basis e1,e2 and the six unit vectors uk=(cos⁡(kπ/3),sin⁡(kπ/3)), 0≤k≤5.

[L1]

The irreducible reduced crystallographic rank-two root systems are exactly A2,B2≅C2,G2, and for nonproportional roots the product of the two Cartan integers is 4cos⁡2θ∈{0,1,2,3} with the corresponding length ratio (Rank-two root-system classification).

[L2]

A reduced crystallographic Euclidean root system is a finite spanning set of nonzero vectors that is reduced, is preserved by every root reflection, and has integral Cartan integers; for a base (α1,α2) its Cartan matrix has entries aij=2(αj,αi)/(αi,αi) (Reduced crystallographic Euclidean root system, Cartan matrix of a based root system).

Verification

technique · direct
1.1L2algebra

For A2 take ΦA={u0,…,u5}. This finite set spans the plane, is reduced, and each root reflection is a symmetry of the regular hexagon. Its Cartan integers are 2cos⁡θ∈{0,±1,±2}. Put α=u0 and β=u2; then ΦA+={α,β,α+β} is a positive system with base (α,β), and (α,β)=−1/2. Thus its Cartan matrix is (2−1−12) and its off-diagonal Cartan product is 1.

1.2L2algebra

For B2 take ΦB={±e1,±e2,±e1±e2}. This finite set spans the plane, omits zero, and is reduced. The reflections in the coordinate roots change one sign, while those in e1±e2 interchange the coordinates with possible sign changes, so every root reflection preserves ΦB; direct pairings give Cartan integers in {0,±1,±2}. The roots α=e1−e2 and β=e2 form a base, since the positive roots are α,β,α+β,α+2β. Moreover (α,α)=2, (β,β)=1, and (α,β)=−1, so the Cartan matrix for (α,β) is (2−1−22) and its off-diagonal Cartan product is 2.

1.3L2algebra

For G2, choose α,β with (α,α)=6, (β,β)=2, (α,β)=−3 and put ΦG={±α,±β,±(α+β),±(α+2β),±(α+3β),±(2α+3β)}. The Gram determinant is positive, so α,β form a basis; the displayed coefficient pairs then show that ΦG is finite, spans the plane, omits zero, and is reduced. The reflection sα interchanges β with α+β and α+3β with 2α+3β, and fixes α+2β; the reflection sβ interchanges α with α+3β and α+β with α+2β, and fixes 2α+3β. Together with the images of α and β, these permutations show that the long and short roots are the two orbits of the simple reflections. Conjugating sα or sβ therefore proves reflection closure for every root. Direct pairings give integral Cartan integers in {0,±1,±2,±3}. The six displayed unnegated roots are positive and have base (α,β), whose Cartan matrix is (2−1−32) and whose off-diagonal Cartan product is 3.

2.1L1step 1.1step 1.2step 1.3algebra∎

By [L1] the three systems are exactly the irreducible rank-two reduced crystallographic systems, and the displayed Cartan products 1,2,3 are those of A2,B2,G2 respectively.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-09-22Open item page →

Simple roots and fundamental weights of A_n

Example

For An realized in the sum-zero subspace E={x∈Rn+1:∑ixi=0} the simple roots are αi=ei−ei+1, 1≤i≤n, and the fundamental weights are ωk=e1+⋯+ek−kn+1∑i=1n+1ei,1≤k≤n.

Facts & Assumptions

Given: The model An={εi−εj:i≠j} in the sum-zero subspace of Rn+1, with simple roots αi=ei−ei+1 and the vectors ωk displayed.

[L1]

In this model An is a reduced crystallographic root system with simple roots αi=ei−ei+1 (Classical root systems in coordinates, Existence of each classified root system).

[L2]

The coroot of α is α∨=2α/(α,α) and the fundamental weights are the vectors dual to the simple coroots, (ωk,αi∨)=δki (Fundamental weights, Coroot and dual root system).

Verification

technique · direct
1.1L1L2algebra

(αi,αi)=2 and αi∨=αi, since αi has two nonzero coordinates equal to ±1.

2.1L2step 1.1algebra∎

For every i,k one has (ωk,αi)=(ωk,ei)−(ωk,ei+1); the vector ωk has coordinates 1−k/(n+1) in positions 1,…,k and −k/(n+1) in positions k+1,…,n+1, so the difference equals 1 when i=k and 0 otherwise. Hence (ωk,αi∨)=δki and the displayed vectors are the fundamental weights of An; they form a basis of the weight lattice by [L2].

ExampleConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-09-22Open item page →

The Weyl group of A_n is the symmetric group

Example

For n≥1, W(An)≅Sn+1, acting on the sum-zero subspace of Rn+1 by permuting coordinates.

Facts & Assumptions

Given: An integer n≥1, the sum-zero subspace E⊆Rn+1, and the model An={εi−εj:i≠j}⊆E.

[L1]

The coordinate model of An consists of the roots εi−εj in the sum-zero subspace (Classical root systems in coordinates).

[L2]

The Weyl group is generated by the root reflections (Weyl group).

Verification

technique · direct
1.1L1L2algebra

Let ρ:Sn+1→O(E) be the homomorphism obtained by restricting coordinate permutations to E. For x∈E, the reflection formula gives sεi−εj(x)=x−(xi−xj)(εi−εj)=ρ((ij))x. Hence [L2] and the fact that the transpositions generate Sn+1 give W(An)=ρ(Sn+1).

2.1L1step 1.1algebra∎

The homomorphism ρ is injective. Indeed, if ρ(σ) is the identity on E, then for every i≠j it fixes εi−εj, so εσ(i)−εσ(j)=εi−εj; uniqueness of the positive and negative coordinate positions gives σ(i)=i and σ(j)=j. Thus σ=1, and step 1.1 yields W(An)≅Sn+1 with the asserted action.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-09-22Open item page →

Dynkin duality of B_n and C_n

Example

For n≥2, the Bn and Cn diagrams have the same underlying chain and opposite arrows on the unique double edge; transposing the Cartan matrix exchanges them.

Facts & Assumptions

Given: An integer n≥2; the simple roots of Bn: α1=ε1−ε2,…,αn−1=εn−1−εn,αn=εn; and of Cn: β1=ε1−ε2,…,βn−1=εn−1−εn,βn=2εn.

[L1]

The Cartan matrix entry is aij=2(αj,αi)/(αi,αi), and the diagram has aijaji edges with the arrow toward the shorter root (Cartan matrix of a based root system, Dynkin diagram with edge multiplicity and arrow convention).

[L2]

Coroot duality transposes the Cartan matrix, and the dual system of Bn is Cn (Duality exchanges B and C).

Verification

technique · direct
1.1L1algebra

For Bn: ∣αi∣2=2 for i<n and ∣αn∣2=1; (αn−1,αn)=−1, so an−1,n=2(−1)/2=−1 and an,n−1=2(−1)/1=−2; all other off-diagonal entries of adjacent pairs are −1 and the rest vanish. Thus the diagram is a chain with a double edge at the end, the arrow being governed by ∣an,n−1∣=2>∣an−1,n∣=1 and pointing toward the shorter root αn.

1.2L1algebra

For Cn: ∣βi∣2=2 for i<n and ∣βn∣2=4; (βn−1,βn)=−2, so an−1,n=2(−2)/2=−2 and an,n−1=2(−2)/4=−1; the diagram is again a chain with a double edge exactly at the end, and the arrow now points toward the shorter root βn−1.

2.1L2step 1.1step 1.2algebra∎

The matrices of steps 1.1 and 1.2 are transposes of one another, which is exactly coroot duality by [L2]; so transposing the Cartan matrix exchanges Bn and Cn, reversing the arrow while keeping the chain and the double-edge position.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-09-22Open item page →

Low-rank Dynkin coincidences

Example

The low-rank coincidences among the classical types are B1=C1=A1,B2=C2,D2=A1⊔A1,D3=A3.

Facts & Assumptions

Given: The classical coordinate models.

[L1]

The set {±α} in a Euclidean line is the root system A1 (The root system A_1).

[L2]

The coordinate root systems B2 and C2 are isomorphic: an explicit orthogonal transformation followed by a uniform rescaling carries one root set to the other (Root systems of the classical complex Lie algebras).

[L3]

In the classical coordinate models, Dn={±ei±ej:1≤i<j≤n}. For D3, the roots δ1=e1−e2,δ2=e2−e3,δ3=e2+e3 form a simple system (Classical root systems in coordinates).

Proof

technique · direct
1.1L1algebra

Extending the coordinate notation to rank one gives B1={±e1} and C1={±2e1}. The linear maps e1↦α and 2e1↦α identify these systems with A1 from [L1]. Thus B1=C1=A1 up to root-system isomorphism.

1.2L2

The explicit similarity in [L2] identifies the eight roots of B2 with those of C2 and preserves every Cartan integer. Hence B2=C2 up to root-system isomorphism.

1.3L1L3algebra

For D2, [L3] gives D2={±(e1+e2),±(e1−e2)}, the orthogonal disjoint union of two rank-one systems, so D2=A1⊔A1 by [L1].

2.1L3algebra∎

For the simple roots of D3 in [L3], all squared lengths are 2, while (δ1,δ2)=(δ1,δ3)=−1 and (δ2,δ3)=0. Their Dynkin graph therefore has the three-vertex path δ2−δ1−δ3, the A3 diagram. Hence D3=A3 up to root-system isomorphism.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-09-22Open item page →

Serre relations for A_2 recover sl_3

Example

Assume the Axiom of Choice; it is inherited from the Serre presentation theorem used below.

For A=(2−1−12) the Serre generators map to e1↦E12, e2↦E23, f1↦E21, f2↦E32, h1↦E11−E22, h2↦E22−E33 in sl3(C), and this assignment is an isomorphism g(A)→sl3(C).

Facts & Assumptions

Given: The Axiom of Choice; the Cartan matrix A of A2, the Serre algebra g(A) and the matrices in sl3(C).

[A1]

The standing AC assumption is The Axiom of Choice; it is inherited through the Serre triangular-decomposition theorem in [L1].

[L1]

g(A) is presented by the Serre generators and relations, and has the triangular decomposition n−⊕h⊕n+, where h is spanned by h1,h2 and n− is generated by f1,f2 while n+ is generated by e1,e2 (Serre Lie algebra of a finite-type Cartan matrix, Serre presentation theorem).

[L2]

sl3(C) is the Lie algebra of traceless 3×3 matrices with the commutator (Classical complex matrix Lie algebras); direct multiplication of matrix units gives EijEkl=δjkEil.

Verification

technique · direct
1.1L1L2algebra

The images satisfy the Cartan and generator relations: [hi,hj]=0; [h1,E12]=2E12, [h1,E23]=−E23, [h2,E12]=−E12, [h2,E23]=2E23 and the negatives on the f's; [E12,E21]=h1, [E23,E32]=h2, and the cross brackets [E12,E32] and [E23,E21] vanish.

2.1L1L2step 1.1algebra

Direct multiplication also gives (ad⁡E12)2E23=(ad⁡E23)2E12=(ad⁡E21)2E32=(ad⁡E32)2E21=0, so all four Serre relations hold. Hence the assignment induces a Lie-algebra homomorphism φ:g(A)→sl3(C).

3.1L2step 2.1algebra

The images generate sl3(C): [E12,E23]=E13, [E23,E12]=−E13, and [E21,E32]=−E31. Thus the image contains all six off-diagonal matrix units and the independent diagonal matrices h1,h2, which form a basis of the eight-dimensional space of traceless 3×3 matrices. Hence φ is surjective.

4.1A1L1L2step 3.1algebra∎

Put z=[e1,e2]. The positive Serre relations give [e1,z]=[e2,z]=0, so span⁡(e1,e2,z) is a Lie subalgebra containing the positive generators and contained in the subalgebra they generate; hence it equals n+. With w=[f1,f2], the negative Serre relations likewise give [f1,w]=[f2,w]=0, so n−=span⁡(f1,f2,w) and each half has dimension at most three. Since h is spanned by h1,h2, the triangular decomposition in [L1] gives dim⁡g(A)≤8. Surjectivity from step 3.1 onto the eight-dimensional algebra sl3(C) gives the reverse inequality, so dim⁡g(A)=8 and ker⁡φ=0. Thus φ is the asserted isomorphism.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-09-22Open item page →

Positive roots and highest root of G_2

Example

In the G2 model with a short simple root α and a long simple root β, the positive roots are α,β,α+β,2α+β,3α+β,3α+2β, and the highest root is 3α+2β.

Facts & Assumptions

Given: The G2 model Φ={±α0,±β0,±(α0+β0),±(α0+2β0),±(α0+3β0),±(2α0+3β0)} with long root α0 and short root β0. Rename the ordered base {β0,α0} as {α,β}, so α=β0 is short and β=α0 is long.

[L1]

In the model the roots ±(α0+β0), ±(α0+2β0), ±(α0+3β0), ±(2α0+3β0) occur, and the Cartan matrix relative to {β0,α0} is the G2 matrix (Rank-two systems A_2, B_2 and G_2, Existence of each classified root system).

[L2]

In a reduced crystallographic root system, every positive root is a nonnegative integral combination of the chosen simple roots; if the finite root system is also irreducible, it has a unique highest root (Simple roots form a signed integral basis, Existence and uniqueness of the highest root).

Verification

technique · direct
1.1L1L2algebra

Write α0 for the long root and β0 for the short root of the model, so that α=β0, β=α0. The twelve roots listed in the model become, in terms of α,β: ±α,±β,±(α+β),±(2α+β),±(3α+β),±(3α+2β). Hence the positive roots with respect to the base {α,β} are exactly the six nonnegative combinations displayed, of heights 1,1,2,3,4,5.

2.1L2step 1.1algebra∎

The root 3α+2β has height 5, the largest among the positive roots, and it is the unique highest root by [L2]. Directly, each of the other five coefficient pairs (1,0),(0,1),(1,1),(2,1),(3,1) is coordinatewise at most (3,2) and is not equal to it, so every other positive root is strictly below 3α+2β in the root order.

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-09-22Open item page →

A cycle graph is not finite type

Statement refuted

Every finite connected graph is the Dynkin diagram of a finite-type Cartan matrix, so positive definiteness imposes no restriction on connected diagrams.

Facts & Assumptions

Given: An integer m≥3, the cycle graph G on m vertices, and the matrix A=2I−Adj⁡(G).

[L1]

A finite-type Cartan matrix is symmetrizable to a positive definite matrix: there is a diagonal D with positive diagonal entries such that DAD−1 is symmetric positive definite (Properties of finite-type Cartan matrices).

[L2]

The Cartan matrix of a based root system has aijaji=1 on each simple edge and 0 on nonedges, so the diagram of A would be G (Dynkin diagram with edge multiplicity and arrow convention).

Proof

technique · explicit witness
1.1L2algebra

The matrix A=2I−Adj⁡(G) is symmetric and satisfies aii=2, aij=−1 for adjacent i≠j and aij=0 otherwise; its diagram, as in [L2], is the cycle G on m≥3 vertices.

1.2givenalgebra

The nonzero vector x=(1,…,1) satisfies Ax=0, because every row has diagonal entry 2 and exactly two entries −1. Equivalently xTAx=2m−2m=0. Hence A is not positive definite; moreover every diagonal conjugate DAD−1 has the nonzero null vector Dx, so no symmetric diagonal conjugate can be positive definite.

2.1L1L2step 1.1step 1.2∎

By [L1] a finite-type Cartan matrix must be symmetrizable to a positive definite matrix; A is not. Moreover, [L2] makes A the only Cartan matrix with this unoriented simple-edge cycle: on each edge the nonpositive integral entries have product 1, so both are −1. Thus the cycle is not a finite-type Dynkin diagram even though it is finite and connected. This explicit family suffices to refute the claimed statement; no broader tree assertion is needed.

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-09-22Open item page →

SL_2 and PGL_2 have the same Lie algebra but differ globally

Statement refuted

A connected Lie group is determined up to isomorphism by its Lie algebra, so two connected Lie groups with the same complex semisimple Lie algebra are isomorphic.

Facts & Assumptions

Given: Assume ACω. The groups SL⁡2(C) and PGL⁡2(C)=GL⁡2(C)/(C×I), and their Lie algebras.

[L1]

The Möbius group is GL⁡2(C)/(C×I)=PGL⁡2(C), so PGL⁡2(C) is a quotient of GL⁡2(C) by the normal subgroup C×I (Möbius transformations form a group and identify with the projective linear quotient of GL_2(C), Invertible matrices and the general linear group GL⁡n(F)).

[L2]

The traceless matrices form the complex Lie algebra sl2(C) under the commutator, with basis e,f,h satisfying [h,e]=2e, [h,f]=−2f, [e,f]=h. The special linear Lie algebra sl_2.

[A1]

Countable choice is assumed for the following differential-geometric interfaces. The Axiom of Countable Choice (ACω).

[L3]

Under ACω, a closed normal subgroup N of a finite-dimensional real Lie group G has a quotient Lie group with tangent Lie algebra g/n. Quotient by a closed normal subgroup is a Lie group.

[L4]

Under ACω, the tangent bracket is the value at the identity of the commutator of the left-invariant extensions. Lie bracket on the tangent space of a Lie group.

Proof

technique · explicit witness
1.1A1L2L4algebra

The open set GL⁡2(C)⊂M2(C) is a complex Lie group: multiplication is polynomial and inversion is the adjugate divided by the nonzero determinant. The determinant-one subset is a complex submanifold: on the open set where the entry a≠0, the equation ad−bc=1 solves d=(1+bc)/a; at any other matrix at least one entry is nonzero and one solves for its opposite entry in the same way. These charts cover the subset, and the restricted group operations are holomorphic. Differentiating the determinant at I gives tr⁡X, and the chart at I shows that every traceless X is tangent to this subset. For either matrix group the left-invariant extension of X is A↦AX; the field commutator with A↦AY is A↦A(XY−YX). Thus their tangent Lie algebras are respectively M2(C) and sl2(C).

1.2L2algebra

The algebra sl2(C) is simple, hence semisimple. Indeed a nonzero ideal is invariant under ad⁡h, whose distinct eigenvalues on e,f,h are 2,−2,0. Polynomial spectral projections show that the ideal contains a nonzero multiple of at least one of these basis vectors. Bracketing with the others then puts all three in the ideal. Moreover [sl2,sl2]=sl2, so the whole algebra is not solvable; it therefore has no nonzero solvable ideal.

1.3L2algebra

The group SL⁡2(C) is path connected. Indeed, if g=(abcd) has a≠0, then g=(10c/a1)(a00a−1)(1b/a01). Each unipotent factor is joined to I by multiplying its off-diagonal entry by t∈[0,1], and the diagonal factor is joined to I along diag⁡(γ(t),γ(t)−1) for any path γ in C× from 1 to a. If a=0, then c≠0, and the path (1t01)g joins g to a matrix whose upper-left entry is c≠0, reducing to the preceding case.

1.4L2algebra

Z(SL⁡2(C))={±I}: a central matrix commutes in particular with the unipotent one-parameter subgroups generated by E12 and E21, hence with E12 and E21; it is therefore scalar, and determinant one leaves precisely ±I.

1.5L1algebra

Z(PGL⁡2(C)) is trivial: a central projective transformation commutes with every dilation z↦az, so it preserves their common fixed set {0,∞}; commuting also with the inversion z↦1/z and translations z↦z+b forces it to fix 0,1,∞, hence it is the identity Möbius transformation.

2.1A1L1L2L3step 1.1algebra

The scalar subgroup is closed in GL⁡2(C), being defined there by zero off-diagonal entries and equal diagonal entries. It is normal, and its tangent algebra is CI. Consequently [L3], applied to the underlying real groups, gives the quotient tangent algebra M2(C)/CI. The quotient is also a complex Lie group: on the set of classes with a selected matrix entry nonzero, normalize that entry to 1. The other three entries give an open subset of C3 with determinant nonzero. Transition functions and the locally expressed group operations are rational with nonzero denominators, hence holomorphic. These charts agree with the smooth quotient charts since normalization is a smooth local section. The tangent quotient map is complex linear. Finally [X]↦X−12tr⁡(X)I is a well-defined complex-linear bijection to sl2(C) preserving commutators, since scalar matrices commute and commutators have trace zero.

2.2L1step 1.3

The group GL⁡2(C) is path connected: for g∈GL⁡2(C) choose z∈C× with z2=det⁡g; then z−1g∈SL⁡2(C), and paths in SL⁡2(C) and C× join g=z(z−1g) to I. Its quotient PGL⁡2(C) is therefore connected.

3.1L1L2step 1.1step 2.1step 1.2step 1.3step 1.4step 1.5step 2.2∎

An isomorphism of groups carries the center onto the center, so SL⁡2(C) and PGL⁡2(C) are not isomorphic, although steps 1.3 and 2.2 show both are connected and steps 1.1, 1.2, and 2.1 give both the complex semisimple Lie algebra sl2(C). This witnesses the failure of the claim: the two groups are distinct global forms of the same Lie algebra.

Sources