Cub11k's BIU Notes
Cub11k's BIU Notes
Assignments
Discrete-math
Discrete-math 1
Discrete-math 10
Discrete-math 11
Discrete-math 12
Discrete-math 2
Discrete-math 3
Discrete-math 4
Discrete-math 5
Discrete-math 6
Discrete-math 7
Discrete-math 8
Discrete-math 9
Infi-1
Infi-1 10
Infi-1 11
Infi-1 2
Infi-1 3
Infi-1 4
Infi-1 5
Infi-1 6
Infi-1 7
Infi-1 8
Infi-1 9
Linear-1
Linear-1 1
Linear-1 10
Linear-1 11
Linear-1 12
Linear-1 2
Linear-1 3
Linear-1 4
Linear-1 5
Linear-1 6
Linear-1 7
Linear-1 8
Linear-1 9
Linear-2
Linear-2 1
Lectures
Data-structures
Data-structures 1
Data-structures 2
Data-structures 3
Discrete-math
Discrete-math 10
Discrete-math 11
Discrete-math 12
Discrete-math 13
Discrete-math 14
Discrete-math 15
Discrete-math 16
Discrete-math 18
Discrete-math 19
Discrete-math 20
Discrete-math 21
Discrete-math 22
Discrete-math 23
Discrete-math 24
Discrete-math 25
Discrete-math 26
Discrete-math 3
Discrete-math 4
Discrete-math 5
Discrete-math 6
Discrete-math 7
Discrete-math 8
Discrete-math 9
Exam 2023 (2A)
Exam 2023 (2B)
Exam 2023 (A)
Exam 2023 (B)
Exam 2023 (C)
Exam 2024 (A)
Exam 2024 (B)
Exam 2024 (C)
Midterm
Infi-1
Exam 2022B (A)
Exam 2022B (B)
Exam 2023B (A)
Exam 2023B (B)
Exam 2024 (A)
Exam 2024 (B)
Exam 2025 (A)
Infi-1 10
Infi-1 12
Infi-1 13
Infi-1 14
Infi-1 15
Infi-1 16
Infi-1 17
Infi-1 19
Infi-1 20
Infi-1 21
Infi-1 22
Infi-1 23
Infi-1 24
Infi-1 25
Infi-1 26
Infi-1 5
Infi-1 6
Infi-1 7
Infi-1 9
Midterm
Theorems and proofs
Infi-2
Infi-2 1
Infi-2 10
Infi-2 11
Infi-2 12
Infi-2 13
Infi-2 14
Infi-2 15
Infi-2 16
Infi-2 17
Infi-2 2-3
Infi-2 3-4
Infi-2 5
Infi-2 6
Infi-2 7
Infi-2 8
Infi-2 9
Linear-1
Exam 2023 (B)
Exam 2023 (C)
Exam 2024 (A)
Exam 2024 (B)
Exam 2024 (C)
Exam 2025 (A)
Linear-1 11
Linear-1 12
Linear-1 13
Linear-1 4
Linear-1 5
Linear-1 6
Linear-1 7
Linear-1 8
Linear-1 9
Midterm
Random exams
Theorems and proofs
Linear-2
Linear-2 1
Linear-2 2
Linear-2 3
Linear-2 4
Linear-2 5
Linear-2 6
Linear-2 7
Linear-2 8
Seminars
CSI
CSI 2
Data-structures
Data-structures 1
Data-structures 2
Data-structures 3
Discrete-math
Discrete-math 1
Discrete-math 10
Discrete-math 11
Discrete-math 12
Discrete-math 2
Discrete-math 3
Discrete-math 4
Discrete-math 5
Discrete-math 6
Discrete-math 7
Discrete-math 8
Discrete-math 9
Infi-1
Infi-1 10
Infi-1 11
Infi-1 12
Infi-1 13
Infi-1 3
Infi-1 4
Infi-1 5
Infi-1 6
Infi-1 8
Infi-2
Infi-2 1
Infi-2 2
Infi-2 3
Infi-2 4
Infi-2 6
Infi-2 7
Infi-2 8
Linear-1
Linear-1 10
Linear-1 11
Linear-1 12
Linear-1 3
Linear-1 5
Linear-1 6
Linear-1 7
Linear-1 8
Linear-1 9
Linear-2
Linear-2 1
Linear-2 2
Linear-2 3
Linear-2 4
Linear-2 5
Linear-2 6
Linear-2 7
Templates
Lecture Template
Seminar Template
Home
Exam 2023 (C)
1
Let
L
=
{
x
|
A
x
=
b
,
b
≠
0
}
Let
H
=
{
x
|
A
x
=
0
}
Let
v
0
∈
L
Prove:
H
+
v
0
=
L
Proof:
Let
v
∈
H
+
v
0
⟹
∃
h
∈
H
:
v
=
h
+
v
0
A
v
=
A
(
h
+
v
0
)
=
A
h
+
A
v
0
=
0
+
b
=
b
⟹
v
∈
L
⟹
H
+
v
0
⊆
L
Let
v
∈
L
A
(
v
−
v
0
)
=
A
v
−
A
v
0
=
b
−
b
=
0
⟹
(
v
−
v
0
)
∈
H
⟹
(
v
−
v
0
)
+
v
0
∈
H
+
v
0
⟹
v
∈
H
+
v
0
⟹
L
⊆
H
+
v
0
⟹
H
+
v
0
=
L
2a
U
=
{
p
(
x
)
∈
R
2
[
x
]
|
p
′
(
1
)
=
0
p
(
1
)
=
0
}
W
=
s
p
(
{
1
+
x
+
x
2
,
x
+
x
2
}
)
Find basis and dimension of
U
+
W
,
U
∩
W
Solution:
Let
p
(
x
)
∈
R
2
[
x
]
p
(
x
)
=
a
+
b
x
+
c
x
2
⟹
p
′
(
x
)
=
b
+
2
c
x
p
′
(
1
)
=
b
+
2
c
p
(
1
)
=
a
+
b
+
c
{
b
+
2
c
=
0
a
+
b
+
c
=
0
⟹
{
b
=
−
2
c
a
=
c
⟹
U
=
s
p
(
{
1
−
2
x
+
x
2
}
)
U
+
W
=
s
p
(
U
∪
W
)
=
s
p
(
{
1
+
x
+
x
2
,
x
+
x
2
,
1
−
2
x
+
x
2
}
)
(
1
0
1
0
1
1
−
2
0
1
1
1
0
)
→
(
1
0
1
0
0
1
−
3
0
0
1
0
0
)
→
(
1
0
1
0
0
1
−
3
0
0
0
3
0
)
⟹
{
1
+
x
+
x
2
,
x
+
x
2
,
1
−
2
x
+
x
2
}
is a linear independence and is a basis of
U
+
W
⟹
d
i
m
(
U
+
W
)
=
3
d
i
m
(
U
+
W
)
⏟
3
=
d
i
m
(
U
)
⏟
1
+
d
i
m
(
W
)
⏟
2
−
d
i
m
(
U
∩
W
)
⟹
d
i
m
(
U
∩
W
)
=
0
⟹
{
0
}
is a basis of
U
∩
W
2b
Let
A
,
B
∈
F
n
×
n
Prove:
d
i
m
(
N
(
A
B
)
)
≤
d
i
m
(
N
(
A
)
)
+
d
i
m
(
N
(
B
)
)
Proof:
Let
v
∈
N
(
B
)
B
v
=
0
⟹
A
B
v
=
0
⟹
v
∈
N
(
B
)
⟹
N
(
B
)
⊆
N
(
A
B
)
Let
B
k
=
{
v
1
,
v
2
,
…
,
v
k
}
be a basis of
N
(
B
)
,
d
i
m
(
N
(
B
)
)
=
k
Let
B
k
+
t
=
{
v
1
,
v
2
,
…
,
v
k
,
u
1
,
u
2
,
…
,
u
t
}
be a basis of
N
(
A
B
)
,
d
i
m
(
N
(
A
B
)
)
=
k
+
t
∀
i
∈
[
1
,
t
]
:
A
B
u
i
=
0
⟹
B
u
i
∈
N
(
A
)
⟹
{
B
u
1
,
B
u
2
,
…
,
B
u
t
}
⊆
N
(
A
)
Let
∑
i
=
1
t
α
i
B
u
i
=
0
⟹
∑
i
=
1
t
B
α
i
u
i
=
B
∑
i
=
1
t
α
i
u
i
=
0
⟹
∑
i
=
1
t
α
i
u
i
∈
N
(
B
)
⟹
∑
i
=
1
t
α
i
u
i
=
∑
i
=
1
k
β
i
v
i
⟹
∑
i
=
1
t
α
i
u
i
−
∑
i
=
1
k
β
i
v
i
⏟
Linear combination of
B
k
+
t
=
0
B
k
+
t
is a linear independence
⟹
α
1
=
α
2
=
⋯
=
α
t
=
β
1
=
β
2
=
⋯
=
β
k
=
0
⟹
{
B
u
1
,
B
u
2
,
…
,
B
u
t
}
is a linear independence
⟹
d
i
m
(
N
(
A
)
)
≥
t
⟹
d
i
m
(
N
(
B
)
)
+
d
i
m
(
N
(
A
)
)
≥
k
+
t
=
d
i
m
(
N
(
A
B
)
)
⟹
d
i
m
(
N
(
A
B
)
)
≤
d
i
m
(
N
(
A
)
)
+
d
i
m
(
N
(
B
)
)
3a
Let
B
=
{
1
,
1
+
x
,
1
+
x
2
}
be a basis of
R
2
[
x
]
Let
C
=
{
(
0
0
0
−
1
)
,
(
1
0
0
0
)
,
(
0
2
0
0
)
,
(
0
0
1
1
)
}
be a basis of
R
2
×
2
Let
T
:
R
2
[
x
]
→
R
2
×
2
be a linear transformation
Let
[
T
]
C
B
=
(
1
0
2
0
1
3
1
1
5
1
−
1
−
1
)
Find basis and dimension of
I
m
(
T
)
,
k
e
r
(
T
)
Solution:
(
1
0
2
0
1
3
1
1
5
1
−
1
−
1
)
→
(
1
0
2
0
1
3
0
1
3
0
−
1
−
3
)
→
(
1
0
2
0
1
3
0
0
0
0
0
0
)
[
k
e
r
(
T
)
]
B
=
N
(
[
T
]
C
B
)
=
s
p
{
(
−
2
−
3
1
)
}
⟹
{
k
e
r
(
T
)
=
s
p
{
−
4
−
3
x
+
x
2
}
d
i
m
(
k
e
r
(
T
)
)
=
1
[
I
m
(
T
)
]
C
=
C
(
[
T
]
C
B
)
=
s
p
{
(
1
0
1
1
)
,
(
0
1
1
−
1
)
}
⟹
{
I
m
(
T
)
=
s
p
{
(
0
2
1
0
)
,
(
1
2
−
1
−
1
)
}
d
i
m
(
I
m
(
T
)
)
=
2
3b
Let
V
,
W
be finitely generated vector spaces
Let
T
,
S
:
V
→
W
be linear transformations,
S
is invertible
T
S
−
1
is injective
Is
T
neccessarily invertible?
Solution:
T
S
−
1
:
W
→
W
is injective
d
i
m
(
W
)
=
d
i
m
(
W
)
⟹
T
S
−
1
is surjective
⟹
T
is surjective
S
is invertible
⟹
V
≅
W
⟹
d
i
m
(
V
)
=
d
i
m
(
W
)
⟹
T
is injective
⟹
T
is bijective
⟹
T
is invertible
4a
Let
A
,
B
∈
F
n
×
n
Let
r
a
n
k
(
A
)
<
n
2
,
r
a
n
k
(
B
)
<
n
2
Prove or disprove:
A
B
=
0
Disproof:
A
=
B
=
(
1
0
0
0
0
0
0
0
0
)
⟹
A
B
=
(
1
0
0
0
0
0
0
0
0
)
≠
0
r
a
n
k
(
A
)
=
r
a
n
k
(
B
)
=
1
<
3
2
4b
Let
A
,
B
∈
F
n
×
n
,
A
B
=
0
Prove or disprove:
r
a
n
k
(
A
)
≤
n
2
∨
r
a
n
k
(
B
)
≤
n
2
Proof:
A
B
=
0
⟹
r
a
n
k
(
A
B
)
=
0
⟹
d
i
m
(
N
(
A
B
)
)
=
n
∀
v
∈
F
n
:
A
B
v
=
0
v
=
0
∀
v
∈
F
n
:
B
v
∈
C
(
B
)
⟹
C
(
B
)
⊆
N
(
A
)
⟹
d
i
m
(
C
(
B
)
)
≤
d
i
m
(
N
(
A
)
)
⟹
r
a
n
k
(
B
)
≤
n
−
r
a
n
k
(
A
)
⟹
r
a
n
k
(
A
)
+
r
a
n
k
(
B
)
≤
n
Let
r
a
n
k
(
A
)
=
k
>
n
2
⟹
k
+
r
a
n
k
(
B
)
≤
n
⟹
n
2
+
r
a
n
k
(
B
)
≤
n
⟹
r
a
n
k
(
B
)
≤
n
2
Let
r
a
n
k
(
B
)
=
k
>
n
2
⟹
k
+
r
a
n
k
(
A
)
≤
n
⟹
n
2
+
r
a
n
k
(
A
)
≤
n
⟹
r
a
n
k
(
A
)
≤
n
2
4c
Let
A
∈
R
3
×
3
be anti-symmetric
Prove:
A
(
1
1
1
)
=
(
a
b
c
)
⟹
a
+
b
+
c
=
0
Proof:
(
0
a
2
a
3
−
a
2
0
a
5
−
a
3
−
a
5
0
)
(
1
1
1
)
=
(
a
2
+
a
3
a
5
−
a
2
−
a
3
−
a
5
)
{
a
2
+
a
3
=
a
a
5
−
a
2
=
b
−
a
3
−
a
5
=
c
⟹
a
+
b
+
c
=
a
2
+
a
3
+
a
5
−
a
2
−
a
3
−
a
5
=
0
Note: this doesn’t work in
Z
2
Because
(
1
0
0
0
1
0
0
0
1
)
∈
Z
2
3
×
3
is anti-symmetric
5
Let
V
,
W
be finitely generated vector spaces over
F
Let
T
:
V
→
W
be a linear transformation
Let
S
:
W
→
V
be a linear transformation
,
T
S
T
=
T
5a
Show that not neccesserily
k
e
r
(
S
)
=
{
0
}
Solution:
Let
T
=
S
=
0
T
S
T
=
T
=
0
k
e
r
(
S
)
=
W
≠
{
0
}
5b
Prove:
k
e
r
(
S
)
∩
I
m
(
T
)
=
{
0
}
Proof:
Let
w
∈
k
e
r
(
S
)
∩
I
m
(
T
)
⟹
S
(
w
)
=
0
,
∃
v
∈
V
:
T
(
v
)
=
w
S
(
T
(
v
)
)
=
S
(
w
)
=
0
⟹
T
(
S
(
T
(
v
)
)
)
=
T
(
0
)
=
0
=
T
(
v
)
=
w
⟹
k
e
r
(
S
)
∩
I
m
(
T
)
=
{
0
}
5c
Prove:
∀
T
:
V
→
W
:
∃
S
:
W
→
V
:
T
S
T
=
T
Proof:
Let
B
T
=
{
w
1
,
w
2
,
…
,
w
k
}
be a basis of
I
m
(
T
)
⟹
∀
i
∈
[
1
,
k
]
:
∃
v
i
∈
V
:
T
(
v
i
)
=
w
i
I
m
(
T
)
⊆
W
⟹
∃
B
=
B
T
∪
{
w
k
+
1
,
w
k
+
2
,
…
,
w
k
+
t
}
basis of
W
⟹
By the defining theorem
∃
S
:
W
→
V
,
S
(
w
i
)
=
{
v
i
i
≤
k
0
i
>
k
Let
v
∈
V
⟹
∃
{
α
i
}
i
∈
[
1
,
n
]
⊆
F
:
v
=
∑
i
=
1
n
α
i
v
i
Let
T
(
v
)
=
w
∈
W
w
∈
I
m
(
T
)
⟹
∃
{
β
j
}
j
∈
[
1
,
k
]
⊆
F
:
w
=
∑
j
=
1
k
β
j
w
j
T
S
T
(
v
)
=
T
S
(
w
)
=
T
S
(
∑
i
=
1
k
β
j
w
j
)
=
T
(
∑
i
=
1
k
β
j
S
(
w
j
)
)
=
T
(
∑
i
=
1
k
β
j
v
j
)
=
∑
j
=
1
k
β
j
T
(
v
j
)
=
=
∑
i
=
1
k
β
j
w
j
=
w
=
T
(
v
)
⟹
T
S
T
=
T