100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
First Course in Abstract Algebra A, 8th Edition by John B. Fraleigh, Verified Chapters 1 - 56, Complete Newest Version $17.99   Add to cart

Exam (elaborations)

First Course in Abstract Algebra A, 8th Edition by John B. Fraleigh, Verified Chapters 1 - 56, Complete Newest Version

 5 views  0 purchase
  • Course
  • Institution
  • Book

First Course in Abstract Algebra A, 8th Edition by John B. Fraleigh, Verified Chapters 1 - 56, Complete Newest Version

Preview 2 out of 11  pages

  • September 7, 2024
  • 11
  • 2024/2025
  • Exam (elaborations)
  • Questions & answers
avatar-seller
Solution Manual for First Course in Abstract Algebra A, 8th
Edition by John B. Fraleigh, Verified Chapters 1 - 56, Complete
Newest Version
set - ANSWER: a well defined collection of objects

elements/members - ANSWER: the objects that belong to a set

subset - ANSWER: A is a subset of B if every element of A is also an element of B.

proper subset - ANSWER: A is a proper subset of B if it is a subset of B but not equal
to B

equal sets - ANSWER: If A is a subset of B and B is a subset of A

empty set - ANSWER: a set with no elements

union of sets - ANSWER: the set of elements which are in A or in B

intersection of sets - ANSWER: the set of elements which are in both A and B

disjoint - ANSWER: when two sets have no elements in common

universal set - ANSWER: a fixed set U

complement - ANSWER: For any A a subset of the universal set, the complement of A
is the set of all elements of U which are not in A.

difference of two sets - ANSWER: A\B is the set of all elements of A which are not in
B

DeMorgan's Laws - ANSWER: Let A and B be sets, then the complement of their
union is the intersection of their complements, and the complement of their
intersection is the union of their complements.

Cartesian product - ANSWER: AxB={(a, b) | a in A, b in B}

relations - ANSWER: subsets of AxB

mapping/function - ANSWER: f is a subset of AxB from a set A to a set B is the special
relation where (a,b) is in f if for every element of A there is a unique b from B.

domain of f - ANSWER: A, given f a subset of AxB

range/image of f - ANSWER: f(A)={f(a) | a in A}, a subset of B

, well defined relation - ANSWER: if each element of the domain is assigned to a
unique element of the range

onto/surjective - ANSWER: If f:A to B is a map and the image of f is B, i.e., f(A)=B

one-to-one/injective - ANSWER: If a₁≠a₂ implies f(a₁)≠f(a₂)

bijective map - ANSWER: both one-to-one and onto

composition of f and g - ANSWER: Let f:A→B, g:B→C be mappings. (f₀g)(x)=(f(g(x)).

linear maps/transformations - ANSWER: maps from Rⁿ to Rⁿ' given by matrices

permutation - ANSWER: For any set S, a one-to-one, onto mapping π:S→S.

Let f:A→B, g:B→C, h:C→D.
1. The composition of mappings is:
2. If f and g are both one-to-one, then:
3. If f and g are both onto, then:
4. If f and g are both bijections, then: - ANSWER: 1. associative: (h₀g)₀f=h₀(g₀f).
2. the mapping g₀f is one-to-one.
3. the mapping g₀f is onto.
4. the mapping g₀f is a bijection.

identity mapping - ANSWER: If S is any set, id(s)=s for all s in S.

inverse mapping - ANSWER: A map g:B→A is an inverse of f:A→B if g₀f=id(A) and
f₀g=id(B)

invertible - ANSWER: a map that has an inverse, f⁻¹

A mapping is invertible iff - ANSWER: it is both one-to-one and onto.

equivalence relation on a set X - ANSWER: A relation R⊂X×X such that:
1. (reflexive) (x,x)∈R for all x in X.
2. (symmetric) (x,y)∈R implies (y,x)∈R.
3. (transitive) (x,y)∈R and (y,z)∈R implies (x,z)∈R.

similar matrices - ANSWER: A~B if there exists invertible P such that PAP⁻¹=B

partition P of a set X - ANSWER: A collection of nonempty sets X₁,X₂,... such that
Xi∩Xj=∅ for i≠j and ∪Xₙ=X

equivalence class of x - ANSWER: [x]={y in X | y~x}

1. Given an equivalence relation ~

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller kushboopatel6867. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for $17.99. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

81239 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 14 years now

Start selling
$17.99
  • (0)
  Add to cart