Let F be the set of all functions from {1,..., n} to {0,1}. Define the binary relation ≤ on F as follows:
∀f,g ∈ F, f ≤ g if and only if ∀ x ∈ {1, ..., n}, f(x) ≤ g(x), where 0 ≤ 1.
Which of the following statement(s) is/are TRUE?
Solution :
The correct options are:
1. (F, ≤) is a partial order
2. (F, ≤) is a lattice
1. Proof that (F, ≤) is a partial order:
A binary relation ≤ on a set F is a partial order if it is reflexive, antisymmetric, and transitive.
Reflexivity:
Let . For every , . Since the standard ordering on is reflexive, we have:
for all .
By definition, this implies . Thus, the relation is reflexive.
Antisymmetry:
Let such that and .
By definition:
For all , and .
Since the relation ≤ on the set of codomain values is antisymmetric, this implies:
for all .
Therefore, . Thus, the relation is antisymmetric.
Transitivity:
Let such that and .
By definition:
For all , and .
Since the standard relation ≤ on is transitive, it follows that:
for all .
By definition, this implies . Thus, the relation is transitive.
Since ≤ is reflexive, antisymmetric, and transitive, is a partially ordered set (poset).
2. Proof that (F, ≤) is a lattice:
A partially ordered set is a lattice if every pair of elements has a unique supremum (least upper bound, LUB) and a unique infimum (greatest lower bound, GLB).
Let .
Define a function pointwise as:
for all .
Since the codomain of both and is , the maximum at each point is also in , so .
This function acts as the least upper bound (join) of and because:
- and for all , which means and (so is an upper bound).
- If there is any other upper bound such that and , then for all , and , which implies , meaning . Thus, is the least upper bound, written as .
Similarly, define a function pointwise as:
for all .
By a symmetric argument, is the greatest lower bound (meet) of and , written as .
Since every pair of functions has a unique join and meet, is a lattice.
3. Why the other options are incorrect:
- ≤ is a symmetric relation: This is false. Consider the constant functions and for all . Since at all points, we have . However, because .
- ≤ is an equivalence relation: Since an equivalence relation must be symmetric and this relation is not, ≤ is not an equivalence relation.
Completely free for students. Educators & coaching institutes get 2 months free Pro trial to create tests.
Access unlimited practice questions, detailed step-by-step solutions, and exam study materials — completely free for students.
Create and conduct professional online assessments with AI question generation, tab proctoring, and comprehensive batch management.
Prepare for GATE 2026 Civil Engineering with the latest question papers, previous year papers, detailed solutions, syllabus, exam pattern, preparation tips, mock tests, and subject-wise study material. Download GATE 2026 CE question papers with solutions in PDF format and boost your preparation for top engineering institutes and PSU recruitment.
Prepare effectively for GATE 2026 Electronics & Communication Engineering (EC) with this comprehensive Question Paper with Solutions. This resource includes detailed explanations, concept-wise solutions, previous year paper analysis, and exam-oriented practice to help aspirants strengthen core subjects like Electronic Devices, Analog Circuits, Digital Circuits, Signals & Systems, Network Theory, Control Systems, Electromagnetics, Communications, and more. Perfect for revision, self-assessment, and boosting your GATE 2026 EC preparation strategy.
Copyright © 2026 Combe Labs Private Limited. All Rights Reserved.