prizzyjade
  • prizzyjade
If G is a simple graph, the vector space of g is the vector space over the field Z2 of integers modulo 2, whose elements are subsets of E (G). The sum is E+F of two subsets E and F is the set odd edges in E or F but not both, and scalar multiplication is defined by1×E=E and 0xE=∅. Show that this defines a vector space over Z2 and find the basis of it.
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
chestercat
  • chestercat
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
well, we see that addition is commutative, and that both addition and scalar multiplication are clearly closed. show that scalar multiplication over addition distributes, i.e. k(E + F) = kE + kF. well, this is easy -- 0 = 0(E + F) = 0E + 0F = ∅. similarly, E + F = 1(E + F) = 1E + 1F = E + F. we get from this a free additive identity ∅ and a free scalar multiplicative identity 1. since 0 + 0 = 0, 0 + 1 = 1, and 1 + 1 = 0 are an exhaustive list of addition in Z/2Z, distribution of scalar sums over scalar multiplication is easy to demonstrate. show associativity, which is probably the hardest (and yet still overwhelmingly easy) to do
anonymous
  • anonymous
since addition is defined as a symmetric difference (i.e. xor, https://en.wikipedia.org/wiki/Symmetric_difference) we see that the sets of singletons consisting of individual edges (i.e. {E_1}, {E_2}, {E_3}, etc.) are a very nice basis to use here, since we can construct every other set of edges possible using these and symmetric difference
prizzyjade
  • prizzyjade
please can you elaborate it further ?

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

prizzyjade
  • prizzyjade
that's the last question i need to answer to finish my problem set in graph theory
prizzyjade
  • prizzyjade
it has something to do with linear algebra right ?

Looking for something else?

Not the answer you are looking for? Search for more explanations.