More of determinant

Algebra Level 5

Let I = [ 1 , 1567 ] , ( A i ) 1 i 2 1567 1 I =[|1,1567|] , (A_{i})_{1 \leq i \leq 2^{1567}-1} a non-empty part of I I numbered in any order and B M 2 1567 1 ( R ) B \in M_{2^{1567}-1}( \mathbb R) matrix defined by b i , j = 1 b_{i,j}=1 if A i A j A_{i} \cap A_{j} \ne \emptyset and b i , j = 0 b_{i,j}=0 otherwise. Submit your answer as det ( B ) \det(B) .


The answer is -1.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Brian Moehring
Feb 26, 2017

Here's a proof sketch:

We generalize the problem first. Define [ n ] : = { 1 , 2 , 3 , , n } [n] := \{1,2,3,\ldots,n\} , let ( A i , n ) (A_{i,n}) denote the 2 n 1 2^n-1 nonempty subsets of [ n ] [n] in some order, and define B n M 2 n 1 ( R ) B_n \in M_{2^n-1}(\mathbb{R}) with the same definition as given in the problem. Then by elementary row operations, we may show that for all n > 1 , n>1, B n = B n 1 2 . |B_n| = -|B_{n-1}|^2. Also, it's an immediate computation that B 1 = 1 |B_1| = 1 , so by induction on n n , we may see B n = 1 |B_n| = -1 for all n 2 n\geq 2 . In particular, by setting n = 1567 , n=1567, B = B 1567 = 1 |B| = |B_{1567}| = \boxed{-1}

Nice solution! we can even start by showing that the determinant doesn't involve the order of how we choose A i A_{i} that make it more easier when using induction.

Mehdi Elkouhlani - 4 years, 3 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...