Thank you very much. Good morning, Members, officers and any members of the public who are viewing the live stream of this meeting. Welcome to this meeting of the Civic Affairs Committee on Thursday, 9 September 2021. My name is Councillor Anna Bradnam, I'm the Chair of the Civic Affairs Committee. For the information of members of the public, our Committee is responsible for reviewing the Constitution, Electoral arrangements a ddylch i'r cyflwyno a gweithio'r standydau ethigol. Rwyf wedi bod gennym ni'n gweithio'r cyfnodau o'r lleidio. Fy fyddwn i'n gweithio'n cyffredinol oherwydd y syniad ymlaen i'r cyffredinol yn ystod o'r cyfrannu a'r weddag, ond mae'n gweithio'n gweithio, ac mae'n gweithio'n gweithio i'r cyfrannu, a dyna ni eisiau ydych chi, ond nid oedd yma yn ddifft y cyfrannu ac mae'n gwirionedd o'r cyfrannu a ddim ni'n gwirionedd. Felly mae'n gweithio'n gweithio'n gweithio i'r cyfrannu. Fy fyddwn i'n gweithio'n gweithio'n gweithio'n gweithio'n gweithio'n gweithio, ond yw'n ddigwydd yn y cyfrannu, y lluniau yn y cwysig yn y lluniau'r cyfrannu yn ystod y bydd yma i ymgyrchu yng nghymdd, The camera follows the microphone being switched on, so councillors and officers are advised to wait a couple of seconds before speaking to allow the camera to catch up. Please, can those participating in the meeting via the live stream indicate that you wish to speak via the chat column? Please use the chat column for any other purpose. Please don't use the chat column for any other purpose because it's a live document. Please make sure that your device is fully charged and that you switch your microphone off unless you're invited to do otherwise. Please ensure that you've switched off or silenced any other devices you have so that they do not interrupt proceedings. And when you're invited to address the meeting, please make sure that your microphone is switched on.  And also please remember to speak slowly and clearly because of the internet not always being perfect. And please don't talk over or interrupt anyone. If we need to vote on an item, we'll use the microphones to vote. Only members in the chamber are allowed to vote. Those members who propose or second proposals must also be in the room. Committee members present, I'll now invite each of you to introduce yourselves. Members, after I call your name, please turn on your camera and microphone. Wait a couple of seconds, say your name so that your presence may be noted. May I start by asking members in turn? Vice-chair, councillor Dr Clare Daunton. Thank you, Clare Daunton. I'm Clare Daunton, vice-chair of this committee. And I'm one of the members for the Fendit and Full-Born Ward. Thank you. Councillor Henry Batchelor. Good morning, Chair. Councillor Henry Batchelor, one of the members for the Linson Ward. Councillor Cathcart. Good morning. Nigel Cathcart, a member of the Bassing-Born Ward. Thank you. Councillor Howell. Good morning, Chairman. Vice-Chairman. My name is Mark Howell. I am the member for the Caxton and Paterson. Councillor Howell, you might need to have your microphone a little bit closer. Just so that we can hear you more clearly. Thank you. Great. I believe Councillor Heather Williams. Thank you, Chairman. Slight and shock, because Councillor Howell has never been accused of not being heard before. But you might represent the Mordans ward. He was speaking with unusual gentleness today. Are there, we have no other members present in the room, but I know we have councillor Dr Martin Kahn present online. Councillor Martin Kahn. It's lovely to see you. Thank you. Are there any other members attending online who are unaware of? Thank you very much. And remember, members taking part online will not be able to vote. So, can I also introduce our officers, Rory McKenna, who is the monitoring officer and Deputy Head of Legal. Good morning, Chair and committee members. Thank you, Rory. And Patrick Adams from Democratic Services. Good morning, Chair. Patrick is taking the minutes of this meeting. So, item one on the agenda, apologies. Patrick, could you give us the apologies for the absence for today, please? Certainly, Chair. We've had apologies from Councillor Bridget Smith, Councillor Aidan van der Wy, and just to be clear that Councillor Martin Kahn is appearing virtually both as he isn't present. And is Councillor Richard Williams taking part as an observer, or as a member of this committee? Sorry, just a reminder. Councillor Richard Williams is not a member of the committee, so he's taken part as an observer. Thank you very much. Thank you. Right. So, declarations of interest. Do any members have interest to declare in relation to any item of business on this agenda? If an interest subsequently becomes apparent later in the meeting, please would you raise it at that point? Any members have any interest to declare? Councillor Heather Williams. Thank you, Chairman. Just on the gender item five about the update on code of conduct complaints, my same declaration as previous. We don't know who the parish councillors at Basinbourne are, and as I know, some of them, I have to declare it in case it's one of them. Okay. Thank you very much. Sorry, Councillor Cathcart. Do you turn your microphone on, Councillor Cathcart? Yes, I know them as well, so I need to. So, you're making the same declaration. Thank you very much. So, item three is the minutes, but a number of us noted that the minutes were not appended to this agenda. So, rather than approve them today, I'm going to propose that we defer that to the next meeting of the Civic Affairs Committee. Is that agreeable? I agree. Okay, thank you very much. So, we come on to item four, code of conduct, which asks the committee to recommend to council the adoption of a new code of conduct to take effect from May 2021. I think that might mean... We can't do it retrospectively, can we? Should it be May 2022? It should be May 2022. I'm looking to Rory. Yeah, I think that's correct. If you notice at the committee report on page 1.5, it does actually say in the recommendation that the guidance is to take effect from May 2022, and that's the recommendation under which members will be voting. Great. Thank you very much indeed. So, can I ask Rory McHenner to introduce this item please? Thank you. Oh, sorry. Councillor Hull. Councillor Williams. Oh, Councillor Williams, Councillor Williams. Thank you, Chairman. I think I was going to introduce it as Chair of the Task and Finish Group. Okay, that's fine. So, yes. The Antibody and Task and Finish Group have looked at this in great detail. There's many, many pages of it. And we felt that it was a significant improvement, particularly around areas of harassment and others. So, we were content to recommend it without any alterations. The reason for suggesting it comes into force in May 2022 as per page 1 was mainly for an administrative point of view. There are significant changes into actually declarations of interest and how those are managed. And given that the parish councils will most likely follow our lead and there are district council elections in May 2022 and parish council elections then, it made sense to bring it all forward at that point rather than doing something now and having to repeat it at a later date. It was also raised that because it is significant changes that we will need to have training as well as members and others and any details of that, Mr McHenner, I'm sure can fill members in on. So, our understanding is that there will be a full training programme on it as well. Thank you, Chairman. Thank you very much, Councillor Williams. As a relatively newbie to this subject because I have only been the chair of this committee for a short time, could I ask the vice-chair who was involved in the derivation of this before as well for any comment? Thank you, Chairman. Yes, I'd like to recommend this for adoption. The issue of discussing this model code of conduct goes back. I would have thought probably about a year now when there was discussion at full council and myself and the then Chairman of Council, Dr Delacy, recommended looking at what was then in draft, the LGA Model Code of Conduct in draft, and the LGA Working Party, Cross Party, Working Party of the LGA, had put on their website an early version of what you see here today and it did seem sensible to work on that, to work on the draft. And I'm glad to see that the final version has come to us here today. There are a couple of points of detail that I wanted to take up, but I'll come back to those later. Thank you. Mr McKenna, would you like to make any comment? Thank you, Chair. So through you, obviously the guidance which is now being produced by the Local Government Association isn't, in my opinion, very extensive. I think it will benefit members, it will benefit members of the public and it will also assist myself in having to deal with any code of conduct complaints which unfortunately do follow. The only other point that I would just like to make as well is that in having an implementation date of May 2022 that obviously facilitates the parish councils as well and would be the recommendation that they follow suit and adopted in May 2022 if that's their wish to do so because, as has been indicated, the member interest forms will need to be amended given that there will be changes in declarations of interest so members will know them now as disposable pecuniary interests and non-disclosable pecuniary interests, DPIs and MPIs for short. Obviously if this code is adopted, I would recommend the two-fold council and ultimately adopt it in September. The forms will have to change. Obviously DPIs will stay as they are but MPIs will be replaced by two other classifications of interest which are contained within the report. Chair, I don't have anything else that I wanted to say. I think it's been covered. It's certainly my recommendation that members do recommend a council the adoption of the new model code and the guidance. Thank you. Thank you. My own observation is that a previous code of conduct was nine pages and it's gone up to 16 but I think that's helpful in a way because I know that there are some very useful working examples in the guidance which are helpful for understanding so it's been good. Does anybody have any comments for the comments to make? I welcome this. It seems to be a useful strengthening in many ways based on the existing code. In particular things like bullying and disrespectful behaviour do seem to be strengthening more clearly defined here because it's quite a subjective area. I think members of the authority and the parish council need to be aware that it can actually cause difficulty it can cause distress in fact. I think that clarity is to be welcomed frankly and I think for instance the parish council needs to be aware that it has been strengthened so one would look forward to it being implemented. I mean it is subjective as I say so it's a tricky one, the line between having an opinion forcefully expressed which is fine but going beyond that and actually trying to coerce people to do it in a way that causes them to feel that they have been treated disrespectfully. It is an area where judgement is required there's no doubt about that and it can't be subject to exact definition but this does try to do that to an extent as possible so I think that's to be welcomed. The only other point I think I'd make is if complaints are made and a subsequently found not to have foundation I'm just wondering whether there's any scope for how can I put this the applicant you see in law if in fact for instance you take a case against someone and it's found not to be valid and that often costs what I'm really trying to say the code is it's too easy to make a complaint which doesn't have foundation only to find the applicant that the individual has spent a lot of time on it causes a distress and it's totally not a foundation and really a question for Rory I suppose is there anything for instance is there any mechanism for charging I mean in law if you lose a case you expect to pay the legal costs I don't really know it's just a quash query to wonder whether a failed complaint can attract any sort of a costly authority in dealing with it. Let's put that question to Mr McKenna. You probably can't. Thank you chair and through you I think Councillor Cathcart has actually just answered his own question there unfortunately the short answer is no there's no ability to recover costs in that event. Right I see, I just wonder that takes quite a lot of office of time to deal with and it would be a way of making people pause and think about whether a claim really is actually valid or not but as you say there's no mechanism for dealing with it. Yeah I absolutely take your point on board I suppose the counter to that argument is you wouldn't want to put people off making a complaint for fear that they make a cost to the world against them. Yeah it's a tricky one I agree because you don't want to discourage valid complaints that is what I'm really trying to say is it would be nice to feel in some way of discouraging frivolous or complaints that are made with that foundation but apparently there isn't any way to do that. Not that I'm aware of. Okay thanks very much. I'm aware that in the room we have requests to speak from councillor Henry Batchelor and councillor Heather Williams but first of all I'm going to take councillor Martin Kahn as he's remote. Councillor Kahn would you know it? Yes I think this is going to cause a problem. It's a problem. Did you agree on the participation of such a plan but it's almost something that is very... Thank you councillor Kahn it's a very good point. I don't know whether we... Mr McKenna. Thank you chair. So through you if members turn to page 2 of the report at point 14 one of the changes that is proposed is a new classification of interests known as other registrable interests and you can see there at A, B and C the different categories of interests that need to be registered and then within the guidance it does give further information as to the detail of what would need to be registered so for instance if you look over at page 4 there is detailed guidance I don't propose to go through it in the meeting here today but there is detailed guidance for instance about campaigning on Facebook groups and the need for those to be registered so what I can say to members is that there is a lot more detail certainly in the new proposed code and in the guidance to to deal with such matters. Thank you Mr McKenna. So councillor Henry Bachelor. Thank you chair. I'll be brief. Just say I will be supporting this I think anything that brings us in line with the LGA's recommendations I think can only be a positive thing specifically as councillor Kahn just mentioned the expansion on registered interests I think that is a positive change anything that clarifies that given it's quite a serious thing that councillors both districts and parish need to do I think can be a positive I mean if we look on the next item I think there are a couple of complaints against various people regarding not registering interests correctly so I think clarity around that will be a positive step and yeah so as I say fully supportive of this and I trust the work of the task and finish groups will be supporting. Thank you chair. Thank you very much councillor Bachelor, councillor Heather Williams. Thank you chairman and I would just say on the remarks from councillor Kahn on Facebook and campaigning and other things such as that not quite sure what's going on with the video scrolling up there and yeah so I think that's why when I introduced the item I said about the training I think that's going to be really really important and crucial to get that right just on the comments from councillor Cathcart I think what can be made clear is that about how we deal with a vexatious person for example so if somebody puts a complaint in against somebody time after time after time always being found without grounds and everything else on the same basis then I think we do have protocols in place for that and maybe it might be worth making sure that that's accessible alongside the code of conduct I mean Mr McKennaw I know more than myself because I think that's we don't want to discourage people from make a complaint but I see what you mean if one person is becoming sort of persecuted in some respect you want to give them some protection and I think the vexatious policies perhaps would do that that is my understanding too so Mr McKennaw would you like to respond on that yeah, chair of council Williams is absolutely correct, the council does have a vexus complainants policy that could be engaged if that scenario were to arise thank you and councillor doctor Claire Dalton I'm really pleased to see it's spelled out clearly on page 25 under respect respect means politeness and courtesy in behaviour speech and in the written word and I do think that's really important and I know that we have seen egregious examples of that's not being observed and I think having it spelled out here in our reiterating that is really very important and actually one would hope that there would be no dispute about the meaning and the exercise of politeness and courtesy and behaviour one would hope that thank you very much so doesn't sound as though anybody wishes to vote against this proposal sorry, councillor Howell yeah, I don't want to vote against it I want to ask a question sorry, no, I didn't seem forward to go through the paper just one thing I don't know if this can be answered but it would be a good one for Rory to have a ward anyway when is a counciller not a counciller so when does a counciller on a Friday night in a public house with a couple of drinks inside them not a counciller and if things get a bit heated then that can't be classified as being them acting in a disrespectful manner to somebody or whatever if I missed that is there a risk factor somewhere thank you councillor Howell for the question I have to say sometimes that can be quite a contentious point because obviously one of the first things that I need to consider along with the independent person and the investigation of any complaint is are they acting in their capacity as a counciller now on page 40 of the agenda pack there is actually very detailed guidance around that very scenario and as you will note at the bottom of page 41 they do go on to give specific examples of when a counciller is indeed acting in their capacity because obviously if you're acting in your capacity as a private individual the code of conduct is not engaged but sometimes it's not as clear cut and it's a matter of the facts of the individual circumstances but certainly the guidance in that respect is very very helpful I'm not going to go through the examples they're there for members to see I think one of them talks about situations about whether or not there is a relationship between a counciller and an employee for instance with the code being engaged in that circumstances and I think they go on to give more detail but it's certainly helpful from my point of view to have this guidance in assessing whether or not the code is engaged in any particular circumstance Chairman with your indulgence please the reason I'm asking that is that if for example and I'll stick to the example I just gave a counciller is out and they're having a night out with some friends and then somebody says to them something about I don't have a planning issue in the local area or for that matter a contentious issue what happens to be taking place is the counciller then when they give an information to a counciller or somebody in the public who's had several drinks and things get heated as long as that's taken into consideration I don't think we can legislate or define it one way or the other because the one swaps back and forth and as long as that's been taken into consideration I'm happy with that It would absolutely be taken into consideration and I think you would then get into the detail of the facts of the particular circumstance so a few for instance were out on a Friday night having a few drinks with your friends and your family and somebody decided that they wanted to engage you in your role as a counciller I'm off duty, I'm with my friends and family I would say in that instance that very clearly you're not acting in your capacity as a counciller albeit someone's trying to engage you I'd say if you were to then engage that person and say this is the person you need to speak to or you're engaged in the discussion then it might be that you are acting in your capacity as a counciller certainly if you're giving advice and you're clearly holding yourself out to be a counciller then arguably at that stage the code would be engaged but it's very much a matter of the circumstances that led to it If you've said, I'm off duty thanks very much, I'm not interested then know the code wouldn't apply in my opinion To be fair what I see is it can clearly be a very fine line and indeed in the example on page 42 it refers to a situation where you might be misusing or attempting to misuse your position as a counciller and that, and I'm reading from it would include if you threatened to use your position improperly to block someone's planning licence or grant application whereas if somebody said to you what do you think would be the best thing to do in this situation you know because you're on planning committee that might be a slightly trickier thing and I guess the situation depending on the situation you would decide whether to say actually I don't think I can advise you on that on a Friday evening in the pub or whether you say actually if you want to email me I'll deal with it through email at a later date, would that be a wise move I think it's reasonable probably to assume in that situation that you're not acting in your capacity as a counciller and therefore the code wouldn't be engaged Thank you Is that satisfactory councillor Hull I think it's one of those situations we'll have to see when it arises, but yes thank you very much indeed Thank you Oh and councillor Henry Bachelor Thank you, I won't delay proceedings but just a quick question we've mentioned parish councils a couple of times should this code be adopted starting May 2022 is there any obligation for parish councils to adopt this particular code as well given that again on the next item we have seven complaints against parish councils predominantly around the code of conduct so I just want to ask is it going to be uniform across districts in parish My understanding was that it's optional but Mr McKenna So the position regarding prize councils is similar to the district councils and as much as they must have adopted a code relevant to their parish council Now my understanding is that the majority of parish councils in South Cams have adopted the local authorities model code but there are some who have not followed the model and have got their own code relevant to their own circumstances I would imagine that the majority will follow the council's lead and will adopt the model code but they're not obliged to Thank you So it doesn't look to me as if anybody's minded to vote against this proposal so are we able to take that by affirmation Mr McKenna or do you want to take a vote? I would be happy for it to be taken by affirmation Chair I'll just read the recommendation just for a moment So the recommendation is that civic affairs committee recommends to full council the adoption of the model code and guidance to take effect from May 2022 So will all those in agreement raise your hands? So that's unanimous Thank you very much So that's carried So item 5 on our agenda is the update on the code of conduct complaints Can I ask Mr McKenna to introduce this item please? Thank you chair So through you this is the standard updating report there's no vote required that is taken at the end of each civic affairs committee and it updates members on progress of code of conduct complaints as you can see from the report there were a number of complaints which were ongoing since the last time committee met I'm pleased to say that the majority have now been dispensed with and decisions have been issued there are two complaints which are currently outstanding and chair that's my report Thank you very much Mr McKenna Would anybody like to ask any questions? No, okay So we're simply asked to recommend to note that report Civic affairs are asked to note the progress of any outstanding complaints and the conclusion of cases resolved since the last meeting and we've done that Members you'll see from your agenda that the next meeting is scheduled to be held on the 7th of December 2021 at 10am and with that I'd like to say thank you very much to those who took part online and thank you to those who attended here in the council chamber and I close the meeting at 10.34 Thank you Chairman


Today, I'm going to be revisiting a Linux distribution that I first took a look at about two or three years ago on the channel, and my initial reaction to this particular Linux distribution was pretty harsh, pretty negative, and to be honest, a lot of that was just me coming at it at a bad time. You know, sometimes, you know, real life gets in the way sometimes of making videos. Maybe you're just in a bad mood that day or at the time, I really just didn't like taking a look at a lot of Linux distributions. It's kind of burnout on these Linux installation and first look kind of videos that I typically do. And it came across on that very first time that I took a look at Instant OS. And Instant OS, after I took a look at it a couple of years ago, really, it hadn't had an update in a long time. And matter of fact, most people when you were talking about Instant OS, looking at Instant OS online is they just assumed it was a dead project. But no, no, no, about two or three weeks ago, they put out a new version, a beta release. This is beta seven of Instant OS. I'm going to take a look at that today. So I've spun up a virtual machine here. I gave this virtual machine six gigs of RAM and two threads of my 24 thread CPU. So should be plenty of resources, by the way, for those of you not familiar with Instant OS, it is a arch Linux based distribution. It has a different kind of window manager desktop environment. It's very reminiscent of DWM and a lot of the suckless utilities like D menu and things like that. I want to say that it was originally a fork of DWM, the Instant window manager that we're going to be taking a look at. So let's go ahead and install Instant OS. All right. And we're in our live environment and it doesn't look like we get any kind of wallpaper drawn or anything. I don't know if that's meant to be like that or kind of a glitch. But it says virtual machine, would you like to switch to 1080p resolution? So that is a nice touch, because obviously I would and then it draws the wallpaper. That's why it was a black screen. That makes sense because if it draws the wallpaper before switching to 1080p resolution, the wallpaper wouldn't be sized correctly if you switched to 1080p. So yeah, very cool. So we have our welcome out, welcome to Instant OS. And we may take a look at some of this later, but right now I want to do the install. And OK, so the keyboard would work in this. I don't know if it was a fork of D menu or a Rofi or what this this kind of menu system is, but it does look nice and it does function well. And it looks like we're going to do an installation in a terminal. Now we're going to get some prompts here. So says downloading installer dependencies. All right, I guess it finished the download. Now it says welcome to the instant OS installer. So let's click next. All right, select keyboard layout. And for me, I'm going to use US and select language English and then select the mirror location. Let's see if they have any US mirrors. They do. Is this system a virtual machine? Yes, I'm assuming that's to make sure correct drivers are installed. And of course, it wants to know what type of virtual machine I'm using. KVM slash QEMU says morning. QEMU on AMD is not meant for desktop use and is lacking some features. This installation will work, but some features may be disabled. OK, so select region. So this is going to be for your time zone. I'm going to be in America slash Chicago. So that will set the time to be in the central time zone for me. Select the disk. I only have one virtual hard drive in this virtual machine. So there's only the one disk for me to choose. And then it says install on this particular disk. It will delete all existing data. It's just a warning. It's going to format the drive. I'm going to choose yes. This backup installation logs to IX.io disabled by default. Sure, why not? And set username. I'm going to call my user DT. Let's set the DT password. It needs to be a strong and complicated password for privacy reasons. And then confirm the strong and complicated password. Enter the name of the computer, the host name of the computer. I'll call it instant dash vert. I think I misspelled vert, though. I can change the host name later if I really want to. Says edit advanced settings. Use only if you know what you're doing. So since they say edit only if you know what you're doing, I'll choose no. So they probably should have no be the default on that question if they really don't want people to actually go into the advanced settings. Then we get our summary screen and I go down here to continue. The installation will now begin. This could take a while. You can check install progress and logs by clicking on two in the top left. So we'll switch to a different workspace if we want to check the logs. I'll click OK. It says mounting partitions, getting a little echo area at the bottom where we get some information. And this is very cool. I really like the installer, their little custom installer that's essentially kind of like a a D menu script, right? Everything's just these D menu selections where you choose all of your options. And you know, it makes a lot of sense. I think something some of the installer programs on Linux, while they're very cool, things like the ubiquity installer that Ubuntu uses or the Calamari's installer that so many distributions use, like Manjaro, et cetera. You know, those are really cool programs, but honestly, a simple script for the most part will get the job done. And since they said I could check the logs of everything that's going on during the installation, if I want more feedback, I can go to workspace two. And of course, there's the terminal that's actually running all the commands, right? So that's your log essentially. I'll go back to workspace one. I'm assuming that it'll eventually tell me when the installation is complete here. These installations typically take about five to 10 minutes on my machine. So I'm going to step away for a few minutes. I'm going to go make me a cup of coffee and I'll be back once this portion of the installer has completed. And it looks like the installation has completed. That took maybe about 10 minutes or so. It says instant OS was installed successfully. Do we want to continue to use the live session? Or do we want to reboot now to complete an installation? You need to reboot the machine eventually. So let's go ahead and reboot and it reboots successfully. And we get this very nice customized grub menu with the instant OS theming and the colors and everything. That's really nice. I like the little splash screen as well. And it actually boots very fast. It says virtual machine detected. Would you like to switch to a 1080p resolution? Sure. This blur causes massive issues on virtual machine. So I guess their compositing has some blurring effects that won't look quite right in a VM, but that's fine. That's a minor thing that to be honest, I don't mind blurring being turned off anyway. So I get a little bit of information here on the bottom right. If I move my head and we get March, Sunday, that's interesting. It doesn't have the day of the week, so it just marches the month. But what's the day? Yeah, so that's kind of strange. I don't know if that's a virtual machine issue or not. It says super tab switches between your two most recent tags. So tags are workspaces, essentially DWM calls them tags, instant OS or the instant window manager here is essentially a fork of DWM. So they're calling them tags as well. So and it says press space to launch an application. So that's interesting. So let's press the space bar. OK, and then we get essentially D menu or I think they call it the instant menu. Right. It's their fork of a lot of the suckless stuff. And then from here, I mean, we could launch something like Firefox if it was installed and it looks like it is. So Firefox is the default browser here, but I don't really want to look at Firefox. Let's click this. So this is a little menu system. It says applications. So if I click on applications, once again, it launches their instant menu. So that's pretty cool. How do I get the menu from a key binding, though, the instant menu here? Let me just try some common key bindings that typically work in a lot of window managers, tiling window managers. So what would Super Enter do? Super Enter gets us quick info. So it opens the terminal with quick info for instant OS. It says instant OS is using the ST terminal, the suckless terminal. And because of this, some things work differently. Selecting text is done with a shift and left mouse. OK, so this is just information about the terminal here, but I don't really care about that. OK. So how do I close Super Shift C? I believe it's the default close key binding for DWM, but that doesn't work. How about Super X? Super X does something else about Super Q to quit. Yeah, Super Q. So now that I know that Super Enter gets a terminal, Super Q would close. Right. Well, is it always going to come up with that that little quick info thing every time I open a terminal? I have to click Don't Show Again. I clicked OK, but I need to do Don't Show Again. Now Super Q, Super Enter. And now I just get my terminal without getting that extra information about key bindings within the ST terminal. So if I do space again to get the run launcher, which I don't mind that key binding, that's a pretty cool key binding. I wonder, file managers, what are they using? PCManFM, is it here? What about Thunar? No. What are they using? Nautilus, maybe? They're using the Nautilus file manager, GNOME's file manager. That is interesting. So OK. So Super Shift Space toggles between our tiling mode and, I guess, a floating mode. So that's kind of cool, right? Yeah. And then Super Shift Space again gets us back into the tiling mode where you would typically get, you know, it looks like a grid layout by default. I thought maybe it would use like the standard master and stack that DWM defaults to, but it looks like by default. Yeah, it does them in a grid. And I just realized there is this icon here, this pound symbol, which I'm assuming that is meant to designate that we're in the grid layout. Oh, and if I click it, what did that just put us in? That put us in the master and stack. So you know what I bet earlier when I was hitting keys on the keyboard?  So there's a ton of default layouts. But somehow I ended up in that grid layout. I bet master and stack is, in fact, the default layout. But you can see when I toggle through them, you had about seven or eight different layouts including rows, columns. There was a monocle layout, your full screen window layout. Let me get back into this little menu here and go into applications. Of course, that's just D menu. So I'm not sure why I would ever click on this unless I want to get into something else. We have a hot link to the terminal, but Super Enter gets a terminal. There's really nothing in here I would ever need to come to unless I want to maybe use it as a system shutdown, like a session manager, like to log out and things like that. There is the settings here, which is neat. Opens this little D menu or instant menu. I should quit calling it D menu, instant menu here over on the right hand side of the screen with our system settings. So this would be like a GNOME settings manager itself. It's in a different kind of format right here inside this menu system. So that's pretty cool here. If I click on instant OS, let's see what instant OS settings are available. So we have our auto start script. So the programs that launch on auto start, we could edit that. I'm not gonna play with it on this video though. We have animations. So do we want animations? They're currently enabled, but we could turn them off. So that's cool. Because for me, I do like animations because they are neat effects. The window animations, when you're opening and closing windows, they're kind of cool, right? But are they necessary? Well, depending on the machine you're running, especially if you're running really old equipment, sometimes turning off those animations does save on a little CPU. One peculiar thing that I'm not crazy about is I just noticed that anytime I click the screen, it'll launch this instant menu. And that's cool, but I mean, you already have space for it. Why do I need the mouse to also do this? Because typically when you are launching a run launcher, like the menu or ROFI or instant menu or whatever it happens to be, you're actually going to type, right? This is not a graphical program. I mean, I guess I could click on something, but it's got 2,500 items available for you to choose, right? You're actually just gonna type a quick search for something and hit enter, right? So you're probably never going to use the mouse in that menu system. So why would you ever want to launch it with the mouse either? I probably, if I could disable the mouse doing that, I probably would because every time I want to do something on the screen with the mouse, it's going to annoy me that that menu comes up. Checking out some of the other key bindings that are available, SuperIN launches our file manager, the Nautilus file manager, right? SuperIN, they also have Ranger as an option for a file manager, SuperR launches Ranger inside the ST terminal. I probably would want a better file manager than Nautilus for a graphical file manager, Nautilus. It's not the greatest. This is kind of a strange choice. I'm not sure why they ended up going with Nautilus because there's so many fantastic file managers available on Linux. Some of the other standard key bindings, so would SuperH and SuperL resize? Yeah, so that's shrink and expand. If you're used to the Xmonad of terminology, they call that shrinking and expanding the windows. DWM calls it increasing and decreasing the width or something like that, I forget exactly. But SuperH and SuperL, so a lot of things are of course VIM key driven, right? So if I do a bunch of windows here, SuperJ moves down through the stack, right? Moves one direction, SuperK moves back up through the stack. You know, it just circles around the windows in the other direction. And then if I do a Super2, I go to Workspace2, Super3, Workspace3, Super1 takes me back to Workspace1, SuperShift2 takes the window that had focus and moved it to Workspace2. If I go to Workspace2, there's that window. Let me launch H-Top so we have something different running. If I go back to Super1, Workspace1, there's the other two terminal windows, Super2, SuperShift1, I'll send that window back to Super1, right, Workspace1 here. And then we'll just SuperQ to close all those windows. One thing I really like is I do love the branding with the wallpaper and the logo. Whoever did this wallpaper, that's a really nice job. I do also want to play with the widgets up here for example, that just launches the instant menu when I click on the date, that does the same thing. Yeah, so I thought maybe the widgets would actually have some different functionality but that they apparently do not. I'm gonna go back into the settings because I do want to play with appearance and wallpaper and let's browse the wallpapers. Just downloading wallpaper one, two, three, four, five, six, seven, eight. So this may take a few minutes. All right, and downloaded the wallpapers and then it immediately launched Nitrogen which is a wallpaper drawing program. So if I just click on one and hit apply and let me go to Workspace2 to see that wallpaper in action. Yeah, good looking wallpaper and check out some of the others. So that is the next in the list. I didn't mean to click on that. See, this is the problem with you clicking on the desktop always launching that menu. You're gonna have a lot of false positives. So let's hit apply on the next wallpaper. Yeah, that's not bad. Let's try some of the others. Try one of these darker wallpapers. I really like that. That would actually look really good with a light theme like a light colored panel and everything. Yeah, I really like that wallpaper. I think I'm gonna go with that one. I'm gonna go ahead and hit space on the keyboard to get our instant menu. Since they're using Nautilus it's so heavily tied to the GNOME desktop environment. I bet they're using a lot of other GNOME applications. So if I search for GNOME, yeah, we have GNOME font viewer and GNOME thumbnail font. So we don't have a ton of GNOME dash name of program kind of things installed. Are they using G at it? Yeah, so their text editor, plain text editor is G at it, which is okay. Again, not my favorite. Let's see what other common GNOME applications are there. There's events, which of course is the PDF viewer. Rhythm box would be the audio player if I could spell it right. But it doesn't look like it is installed. If I do a search for VLC, VLC is in here. Maybe they don't have a video player installed. Probably the easiest way for a program discovery here, since they don't have any kind of standard graphical menu that just lists like your .desktop files. I probably would just go to the terminal. I'm gonna zoom in here in the ST terminal and I'm gonna do a pacman dash q, capital q, lowercase q. If I do that it's gonna spit out all the programs that are installed on the system. What we wanna do is we wanna pipe that into lists. That way we start at the top of the list and now I can just hit space to go down the list. Just gonna quickly go through the list and shout out anything that seems like it's important. Looks like for the archive manager they're using in Grampa. It looks like Nano is installed for another terminal based text editor. So if you don't like G at it, you've got Nano as an option. I'm not a fan of Nano at all though. I find it very confusing to use. And Pycom of course is our compositor. We have pipe wire installed as well but pipe wire is also a standard on Arch Linux these days. It's being arch based. We have ripgrip Rofi. So maybe Rofi is what they're basing that menu system off of instead of a D menu. If I open a second terminal I do Rofi dash dash show run. Yeah, so this looks similar but it's definitely something a little different. Let me do dash show D run for just the desktop files. Oh, okay. And now this would be an easier way to actually search like your standard desktop applications without getting a list of almost 3000 binaries available on the system which is what D menu typically does. Customize look and feel. So would that be the LX appearance program? That would be. This is where we could change our GTK theme, colors, icon, mouse cursor, et cetera. Yeah, very cool, very cool. So this was just a very quick and cursory look at the latest release of Instant OS. This was Instant OS beta seven. And I gotta say I'm pretty impressed. This, you know, I could use this. There's a few little minor niggles to it that for me I would have to change. The only thing I would immediately have to change is the fact that clicking the mouse on the desktop launches a menu. I can't stand that because I would always be accidentally triggering that. So I'd have to disable that in some way.  Yeah, yeah, I'm a big fan. Now before I go, I need to thank a few special people. I need to thank the producers of the show. Gabe James Maxim, Matt Minut, Mitchell Paul, Roll West, Armored Dragon, Bash, Potato, Chuck, Commander, Angry, George, Lee, Methos, Nate, Erion, Paul, Peace, Archimdor, Polytech, Realities, for Los Red Prophet, Roland, Tools, Devler, and Willie, these guys, they're my hyster. Patrons over on Patreon without these guys. This quick look at Instant OS beta seven would not have been possible. The show's also brought to you by each and every one of these fine ladies and gentlemen. All these names you're seeing on the screen right now. These are all my supporters over on Patreon because I don't have any corporate sponsors. I'm sponsored by you guys, the community. If you want to support me, you wanna see more videos about Linux and Freon open source software, subscribe to Distro Tubo for on Patreon. All right guys, peace. When it opened Nautilus for a file manager, that hurt my heart a little bit.


Bismillahirrahmanirrahim. Wa-salaatu wa-salaamu ala-ashrafil mursalin. Sayyidina wa-nabiyyina Muhammadin wa-ala alihi wa sahbihi wa-salim. Ya Rabbana laka alhamdu kama yambagil l-jalal wa jihika wa-a'zim. Sultanic, Allahumma, allimna ma yamfauna wa-anfa'na bimaa al-lamtanayya. Rahm al-Rahimin. Today, insha'Allah, we will add to our collection one of the Quds-i Hadith that we have started with during this series. Our Hadith for today is Sayyidina Muhammad sallallahu alayhi wa sallam says Allah subhanahu wa ta'ala says Al ikhlasu sirrum min sirri, al ikhlasu sirrum min sirri istawdaatuhu qalba man ahbabtuhu min hibadih. Sincerity is one of my secrets that I interested to the heart of those of my servants whom I loved. Masha'Allah, Masha'Allah. Allah subhanahu wa ta'ala says in the Quran al-Kareem, he says wa-duhu mokhlesina lahuddin, and invoke him sincere to him in religion. So what is, let's start with understanding those words. So what is dua, wa-duhu? There is an order that we have to make dua. So what is dua? Dua is a request from someone who is unable to do something. So he goes to someone who is able to do that thing, the thing that he loves to do. If you are unable to do something and you dearly want to do that thing, you go to someone, you seek help from someone who is able to do it. And when you ask, when you invoke Allah subhanahu wa ta'ala, then do it sincerely. So have sincere in religion. So you do not think of any other reason or of any other way that might help you other than Allah subhanahu wa ta'ala. Just make sincere dua. Ask Allah subhanahu wa ta'ala sincerely. And Allah subhanahu wa ta'ala has promised us. I am close to you. I am not far. I'm close to you. If you ask, if you make a request, if you ask me for help, if you call me, then I will answer your call. So this issue of sincerity, you know, it's manifested clearly in our relationship to Allah subhanahu wa ta'ala. Why do we worship Allah? Is it to be of the winners on the day of judgment? No. Is it to get into paradise? No. Is it to avoid Hellfire? No. This is not why we worship Allah subhanahu wa ta'ala. So why do we worship Him? We worship Him just because He deserves to be worshipped and for no other reason. We do not associate any other reason for this with our intention.  So when we worship Allah subhanahu wa ta'ala, we worship Him sincerely. And our intention is just for the sake of Allah subhanahu wa ta'ala. Now what is sincerity? What is sincerity? Sincerity is to refine. It's to filter. And it is to have our intentions for the sake of Allah subhanahu wa ta'ala and only for Allah subhanahu wa ta'ala. So pure intention that does not have any riyah. It doesn't have any hypocrisy. Our intentions are pure for the sake of Allah subhanahu wa ta'ala. Allah subhanahu wa ta'ala says in Surah al-Zumar ayah 2, he says إن أنزلنا إليك الكتاب بالحق فعبد الله مخلصا له الدين. So indeed we have sent down to you the book. إن أنزلنا إليك الكتاب بالحق in truth. We've sent down to you the book in truth. So worship Allah subhanahu wa ta'ala. So be sincere to Him in religion. So sincerity is the core of everything. No hypocrisy. Pure intentions are only for the sake of Allah subhanahu wa ta'ala. When your actions are only for His sake, then Allah subhanahu wa ta'ala will give you everything.  So it eats the action that you are doing. Even if it is a good action, there will not be any reward for that action. For example, the one who pays sadaqah with the intention of showing off, or with the intention that people would label him as a generous person. His money will be accepted. The poor is going to take the money. They will enjoy the money. The money will be spent. But what will happen? What will happen to that person? He got what he aimed for. He got what he wanted for this dunya. So he is known amongst people that this is the generous person. This is what he wants to have. This is what he wants people to say about him, forgetting the day of judgment. So on the day of judgment, he will miss his reward. He will be called in front of Allah subhanahu wa ta'ala. And he will be told, you gave this sadaqah to so-and-so, on so-and-so date.  And he will say, oh Allah, yes, I did all that. And Allah will say to him, you did all that so that people will say you are generous, and they did. So you got your reward in dunya, but you missed the reward of the akhirah. So there is no reward for your actions, for your money that you gave in dunya. You will not get any reward for that in the akhirah, on the day of judgment. When the actions are being scaled in front of Allah subhanahu wa ta'ala. Because your actions, your intention for that action was not sincere for me, for Allah subhanahu wa ta'ala. So the real reward will be missed. On the day that each small reward, each small good deed will count.  But they had, during their life, they had bad manners. He would have asked this person, he hit that person. He killed someone. So the first one will take some of his good deeds. The second one would take some of his good deeds. The third one would get some of his deeds. So when his good deeds are done, there is no more good deeds, and there are still people who want their right on the day of judgment from that person. Then Allah subhanahu wa ta'ala would say, give him your bad deeds. He got no good deeds, and he is receiving the bad deeds of those whom he mistreated in dunya. So we have to pay attention. What are we doing in this dunya? We have to pay attention to the intention of our deeds. So associating another intention to that for the sake of Allah, so associating another attention to this intention will make people lose their reward on the day of judgment. But if the intention is just for the sake of Allah, then Allah subhanahu wa ta'ala will give abundantly. And when Allah subhanahu wa ta'ala gives, he will make it a great reward. He gives, he gives without any fear that his kingdom is going to be less or his reward is so much so that it will decrease what he has. So you will feel that you are getting closer to Allah subhanahu wa ta'ala when you do something and your intention is just pure for him, just pure for his sake. You will feel that you're bond with Allah subhanahu wa ta'ala gets stronger. And this is what we really need in this dunya. We want to be closer to Allah subhanahu wa ta'ala. Here's a story about sincerity. Once there was a fearful man. Everyone fears this person. He was so strong. He was so oppressive. He was a bad person.  And everyone tried to avoid him. One day, this same person completely changed. And he became a friend of Allah subhanahu wa ta'ala. Allah subhanahu wa ta'ala asked how this change happened. He said, he told the story and he said, I know the reason. So he said, once I was passing by the market. I saw a page of the Quran, just a paper of the Quran thrown on the street and people were passing over it. They were trusting it over it. And without noticing, of course. So they did not notice that this is a page of the Holy Quran. So seeing that I immediately bent down. I picked it up. It was dirty. I wiped it. I cleaned it. And I went to the perfume shop. And I bought a nice perfume. With the only one Durham that I had in my pocket. So I perfumed this page of Quran. And I put it on a high place that no one could pass over it. It will be safe on that high place. And he says, I swear that I heard a voice saying to me. I will bless your name because of what you did. And he was changed. He was changed from being a bad person to being a very good Muslim. And he became a friend, one of the friends of Allah SWT. What's the lesson of this story? The lesson of this story is that do not belittle any sincere action. No matter how small it is. So this man has honored a torn page of the Quran. He would not accept someone to step over this page of the Quran. So as a result to honoring the page of the Holy Book, Allah SWT honored him. And everyone started to love him. The reward of Allah is amazing. So again, the lesson is do not belittle any sincere action. No matter how small it is. But similarly, never ever belittle any sin. Never, never say that this is a small sin. I will do it, it's okay. And then I will make soba. I will make it so far. No. Don't ever cross that line. A sin is a sin. No matter how small or big that sin is. So imagine that you died while you are sinning. Then when you will be resurrected on the day of judgment, you will be resurrected doing the last action that you have been doing in this dunya. So you are sinning, then you will be resurrected sinning. No. Never belittle a sin. Never. But always remember, always look at the one whom you disobeyed. Allah SWT said don't do this thing. This is a sin. And you did it. You disobeyed Allah SWT. You obeyed Shaytan? No. This is not what we are in this dunya for. We don't want Shaytan to be happy. We don't want to disobey Allah SWT. We want Allah SWT to be pleased with us. When he is pleased with us in this dunya, he will be pleased with us on the day of judgment. We are all going back to Allah. We are all going to stand before him. And he will justly judge all our deeds or our actions. What are we doing in this dunya? What are we looking at in this dunya? Where are we going? Where are we heading? What are we doing with our hands, our ears, our eyes? Are we with our tongue? Are we using all these organs or these parts of our body to obey Allah SWT? Or to disobey him? Allah gave us the eyes and he said, do not look at things that are not lawful, that are haram. He gave us a blessing, so we have to understand. We have to obey Allah. He said, do not go to these places. Then we have to listen to Allah. We have to obey Allah SWT. On the day of judgment, no one is better than another person except by righteous deeds. And those righteous deeds are all pure. They are all special. They are all for the sake of Allah SWT. It might be that same one action for two different people. It might be highly rewarded for and the other one is not accepted. It all depends on the intention. It all depends on the sincerity of the intention. Sayyidina Muhammad SAW said, إِنَّ مَا الْأَعْمَالُ بِالْنِيَّاتِ وَإِنَّ مَا لِكُلْ يِنْرِيْ إِنْ مَا نَوَا So actions are by their intentions. So all actions will be scaled according to their intention. So have sincerity with all your intentions. Even if you are doing something, a routine thing, do it with the intention of pleasing Allah SWT.  Just have an intention with that. So the action will be changed to a worship, an action of worship to Allah SWT. Now what makes a person have good intention and sincerity in their actions? It is fearing Allah SWT. It is loving Allah SWT. It is keeping in mind that Allah SWT is with us. He is over watching us. He is looking at us. Do we want Allah SWT to see us singing? No. Do we want Allah SWT to see us obeying Him? Of course. So Allah is over watching. So we want Him to be pleased with us. It is the same if someone is present watching a person doing his job or not. So if someone at work, when the bus is around, then he is so careful. He does his job completely on the spot. He is very accurate. But when the bus is absent, he doesn't. He is not as sincere as he is when the bus is around. But always remember that Allah is there. Allah is with us. So we have to perfect our actions. We have to try to be as good as we can. Now moving to the second part of the Hadith. We talked about sincerity. We talked about the secret that Allah SWT has. And what does he do with it? So I entrusted it to the heart of those of my servants whom I loved. What is this secret? It's in the heart. Which heart? The good heart. The sound heart. Not the heart that is filled with dunya, with loving, this vanishing life. No. It's the heart that is filled with loving Allah SWT. With loving Sayyidina Muhammad SAW. It's a pure heart. So with this heart, we want to have a sound heart. So to meet Allah SWT on the day of judgment without any fears. So sincerity is one of my secrets. It's one of Allah's secrets. That he has entrusted to the heart of those of my servants whom I loved. So what is that? How is that happening? It's in the heart. In the heart. So our heart should have only the love of Allah and the love of his messenger. It should be a sound heart so that we will be saved on the day of judgment. If our heart is clean and we clean our heart by doing istaghfar, we know that we all sin. But the eraser for that sin in the heart is just to do istaghfar. Astaghfirullah. Astaghfirullah. We have a few minutes with Allah SWT to ask him for forgiveness. Have a sincere tawba and ask Allah SWT for forgiveness. And again, Allah is over watching. Allah is with us. He is listening to us. When you want to talk to someone and you don't feel that there is someone who deserves to listen to you. Or there is no one who is wise enough to help you, who is dependable to give an advice. Then turn to Allah SWT. Do not waste your time. Go directly to Allah SWT. He is listening. He is waiting to hear your voice and Allah loves to hear the voice of those whom he loves. So this sincerity is a secret that Allah SWT has put in the heart of those servants whom he loves. So we want to be loved by Allah SWT. So what is love? Who are those servants that Allah SWT loves? Those are the people whose Allah blesses in dunya and in akhirah. Those are the people whom Allah SWT blesses in this dunya and in the akhirah. Bounties of Allah SWT will be with them in this dunya and in the akhirah and the day after and the life after. Those are the servants of Allah SWT whom he loves. And this love relationship between Allah SWT and his servant is mutual. So it's from both ends. And it is known that love cannot be from one end. It should be from both ends so that everything will go smoothly. So that everyone will be happy with the other person. Now what leads to this love relationship? How can we have this love relationship with Allah SWT? We can follow several things and the first one is it's loving Allah SWT and loving those whom he loves.  This is why we say Nurum Min Nurillah. Ya Allah we ask you for light of your light. We ask you for this special blessing ya Allah. So the first thing that leads to the love relationship between us and Allah SWT is to have Allah in the center of our hearts. And is to love those who love Allah SWT and whom Allah SWT loves. So this is very important. Loving Allah SWT. Loving the people of Allah SWT whom if you look at their faces they will remind you of Allah SWT.  When they give advice, this advice elevates you.  Those are the friends of Allah SWT. So another way of this love relationship between us and Allah SWT is connecting to Allah SWT by reading his words. By reading the Holy Quran. By understanding the means of the words of Allah SWT. And when we understand the words of Allah, we have to apply them in our daily lives. So when Allah SWT loves someone, he sends them his blessing. He sends them divine help, divine support. He knows everything and he knows who deserves to be rewarded. So those are the people who are loved by Allah SWT. So sincerity is a secret. Again, we say the definition of sincerity. It's a secret that Allah SWT has put in the heart of those whom he loves. And who is the most loved by Allah SWT? He is loved by Allah SWT to the degree that his name accompanies Allah's name. When we hear the adhan, the person who is calling the adhan says, I bear witness that Allah is the only God that Muhammad is his messenger. So the name of Allah SWT is combined with the name of Sayyidina Muhammad SAW. The name of his Habib, the name of the person whom he loves. And Adam SAW realized how much Allah SWT loves Sayyidina Muhammad SAW. So when he was begging Allah SWT for forgiveness after eating from the tree, he said to Allah SWT, I ask Allah to forgive me for the sake of your beloved Muhammad. How is this happening? So he said, he is the first person to be created. So how was he asking Allah SWT to forgive him for the sake of someone who is not born? And Allah SWT asked him, how did you know that I love Muhammad? How did you know that? And Sayyidina Adam SAW said, he replied to Allah SWT and he said to him, His name, when I was making dua, when I was with you, I looked up at the throne and I found his name is written with your name on the throne. And if you don't love him that much, you wouldn't have written his name. You wouldn't have combined his name to your name. So again, we have to have sincerity in all our actions. I want to tell you a story of someone who was sincere and who asked Allah SWT sincerely and how Allah SWT fulfilled his request. Someone was saying, work, but my salary is so little. It's not, it's a few terms here and there. And I have so, I have borrowed money from so many people. I have so many debts. And when I get my salary, it won't be just, it won't be enough till the end of the month. So I have to borrow from other people. And I have to borrow from here and there. I have to get money from this person and that person. So he said, leave that, I will live like this until I died, until I die. I was happy with my wife and she understands the situation that we are in and she's a very good wife. But these debts that I have are a big burden for us. So one day I visited some of my friends. And one of them was exactly the same way as I am in. So he told him. He knows about his friend. And when his friends just opened his mouth to talk, to talk about the situation about how much the salary is so little and it is not enough till the end of the month and how he borrows every now and then. He said, I'm going to tell you something that happens to me. Just take a little bit of your salary and give it to Sadaqa. Give it to people who are less fortunate than you are than yourself. So he advised him just to pay Sadaqa. So when he went back to his wife, he told her what happened with his friend.  Why you don't just try it? Maybe Allah SWT will reward us abundantly. And she knows that Allah SWT will reward them. So she urged her husband to pay Sadaqa to take some of his salary to pay Sadaqa. So he said, okay, I'm going to assign this much of money every month I will pay a Sadaqa. And that person said, I swear that no little time, just a very little time passed and I noticed change. And that change was in myself. I became a little bit at ease. I became pessimistic. I became the optimist. So even though I had so much debts, but I got relaxed. And it was only two months that my life was started to be organized again. And my salary, even though it is very little, but it started to have barakah. It started to be blessed. So I didn't notice that earlier. And he immediately knows that this is the blessing of the Sadaqa that he is paying every month now. So Allah is helping him. Allah is rewarding him. And he calculating the blessings, calculating the extra amount of money that he has because of the reward of Sadaqa, then he was sure that it won't be a long time and all his debts will be paid off. So later on, he was talking to one of his relatives and he got into a little bit into real estate with him. So he started to send some clients for him. And for each client that would buy something from them or rent something, then he will get some benefit from that. And Allah, he said, in no time, I started to feel how the reward, how the blessings, and I started to save some money now. I started to do so many different things, even though they are little, but all of them are successful. He had complete trust in Allah Subhanahu Wa Ta'ala. He knew that Allah Subhanahu Wa Ta'ala is rewarding multiple times when he is going to pay this Sadaqa. So do not, again, do not belittle the any small deed that is pleasing to Allah Subhanahu Wa Ta'ala. So we ask Allah Subhanahu Wa Ta'ala to make us of those servants whom he loves. We ask Allah Subhanahu Wa Ta'ala to entrust love in our hearts, and to make our hearts shine so that they would accept the light of Allah Subhanahu Wa Ta'ala, of Sayyidina Muhammad ﷺ, of the Holy Quran. So our hearts will become sound hearts. That we will meet Allah Subhanahu Wa Ta'ala with a sound heart. So we ask Allah Subhanahu Wa Ta'ala to bless us. We ask Allah Subhanahu Wa Ta'ala to make us of those whom he loves. We ask Allah Subhanahu Wa Ta'ala to highly reward us. He's there. He's hearing us. And he is the most dear. We just need to ask him. So ya Allah, we are asking you to bless us. Ya Allah, you are listening to us. You know that each one of us has their own issues. So we ask you, ya Allah Subhanahu Wa Ta'ala, to help us all. And with this, we come to our, to today's session. And we have one more session next week, insha'Allah. And that would be the last session to end up this series, insha'Allah. Wa salli Allahumma ala Sayyidina Muhammad wa ala alim wa sahbihi wa salim. Ya Rabbana laka alhamdu kama yambagi l-jalali wa jihika wa adhimi sultanik. Wa al-sanaat wa al-sanaamu ala al-habib al-a'zam. Sayyidina Muhammad, sallallahu alayhi wa sallam. Wa al-sanaamu alaykum wa rahmatullahi wa barakatuh.


My lecture today as I announced yesterday will be devoted to this basis reduction. The role that is placed in my series of lectures is that let this basis reduction is very helpful to do what I will mostly be doing on Thursday which is called linear algebra over see and if I say linear algebra over see that I mean computations with finitely generated a billion groups and those will in our application often be the additive groups of orders in number fields, their ideals and also their residue class. What that is basis reduction does for you is that it helps keep the numbers small in the course of those algorithms which is one of the major problems that one has to address in this area. Let me start by telling you what a let this is, and there are two definitions that are often used and the first makes use of the concept that you must know from linear algebra, and that is the concept over your period vector space and Euclidean vector space is by definition, the finite dimensional FD means finite dimensional vector space VS means vector space over R and R means the reals. And such a vector space to be equipped. We call this vector space E, E for Euclidean equipped with an inner product. And an inner product as you may recall from linear algebra. The map from E times E to the reals and this map should be by linear over the reals so if you fix one of the variables, it is linear in as a function of your variable. It should be symmetric. X comma Y is Y comma X, and it should be positive definite, which means that X comma X, the inner product of X with itself is strictly positive. X is non zero vector in my vector space. And if you have such a vector space, then it has a metric. So then this E has metric, the distance from X to Y being by definition. The square root of the inner product of the difference with itself. And that is indeed a metric it satisfies the triangle inequality there's only zero X is equal to Y. And that metric also gives you two columns. The Euclidean vector spaces that we will encounter are typically just RN with the usual inner product. And it is a theorem from linear algebra that every Euclidean vector space is actually isomorphic to a unique such RN, including the metric. So that is a Euclidean vector space. And once you have the notion of Euclidean vector space, then let this is defined to be the first definition is a discrete subgroup capital L. So we call it of Euclidean, E, V, S, E, V, S means Euclidean vector space. And often one restricts this Euclidean vector space to be in the space, the sub vector space is spent by L itself. So if, so if you call this E this vector space, then we say L is full rank in E and that will often be decently assumed if R spans, if L spends E over R so RL is by definition the real vector space, spent by L and you may as well make E a bit smaller, if that is not already equal to E. And it is an elementary theorem to show that every lattice is as a group, a free Aberian group is morphic to Z to the N, where N is finite and is a non-negative integer. So the rank of L, it is at most the dimension of E and it will be equal to the dimension of E in the case of full rank. So that is the first definition. And this first definition also comes with a natural way of representing. So first of all, a lattice, how do you input a lattice, how do you specify a lattice, how do you output a lattice into an algorithm. Well, you just write down Euclidean vector space for example just R and, and you list a set of linearly independent vectors in there and then L will be the subgroup generated by those vectors and elements of L likewise represented as vectors in E in order to make this all meaningful in the context of algorithms, it is natural to require that L is just sitting in your E, which you often present SRN, but actually that is sitting in QN. So in the, that the coordinates of all elements of L are rational numbers, and if you drive out a denominator which you often can do without changing any of your problems, you often take it inside the ZN. And then an element of L is simply represented as an n tuple of integers, the inner product of two elements being the traditional inner product. That is the first definition, and it is rise to the first possibility of specifying those lenses. And then I will typically be using, I will not start with Euclidean vector space, I will just look at finally generate the medium group so let me give you a second definition, which is equivalent to the first one. And then in the following, the lattice is a finally generated FG means finally generated free the B with your group so that means isomorphic to ZN, and let's call it L, and it comes with some extra structure, equipped with a map that I write in the same way. So two variables, both ranging over L and this map that should be well symmetric again x, y is the same as y, x, it should be bilinear but not over the reals because L is not a real vector space, but by linear over the integers. And if you fix one of the arguments, then the map as a function of the other argument will be an additive group homomorphism symmetric and bilinear, such that there is one more property, namely, that there is a positive real strictly positive, such that for all x in L, except the zero element, the inner product of x with itself for which I will often write q of x q because it is a credit function is at least R. And this reflects the discreetness requirement in the other definition of all that is. This is often the way that we consider lattices. And before I get into the way of representing a lattice in this sense let me tell you in what way these two definitions are equivalent it is clear that if you have such a discrete subgroup. Then, well, as I told you it is fine to generate it free. And if you restrict the inner product on E to L then you'll get a map satisfy all of these conditions and conversely bonds you have a lattice in the second sense, then you can take E to be the terms of product of L with the real which is a real vector space, which has a basis over the real which is equal to some basis of L over Z. The real product by linearly to E times E, you sit down and you prove that E is indeed that little product, a Euclidean vector space, and then actually L is embedded into it. In the sense that I mentioned here, it has full rank rank of L over Z is the dimension of E over the real. And this gives rise to a different way of representing the elements of L, which is a little bit closer to the way I am going to apply lattice basis reduction. This is as follows, you start from L being a free william group, so you may as well say that L is Z to the end itself. So the vectors of L the elements of L are represented by the coefficient vector on some basis of L over Z. You should not think of course that the inner product is the traditional one. So you also have to write down to the ground matrix, as it is called ground was a Danish actuarial mathematician who lived from, let me say, in 1962, 1916, and when he was 65 years of age, he walked to a meeting of the Danish Academy of Science, he was hit by a bicycle, and he died. So this is the claim to fame of ground the ground matrix, and this ground matrix is simply the matrix it's a symmetric matrix of inner products and I call the basis vectors, I call be I so be I is the element of L that here corresponds to the standard. The basis vectors of Z to the end, and if I and J range from one to N, you'll get here, the matrix of real numbers, the inner products, and those inner products because of the by linearity determine the entire inner product. And then, if you want this matrix of inner products to really define a lattice, it should be a symmetric matrix, and it should be positive definite. And for algorithmic purposes, it should have rational entries and often we will simply assume that it has integer entries. And then the way we are going to apply this in the context of linear algebra over Z is well here you have the type of objects busy to the end that you want to work with when you do linear algebra over Z, and then you have a certain problem that you want to solve concerning problems and co kernels and several other types of problems and then what you do is that you encode your inner product that you that you encode your problem in terms of the inner product so that the properties that you are after are can be determined, can be expressed by having a little bit for example a small norm I will give examples of this is not later today, then at least on Thursday. So, and in this case the elements of L, a simply integer vectors. Those are the two definitions, and it does for the rest of what I have to say today, not make much difference, which ones you prefer, but, as I mentioned that my preference is in general, the second. So, let me tell you a few basic properties. So this is first of all, I have to define for you the determinant of a lattice and the determinant of a lattice. So I have to go to D of L, and that is the determinant of L that is defined by taking a basis of L over Z, and write down this ground matrix of inner products, which is a symmetric positive definite matrix to take its determinant positive real number, and then you take the square root. And you take the square root, because that is what has a nice interpretation, if you take, if you and that is L in this vector space as a subgroup of full rank. And then you have because whatever inner product you have a natural volume for there and you can divide by L that gives you a compact topological group, which inherits a measure from the measure E, and the volume of that group. You can interpret as the volume of a parallelepid that is spanned by the basis vector that volume with the square root of that determined, and that is independent of the choice of the basis as is already clear from this expression. The purpose is, we will never take that square root, because when we do computations as I mentioned, this will be a determinant will be a rational number or even an integer, and there is no reason that the square root will also be a rational number of linters when you do computations with the determinant, you just use the square of the determinant that will always be sufficient. As I mentioned, you can have several basis of the same lattice you can apply a whole matrix, an invertible integer matrix and by end to such a basis to get another basis. What lattice basis reduction does for you is that it makes a particularly pleasant basis and pleasant as several definitions, and I will give one that is appropriate for the reduction algorithm I will talk about, but roughly speaking, such a basis will be pleasant. If the vectors in that basis are relatively short, that they are maybe not quite orthogonal to each other, orthogonal means in a product hero pair wise, but at least that they have small in a product. Then when you have a basis satisfying those conditions, then you can solve several problems as I will make clean. And the way in which you find a reduced basis, a basis that is reduced in the center of having those nice properties is that you start from an arbitrary basis, for example the standard basis of Zm, and you start cleaning it up so to speak. So you try to make them, for example, orthogonal. And that is done by the technique that depends on the grand suite of organization process that you may know from linear algebra, and that proceeds as follows. So, you start here from any basis which is the same as saying sequence of linearly independent vectors in some nuclear vector space. So, B1, B2, through Bn, they are sitting in my nuclear vector space and they generate my lattice if you like, but the lattice will for the moment, not play much overall, but we do want them to be linearly independent over the materials so that they generate as a group, the lattice, and then you define an optimization which you call B1 star, B2 star, through Bn star and they also lie in E. In fact, they lie in the space, spanned by the beat, and you also define real numbers, Uij, they are sitting in the reels, here the Uij, they range over all i and j, where j is less than i, and the definition just follows. So, what is B1 star is actually just B1. In general, Bi star is Bi minus a contribution coming from the smaller B stars. In general, there are no smaller ones and then this sum, whatever it is, is going to be empty, so B1 star is B1, but in general you have these coefficients that you use to subtract previous Bj stars. So what are these news? Well, these news, they are engineered in such a manner that all these Bi stars are pairwise orthogonal, and that is what you may have seen also in linear algebra, that is what you achieve by taking Bj to be the inner product of Bj Bi with Bj star and you divide it by the inner product of Bj star with itself. Let me, in case you have never seen it, try to draw a picture of what is happening here, so suppose that I have here a two-dimensional plane, this blackboard, and we have here B1, and we have here, for example, B2, and they are linearly independent. And then, if you orthogonalize them, then you want to subtract from B2 a multiple of B1 so that it becomes orthogonal. So if you take this projection, then you find here the mu21 B1, that is this vector, and here you find the B2 star. mu21 is the ratio of this length to the length of B1, which looks as if it is about three quarters. And if you now add a third vector, let's say that this is a vector perpendicular to your screen, then we can, for example, do something like this. Here we have B3, so that is in front of the blackboard, and yeah, in fact, I don't know whether you can see this, but your screen is of course two-dimensional. My blackboard is a three-dimensional blackboard, and this arrow I drew perpendicular to the blackboard, and B3 has also this distance to the blackboard. You have here the, you have here, the vector that you get by projecting B3 to the plane that is orthogonal to B1. So this vector there, that is B3 minus mu31 B1 or B1 star. B3 will be B3 star, which you get from by subtracting from this element, so this element is also equal to B3 star plus mu32 B2 star. So if you first project it orthogonal to B1, then you project it also orthogonal to B2, and this is your B2 star. In the news, they are always the ratios of the vectors that you subtract to the length of the corresponding B1 star. B2 is about minus three quarters, it points in that direction, whereas the mu32 will be about, well, I think it is about three, mu32 is about plus three. So that is what is happening here, and you see that each BI star is the component of BI that is orthogonal to the space spanned by the previous Bs. The previous Bs, that is the, that is this space, Bj star, which happens to be the same as the same space, without the stars. So that is orthogonalization, and if you perform it, then you end up with a set of orthogonal vectors, but even if those inner products are integers, that does not mean that those mu's are integers. So there is no reason whatsoever that the group, the additive group generated by the Bs will be unchanged under this operation. So that is something that we have to pay attention to. What one can show here, that is, first of all, that if you take this, this, this, these ground matrices, so maybe what I do is the following. Suppose that I take Li to be the lattice of rank i generated by the first iBs, so L0 is just a zero group, L1 is just the group generated by B1, and Ln will be L itself. If you start it, then you get a, in general, a different lattice, oh I see that I made typo here, this R should be a Z. The lattice is generated by the B over Z, and I do the same thing with the BI star. So, you see that if you look at this two dimensional plane again, then my original L will consist of these points, this B1 and B2, and you have these things. As the new lattice will be shifted a bit so that they'll be generated by this element and that element so that is really a rectangular, rectangular lattice, whereas the other one has an angle. This is the case that if you compute the determinants of those lattices, then they are the same, so the determinant of Li will be the determinant of Li star, and what is also the case, because this Li star has basis of orthogonal vectors, the Gram matrix will be diagonal matrix, any two different BI stars are orthogonal to each other, so that means that you can conclude from what I am saying here, that the length of this BI star, is the square length actually, the inner product of BI star with itself is actually the determinant, the quotient of the two determinants of two successive lattices which you both square. And that already gives rise to several interesting inequalities. For example, it is quite clear, this BI is equal to the BI star plus some error term you might call, so you see that this is at most QBI. The product of these inequalities between positive real numbers over all I, and you use the fact that L and L star have the same determinant, and you see that the DL square is at most the product, which will be equal to the product of the QBI star, and it is at most the product of the QBI, that is called Hadamard's inequality, which is a very useful inequality, if you want to do estimations as you have to do when you prove that certain algorithms are running in polynomial time. Many of these things I am forgoing the proof of, and that is because they are first of all quite elementary and easy, and secondly, most of them, you can find in the notes, and if you cannot find them in the notes, then they are even too trivial for the notes, in which case you find them in the exercises of the notes. So those are the, that is the Gram-Smetall's organization, and using these BI star, I can define when I call a basis reduced, and that is what we are after. So let me erase these inequalities, and z basis for my basis for lettuces are always understood to be z basis, b1 through bn for lettuce L is called reduced, if two conditions are satisfied, the first is that for all i less than n, if you look at these Gram-Smetall's organizations, then the lengths, well, you really like these lengths to form an increasing function of i. So I would really love to be able to require this, that this is true, but I cannot really do this because such a basis may seem to not exist, and you have to allow a certain slack here, and the easiest choice is just a half. So number two can be replaced by any number that is at least four thirds, and in fact you can make it into a parameter as it has been done in the notes, but I will just stick to the number two, one over two, and then secondly, we have that for all j less than i, we want those in those real numbers, to be no more than a half in absolute value. That is what I call a reduced basis, and what lattice basis reduction does for you is that it starts from any basis for your lattice, and it changes it into a reduced basis. And before I tell you the essential mechanism behind that algorithm, let me tell you a first few properties, good properties of reduced basis, so that you have some motivation to actually determine that. And one of them is, and I think most of those are again exercises in the notes or maybe truth in the notes. So if B1 through BN is a reduced basis. Then the first property is that B1 is pretty short. I would love to be able to say that it is the shortest non zero vector of L, but that is not quite true, but it is at most two to the n minus one times as long as the shortest non zero So this is what I am claiming here, if you take L not to be the zero that is then each vector that is non zero is at least as long as your B1 and divided by this unfortunately somewhat exponential factor. So one of the surprises of the whole theory is that we will see many of these exponential factors and many applications don't seem to be bothered by that, even though you would really find prefer to find a better approximation. This is already for many applications. Good enough. This is for the shortest vector. You can also look for what people might think of as the next shortest factor that has to be defined with some care I refer to the note that you'll get a so called successive minimum. But let me not talk about those. What is also true is that the QBI are not much longer than their stars. So, as I told you a moment ago, QBI star was no more than QBI and in fact they are comparable size. So it also means that with a reduced basis, this Hadamard inequality, which I told you this had a marine equality, the product of the QBI. This is true for any basis, but if you take a reduced basis, and you have actually an opposite inequality, which will get by multiplying out this one overall I and then you'll get something like I think two to the power n times and minus one over two. So you see that in this sense these QB these factors bi are almost optimal. So the quality in Hadamard, even only if all the bi coincide with the bi stars for the day are all. Okay, let me tell you one more good property of reduced basis, which is not about finding short vectors in the lattice itself, but finding short vectors in a coset of the lattice, and that goes as follows. So I take f to be the following set. So I take the sum from i is one to n. And then I look at my vector space, where everything is lying the bi star are orthogonal basis for a certain subspace in there. The whole space in the full rank case, and now we allow not into the coefficients or real coefficient we allow coefficients from minus a half to plus a half. And this is the F that F means fundamental domain and that is because if you include F in E. E to L to be a full rank that the full rank case. And you take this course mod out by L. Then you have here a bijective map in other words, each element of E. You have each x in E, you have a unique pair y comma z with y in F and Z in L such that x is y plus Z. So, if you are given an element in the vector space. Then you like to round it to a lattice factor you like to find a lattice vector the Z in this case. So that is a good approximation to X in the sense that why is small, and why it does look small because it lies in F, and all these coefficients of F, they are small. The good property of reduced basis is that this is in a sense close to best possible, and that is the following that if that. So, if the basis is reduced, then you have that is q y is again up to an exponential factor it is two to the n minus one, in this case, times the distance, the square distance of x to the lattice. That is the minimum of all square lengths of X minus W, where W ranges over the lattice, and you really like to make this small, and you see that up to this factor, you are managing pretty well all this is due to the basis being reduced. And you will see plenty of other good properties of reduced basic so what I hope that this serves as sufficiently strong information for you to be interested in knowing how you make such a business. This is done by lattice basis reduction algorithm and the most popular one. It's listens to the name lll look because it evolves three let this is that proceeds as follows. So, so the theorem is that there exists a PTA and that is as you may recall from yesterday PTA means the polynomial time algorithm maybe I should buy from this a polynomial time algorithm that is all input the lattice, and I told you how to get the lattice and elements of the lattice in particular basis produces that means out to reduce basis for the same lattice. I'm not going to tell you the total proof of this but I will give you a sketch of the algorithm, and that is as follows well you are given a basis already because in every way which I told you couldn't let this, it comes with a basis. So be one. And is given basis, but I am going to change it. And what I do first is that I test these conditions. And let me first look at the second condition. So, if J is less than I, and this new I J is greater than half. If you find such a pair, then you can decide to do something about it. And then replace the basis vector by itself, from which you subtract an integer multiple of the J basis vector and that in terms of multiple, you get by taking this number new I J, and you round it to a nearest integer. If you look at the definition of the news, you will see that this particular new by this process will be replaced by itself minus that rounding, so the new new I J will be at most a half. A step that you can take. And it is not so very difficult to show it may be the subject of an exercise. And if you keep doing this, then at a certain moment, this second condition will be satisfied in the notes this condition I think is called a Garm's meet reduced for the days. And of course, if there are several pairs well then you have a choice there's a certain strategy that you can follow which I don't want to say anything about the second that may happen is that you find that this inequality is violated. So QB, I plus one star is actually quite short, compared to Q of BI star. In this case, I want you to act only if the corresponding new has indeed been taken care of that this new is at most a half. And the picture that you should think of here is that you have here is BI star. And here you have the BI plus one star, and then you have a new that is between minus a half and plus a half. This is about a third, let's say, and then here you have this vector, which is be I plus one star plus the new times the BI star, which is the projection of BI plus one. This is similar to the sum of the smaller BJs, this is the J's that are strictly smaller than either. So, if you project be I and be I plus one orthogonal to this. If I minus one dimensional space that BI maps here, be I plus one maps there. And if I have organized the I plus one also with respect to the iPhone, it goes there. You see that if this distance is at most one over square root two times the other distance that is what I have here, and this number is no more than a half. Then, what you can do you swap be I and be I plus one. The reason that you do this is that it enables you to make an improvement, because then, if I look at the queue of the new BI star. So that is the new BI is BI plus one. And the new BI star is the projection of that one to this plane so that will be this new one will be exactly the vector. And that I wrote down here this is the old BI star, BI plus one star plus the corresponding new times the BI star, you see that these are orthogonal. So this is the same as the queue of BI plus one star plus the square of new square of the new times the queue of BI star, and that is at most. Now this is actually strictly less than half times the old QBI star, and that is a quarter, so that gives you the half plus a quarter, which is three quarters times the queue BI star. So if I make this swap, then it is very easy to see that all the BJ star unchanged except the BI star and the BI star, the new BI star will be the square length will be at most three quarters of the square length of BI star. And that is really a big improvement because that means that every time that you apply this second step, then the product of all these determinants that I mentioned, let's take the squares that this quality for I is one to N that it is gets changed by a factor three quarters or less. So that means that this number which has a, if you think of it as an integer, it has some lower bound that means that you cannot apply this step too often. And that means that after a number of steps that can be bounded in a good manner, you will find that you produce a reduced base. Okay, so that is a outline of the latest basis reduction algorithm, you do have to be a bit more careful in specifying which choices you make before you can prove this is polynomial time, but I will just be happy if you consult the literature about this and then I will just take this result for granted. The day after tomorrow, I will tell you how to use this in order to solve all sorts of problems in linear algebra over the integers. Okay, I thank you for your attention. Okay, thank you. Are there other questions. So no questions. It's something frozen on your end or we're, I mean, we don't see either of you anymore. And we see, I just see, don't forget the name. Can you hear us. Yes, now and now I can see and hear you. Okay, I think we had a freeze but I guess it's the best time to have freeze in this lecture.  Actually, there was another thing I had to say namely congratulate you with your birthday. Happy birthday, Bjorn. Oh, thank you. Okay. All right, well that wasn't a question, but are there other questions. Well the question may be what age you are getting. No, that's not the kind of question we're asking for here. Okay, private. No, it's not very private. I mean, I think you can find it on Wikipedia, but I don't know. All right, so either. So I guess. So there are some questions I think in the chat perhaps. Let's see. So there's some question there's some questions about why, why the one half liked why the constants in the in the definition of reduced basis why why use the constants one half. No question that it had, you can replace it by any number. At most three quarters right you don't want this number to be getting beyond one. You want there to be some improvement. So if you replace a half by two thirds, that is still fine as long as the sum is less than one. So if you really push it to the limits that the half becomes three quarters, then you get a one year, and then the only improvement is sitting in the in strict inequality side and that means that this integer is an integer. It does decrease but not very quickly. So what people often do is that rather than take the number like to you take any parameter that you may choose yourself that is at least four thirds so that the inverse is at most three quarters. And then yeah, then I think it is up to you but I just for simplicity, picked the number two which is the easiest rational number to write down that is greater than four thirds there's the smallest height. Okay, good. So, let's see, are there other, I think, I'm not sure if there are other specific questions that people want to ask. Please feel free to unmute yourself and ask if you have a, if you have a question that was not. I have a question actually if you do take two three quarters is it still polynomial time. The proof breaks down but maybe it is polynomial time for some other reason I think that is actually an open problem in dimension to actually in fixed dimension I do think it is polynomial time. If you have to want to have fun to think about, well, that's an interesting question to replace a half by three quarters. Is there a polynomial time variant of this algorithm. Okay. Okay, but I won't push it. Okay. Any more. Okay, there's a question is there a notion of reduced basis for infant dimensional lattices. Yeah, well that is a good question. I think it's called Hubert lattices. And I think we have been doing a lot with them, especially Dan, who is doing the problem workshop. But I do not think that lattice basis reduction is one of the subjects that we covered there. So there is the notion of a Hubert lattice which is a discrete subgroup of a human space. And here's another open problem is any Hubert lattice free as an abelian group. Open problem. Make yourself famous solve my problems. They are so they are actually what is called almost free an abelian group is almost free by definition if every countable subgroup is free. Okay, so this is only a question for uncountable, uncountable dimension. Yeah, correct. Yes. Okay, the rank of lattice is equal to the orthogonal dimension of the Hubert space that it spans. Okay, so orthogonal dimension, because I guess they I guess that the actual dimension is. Yeah, when you talk about basis of Hilbert space it's not a basis. Yeah, it's not everything is a linear combination but it is a infant linear combination. Yeah, okay. So, and those things also occur in algebraic number theory, but that will take another 50 minutes to explain. Okay, so some other summer school. Okay, any other questions. No, no, no, no, the next the next event. Okay, so thank you again. First of all,