Extra Credit #4

Due: March 9, 2022
Points: 20


Let L = (SL, ≤L) be a lattice. Define:

  1. SIL = { [a, b] | a, bSLaL b }
  2. IL = { ([a1, b1], [a2, b2]) | a1L a2b1L b2 }
  3. lubIL([a1, b1], [a2, b2]) = (lubL([a1, a2), lubL(b1, b2))
  4. glbIL([a1, b1], [a2, b2]) = (glbL([a1, a2), glbL(b1, b2))
Prove that the structure IL = (SIL, ≤IL) is a lattice.


UC Davis sigil
Matt Bishop
Office: 2209 Watershed Sciences
Phone: +1 (530) 752-8060
Email: mabishop@ucdavis.edu
ECS 235B, Foundations of Computer and Information Security
Version of February 24, 2022 at 12:41PM

You can also obtain a PDF version of this.

Valid HTML 4.01 Transitional Built with BBEdit Built on a Macintosh