Let $h$ be a homomorphism monoid $M =\{0,1\}^*$ $h: M \to M, h(0) = 1, h(1) = 010$ And it is true: $h^3(1^+) = (h(1)h(1)h(1) )^+ $ I don't understand this equation.
2026-03-27 05:34:33.1774589673
Homomorphism. Equation.
43 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in MONOID
- What concept does a natural transformation between two functors between two monoids viewed as categories correspond to?
- Monoid but not a group
- In a finite monoid (M, $\circ$) if the identity element $e$ is the only idempotent element, prove that each element of the monoid is invertible.
- Maps between free commutative monoid monad and the free monoid monad
- Do Monoid Homomorphisms preserve the identity?
- Finitely Generated Free Group to Finitely Generated Free Monoid
- free commutative monoid monad
- Let $M$ be a monoid and let $M^*$ be the group of invertible elements of $M$. Prove the following...
- Monoid ring over a field is a finitely generated $k$-algebra
- a generalization of group (monoid with order-by-order invertible elements)
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
After the clarifications in the comments below the question, I understand your question as follows: is it true that $\Big( h(1^+) \Big)^3 = \Big( h(1)^3 \Big) ^+$? For mathematicians not accustomed with notations from formal languages, this can be reread as: is it true that for every $n \ge 1$ there exist $m \ge 1$ such that $\Big( h(1^n) \Big)^3 = \Big( h(1)^3 \Big) ^m$? Let us prove the statement by induction on $n$: clearly it is true for $n=1$ (just choose $m=1$); for $n>1$
$$\Big( h(1^{n+1}) \Big)^3 = \Big( h(1^n 1) \Big)^3 = \Big( h(1^n) h(1) \Big)^3 = h(1^n) h(1) h(1^n) h(1) h(1^n) h(1)= h(1)^m h(1) h(1)^m h(1) h(1)^m h(1) = h(1)^{3m+3} .$$
In fact, one can do even better: the above proof shows that the dependence of $m$ on $n$ can be given recursively by $m(n+1) = 3 m(n), \space m(1)=1$. This gives $m(n) = 3^{n-1}$, so we can be even more precise: $\Big( h(1^n) \Big) ^3 = \Big( h(1) \Big)^{3^{n-1}}$.