The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+9 votes
801 views
If the longest chain in a partial order is of length $n$, then the partial order can be written as a _____ of $n$ antichains.
asked in Set Theory & Algebra by Veteran (59.6k points) | 801 views

2 Answers

+11 votes
Best answer
Suppose the length of the longest chain in a partial order is $n.$ Then the elements in the poset can be partitioned into $n$ disjoint antichains.
answered by Boss (34k points)
0
could you please explain with an example ?
0
@Arjun Sir ...not getting this Q/A... antichain  ??
+8

If the longest chain in a partial order is of length n, then the partial order can be written as a Partition of n antichains.

+6
each element of chain must be in different antichains so if chain having n elements so there must exist n disjoint antichains .
+2
0
Arjun sir not getting this question please explain sir ...
0
"Subset A of S is called anti chain if no 2 elements in A are comparable".

If i take a total ordered poset(Z,<=)  containing n elements then we know every element is comparable to every other. If we take any two of these n, they will also be comparable. So we can take atmost 1 element in a subset A. Total number of such subsets would be n.

Basically in any poset(not only totally ordered) having chain of length n, no two of these n elements can go to the same subset otherwise it won't be an anti chain because "no 2 elements in a subset is comparable". If they belong to same subset then these 2 will be comparable hence won't form an anti chain. So atleast n different subsets for these n elements.

Doubt: Will it be n+1 (1 because of empty subset)? There maybe more such anti chains containing combinations of elements other than these n. But should empty set be considered as an anti chain?
+8 votes

CHAIN : Let (A ,⋨) be a Poset .A subset of A is called Chain if every two elements in the subset are related.

ANTICHAIN: A subset of A is called Antichain if no two distinct elements in the subset are related.

THEOREM:  Let (A ,⋨) be a Poset.Suppose the length of the longest chains in A is n.Then the elements in A can be partitioned into n disjoint Antichains.

answered by Loyal (6.8k points)
+6
Ex : number of anti chains in [P(A),subset] where A = {1,2} is 3 (i.e)

                        1) {} ,  

                        2) {1,2} ,

                        3) {1} and {2} as {1} and {2} are not related they can form a single anti-chain.


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

40,880 questions
47,536 answers
146,089 comments
62,300 users