Monoids defined by the Fibonacci

Sequence

Charles D Brock III

University of Central Missouri

Outline
Motivation

Factorization in the ring Z of integers is unique For example,

300 = 22 · 3 · 52 .
√ √
In Z[ −5] = {a + b −5 | a, b ∈ Z} √ factorization
√ is not
unique For example, 6 = 2 · 3 = (1 + −5)(1 − −5).
Factorization in Monoids

A monoid is a commutative, cancellative, additive

semigroup with 0.
An element a in a monoid H is an atom if it cannot be
written as the sum of two nonzero elements.
The elasticity of a monoid H is
ns o
ρ(H) = sup | a1 + · · · + as = b1 + · · · + bt , ai , bj atoms
t
Outline
Example 1
  
 x 
N3 = y  : x, y , z ∈ N
z
 
     
1 0 0
Atoms: α = 0 , β = 1 , γ = 0
    
0 0 1
 
x
Since y  = xα + y β + zγ every element in N3 has unique

z
representation as the sum of atoms.

ρ(N3 ) = 1 thus N3 is factorial.

Example 2

  

 w 

x
  
H=  y 
:w +x =y +z

 

z
 
       
1 0 1 0
0 1 0 1
Atoms: 
1 , 0 , 0 , 1
      

0 1 1 0
ρ(H) = 1 thus H is half-factorial.
Example 3

  
 x 
F= y : x + 2y = 3z

z
 
     
3 0 1
Atoms: 0 , 3 , 1
    
1 2 1
     
3 0 1
0 + 3 = 3 · 1 ⇒ 3
ρ(F) ≥ 2
1 2 1
Outline
How we define our sequence

A0 = 0

A1 = 1

An = bAn−1 + aAn−2 for n ≥ 2 with a, b ∈ Z and

gcd(a, b) = 1

A well known sequence: Fibonacci Sequence

1,1,2,3,5,8,13,21,... Our own sequence:
The Fibonacci Sequence

F0 = 0

F1 = 1

Fn = Fn−1 + Fn−2 for n ≥ 2

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, . . .

Theorem
  
 x 
Let Fn = y  ∈ N(3) | Fn x + Fn+1 y = Fn+2 z
z
 
     
Fn+2 0 1
1 If n ≥ 1, the atoms of Fn are  0  , Fn+2  , and 1 .
Fn Fn+1 1
Fn+2
Moreover, ρ(Fn ) = 2
.
   
1 0
2 If n = 0, Fn is a factorial monoid with atoms  0 and 1
0 1
x = 0 ⇒ Fn+1 y = Fn+2 z.
   
x 0
gcd(Fn+1 , Fn+2 ) = 1 ⇒ y  = r Fn+2 
z Fn+1

a = x = 0
     
0 a x 
r = 1: Fn+2 = b + y ⇒
      Fn+1 b = Fn+2 c
Fn+1 c z

Fn+1 y = Fn+2 z

gcd (Fn+1 , Fn+2 ) ⇒ b = c = 0 or y = z = 0
x = 0 ⇒ Fn+1 y = Fn+2 z.
   
x 0
gcd(Fn+1 , Fn+2 ) = 1 ⇒ y  = r Fn+2 
z Fn+1

a = x = 0
     
0 a x 
r = 1: Fn+2 = b + y ⇒
      Fn+1 b = Fn+2 c
Fn+1 c z

Fn+1 y = Fn+2 z

gcd (Fn+1 , Fn+2 ) ⇒ b = c = 0 or y = z = 0
x = 0 ⇒ Fn+1 y = Fn+2 z.
   
x 0
gcd(Fn+1 , Fn+2 ) = 1 ⇒ y  = r Fn+2 
z Fn+1

a = x = 0
     
0 a x 
r = 1: Fn+2 = b + y ⇒
      Fn+1 b = Fn+2 c
Fn+1 c z

Fn+1 y = Fn+2 z

gcd (Fn+1 , Fn+2 ) ⇒ b = c = 0 or y = z = 0
x = 0 ⇒ Fn+1 y = Fn+2 z.
   
x 0
gcd(Fn+1 , Fn+2 ) = 1 ⇒ y  = r Fn+2 
z Fn+1

a = x = 0
     
0 a x 
r = 1: Fn+2 = b + y ⇒
      Fn+1 b = Fn+2 c
Fn+1 c z

Fn+1 y = Fn+2 z

gcd (Fn+1 , Fn+2 ) ⇒ b = c = 0 or y = z = 0
    
x Fn+2
y = 0 ⇒ y  =  0 
z Fn

   
x 0
z = 0 ⇒ y = 0
  
z 0
    
x Fn+2
y = 0 ⇒ y  =  0 
z Fn

   
x 0
z = 0 ⇒ y = 0
  
z 0
x 6= 0, y 6= 0, z 6= 0

Fn (x − 1) + Fn+1 (y − 1) = Fn x − Fn + Fn+1 y − Fn+1

= Fn x + Fn+1 y − (Fn + Fn+1 )
= Fn x + Fn+1 y − Fn+2
= Fn+2 z − Fn+2
= Fn+2 (z − 1)
     
x x −1 1
⇒ y  = y − 1 + 1
z z −1 1
x 6= 0, y 6= 0, z 6= 0

Fn (x − 1) + Fn+1 (y − 1) = Fn x − Fn + Fn+1 y − Fn+1

= Fn x + Fn+1 y − (Fn + Fn+1 )
= Fn x + Fn+1 y − Fn+2
= Fn+2 z − Fn+2
= Fn+2 (z − 1)
     
x x −1 1
⇒ y  = y − 1 + 1
z z −1 1
x 6= 0, y 6= 0, z 6= 0

Fn (x − 1) + Fn+1 (y − 1) = Fn x − Fn + Fn+1 y − Fn+1

= Fn x + Fn+1 y − (Fn + Fn+1 )
= Fn x + Fn+1 y − Fn+2
= Fn+2 z − Fn+2
= Fn+2 (z − 1)
     
x x −1 1
⇒ y  = y − 1 + 1
z z −1 1
Atoms of Fn

     
 Fn+2 0 1 
A(Fn ) =  0  , Fn+2 , 1
  
Fn Fn+1 1
 
A Lower Bound on the Elasticity

       
Fn+2 Fn+2 0 1
α = Fn+2 =
   0  + Fn+2 = Fn+2 · 1
  
Fn+2 Fn Fn+1 1

Fn+2 Fn+2
⇒ ρ(α) ≥ 2
⇒ ρ(Fn ) ≥ 2
A Lower Bound on the Elasticity

       
Fn+2 Fn+2 0 1
α = Fn+2 =
   0  + Fn+2 = Fn+2 · 1
  
Fn+2 Fn Fn+1 1

Fn+2 Fn+2
⇒ ρ(α) ≥ 2
⇒ ρ(Fn ) ≥ 2
            
Fn+2 0 1 Fn+2 0 1
a  0 +b Fn+2 +c 1 = x
      0 +y Fn+2 +z 1
   
Fn Fn+1 1 Fn Fn+1 1

a+b+c Fn+2
>
x +y +z 2

2a + 2b + 2c > Fn+2 x + Fn+2 y + Fn+2 z,

Fn+2 a + c = Fn+2 x + z,

Fn+2 b + c = Fn+2 y + z
 2a + 2b + 2c > Fn+2 x + Fn+2 y + Fn+2 z, (1)

Fn+2 a + c = Fn+2 x + z, (2)

Fn+2 b + c = Fn+2 y + z (3)

⇒ a(2 − Fn+2 ) + b(2 − Fn+2 ) > z(Fn+2 − 2), ⇒⇐

 2a + 2b + 2c > Fn+2 x + Fn+2 y + Fn+2 z, (1)

Fn+2 a + c = Fn+2 x + z, (2)

Fn+2 b + c = Fn+2 y + z (3)

⇒ a(2 − Fn+2 ) + b(2 − Fn+2 ) > z(Fn+2 − 2), ⇒⇐

Theorem
  
 x 
(3)
Let Fn = y ∈ N | Fn x + Fn+1 y = Fn+2 z

z
 
     
Fn+2 0 1
1 If n ≥ 1, the atoms of Fn are  0  , Fn+2  , and 1 .
Fn Fn+1 1
Fn+2
Moreover, ρ(Fn ) = 2
.
The End

Thanks for Listening!