bi_left_translation_iter2_eq
In any magma with a B-element B and an I-element I, the left translations by ((B * I) * I) and ((I * I) * I) are equal: ((B * I) * I) * x = ((I * I) * I) * x for all x.
Statement
theorem bi_left_translation_iter2_eq {A : Type*} [Mul A] (B I : A) (hB : bmi_is_b_element B) (hI : bmi_is_i_element I) : ∀ x : A, (B * I * I) * x = (I * I * I) * x
- Source
- arXiv:2610.37108 Proposition 3.1
- Verified
- 31 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 2
- bmi_is_b_elementAn element $B$ in a magma $(A, \cdot)$ is a $B$-element if $((Bx)y)z = x(yz)$ for all $x, y, z \in A$.
- bmi_is_i_elementAn element $I$ in a magma $(A, \cdot)$ is an $I$-element (a left unit) if $Ix = x$ for all $x \in A$.
- Used by 1
- finite_bi_algebra_is_semigroup_with_left_unitsEvery finite BI-algebra is a semigroup with B and I as left units: let (A, ·) be a finite magma equipped with elements B, I in A such that…
Read back from the Lean
Let $A$ be a type with a multiplication operation. Let $B, I \in A$ such that $B$ satisfies bmi_is_b_element (for all $x, y, z \in A$, $((B * x) * y) * z = x * (y * z)$) and $I$ satisfies bmi_is_i_element (for all $x \in A$, $I * x = x$). Then for all $x \in A$, $((B * I) * I) * x = ((I * I) * I) * x$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
To show that ((B * I) * I) * x = ((I * I) * I) * x for all x, we evaluate both sides using the defining properties of B and I. The left-hand side reduces by the defining property of the B-element to I * (I * x), which simplifies to x because I acts as a left identity. The right-hand side, parsed with left-associative multiplication as (((I * I) * I) * x), likewise collapses to x by repeatedly applying I * y = y.
For an arbitrary element x ∈ A, the equation reduces to I * (I * x) = ((I * I) * I) * x.
Let x ∈ A be arbitrary. The assumption that B is a B-element (hB) states that B * u * v * w = u * (v * w) for all u, v, w ∈ A. Applying this to the left-hand side with u = I, v = I, and w = x rewrites ((B * I) * I) * x to I * (I * x).
intro x rw [hB]
Both sides reduce to x, completing the proof.
The assumption that I is an I-element (hI) states that I acts as a left identity: I * y = y for all y ∈ A. Repeatedly rewriting with this property simplifies the left-hand side from I * (I * x) to I * x and then to x. On the right-hand side, which is left-associated as (((I * I) * I) * x), the inner product I * I reduces to I, leaving (I * I) * x; this again reduces to I * x, and finally to x. Both sides reduce to x, which finishes the proof.
repeat rw [hI]
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- In a magma with a B-element and an I-element, ((BI)I)x = ((II)I)x for all x. -/theorem bi_left_translation_iter2_eq {A : Type*} [Mul A] (B I : A) (hB : bmi_is_b_element B) (hI : bmi_is_i_element I) : ∀ x : A, (B * I * I) * x = (I * I * I) * x := by intro x rw [hB] repeat rw [hI]