search

ericung / languageofpolynomials

A language of polynomials.
https://ericung.com/Articles/languageofpolynomials
MIT License
4 stars 0 forks source link

Review Chapter 2 of Artin #8

Closed ericung closed 4 months ago

ericung commented 4 months ago

induction and contradiction

ericung commented 4 months ago

abelian group used Z+ integers with loc as + and -

ericung commented 4 months ago

This will be the chapter longest spent.

ericung commented 4 months ago

x/y+y/x>2

= a+ a^-1>2

= A > 2

Contradiction of groups

is (AB)C = A(BC) and (AB)C != A(BC)? however (AB)C > 2 and A(BC) > 2 are both true

=====

A B such that AB >2

Proof: 4 cases

=====

Map f of A times g of B to a group G is called a homomorphism. Reductionism is a concrete example of a homomorphism in computational complexity theory.

====

For every 2Z or even sized number of indices there are n-1 partitions.

Proof will be useful in generalization of Fibonacci sequence